By Topic

Foundations of Computer Science, 1988., 29th Annual Symposium on

Date 24-26 Oct. 1988

Filter Results

Displaying Results 1 - 25 of 60
  • 29th Annual Symposium on Foundations of Computer Science (IEEE Cat. No.88CH2652-6)

    Publication Year: 1988
    Request permission for commercial reuse | PDF file iconPDF (251 KB)
    Freely Available from IEEE
  • Results on learnability and the Vapnik-Chervonenkis dimension

    Publication Year: 1988, Page(s):120 - 129
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    The problem of learning a concept from examples in a distribution-free model is considered. The notion of dynamic sampling, wherein the number of examples examined can increase with the complexity of the target concept, is introduced. This method is used to establish the learnability of various concept classes with an infinite Vapnik-Chervonenkis (VC) dimension. An important variation on the probl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of kinodynamic planning

    Publication Year: 1988, Page(s):306 - 316
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    The following problem, is considered: given a robot system find a minimal-time trajectory from a start position and velocity to a goal position and velocity, while avoiding obstacles and respecting dynamic constraints on velocity and acceleration. The simplified case of a point mass under Newtonian mechanics together with velocity and acceleration bounds is considered. The point must be flown from... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructive results from graph minors: linkless embeddings

    Publication Year: 1988, Page(s):398 - 409
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    A formal study of three-dimensional topological graph theory is initiated. The problem of deciding whether a graph can be embedded in 3-space so that no collection of vertex-disjoint cycles is topologically linked is considered first. The Robertson-Seymour Theory of Graph Minors is applicable to this problem and guarantees the existence of an O(n 3) algorithm for the decision p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines

    Publication Year: 1988, Page(s):387 - 397
    Cited by:  Papers (8)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    A model for computation over an arbitrary (ordered) ring R is presented. In this general setting, universal machines, partial recursive functions, and NP-complete problems are obtained. While the theory reflects of classical over Z (e.g. the computable functions are the recursive functions), it also reflects the special mathematical character of the underlying ring R (e.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonexpressibility of fairness and signaling

    Publication Year: 1988, Page(s):377 - 386
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    Expressiveness results for indeterminate data flow primitives are established. Choice primitives with three differing fairness assumptions are considered, and it is shown that they are strictly inequivalent in expressive power. It is also shown that the ability to announce choices enhances the expressive power of two of the primitives. These results are proved using a very crude semantics and will... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On pointers versus addresses

    Publication Year: 1988, Page(s):532 - 538
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    The problem of determining the cost of random-access memory (RAM) is addressed by studying the simulation of random addressing by a machine which lacks it, called a pointer machine. The model allows the use of a data type of choice. A RAM program of time t and space s can be simulated in O(t log s) time using a tree. However, this is not an obvious lowe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial algorithm for the k-cut problem

    Publication Year: 1988, Page(s):444 - 451
    Cited by:  Papers (24)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    The k-cut problem is to find a partition of an edge weighted graph into k nonempty components, such that the total edge weight between components is minimum. This problem is NP-complete for arbitrary k and its version involving fixing a vertex in each component is NP hard even for k=3. A polynomial algorithm for the case of a fixed k is presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphs

    Publication Year: 1988, Page(s):186 - 193
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    G.A. Dirac's classical theorem (1952) asserts that if every vertex of a graph G on n vertices has degree at least n /2, the G has a Hamiltonian cycle. A fast parallel algorithm on a concurrent-read-exclusive-write parallel random-access machine (CREW PRAM) is given to find a Hamiltonian cycle in such graphs. The algorithm uses a linear number of processors and i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fully abstract models of the lazy lambda calculus

    Publication Year: 1988, Page(s):368 - 376
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Much of what is known about the model theory and proof theory of the λ-calculus is sensible in nature, i.e. only head normal forms are semantically meaningful. However, most functional languages are lazy, i.e. programs are evaluated in normal order to weak head normal forms. The author develops a theory of lazy or strongly sensible λ-calculus that corresponds to practice. A general m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Homogeneous measures and polynomial time invariants

    Publication Year: 1988, Page(s):36 - 41
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    The usual probability distributions are concentrated on strings that do not differ noticeably in any fundamental characteristics, except their informational size (Kolmogorov complexity). The formalization of this statement is given and shown to distinguish a class of homogeneous probability measures suggesting various applications. In particular, it could explain why the average case NP-completene... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic perfect hashing: upper and lower bounds

    Publication Year: 1988, Page(s):524 - 531
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    A randomized algorithm is given for the dictionary problem with O(1) worst-case time for lookup and O(1) amortized expected time for insertion and deletion. An Ω(log n) lower bound is proved for the amortized worst-case time complexity of any deterministic algorithm in a class of algorithms encompassing realistic hashing-based schemes. If the worst-case lookup time... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinatorial algorithms for the generalized circulation problem

    Publication Year: 1988, Page(s):432 - 443
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1028 KB)

    A generalization of the maximum-flow problem is considered in which the amounts of flow entering and leaving an arc are linearly related. More precisely, if x(e) units of flow enter an arc e, x(e)λ(e) units arrive at the other end. For instance, nodes of the graph can correspond to different currencies, with the multipliers being the exc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fully dynamic techniques for point location and transitive closure in planar structures

    Publication Year: 1988, Page(s):558 - 567
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    It is shown that a planar st-graph G admits two total orders on the set VEF, where V, E, and F are, respectively, the sets of vertices, edges and faces of G, with |V|=n. An O(n) space data structure for the maintenance of the two orders is exhibited that supports an update of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Increasing the size of a network by a constant factor can increase performance by more than a constant factor

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

    In one routing scheme which has been implemented on a parallel architecture based on the butterfly graph, messages are sometimes destroyed. It is shown that if messages are sent to random destinations, the expected number of messages that reach their destinations is Θ(n(log n)-1/q), where n is the size of the butterfly graph and q is the number of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound for matrix multiplication

    Publication Year: 1988, Page(s):64 - 67
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    It is proved that computing the product of two n× n matrices over the binary field requires at least 2.5n2-O(n2) multiplications View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal algorithm for intersecting line segments in the plane

    Publication Year: 1988, Page(s):590 - 600
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 KB)

    The authors present the first optimal algorithm for the following problem: given n line segments in the plane, compute all k pairwise intersections in O(n log n+k) time. Within the same asymptotic cost the algorithm will also compute the adjacencies of the planar subdivision induced by the segments, which is a useful data structure for contour-filling ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sublinear-time parallel algorithms for matching and related problems

    Publication Year: 1988, Page(s):174 - 185
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 KB)

    The authors present the first sub-linear-time deterministic parallel algorithms for bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. The results are based on a better understanding of the combinatorial structure of the above problems, which lead to new algorithmic techniques. In particular, it is shown how t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reachability is harder for directed than for undirected finite graphs

    Publication Year: 1988, Page(s):358 - 367
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    It is shown that for directed graphs, reachability can not be expressed by an existential monadic second-order sentence. The proof makes use of Ehrenfeucht-Fraisse games, along with probabilistic. However, it is shown that for directed graphs with degree at most k , reachability is expressible by an existential monadic second-order sentence. One reason for the interest in the main result ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-knowledge with log-space verifiers

    Publication Year: 1988, Page(s):25 - 35
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    Interactive proof systems are considered in which the best set of possible verifiers is restricted to the class of probabilistic log-space automata. A. Condon (1988) introduced this model and showed that if the protocols are allowed to run for arbitrarily many rounds, exponential-time languages can be proved to a log-space verifier. To better approximate the usual notion of interactive proof syste... View full abstract»

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

    Publication Year: 1988, Page(s):514 - 523
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    The storage allocation for three stacks has been traditionally accomplished by using pointers to store the stacks as linked lists or by relocating the stacks within memory when collisions take place. The former approach requires additional space to store the pointers, and the latter approach requires additional time. The authors explore the extent to which some additional space or time is required... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms

    Publication Year: 1988, Page(s):422 - 431
    Cited by:  Papers (72)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    A multicommodity flow problem is considered where for each pair of vertices (u, v) it is required to send f half-units of commodity (u, v) from u to v and f half-units of commodity (v, u) from v to u without violating capacity constraints. The main result is an algorithm for performing the t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New upper bounds in Klee's measure problem

    Publication Year: 1988, Page(s):550 - 556
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    New upper bounds are given for the measure problem of V. Klee (1977) that significantly improve the previous bounds for dimensions greater than 2. An O(nd/2 log n, n) time-space upper bound to compute the measure of a set of n boxes in Euclidean d-space is obtained. The solution requires several novel ideas including application of the inclus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genus g graphs have pagenumber O(√g)

    Publication Year: 1988, Page(s):458 - 468
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    A book embedding of a graph consists of a linear ordering of the vertices along the spine of a book and an assignment of edges to pages so that edges on the same page do not intersect. The minimum number of pages in which a graph can be embedded is its pagenumber. The following results are presented: (1) any graph of genus g has pagenumber O(√g); and (2) most n-ver... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic networks are as fast as static networks

    Publication Year: 1988, Page(s):206 - 219
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    An efficient simulation is given to show that dynamic networks are as fast as static ones up to a constant multiplicative factor. That is, any task can be performed in a dynamic asynchronous network essentially as fast as in a static synchronous network. The simulation protocol is based on an approach in which locality is perceived as the key to fast adaptation to changes in network topology. The ... View full abstract»

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