Conferences in DBLP
Ashok K. Chandra Degrees of Translatability and Canonical Forms in Program Schemas: Part I [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Courcelle , Jean Vuillemin Semantics and Axiomatics of a Simple Recursive Language [Citation Graph (0, 0)][DBLP ] Conf ] Leslie G. Valiant The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Cook , Ravi Sethi Storage Requirements for Deterministic Polynomial Time Recognizable Languages [Citation Graph (0, 0)][DBLP ] Conf ] Neil D. Jones , William T. Laaser Complete Problems for Deterministic Polynomial Time [Citation Graph (0, 0)][DBLP ] Conf ] M. R. Garey , David S. Johnson , Larry J. Stockmeyer Some Simplified NP-Complete Problems [Citation Graph (0, 0)][DBLP ] Conf ] Harry B. Hunt III , Daniel J. Rosenkrantz Computational Parallels between the Regular and Context-Free Languages [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Ehrenfeucht , H. Paul Zeiger Complexity Measures for Regular Expressions [Citation Graph (0, 0)][DBLP ] Conf ] Vaughan R. Pratt The Power of Negative Thinking in Multiplying Boolean Matrices [Citation Graph (0, 0)][DBLP ] Conf ] David G. Kirkpatrick Determining Graph Properties from Matrix Representations [Citation Graph (0, 0)][DBLP ] Conf ] John T. Gill III Computational Complexity of Probabilistic Turing Machines [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn Polynomial and Abstract Subrecursive Classes [Citation Graph (0, 0)][DBLP ] Conf ] Richard E. Ladner , Nancy A. Lynch , Alan L. Selman Comparisons of Polynomial-Time Reducibilities [Citation Graph (0, 0)][DBLP ] Conf ] Vaughan R. Pratt , Michael O. Rabin , Larry J. Stockmeyer A Characterization of the Power of Vector Machines [Citation Graph (1, 0)][DBLP ] Conf ] Stephen A. Cook , Robert A. Reckhow On the Lengths of Proofs in the Propositional Calculus (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Charles Rackoff On the Complexity of the Theories of Weak Direct Products: A Preliminary Report [Citation Graph (0, 0)][DBLP ] Conf ] Edward L. Robertson Structure of Complexity in the Weak Monadic Second-Order Theories of the Natural Numbers [Citation Graph (0, 0)][DBLP ] Conf ] John E. Hopcroft , J. K. Wong Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report) [Citation Graph (2, 0)][DBLP ] Conf ] Robert Endre Tarjan Testing Graph Connectivity [Citation Graph (0, 0)][DBLP ] Conf ] Edward C. Horvath Efficient Stable Sorting with Minimal Extra Space [Citation Graph (0, 0)][DBLP ] Conf ] Laurent Hyafil , F. Prusker , Jean Vuillemin An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Lipton Limitations of Synchronization Primitives with Conditional Branching and Global Variables [Citation Graph (0, 0)][DBLP ] Conf ] Jonathan K. Millen Construction with Parallel Derivatives of the Closure of a Parallel Program Schema [Citation Graph (0, 0)][DBLP ] Conf ] K. Vairavan , Richard A. DeMillo Parallel Scheduling of Programs in a Restricted Model of Computation [Citation Graph (0, 0)][DBLP ] Conf ] Sheila A. Greibach Some Restrictions on W-Grammars [Citation Graph (0, 0)][DBLP ] Conf ] Michael Hammer A New Grammatical Transformation into LL(k) Form (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Joel I. Seiferas Observations on Nondeterministic Multidimensional Iterative Arrays [Citation Graph (0, 0)][DBLP ] Conf ] Ronald V. Book , Maurice Nivat , Mike Paterson Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Arnold L. Rosenberg Managing Storage for Extendible Arrays [Citation Graph (0, 0)][DBLP ] Conf ] Jan van Leeuwen A Partial Solution to the Reachability-Problem for Vector-Addition Systems [Citation Graph (0, 0)][DBLP ] Conf ] David P. Dobkin , Richard J. Lipton On Some Generalizations of Binary Search [Citation Graph (0, 0)][DBLP ] Conf ] Webb Miller Computational Complexity and Numerical Stability [Citation Graph (0, 0)][DBLP ] Conf ] H. T. Kung New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions [Citation Graph (0, 0)][DBLP ] Conf ] Zvi M. Kedem Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications [Citation Graph (0, 0)][DBLP ] Conf ] Allan Borodin , Stephen A. Cook On the Number of Additions to Compute Specific Polynomials (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] 