Default Cover Image

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)

Oct. 17 1999 to Oct. 18 1999

New York, New York

ISSN: 0272-5428

ISBN: 0-7695-0409-4

Table of Contents

ForewordFreely available from IEEE.pp. xii
Committees and Machtey AwardFreely available from IEEE.pp. xiii
ReviewersFreely available from IEEE.pp. xiv
Near-optimal conversion of hardness into pseudo-randomnessFull-text access may be available. Sign in or learn about subscription options.pp. 181-190
Session 1, Chair: David Schmoys
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 2
Session 1, Chair: David Schmoys
Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random FieldsFull-text access may be available. Sign in or learn about subscription options.pp. 14
Session 1, Chair: David Schmoys
Approximating Fractional Multicommodity Flow Independent of the Number of CommoditiesFull-text access may be available. Sign in or learn about subscription options.pp. 24
Session 2, Chair: Paul Beame
A - Lower Bound for the Rank of - Matrix Multiplication over Arbitrary FieldsFull-text access may be available. Sign in or learn about subscription options.pp. 45
Session 2, Chair: Paul Beame
Improved Bounds for Sampling ColoringFull-text access may be available. Sign in or learn about subscription options.pp. 51
Session 2, Chair: Paul Beame
A Non-Linear Time Lower Bound for Boolean Branching ProgramsFull-text access may be available. Sign in or learn about subscription options.pp. 60
Session 2, Chair: Paul Beame
Derandomizing Arthur-Merlin Games Using Hitting SetsFull-text access may be available. Sign in or learn about subscription options.pp. 71
Session 2, Chair: Paul Beame
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in DigraphsFull-text access may be available. Sign in or learn about subscription options.pp. 81
Session 3, Chair: Joseph Mitchell
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized TimeFull-text access may be available. Sign in or learn about subscription options.pp. 92
Session 3, Chair: Joseph Mitchell
Taking a Walk in a Planar ArrangementFull-text access may be available. Sign in or learn about subscription options.pp. 100
Session 4, Chair: Michael Mitsenmacher
PSPACE Has Constant-Round Quantum Interactive Proof SystemsFull-text access may be available. Sign in or learn about subscription options.pp. 112
Session 4, Chair: Michael Mitsenmacher
Verifiable Random FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 120
Session 4, Chair: Michael Mitsenmacher
How Asymmetry Helps Load BalancingFull-text access may be available. Sign in or learn about subscription options.pp. 131
Session 4, Chair: Michael Mitsenmacher
Noncryptographic Selection ProtocolsFull-text access may be available. Sign in or learn about subscription options.pp. 142
Session 5A, Chair: Andrei Broder
A Sublinear Time Approximation Scheme for Clustering in Metric SpacesFull-text access may be available. Sign in or learn about subscription options.pp. 154
Session 5A, Chair: Andrei Broder
Efficient Regular Data Structures and Algorithms for Location and Proximity ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 160
Session 5A, Chair: Andrei Broder
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via EmbeddingsFull-text access may be available. Sign in or learn about subscription options.pp. 171
Session 5B, Chair: Eric Allender
Near-Optimal Conversion of Hardness into Pseudo-RandomnessFull-text access may be available. Sign in or learn about subscription options.pp. 181
Session 5B, Chair: Eric Allender
Error Reduction for ExtractorsFull-text access may be available. Sign in or learn about subscription options.pp. 191
Session 5B, Chair: Eric Allender
Primality and Identity Testing via Chinese RemainderingFull-text access may be available. Sign in or learn about subscription options.pp. 202
Session 6A, Chair: Dana Randall
On Counting Independent Sets in Sparse GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 210
Session 6A, Chair: Dana Randall
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical PhysicsFull-text access may be available. Sign in or learn about subscription options.pp. 218
Session 6A, Chair: Dana Randall
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack SolutionsFull-text access may be available. Sign in or learn about subscription options.pp. 230
Session 6A, Chair: Dana Randall
Markovian Coupling vs. Conductance for the Jerrum-Sinclair ChainFull-text access may be available. Sign in or learn about subscription options.pp. 241
Session 6B, Chair: James Aspnes
A Near-Tight Lower Bound on the Time Complexity of Distributed MST ConstructionFull-text access may be available. Sign in or learn about subscription options.pp. 253
Session 6B, Chair: James Aspnes
Long-Lived Adaptive Collect with ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 262
Session 6B, Chair: James Aspnes
A Theoretical Framework for Memory-Adaptive AlgorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 273
Session 6B, Chair: James Aspnes
Cache-Oblivious AlgorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 285
Session 7A, Chair: Satish Rao
The Directed Steiner Network Problem is Tractable for a Constant Number of TerminalsFull-text access may be available. Sign in or learn about subscription options.pp. 299
Session 7A, Chair: Satish Rao
Setting Parameters by ExampleFull-text access may be available. Sign in or learn about subscription options.pp. 309
Session 7A, Chair: Satish Rao
Finding Double Euler Trails of Planar Graphs in Linear TimeFull-text access may be available. Sign in or learn about subscription options.pp. 319
Session 7A, Chair: Satish Rao
Edge-Disjoint Routing in Plane Switch Graphs in Linear TimeFull-text access may be available. Sign in or learn about subscription options.pp. 330
Session 7B, Chair: Peter Shor
On Quantum and Classical Space-Bounded Processes with Algebraic Transition AmplitudesFull-text access may be available. Sign in or learn about subscription options.pp. 341
Session 7B, Chair: Peter Shor
A Better Lower Bound for Quantum Algorithms Searching an Ordered ListFull-text access may be available. Sign in or learn about subscription options.pp. 352
Session 7B, Chair: Peter Shor
Bounds for Small-Error and Zero-Error Quantum AlgorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 358
Session 7B, Chair: Peter Shor
Optimal Lower Bounds for Quantum Automata and Random Access CodesFull-text access may be available. Sign in or learn about subscription options.pp. 369
Session 8A, Chair: Joseph Mitchell
Improved Combinatorial Algorithms for the Facility Location and k-Median ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 378
Session 8A, Chair: Joseph Mitchell
Lov?sz's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 389
Session 8A, Chair: Joseph Mitchell
Cuts, Trees and -Embeddings of GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 399
Session 8B, Chair: Paul Beame
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 410
Session 8B, Chair: Paul Beame
Random CNF's are Hard for the Polynomial CalculusFull-text access may be available. Sign in or learn about subscription options.pp. 415
Session 8B, Chair: Paul Beame
A Study of Proof Search Algorithms for Resolution and Polynomial CalculusFull-text access may be available. Sign in or learn about subscription options.pp. 422
Session 9A, Chair: Yair Bartal
Online Scheduling to Minimize Average StretchFull-text access may be available. Sign in or learn about subscription options.pp. 433
Session 9A, Chair: Yair Bartal
Weak Adversaries for the k-Server ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 444
Session 9A, Chair: Yair Bartal
Finely-Competitive PagingFull-text access may be available. Sign in or learn about subscription options.pp. 450
Session 9B, Chair: Luca Trevisan
On the Complexity of SATFull-text access may be available. Sign in or learn about subscription options.pp. 459
Session 9B, Chair: Luca Trevisan
Hardness of Approximating Minimization ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 465
Session 9B, Chair: Luca Trevisan
Hardness of Approximating the Minimum Distance of a Linear CodeFull-text access may be available. Sign in or learn about subscription options.pp. 475
Session 10A, Chair: Ming Li
Satisfiability of Word Equations with Constants is in PSPACEFull-text access may be available. Sign in or learn about subscription options.pp. 495
Session 10A, Chair: Ming Li
An Approximate L1-Difference Algorithm for Massive Data StreamsFull-text access may be available. Sign in or learn about subscription options.pp. 501
Session 10A, Chair: Ming Li
Algorithmic Aspects of Protein Structure SimilarityFull-text access may be available. Sign in or learn about subscription options.pp. 512
Session 10B, Chair: Luca Trevisan
Magic FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 523
Session 10B, Chair: Luca Trevisan
Limits on the Efficiency of One-Way Permutation-Based Hash FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 535
Session 10B, Chair: Luca Trevisan
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext SecurityFull-text access may be available. Sign in or learn about subscription options.pp. 543
Session 10B, Chair: Luca Trevisan
Non-Interactive CryptoComputing For NC1Full-text access may be available. Sign in or learn about subscription options.pp. 554
Session 11A, Chair: Susanne Albers
Fairness in Routing and Load BalancingFull-text access may be available. Sign in or learn about subscription options.pp. 568
Session 11A, Chair: Susanne Albers
Stochastic Load Balancing and Related ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 579
Session 11A, Chair: Susanne Albers
Reducing Network Congestion and Blocking Probability through Balanced AllocationFull-text access may be available. Sign in or learn about subscription options.pp. 587
Session 11A, Chair: Susanne Albers
Finding Maximal Repetitions in a Word in Linear TimeFull-text access may be available. Sign in or learn about subscription options.pp. 596
Session 11A, Chair: Susanne Albers
All Pairs Shortest Paths in Undirected Graphs with Integer WeightsFull-text access may be available. Sign in or learn about subscription options.pp. 605
Session 11B, Chair: Nader Bshouty
An Algorithmic Theory of Learning: Robust Concepts and Random ProjectionFull-text access may be available. Sign in or learn about subscription options.pp. 616
Session 11B, Chair: Nader Bshouty
Boosting and Hard-Core SetsFull-text access may be available. Sign in or learn about subscription options.pp. 624
Session 11B, Chair: Nader Bshouty
Learning Mixtures of GaussiansFull-text access may be available. Sign in or learn about subscription options.pp. 634
Session 11B, Chair: Nader Bshouty
Regular Languages are Testable with a Constant Number of QueriesFull-text access may be available. Sign in or learn about subscription options.pp. 645
Session 11B, Chair: Nader Bshouty
Efficient Testing of Large GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 656
Session 11B, Chair: Nader Bshouty
Author IndexFreely available from IEEE.pp. 667
Showing 73 out of 73