Abstract is missing.
- Approximating Clique is Almost NP-Complete (Preliminary Version)Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy. 2-12
- Fully Parallelized Multi Prover Protocols for NEXP-Time (Extended Abstract)Dror Lapidot, Adi Shamir. 13-18
- Languages that Are Easier than their ProofsRichard Beigel, Mihir Bellare, Joan Feigenbaum, Shafi Goldwasser. 19-28
- An Optimal Convex Hull Algorithm and New Results on Cuttings (Extended Abstract)Bernard Chazelle. 29-38
- The Art Gallery Theorem for Polygons With HolesFrank Hoffmann, Michael Kaufmann, Klaus Kriegel. 39-48
- Fat Triangles Determine Linearly Many HolesJirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl. 49-58
- Quantifying Knowledge ComplexityOded Goldreich, Erez Petrank. 59-68
- Subquadratic Zero-KnowledgeJoan Boyar, Gilles Brassard, René Peralta. 69-78
- Simulating BPP Using a General Weak Random SourceDavid Zuckerman. 79-89
- Checking the Correctness of MemoriesManuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor. 90-99
- On-line Scheduling in the Presence of OverloadSanjoy K. Baruah, Gilad Koren, Bhubaneswar Mishra, Arvind Raghunathan, Louis E. Rosier, Dennis Shasha. 100-110
- Dynamic Scheduling on Parallel MachinesAnja Feldmann, Jiri Sgall, Shang-Hua Teng. 111-120
- Optimal Prefetching via Data Compression (Extended Abstract)Jeffrey Scott Vitter, P. Krishnan. 121-130
- Scheduling Parallel Machines On-LineDavid B. Shmoys, Joel Wein, David P. Williamson. 131-140
- Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection BoundManfred Kunde. 141-150
- Communication Complexity for Parallel Divide-and-ConquerI-Chen Wu, H. T. Kung. 151-162
- On Selecting a Satisfying Truth Assignment (Extended Abstract)Christos H. Papadimitriou. 163-169
- Exact Learning of Read-Twice DNF Formulas (Extended Abstract)Howard Aizenstein, Leonard Pitt. 170-179
- Randomized Multidimensional Search Trees: Lazy Balancing and Dynamic Shuffling (Extended Abstract)Ketan Mulmuley. 180-196
- Dynamic Maintenance of Geometric Structures Made EasyOtfried Schwarzkopf. 197-206
- Reporting Points in HalfspacesJirí Matousek. 207-215
- Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended Abstract)Ketan Mulmuley. 216-227
- Interactive Communication: Balanced Distributions, Correlated Files, and Average-Case ComplexityAlon Orlitsky. 228-238
- Amortized Communication Complexity (Preliminary Version)Tomás Feder, Eyal Kushilevitz, Moni Naor. 239-248
- Communication Complexity Towards Lower Bounds on Circuit DepthJeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall. 249-257
- Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols (Extended Abstract)Baruch Awerbuch, George Varghese. 258-267
- Self-Stabilization By Local Checking and Correction (Extended Abstract)Baruch Awerbuch, Boaz Patt-Shamir, George Varghese. 268-277
- An Asynchronous Two-Dimensional Self-Correcting Cellular AutomatonWeiguo Wang. 278-285
- Competitive Algorithms for Layered Graph TraversalAmos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan. 288-297
- How to Learn an Unknown Environment (Extended Abstract)Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou. 298-303
- Walking an Unknown Street with Bounded DetourRolf Klein. 304-313
- Better Bounds for Threshold FormulasJaikumar Radhakrishnan. 314-323
- Shrinkage of de~Morgan formulae under restrictionMike Paterson, Uri Zwick. 324-333
- Size-Depth Tradeoffs for Algebraic FormulaeNader H. Bshouty, Richard Cleve, Wayne Eberly. 334-341
- A New Characterization of Mehlhorn s Polynomial Time Functionals (Extended Abstract)Bruce M. Kapron, Stephen A. Cook. 342-347
- A Theory of Using History for Equational Systems with Applications (Extended Abstract)Rakesh M. Verma. 348-357
- Progress Measures for Complementation of omega-Automata with Applications to Temporal LogicNils Klarlund. 358-367
- Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)E. Allen Emerson, Charanjit S. Jutla. 368-377
- Lower Bounds for Polynomial Evaluation and Interpolation ProblemsVictor Shoup, Roman Smolensky. 378-383
- Efficient Exponentiation in Finite Fields (Extended Abstract)Joachim von zur Gathen. 384-391
- Explicit Construction of Natural Bounded ConcentratorsMoshe Morgenstern. 392-397
- Better Expansion for Ramanujan GraphsNabil Kahale. 398-404
- A General Approach to Removing DegeneraciesIoannis Z. Emiris, John F. Canny. 405-413
- A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract)Herbert Edelsbrunner, Tiow Seng Tan. 414-423
- Discrepancy and epsilon-approximations for bounded VC-dimensionJirí Matousek, Emo Welzl, Lorenz Wernisch. 424-430
- On Better Heuristic for Euclidean Steiner Minimum Trees (Extended Abstract)Ding-Zhu Du, Yanjun Zhang, Qing Feng. 431-439
- Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract)Yonatan Aumann, Michael Ben-Or. 440-446
- Fault-tolerant Computation in the Full Information Model (Extended Abstract)Oded Goldreich, Shafi Goldwasser, Nathan Linial. 447-457
- Highly Fault-Tolerant Sorting CircuitsFrank Thomson Leighton, Yuan Ma, C. Greg Plaxton. 458-469
- Efficient Algorithms for Dynamic Allocation of Distributed MemoryFrank Thomson Leighton, Eric J. Schwabe. 470-479
- Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant MatricesIlan Adler, Peter A. Beling. 480-487
- Dynamic Three-Dimensional Linear ProgrammingDavid Eppstein. 488-494
- Fast Approximation Algorithms for Fractional Packing and Covering ProblemsSerge A. Plotkin, David B. Shmoys, Éva Tardos. 495-504
- The Maintenance of Common Data in a Distributed SystemBaruch Awerbuch, Leonard J. Schulman. 505-514
- Optimal File Sharing in Distributed Networks (Preliminary Version)Moni Naor, Ron M. Roth. 515-525
- Low Contention Linearizable CountingMaurice Herlihy, Nir Shavit, Orli Waarts. 526-535
- A Unified Geometric Approach to Graph SeparatorsGary L. Miller, Shang-Hua Teng, Stephen A. Vavasis. 538-547
- A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract)Tsan-sheng Hsu, Vijaya Ramachandran. 548-559
- Finding the Hidden Path: Time Bounds for All-Pairs Shortest PathsDavid R. Karger, Daphne Koller, Steven J. Phillips. 560-568
- On the Exponent of the All Pairs Shortest Path ProblemNoga Alon, Zvi Galil, Oded Margalit. 569-575
- Search Problems in the Decision Tree Model (Preliminary Version)László Lovász, Moni Naor, Ilan Newman, Avi Wigderson. 576-585
- A parallel algorithmic version of the Local LemmaNoga Alon. 586-593
- Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy GatesAnna Gál. 594-601
- Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower BoundRüdiger Reischuk, Bernd Schmeltz. 602-611
- A Lower Bound for the Dictionary Problem under a Hashing ModelRajamani Sundar. 612-621
- Lower Bounds for Data Structure Problems on RAMs (Extended Abstract)Amir M. Ben-Amram, Zvi Galil. 622-631
- Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning TreesGreg N. Frederickson. 632-641
- Faster Uniquely Represented DictionariesArne Andersson, Thomas Ottmann. 642-649
- On the Complexity of Computing the Homology Type of a TriangulationBruce Randall Donald, Davied Renpan Chang. 650-661
- An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q]Dima Grigoriev, Marek Karpinski. 662-669
- Computing Sums of Radicals in Polynomial TimeJohannes Blömer. 670-677
- Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve (Extended Abstract)Ming-Deh A. Huang, Doug Ierardi. 678-687
- Connected Components in O(/lg^3/2 |V|) Parallel Time for the CREW PRAMDonald B. Johnson, Panagiotis Takis Metaxas. 688-697
- Towards a Theory of Nearly Constant Time Parallel AlgorithmsJoseph Gil, Yossi Matias, Uzi Vishkin. 698-710
- Using Approximation Algorithms to Design Parallel Algorithms that May Ignore Processor Allocation (Preliminary Version)Michael T. Goodrich. 711-722
- A Deterministic Parallel Algorithm for Planar Graphs IsomorphismHillel Gazit. 723-732
- Approximate Representation Theory of Finite GroupsLászló Babai, Katalin Friedl. 733-742
- Finding k-cuts within Twice the OptimalHuzur Saran, Vijay V. Vazirani. 743-751
- How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin PackingPeter W. Shor. 752-759
- Adaptive Dictionary MatchingAmihood Amir, Martin Farach. 760-766
- On the Computational Power of Sigmoid versus Boolean Threshold CircuitsWolfgang Maass, Georg Schnitger, Eduardo D. Sontag. 767-776
- Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-InMatthias Krause, Stephan Waack. 777-782
- On ACCRichard Beigel, Jun Tarui. 783-792
- On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract)Arkady Kanevsky, Roberto Tamassia, Giuseppe Di Battista, Jianer Chen. 793-801
- Computing Planar IntertwinesArvind Gupta, Russell Impagliazzo. 802-811
- Applications of a Poset Representation to Edge Connectivity and Graph RigidityHarold N. Gabow. 812-821