2009 50th Annual IEEE Symposium on Foundations of Computer Science

25-27 Oct. 2009

Filter Results

Displaying Results 1 - 25 of 83
  • [Front cover]

    Publication Year: 2009, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (410 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2009, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • [Title page iii]

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

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

    Publication Year: 2009, Page(s):v - x
    Request permission for commercial reuse | PDF file iconPDF (130 KB)
    Freely Available from IEEE
  • Message from Program Chair

    Publication Year: 2009, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (55 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2009, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (97 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2009, Page(s):xiii - xiv
    Request permission for commercial reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size

    Publication Year: 2009, Page(s):3 - 12
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB) | HTML iconHTML

    Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities) is O(logfe). Here we attempt to derive a more general theory of Steiner cut and flow problems, and we prove bounds that are poly-logarithmic in k for a much broader class of multicommodity flow and cut problems. Our structur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Faster Generation of Random Spanning Trees

    Publication Year: 2009, Page(s):13 - 21
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB) | HTML iconHTML

    In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative (1+ ¿) of uniform in expected time O¿(m¿n log 1/¿). This improves the sparse graph case of the best previously known worst-case bound of O(min {mn, n2.376}), which has stood for twenty... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local Graph Partitions for Approximation and Testing

    Publication Year: 2009, Page(s):22 - 31
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs with an excluded minor, and in general, for any hyperfinite class of bounded-degree graphs. These oracles utilize only local computation to consistently answer queries about a global partition that breaks the graph into small ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Oblivious Routing for the Lp-norm

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

    Gupta et al. [13] introduced a very general multicommodity flow problem in which the cost of a given flow solution on a graph G = (V, E) is calculated by first computing the link loads via a load-function ¿, that describes the load of a link as a function of the flow traversing the link, and then aggregating the individual link loads into a single number via an aggregation function agg:R|E|<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear Systems over Composite Moduli

    Publication Year: 2009, Page(s):43 - 52
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (255 KB) | HTML iconHTML

    We study solution sets to systems of 'generalized' linear equations of the form: ¿i (x1, x2, ···, xn) in ¿ Ai (mod m) where ¿1,..., ¿t are linear forms in n Boolean variables, each Ai is an arbitrary subset of Zm, and m is a composite integer that is a product of two distinct primes, like 6. O... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiparty Communication Complexity and Threshold Circuit Size of AC^0

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

    We prove an n¿(-1)/4k lower bound on the randomized k-party communication complexity of depth 4 AC0 functions in the number-on-forehead (NOF) model for up to ¿(log n) players. These are the first non-trivial lower bounds for general NOF multiparty communication complexity for any AC0 function for ¿ (log log n) players. For non-constant k the bounds ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection

    Publication Year: 2009, Page(s):63 - 72
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB) | HTML iconHTML

    In this paper, we analyze the following communication complexity problem. It is a variant of the set-disjointness problem, denoted PDISJlog N, where each of Alice and Bob gets as an input a subset of [N] of size at most log N, with the promise that the intersection of the two subsets is of size at most 1. We provide an almost tight lower bound of ¿¿(log2 N) on the determini... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda's Theorem

    Publication Year: 2009, Page(s):73 - 82
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (297 KB) | HTML iconHTML

    Toda proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #P. This result which illustrates the power of counting is considered to be a seminal result in comput... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomized Self-Assembly for Exact Shapes

    Publication Year: 2009, Page(s):85 - 94
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB) | HTML iconHTML

    Working in Winfree's abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n × n square with high probability, for any sufficiently large n. This answers an open question of Kao and Schweller (Randomized Self-Assembly for Approximate Shapes, ICALP 2008), who showed how to build an approximately n×n squar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems

    Publication Year: 2009, Page(s):95 - 104
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (234 KB) | HTML iconHTML

    We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we show hardness of a classical tiling problem on an (N x N) 2-dimensional grid and a quantum problem involving finding the ground state energy of a 1-dimensional quantum system of N particles. In both cases, the only input is N,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Allocating Goods to Maximize Fairness

    Publication Year: 2009, Page(s):107 - 116
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB) | HTML iconHTML

    We consider the Max-Min Allocation problem: given a set A of m agents and a set I of n items, where agent A ¿ A has utility uA,i for item i ¿ I, our goal is to allocate items to agents so as to maximize fairness. Specifically, the utility of an agent is the sum of its utilities for the items it receives, and we seek to maximize the minimum utility of any agent. While this problem has ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Online Stochastic Matching: Beating 1-1/e

    Publication Year: 2009, Page(s):117 - 126
    Cited by:  Papers (15)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (295 KB) | HTML iconHTML

    We study the online stochastic bipartite matching problem, in a form motivated by display ad allocation on the Internet. In the online, but adversarial case, the celebrated result of Karp, Vazirani and Vazirani gives an approximation ratio of 1- 1/e ¿ 0.632, a very familiar bound that holds for many online problems; further, the bound is tight in this case. In the online, stochastic case when nod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Instance-Optimal Geometric Algorithms

    Publication Year: 2009, Page(s):129 - 138
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (263 KB) | HTML iconHTML

    We prove the existence of an algorithm A for computing 2-d or 3-dconvex hulls that is optimal for every point set in the following sense: for every set S of n points and for every algorithm A' in a certain class A, the running time of A on the worst permutation of S for A is at most a constant factor times the running time of A' on the worst permutation of S for A'. In fact, we can establish a str... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delaunay Triangulations in O(sort(n)) Time and More

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

    We present several results about Delaunay triangulations (DTs) and convex hulls in transdichotomous and hereditary settings: (i) the DT of a planar point set can be computed in expected time O(sort(n)) on a word RAM, where sort(n) is the time to sort n numbers. We assume that the word RAM supports the shuffle-operation in constant time; (ii) if we know the ordering of a planar point set in x- and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orthogonal Range Reporting in Three and Higher Dimensions

    Publication Year: 2009, Page(s):149 - 158
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis-aligned query box can be reported efficiently. This is a fundamental problem in various fields, including spatial databases and computational geometry. In this paper we provide a number of improvements for three and higher dimensional orthogonal range reporting: In the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposing Coverings and the Planar Sensor Cover Problem

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

    We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to obtain a constant factor approximation to the sensor cover problem where the ranges of the sensors are translates of a given convex polygon. The crucial ingredient in this generalization is a constant factor approximation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounded Independence Fools Halfspaces

    Publication Year: 2009, Page(s):171 - 180
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (309 KB) | HTML iconHTML

    We show that any distribution on {-1,+1}n that is k-wise independent fools any halfspace (a.k.a. threshold) h : {-1,+1}n ¿ {-1,+1}, i.e., any function of the form h(x) = sign(¿i=1 n wiXi - ¿) where the w1,..., wn, ¿ are arbitrary real numbers, with error ¿ for k = O(¿-2 log2(1/¿)). ... View full abstract»

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