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

11-14 Oct. 2003

Filter Results

Displaying Results 1 - 25 of 66
  • Gossip-based computation of aggregate information

    Publication Year: 2003, Page(s):482 - 491
    Cited by:  Papers (429)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB) | HTML iconHTML

    Over the last decade, we have seen a revolution in connectivity between computers, and a resulting paradigm shift from centralized to highly distributed systems. With massive scale also comes massive instability, as node and link failures become the norm rather than the exception. For such highly volatile systems, decentralized gossip-based protocols are emerging as an approach to maintaining simp... 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 (4)
    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.
  • Performance analysis of dynamic processes

    Publication Year: 2003
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB) | HTML iconHTML

    The article covers various approaches for modeling and analyzing dynamic processes in networks. Modeling the dynamic performance as a stochastic process, we apply tools from discrete and continuous time Markov processes theory, renewal theory and queuing theory to analyze the long term, steady state performance of the processes. Non-stochastic approaches include adversarial queuing theory, and gam... 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.
  • 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.
  • Instability of FIFO at arbitrarily low rates in the adversarial queuing model

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

    We study the stability of the commonly used packet forwarding protocol, FIFO (First In First Out), in the adversarial queuing model. We prove that FIFO can become unstable, i.e., lead to unbounded buffer-occupancies and queuing delays, at arbitrarily low injection rates. In order to demonstrate instability at rate r, we use a network of size polynomial in 1/r. 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.
  • 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.
  • 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 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.
  • 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.
  • 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.
  • Proving hard-core predicates using list decoding

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

    We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old results in an entirely different way as well as showing new hard-core predicates for well known one-way function candidates. Our framework extends the list-coding method of Goldreich and Levin for showing hard-core predicate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial degree vs. quantum query complexity

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

    The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight. We exhibit a function with polynomial degree M and quantum query complexity (M1.321...). This is the first superlinear ... 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.
  • The resolution complexity of random constraint satisfaction problems

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

    We consider random instances of constraint satisfaction problems where each variable has domain size d, and each constraint contains t restrictions on k variables. For each (d, k, t) we determine whether the resolution complexity is a.s. constant, polynomial or exponential in the number of variables. For a particular range of (d, k, t) we determine a sharp threshold for resolution complexity where... 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 (5)  |  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.
  • General composition and universal composability in secure multi-party computation

    Publication Year: 2003, Page(s):394 - 403
    Cited by:  Papers (19)
    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.
  • Symmetric polynomials over Zm and simultaneous communication protocols

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

    We study the problem of representing symmetric Boolean functions as symmetric polynomials over Zm. We show an equivalence between such representations and simultaneous communication protocols. Computing a function f on 0 - 1 inputs with a polynomial of degree d modulo pq is equivalent to a two player simultaneous protocol for computing f where one player is given the first [logp 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.
  • 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.
  • On the (In)security of the Fiat-Shamir paradigm

    Publication Year: 2003, Page(s):102 - 113
    Cited by:  Papers (12)
    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.
  • Zero-knowledge sets

    Publication Year: 2003, Page(s):80 - 91
    Cited by:  Papers (33)  |  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.
  • Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

    Publication Year: 2003, Page(s):56 - 65
    Cited by:  Papers (9)
    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.
  • A non-Markovian coupling for randomly sampling colorings

    Publication Year: 2003, Page(s):618 - 627
    Cited by:  Papers (7)
    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.