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

28th Annual Symposium on Foundations of Computer Science (sfcs 1987)

Oct. 12 1987 to Oct. 14 1987

ISSN: 0272-5428

ISBN: 0-8186-0807-2

Table of Contents

Polytope range searching and integral geometryFull-text access may be available. Sign in or learn about subscription options.
by Bernard Chazelle
Delaunay graphs are almost as good as complete graphsFull-text access may be available. Sign in or learn about subscription options.
by David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit
Papers
Machtey awardFreely available from IEEE.pp. v
Papers
An output sensitive algorithm for computing visibility graphsFull-text access may be available. Sign in or learn about subscription options.pp. 11-19
by Subir Kumar Ghosh, David M. Mount
Papers
On the lower envelope of bivariate functions and its applicationsFull-text access may be available. Sign in or learn about subscription options.pp. 27-37
by Herbert Edelsbrunner, Janos Pach, Jacob T. Schwartz, Micha Sharir
Papers
A new algebraic method for robot motion planning and real geometryFull-text access may be available. Sign in or learn about subscription options.pp. 39-48
by John Canny
Papers
New lower bound techniques for robot motion planning problemsFull-text access may be available. Sign in or learn about subscription options.pp. 49-60
by John Canny, John Reif
Papers
Learning one-counter languages in polynomial timeFull-text access may be available. Sign in or learn about subscription options.pp. 61-67
by Piotr Berman, Robert Roos
Papers
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmFull-text access may be available. Sign in or learn about subscription options.pp. 68-77
by Nick Littlestone
Papers
Diversity-based inference of finite automataFull-text access may be available. Sign in or learn about subscription options.pp. 78-87
by Ronald L. Rivest, Robert E. Schapire
Papers
Incomparability in parallel computationFull-text access may be available. Sign in or learn about subscription options.pp. 89-98
by Vince Grolmusz, Prabhakar Ragde
Papers
Threshold circuits of bounded depthFull-text access may be available. Sign in or learn about subscription options.pp. 99-110
by Andras Hajnal, Wolfgang Maass, Pavel Pudlak, Mario Szegedy, Gyorgy Turan
Papers
Complete and incomplete randomized NP problemsFull-text access may be available. Sign in or learn about subscription options.pp. 111-117
by Yuri Gurevich
Papers
Generic oracles and oracle classesFull-text access may be available. Sign in or learn about subscription options.pp. 118-126
by Manuel Blum, Russell Impagliazzo
Papers
Functional decomposition of polynomialsFull-text access may be available. Sign in or learn about subscription options.pp. 127-131
by Joachim von zur Gathen, Dexter Kozen, Susan Landau
A parallel algorithm for finding a separator in planar graphsFull-text access may be available. Sign in or learn about subscription options.pp. 238-248
by Hillel Gazit, Gary L. Miller
Papers
Factoring polynomials over finite fieldsFull-text access may be available. Sign in or learn about subscription options.pp. 132-137
by Lajos Ronyai
Papers
Multiplicative complexity of polynomial multiplication over finite fieldsFull-text access may be available. Sign in or learn about subscription options.pp. 138-140
by Michael Kaminski, Nader H. Bshouty
Papers
The multiplicative complexity of quadratic Boolean functionsFull-text access may be available. Sign in or learn about subscription options.pp. 141-150
by R. Mirwald, C. P. Schnorr
Papers
Cascading divide-and-conquer: A technique for designing parallel algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 151-160
by Mikhail J. Atallah, Richard Cole, Michael T. Goodrich
Papers
A new parallel algorithm for the maximal independent set problemFull-text access may be available. Sign in or learn about subscription options.pp. 161-165
by Mark Goldberg, Thomas Spencer
Papers
The matching problem for bipartite graphs with polynomially bounded permanents is in NCFull-text access may be available. Sign in or learn about subscription options.pp. 166-172
by Dima Yu. Grigoriev, Marek Karpinski
Papers
Some polynomial and Toeplitz matrix computationsFull-text access may be available. Sign in or learn about subscription options.pp. 173-184
by Victor Pan, John Reif
Papers
How to emulate shared memoryFull-text access may be available. Sign in or learn about subscription options.pp. 185-194
by Abhiram G. Ranade
Papers
The complexity of parallel comparison mergingFull-text access may be available. Sign in or learn about subscription options.pp. 195-201
by Mihaly Gereb-Graus, Danny Krizanc
Papers
Hierarchical memory with block transferFull-text access may be available. Sign in or learn about subscription options.pp. 204-216
by Alok Aggarwal, Ashok K. Chandra, Marc Snir
Papers
Approximation algorithms for scheduling unrelated parallel machinesFull-text access may be available. Sign in or learn about subscription options.pp. 217-224
by Jan Karel Lenstra, David B. Shmoys, Eva Tardos
Papers
Finding near optimal separators in planar graphsFull-text access may be available. Sign in or learn about subscription options.pp. 225-237
by Satish Rao
Papers
Determining edge connectivity in 0(nm)Full-text access may be available. Sign in or learn about subscription options.pp. 249-251
by David W. Matula
Papers
Improved algorithms for graph four-connectivityFull-text access may be available. Sign in or learn about subscription options.pp. 252-259
by Arkady Kanevsky, Vijaya Ramachandran
Papers
Parallel graph algorithms that are efficient on averageFull-text access may be available. Sign in or learn about subscription options.pp. 260-269
by Don Coppersmith, Prabhakar Raghavan, Martin Tompa
Papers
Canonical labeling of regular graphs in linear average timeFull-text access may be available. Sign in or learn about subscription options.pp. 271-279
by Ludek Kucera
Papers
Eigenvalues and graph bisection: An average-case analysisFull-text access may be available. Sign in or learn about subscription options.pp. 280-285
by Ravi B. Boppana
Papers
On the second eigenvalue of random regular graphsFull-text access may be available. Sign in or learn about subscription options.pp. 286-294
by Andrei Broder, Eli Shamir
Papers
Recursive construction for 3-regular expandersFull-text access may be available. Sign in or learn about subscription options.pp. 295-304
by M. Ajtai
Papers
The organization of permutation architectures with bussed interconnectionsFull-text access may be available. Sign in or learn about subscription options.pp. 305-315
by Joe Kilian, Shlomo Kipnis, Charles E. Leiserson
Papers
Channel routing of multiterminal netsFull-text access may be available. Sign in or learn about subscription options.pp. 316-325
by Shaodi Gao, Michael Kaufmann
Papers
Two lower bounds in asynchronous distributed computationFull-text access may be available. Sign in or learn about subscription options.pp. 326-330
by Pavol Duris, Zvi Galil
Papers
Distributive graph algorithms—Global solutions from local dataFull-text access may be available. Sign in or learn about subscription options.pp. 331-335
by Nathan Linial
Papers
Achievable cases in an asynchronous environmentFull-text access may be available. Sign in or learn about subscription options.pp. 337-346
by Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Radiger Reischuk
Papers
Local management of a global resource in a communication networkFull-text access may be available. Sign in or learn about subscription options.pp. 347-357
by Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael Saks
Papers
Applying static network protocols to dynamic networksFull-text access may be available. Sign in or learn about subscription options.pp. 358-370
by Yehuda Afek, Baruch Awerbuch, Eli Gafni
Papers
Bounded time-stampsFull-text access may be available. Sign in or learn about subscription options.pp. 371-382
by Amos Israeli, Ming Li
Papers
Concurrent reading while writing II: The multi-writer caseFull-text access may be available. Sign in or learn about subscription options.pp. 383-392
by Gary L. Peterson, James E. Burns
Papers
Lower bounds to randomized algorithms for graph propertiesFull-text access may be available. Sign in or learn about subscription options.pp. 393-400
by Andrew Chi-Chih Yao
Papers
Exponential lower bounds for finding Brouwer fixed pointsFull-text access may be available. Sign in or learn about subscription options.pp. 401-410
by Michael D. Hirsch, Stephen Vavasis
Papers
Database theory and cylindric latticesFull-text access may be available. Sign in or learn about subscription options.pp. 411-420
by Stavros S. Cosmadakis
Papers
Secret linear congruential generators are not cryptographically secureFull-text access may be available. Sign in or learn about subscription options.pp. 421-426
by Jacques Stern
Papers
A practical scheme for non-interactive verifiable secret sharingFull-text access may be available. Sign in or learn about subscription options.pp. 427-438
by Paul Feldman
Papers
Perfect zero-knowledge languages can be recognized in two roundsFull-text access may be available. Sign in or learn about subscription options.pp. 439-448
by William Aiello, Johan Hastad
Papers
Interactive proof systems: Provers that never fail and random selectionFull-text access may be available. Sign in or learn about subscription options.pp. 449-461
by Oded Goldreich, Yishay Mansour, Michael Sipser
Papers
On the cunning power of cheating verifiers: Some observations about zero knowledge proofsFull-text access may be available. Sign in or learn about subscription options.pp. 462-471
by Yair Oren
Papers
Random self-reducibility and zero knowledge interactive proofs of possession of informationFull-text access may be available. Sign in or learn about subscription options.pp. 472-482
by Martin Tompa, Heather Woll
Papers
Author indexFull-text access may be available. Sign in or learn about subscription options.pp. 483-484
Papers
The average complexity of deterministic and randomized parallel comparison sorting algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 489-498
by N. Alon, Y. Azar
Showing 55 out of 55