Conferences in DBLP
Alon Itai Finding a Minimum Circuit in a Graph [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao , David Avis , Ronald L. Rivest An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem [Citation Graph (0, 0)][DBLP ] Conf ] Robert Endre Tarjan Reference Machines Require Non-linear Time to Maintain Disjoint Sets [Citation Graph (0, 0)][DBLP ] Conf ] Dana Angluin , Leslie G. Valiant Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings [Citation Graph (0, 0)][DBLP ] Conf ] Mark R. Brown The Complexity of Priority Queue Maintenance [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , Edward M. McCreight , Michael F. Plass , Janet R. Roberts A New Representation for Linear Lists [Citation Graph (1, 0)][DBLP ] Conf ] George S. Sacerdote , Richard L. Tenney The Decidability of the Reachability Problem for Vector Addition Systems (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Ashok K. Chandra , Philip M. Merlin Optimal Implementation of Conjunctive Queries in Relational Data Bases [Citation Graph (95, 0)][DBLP ] Conf ] Gary L. Peterson , Michael J. Fischer Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Arnie Rosenthal Nonserial Dynamic Programming Is Optimal [Citation Graph (0, 0)][DBLP ] Conf ] Larry Carter , Mark N. Wegman Universal Classes of Hash Functions (Extended Abstract) [Citation Graph (2, 0)][DBLP ] Conf ] Gaston H. Gonnet , J. Ian Munro The Analysis of an Improved Hashing Technique [Citation Graph (0, 0)][DBLP ] Conf ] John C. Beatty Iteration Theorems for LL(k) Languages [Citation Graph (0, 0)][DBLP ] Conf ] Bhaskaram Prabhala , Ravi Sethi A Comparison of Instruction Sets for Stack Machines [Citation Graph (0, 0)][DBLP ] Conf ] Gary L. Miller Graph Isomorphism, General Remarks [Citation Graph (0, 0)][DBLP ] Conf ] Leonard M. Adleman , Kenneth L. Manders Reducibility, Randomness, and Intractability (Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Dexter Kozen Complexity of Finitely Presented Algebras [Citation Graph (4, 0)][DBLP ] Conf ] Chandra M. R. Kintala , Patrick C. Fischer Computations with a Restricted Number of Nondeterministic Steps (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] István Simon , John Gill Polynomial Reducibilities and Upward Diagonalizations [Citation Graph (0, 0)][DBLP ] Conf ] Janos Simon On Feasible Numbers (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Ivan Hal Sudborough Separating Tape Bounded Auxiliary Pushdown Automata Classes [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang J. Paul On Time Hierarchies [Citation Graph (0, 0)][DBLP ] Conf ] Juris Hartmanis Relations Between Diagonalization, Proof Systems, and Complexity Gaps (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Nancy A. Lynch , Edward K. Blum Efficient Reducibility Between Programming Systems: Preliminary Report [Citation Graph (0, 0)][DBLP ] Conf ] Benton L. Leong , Joel I. Seiferas New Real-Time Simulations of Multihead Tape Units [Citation Graph (0, 0)][DBLP ] Conf ] David Harel , Amir Pnueli , Jonathan Stavi A Complete Axiomatic System for Proving Deductions about Recursive Programs [Citation Graph (0, 0)][DBLP ] Conf ] David Harel , Albert R. Meyer , Vaughan R. Pratt Computability and Completeness in Logics of Programs (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Robert L. Constable On the Theory of Programming Logics [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Fischer , Richard E. Ladner Propositional Modal Logic of Programs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Mike O'Donnell Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Hennessy , Edward A. Ashcroft Parameter-Passing Mechanisms and Nondeterminism [Citation Graph (0, 0)][DBLP ] Conf ] 