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
    Save to Project icon | Request Permissions | 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)
    Save to Project icon | Request Permissions | 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 (31)
    Save to Project icon | Request Permissions | 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.
  • Speeding up dynamic programming

    Publication Year: 1988 , Page(s): 488 - 496
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (672 KB)  

    A number of important computational problems in molecular biology, geology, speech recognition, and other areas can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, the authors speed up the computation of several of these recurrences by one or two o... 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 (15)  |  Patents (1)
    Save to Project icon | Request Permissions | 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.
  • Sublinear-time parallel algorithms for matching and related problems

    Publication Year: 1988 , Page(s): 174 - 185
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | 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.
  • Effect of connectivity in associative memory models

    Publication Year: 1988 , Page(s): 138 - 147
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (672 KB)  

    The authors investigate how good connectivity properties translate into good error-correcting behavior in sparse networks of threshold elements. They determine how the eigenvalues of the interconnection graph (which in turn reflect connectivity properties) relate to the quantities, number of items stored, amount of error-correction, radius of attraction, and rate of convergence in an associative m... 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 (3)
    Save to Project icon | Request Permissions | 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 {xRn ; 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 ... 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
    Save to Project icon | Request Permissions | 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.
  • Efficient parallel algorithms for chordal graphs

    Publication Year: 1988 , Page(s): 150 - 161
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1012 KB)  

    The author gives efficient parallel algorithms for recognizing chordal graphs, finding a maximum clique and a maximum independent set in a chordal graph, finding an optimal coloring of a chordal graph, finding a breadth-first search tree and a depth-first search tree of a chordal graph, recognizing interval graphs, and testing interval graphs for isomorphism. The key to the results is an efficient... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators

    Publication Year: 1988 , Page(s): 296 - 305
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (700 KB)  

    Algorithms are developed that adopt a novel implicit representation for multivariate polynomials and rational functions with rational coefficients, that of black boxes for their evaluation. It is shown that within this evaluation-box representation, the polynomial greatest common divisor and factorization problems as well as the problem of extracting the numerator and denominator of a rational fun... View full abstract»

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

    Publication Year: 1988 , Page(s): 319 - 327
    Cited by:  Papers (34)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (636 KB)  

    Automata on infinite words were introduced by J.R. Buchi (1962) in order to give a decision procedure for S1S, the monadic second-order theory of one successor. D.E. Muller (1963) suggested deterministic ω-automata as a means of describing the behavior of nonstabilising circuits. R. McNaughton (1966) proved that classes of languages accepted by nondeterministic Buchi automata and by determin... 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)
    Save to Project icon | Request Permissions | 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.
  • Take a walk, grow a tree

    Publication Year: 1988 , Page(s): 469 - 478
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (644 KB)  

    A simple randomized algorithm is presented for maintaining dynamically evolving binary trees on hypercube networks. The algorithm guarantees that: (1) nodes adjacent in the tree are within distance O(log log N) in an N-processor hypercube, and (2) with overwhelming probability, no hypercube processor is assigned more than O(1+M/N) tree nodes, where M is... 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)
    Save to Project icon | Request Permissions | 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.
  • Fast management of permutation groups

    Publication Year: 1988 , Page(s): 272 - 282
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (968 KB)  

    Novel algorithms for computation in permutation groups are presented. They provide an order-of-magnitude improvement in the worst-case analysis of the basic permutation-group problems, including membership testing and computing the order of the group. For deeper questions about the group, including finding composition factors, an improvement of up to four orders of magnitude is realized. These and... 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 (7)
    Save to Project icon | Request Permissions | 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.
  • The complexity of tree automata and logics of programs

    Publication Year: 1988 , Page(s): 328 - 337
    Cited by:  Papers (23)
    Save to Project icon | Request Permissions | 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.
  • Bounds on the cover time

    Publication Year: 1988 , Page(s): 479 - 487
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | 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.
  • A fast planar partition algorithm. I

    Publication Year: 1988 , Page(s): 580 - 589
    Cited by:  Papers (12)  |  Patents (1)
    Save to Project icon | Request Permissions | 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.
  • Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time

    Publication Year: 1988 , Page(s): 246 - 255
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (844 KB)  

    The problem of efficiently performing Byzantine agreement in t +1 rounds in the face of arbitrarily malicious failures is treated. A communication-efficient polynomial-time protocol is presented for n>8t. The protocol is an early stopping protocol, halting in min{t+1, f+2} rounds in the worst case, where f is the number of processors that fa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predicting {0, 1}-functions on randomly drawn points

    Publication Year: 1988 , Page(s): 100 - 109
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (852 KB)  

    The authors consider the problem of predicting {0, 1}-valued functions on Rn and smaller domains, based on their values on randomly drawn points. Their model is related to L.G. Valiant's learnability model (1984), but does not require the hypotheses used for prediction to be represented in any specified form. The authors first disregard computational complexity and show how to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of the pigeonhole principle

    Publication Year: 1988 , Page(s): 346 - 355
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (872 KB)  

    The pigeonhole principle for n is the statement that there is no one-to-one function between a set of size n and a set of size n-1. This statement can be formulated as an unlimited-fan-in constant depth polynomial-size Boolean formula PHPn in n(n-1) variables, PHPn can be proved in the propositional calculus; that is, a sequence of... 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)
    Save to Project icon | Request Permissions | 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.
  • Homogeneous measures and polynomial time invariants

    Publication Year: 1988 , Page(s): 36 - 41
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | 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.