Searching...
Advanced Search
F
FOCS
1985
26th Annual Symposium on Foundations of Computer Science (FOCS 1985)
This Publication
Digital Library
Advanced Search
This Publication
Subscribe to this Publication
Login to access your subscribed content
Bibliographic References
ASCII Text
BibTex
Refworks Procite/RefMan
26th Annual Symposium on Foundations of Computer Science (FOCS 1985)
October 21-October 23
ISBN: 0-8186-0844-4
Table of Contents
Papers
Front cover
(PDF)
pp. C1
ABSTRACT
PDF
Table of contents
(PDF)
pp. ix-xii
ABSTRACT
PDF
Foreword
(PDF)
Manuel Blum
John Hopcroft
Jeff Lagarias
Tom Leighton
Charles Rackoff
Larry Ruzzo
Larry Stockmeyer
Bob Tarjan
Frances Yao
pp. iii
ABSTRACT
PDF
Machtey award
(PDF)
pp. v
ABSTRACT
PDF
Separating the polynomial-time hierarchy by oracles
(Abstract)
Andrew Chi-Chih Yao
pp. 1-10
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Deterministic simulation of probabilistic constant depth circuits
(Abstract)
Miklos Ajtai
Avi Wigderson
pp. 11-19
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Amplification of probabilistic boolean formulas
(Abstract)
Ravi B. Boppana
pp. 20-29
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On networks of noisy gates
(Abstract)
Nicholas Pippenger
pp. 30-38
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
How easy is local search?
(Abstract)
David S. Johnson
Christos H. Papadimitriou
Mihalis Yannakakis
pp. 39-42
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Identification is easier than decoding
(Abstract)
Joseph Ja Ja
pp. 43-50
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Three theorems on polynomial degrees of NP-sets
(Abstract)
Klaus Ambos-Spies
pp. 51-55
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Simulating two pushdown stores by one tape in O(n1.5v) time
(Abstract)
Ming Li
pp. 56-64
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Nondeterministic versus probabilistic linear search algorithms
(Abstract)
Friedhelm Meyer auf der Heide
pp. 65-73
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The complexity of facets resolved
(Abstract)
Christos H. Papadimitriou
David Wolfe
pp. 74-78
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Using dual approximation algorithms for scheduling problems: Theoretical and practical results
(Abstract)
Dorit S. Hochbaum
David B. Shmoys
pp. 79-89
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A scaling algorithm for weighted matching on general graphs
(Abstract)
Harold N. Gabow
pp. 90-100
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An all pairs shortest path algorithm with expected running time O(n 2logn)
(Abstract)
Alistair Moffat
Tadao Takaoka
pp. 101-105
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Recognizing circle graphs in polynomial time
(Abstract)
Csaba P. Gabor
Wen-Lian Hsu
Kenneth J. Supowit
pp. 106-116
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Why certain subgraph computations requite only linear time
(Abstract)
M. W. Bern
E. L. Lawler
A. L. Wong
pp. 117-125
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Efficient string matching in the presence of errors
(Abstract)
Gad M. Landau
Uzi Vishkin
pp. 126-136
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The least weight subsequence problem
(Abstract)
D. S. Hirschberg
L. L. Larmore
pp. 137-143
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Motion planning in the presence of moving obstacles
(Abstract)
John Reif
Micha Sharir
pp. 144-154
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Visibility-polygon search and euclidean shortest paths
(Abstract)
Takao Asano
Tetsuo Asano
Leonidas Guibas
John Hershberger
Hiroshi Imai
pp. 155-164
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Slimming down search structures: A functional approach to algorithm design
(Abstract)
Bernard Chazelle
pp. 165-174
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The complexity of recognizing polyhedral scenes
(Abstract)
Lefteris M. Kirousis
Christos H. Papadimitriou
pp. 175-185
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Multi-layer grid embeddings
(Abstract)
Alok Aggarwal
Maria Klawe
David Lichtentein
Nathan Linial
Avi Wigderson
pp. 186-196
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Area penalty for sublinear signal propagation delay on chip
(Abstract)
Paul M. B. Vitanyi
pp. 197-207
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On information flow and sorting : New upper and lower bounds for VLSI circuits
(Abstract)
Richard Cole
Alan Siegel
pp. 208-221
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Solving tree problems on a mesh-connected processor array
(Abstract)
Mikhail J. Atallah
Susanne E. Hambrusch
pp. 222-231
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Solving some graph problems with optimal or near-optimal speedup on mesh-of-trees networks
(Abstract)
Ming-Deh A. Huang
pp. 232-240
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Randomized routing on fat-tress
(Abstract)
Ronald I. Greenberg
Charles E. Leiserson
pp. 241-249
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Distributed BFS algorithms
(Abstract)
Baruch Awerbuch
Robert G. Gallager
pp. 250-256
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees
(Abstract)
F. Chin
H. F. Ting
pp. 257-266
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Byzantine agreement in constant expected time
(Abstract)
Paul Feldman
Silvio Micali
pp. 267-276
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Geometrical realization of set systems and probabilistic communication complexity
(Abstract)
N. Alon
P. Frankl
V. Rodl
pp. 277-280
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Robin hood hashing
(Abstract)
Pedro Celis
Per-Ake Larson
J. Ian Munro
pp. 281-288
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Dynamic monotone priorities on planar sets
(Abstract)
Michael J. Fischer
Michael S. Paterson
pp. 289-292
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Design and analysis of dynamic Huffman coding
(Abstract)
Jeffrey Scott Vitter
pp. 293-302
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Average case lower bounds on the construction and searching of partial orders
(Abstract)
Harry G. Mairson
pp. 303-311
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
On minima of function, intersection patterns of curves, and davenport-schinzel sequences
(Abstract)
Micha Sharir
Ron Livne
pp. 312-320
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Inferring the structure of a Markov Chain from its output
(Abstract)
Steven Rudich
pp. 321-326
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Automatic verification of probabilistic concurrent finite state programs
(Abstract)
Moshe Y. Vardi
pp. 327-338
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Partial polymorphic type inference is undecidable
(Abstract)
Hans-J. Boehm
pp. 339-345
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Fixed-point extensions of first-order logic
(Abstract)
Yuri Gurevich
Saharon Shelah
pp. 346-353
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Equivalences and transformations of recursive definitions
(Abstract)
Bruno Courcelle
pp. 354-359
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems
(Abstract)
Zvi Galil
Stuart Haber
Moti Yung
pp. 360-371
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
A robust and verifiable cryptographically secure election scheme
(Abstract)
Josh D. Cohen
Michael J. Fischer
pp. 372-382
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Verifiable secret sharing and achieving simultaneity in the presence of faults
(Abstract)
Benny Chor
Shafi Goldwasser
Silvio Micali
Baruch Awerbuch
pp. 383-395
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The bit extraction problem or t-resilient functions
(Abstract)
Benny Chor
Oded Goldreich
Johan Hasted
Joel Freidmann
Steven Rudich
Roman Smolensky
pp. 396-407
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Collective coin flipping, robust voting schemes and minima of Banzhaf values
(Abstract)
Michael Ben-Or
Nathan Linial
pp. 408-416
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Random polynomial time is equal to slightly-random polynomial time
(Abstract)
Umesh V. Vazirani
Vijay V. Vazirani
pp. 417-428
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Unbiased bits from sources of weak randomness and probabilistic communication complexity
(Abstract)
Benny Chor
Oded Goldreich
pp. 429-442
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Factoring with cyclotomic polynomials
(Abstract)
Eric Bach
Jeffrey Shallit
pp. 443-450
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Computing with polynomials given by straight-line programs II sparse factorization
(Abstract)
Erich Kaltofen
pp. 450-458
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An application of simultaneous approximation in combinatorial optimization
(Abstract)
Andras Frank
Eva Tardos
pp. 459-463
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Computing ears and branchings in parallel
(Abstract)
L. Lovasz
pp. 464-467
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Parallel computational geometry
(Abstract)
Alok Aggarwal
Bernard Chazelle
Leo Guibas
Colm O'Dunlaing
Chee Yap
pp. 468-477
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Parallel tree contraction and its application
(Abstract)
Gary L. Miller
John H. Reif
pp. 478-489
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Improved processor bounds for algebraic and combinatorial problems in RNC
(Abstract)
Zvi Galil
Victor Pan
pp. 490-495
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
An optimal parallel algorithm for integer sorting
(Abstract)
John H. Reif
pp. 496-504
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Fast parallel computation with permutation groups
(Abstract)
Eugene M. Luks
Pierre Mckenzie
pp. 505-514
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Algebraic cell decomposition in NC
(Abstract)
Dexter Kozen
Chee-Kang Yap
pp. 515-521
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Fast and efficient algorithms for sequential and parallel evaluation of polynomial zeros and of matrix polynomials
(Abstract)
V. Pan
pp. 522-531
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The complexity of parallel sorting
(Abstract)
Friedhelm Meyer auf der Heide
Avi Wigderson
pp. 532-540
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
The complexity of parallel computation on matroids
(Abstract)
Richard M. Karp
Eli Upfal
Avi Wigderson
pp. 541-550
ABSTRACT
PDF
PURCHASE ARTICLE: $19
IEEE
Xplore
Subscribers
Author index
(PDF)
pp. 551-552
ABSTRACT
PDF
Peer Review Notice
|
Give Us Feedback
Usage of this product signifies your acceptance of the
Terms of Use
.
Open
Download
