Abstract is missing.
- Simulating (log ^c n)-wise Independence in NCBonnie Berger, John Rompel. 2-7
- The Probabilistic Method Yields Deterministic Parallel AlgorithmsRajeev Motwani, Joseph Naor, Moni Naor. 8-13
- Dispersers, Deterministic Amplification, and Weak Random Sources (Extended Abstract)Aviad Cohen, Avi Wigderson. 14-19
- On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Tradeoff, and Their Applications (Extended Abstract)Alan Siegel. 20-25
- The Strength of Weak Learnability (Extended Abstract)Robert E. Schapire. 28-33
- A Theory of Learning Simple Concepts Under Simple Distributions and Average Case Complexity for the Universal Distribution (Extended Abstract)Ming Li, Paul M. B. Vitányi. 34-39
- Generalizing the PAC Model: Sample Size Bounds From Metric Dimension-based Uniform Convergence ResultsDavid Haussler. 40-45
- Learning Binary Relations and Total Orders (Extended Abstract)Sally A. Goldman, Ronald L. Rivest, Robert E. Schapire. 46-51
- Efficient NC Algorithms for Set Cover with Applications to Learning and GeometryBonnie Berger, John Rompel, Peter W. Shor. 54-59
- Fast Matching Algorithms for Points on a Polygon (Extended Abstract)Odile Marcotte, Subhash Suri. 60-65
- Ensemble Motion Planning in TreesGreg N. Frederickson, D. J. Guan. 66-71
- An Upper Bound on the Number of Planar k-SetsJános Pach, William L. Steiger, Endre Szemerédi. 72-79
- The Inverse of an Automorphism in Polynomial TimeMatthew Dickerson. 82-87
- Testing Permutation Polynomials (Extended Abstract)Joachim von zur Gathen. 88-92
- Computing Irreducible Representations of Finite GroupsLászló Babai, Lajos Rónyai. 93-98
- Galois Groups and Factoring Polynomials over Finite FieldsLajos Rónyai. 99-104
- Efficient Algorithms for Independent Assignments on Graphic and Linear MatroidsHarold N. Gabow, Ying Xu. 106-111
- Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract)Gary L. Miller, Joseph Naor. 112-117
- A Randomized Maximum-Flow AlgorithmJoseph Cheriyan, Torben Hagerup. 118-123
- Graph Products and Chromatic NumbersNathan Linial, Umesh V. Vazirani. 124-128
- Lower Bounds for the Stable Marriage Problem and its VariantsCheng Ng. 129-133
- Approximation Schemes for Constrained Scheduling ProblemsLeslie A. Hall, David B. Shmoys. 134-139
- Datalog vs. First-Order LogicMiklós Ajtai, Yuri Gurevich. 142-147
- Decidability and Expressiveness for First-Order Logics of Probability (Extended Abstract)Martín Abadi, Joseph Y. Halpern. 148-153
- Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract)Stephen A. Cook, Bruce M. Kapron. 154-159
- The 0-1 Law Fails for the Class of Existential Second Order Gödel Sentences with EqualityLeszek Pacholski, Wieslaw Szwast. 160-163
- A Really Temporal LogicRajeev Alur, Thomas A. Henzinger. 164-169
- Full Abstraction for Nondeterministic Dataflow NetworksJames R. Russell. 170-175
- Efficient Tree Pattern Matching (Preliminary Version)S. Rao Kosaraju. 178-183
- Pipelining Computations in a Tree of Processors (Preliminary Version)S. Rao Kosaraju. 184-189
- Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version)Michael T. Goodrich, S. Rao Kosaraju. 190-195
- Recursive *-Tree Parallel Data-Structure (Extended Abstract)Omer Berkman, Uzi Vishkin. 196-202
- Computational Complexity of Roots of Real Functions (Extended Abstract)Ker-I Ko. 204-209
- On the Complexity of Fixed Parameter Problems (Extended Abstract)Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata. 210-215
- Structure in Locally Optimal Solutions (Extended Abstract)Mark W. Krentel. 216-221
- Decision Versus Search Problems in Super-Polynomial TimeRussell Impagliazzo, Gábor Tardos. 222-227
- One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract)Russell Impagliazzo, Michael Luby. 230-235
- Efficient Cryptographic Schemes Provably as Secure as Subset SumRussell Impagliazzo, Moni Naor. 236-241
- Lower Bounds for Pseudorandom Number GeneratorsMichael Kharitonov, Andrew V. Goldberg, Moti Yung. 242-247
- How to Recycle Random BitsRussell Impagliazzo, David Zuckerman. 248-253
- The Weighted Majority AlgorithmNick Littlestone, Manfred K. Warmuth. 256-261
- On the Complexity of Learning From Counterexamples (Extended Abstract)Wolfgang Maass, György Turán. 262-267
- The Equivalence and Learning of Probabilistic Automata (Extended Abstract)Wen-Guey Tzeng. 268-273
- Planning and Learning in Permutation GroupsAmos Fiat, Shahar Moses, Adi Shamir, Ilan Shimshoni, Gábor Tardos. 274-279
- An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract)Vijaya Ramachandran, John H. Reif. 282-287
- Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)Samir Khuller, Baruch Schieber. 288-293
- The Parallel Complexity of the Subgraph Connectivity ProblemLefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis. 294-299
- Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski HomeomorphSamir Khuller, Stephen G. Mitchell, Vijay V. Vazirani. 300-305
- Lower Bounds for Algebraic Computation Trees with Integer InputsAndrew Chi-Chih Yao. 308-313
- Simplification of Nested RadicalsSusan Landau. 314-319
- Generalizing the Continued Fraction Algorithm to Arbitrary DimensionsBettina Just. 320-324
- The Complexity of Approximating the Square Root (Extended Summary)Yishay Mansour, Baruch Schieber, Prasoon Tiwari. 325-330
- Speeding-Up Linear Programming Using Fast Matrix Multiplication (Extended Abstract)Pravin M. Vaidya. 332-337
- A New Algorithm for Minimizing Convex Functions over Convex Sets (Extended Abstract)Pravin M. Vaidya. 338-343
- Asymptotically Fast Algorithms for Spherical and Related TransformsJames R. Driscoll, Dennis M. Healy Jr.. 344-349
- Interior-Point Methods in Parallel ComputationAndrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos. 350-355
- Polynomial End-To-End Communication (Extended Abstract)Baruch Awerbuch, Yishay Mansour, Nir Shavit. 358-363
- Network Decomposition and Locality in Distributed ComputationBaruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin. 364-369
- Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract)Yehuda Afek, Eli Gafni, Moty Ricklin. 370-375
- The Synchronization of Nonuniform Networks of Finite Automata (Extended Abstract)Tao Jiang. 376-381
- Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on MultibutterfliesFrank Thomson Leighton, Bruce M. Maggs. 384-389
- Efficient Simulations of Small Shared Memories on Bounded Degree Networks (Preliminary Version)Kieran T. Herley. 390-395
- On the Network Complexity of SelectionC. Greg Plaxton. 396-401
- Power of Fast VLSI Models Is Insensitive to Wires ThinnessGene Itkis, Leonid A. Levin. 402-407
- Towards Optimal Distributed Consensus (Extended Abstract)Piotr Berman, Juan A. Garay, Kenneth J. Perry. 410-415
- Privacy and Communication ComplexityEyal Kushilevitz. 416-421
- Solvability in Asynchronous Environments (Extended Abstract)Benny Chor, Lior Moscovici. 422-427
- Multiparty Communication ComplexityDanny Dolev, Tomás Feder. 428-433
- Incremental Planarity Testing (Extended Abstract)Giuseppe Di Battista, Roberto Tamassia. 436-441
- Generating Random Spanning TreesAndrei Z. Broder. 442-447
- Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version)Greg N. Frederickson. 448-453
- An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract)Elias Dahlhaus, Marek Karpinski. 454-459
- On the Complexity of Space Bounded Interactive Proofs (Extended Abstract)Anne Condon, Richard J. Lipton. 462-467
- Multiparty Computation with Faulty Majority (Extended Announcement)Donald Beaver, Shafi Goldwasser. 468-473
- Minimum Resource Zero-Knowledge Proofs (Extended Abstract)Joe Kilian, Silvio Micali, Rafail Ostrovsky. 474-479
- On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract)Cynthia Dwork, Larry J. Stockmeyer. 480-485
- Dynamically Computing the Maxima of Decomposable Functions, with ApplicationsDavid P. Dobkin, Subhash Suri. 488-493
- Stable Maintenance of Point Set Triangulations in Two DimensionsSteven Fortune. 494-499
- Double Precision Geometry: A General Technique for Calculating Line and Segment Intersections Using Rounded ArithmeticVictor Milenkovic. 500-505
- Area-Optimal Three-Layer Channel RoutingRuth Kuchem, Dorothea Wagner, Frank Wagner. 506-511
- On the Computational Power of PP and +PSeinosuke Toda. 514-519
- An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract)Michael R. Fellows, Michael A. Langston. 520-525
- Conductance and Convergence of Markov Chains-A Combinatorial Treatment of ExpandersMilena Mihail. 526-531
- Lower Bounds for Constant Depth Circuits in the Presence of Help BitsJin-yi Cai. 532-537
- Randomized Search TreesCecilia R. Aragon, Raimund Seidel. 540-545
- On the Complexity of a Game Related to the Dictionary ProblemKurt Mehlhorn, Stefan Näher, Monika Rauch. 546-548
- Space-efficient Static Trees and GraphsGuy Jacobson. 549-554
- Twists, Turns, Cascades, Deque Conjecture, and Scanning TheoremRajamani Sundar. 555-559
- Probabilistic Communication Complexity of Boolean Relations (Extended Abstract)Ran Raz, Avi Wigderson. 562-567
- Subquadratic Simulations of Circuits by Branching ProgramsJin-yi Cai, Richard J. Lipton. 568-573
- Constant Depth Circuits, Fourier Transform, and LearnabilityNathan Linial, Yishay Mansour, Noam Nisan. 574-579
- A Note on the Power of Threshold CircuitsEric Allender. 580-584
- An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra (Detailed Abstract)Bernard Chazelle. 586-591
- On Obstructions in Relation to a Fixed ViewpointKetan Mulmuley. 592-597
- Output-Sensitive Hidden Surface RemovalMark H. Overmars, Micha Sharir. 598-603
- Approximation Algorithms for Geometric Embeddings in the Plane with Applications to Parallel Processing Problems (Extended Abstract)Mark D. Hansen. 604-609
- An Optimal Lower Bound on the Number of Variables for Graph IdentificationJin-yi Cai, Martin Fürer, Neil Immerman. 612-617
- On Reversal Complexity for Alternating Turing Machines (Extended Abstract)Maciej Liskiewicz, Krzysztof Lorys. 618-623
- Every Polynomial-Time 1-Degree Collapses iff P=PSPACEStephen A. Fenner, Stuart A. Kurtz, James S. Royer. 624-629