Conferences in DBLP
J. C. Lagarias , Andrew M. Odlyzko Solving Low-Density Subset Sum Problems [Citation Graph (0, 0)][DBLP ] Conf ] Michael Luby , Silvio Micali , Charles Rackoff How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin [Citation Graph (0, 0)][DBLP ] Conf ] Umesh V. Vazirani , Vijay V. Vazirani Trapdoor Pseudo-random Number Generators, with Applications to Protocol Design [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Kahn , Michael E. Saks , Dean Sturtevant A Topological Approach to Evasiveness [Citation Graph (0, 0)][DBLP ] Conf ] Shimon Even , Oded Goldreich On the Security of Multi-Party Ping-Pong Protocols [Citation Graph (0, 0)][DBLP ] Conf ] Harry G. Mairson The Program Complexity of Searching a Table [Citation Graph (3, 0)][DBLP ] Conf ] Janet Incerpi , Robert Sedgewick Improved Upper Bounds on Shellsort [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp , Michael Luby Monte-Carlo Algorithms for Enumeration and Reliability Problems [Citation Graph (2, 0)][DBLP ] Conf ] Jeffrey Scott Vitter Optimum Algorithms for Two Random Sampling Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet , G. Nigel Martin Probabilistic Counting [Citation Graph (2, 0)][DBLP ] Conf ] Herbert Edelsbrunner , Joseph O'Rourke , Raimund Seidel Constructing Arrangements of Lines and Hyperplanes with Applications [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail J. Atallah Dynamic Computational Geometry (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , Lyle Ramshaw , Jorge Stolfi A Kinetic Framework for Computational Geometry [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Chee-Keng Yap Geometric Retrieval Problems [Citation Graph (1, 0)][DBLP ] Conf ] Bernard Chazelle Filtering Search: A New Approach to Query-Answering [Citation Graph (2, 0)][DBLP ] Conf ] Joachim von zur Gathen Representations of Rational Functions [Citation Graph (0, 0)][DBLP ] Conf ] John H. Reif Logarithmic Depth Circuits for Algebraic Functions [Citation Graph (0, 0)][DBLP ] Conf ] Uzi Vishkin , Avi Wigderson Trade-Offs between Depth and Width in Parallel Computation (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Pierre McKenzie , Stephen A. Cook The Parallel Complexity of the Abelian Permutation Group Membership Problem [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , William M. Kantor , Eugene M. Luks Computational Complexity and the Classification of Finite Simple Groups [Citation Graph (0, 0)][DBLP ] Conf ] Joachim von zur Gathen Factoring Sparse Multivariate Polynomials [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy Tiuryn , Pawel Urzyczyn Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Wolper , Moshe Y. Vardi , A. Prasad Sistla Reasoning about Infinite Computation Paths (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Rohit Parikh Propositional Game Logic [Citation Graph (0, 0)][DBLP ] Conf ] Sarit Kraus , Daniel J. Lehmann Decision Procedures for Time and Chance (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Yuri Gurevich Algebras of Feasible Functions [Citation Graph (6, 0)][DBLP ] Conf ] Joffroy Beauquier , Françoise Gire On Context-Free Generators [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Leonidas J. Guibas , D. T. Lee The Power of Geometric Duality [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth L. Clarkson Fast Algorithms for the All Nearest Neighbors Problem [Citation Graph (1, 0)][DBLP ] Conf ] Tetsuo Asano , Takao Asano Minimum Partition of Polygonal Regions into Trapezoids [Citation Graph (3, 0)][DBLP ] Conf ] Greg N. Frederickson Shortest Path Problems in Planar Graphs (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow Scaling Algorithms for Network Problems [Citation Graph (0, 0)][DBLP ] Conf ] Donald B. Johnson , Shankar M. Venkatesan Partition of Planar Flow Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Brenda S. Baker Approximation Algorithms for NP-Complete Problems on Planar Graphs (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Mihalis Yannakakis A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet , Claude Puech Tree Structures for Partial Match Retrieval [Citation Graph (2, 0)][DBLP ] Conf ] George S. Lueker Bin Packing with Items Uniformly Distributed over Intervals [a,b] [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai , Michael L. Fredman , János Komlós Hash Functions for Priority Queues [Citation Graph (1, 0)][DBLP ] Conf ] Piotr Berman , Janos Simon Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Joseph JáJá On the Computational Complexity of the Permanent (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Alt Multiplication Is the Easiest Nontrivial Arithmetic Function [Citation Graph (0, 0)][DBLP ] Conf ] Georg Schnitger On Depth-Reduction and Grates [Citation Graph (0, 0)][DBLP ] Conf ] Christopher B. Wilson Relativized Circuit Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Robert E. Wilber Randomness and the Density of Hard Problems [Citation Graph (0, 0)][DBLP ] Conf ] Ramamohan Paturi , Janos Simon Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Peter H. Hochschild , Ernst W. Mayr , Alan R. Siegel Techniques for Solving Graph Problems in Parallel Environments [Citation Graph (0, 0)][DBLP ] Conf ] Brenda S. Baker , Ron Y. Pinter An Algorithm for the Optimal Placement and Routing of a Circuit within a Ring of Pads (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal Period-Time Tradeoffs for VLSI Models with Delay (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Albert G. Greenberg , Richard E. Ladner Estimating the Multiplicities of Conflicts in Multiple Access Channels (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Danny Dolev , Cynthia Dwork , Larry J. Stockmeyer On the Minimal Synchronism Needed for Distributed Consensus [Citation Graph (0, 0)][DBLP ] Conf ] Michael O. Rabin Randomized Byzantine Generals [Citation Graph (0, 0)][DBLP ] Conf ] Maria M. Klawe A Tight Bound for Black and White Pebbles on the Pyramid [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Lower Bounds by Probabilistic Arguments (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang J. Paul , Nicholas Pippenger , Endre Szemerédi , William T. Trotter On Determinism versus Non-Determinism and Related Problems (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Juris Hartmanis Generalized Kolmogorov Complexity and the Structure of Feasible Computations (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou Games Against Nature (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp , Frank Thomson Leighton , Ronald L. Rivest , Clark D. Thompson , Umesh V. Vazirani , Vijay V. Vazirani Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Leivant Reasoning about Functional Programs and Complexity Classes Associated with Type Disciplines [Citation Graph (1, 0)][DBLP ] Conf ] Nathan Linial Legal Coloring of Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Nathan Linial , Michael E. Saks Information Bounds Are Good for Search Problems on Ordered Data Structures [Citation Graph (0, 0)][DBLP ] Conf ] 