Default Cover Image

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)

Nov. 8 1998 to Nov. 11 1998

Palo Alto, California

ISSN: 0272-5428

ISBN: 0-8186-9172-7

Table of Contents

ForewordFreely available from IEEE.pp. xi
CommitteesFreely available from IEEE.pp. xii
ReviewersFreely available from IEEE.pp. xiii
Tutorial I, Chair: Emo Welzl
Geometric Computation and the Art of SamplingFull-text access may be available. Sign in or learn about subscription options.pp. 2
Tutorial II, Chair: Sally Goldman
Theoretical Issues in Probabilistic Artificial IntelligenceFull-text access may be available. Sign in or learn about subscription options.pp. 4
Tutorial III, Chair: David Karger
Information Retrieval on the WebFull-text access may be available. Sign in or learn about subscription options.pp. 6
Session 1A, Chair: Mihir Bellare
A Tight Characterization of NP with 3 Query PCPsFull-text access may be available. Sign in or learn about subscription options.pp. 8
Session 1A, Chair: Mihir Bellare
Probabilistically Checkable Proofs with Low Amortized Query ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 18
Session 1A, Chair: Mihir Bellare
Improved Decoding of Reed-Solomon and Algebraic-Geometric CodesFull-text access may be available. Sign in or learn about subscription options.pp. 28
Session 1B, Chair: Jon Kleinberg
The Access Network Design ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 40
Session 1B, Chair: Jon Kleinberg
Jitter Control in QoS NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 50
Session 1B, Chair: Jon Kleinberg
Stability of Adversarial Queues via Fluid ModelsFull-text access may be available. Sign in or learn about subscription options.pp. 60
Session 1B, Chair: Jon Kleinberg
Delayed Information and Action in On-line AlgorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 71
Session 2A, Chair: Miklos Ajtai
The Complexity of the Approximation of the Bandwidth ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 82
Session 2A, Chair: Miklos Ajtai
The Shortest Vector in a Lattice is Hard to Approximate to within Some ConstantFull-text access may be available. Sign in or learn about subscription options.pp. 92
Session 2A, Chair: Miklos Ajtai
Approximating-CVP to within Almost-Polynomial Factors is NP-HardFull-text access may be available. Sign in or learn about subscription options.pp. 99
Session 2B, Chair: Christos Papadimitriou
Satisfiability of Word Equations with Constants is in Exponential SpaceFull-text access may be available. Sign in or learn about subscription options.pp. 112
Session 2B, Chair: Christos Papadimitriou
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-DegreeFull-text access may be available. Sign in or learn about subscription options.pp. 120
Session 2B, Chair: Christos Papadimitriou
A Primitive Recursive Algorithm for the General Petri Net Reachability ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 130
Session 2B, Chair: Christos Papadimitriou
Algorithms to Tile the Infinite Grid with Finite ClustersFull-text access may be available. Sign in or learn about subscription options.pp. 137
Session 3A, Chair: Frances Yao
On Approximate Nearest Neighbors in Non-Euclidean SpacesFull-text access may be available. Sign in or learn about subscription options.pp. 148
Session 3A, Chair: Frances Yao
Pattern Matching for Spatial Point SetsFull-text access may be available. Sign in or learn about subscription options.pp. 156
Session 3A, Chair: Frances Yao
Faster Algorithms for String Matching Problems: Matching the Convolution BoundFull-text access may be available. Sign in or learn about subscription options.pp. 166
Session 3A, Chair: Frances Yao
Overcoming the Memory Bottleneck in Suffix Tree ConstructionFull-text access may be available. Sign in or learn about subscription options.pp. 174
Session 3B, Chair: Dan Spielman
Bivariate Polynomial MultiplicationFull-text access may be available. Sign in or learn about subscription options.pp. 186
Session 3B, Chair: Dan Spielman
A Unified Superfast Algorithm for Boundary Rational Tangential Interpolation Problems and for Inversion and Factorization of Dense Structured MatricesFull-text access may be available. Sign in or learn about subscription options.pp. 192
Session 3B, Chair: Dan Spielman
Unsatisfiable Systems Of Equations, Over A Finite FieldFull-text access may be available. Sign in or learn about subscription options.pp. 202
Session 3B, Chair: Dan Spielman
Multiplicative Complexity of Taylor Shifts and a New Twist of the Substitution MethodFull-text access may be available. Sign in or learn about subscription options.pp. 212
Session 4A, Chair: David Williamson
Local Search in Smooth Convex SetsFull-text access may be available. Sign in or learn about subscription options.pp. 218
Session 4A, Chair: David Williamson
A TDI System and Its Application to Approximation AlgorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 227
Session 4A, Chair: David Williamson
Geometric Separator Theorems and ApplicationsFull-text access may be available. Sign in or learn about subscription options.pp. 232
Session 4A, Chair: David Williamson
Approximation of Diameters: Randomization Doesn't HelpFull-text access may be available. Sign in or learn about subscription options.pp. 244
Session 4B, Chair: Allan Borodin
Time-Space Tradeoffs for Branching ProgramsFull-text access may be available. Sign in or learn about subscription options.pp. 254
Session 4B, Chair: Allan Borodin
Optimal Time-Space Trade-Offs for SortingFull-text access may be available. Sign in or learn about subscription options.pp. 264
Session 4B, Chair: Allan Borodin
Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite FieldsFull-text access may be available. Sign in or learn about subscription options.pp. 269
Session 4B, Chair: Allan Borodin
Lower Bounds for (MOD p - MOD m) CircuitsFull-text access may be available. Sign in or learn about subscription options.pp. 279
Session 5A, Chair: Jon Kleinberg
On the Single-Source Unsplittable Flow ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 290
Session 5A, Chair: Jon Kleinberg
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.Full-text access may be available. Sign in or learn about subscription options.pp. 300
Session 5A, Chair: Jon Kleinberg
All Pairs Shortest Paths in weighted directed graphs ? exact and almost exact algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 310
Session 5A, Chair: Jon Kleinberg
A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the PlaneFull-text access may be available. Sign in or learn about subscription options.pp. 320
Session 5B, Chair: Edith Cohen
1-way quantum finite automata: strengths, weaknesses and generalizationsFull-text access may be available. Sign in or learn about subscription options.pp. 332
Session 5B, Chair: Edith Cohen
The Quantum Communication Complexity of SamplingFull-text access may be available. Sign in or learn about subscription options.pp. 342
Session 5B, Chair: Edith Cohen
Quantum Lower Bounds by PolynomialsFull-text access may be available. Sign in or learn about subscription options.pp. 352
Session 5B, Chair: Edith Cohen
Quantum Oracle Interrogation: Getting All Information for Almost Half the PriceFull-text access may be available. Sign in or learn about subscription options.pp. 362
Session 6A, Chair: David Williamson
Fast Monte-Carlo Algorithms for finding low-rank approximationsFull-text access may be available. Sign in or learn about subscription options.pp. 370
Session 6A, Chair: David Williamson
Approximating a Finite Metric by a Small Number of Tree MetricsFull-text access may be available. Sign in or learn about subscription options.pp. 379
Session 6A, Chair: David Williamson
Random Projection: A New Approach to VLSI LayoutFull-text access may be available. Sign in or learn about subscription options.pp. 389
Session 6A, Chair: David Williamson
Map Graphs In Polynomial TimeFull-text access may be available. Sign in or learn about subscription options.pp. 396
Session 6B, Chair: Sally Goldman
On Learning Monotone Boolean FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 408
Session 6B, Chair: Sally Goldman
Orchestrating Quartets: Approximation and Data CorrectionFull-text access may be available. Sign in or learn about subscription options.pp. 416
Session 6B, Chair: Sally Goldman
Testing MonotonicityFull-text access may be available. Sign in or learn about subscription options.pp. 426
Session 6B, Chair: Sally Goldman
Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov ModelFull-text access may be available. Sign in or learn about subscription options.pp. 436
Session 7A, Chair: Joseph Naor
A Factor 2 Approximation Algorithm for the Generalized Steiner Network ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 448
Session 7A, Chair: Joseph Naor
The Finite Capacity Dial-A-Ride ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 458
Session 7A, Chair: Joseph Naor
A Randomized Approximation Scheme for Metric MAX-CUTFull-text access may be available. Sign in or learn about subscription options.pp. 468
Session 7A, Chair: Joseph Naor
Semidefinite Relaxations for Parallel Machine SchedulingFull-text access may be available. Sign in or learn about subscription options.pp. 472
Session 7B, Chair: Mihir Bellare
Lower Bounds for Zero Knowledge on the InternetFull-text access may be available. Sign in or learn about subscription options.pp. 484
Session 7B, Chair: Mihir Bellare
Oblivious Transfer with a Memory-Bounded ReceiverFull-text access may be available. Sign in or learn about subscription options.pp. 493
Session 7B, Chair: Mihir Bellare
Quantum Cryptography with Imperfect ApparatusFull-text access may be available. Sign in or learn about subscription options.pp. 503
Session 7B, Chair: Mihir Bellare
The Security of Individual RSA BitsFull-text access may be available. Sign in or learn about subscription options.pp. 510
Session 8A, Chair: David Karger
Protocols for Asymmetric Communication ChannelsFull-text access may be available. Sign in or learn about subscription options.pp. 522
Session 8A, Chair: David Karger
Marked Ancestor ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 534
Session 8A, Chair: David Karger
Towards an Optimal Bit-Reversal Permutation ProgramFull-text access may be available. Sign in or learn about subscription options.pp. 544
Session 8B, Chair: Joseph Naor
The Minimum Equivalent DNF Problem and Shortest ImplicantsFull-text access may be available. Sign in or learn about subscription options.pp. 556
Session 8B, Chair: Joseph Naor
Concurrent Reachability GamesFull-text access may be available. Sign in or learn about subscription options.pp. 564
Session 8B, Chair: Joseph Naor
Perfect Information Leader Election in log^* n + O(1) RoundsFull-text access may be available. Sign in or learn about subscription options.pp. 576
Session 9A, Chair: Emo Welzl
Random Sampling, Halfspace Range Reporting, and Construction of (= k)-Levels in Three DimensionsFull-text access may be available. Sign in or learn about subscription options.pp. 586
Session 9A, Chair: Emo Welzl
Parametric and Kinetic Minimum Spanning TreesFull-text access may be available. Sign in or learn about subscription options.pp. 596
Session 9A, Chair: Emo Welzl
On the Combinatorial and Topological Complexity of a Single CellFull-text access may be available. Sign in or learn about subscription options.pp. 606
Session 9A, Chair: Emo Welzl
Which Crossing Number is it, Anyway?Full-text access may be available. Sign in or learn about subscription options.pp. 617
Session 9B, Chair: Toni Pitassi
An Improved Exponential-Time Algorithm for k-SATFull-text access may be available. Sign in or learn about subscription options.pp. 628
Session 9B, Chair: Toni Pitassi
Exponential Separations between Restricted Resolution and Cutting Planes Proof SystemsFull-text access may be available. Sign in or learn about subscription options.pp. 638
Session 9B, Chair: Toni Pitassi
Tseitin's Tautologies and Lower Bounds for Nullstellensatz ProofsFull-text access may be available. Sign in or learn about subscription options.pp. 648
Session 9B, Chair: Toni Pitassi
Which Problems Have Strongly Exponential Complexity?Full-text access may be available. Sign in or learn about subscription options.pp. 653
Session 10A, Chair: Edith Cohen
Recommendation Systems: A Probabilistic AnalysisFull-text access may be available. Sign in or learn about subscription options.pp. 664
Session 10A, Chair: Edith Cohen
Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-random GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 674
Session 10A, Chair: Edith Cohen
Improved Bounds and Algorithms for Hypergraph Two-ColoringFull-text access may be available. Sign in or learn about subscription options.pp. 684
Session 10A, Chair: Edith Cohen
Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing SchemesFull-text access may be available. Sign in or learn about subscription options.pp. 694
Session 10B, Chair: Miklos Ajtai
The Complexity of Acyclic Conjunctive QueriesFull-text access may be available. Sign in or learn about subscription options.pp. 706
Session 10B, Chair: Miklos Ajtai
A Characterization of NC by Tree RecurrenceFull-text access may be available. Sign in or learn about subscription options.pp. 716
Session 10B, Chair: Miklos Ajtai
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial TimeFull-text access may be available. Sign in or learn about subscription options.pp. 725
Session 10B, Chair: Miklos Ajtai
Randomness vs. Time: De-Randomization under a Uniform AssumptionFull-text access may be available. Sign in or learn about subscription options.pp. 734
Session 10B, Chair: Miklos Ajtai
Author IndexFreely available from IEEE.pp. 744
Showing 84 out of 84