Abstract is missing.
- The Regularity Lemma and Approximation Schemes for Dense ProblemsAlan M. Frieze, Ravi Kannan. 12-20
- A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement ProblemsSanjeev Arora, Alan M. Frieze, Haim Kaplan. 21-30
- A Decision Procedure for Unitary Linear Quantum Cellular AutomataChristoph Dürr, Miklos Santha. 38-45
- Polynomial Simulations of Decohered Quantum ComputersDorit Aharonov, Michael Ben-Or. 46-55
- Fault-Tolerant Quantum ComputationPeter W. Shor. 56-65
- Single-Source Unsplittable FlowJon M. Kleinberg. 68-77
- The Optimal Path-Matching ProblemWilliam H. Cunningham, James F. Geelen. 78-85
- Short Paths in Expander GraphsJon M. Kleinberg, Ronitt Rubinfeld. 86-95
- Spectral Partitioning Works: Planar Graphs and Finite Element MeshesDaniel A. Spielman, Shang-Hua Teng. 96-105
- Solving Systems of Polynomial Congruences Modulo a Large Prime (extended abstract)Ming-Deh A. Huang, Yiu-Chung Wong. 115-124
- Median Selection Requires (2+epsilon)n ComparisonsDorit Dor, Uri Zwick. 125-134
- Faster Deterministic Sorting and Searching in Linear SpaceArne Andersson. 135-141
- An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian GroupsVijay V. Vazirani, Huzur Saran, B. Sundar Rajan. 144-153
- Maximum Likelihood Decoding of Reed Solomon CodesMadhu Sudan. 164-172
- New Coding Techniques for Improved Bandwidth UtilizationMicah Adler. 173-182
- Probabilistic Approximations of Metric Spaces and Its Algorithmic ApplicationsYair Bartal. 184-193
- Factoring Graphs to Bound Mixing RatesNeal Madras, Dana Randall. 194-203
- Sampling According to the Multivariate Normal DensityRavi Kannan, Guangxing Li. 204-212
- Load Balancing and Density Dependent Jump Markov Processes (extended abstract)Michael Mitzenmacher. 213-222
- Tree Data Structures for N-Body SimulationRichard J. Anderson. 224-233
- Efficient Information Gathering on the Internet (extended abstract)Oren Etzioni, Steve Hanks, Tao Jiang, Richard M. Karp, Omid Madani, Orli Waarts. 234-243
- Approximate Option PricingPrasad Chalasani, Somesh Jha, Isaac Saias. 244-253
- Temporal Logic and Semidirect Products: An Effective Characterization of the Until HierarchyDenis Thérien, Thomas Wilke. 256-263
- Equivalence in Finite-Variable Logics is Complete for Polynomial TimeMartin Grohe. 264-273
- Simplified and Improved Resolution Lower BoundsPaul Beame, Toniann Pitassi. 274-282
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract)Joseph Cheriyan, Ramakrishna Thurimella. 292-301
- A 3-Approximation for the Minimum Tree Spanning k VerticesNaveen Garg. 302-309
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set ProblemGuy Even, Joseph Naor, Leonid Zosin. 310-319
- Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract)Süleyman Cenk Sahinalp, Uzi Vishkin. 320-328
- A Polynomial-Time Algorithm for Learning Noisy Linear Threshold FunctionsAvrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala. 330-338
- Property Testing and Its Connection to Learning and ApproximationOded Goldreich, Shafi Goldwasser, Dana Ron. 339-348
- Learning Linear TransformationsAlan M. Frieze, Mark Jerrum, Ravi Kannan. 359-368
- Deterministic Routing with Bounded Buffers: Turning Offline into Online ProtocolsFriedhelm Meyer auf der Heide, Christian Scheideler. 370-379
- Universal Stability Results for Greedy Contention-Resolution ProtocolsMatthew Andrews, Baruch Awerbuch, Antonio Fernández, Jon M. Kleinberg, Frank Thomson Leighton, Zhiyong Liu. 380-389
- A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract)Andrei Z. Broder, Alan M. Frieze, Eli Upfal. 390-399
- Path Coloring on the MeshYuval Rabani. 400-409
- Discrepancy Sets and Pseudorandom Generators for Combinatorial RectanglesRoy Armoni, Michael E. Saks, Avi Wigderson, Shiyu Zhou. 412-421
- The Boolean Isomorphism ProblemManindra Agrawal, Thomas Thierauf. 422-430
- Potential of the Approximation Method (extended abstract)Kazuyuki Amano, Akira Maruoka. 431-440
- Static Dictionaries on AC:::0::: RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and SufficientArne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup. 441-450
- All Pairs Almost Shortest PathsDorit Dor, Shay Halperin, Uri Zwick. 452-461
- Computing Vertex Connectivity: New Bounds from Old TechniquesMonika Rauch Henzinger, Satish Rao, Harold N. Gabow. 462-471
- Binary Search Partitions for Fat RectanglesPankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter. 482-491
- On the Knowledge Complexity of NPErez Petrank, Gábor Tardos. 494-503
- Incoercible Multiparty Computation (extended abstract)Ran Canetti, Rosario Gennaro. 504-513
- Pseudorandom Functions Revisited: The Cascade Construction and Its Concrete SecurityMihir Bellare, Ran Canetti, Hugo Krawczyk. 514-523
- The Geometry of Coin-Weighing ProblemsNoga Alon, Dmitry N. Kozlov, Van H. Vu. 524-532
- Near-Optimal Parallel Prefetching and CachingTracy Kimbrel, Anna R. Karlin. 540-549
- New Algorithms for the Disk Scheduling ProblemMatthew Andrews, Michael A. Bender, Lisa Zhang. 550-559
- Optimal Dynamic Interval Management in External Memory (extended abstract)Lars Arge, Jeffrey Scott Vitter. 560-569
- Fast Fault-Tolerant Concurrent Access to Shared ObjectsC. Greg Plaxton, Rajmohan Rajaraman. 570-579
- Approximate Checking of Polynomials and Functional Equations (extended abstract)Funda Ergün, Ravi Kumar, Ronitt Rubinfeld. 592-601
- Efficient Self-Testing/Self-Correction of Linear RecurrencesRavi Kumar, D. Sivakumar. 602-611
- Verifying Identities (extended abstract)Sridhar Rajagopalan, Leonard J. Schulman. 612-616
- Gadgets, Approximation, and Linear Programming (extended abstract)Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson. 617-626
- Clique is Hard to Approximate Within n:::1-epsilon:::Johan Håstad. 627-636