By Topic

Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on

Date 11-14 Oct. 2003

Filter Results

Displaying Results 1 - 25 of 66
  • Towards a characterization of truthful combinatorial auctions

    Publication Year: 2003, Page(s):574 - 583
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (419 KB) | HTML iconHTML

    This paper analyzes incentive compatible (truthful) mechanisms over restricted domains of preferences, the leading example being combinatorial auctions. Our work generalizes the characterization of Roberts (1979) who showed that truthful mechanisms over unrestricted domains with at least 3 possible outcomes must be "affine maximizers". We show that truthful mechanisms for combinatorial auctions (a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Switch scheduling via randomized edge coloring

    Publication Year: 2003, Page(s):502 - 512
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (442 KB) | HTML iconHTML

    The essence of an Internet router is an n × n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output ports as the two vertex sets. Packets arriving at input port i and destined for output port j can be modeled as an edge from i to j. Current switch scheduling algorithms view the routing of packets at each time step a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group strategy proof mechanisms via primal-dual algorithms

    Publication Year: 2003, Page(s):584 - 593
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (397 KB) | HTML iconHTML

    We develop a general method for turning a primal-dual algorithm into a group strategy proof cost-sharing mechanism. We use our method to design approximately budget balanced cost sharing mechanisms for two NP-complete problems: metric facility location, and single source rent-or-buy network design. Both mechanisms are competitive, group strategyproof and recover a constant fraction of the cost. Fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a dichotomy theorem for the counting constraint satisfaction problem

    Publication Year: 2003, Page(s):562 - 571
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (478 KB) | HTML iconHTML

    The Counting Constraint Satisfaction Problem (#CSP) over a finite domain can be expressed as follows: given a first-order formula consisting of a conjunction of predicates, determine the number of satisfying assignments to the formula. #CSP can be parametrized by the set of allowed constraint predicates. In this paper we start a systematic study of subclasses of #CSP restricted in this way. The ul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Separating the power of monotone span programs over different fields

    Publication Year: 2003, Page(s):428 - 501
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (605 KB) | HTML iconHTML

    Monotone span programs are a linear-algebraic model of computation. They are equivalent to linear secret sharing schemes and have various applications in cryptography and complexity. A fundamental question is how the choice of the field in which the algebraic operations are performed effects the power of the span program. In this paper we prove that the power of monotone span programs over finite ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Breaking a time-and-space barrier in constructing full-text indices

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

    Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. It has been open for a long time whether these indices can be constructed in both O(n log n) time and O(n log n)-bit working space, where n denotes the length of the text. In the literature, the fastest algorithm runs in O(n) time, while it requires O(n log n)-bit working sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Paths, trees, and minimum latency tours

    Publication Year: 2003, Page(s):36 - 45
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (351 KB) | HTML iconHTML

    We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.59-approximation to the minimum latency problem, improving on previous algorithms by a multiplicative factor of 2. Our techniques also give similar improvements for related problems like k-traveling repairmen and its multiple depot variant. We also observe that standard techniques c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximation algorithms for orienteering and discounted-reward TSP

    Publication Year: 2003, Page(s):46 - 55
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB) | HTML iconHTML

    In this paper, we give the first constant-factor approximation algorithm for the rooted orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivated by robot navigation. In both problems, we are given a graph with lengths on edges and prizes (rewards) on nodes, and a start node s. In the orienteering problem, the goal is to find a path that maximizes the reward ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear upper bounds for random walk on small density random 3-CNFs

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

    We analyze the efficiency of the random walk algorithm on random 3-CNF instances, and prove linear upper bounds on the running time of this algorithm for small clause density, less than 1.63. Our upper bound matches the observed running time to within a multiplicative factor. This is the first sub-exponential upper bound on the running time of a local improvement algorithm on random instances. Our... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem

    Publication Year: 2003, Page(s):606 - 615
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (517 KB) | HTML iconHTML

    We study the multicommodity rent-or-buy problem, a type of network design problem with economies of scale. In this problem, capacity on an edge can be rented, with cost incurred on a per-unit of capacity basis, or bought, which allows unlimited use after payment of a large fixed cost. Given a graph and a set of source-sink pairs, we seek a minimum-cost way of installing sufficient capacity on edge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broadcasting algorithms in radio networks with unknown topology

    Publication Year: 2003, Page(s):492 - 501
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (351 KB) | HTML iconHTML

    In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed n-node radio networks with specified eccentricity D (maximum distance from the source node to any other node). Our first main result closes the gap between the lower and upper bound: we describe an optimal randomized broadcasti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the impossibility of dimension reduction in ℓ1

    Publication Year: 2003, Page(s):514 - 523
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (329 KB) | HTML iconHTML

    The Johnson-Lindenstrauss Lemma shows that any n points in Euclidean space (with distances measured by the ℓ2 norm) may be mapped down to O((log n)/ε2) dimensions such that no pairwise distance is distorted by more than a (1+ ε) factor. Determining whether such dimension reduction is possible in ℓ1 has been an intriguing open question. We show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-knowledge sets

    Publication Year: 2003, Page(s):80 - 91
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (611 KB) | HTML iconHTML

    We show how a polynomial-time prover can commit to an arbitrary finite set S of strings so that, later on, he can, for any string x, reveal with a proof whether x ∈ S or x ∉ S, without revealing any knowledge beyond the verity of these membership assertions. Our method is non interactive. Given a public random string, the prover commits to a set by simply posting a short and easily comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • I/O-efficient strong connectivity and depth-first search for directed planar graphs

    Publication Year: 2003, Page(s):261 - 270
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (342 KB) | HTML iconHTML

    We present the first I/O-efficient algorithms for the following fundamental problems on directed planar graphs: finding the strongly connected components, finding a simple-path 2/3-separator, and computing a depth-first spanning (DFS) tree. Our algorithms for the first two problems perform O(sort(N)) I/Os, where N = V + E and sort(N) = Θ((N/B)) is the number of I/Os required to sort N elemen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List-decoding using the XOR lemma

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

    We show that Yao's XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good list-decoding algorithms from error-correcting codes having weak unique-decoding algorithms. To get codes with good rate and efficient list decoding algorithms, one needs a proof of the Direct Product Lemma that, respectivel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General composition and universal composability in secure multi-party computation

    Publication Year: 2003, Page(s):394 - 403
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (342 KB) | HTML iconHTML

    Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting is what is desired, or even needed, in modern computer networks where many different protocols are executed concurrently. Our main result is a proof that security under concurrent general composition is equivalent to a rel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A polynomial algorithm for recognizing perfect graphs

    Publication Year: 2003, Page(s):20 - 27
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    We present a polynomial algorithm for recognizing whether a graph is perfect, thus settling a long standing open question. The algorithm uses a decomposition theorem of Conforti, Cornuejols and Vuskovic. Another polynomial algorithm for recognizing perfect graphs, which does not use decomposition, was obtained simultaneously by Chudnovsky and Seymour. Both algorithms need a first phase developed j... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the maximum satisfiability of random formulas

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

    Maximum satisfiability is a canonical NP-complete problem that appears empirically hard for random instances. At the same time, it is rapidly becoming a canonical problem for statistical physics. In both of these realms, evaluating new ideas relies crucially on knowing the maximum number of clauses one can typically satisfy in a random k-CNF formula. In this paper we give asymptotically tight esti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

    Publication Year: 2003, Page(s):56 - 65
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (537 KB) | HTML iconHTML

    A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall's theorem one can represent such a multigraph as a combination of at most n2 cycle covers each taken with an appropriate multiplicity. We prove that if the d-regular multigraph does not contain more than d/2... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounded geometries, fractals, and low-distortion embeddings

    Publication Year: 2003, Page(s):534 - 543
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (386 KB) | HTML iconHTML

    The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is then defined as dim (X) = log2λ. A metric (or sequence of metrics) is called doubling precisely when its doubling dimension is bounded. This is a robust class of metric spaces which contains man... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound for the bounded round quantum communication complexity of set disjointness

    Publication Year: 2003, Page(s):220 - 229
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (346 KB) | HTML iconHTML

    We show lower bounds in the multi-party quantum communication complexity model. In this model, there are t parties where the ith party has input Xi ⊆ [n]. These parties communicate with each other by transmitting qubits to determine with high probability the value of some function F of their combined input (X1,...,Xt). We consider the class of Boolean valued f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An in-place sorting with O(n log n) comparisons and O(n) moves

    Publication Year: 2003, Page(s):242 - 250
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (329 KB) | HTML iconHTML

    We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O(n log n) element comparisons and O(n) element transports. This solves a long-standing open problem, stated explicitly, e.g., in J.I. Munro and V. Raman (1992), of whether there exists a sorting algorithm that matches the asymptotic lower bounds on all computational resources simultane... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the (In)security of the Fiat-Shamir paradigm

    Publication Year: 2003, Page(s):102 - 113
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB) | HTML iconHTML

    In 1986, Fiat and Shamir proposed a general method for transforming secure 3-round public-coin identification schemes into digital signature schemes. The idea of the transformation was to replace the random message of the verifier in the identification scheme, with the value of some deterministic hash function evaluated on various quantities in the protocol and on the message to be signed. The Fia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The cost of cache-oblivious searching

    Publication Year: 2003, Page(s):271 - 282
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    Tight bounds on the cost of cache-oblivious searching are proved. It is shown that no cache-oblivious search structure can guarantee that a search performs fewer than lg e logBN block transfers between any two levels of the memory hierarchy. This lower bound holds even if all of the block sizes are limited to be powers of 2. A modified version of the van Emde Boas layout is proposed, wh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum search of spatial regions

    Publication Year: 2003, Page(s):200 - 209
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB) | HTML iconHTML

    Can Grover's quantum search algorithm speed up search of a physical region - for example a 2D grid of size √n x √n? The problem is that √n time seems to be needed for each query, just to move amplitude across the grid. Here we show that this problem can be surmounted, refuting a claim to the contrary by Benioff. In particular, we show how to search a d-dimensional hypercube in ti... View full abstract»

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