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
  • Graph connectivity and monadic NP

    Publication Year: 1994, Page(s):614 - 622
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    Ehrenfeucht games are a useful tool in proving that certain properties of finite structures are not expressible by formulas of a certain type. In this paper a new method is introduced that allows the extension of a local winning strategy for Duplicator, one of the two players in Ehrenfeucht games, to a global winning strategy. As an application it is shown that graph connectivity cannot be express... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Motion planning on a graph

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

    We are given a connected, undirected graph G on n vertices. There is a mobile robot on one of the vertices; this vertex is labeled s. Each of several other vertices contains a single movable obstacle. The robot and the obstacles may only reside at vertices, although they may be moved across edges. A vertex may never contain more than one object (robot/obstacle). In one step, we may move either the... 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 localization problem for mobile robots

    Publication Year: 1994, Page(s):521 - 531
    Cited by:  Papers (18)  |  Patents (78)
    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.
  • 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.
  • Algebraic computation trees in characteristic p>0

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

    We provide a simple and powerful combinatorial method for proving lower bounds for algebraic computation trees over algebraically closed fields of characteristic p>0. We apply our method to prove, for example, an Ω(n log n) lower bound for the n element distinctness problem, an Ω(n log(n/k)) lower bound to the “k-equal problem”-that is deciding whether there are k identi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithmic number theory-the complexity contribution

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

    Though algorithmic number theory is one of man's oldest intellectual pursuits, its current vitality is perhaps unrivalled in history. This is due in part to the injection of new ideas from computational complexity. In this paper, a brief history of the symbiotic relationship between number theory and complexity theory will be presented. In addition, some of the technical aspects underlying `modern... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line admission control and circuit routing for high performance computing and communication

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

    This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit routing problems arise in numerous applications, including video-servers, real-lime database servers, and the provision of permanent virtual channel in large-scale communications networks. The paper describes both upper an... 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 (7)
    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.
  • Multi-index hashing for information retrieval

    Publication Year: 1994, Page(s):722 - 731
    Cited by:  Papers (21)  |  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.
  • Fast and lean self-stabilizing asynchronous protocols

    Publication Year: 1994, Page(s):226 - 239
    Cited by:  Papers (7)
    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.
  • An O(n1+ϵ log b) algorithm for the complex roots problem

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

    Given a univariate polynomial f(z) of degree n with complex coefficients, whose real and imaginary parts can be expressed as a ratio of two integers less than 2m in magnitude, the root problem is to find all the roots of f(z) up to specified precision 2-μ . Assuming the arithmetic model for computation, we provide, for any ε>0, an algorithm which has complexity O(n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate graph coloring by semidefinite programming

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

    We consider the problem of coloring k-colorable graphs with the fewest possible colors. We give a randomized polynomial time algorithm which colors a 3-colorable graph on n vertices with min {O(Δ1/3log4/3Δ), O(n1/4 log n)} colors where Δ is the maximum degree of any vertex. Besides giving the best known approximation ratio in terms of n, this mark... 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 (67)
    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.
  • “Go with the winners” algorithms

    Publication Year: 1994, Page(s):492 - 501
    Cited by:  Papers (15)  |  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.
  • Randomized and deterministic algorithms for geometric spanners of small diameter

    Publication Year: 1994, Page(s):703 - 712
    Cited by:  Papers (11)
    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.
  • IP over connection-oriented networks and distributional paging

    Publication Year: 1994, Page(s):424 - 434
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    Next generation wide area network are very likely to use connection-oriented protocols such as Asynchronous Transfer Mode (ATM). For the huge existing investment in current IP networks such as the Internet to remain useful, me must devise mechanisms to carry IP traffic over connection-oriented networks. A basic issue is to devise holding policies for virtual circuits carrying datagrams. In this pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithms for higher-dimensional convex hulls

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

    We give fast randomized and deterministic parallel methods for constructing convex hulls in Rd, for any fixed d. Our methods are for the weakest shared-memory model, the EREW PRAM, and have optimal work bounds (with high probability for the randomized methods). In particular, we show that the convex hull of n points in Rd can be constructed in O(log n) time ... 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 (14)
    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.
  • Optimizing static calendar queues

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

    The calendar queue is an important implementation of a priority queue which is particularly useful in discrete event simulators. In this paper we present an analysis of the static calendar queue which maintains N active events. A step of the discrete event simulator removes and processes the event with the smallest associated time and inserts a new event whose associated time is the time of the re... 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.
  • Long tours and short superstrings

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

    This paper considers weight-maximizing variants of the classical symmetric and asymmetric traveling-salesman problems. Like their weight-minimizing counterparts, these variants are MAX SNP-hard. We present the first nontrivial approximation algorithms for these problems. Our algorithm for directed graphs finds a tour whose weight is at least 38/63≈0.603 times the weight of a maximum-weight tour... 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.
  • 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.