30. FOCS 1989:
Research Triangle Park, North Carolina, USA
30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989.
IEEE Computer Society 1989
Aviad Cohen, Avi Wigderson: Dispersers, Deterministic Amplification, and Weak Random Sources (Extended Abstract).
14-19
Alan Siegel: On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Tradeoff, and Their Applications (Extended Abstract).
20-25
Robert E. Schapire: The Strength of Weak Learnability (Extended Abstract).
28-33
Ming Li, Paul M. B. Vitányi: A Theory of Learning Simple Concepts Under Simple Distributions and Average Case Complexity for the Universal Distribution (Extended Abstract).
34-39
David Haussler: Generalizing the PAC Model: Sample Size Bounds From Metric Dimension-based Uniform Convergence Results.
40-45
James R. Russell: Full Abstraction for Nondeterministic Dataflow Networks.
170-175
S. Rao Kosaraju: Efficient Tree Pattern Matching (Preliminary Version).
178-183
S. Rao Kosaraju: Pipelining Computations in a Tree of Processors (Preliminary Version).
184-189
Michael T. Goodrich, S. Rao Kosaraju: Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version).
190-195
Greg N. Frederickson: Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version).
448-453
Elias Dahlhaus, Marek Karpinski: An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract).
454-459
Anne Condon, Richard J. Lipton: On the Complexity of Space Bounded Interactive Proofs (Extended Abstract).
462-467
Seinosuke Toda: On the Computational Power of PP and +P.
514-519
Michael R. Fellows, Michael A. Langston: An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract).
520-525
Milena Mihail: Conductance and Convergence of Markov Chains-A Combinatorial Treatment of Expanders.
526-531
Jin-yi Cai: Lower Bounds for Constant Depth Circuits in the Presence of Help Bits.
532-537
Mark D. Hansen: Approximation Algorithms for Geometric Embeddings in the Plane with Applications to Parallel Processing Problems (Extended Abstract).
604-609
data released under the ODC-BY 1.0 license
