Conferences in DBLP
Shmuel Winograd The Effect of the Field of Constants on the Number of Multiplication [Citation Graph (0, 0)][DBLP ] Conf ] Robert W. Floyd The Exact Time Required to Perform Generalized Addition [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Lipton Polynomials with 0-1 Coefficients that Are Hard to Evaluate [Citation Graph (0, 0)][DBLP ] Conf ] L. Csanky Fast Parallel Matrix Inversion Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Eshrat Arjomandi , Derek G. Corneil Parallel Computations in Graph Theory [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Lipton , Raymond E. Miller , Lawrence Snyder Synchronization and Computing Capabilities of Linear Asynchronous Structures [Citation Graph (0, 0)][DBLP ] Conf ] J. W. de Bakker Flow of Control in the Proof Theory of Structured Programming [Citation Graph (0, 0)][DBLP ] Conf ] George Markowsky , Barry K. Rosen Bases for Chain-Complete Posets [Citation Graph (0, 0)][DBLP ] Conf ] Peter J. Downey , Ravi Sethi Correct Computation Rules for Recursive Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] John E. Hopcroft , Wolfgang J. Paul , Leslie G. Valiant On Time versus Space and Related Problems [Citation Graph (0, 0)][DBLP ] Conf ] Juris Hartmanis , Leonard Berman A Note on Tape Bounds for SLA Language Processing [Citation Graph (0, 0)][DBLP ] Conf ] Ira Pohl Minimean Optimality in Sorting Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Peter van Emde Boas Preserving Order in a Forest in less than Logarithmic Time [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao On the Complexity of Comparison Problems using Linear Functions (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Thomas G. Szymanski , Jeffrey D. Ullman Evaluating Relational Expressions with Dense and Sparse Arguments [Citation Graph (0, 0)][DBLP ] Conf ] Michael L. Fredman On the Decision Tree Complexity of the Shortest Path Problems [Citation Graph (0, 0)][DBLP ] Conf ] Shimon Even , Oded Kariv An O(n^2.5) Algorithm for Maximum Matching in General Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Nicholas Pippenger Information Theory and the Complexity of Switching Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Vaughan R. Pratt The Effect of Basis on Size of Boolean Expressions [Citation Graph (0, 0)][DBLP ] Conf ] Matthew M. Geller , Harry B. Hunt III , Thomas G. Szymanski , Jeffrey D. Ullman Economy of Descriptions by Parsers, DPDA's, and PDA's [Citation Graph (0, 0)][DBLP ] Conf ] Catriel Beeri An Improvement of Valiant's Decision Procedure for Equivalence of Deterministic Finite-Turn Pushdown Automata [Citation Graph (0, 0)][DBLP ] Conf ] William C. Rounds A Grammatical Characterization of Exponential-Time Languages [Citation Graph (0, 0)][DBLP ] Conf ] Harry B. Hunt III , J. L. Rangel Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Michael Ian Shamos , Dan Hoey Closest-Point Problems [Citation Graph (2, 0)][DBLP ] Conf ] Daniel J. Kleitman , Michael M. Krieger An Optimal Bound for Two Dimensional Bin Packing [Citation Graph (0, 0)][DBLP ] Conf ] Leonard M. Adleman , Kenneth L. Manders Computational Complexity of Decision Procedures for Polynomials (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] M. R. Garey , David S. Johnson , H. C. So An Application of Graph Coloring to Printed Circuit Testing (Working Paper) [Citation Graph (0, 0)][DBLP ] Conf ] Shimon Even , Alon Itai , Adi Shamir On the Complexity of Timetable and Multi-Commodity Flow Problems [Citation Graph (0, 0)][DBLP ] Conf ] 