Conferences in DBLP
Richard M. Karp , Christos H. Papadimitriou On Linear Characterizations of Combinatorial Optimization Problems [Citation Graph (0, 0)][DBLP ] Conf ] Mihalis Yannakakis On a Class of Totally Unimodular Matrices [Citation Graph (0, 0)][DBLP ] Conf ] Silvio Micali , Vijay V. Vazirani An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs [Citation Graph (0, 0)][DBLP ] Conf ] T. C. Hu , M. T. Shing Some Theorems about Matrix Multiplication (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Merrick L. Furst , John E. Hopcroft , Eugene M. Luks Polynomial-Time Algorithms for Permutation Groups [Citation Graph (0, 0)][DBLP ] Conf ] Eugene M. Luks Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time [Citation Graph (0, 0)][DBLP ] Conf ] Barbara Simons A Fast Algorithm for Multiprocessor Scheduling [Citation Graph (0, 0)][DBLP ] Conf ] Stephen R. Mahaney Sparse Complete Sets for NP: Solution of a Conjecture of Berman and Hartmanis [Citation Graph (0, 0)][DBLP ] Conf ] Ivan Hal Sudborough Efficient Algorithms for Path System Problems and Applications to Alternating and Time-Space Complexity Classes [Citation Graph (0, 0)][DBLP ] Conf ] Neil Immerman Upper and Lower Bounds for First Order Expressibility [Citation Graph (0, 0)][DBLP ] Conf ] Eitan M. Gurari The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is Decidable [Citation Graph (0, 0)][DBLP ] Conf ] Gary L. Peterson Succinct Representation, Random Strings, and Complexity Classes [Citation Graph (0, 0)][DBLP ] Conf ] Gérard P. Huet , Jean-Marie Hullot Proofs by Induction in Equational Theories with Constructors [Citation Graph (0, 0)][DBLP ] Conf ] Paul Chew An Improved Algorithm for Computing With Equations [Citation Graph (0, 0)][DBLP ] Conf ] Robert L. Constable Programs and Types [Citation Graph (0, 0)][DBLP ] Conf ] David Harel , Dexter Kozen , Rohit Parikh Process Logic: Expressiveness, Decidability, Completeness [Citation Graph (0, 0)][DBLP ] Conf ] Nissim Francez , Daniel J. Lehmann , Amir Pnueli A Linear History Semantics for Distributed Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Harry B. Hunt III , Daniel J. Rosenkrantz The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Courcelle , Paul Franchi-Zannettacci On the Expressive Power of Attribute Grammars [Citation Graph (0, 0)][DBLP ] Conf ] A. J. Kfoury Loop Elimination and Loop Reduction-A Model-Theoretic Analysis of Programs (Partial Report) [Citation Graph (0, 0)][DBLP ] Conf ] Neil D. Jones , Steven S. Muchnick Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra [Citation Graph (0, 0)][DBLP ] Conf ] Michael L. Fredman The Inherent Complexity of Dynamic Data Structures which Accommodate Range Queries [Citation Graph (1, 0)][DBLP ] Conf ] David P. Dobkin , J. Ian Munro Efficient Uses of the Past [Citation Graph (2, 0)][DBLP ] Conf ] Philippe Flajolet , Andrew M. Odlyzko Exploring Binary Trees and Other Simple Trees [Citation Graph (0, 0)][DBLP ] Conf ] Jon Louis Bentley , Donna J. Brown A General Class of Resource Tradeoffs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Ernst-Erich Doberkat Some Observations on the Average Behavior of Heapsort (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey Scott Vitter Tuning the Coalesced Hashing Method to Obtain Optimum Performance (Detailed Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Samuel W. Bent , Daniel Dominic Sleator , Robert Endre Tarjan Biased 2-3 Trees [Citation Graph (0, 0)][DBLP ] Conf ] Greg N. Frederickson Implicit Data Structures with Fast Update (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Robert W. Floyd , Jeffrey D. Ullman The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Charles E. Leiserson Area-Efficient Graph Layouts (for VLSI) [Citation Graph (0, 0)][DBLP ] Conf ] Andrea S. LaPaugh A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Jean Vuillemin A Combinatorial Limit to the Computing Power of V.L.S.I. Circuits (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] F. Frances Yao On the Priority Approach to Hidden-Surface Algorithms (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Dov Harel A Linear Time Algorithm for the Lowest Common Ancestors Problem (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Mark N. Wegman Parsing for Structural Editors (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Mihalis Yannakakis , Christos H. Papadimitriou Algebraic Dependencies (Extended Abstract) [Citation Graph (11, 0)][DBLP ] Conf ] Ashok K. Chandra , David Harel Structure and Complexity of Relational Queries [Citation Graph (9, 0)][DBLP ] Conf ] Jia-Wei Hong On Similarity and Duality of Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Patrick W. Dymond , Stephen A. Cook Hardware Complexity and Parallel Computation (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Nissim Francez , Michael Rodeh A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme [Citation Graph (1, 0)][DBLP ] Conf ] Gilles Brassard A Time-Luck Tradeoff in Cryptography [Citation Graph (0, 0)][DBLP ] Conf ] Leonard M. Adleman On Distinguishing Prime Numbers from Composite Numbers (Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Michael O. Rabin N-Process Synchronization by 4 log _2 N-Valued Shared Variables [Citation Graph (0, 0)][DBLP ] Conf ] Burchard von Braunmühl , Rutger Verbeek A Recognition Algorithm for Deterministic CFLS optimal in Time and Space [Citation Graph (0, 0)][DBLP ] Conf ] 