By Topic

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

11-14 Oct. 2003

Filter Results

Displaying Results 1 - 25 of 66
  • The value of knowing a demand curve: bounds on regret for online posted-price auctions

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

    We consider price-setting algorithms for a simple market in which a seller has an unlimited supply of identical copies of some good, and interacts sequentially with a pool of n buyers, each of whom wants at most one copy of the good. In each transaction, the seller offers a price between 0 and 1, and the buyer decides whether or not to buy, by comparing the offered price to his privately-held valu... 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 (11)
    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 characterization of truthful combinatorial auctions

    Publication Year: 2003, Page(s):574 - 583
    Cited by:  Papers (24)
    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.
  • Logics for reasoning about cryptographic constructions

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

    We present two logical systems for reasoning about cryptographic constructions which are sound with respect to standard cryptographic definitions of security. Soundness of the first system is proved using techniques from nonstandard models of arithmetic. Soundness of the second system is proved by an interpretation into the first system. We also present examples of how these systems may be used to... 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 (6)
    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.
  • Mixing [Markov chain]

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

    In this paper, we introduce the notion of a Markov chain and explore how it can be used to sample from a large set of configurations. Our primary focus is determining how quickly a Markov chain "mixes," or converges to its stationary distribution, as this is the key factor in the running time. We provide an overview of several techniques used to establish good bounds on the mixing time. The applic... 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.
  • The complexity of homomorphism and constraint satisfaction problems seen from the other side

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

    We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure in a homomorphism. For every class C of structures, let HOM(C, _) be the problem of deciding whether a given structure A ∈ C has a homomorphism to a given (arbitrary) structure B. We prove that, under some comple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving sparse, symmetric, diagonally-dominant linear systems in time O(m1.31

    Publication Year: 2003, Page(s):416 - 427
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (687 KB) | HTML iconHTML

    We present a linear-system solver that, given an n-by-n symmetric positive semi-definite, diagonally dominant matrix A with m non-zero entries and an n-vector b, produces a vector x˜ within relative distance ε of the solution to Ax = b in time O(m1.31log(n/ε)bO(1)), where b is the log of the ratio of the largest to smallest non-zero entry of A. If the graph of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability and efficiency of a random local load balancing protocol

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

    We study the long term (steady state) performance of a simple, randomized, local load balancing technique. We assume a system of n processors connected by an arbitrary network topology. Jobs are placed in the processors by a deterministic or randomized adversary. The adversary knows the current and past load distribution in the network and can use this information to place the new tasks in the pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Machine learning: my favorite results, directions, and open problems

    Publication Year: 2003, Page(s): 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (191 KB)

    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.
  • 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.
  • On levels in arrangements of curves. II. A simple inequality and its consequences

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

    We give a surprisingly short proof that in any planar arrangement of n curves where each pair intersects at most a fixed number (s) of times, the k-level has subquadratic (O(n2-12s/)) complexity. This answers one of the main open problems from the author's previous paper, which provided a weaker bound for a restricted class of curves (graphs of degree-s polynomials) only. When combined ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Ising model on trees: boundary conditions and mixing time

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

    We give the first comprehensive analysis of the effect of boundary conditions on the mixing time of the Glauber dynamics for the Ising model. Specifically, we show that the mixing time on an n-vertex regular tree with (+) boundary remains O(n log n) at all temperatures (in contrast to the free boundary case, where the mixing time is not bounded by any fixed polynomial at low temperatures). We also... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounded-concurrent secure two-party computation in a constant number of rounds

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

    We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we focus on the case where an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. (a.k.a. bounded concurrency). We make no setup assumptions. Lindel (STOC 2003) has shown that an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Average case and smoothed competitive analysis of the multi-level feedback algorithm

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

    In this paper, we introduce the notion of smoothed competitive analysis of online algorithms. Smoothed analysis has been proposed by Spielman and Teng (2001) to explain the behavior of algorithms that work well in practice while performing very poorly from a worst case analysis point of view. We apply this notion to analyze the Multi-Level Feedback (MLF) algorithm to minimize the total flow time o... 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 (9)
    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.
  • Quantum search of spatial regions

    Publication Year: 2003, Page(s):200 - 209
    Cited by:  Papers (14)
    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.
  • On the implementation of huge random objects

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

    We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random object being considered may be a random connected graph, a random bounded-degree graph, or a random error-correcting code with good distance. A pseudo-random implementation of such type T objects must generate objects of typ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • More on average case vs approximation complexity

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

    We consider the problem to determine the maximal number of satisfiable equations in a linear system chosen at random. We make several plausible conjectures about the average case hardness of this problem for some natural distributions on the instances, and relate them to several interesting questions in the theory of approximation algorithms and in cryptography. Namely we show that our conjectures... 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.
  • Algorithms and complexity results for #SAT and Bayesian inference

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

    Bayesian inference is an important problem with numerous applications in probabilistic reasoning. Counting satisfying assignments is a closely related problem of fundamental theoretical importance. In this paper, we show that plain old DPLL equipped with memorization (an algorithm we call #DPLLCache) can solve both of these problems with time complexity that is at least as good as state-of-the-art... 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 (50)
    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.
  • Proofs of the Parisi and Coppersmith-Sorkin conjectures for the finite random assignment problem

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

    Suppose that there are n jobs and n machines and it costs cij to execute job i on machine j. The assignment problem concerns the determination of a one-to-one assignment of jobs onto machines so as to minimize the cost of executing all the jobs. The average case analysis of the classical random assignment problem has received a lot of interest in the recent literature, mainly due to the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A non-Markovian coupling for randomly sampling colorings

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

    We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree Δ and girth g. We prove the Glauber dynamics is close to the uniform distribution after O(n log n) steps whenever k > (1 + ε)Δ, for all ε > 0, assuming g ≥ 9 and Δ = Ω(log n). The best previously known b... View full abstract»

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