30th Annual Symposium on Foundations of Computer Science

Oct. 30 1989-Nov. 1 1989

Filter Results

Displaying Results 1 - 25 of 100
  • 30th Annual Symposium on Foundations of Computer Science (Cat. No.89CH2808-4)

    Publication Year: 1989
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • Characterizations of the basic feasible functionals of finite type

    Publication Year: 1989, Page(s):154 - 159
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    The authors define a simple typed while-programming language that generalizes the sort of simple language used in computability texts to define the familiar numerical computable functions and corresponds roughly to the μ-recursion of R.O. Gandy (1967). This language does not fully capture the notion of higher type computability. The authors define run times for their programs and prove that the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On reversal complexity for alternating Turing machines

    Publication Year: 1989, Page(s):618 - 623
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    The reversal complexity of alternating Turing machines (ATM) is investigated. The strict lower bounds on reversals for recognizing nonregular languages by Σk machines are settled. Some results relating reversal and space complexities are obtained View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Privacy and communication complexity

    Publication Year: 1989, Page(s):416 - 421
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    Each of two parties P1 and P2 holds an n-bit input, x and y, respectively. They wish to compute privately the value of f(x,y). Two questions are considered: (1) Which functions can be privately computed? (2) What is the communication complexity of protocols that privately compute a function f (i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decidability and expressiveness for first-order logics of probability

    Publication Year: 1989, Page(s):148 - 153
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    Decidability and expressiveness issues for two first-order logics of probability are considered. In one the probability is on possible worlds, whereas in the other it is on the domain. It turns out that in both cases it takes very little to make reasoning about probability highly undecidable. It is shown that, when the probability is on the domain, if the language contains only unary predicates, t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pipelining computations in a tree of processors

    Publication Year: 1989, Page(s):184 - 189
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    The computational power of a tree of processors is investigated. It is demonstrated that a tree of processors can solve certain problems impressively fast by exploiting the internal pipelining capabilities. Efficient tree algorithms are designed for two different problems: selection and maintaining dictionaries. It is shown that an O(log n)-height tree of processors can find the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal lower bound on the number of variables for graph identification

    Publication Year: 1989, Page(s):612 - 617
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    It is shown that Ω[n] variables are needed for first-order logic with counting to identify graphs on n vertices. This settles a long-standing open problem. The lower bound remains true over a set of graphs of color class size 4. This contrasts sharply with the fact that three variables suffice to identify all graphs of color class size 3, and two variables suffice to identi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards optimal distributed consensus

    Publication Year: 1989, Page(s):410 - 415
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    In a distributed consensus protocol all processors (of which t may be faulty) are given (binary) initial values; after exchanging messages all correct processors must agree on one of them. The quality of a protocol is measured here using as parameters the total number of processors n, number of rounds of message exchange r, and maximal message length m, with op... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper and lower bounds for routing schemes in dynamic networks

    Publication Year: 1989, Page(s):370 - 375
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    An algorithm and two lower bounds are presented for the problem of constructing and maintaining routing schemes in dynamic networks. The algorithm distributively assigns addresses to nodes and constructs routing tables in a dynamically growing tree. The resulting scheme routes data messages over the shortest path between any source and destination, assigns addresses of O(log2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Datalog vs. first-order logic

    Publication Year: 1989, Page(s):142 - 147
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    The relation between the expressive power of datalog and that of first-order languages, is clarified. It is then proved that every first-order expressible datalog query is bounded. A form of compactness theorem for finite structure implied by this result is examined, and counterexamples to natural generalizations of the above result are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient tree pattern matching

    Publication Year: 1989, Page(s):178 - 183
    Cited by:  Papers (16)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    A classic open problem on tree pattern matching is whether the naive O(mn)-step algorithm for finding all the occurrences of a pattern tree of size m in a text tree of size n can be improved. An O(nM0.75 polylog(m))-step algorithm for this tree pattern matching problem is designed. The problems of linear string matching with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating random spanning trees

    Publication Year: 1989, Page(s):442 - 447
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    The author describes a probabilistic algorithm that, given a connected, undirected graph G with n vertices, produces a spanning tree of G chosen uniformly at random among the spanning trees of G. The expected running time is O(n log n) per generated tree for almost all graphs, and O(n3) for the worst graphs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems

    Publication Year: 1989, Page(s):604 - 609
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    Given an undirected graph G with N vertices and a set P of N points in the plane, the geometric embedding problem consists of finding a bijection from the vertices of G to the points in the plane which minimize the sum total of edge lengths of the embedded graph. Fast approximation algorithms are given for embedding d-dimensional grids in the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structure in locally optimal solutions

    Publication Year: 1989, Page(s):216 - 221
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    A class of local search problems, PLS (polynomial-time local search), as defined by D.S. Johnson et al. (see J. Comput. Syst. Sci., vol.37, no.1, p.79-100 (1988)) is considered. PLS captures much of the structure of NP problems at the level of their feasible solutions and neighborhoods. It is first shown that CNF (conjunctive normal form) satisfiability is PLS-complete, even with simultaneously bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power of fast VLSI models is insensitive to wires' thinness

    Publication Year: 1989, Page(s):402 - 407
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    VLSI f-models which allow the switching time to decrease to f(D) when the length of all wires is restricted by D are called `fast' if the decrease is slightly superlinear. The fast models are so strong and robust that their computational power cannot be increased by and combination of the following: (1) making zero the width of each wire of length d, ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on the power of threshold circuits

    Publication Year: 1989, Page(s):580 - 584
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    The author presents a very simple proof of the fact that any language accepted by polynomial-size depth-k unbounded-fan-in circuits of AND and OR gates is accepted by depth-three threshold circuits of size n raised to the power O(logk n). The proof uses much of the intuition of S. Toda's result that the polynomial hierarchy is contained in P#P View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The strength of weak learnability

    Publication Year: 1989, Page(s):28 - 33
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    The problem of improving the accuracy of a hypothesis output by a learning algorithm in the distribution-free learning model is considered. A concept class is learnable (or strongly learnable) if, given access to a source of examples from the unknown concept, the learner with high probability is able to output a hypothesis that is correct on all but an arbitrarily small fraction of the instances. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network decomposition and locality in distributed computation

    Publication Year: 1989, Page(s):364 - 369
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    The authors introduce a concept of network decomposition, a partitioning of an arbitrary graph into small-diameter connected components, such that the graph created by contracting each component into a single node has low chromatic number. They present an efficient distributed algorithm for constructing such a decomposition and demonstrate its use for design of efficient distributed algorithms. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximation schemes for constrained scheduling problems

    Publication Year: 1989, Page(s):134 - 139
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    Several constrained scheduling problems are considered. The first polynomial approximation schemes for the problem of minimizing maximum completion time in a two-machine flow shop with release dates and for the problem of minimizing maximum lateness for the single and parallel-machine problem with release dates are described. All of these algorithms are based upon the notion of an outline, a set o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Full abstraction for nondeterministic dataflow networks

    Publication Year: 1989, Page(s):170 - 175
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    The problem of finding fully abstract semantic models for nondeterministic dataflow networks is discussed. The author presents a result indicating that there exist nondeterministic networks using only bounded choice for which the input-output relation is not compositional. It is shown that the trace semantics is fully abstract for all nondeterministic as well as deterministic networks View full abstract»

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

    Publication Year: 1989, Page(s):436 - 441
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    The incremental planarity testing problem consists of performing the following operations on a planar graph G with n vertices: (1) testing whether a new edge can be added to G so that the resulting graph is itself planar; (2) adding vertices and edges such that planarity is preserved. An efficient technique for incremental planarity testing that uses O(n View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Output-sensitive hidden surface removal

    Publication Year: 1989, Page(s):598 - 603
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Several output-sensitive algorithms for hidden surface removal in a collection of n horizontal triangles, viewed from a point at z=-∞, are derived. If k is the combinatorial complexity of the output visibility map, then the result is a simple (deterministic) algorithm that runs in time O(n√ k log n) and several improved and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning binary relations and total orders

    Publication Year: 1989, Page(s):46 - 51
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    The problem of designing polynomial prediction algorithms for learning binary relations is studied for an online model in which the instances are drawn by the learner, by a helpful teacher, by an adversary, or according to a probability distribution on the instance space. The relation is represented as an n×m binary matrix, and results are presented when the matrix is restr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds for algebraic computation trees with integer inputs

    Publication Year: 1989, Page(s):308 - 313
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    A proof is given of a general theorem showing that for certain sets W a certain topological lower bound is valid in the algebraic computation tree model, even if the inputs are restricted to be integers. The theorem can be used to prove tight lower bounds for the integral-constrained form of many basic problems, such as element distinctness, set disjointness, and finding the convex hull. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stable maintenance of point set triangulations in two dimensions

    Publication Year: 1989, Page(s):494 - 499
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    Geometric algorithms are explored, assuming that arithmetic is done approximately. Stable algorithms are described for two geometric problems. The first algorithm computes two-dimensional convex hulls. The main result is that a triangulation of a set of points in the plane can be maintained stably. The second algorithm deals with line arrangements in the plane View full abstract»

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