The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.

19-19 Nov. 2002

Filter Results

Displaying Results 1 - 25 of 82
  • Proceedings 43rd Annual IEEE Symposium on Foundations of Computer Science

    Publication Year: 2002
    Request permission for commercial reuse | PDF file iconPDF (327 KB)
    Freely Available from IEEE
  • Zero-knowledge: abstract of a tutorial

    Publication Year: 2002
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (201 KB) | HTML iconHTML

    Zero-knowledge proofs are fascinating and extremely useful constructs. Their fascinating nature is due to their seemingly contradictory definition; zero-knowledge proofs are both convincing and yet yield nothing beyond the validity of the assertion being proven. Their applicability in the domain of cryptography is vast; they are typically used to force malicious parties to behave according to a pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning intersections and thresholds of halfspaces

    Publication Year: 2002, Page(s):177 - 186
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB) | HTML iconHTML

    We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution to within any constant error parameter. We also give the first quasipolynomial time algorithm for learning any function of a polylog number of polynomial-weight halfspaces under any distribution. As special cases of these results we obtain algorithms for learning inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Erratum to "Vickrey pricing and shortest paths: What is an edge worth?"

    Publication Year: 2002, Page(s): 809
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB) | HTML iconHTML

    First Page of the Article
    View full abstract»

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

    Publication Year: 2002, Page(s):811 - 813
    Request permission for commercial reuse | PDF file iconPDF (177 KB)
    Freely Available from IEEE
  • Quantum lower bounds for the collision and the element distinctness problems

    Publication Year: 2002, Page(s):513 - 519
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (633 KB) | HTML iconHTML

    Given a function f as an oracle, the collision problem is to find two distinct inputs i and j such that f(i)=f(j), under the promise that such inputs exist. In this paper, we prove that any quantum algorithm for finding a collision in an r-to-one function must evaluate the function Ω ((n/r)13/) times, where n is the size of the domain and r|n. This lower bound matches, up to a con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast approximation algorithms for fractional Steiner forest and related problems

    Publication Year: 2002, Page(s):500 - 509
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (377 KB) | HTML iconHTML

    We give a fully polynomial time approximation scheme (FPTAS) for the optimum fractional solution to the Steiner forest problem. This can easily be generalized to obtain an FPTAS for a hitting set problem on a collection of clutters. We also identify three other problems on collections of clutters and show how these four problems are related when the clutters have the max-flow min-cut (MFMC) proper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packing 2-dimensional bins in harmony

    Publication Year: 2002, Page(s):490 - 499
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    We consider 2-Dimensional (Finite) Bin Packing (2BP), which is one of the most important generalizations of the well-known Bin Packing (BP) and calls for orthogonally packing a given set of rectangles (that cannot be rotated) into the minimum number of unit size squares. There are many open questions concerning the approximability of 2BP, whereas the situation for the 2-stage case, in which the it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proving integrality gaps without knowing the linear program

    Publication Year: 2002, Page(s):313 - 322
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (351 KB) | HTML iconHTML

    Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic approach. We prove an integrality gap of 2-o(1) for three families of linear relaxations for vertex cover, and our methods seem relevant to other problems as well. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Breaking the O(n1(2k-1)/) barrier for information-theoretic Private Information Retrieval

    Publication Year: 2002, Page(s):261 - 270
    Cited by:  Papers (27)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (431 KB) | HTML iconHTML

    Private information retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic, k-server PIR protocols the database is replicated among k servers, and each server learns nothing about the item the user retrieves. The cost of such protocols is measured by the communication complexity of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Covering problems with hard capacities

    Publication Year: 2002, Page(s):481 - 489
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its elements (adjacent edges) and the number of available copies of each set (vertex) is bounded. This is a natural generalization of the classical problems that also captures resource limitations in practical scenarios. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal system of loops on an orientable surface

    Publication Year: 2002, Page(s):627 - 636
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB) | HTML iconHTML

    Every compact orientable boundaryless surface ℳ can be cut along simple loops with a common point υ0, pairwise disjoint except at υ0, so that the resulting surface is a topological disk; such a set of loops is called a fundamental system of loops for ℳ. The resulting disk is a polygon in which the edges are pairwise identified on the surface; it is called ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line end-to-end congestion control

    Publication Year: 2002, Page(s):303 - 310
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    Congestion control in the current Internet is accomplished mainly by TCP/IP. To understand the macroscopic network behavior that results from TCP/IP and similar end-to-end protocols, one main analytic technique is to show that the the protocol maximizes some global objective function of the network traffic. We analyze a particular end-to-end MIMD (multiplicative-increase, multiplicative-decrease) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding turbo-like codes via linear programming

    Publication Year: 2002, Page(s):251 - 260
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (413 KB) | HTML iconHTML

    We introduce a novel algorithm for decoding turbo-like codes based on linear programming. We prove that for the case of repeat-accumulate (RA) codes, under the binary symmetric channel with a certain constant threshold bound on the noise, the error probability of our algorithm is bounded by an inverse polynomial in the code length. Our linear program (LP) minimizes the distance between the receive... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound for testing 3-colorability in bounded-degree graphs

    Publication Year: 2002, Page(s):93 - 102
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (405 KB) | HTML iconHTML

    We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3-colorability must have query complexity Ω(n). This is the first linear lower bound for testing a natural graph property in the bounded-degree model. An Ω(√n) lower bound was previously known. For one-sided error testers, we also show an Ω(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protocols and impossibility results for gossip-based communication mechanisms

    Publication Year: 2002, Page(s):471 - 480
    Cited by:  Papers (31)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (349 KB) | HTML iconHTML

    In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise underlying distributed gossip is very simple: in each time step, each node v in the system selects some other node w as a communication partner, generally by a simple randomized rule, and exchanges information with w; ove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic planar convex hull

    Publication Year: 2002, Page(s):617 - 626
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB) | HTML iconHTML

    In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) time per operation. The space usage of the data structure is O(n). The data structure supports extreme point queries in a given direction, tangent ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on the bounded coefficient complexity of bilinear maps

    Publication Year: 2002, Page(s):659 - 668
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    We prove lower bounds of order n log n for both the problem to multiply polynomials of degree n, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower bounds are optimal up to order of magnitude. The proof uses a recent idea of R. Raz [Proc. 34th STOC 2002] proposed for matrix multiplication. It reduces the linear pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling over a time-varying user-dependent channel with applications to high speed wireless data

    Publication Year: 2002, Page(s):293 - 302
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    In a wireless network, a basestation transmits data to mobiles at time-varying, mobile-dependent rates due to the ever changing nature of the communication channels. In this paper we consider a wireless system in which the channel conditions and data arrival processes are governed by an adversary. We first consider a single server and a set of users. At each time step t the server can only transmi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks

    Publication Year: 2002, Page(s):691 - 700
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (393 KB) | HTML iconHTML

    Motivated by a frequency assignment problem in cellular networks, we introduce and study a new coloring problem called minimum conflict-free coloring (min-CF-coloring). In its general form, the input of the min-CF-coloring problem is a set system (X, S), where each S ∈ S is a subset of X. The output is a coloring X of the sets in S that satisfies the following constraint: for every x ∈ X... View full abstract»

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

    Publication Year: 2002, Page(s):238 - 247
    Cited by:  Papers (34)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (406 KB) | HTML iconHTML

    We consider the following clustering problem: we have a complete graph on n vertices (items), where each edge (u, υ) is labeled either + or - depending on whether a and υ have been deemed to be similar or different. The goal is to produce a partition of the vertices (a clustering) that agrees as much as possible with the edge labels. That is, we want a clustering that maximizes the numbe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An information statistics approach to data stream and communication complexity

    Publication Year: 2002, Page(s):209 - 218
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (427 KB) | HTML iconHTML

    We present a new method for proving strong lower bounds in communication complexity. This method is based on the notion of the conditional information complexity of a function which is the minimum amount of information about the inputs that has to be revealed by a communication protocol for the function. While conditional information complexity is a lower bound on the communication complexity, we ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstract combinatorial programs and efficient property testers

    Publication Year: 2002, Page(s):83 - 92
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (445 KB) | HTML iconHTML

    Property testing is a relaxation of classical decision problems which aims at distinguishing between functions having a predetermined property and functions being far from any function having the property. In this paper we present a novel framework for analyzing property testing algorithms with one-sided error. Our framework is based on a connection of property testing and a new class of problems ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limits on the power of quantum statistical zero-knowledge

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

    In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV. We prove several facts regarding this class, including: the following problem is a complete promise problem for QSZKHV: given instructions for preparing two mixed quantum states, are the states close to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Small induced-universal graphs and compact implicit graph representations

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

    We show that there exists a graph G with n · 2O(log* n) nodes, where any forest with n nodes is a node-induced subgraph of G. Furthermore, the result implies the existence of a graph with nk2O(log* n) nodes that contains all n-node graphs of fixed arboricity k as node-induced subgraphs. We provide a lower bound of Ω(nk) for the size of such ... View full abstract»

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