Conferences in DBLP
Michael L. Fredman , Dan E. Willard BLASTING through the Information Theoretic Barrier with FUSION TREES [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:1-7 [Conf ] Richard Cole On the Dynamic Finger Conjecture for Splay Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:8-17 [Conf ] Rajamani Sundar , Robert Endre Tarjan Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:18-25 [Conf ] Greg N. Frederickson The Information Theory Bound Is Tight for Selection in a Heap [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:26-33 [Conf ] Johannes A. La Poutré Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:34-44 [Conf ] Wayne Goddard , Valerie King , Leonard J. Schulman Optimal Randomized Algorithms for Local Sorting and Set-Maxima [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:45-53 [Conf ] Raymond A. Board , Leonard Pitt On the Necessity of Occam Algorithms [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:54-63 [Conf ] Avrim Blum Learning Boolean Functions in an Infinite Atribute Space (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:64-72 [Conf ] Manuel Blum , Michael Luby , Ronitt Rubinfeld Self-Testing/Correcting with Applications to Numerical Problems [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:73-83 [Conf ] Andrew Chi-Chih Yao Coherent Functions and Program Checkers (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:84-94 [Conf ] Shimon Even , Sergio Rajsbaum The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:95-105 [Conf ] Michael J. Fischer , Shlomo Moran , Steven Rudich , Gadi Taubenfeld The Wakeup Problem (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:106-116 [Conf ] Martin Dietzfelbinger , Friedhelm Meyer auf der Heide How to Distribute a Dictionary in a Complete Network [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:117-127 [Conf ] Uriel Feige , David Peleg , Prabhakar Raghavan , Eli Upfal Computing with Unreliable Information (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:128-137 [Conf ] Zvi M. Kedem , Krishna V. Palem , Paul G. Spirakis Efficient Robust Parallel Computations (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:138-148 [Conf ] Sanjeev Arora , Frank Thomson Leighton , Bruce M. Maggs On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:149-158 [Conf ] Jeffrey Scott Vitter , Elizabeth A. M. Shriver Optimal Disk I/O with Parallel Block Transfer (Extended Abstract) [Citation Graph (2, 0)][DBLP ] STOC, 1990, pp:159-169 [Conf ] Uzi Vishkin Deterministic Sampling-A New Technique for Fast Pattern Matching [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:170-180 [Conf ] Ming-Yang Kao , Philip N. Klein Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:181-192 [Conf ] Robert Cypher , C. Greg Plaxton Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:193-203 [Conf ] Noam Nisan Psuedorandom Generators for Space-Bounded Computation [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:204-212 [Conf ] Joseph Naor , Moni Naor Small-bias Probability Spaces: Efficient Constructions and Applications [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:213-223 [Conf ] Jeanette P. Schmidt , Alan Siegel The Analysis of Closed Hashing under Limited Randomness (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:224-234 [Conf ] Yishay Mansour , Noam Nisan , Prasoon Tiwari The Computational Complexity of Universal Hashing [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:235-243 [Conf ] Joseph Gil , Friedhelm Meyer auf der Heide , Avi Wigderson Not All Keys Can Be Hashed in Constant Time (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:244-253 [Conf ] David Zuckerman A Technique for Lower Bounding the Cover Time [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:254-259 [Conf ] Nathan Linial , Noam Nisan Approximate Inclusion-Exclusion [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:260-270 [Conf ] Richard Cleve Towards Optimal Simulations of Formulas by Bounded-Width Programs [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:271-277 [Conf ] Mario Szegedy Functions with Bounded Symmetric Communication Complexity and Circuits with \mathop mod m Gates [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:278-286 [Conf ] Ran Raz , Avi Wigderson Monotone Circuits for Matching Require Linear Depth [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:287-292 [Conf ] Noga Alon , Paul D. Seymour , Robin Thomas A Separator Theorem for Graphs with an Excluded Minor and its Applications [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:293-299 [Conf ] Gary L. Miller , William P. Thurston Separators in Two and Three Dimensions [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:300-309 [Conf ] Philip N. Klein , Clifford Stein , Éva Tardos Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:310-321 [Conf ] Ketan Mulmuley Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to k [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:322-330 [Conf ] Alok Aggarwal , Mark Hansen , Frank Thomson Leighton Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:331-340 [Conf ] David G. Kirkpatrick , Bhubaneswar Mishra , Chee-Keng Yap Quantitative Steinitz's Theorems with Applications to Multifingered Grasping [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:341-351 [Conf ] Richard M. Karp , Umesh V. Vazirani , Vijay V. Vazirani An Optimal Algorithm for On-line Bipartite Matching [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:352-358 [Conf ] Marshall W. Bern , Daniel H. Greene , Arvind Raghunathan , Madhu Sudan Online Algorithms for Locating Checkpoints [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:359-368 [Conf ] Don Coppersmith , Peter Doyle , Prabhakar Raghavan , Marc Snir Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:369-378 [Conf ] Shai Ben-David , Allan Borodin , Richard M. Karp , Gábor Tardos , Avi Wigderson On the Power of Randomization in Online Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:379-386 [Conf ] John Rompel One-Way Functions are Necessary and Sufficient for Secure Signatures [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:387-394 [Conf ] Johan Håstad Pseudo-Random Generators under Uniform Assumptions [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:395-404 [Conf ] A. W. Schrift , Adi Shamir The Discrete Log is Very Discreet [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:405-415 [Conf ] Uriel Feige , Adi Shamir Witness Indistinguishable and Witness Hiding Protocols [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:416-426 [Conf ] Moni Naor , Moti Yung Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:427-437 [Conf ] Christos H. Papadimitriou , Alejandro A. Schäffer , Mihalis Yannakakis On the Complexity of Local Search (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:438-445 [Conf ] Alessandro Panconesi , Desh Ranjan Quantifiers and Approximation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:446-456 [Conf ] Mitsunori Ogiwara , Osamu Watanabe On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:457-467 [Conf ] A. J. Kfoury , Jerzy Tiuryn , Pawel Urzyczyn The Undecidability of the Semi-Unification Problem (Preliminary Report) [Citation Graph (1, 0)][DBLP ] STOC, 1990, pp:468-476 [Conf ] Tero Harju , Juhani Karhumäki Decidability of the Multiplicity Equivalence of Multitape Finite Automata [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:477-481 [Conf ] Mihir Bellare , Silvio Micali , Rafail Ostrovsky Perfect Zero-Knowledge in Constant Rounds [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:482-493 [Conf ] Mihir Bellare , Silvio Micali , Rafail Ostrovsky The (True) Complexity of Statistical Zero Knowledge [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:494-502 [Conf ] Donald Beaver , Silvio Micali , Phillip Rogaway The Round Complexity of Secure Protocols (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:503-513 [Conf ] Rafail Ostrovsky Efficient Computation on Oblivious RAMs [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:514-523 [Conf ] William M. Kantor , Eugene M. Luks Computing in Quotient Groups [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:524-534 [Conf ] Allan Borodin , Prasoon Tiwari On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:535-545 [Conf ] Victor Shoup Searching for Primitive Roots in Finite Fields [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:546-554 [Conf ] Yagati N. Lakshman On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:555-563 [Conf ] Arjen K. Lenstra , Hendrik W. Lenstra Jr. , Mark S. Manasse , John M. Pollard The Number Field Sieve [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:564-572 [Conf ]