Proceedings 35th Annual Symposium on Foundations of Computer Science

20-22 Nov. 1994

Filter Results

Displaying Results 1 - 25 of 74
  • Proceedings 35th Annual Symposium on Foundations of Computer Science

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (87 KB)
    Freely Available from IEEE
  • CS proofs

    Publication Year: 1994, Page(s):436 - 453
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1408 KB)

    This paper puts forward a computationally-based notion of proof and explores its implications to computation at large. In particular, given a random oracle or a suitable cryptographic assumption, we show that every computation possesses a short certificate vouching its correctness, and that, under a cryptographic assumption, any program for a 𝒩𝒫-complete problem is checkable in polynomia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the combinatorial and algebraic complexity of quantifier elimination

    Publication Year: 1994, Page(s):632 - 641
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    In this paper we give a new algorithm for performing quantifier elimination from first order formulae over real closed fields. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this date. A new feature of our algorithm is that the role of the algebraic part (the dependence on the degrees of the input polynomials) and the combinatorial part (t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On monotone formula closure of SZK

    Publication Year: 1994, Page(s):454 - 465
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (940 KB)

    We investigate structural properties of statistical zero knowledge (SZK) both in the interactive and in the non-interactive model. Specifically, we look into the closure properties of SZK languages under monotone logical formula composition. This gives rise to new protocol techniques. We show that interactive SZK for random self reducible languages (RSR) (and for co-RSR) is closed under monotone B... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • (De)randomized construction of small sample spaces in 𝒩𝒞

    Publication Year: 1994, Page(s):252 - 263
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB)

    D. Koller and N. Megiddo (1993) introduced the paradigm of constructing compact distributions that satisfy a given set of constraints, and showed how it can be used to efficiently derandomize certain types of algorithm. In this paper, we significantly extend their results in two ways. First, we show how their approach can be applied to deal with more general expectation constraints. More important... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Set constraints with projections are in NEXPTIME

    Publication Year: 1994, Page(s):642 - 653
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis and type inference. In this paper we prove that the problem of existence of a solution of a system of set constraints with projections is in NEXPTIME, and thus that it is NEXPTIME-complete. This extends the result of A. Aiken, D. Kozen, and E.L. Wimmers (1993) and R. Gil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of bounded-interaction and noninteractive zero-knowledge proofs

    Publication Year: 1994, Page(s):466 - 477
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    We consider the basic cryptographic primitive known as zero-knowledge proofs on committed bits. In this primitive, a prover P commits to a set of bits, and then at a later time convinces a verifier V that some property 𝒫 holds for a subset of these bits. It is known how to implement this primitive based on an ordinary bit-committal primitive, but the standard implementations involve a great d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomized and deterministic algorithms for geometric spanners of small diameter

    Publication Year: 1994, Page(s):703 - 712
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    Let S be a set of n points in IRd and let t>1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q of points there is a path from p to q of length at most t times the Euclidean distance between p and p. Such a path is called a t-spanner path. The spanner diameter of such a spanner is defined as the smallest int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing with very weak random sources

    Publication Year: 1994, Page(s):264 - 275
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    For any fixed ε>0, we show how to simulate RP algorithms in time nO(log n) using the output of a δ-source with min-entropy R(ε). Such a weak random source is asked once for R(ε) bits; it outputs an R-bit string such that any string has probability at most 2-R(ε). If ε>1-1/(k+1), our BPP simulations take time nO(log(k n)) (log View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rapid rumor ramification: approximating the minimum broadcast time

    Publication Year: 1994, Page(s):202 - 213
    Cited by:  Papers (34)  |  Patents (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (924 KB)

    Given an undirected graph representing a network of processors, and a source node containing a message that must be broadcast to all the nodes, find a scheme that accomplishes the broadcast in the minimum number of time steps. At each time step, any processor that has received the message is allowed to communicate the message to at most one of its neighbors in the network, i.e. can communicate via... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Markov chains and polynomial time algorithms

    Publication Year: 1994, Page(s):656 - 671
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1484 KB)

    This paper outlines the use of rapidly mixing Markov Chains in randomized polynomial time algorithms to solve approximately certain counting problems. They fall into two classes: combinatorial problems like counting the number of perfect matchings in certain graphs and geometric ones like computing the volumes of convex sets View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducibility and completeness in multi-party private computations

    Publication Year: 1994, Page(s):478 - 489
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    We define the notions of reducibility and completeness in multi-party private computations. Let g be an n-argument function. We say that a function f is reducible to g if n honest-but-curious players can compute the function f n-privately, given a black-box for g (for which they secretly give inputs and get the result of operating g on these inputs). We say that g is complete (for multi-party priv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new efficient radix sort

    Publication Year: 1994, Page(s):714 - 721
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    We present new improved algorithms for the sorting problem. The algorithms are not only efficient but also clear and simple. First, we introduce Forward Radix Sort which combines the advantages of traditional left-to-right and right-to-left radix sort in a simple manner. We argue that this algorithm will work very well in practice. Adding a preprocessing step, we obtain an algorithm with attractiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The geometry of graphs and some of its algorithmic applications

    Publication Year: 1994, Page(s):577 - 591
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1084 KB)

    We explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graph-theoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that respect the metric of the (possibly weighted) graph. Given a graph G we map its vertices to a normed space in an atte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for quantum computation: discrete logarithms and factoring

    Publication Year: 1994, Page(s):124 - 134
    Cited by:  Papers (801)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation time of at most a polynomial factor: It is not clear whether this is still true when quantum mechanics is taken into consideration. Several researchers, starting with David Deutsch, have developed models for quantum mechanical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomness-efficient oblivious sampling

    Publication Year: 1994, Page(s):276 - 287
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    We introduce a natural notion of obliviousness of a sampling procedure, and construct a randomness-efficient oblivious sampler. Our sampler uses O(l+log δ-1·log l) coins to output m=poly(ε-1, log δ-1, log l) sample points x1, …, xm, ∈ {0, 1}1 such that Pr[|1/mΣi=1mf(x View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The load, capacity and availability of quorum systems

    Publication Year: 1994, Page(s):214 - 225
    Cited by:  Papers (14)  |  Patents (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    A quorum system is a collection of sets (quorums) every two of which have a nonempty intersection. Quorum systems have been used for a number of applications in the area of distributed systems. We investigate the load, capacity and availability of quorum systems. We present four novel constructions of quorum system, all featuring optimal or near optimal load, and high availability. These desirable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A spectral approach to lower bounds

    Publication Year: 1994, Page(s):674 - 682
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requires Ω(n log n) additions and subtractions. This is the first nontrivial lower bound for range searching over a group. By constrast, range searching over a semigroup (which forbids subtractions) is almost completely ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs

    Publication Year: 1994, Page(s):24 - 35
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    The Tutte-Grothendieck polynomial T(G; x, y) of a graph G encodes numerous interesting combinatorial quantities associated with the graph. Its evaluation in various points in the (x,y) plane gave the number of spanning forests of the graph, the number of its strongly connected orientations, the number of its proper k-colorings, the (all terminal) reliability probability of the graph, and various o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • “Go with the winners” algorithms

    Publication Year: 1994, Page(s):492 - 501
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    We can view certain randomized optimization algorithms as rules for randomly moving a particle around in a state space; each state might correspond to a distinct solution to the optimization problem, or more generally, the state space might express some other structure underlying the optimization algorithm. In this setting, a general paradigm for designing heuristics is to run several simulations ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-index hashing for information retrieval

    Publication Year: 1994, Page(s):722 - 731
    Cited by:  Papers (18)  |  Patents (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    We describe a technique for building hash indices for a large dictionary of strings. This technique permits robust retrieval of strings from the dictionary even when the query pattern has a significant number of errors. This technique is closely related to the classical Turan problem for hypergraphs. We propose a general method of multi-index construction by generalizing certain Turan hypergraphs.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On learning discretized geometric concepts

    Publication Year: 1994, Page(s):54 - 63
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    We present a polynomial time online learning algorithm that learns any discretized geometric concept generated from any number of halfspaces with any number of known (to the learner) slopes in a constant dimensional space. In particular, our algorithm learns (from equivalence queries only) unions of discretized axis-parallel rectangles in a constant dimensional space in polynomial time. The algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The localization problem for mobile robots

    Publication Year: 1994, Page(s):521 - 531
    Cited by:  Papers (17)  |  Patents (77)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    A fundamental task for an autonomous mobile robot is that of localization-determining its location in a known environment. This problem arises in settings that range from the computer analysis of aerial photographs to the design of autonomous Mars rovers. L. Guibas et al. ((1992) have given geometric algorithms for the problem of enumerating locations for a robot consistent with a given view of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Program result-checking: a theory of testing meets a test of theory

    Publication Year: 1994, Page(s):382 - 392
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    We review the field of result-checking, discussing simple checkers and self-correctors. We argue that such checkers could profitably be incorporated in software as an aid to efficient debugging and reliable functionality. We consider how to modify traditional checking methodologies to make them more appropriate for use in real-time, real-number computer systems. In particular, we suggest that chec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tail bounds for occupancy and the satisfiability threshold conjecture

    Publication Year: 1994, Page(s):592 - 603
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    The classical occupancy problem is concerned with studying the number of empty bins resulting from a random allocation of m balls to n bins. We provide a series of tail bounds on the distribution of the number of empty bins. These tail bounds should find application in randomized algorithms and probabilistic analysis. Our motivating application is the following well-known conjecture on threshold p... View full abstract»

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