Abstract is missing.
- Biased Random WalksYossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips. 1-9
- Approximations of General Independent DistributionsGuy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic. 10-16
- Sample Spaces Uniform on NeighborhoodsLeonard J. Schulman. 17-25
- Balanced MatroidsTomás Feder, Milena Mihail. 26-38
- Competitive Algorithms for Distributed Data Management (Extended Abstract)Yair Bartal, Amos Fiat, Yuval Rabani. 39-50
- New Algorithms for an Ancient Scheduling ProblemYair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra. 51-58
- Alphabet Independent Two Dimensional MatchingAmihood Amir, Gary Benson, Martin Farach. 59-68
- A Constant-Time Optimal Parallel String-Matching AlgorithmZvi Galil. 69-76
- Methods for Message Routing in Parallel MachinesFrank Thomson Leighton. 77-96
- Computing Frobenius Maps and Factoring Polynomials (Extended Abstract)Joachim von zur Gathen, Victor Shoup. 97-105
- Parallel Computation Over Hyperbolic GroupsJin-yi Cai. 106-115
- Structure Forest and Composition Factors for Small Base Groups in Nearly Linear TimeRobert Beals, Ákos Seress. 116-125
- Feasibility Testing for Systems of Real Quadratic EquationsAlexander I. Barvinok. 126-132
- Fault Tolerant Planar Communication NetworksGeng Lin. 133-139
- Existence and Construction of Edge Disjoint Paths on Expander GraphsAndrei Z. Broder, Alan M. Frieze, Eli Upfal. 140-149
- Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Extended Abstract)Bruce M. Maggs, Ramesh K. Sitaraman. 150-161
- Computing with Faulty ArraysYonatan Aumann, Michael Ben-Or. 162-169
- Linear Decision Trees: Volume Estimates and Topological BoundsAnders Björner, László Lovász, Andrew Chi-Chih Yao. 170-177
- Entropy and SortingJeff Kahn, Jeong Han Kim. 178-187
- Randomized versus Nondeterministic Communication ComplexityPaul Beame, Joan Lawry. 188-199
- Exponential Lower Bounds for the Pigeonhole PrinciplePaul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák, Alan R. Woods. 200-220
- Finding Approximate Separators and Computing Tree Width QuicklyBruce A. Reed. 221-228
- Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract)Satish Rao. 229-240
- The Complexity of Multiway Cuts (Extended Abstract)Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis. 241-251
- Graph Decomposition Is NPC-A Complete Proof of Holyer s ConjectureDorit Dor, Michael Tarsi. 252-263
- Online Minimization of Transition Systems (Extended Abstract)David Lee, Mihalis Yannakakis. 264-274
- Exponential Determinization for omega-Automata with Strong-Fairness Acceptance Condition (Extended Abstract)Shmuel Safra. 275-282
- A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract)Stephen Bellantoni, Stephen A. Cook. 283-293
- Asymptotic Conditional Probabilities for First-Order LogicAdam J. Grove, Joseph Y. Halpern, Daphne Koller. 294-305
- Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version)Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin, A. Raghunathan. 306-317
- Efficient PRAM Simulation on a Distributed Memory MachineRichard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide. 318-326
- A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed DimensionMiklós Ajtai, Nimrod Megiddo. 327-338
- On the Parallel Complexity of Computing a Maximal Independent Set in a HypergraphPierre Kelsen. 339-350
- Computational Learning Theory: Survey and Selected BibliographyDana Angluin. 351-369
- Learning Arithmetic Read-Once FormulasNader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein. 370-381
- Fast Learning of k-Term DNF Formulas with QueriesAvrim Blum, Steven Rudich. 382-389
- Can Finite Samples Detect Singularities of Real-Valued Functions?Shai Ben-David. 390-399
- A Logspace Algorithm for Tree Canonization (Extended Abstract)Steven Lindell. 400-404
- A Hypercubic Sorting Network with Nearly Logarithmic DepthC. Greg Plaxton. 405-416
- Small-Depth Counting NetworksMichael Klugerman, C. Greg Plaxton. 417-428
- Shallow Multiplication Circuits and Wise Financial InvestmentsMike Paterson, Uri Zwick. 429-437
- Symmetry and ComplexityLászló Babai, Robert Beals, Pál Takácsi-Nagy. 438-449
- When Do Extra Majority Gates Help? Polylog(n) Majority Gates Are Equivalent to OneRichard Beigel. 450-454
- Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract)David A. Mix Barrington, Richard Beigel, Steven Rudich. 455-461
- On the Degree of Boolean Functions as Real PolynomialsNoam Nisan, Mario Szegedy. 462-467
- On the Degree of Polynomials that Approximate Symmetric Boolean Functions (Preliminary Version)Ramamohan Paturi. 468-474
- A Subexponential Randomized Simplex Algorithm (Extended Abstract)Gil Kalai. 475-482
- Polynomial Algorithms for Linear Programming over the Algebraic NumbersIlan Adler, Peter A. Beling. 483-494
- Fully Dynamic Planarity Testing (Extended Abstract)Zvi Galil, Giuseppe F. Italiano, Neil Sarnak. 495-506
- Planar Separators and Parallel Polygon Triangulation (Preliminary Version)Michael T. Goodrich. 507-516
- Ray Shooting and Parametric SearchPankaj K. Agarwal, Jirí Matousek. 517-526
- On the Angular Resolution of Planar GraphsSeth M. Malitz, Achilleas Papakostas. 527-538
- Ham-Sandwich Cuts in R^dChi-Yuan Lo, Jirí Matousek, William L. Steiger. 539-545
- A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version)Paul B. Callahan, S. Rao Kosaraju. 546-556
- Adapting to Asynchronous Dynamic Networks (Extended Abstract)Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Michael E. Saks. 557-570
- Competitive Distributed Job Scheduling (Extended Abstract)Baruch Awerbuch, Shay Kutten, David Peleg. 571-580
- Improved Distributed Algorithms for Coloring and Network Decomposition ProblemsAlessandro Panconesi, Aravind Srinivasan. 581-592
- Efficient Fault Tolerant Algorithms for Resource Allocation in Distributed SystemsManhoi Choy, Ambuj K. Singh. 593-602
- The History and Status of the P versus NP QuestionMichael Sipser. 603-618
- RL/subseteqSCNoam Nisan. 619-623
- On the Complexity of RAM with Various Operation SetsJanos Simon, Mario Szegedy. 624-631
- Average Case Intractability of Matrix and Diophantine Problems (Extended Abstract)Ramarathnam Venkatesan, Sivaramakrishnan Rajagopalan. 632-642
- On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract)Uriel Feige, Carsten Lund. 643-654
- Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible!Cynthia Dwork, Orli Waarts. 655-666
- Self-Stabilizing Symmetry Breaking in Constant-Space (Extended Abstract)Alain J. Mayer, Yoram Ofek, Rafail Ostrovsky, Moti Yung. 667-678
- A Correctness Condition for High-Performance Multiprocessors (Extended Abstract)Hagit Attiya, Roy Friedman. 679-690
- Target Shooting with Programmed Random VariablesGraham Brightwell, Teunis J. Ott, Peter Winkler. 691-698
- Communication Complexity of Secure Computation (Extended Abstract)Matthew K. Franklin, Moti Yung. 699-710
- Making Zero-Knowledge Provers EfficientMihir Bellare, Erez Petrank. 711-722
- A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract)Joe Kilian. 723-732
- Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract)Uriel Feige, László Lovász. 733-744
- On the All-Pairs-Shortest-Path ProblemRaimund Seidel. 745-749
- A Parallel Randomized Approximation Scheme for Shortest PathsPhilip N. Klein, Sairam Sairam. 750-758
- Biconnectivity Approximations and Graph CarvingsSamir Khuller, Uzi Vishkin. 759-770
- epsilon-Approximations with Minimum Packing Constraint Violation (Extended Abstract)Jyh-Han Lin, Jeffrey Scott Vitter. 771-782