Abstract is missing.
- PP Is Closed Under Intersection (Extended Abstract)Richard Beigel, Nick Reingold, Daniel A. Spielman. 1-9
- Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract)Ker-I Ko. 10-20
- Checking Computations in Polylogarithmic TimeLászló Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy. 21-31
- Self-Testing/Correcting for Polynomials and for Approximate FunctionsPeter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, Avi Wigderson. 32-42
- Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract)Greg Barnes, Walter L. Ruzzo. 43-53
- Effective Noether Irreducibility Forms and Applications (Extended Abstract)Erich Kaltofen. 54-63
- Factoring Numbers Using Singular IntegersLeonard M. Adleman. 64-71
- Constructing Nonresidues in Finite Fields and the Extended Riemann HypothesisJohannes Buchmann, Victor Shoup. 72-79
- Reducing Elliptic Curve Logarithms to Logarithms in a Finite FieldAlfred Menezes, Scott A. Vanstone, Tatsuaki Okamoto. 80-89
- Fast Monte Carlo Algorithms for Permutation GroupsLászló Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress. 90-100
- Fast Approximation Algorithms for Multicommodity Flow ProblemsFrank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas. 101-111
- A Matroid Approach to Finding Edge Connectivity and Packing ArborescencesHarold N. Gabow. 112-122
- Clique Partitions, Graph Compression, and Speeding-Up AlgorithmsTomás Feder, Rajeev Motwani. 123-133
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on NetworksAjit Agrawal, Philip N. Klein, R. Ravi. 134-144
- Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract)Edith Cohen, Nimrod Megiddo. 145-155
- Sampling and Integration of Near Log-Concave functionsDavid Applegate, Ravi Kannan. 156-163
- Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite GroupsLászló Babai. 164-174
- Counting Linear Extensions is /#P-CompleteGraham Brightwell, Peter Winkler. 175-181
- Finding Hidden Hamiltonian Cycles (Extended Abstract)Andrei Z. Broder, Alan M. Frieze, Eli Shamir. 182-189
- Probabilistic Recurrence RelationsRichard M. Karp. 190-197
- Separating Concurrent Languages with Categories of Language Embeddings (Extended Abstract)Ehud Y. Shapiro. 198-208
- Generic Computation and Its ComplexitySerge Abiteboul, Victor Vianu. 209-219
- Hamiltonian Paths in Infinite GraphsDavid Harel. 220-229
- Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case StudyEdward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis. 230-240
- Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor SchedulingEdward G. Coffman Jr., M. R. Garey. 241-248
- Competitive Paging with Locality of Reference (Preliminary Version)Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber. 249-259
- The Harmonic Online K-Server Algorithm Is CompetitiveEdward F. Grove. 260-266
- A Model for Data in MotionSimon Kahan. 267-277
- Lower Bounds for Randomized k-Server and Motion Planning AlgorithmsHoward J. Karloff, Yuval Rabani, Yiftach Ravid. 278-288
- Infinite Games, Randomization, Computability, and Applications to Online Problems (Preliminary Version)Xiaotie Deng, Sanjeev Mahajan. 289-298
- Constant-Time Parallel Integer Sorting (Extended Abstract)Torben Hagerup. 299-306
- Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract)Yossi Matias, Uzi Vishkin. 307-316
- Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract)Zvi Galil, Giuseppe F. Italiano. 317-327
- Linear Approximation of Shortest SuperstringsAvrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis. 328-336
- An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden SubgraphsHristo Djidjev, John H. Reif. 337-347
- Counting Networks and Multi-Processor CoordinationJames Aspnes, Maurice Herlihy, Nir Shavit. 348-358
- Bounds on the Time to Reach Agreement in the Presence of Timing UncertaintyHagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer. 359-369
- Wait-free Parallel Algorithms for the Union-Find ProblemRichard J. Anderson, Heather Woll. 370-380
- Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract)Zvi M. Kedem, Krishna V. Palem, A. Raghunathan, Paul G. Spirakis. 381-390
- Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract)Joseph Cheriyan, Ramakrishna Thurimella. 391-401
- The Expressive Power of Voting PolynomialsJames Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich. 402-409
- Lower Bounds for Non-Commutative Computation (Extended Abstract)Noam Nisan. 410-418
- Rounds in Communication Complexity RevisitedNoam Nisan, Avi Wigderson. 419-429
- On Deterministic Approximation of DNFMichael Luby, Boban Velickovic. 430-438
- A Lower Bound for Parallel String MatchingDany Breslauer, Zvi Galil. 439-443
- When Won t Membership Queries Help? (Extended Abstract)Dana Angluin, Michael Kharitonov. 444-454
- Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract)Eyal Kushilevitz, Yishay Mansour. 455-464
- On-Line Learning of Linear FunctionsNick Littlestone, Philip M. Long, Manfred K. Warmuth. 465-475
- Testing Finite State Machines (Extended Abstract)Mihalis Yannakakis, David Lee. 476-485
- Searching in the Presence of Linearly Bounded Errors (Extended Abstract)Javed A. Aslam, Aditi Dhagat. 486-493
- Navigating in Unfamiliar Geometric Terrain (Preliminary Version)Avrim Blum, Prabhakar Raghavan, Baruch Schieber. 494-504
- Approximations and Optimal Geometric Divide-And-ConquerJirí Matousek. 505-511
- Hidden Surface Removal with Respect to a Moving View PointKetan Mulmuley. 512-522
- Dynamic Trees and Dynamic Point Location (Preliminary Version)Michael T. Goodrich, Roberto Tamassia. 523-533
- Rigorous Time/Space Tradeoffs for Inverting FunctionsAmos Fiat, Moni Naor. 534-541
- Non-Malleable Cryptography (Extended Abstract)Danny Dolev, Cynthia Dwork, Moni Naor. 542-552
- A General Completeness Theorem for Two-Party GamesJoe Kilian. 553-560
- Perfect Cryptographic Security from Partially Independent ChannelsUeli M. Maurer. 561-571