Abstract is missing.
- Competitive k-Server Algorithms (Extended Abstract)Amos Fiat, Yuval Rabani, Yiftach Ravid. 454-463
- Randomized Online Graph Coloring (Preliminary Version)Sundar Vishwanathan. 464-469
- Coloring Inductive Graphs On-LineSandy Irani. 470-479
- Online Algorithms for Finger Searching (Extended Abstract)Richard Cole, Arvind Raghunathan. 480-489
- Communication-Optimal Maintenance of Replicated InformationBaruch Awerbuch, Israel Cidon, Shay Kutten. 492-502
- Sparse Partitions (Extended Abstract)Baruch Awerbuch, David Peleg. 503-513
- Network Synchronization with Polylogarithmic OverheadBaruch Awerbuch, David Peleg. 514-522
- General Weak Random SourcesDavid Zuckerman. 534-543
- Simple Constructions of Almost k-Wise Independent Random VariablesNoga Alon, Oded Goldreich, Johan Håstad, René Peralta. 544-553
- Some Tools for Approximate 3-Coloring (Extended Abstract)Avrim Blum. 554-562
- Randomness in Interactive ProofsMihir Bellare, Oded Goldreich, Shafi Goldwasser. 563-572
- Parallel Linear Programming in Fixed Dimension Almost Surely in Constant TimeNoga Alon, Nimrod Megiddo. 574-582
- Reducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract)Pravin M. Vaidya. 583-589
- Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMsCharles U. Martel, Ramesh Subramonian, Arvin Park. 590-599
- Uniform Memory HierarchiesBowen Alpern, Larry Carter, Ephraim Feig. 600-608
- On the Power of Small-Depth Threshold CircuitsJohan Håstad, Mikael Goldmann. 610-618
- On ACC and Threshold CircuitsAndrew Chi-Chih Yao. 619-627
- On Interpolation by Analytic Functions with Special Properties and Some Weak Lower Bounds on the Size of Circuits with Symmetric GatesRoman Smolensky. 628-631
- Polynomial Threshold Functions, AC^0 Functions and Spectral Norms (Extended Abstract)Jehoshua Bruck, Roman Smolensky. 632-641
- Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean FunctionsMike Paterson, Nicholas Pippenger, Uri Zwick. 642-650
- Deciding Properties of Nonregular Programs (Preliminary Version)David Harel, Danny Raz. 652-661
- Decision Problems for Propositional Linear LogicPatrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar. 662-671
- Tight Bounds on the Complexity of Cascaded Decomposition of AutomataOded Maler, Amir Pnueli. 672-682
- Finite-Memory Automata (Extended Abstract)Michael Kaminski, Nissim Francez. 683-688
- Probabilities of Sentences about Very Sparse Random GraphsJames F. Lynch. 689-696
- A Fast Algorithm for Optimally Increasing the Edge-ConnectivityDalit Naor, Dan Gusfield, Charles U. Martel. 698-707
- Augmenting Graphs to Meet Edge-Connectivity RequirementsAndrás Frank. 708-718
- Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest PathsMichael L. Fredman, Dan E. Willard. 719-725
- Approximation through Multicommodity FlowPhilip N. Klein, Ajit Agrawal, R. Ravi, Satish Rao. 726-737
- Computing with Snakes in Directed Networks of Automata (Extended Abstract)Shimon Even, Ami Litman, Peter Winkler. 740-745
- Distributed Reactive Systems Are Hard to SynthesizeAmir Pnueli, Roni Rosner. 746-757
- Communication Complexity of Algebraic Computation (Extended Abstract)Zhi-Quan Luo, John N. Tsitsiklis. 758-765
- Bounds on Tradeoffs between Randomness and Communication ComplexityRan Canetti, Oded Goldreich. 766-775
- The Complexity of Finding MediansSeinosuke Toda. 778-787
- On the Predictability of Coupled Automata: An Allegory about ChaosSamuel R. Buss, Christos H. Papadimitriou, John N. Tsitsiklis. 788-793
- On Graph-Theoretic Lemmata and Complexity Classes (Extended Abstract)Christos H. Papadimitriou. 794-801
- Matrix Decomposition Problem Is Complete for the Average CaseYuri Gurevich. 802-811
- No Better Ways to Generate Hard NP Instances than Picking Uniformly at RandomRussell Impagliazzo, Leonid A. Levin. 812-821
- Complexity of Unification in Free Groups and Free Semi-groupsAntoni Koscielski, Leszek Pacholski. 824-829
- The Lattice Reduction Algorithm of Gauss: An Average Case AnalysisBrigitte Vallée, Philippe Flajolet. 830-839
- Interpolation of Sparse Rational Functions Without Knowing Bounds on ExponentsDima Grigoriev, Marek Karpinski, Michael F. Singer. 840-846
- Simplifying Nested Radicals and Solving Polynomials by Radicals in Minimum DepthGwoboa Horng, Ming-Deh A. Huang. 847-856
- On the Diameter of Finite GroupsLászló Babai, Gábor Hetyei, William M. Kantor, Alexander Lubotzky, Ákos Seress. 857-865
- Some Triply-Logarithmic Parallel Algorithms (Extended Abstract)Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin. 871-881