Conferences in DBLP
Frank Thomson Leighton New Lower Bound Techniques for VLSI [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Lipton , Jacobo Valdes Census Functions: an Approach to VLSI Upper Bounds (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Charles E. Leiserson , James B. Saxe Optimizing Synchronous Systems [Citation Graph (0, 0)][DBLP ] Conf ] Zvi M. Kedem , Alessandro Zorat On Relations Between Input and Communication/Computation in VLSI (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Eitan M. Gurari , Oscar H. Ibarra Two-Way Counter Machines and Diophantine Equations [Citation Graph (0, 0)][DBLP ] Conf ] Pavol Duris , Zvi Galil A Time-Space Tradeoff for Language Recognition [Citation Graph (0, 0)][DBLP ] Conf ] Michael C. Loui Simulations among Multidimensional Turing Machines (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang J. Paul On Heads Versus Tapes [Citation Graph (0, 0)][DBLP ] Conf ] Richard Edwin Stearns , Harry B. Hunt III On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata [Citation Graph (0, 0)][DBLP ] Conf ] Don Coppersmith , Shmuel Winograd On the Asymptotic Complexity of Matrix Multiplication (Extended Summary) [Citation Graph (0, 0)][DBLP ] Conf ] Ephraim Feig , Shmuel Winograd On the Direct Sum Conjecture (Extended Summary) [Citation Graph (0, 0)][DBLP ] Conf ] Joseph JáJá Computation of Algebraic Functions with Root Extractions [Citation Graph (0, 0)][DBLP ] Conf ] Norbert Blum An Omega(n^4/3) Lower Bound on the Monotone Network Complexity of n-th Degree Convolution [Citation Graph (0, 0)][DBLP ] Conf ] Maria M. Klawe Non-Existence of One-Dimensional Expanding Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Mark J. Post A Minimum Spanning Ellipse Algorithm [Citation Graph (0, 0)][DBLP ] Conf ] Z. Aviad , E. Shamir A Direct Dynamic Solution to Range Search and Related Problems for Product Regions [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey Scott Vitter Deletion Algorithms for Hashing that Preserve Randomness (detailed abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Greg N. Frederickson Implicit Data Structures for the Weighted Dictionary Problem (preliminary version) [Citation Graph (0, 0)][DBLP ] Conf ] William C. Rounds , Stephen D. Brookes Possible Futures, Acceptances, Refusals, and Communicating Processes [Citation Graph (0, 0)][DBLP ] Conf ] Alon Itai , Michael Rodeh Symmetry Breaking in Distributive Networks [Citation Graph (0, 0)][DBLP ] Conf ] Danny Dolev Unanimity in an Unknown and Unreliable Environment [Citation Graph (2, 0)][DBLP ] Conf ] James E. Burns Symmetry in Systems of Asynchronous Processes [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Sethi A model of concurrent database transactions (summary) [Citation Graph (4, 0)][DBLP ] Conf ] Paris C. Kanellakis , Christos H. Papadimitriou The Complexity of Distributed Concurrency Control [Citation Graph (9, 0)][DBLP ] Conf ] Moshe Y. Vardi Global Decision Problems for Relational Databases [Citation Graph (1, 0)][DBLP ] Conf ] David S. Johnson , Anthony C. Klug Optimizing Conjunctive Queries When Attribute Domains Are not Disjoint (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Rüdiger Reischuk A Fast Probabilistic Parallel Sorting Algorithm [Citation Graph (0, 0)][DBLP ] Conf ] Udi Manber , Martin Tompa The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem [Citation Graph (0, 0)][DBLP ] Conf ] Rutger Verbeek Time-Space Trade-Offs for General Recursion [Citation Graph (0, 0)][DBLP ] Conf ] R. Kannan Towards Separating Nondeterministic Time from Deterministic Time [Citation Graph (0, 0)][DBLP ] Conf ] Sven Skyum , Leslie G. Valiant A Complexity Theory Based on Boolean Algebra [Citation Graph (0, 0)][DBLP ] Conf ] Ronald V. Book , Christopher B. Wilson , Mei-rui Xu Relativizing Time and Space (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Merrick L. Furst , James B. Saxe , Michael Sipser Parity, Circuits, and the Polynomial-Time Hierarchy [Citation Graph (2, 0)][DBLP ] Conf ] Stephen R. Mahaney On the Number of P-Isomorphism Classes of NP-Complete Sets [Citation Graph (0, 0)][DBLP ] Conf ] Richard Statman Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Carl H. Smith The Power of Parallelism for Automatic Program Synthesis [Citation Graph (0, 0)][DBLP ] Conf ] Péter Gács On the Relation between Descriptional Complexity and Algorithmic Probability [Citation Graph (0, 0)][DBLP ] Conf ] R. Kannan A Circuit-Size Lower Bound [Citation Graph (0, 0)][DBLP ] Conf ] David Harel , Amir Pnueli , Jonathan Stavi Propositional Dynamic Logic of Context-Free Programs [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Y. Halpern , John H. Reif The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy Tiuryn Unbounded Program Memory Adds to the Expressive Power of First-Order Dynamic Logic (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Wolper Temporal Logic Can Be More Expressive [Citation Graph (3, 0)][DBLP ] Conf ] Danny Dolev , Andrew Chi-Chih Yao On the Security of Public Key Protocols (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou , Mihalis Yannakakis Worst-Case Ratios for Planar Graphs and the Method of Induction on Faces (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp , Michael Sipser Maximum Matchings in Sparse Random Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Nimrod Megiddo , S. Louis Hakimi , M. R. Garey , David S. Johnson , Christos H. Papadimitriou The Complexity of Searching a Graph (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet , Jean-Marc Steyaert A Complexity Calculus for Classes of Recursive Search Programs over Tree Structures [Citation Graph (0, 0)][DBLP ] Conf ] Michael Ben-Or Probabilistic Algorithms in Finite Fields [Citation Graph (0, 0)][DBLP ] Conf ] Nimrod Megiddo Applying Parallel Computation Algorithms in the Design of Serial Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Leonard M. Adleman , Andrew M. Odlyzko Irreducibility Testing and Factorization of Polynomials (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Vaughan R. Pratt A Decidable mu-Calculus: Preliminary Report [Citation Graph (0, 0)][DBLP ] Conf ] 