By Topic

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
  • 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.
  • Lower bounds on Hilbert's Nullstellensatz and propositional proofs

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

    The weak form of the Hilbert's Nullstellensatz says that a system of algebraic equations over a field, Qi(x¯)=0, does not have a solution in the algebraic closure iff 1 is in the ideal generated by the polynomials Qi(x¯). We shall prove a lower bound on the degrees of polynomials Pi(x¯) such that Σ i Pi(x¯)Qi 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.
  • 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.
  • On the power of quantum computation

    Publication Year: 1994, Page(s):116 - 123
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    The quantum model of computation is a probabilistic model, similar to the probabilistic Turing Machine, in which the laws of chance are those obeyed by particles on a quantum mechanical scale, rather than the rules familiar to us from the macroscopic world. We present here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster ... 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.
  • 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.
  • 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.
  • Measure on small complexity classes, with applications for BPP

    Publication Year: 1994, Page(s):807 - 818
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    We present a notion of resource-bounded measure for P and other subexponential-time classes. This generalization is based on Lutz's notion of measure, but overcomes the limitations that cause Lutz's definitions to apply only to classes at least as large as E. We present many of the basic properties of this measure, and use it to explore the class of sets that are hard for BPP. Bennett and Gill sho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast and lean self-stabilizing asynchronous protocols

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

    We consider asynchronous general topology dynamic networks of identical nameless nodes with worst-case transient faults. Starting from any faulty configuration, our protocols self-stabilize any computation in time polynomial in the (unknown) network diameter. This version sacrifices some diversity of tasks and efficiency for simplicity and clarity of details. Appendix gives more efficient procedur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond competitive analysis [on-line algorithms]

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

    The competitive analysis of on-line algorithms has been criticized as being too crude and unrealistic. We propose two refinements of competitive analysis an two directions: The first restricts the power of the adversary by allowing only certain input distributions, while the other allows for comparisons between information regimes for on-line decision-making. We illustrate the first with an applic... 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.
  • A polynomial-time algorithm for deciding equivalence of normed context-free processes

    Publication Year: 1994, Page(s):623 - 631
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    A polynomial-time procedure is presented for deciding bisimilarity of normed context-free processes. It follows as a corollary that language equivalence of simple context-free grammars is decidable in polynomial time View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The power of team exploration: two robots can learn unlabeled directed graphs

    Publication Year: 1994, Page(s):75 - 85
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new type of homing sequence for two robots which helps the robots recognize certain previously-seen nodes. We then present an algorithm in which the robots learn the graph and the homing sequence simultaneously by wandering acti... View full abstract»

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

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

    We present a new class of asymptotically good, linear error-correcting codes based upon expander graphs. These codes have linear time sequential decoding algorithms, logarithmic time parallel decoding algorithms with a linear number of processors, and are simple to understand. We present both randomized and explicit constructions for some of these codes. Experimental results demonstrate the extrem... View full abstract»

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

    Publication Year: 1994, Page(s):604 - 612
    Cited by:  Papers (31)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    We introduce a novel approach for sending messages over lossy packet-based networks. The new method, called Priority Encoding Transmission, allows a user to specify a different priority on each segment of the message. Based on the priorities, the sender uses the system to encode the segments into packets for transmission. The system ensures recovery of the segments in order of their priority. The ... 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.
  • Complexity lower bounds for computation trees with elementary transcendental function gates

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

    We consider computation trees which admit as gate functions along with the usual arithmetic operations also algebraic or transcendental functions like exp, log, sin, square root (defined in the relevant domains) or much more general, Pfaffian functions. A new method for proving lower bounds on the depth of these trees is developed which allows to prove a lower bound Ω(√(log N)) for tes... 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.
  • 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.
  • On syntactic versus computational views of approximability

    Publication Year: 1994, Page(s):819 - 830
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1016 KB)

    We attempt to reconcile the two distinct views of approximation classes: syntactic and computational. Syntactic classes such as MAX SNP permit structural results and have natural complete problems, while computational classes such as APX allow us to work with classes of problems whose approximability is well-understood. Our results provide a syntactic characterization of computational classes, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation

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

    The work is motivated by deadlock resolution and resource allocation problems, occurring in distributed server-client architectures. We consider a very general setting which includes, as special cases, distributed bandwidth management in communication networks, as well as variations of classical problems in distributed computing and communication networking such as deadlock: resolution and “... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fully dynamic cycle-equivalence in graphs

    Publication Year: 1994, Page(s):744 - 755
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    Two edges e1 and e2 of an undirected graph are cycle-equivalent iff all cycles that contain e1 also contain e2, i.e., iff e1 and e2 are a cut-edge pair. The cycle-equivalence classes of the control-flow graph are used in optimizing compilers to speed up existing control-flow and data-flow algorithms. While the cycle-equivalence clas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding separator cuts in planar graphs within twice the optimal

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

    Building on the works of S.B. Rao (1987, 1992) and J.K. Park and C.A. Phillips (1993), we present a factor 2 approximation algorithm for the problem of finding a minimum cost b-balanced cut in planar graphs, for b⩽1/3, if the vertex weights are given in unary (using scaling, a psuedo-approximation algorithm is also presented for the case of binary vertex weights). This problem is of considerab... View full abstract»

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