Scheduled System Maintenance
On Wednesday, December 20, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science

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.
  • A deterministic view of random sampling and its use in geometry

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

    A number of efficient probabilistic algorithms based on the combination of divide-and-conquer and random sampling have been recently discovered. It is shown that all those algorithms can be derandomized with only polynomial overhead. In the process. results of independent interest concerning the covering of hypergraphs are established, and various probabilistic bounds in geometry complexity are im... 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.
  • 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 (74)  |  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.
  • 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.
  • Polytopes, permanents and graphs with large factors

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

    Randomized algorithms for approximating the number of perfect matchings in a graph are considered. An algorithm that is a natural simplification of one suggested and analyzed previously is introduced and analyzed. One of the key ideas is to view the analysis from a geometric perspective: it is proved that for any graph G the k-slice of the well-known Edmonds matching polytope has... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Near-optimal time-space tradeoff for element distinctness

    Publication Year: 1988, Page(s):91 - 97
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    It was conjectured by A. Borodin et al. that to solve the element distinctness problem requires TS=Ω(n2) on a comparison-based branching program using space S and time T, which, if true, would be close to optimal since TS=O(n2 log n) is achievable. They showed recently (1987) that TS=Ω(n<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verifying temporal properties of finite-state probabilistic programs

    Publication Year: 1988, Page(s):338 - 345
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    The complexity of testing whether a finite-state (sequential or concurrent) probabilistic program satisfies its specification expressed in linear temporal logic. For sequential programs an exponential-time algorithm is given and it is shown that the problem is in PSPACE; this improves the previous upper bound by two exponentials and matches the known lower bound. For concurrent programs is is show... 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.
  • Learning via queries

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

    The power of various query languages is compared along two dimensions, namely the inherent power of the language and the number of alternations of quantizers. Learning by asking questions is compared to learning by passively reading data. It is found that the extent of what can be learned by queries is largely dependent on the language used by the inference mechanism to formulate questions to ask ... 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.
  • Lattices, mobius functions and communications complexity

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

    A general framework for the study of a broad class of communication problems is developed. It is based on a recent analysis of the communication complexity of graph connectivity. The approach makes use of combinatorial lattice theory 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 (26)  |  Patents (3)
    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.
  • The complexity of tree automata and logics of programs

    Publication Year: 1988, Page(s):328 - 337
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    The computational complexity of testing nonemptiness of finite-state automata on infinite trees is investigated. It is shown that for tree automata with m states and n pairs nonemptiness can be tested in time O((mn)3n), even though the problem is in general NP-complete. The nonemptiness algorithm is used to obtain exponentially improved, essentially tight uppe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal packet routing algorithms

    Publication Year: 1988, Page(s):256 - 269
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1312 KB)

    The packet-routing problem is examined in a network-independent context. The goal is to devise a strategy for routing that works well for a wide variety of networks. To achieve this goal, the routing problem is partitioned into two stages: a path-selection stage and a scheduling stage. In the first stage, paths for the packets are found with small maximum distance and small maximum congestion. Onc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Notes on searching in multidimensional monotone arrays

    Publication Year: 1988, Page(s):497 - 512
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1324 KB)

    A two-dimensional array A={ai,j} is called monotone if the maximum entry in its ith row lies below or to the right of the maximum entry in its (i- 1)-st row. An array A is called totally monotone if every 2×2 subarray (i.e., every 2×2 minor) is monotone. The notion of two-dimensional totally monotone arrays is generalized to multi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the effects of feedback in dynamic network protocols

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

    A framework is introduced that provides a unified way for proving correctness as well as analyzing performance of a class of communication protocols called (asynchronous) reset protocols. They are logarithmic transformers, converting protocols working in a static asynchronous network into protocols working in a dynamic asynchronous network. The design of reset protocols is a classical problem in c... 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.
  • Removing randomness in parallel computation without a processor penalty

    Publication Year: 1988, Page(s):162 - 173
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    Some general techniques are developed for removing randomness from randomized NC algorithms without a blowup in the number of processors. One of the requirements for the application of these techniques is that the analysis of the randomized algorithm uses only pairwise independence. The main new result is a parallel algorithm for the Δ+1 vertex coloring problem with running time O(l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A faster PSPACE algorithm for deciding the existential theory of the reals

    Publication Year: 1988, Page(s):291 - 295
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    The decision problem for the existential theory of the reals is the problem of deciding if the set {x∈Rn ; P(x) is nonempty, where P(x) is a predicate which is a Boolean function of atomic predicates either of which is a Boolean function of atomic predicates either of the form fi(x)⩾0 or f View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast planar partition algorithm. I

    Publication Year: 1988, Page(s):580 - 589
    Cited by:  Papers (17)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    A fast randomized algorithm is given for finding a partition of the plane induced by a given set of linear segments. The algorithm is ideally suited for a practical use because it is extremely simple and robust, as well as optimal; its expected running time is O(m+ n log n) where n is the number of input segments and m is the number of points of interse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the cover time

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

    A particle that moves on a connected unidirected graph G with n vertices is considered. At each step the particle goes from the current vertex to one of its neighbors, chosen uniformly at random. The cover time is the first time when the particle has visited all the vertices in the graph, starting from a given vertex. Upper and lower bounds are presented that relate the expected ... 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 (13)
    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.