2013 IEEE 54th Annual Symposium on Foundations of Computer Science

26-29 Oct. 2013

Filter Results

Displaying Results 1 - 25 of 91
  • Cover Art

    Publication Year: 2013, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (1397 KB)
    Freely Available from IEEE
  • Title Page i

    Publication Year: 2013, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • Title Page iii

    Publication Year: 2013, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (179 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2013, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (365 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2013, Page(s):v - xi
    Request permission for commercial reuse | PDF file iconPDF (127 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2013, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (184 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee and Sponsors

    Publication Year: 2013, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (147 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2013, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2013, Page(s):xv - xxi
    Request permission for commercial reuse | PDF file iconPDF (192 KB)
    Freely Available from IEEE
  • Awards: FOCS 2013 [2 awards]

    Publication Year: 2013, Page(s): xxii
    Request permission for commercial reuse | PDF file iconPDF (192 KB)
    Freely Available from IEEE
  • An Improved Competitive Algorithm for Reordering Buffer Management

    Publication Year: 2013, Page(s):1 - 10
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    We give an Õ(log log k)-competitive randomized online algorithm for reordering buffer management, where k is the buffer size. Our bound matches the lower bound of Adamaszek et al. (STOC 2011). Our algorithm has two stages which are executed online in parallel. The first stage computes deterministically a feasible fractional solution to an LP relaxation for reordering buffer management. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Randomized Memoryless Algorithms for the Weighted K-Server Problem

    Publication Year: 2013, Page(s):11 - 19
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (197 KB) | HTML iconHTML

    The weighted k-server problem is a generalization of the k-server problem in which the cost of moving a server of weight βi through a distance d is βi · d. The weighted server problem on uniform spaces models caching where caches have different write costs. We prove tight bounds on the performance of randomized memoryless algorithms for this problem on un... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating Bin Packing within O(log OPT * Log Log OPT) Bins

    Publication Year: 2013, Page(s):20 - 29
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    For bin packing, the input consists of n items with sizes between 0 and 1, which have to be assigned to a minimum number of bins of size 1. The seminal Karmarkar-Karp algorithm from '82 produces a solution with at most OPT + O(log2 OPT) bins. We provide the first improvement in now 3 decades and show that one can find a solution of cost OPT + O(log OPT * log log OPT) in polynomial time.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs

    Publication Year: 2013, Page(s):30 - 39
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (266 KB) | HTML iconHTML

    We present a 6-approximation algorithm for the minimum-cost k-node connected spanning sub graph problem, assuming that the number of nodes is at least k3(k-1)+k. We apply a combinatorial preprocessing, based on the Frank-Tardos algorithm for k-out connectivity, to transform any input into an instance such that the iterative rounding method gives a 2-approximation guarantee. This is the first const... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits

    Publication Year: 2013, Page(s):40 - 49
    Cited by:  Papers (141)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (246 KB) | HTML iconHTML

    In this work, we study indistinguishability obfuscation and functional encryption for general circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C0 and C1 of similar size, the obfuscations of C0 and C1 should be computationally indistinguishable. In functional encryption, cipher texts encrypt inputs x and keys are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constant-Round Concurrent Zero Knowledge from P-Certificates

    Publication Year: 2013, Page(s):50 - 59
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol relies on the existence of families of collision-resistant hash functions, and a new, but in our eyes, natural complexity-theoretic assumption: the existence of P-certificates-that is, "succinct" non-interactive proofs/arguments for P. As far as we know, our results yield the first constant-round concurrent zero-kn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simultaneous Resettability from One-Way Functions

    Publication Year: 2013, Page(s):60 - 69
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB) | HTML iconHTML

    Resettable-security, introduced by Canetti, Goldreich, Goldwasser and Micali (STOC'00), considers the security of cryptographic two-party protocols (in particular zero-knowledge arguments) in a setting where the attacker may “reset” or “rewind” one of the players. The strongest notion of resettable security, simultaneous resettability, introduced by Barak, Goldreich, Go... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From Unprovability to Environmentally Friendly Protocols

    Publication Year: 2013, Page(s):70 - 79
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (226 KB) | HTML iconHTML

    An important security concern for crypto-graphic protocols is the extent to which they adversely affect the security of the systems in which they run. In particular, can we rule out the possibility that introducing a new protocol to a system might, as a "side effect", break the security of unsuspecting protocols in that system? Universally Composable (UC) security rules out such adverse side effec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to Approximate a Set without Knowing Its Size in Advance

    Publication Year: 2013, Page(s):80 - 89
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (265 KB) | HTML iconHTML

    The dynamic approximate membership problem asks to represent a set S of size n, whose elements are provided in an on-line fashion, supporting membership queries without false negatives and with a false positive rate at most ε. That is, the membership algorithm must be correct on each x ∈ S, and may err with probability at most ε on each x ∉ S. We study a well-motivated,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence

    Publication Year: 2013, Page(s):90 - 99
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    Simple tabulation dates back to Zobrist in 1970 who used it for game playing programs. Keys are viewed as consisting of c characters from some alphabet Φ. We initialize c tables h0, ... , hc-1 mapping characters to random hash values. A key x = (x0, ... , xc-1) is hashed to h0[x0]⊕· · ·⊕h View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extractors for a Constant Number of Independent Sources with Polylogarithmic Min-Entropy

    Publication Year: 2013, Page(s):100 - 109
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (266 KB) | HTML iconHTML

    We study the problem of constructing explicit extractors for independent general weak random sources. Given weak sources on n bits, the probabilistic method shows that there exists a deterministic extractor for two independent sources with min-entropy as small as log n+O(1). However, even to extract from a constant number of independent sources, previously the best known extractors require the min... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Polynomial Time Algorithm for Lossy Population Recovery

    Publication Year: 2013, Page(s):110 - 116
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (215 KB) | HTML iconHTML

    We give a polynomial time algorithm for the lossy population recovery problem. In this problem, the goal is to approximately learn an unknown distribution on binary strings of length n from lossy samples: for some parameter μ each coordinate of the sample is preserved with probability μ and otherwise is replaced by a `?'. The running time and number of samples needed for our algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings

    Publication Year: 2013, Page(s):117 - 126
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB) | HTML iconHTML

    An oblivious subspace embedding (OSE) given some parameters ε, d is a distribution D over matrices Π ∈ Rm×n such that for any linear subspace W ⊆ Rn with dim(W) = d, PΠ~D(∀x ∈ W ||Πx||2 ∈ (1 ± ε)||x||2) > 2/3. We show that a certain class of distributions, O... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative Row Sampling

    Publication Year: 2013, Page(s):127 - 136
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (690 KB) | HTML iconHTML

    There has been significant interest and progress recently in algorithms that solve regression problems involving tall and thin matrices in input sparsity time. Given a n * d matrix where n ≥ d, these algorithms find an approximation with fewer rows, allowing one to solve a poly(d) sized problem instead. In practice, the best performances are often obtained by invoking these routines in an i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors

    Publication Year: 2013, Page(s):137 - 146
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (342 KB) | HTML iconHTML

    Let G = (V, E) be a graph with f : V → Z+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is O(f(V )ω). More generally for graphs with integral edge weights of maximum absolute value W we find a maximum weight f-factor in time Õ(Wf(V )ω). (The algorithms ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.