Table of Contents

• Probabilistic Checking of Proofs; A New Characterization of NPSanjeev Arora, Shmuel Safra. 2-13
• Proof Verification and Hardness of Approximation ProblemsSanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy. 14-23
• Undirected Connectivity in O(log ^1.5 n) SpaceNoam Nisan, Endre Szemerédi, Avi Wigderson. 24-29
• The Isomorphism Conjecture Holds Relative to an OracleStephen A. Fenner, Lance Fortnow, Stuart A. Kurtz. 30-39
• Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended QueuesAdam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan. 40-49
• Fully Dynamic Biconnectivity in GraphsMonika Rauch. 50-59
• Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract)David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig. 60-69
• On Four-Connecting a Triconnected Graph (Extended Abstract)Tsan-sheng Hsu. 70-79
• Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning TreesPankaj K. Agarwal, David Eppstein, Jirí Matousek. 80-89
• Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract)Ketan Mulmuley. 90-100
• Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract)Goos Kant. 101-110
• Computing in Solvable Matrix GroupsEugene M. Luks. 111-120
• Fast Algorithms for Matrix Normal FormsMark Giesbrecht. 121-130
• Improved Parallel Polynomial Division and Its ExtensionsDario Bini, Victor Y. Pan. 131-136
• Randomized Consensus in Expected O(n log ^2 n) Operations Per ProcessorJames Aspnes, Orli Waarts. 137-146
• Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract)Yonatan Aumann, Michael O. Rabin. 147-156
• Fault-tolerant Wait-free Shared ObjectsPrasad Jayanti, Tushar Deepak Chandra, Sam Toueg. 157-166
• Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary LogicErich Grädel, Gregory L. McColm. 167-176
• Back to the Future: Towards a Theory of Timed Regular LanguagesRajeev Alur, Thomas A. Henzinger. 177-186
• The Complexity of the Hajós CalculusToniann Pitassi, Alasdair Urquhart. 187-196
• A Decomposition Theorem and Bounds for Randomized Server ProblemsAvrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks. 197-207
• Markov Paging (Extended Abstract)Anna R. Karlin, Steven J. Phillips, Prabhakar Raghavan. 208-217
• On-line Load Balancing (Extended Abstract)Yossi Azar, Andrei Z. Broder, Anna R. Karlin. 218-225
• Improved Lower Bounds for ShellsortC. Greg Plaxton, Bjorn Poonen, Torsten Suel. 226-235
• The Asymptotic Complexity of Merging NetworksPeter Bro Miltersen, Mike Paterson, Jun Tarui. 236-246
• Truly Alphabet-Independent Two-Dimensional Pattern MatchingZvi Galil, Kunsoo Park. 247-256
• Amplification and PercolationMoshe Dubiner, Uri Zwick. 258-267
• Algebraic Decision Trees and Euler CharacteristicsAndrew Chi-Chih Yao. 268-277
• Separating the Communication Complexities of MOD m and MOD p CircuitsVince Grolmusz. 278-287
• Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary)Don Coppersmith, Baruch Schieber. 288-295
• On the Second Eigenvalue and Linear Expansion of Regular GraphsNabil Kahale. 296-303
• Quadratic Dynamical Systems (Preliminary Version)Yuri Rabinovich, Alistair Sinclair, Avi Wigderson. 304-313
• On the Bit Extraction ProblemJoel Friedman. 314-319
• A Mildly Exponential Approximation Algorithm for the PermanentMark Jerrum, Umesh V. Vazirani. 320-326
• Competitive Analysis of Financial GamesRan El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin. 327-333
• Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract)Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer. 334-343
• The Distributed k-Server Problem-A Competitive Distributed Translator for k-Server AlgorithmsYair Bartal, Adi Rosén. 344-353
• Undecidability of the Horn-Clause Implication ProblemJerzy Marcinkowski, Leszek Pacholski. 354-362
• Efficient Inference of Partial TypesDexter Kozen, Jens Palsberg, Michael I. Schwartzbach. 363-371
• On the Completeness of Object-Creating Query Languages (Extended Abstract)Jan Van den Bussche, Dirk Van Gucht, Marc Andries, Marc Gyssens. 372-379
• Enumerating the k Closest Pairs OptimallyHans-Peter Lenhof, Michiel H. M. Smid. 380-386
• Safe and Effective Determinant EvaluationKenneth L. Clarkson. 387-395
• On Minimum and Maximum Spanning Trees of Linearly Moving PointsNaoki Katoh, Takeshi Tokuyama, Kazuo Iwano. 396-405
• Towards a Computational Theory of Statistical Tests (Extended Abstract)Manuel Blum, Oded Goldreich. 406-416
• Witnesses for Boolean Matrix Multiplication and for Shortest PathsNoga Alon, Zvi Galil, Oded Margalit, Moni Naor. 417-426
• Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract)Alfredo De Santis, Giuseppe Persiano. 427-436
• Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract)Chee-Keng Yap. 437-446
• How to Denest Ramanujan s Nested RadicalsJohannes Blömer. 447-456
• On Efficient Band Matrix ArithmeticWayne Eberly. 457-463
• A Subexponential Algorithm for Abstract Optimization ProblemsBernd Gärtner. 464-472
• The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster. 473-481
• On the Randomized Complexity of Volume and DiameterLászló Lovász, Miklós Simonovits. 482-491
• Apple Tasting and Nearly One-Sided LearningDavid P. Helmbold, Nick Littlestone, Philip M. Long. 493-502
• Reconstructing Algebraic Functions from Mixed DataSigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan. 503-512
• On the Exact Learning of Formulas in Parallel (Extended Abstract)Nader H. Bshouty, Richard Cleve. 513-522
• Read-Thrice DNF Is Hard to Learn With Membership and Equivalence QueriesHoward Aizenstein, Lisa Hellerstein, Leonard Pitt. 523-532
• Efficient Self-Embedding of Butterfly Networks with Random FaultsHisao Tamaki. 533-541
• On the Fault Tolerance of Some Popular Bounded-Degree NetworksFrank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman. 542-552
• Exact Analysis of Hot-Potato Routing (Extended Abstract)Uriel Feige, Prabhakar Raghavan. 553-562
• A Theory of Wormhole Routing in Parallel Computers (Extended Abstract)Sergio A. Felperin, Prabhakar Raghavan, Eli Upfal. 563-572
• Computing a Shortest k-Link Path in a PolygonJoseph S. B. Mitchell, Christine D. Piatko, Esther M. Arkin. 573-582
• Efficient Minimum Cost Matching Using Quadrangle InequalityAlok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber. 583-592
• Optimal Parallel Hull Construction for Simple Polygons in /calO(log log n) TimeHubert Wagener. 593-599
• Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract)Richard Cole, Ramesh Hariharan. 600-609
• Tiling a Polygon with RectanglesClaire Kenyon, Richard Kenyon. 610-619
• Mick Gets Some (the Odds Are on His Side)Vasek Chvátal, B. Reed. 620-627
• Waste Makes Haste: Tight Bounds for Loose Parallel SortingTorben Hagerup, Rajeev Raman. 628-637
• The Complexity of Parallel Prefix Problems on Small DomainsShiva Chaudhuri, Jaikumar Radhakrishnan. 638-647
• Approximate Max Flow on Small Depth NetworksEdith Cohen. 648-658
• Newton s Method for Fractional Combinatorial OptimizationTomasz Radzik. 659-669
• A Class of Logic Problems Solvable by Linear ProgrammingMichele Conforti, Gérard Cornuéjols. 670-675
• Maximizing Non-Linear Concave Functions in Fixed DimensionSivan Toledo. 676-685
• Halvers and ExpandersMiklós Ajtai, János Komlós, Endre Szemerédi. 686-692
• Fault Tolerant Graphs, Perfect Hash Functions and Disjoint PathsMiklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi. 693-702
• The Power of Combining the Techiques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole AlgorithmsVictor Y. Pan, John H. Reif, Stephen R. Tate. 703-713
• Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract)Erich Kaltofen, Victor Y. Pan. 714-723
• Communication on Noisy Channels: A Coding Theorem for ComputationLeonard J. Schulman. 724-733