Abstract is missing.
- Cognitive Computation (Extended Abstract)Leslie G. Valiant. 2-3
- Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication ComplexitySatyanarayana V. Lokam. 6-15
- Pseudorandom Generators, Measure Theory, and Natural ProofsKenneth W. Regan, D. Sivakumar, Jin-yi Cai. 26-35
- Counting Bottlenecks to Show Monotone P <=> NPArmin Haken. 36-40
- Private Information RetrievalBenny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan. 41-50
- Disjoint Paths in Densely Embedded GraphsJon M. Kleinberg, Éva Tardos. 52-61
- Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract)Guy Even, Joseph Naor, Satish Rao, Baruch Schieber. 62-71
- The Loading Time Scheduling Problem (Extended Abstract)Randeep Bhatia, Samir Khuller, Joseph Naor. 72-81
- Approximability of Flow Shop SchedulingLeslie A. Hall. 82-91
- A Representation of Cuts within 6/5 Times the Edge Connectivity with ApplicationsAndrás A. Benczúr. 92-102
- Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection MachinesC. Greg Plaxton. 114-122
- Efficient Parallel Solution of Sparse Eigenvalue and Eigenvector ProblemsJohn H. Reif. 123-132
- Approximating the Volume of Definable SetsPascal Koiran. 134-141
- An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract)Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross. 142-149
- Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract)Michael Luby, Dana Randall, Alistair Sinclair. 150-159
- Derandomizing Semidefinite Programming Based Approximation AlgorithmsSanjeev Mahajan, Ramesh Hariharan. 162-169
- Synthesizers and Their Application to the Parallel Construction of Psuedo-Random FunctionsMoni Naor, Omer Reingold. 170-181
- Splitters and Near-Optimal DerandomizationMoni Naor, Leonard J. Schulman, Aravind Srinivasan. 182-191
- A Unified Analysis of Paging and CachingEric Torng. 194-203
- Application-Controlled Paging for a Shared Cache (Extended Abstract)Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter. 204-213
- Perspectives on Database TheoryMihalis Yannakakis. 224-246
- Algebraic Decompositions of Non-Convex PolyhedraHerbert Edelsbrunner. 248-257
- Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision TreesDima Grigoriev, Marek Karpinski, Nicolai Vorobjov. 258-265
- Optimal Algorithms for Curves on SurfacesTamal K. Dey, Sumanta Guha. 266-274
- Finding Points on Curves over Finite Fields (Extended Abstract)Joachim von zur Gathen, Igor Shparlinski. 284-292
- Tracking the Best DisjunctionPeter Auer, Manfred K. Warmuth. 312-321
- Gambling in a Rigged Casino: The Adversarial Multi-Arm Bandit ProblemPeter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire. 322-331
- Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded AdversariesYoav Freund, Michael J. Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire. 332-341
- RSPACE(S) /subseteq DSPACE(S:::3/2:::)Michael E. Saks, Shiyu Zhou. 344-353
- The Resolution of a Hartmanis ConjectureJin-yi Cai, D. Sivakumar. 362-371
- A Scheduling Model for Reduced CPU EnergyF. Frances Yao, Alan J. Demers, Scott Shenker. 374-382
- Load Balancing in the L::p:: NormBaruch Awerbuch, Yossi Azar, Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter. 383-391
- Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version)Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts. 392-401
- Reductions, Codes, PCPs, and InapproximabilitySanjeev Arora. 404-413
- Improved Hardness Results for Approximating the Chromatic NumberMartin Fürer. 414-421
- Free Bits, PCPs and Non-Approximability - Towards Tight ResultsMihir Bellare, Oded Goldreich, Madhu Sudan. 422-431
- Linearity Testing in Characteristic TwoMihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan. 432-441
- 3-Coloring in Time O(1.3446:::n:::): A No-MIS AlgorithmRichard Beigel, David Eppstein. 444-452
- Computing Simulations on Finite and Infinite GraphsMonika Rauch Henzinger, Thomas A. Henzinger, Peter W. Kopke. 453-462
- Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected TimeC. R. Subramanian. 463-472
- Improved Algorithms and Analysis for Secretary Problems and GeneralizationsMiklós Ajtai, Nimrod Megiddo, Orli Waarts. 473-482
- Controllability, Recognizability, and Complexity Issues in Robot Motion PlanningJean-Claude Latombe. 484-500
- Coding for ComputingAlon Orlitsky, James R. Roche. 502-511
- Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)Noga Alon, Jeff Edmonds, Michael Luby. 512-519
- Using Autoreducibility to Separate Complexity ClassesHarry Buhrman, Lance Fortnow, Leen Torenvliet. 520-527
- Hard-Core Distributions for Somewhat Hard ProblemsRussell Impagliazzo. 538-545
- Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of RingsMilena Mihail, Christos Kaklamanis, Satish Rao. 548-557
- Routing on Butterfly Networks with Random FaultsRichard Cole, Bruce M. Maggs, Ramesh K. Sitaraman. 558-570
- Fault Diagnosis in a FlashRichard Beigel, William Hurwood, Nabil Kahale. 571-580
- Transforming Men into Mice (Polynomial Algorithm for Genomic Distance Problem)Sridhar Hannenhalli, Pavel A. Pevzner. 581-592
- Algorithms for Matrix Groups and the Tits AlternativeRobert Beals. 593-602
- Optimal On-Line Search and Sublinear Time Update in String MatchingPaolo Ferragina, Roberto Grossi. 604-612
- Reconstructing Strings from Substrings in RoundsDimitris Margaritis, Steven Skiena. 613-620
- The Bit Vector Intersection Problem (Preliminary Version)Richard M. Karp, Orli Waarts, Geoffrey Zweig. 621-630
- Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version)S. Rao Kosaraju. 631-637
- An Approximation Scheme for Planar Graph TSPMichelangelo Grigni, Elias Koutsoupias, Christos H. Papadimitriou. 640-645
- Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy LinkingChris Okasaki. 646-654
- Sublogarithmic Searching without MultiplicationsArne Andersson. 655-663
- Fully Dynamic Biconnectivity and Transitive ClosureMonika Rauch Henzinger, Valerie King. 664-672
- Lower Bounds for Monotone Span ProgramsAmos Beimel, Anna Gál, Mike Paterson. 674-681
- On Computing Boolean Functions by Sparse Real PolynomialsMatthias Krause, Pavel Pudlák. 682-691
- Improved Depth Lower Vounds for Small Distance ConnectivityPaul Beame, Russell Impagliazzo, Toniann Pitassi. 692-701
- Tight Fault Locality (Extended Abstract)Shay Kutten, David Peleg. 704-713
- Faster Approximate Agreement with Multi-Writer RegistersEric Schenk. 714-723
- Resolving Message Complexity of Byzantine Agreement and beyondZvi Galil, Alain J. Mayer, Moti Yung. 724-733