By Topic

[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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Effect of connectivity in associative memory models

    Publication Year: 1988, Page(s):138 - 147
    Cited by:  Papers (4)
    Request permission for commercial reuse | 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.
  • 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.
  • 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.
  • 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.
  • A Las Vegas algorithm for linear programming when the dimension is small

    Publication Year: 1988, Page(s):452 - 456
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    An algorithm for solving linear programming problems is given. The expected number of arithmetic operations required by the algorithm is given. The expectation is with respect to the random choices made by the algorithm, and the bound holds for any given input. The technique can be extended to other convex programming problems 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.
  • 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.
  • Learning probabilistic prediction functions

    Publication Year: 1988, Page(s):110 - 119
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB)

    The question of how to learn rules, when those rules make probabilistic statements about the future, is considered. Issues are discussed that arise when attempting to determine what a good prediction function is, when those prediction functions make probabilistic assumptions. Learning has at least two purposes: to enable the learner to make predictions in the future and to satisfy intellectual cur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the existence of pseudorandom generators

    Publication Year: 1988, Page(s):12 - 24
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    Pseudorandom generators are known to exist, assuming the existence of functions that cannot be efficiently inverted on the distributions induced by applying the function iteratively polynomially many times. This sufficient condition is also necessary, but it is difficult to check whether particular functions, assumed to be one-way, are also one-way on their iterates. This raises the fundamental qu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New algorithms for finding irreducible polynomials over finite fields

    Publication Year: 1988, Page(s):283 - 290
    Cited by:  Papers (11)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    An algorithm is presented for finding an irreducible polynomial of specified degree over a finite field. It is deterministic and runs in polynomial time for fields of small characteristics. A proof is given of the stronger result, that the problem of finding irreducible polynomials of specified degree over a finite field K is deterministic-polynomial-time reducible to the problem of facto... 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.
  • Homogeneous measures and polynomial time invariants

    Publication Year: 1988, Page(s):36 - 41
    Cited by:  Papers (4)
    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.
  • Lower bounds for integer greatest common divisor computations

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

    An Ω(log log n) lower bound is proved on the depth of any computation tree with operations {+, -, /, mod, ⩽} that computes the greatest common divisor (GCD) of all pairs of n-bit integers. A novel technique for handling the truncation operation is implicit in the proof. Also proved is a Θ(n) bound on the depth of any algebraic computation trees with opera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel comparison algorithms for approximation problems

    Publication Year: 1988, Page(s):194 - 203
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    The authors consider that they have n elements from a totally ordered domain and are allowed to perform p parallel comparisons in each time unit (round). They determine, up to a constant factor, the time complexity of several approximation problems in the common parallel comparison tree model of L.G. Valiant, for all admissible values of n, p, and ε, where ... 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.
  • 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.
  • 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.
  • 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.