1. Home
  2. Proceedings
  3. FOCS
  4. FOCS 1988
Default Cover Image

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

Oct. 24 1988 to Oct. 26 1988

White Plains, NY, USA

ISBN: 0-8186-0877-3

Table of Contents

Papers
Hardness vs. randomnessFull-text access may be available. Sign in or learn about subscription options.pp. 2-11
by N. Nisan, A. Wigderson
Papers
On the existence of pseudorandom generatorsFull-text access may be available. Sign in or learn about subscription options.pp. 12-24
by O. Goldreich, H. Krawczyk, M. Luby
Papers
Zero-knowledge with log-space verifiersFull-text access may be available. Sign in or learn about subscription options.pp. 25-35
by J. Kilian
Papers
Homogeneous measures and polynomial time invariantsFull-text access may be available. Sign in or learn about subscription options.pp. 36-41
by L.A. Levin
Papers
Achieving oblivious transfer using weakened security assumptionsFull-text access may be available. Sign in or learn about subscription options.pp. 42-52
by C. Crepeau, J. Kilian
Papers
Lower bounds for integer greatest common divisor computationsFull-text access may be available. Sign in or learn about subscription options.pp. 54-63
by Y. Mansour, B. Schieber, P. Tiwari
Papers
A lower bound for matrix multiplicationFull-text access may be available. Sign in or learn about subscription options.pp. 64-67
by N.H. Bshouty
Papers
The influence of variables on Boolean functionsFull-text access may be available. Sign in or learn about subscription options.pp. 68-80
by J. Kahn, G. Kalai, N. Linial
Papers
Lattices, mobius functions and communications complexityFull-text access may be available. Sign in or learn about subscription options.pp. 81-90
by L. Lovasz, M. Saks
Papers
Near-optimal time-space tradeoff for element distinctnessFull-text access may be available. Sign in or learn about subscription options.pp. 91-97
by A.C.-C. Yao
Papers
29th Annual Symposium on Foundations of Computer Science (IEEE Cat. No.88CH2652-6)Freely available from IEEE.pp. 0_1-0_1
Papers
Predicting (0, 1)-functions on randomly drawn pointsFull-text access may be available. Sign in or learn about subscription options.pp. 100-109
by D. Haussler, N. Littlestone, M.K. Warmuth
Papers
Learning probabilistic prediction functionsFull-text access may be available. Sign in or learn about subscription options.pp. 110-119
by A. DeSantis, G. Markowsky, M.N. Wegman
Papers
Results on learnability and the Vapnik-Chervonenkis dimensionFull-text access may be available. Sign in or learn about subscription options.pp. 120-129
by N. Linial, Y. Mansour, R.L. Rivest
Papers
Learning via queriesFull-text access may be available. Sign in or learn about subscription options.pp. 130-137
by W.I. Gasarch
Papers
Effect of connectivity in associative memory modelsFull-text access may be available. Sign in or learn about subscription options.pp. 138-147
by J. Komlos, R. Paturi
Papers
Efficient parallel algorithms for chordal graphsFull-text access may be available. Sign in or learn about subscription options.pp. 150-161
by P.N. Klein
Papers
Removing randomness in parallel computation without a processor penaltyFull-text access may be available. Sign in or learn about subscription options.pp. 162-173
by M. Luby
Papers
Sublinear-time parallel algorithms for matching and related problemsFull-text access may be available. Sign in or learn about subscription options.pp. 174-185
by A.V. Goldberg, S.A. Plotkin, P.M. Vaidya
Papers
Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphsFull-text access may be available. Sign in or learn about subscription options.pp. 186-193
by E. Dahlhaus, P. Hajnal, M. Karpinski
Papers
Parallel comparison algorithms for approximation problemsFull-text access may be available. Sign in or learn about subscription options.pp. 194-203
by N. Alon, Y. Azar
Papers
Dynamic networks are as fast as static networksFull-text access may be available. Sign in or learn about subscription options.pp. 206-219
by B. Awerbuch, M. Sipser
Papers
Increasing the size of a network by a constant factor can increase performance by more than a constant factorFull-text access may be available. Sign in or learn about subscription options.pp. 221-230
by R.R. Kock
Papers
On the effects of feedback in dynamic network protocolsFull-text access may be available. Sign in or learn about subscription options.pp. 231-245
by B. Awerbuch
Papers
Coordinated traversal: (t+1)-round Byzantine agreement in polynomial timeFull-text access may be available. Sign in or learn about subscription options.pp. 246-255
by Y. Moses, O. Waarts
Papers
Universal packet routing algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 256-269
by T. Leighton, B. Maggs, S. Rao
Papers
Fast management of permutation groupsFull-text access may be available. Sign in or learn about subscription options.pp. 272-282
by L. Babai, E.M. Luks, A. Seress
Papers
New algorithms for finding irreducible polynomials over finite fieldsFull-text access may be available. Sign in or learn about subscription options.pp. 283-290
by V. Shoup
Papers
A faster PSPACE algorithm for deciding the existential theory of the realsFull-text access may be available. Sign in or learn about subscription options.pp. 291-295
by J. Renegar
Papers
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominatorsFull-text access may be available. Sign in or learn about subscription options.pp. 296-305
by E. Kaltofen, B. Trager
Papers
On the complexity of kinodynamic planningFull-text access may be available. Sign in or learn about subscription options.pp. 306-316
by J. Canny, B. Donald, J. Reif, P. Xavier
Papers
On the complexity of omega -automataFull-text access may be available. Sign in or learn about subscription options.pp. 319-327
by S. Safra
Papers
The complexity of tree automata and logics of programsFull-text access may be available. Sign in or learn about subscription options.pp. 328-337
by E.A. Emerson, C.S. Jutla
Papers
Verifying temporal properties of finite-state probabilistic programsFull-text access may be available. Sign in or learn about subscription options.pp. 338-345
by C. Courcoubetis, M. Yannakakis
Papers
The complexity of the pigeonhole principleFull-text access may be available. Sign in or learn about subscription options.pp. 346-355
by M. Ajtai
Papers
Reachability is harder for directed than for undirected finite graphsFull-text access may be available. Sign in or learn about subscription options.pp. 358-367
by M. Ajtai, R. Fagin
Papers
Fully abstract models of the lazy lambda calculusFull-text access may be available. Sign in or learn about subscription options.pp. 368-376
by C.-H.L. Ong
Papers
Nonexpressibility of fairness and signalingFull-text access may be available. Sign in or learn about subscription options.pp. 377-386
by D. McAllester, P. Panangaden, V. Shanbhogue
Papers
On a theory of computation over the real numbers; NP completeness, recursive functions and universal machinesFull-text access may be available. Sign in or learn about subscription options.pp. 387-397
by L. Blum, M. Shub, S. Smale
Papers
Constructive results from graph minors: linkless embeddingsFull-text access may be available. Sign in or learn about subscription options.pp. 398-409
by R. Motwani, A. Raghunathan, H. Saran
Papers
Polytopes, permanents and graphs with large factorsFull-text access may be available. Sign in or learn about subscription options.pp. 412-421
by P. Dagum, M. Luby, M. Mihail, U. Vazirani
Papers
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 422-431
by T. Leighton, S. Rao
Papers
Combinatorial algorithms for the generalized circulation problemFull-text access may be available. Sign in or learn about subscription options.pp. 432-443
by A.V. Goldberg, S.A. Plotkin, E. Tardos
Papers
Polynomial algorithm for the k-cut problemFull-text access may be available. Sign in or learn about subscription options.pp. 444-451
by O. Goldschmidt, D.S. Hochbaum
Papers
A Las Vegas algorithm for linear programming when the dimension is smallFull-text access may be available. Sign in or learn about subscription options.pp. 452-456
by K.L. Clarkson
Papers
Genus g graphs have pagenumber O( square root g)Full-text access may be available. Sign in or learn about subscription options.pp. 458-468
by S.M. Malitz
Papers
Take a walk, grow a treeFull-text access may be available. Sign in or learn about subscription options.pp. 469-478
by S. Bhatt, Jin-Yi Cai
Papers
Bounds on the cover timeFull-text access may be available. Sign in or learn about subscription options.pp. 479-487
by A.Z. Broder, A.R. Karlin
Papers
Speeding up dynamic programmingFull-text access may be available. Sign in or learn about subscription options.pp. 488-496
by D. Eppstein, Z. Galil, R. Giancarlo
Papers
Notes on searching in multidimensional monotone arraysFull-text access may be available. Sign in or learn about subscription options.pp. 497-512
by A. Aggarwal, J. Park
Papers
Three stacksFull-text access may be available. Sign in or learn about subscription options.pp. 514-523
by M.L. Fredman, D.L. Goldsmith
Papers
Dynamic perfect hashing: upper and lower boundsFull-text access may be available. Sign in or learn about subscription options.pp. 524-531
by M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F.M. auf der Heide, H. Rohnert, R.E. Tarjan
Papers
On pointers versus addressesFull-text access may be available. Sign in or learn about subscription options.pp. 532-538
by A.M. Ben-Amram, Z. Galil
Papers
A deterministic view of random sampling and its use in geometryFull-text access may be available. Sign in or learn about subscription options.pp. 539-549
by B. Chazelle, J. Friedman
Papers
New upper bounds in Klee's measure problemFull-text access may be available. Sign in or learn about subscription options.pp. 550-556
by M.H. Overmars, Chee-Keng Yap
Papers
Fully dynamic techniques for point location and transitive closure in planar structuresFull-text access may be available. Sign in or learn about subscription options.pp. 558-567
by F.P. Preparata, R. Tamassia
Papers
Combinatorial complexity bounds for arrangements of curves and surfacesFull-text access may be available. Sign in or learn about subscription options.pp. 568-579
by K.L. Clarkson, H. Edelsbrunner, L.J. Guibas, M. Sharir, E. Welzl
Papers
A fast planar partition algorithm. IFull-text access may be available. Sign in or learn about subscription options.pp. 580-589
by K. Mulmuley
Papers
An optimal algorithm for intersecting line segments in the planeFull-text access may be available. Sign in or learn about subscription options.pp. 590-600
by B. Chazelle, H. Edelsbrunner
Papers
Covering polygons is hardFull-text access may be available. Sign in or learn about subscription options.pp. 601-611
by J.C. Culberson, R.A. Reckhow
Showing 60 out of 60