Conferences in DBLP
Richard J. Lipton , David P. Dobkin Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms [Citation Graph (0, 0)][DBLP ] Conf ] Ronald L. Rivest , Jean Vuillemin A Generalization and Proof of the Aanderaa-Rosenberg Conjecture [Citation Graph (0, 0)][DBLP ] Conf ] Laurent Hyafil , H. T. Kung The Complexity of Parallel Evaluation of Linear Recurrence [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao On Computing the Minima of Quadratic Forms (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang J. Paul A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Fischer , Albert R. Meyer , Mike Paterson Lower Bounds on the Size of Boolean Formulas: Preliminary Report [Citation Graph (0, 0)][DBLP ] Conf ] Leslie G. Valiant On Non-linear Lower Bounds in Computational Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Harry B. Hunt III , Thomas G. Szymanski On the Complexity of Grammar and Related Problems [Citation Graph (0, 0)][DBLP ] Conf ] Shimon Even , Robert Endre Tarjan a Combinatorial Problem which is Complete in Polynomial Space [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil On the Validity and Complexity of Bounded Resolution [Citation Graph (0, 0)][DBLP ] Conf ] Stephen A. Cook Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Egli , Robert L. Constable Computability Concepts for Programming Language Semantics [Citation Graph (0, 0)][DBLP ] Conf ] Derek C. Oppen , Stephen A. Cook Proving Assertions about Programs that Manipulate Data Structures [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Ehrenfeucht , Grzegorz Rozenberg On (Un)predictability of Formal Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Sven Skyum On Decomposing Languages Defined by Parallel Devices [Citation Graph (0, 0)][DBLP ] Conf ] C. Raymond Perrault Intercalation Theorems for Tree Transducer Languages [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Ehrenfeucht , Grzegorz Rozenberg On the (Combinatorial) Structure of L Languages without Interactions [Citation Graph (0, 0)][DBLP ] Conf ] Detlef Wotschke Degree-Languages, Polynomial Time Recognition, and the LBA Problem [Citation Graph (0, 0)][DBLP ] Conf ] Seymour Ginsburg , Nancy A. Lynch Comparative Complexity of Grammar Forms [Citation Graph (0, 0)][DBLP ] Conf ] Arnold L. Rosenberg , Larry J. Stockmeyer Hashing Schemes for Extendible Arrays (Extended Arrays) [Citation Graph (0, 0)][DBLP ] Conf ] Terrence W. Pratt Four Models for the Analysis of Optimization of Program Control Structures [Citation Graph (0, 0)][DBLP ] Conf ] Alfred V. Aho , Jeffrey D. Ullman Node Listings for Reducible Flow Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Lipton , Stanley C. Eisenstat , Richard A. DeMillo The Complexity of Control Structures and Data Structures [Citation Graph (0, 0)][DBLP ] Conf ] Zohar Manna , Adi Shamir The Optimal Fixedpoint of Recursive Programs [Citation Graph (0, 0)][DBLP ] Conf ] Alfred V. Aho , Stephen C. Johnson Optimal Code Generation for Expression Trees [Citation Graph (0, 0)][DBLP ] Conf ] Robert A. Wagner On the Complexity of the Extended String-to-String Correction Problem [Citation Graph (1, 0)][DBLP ] Conf ] Michael Ian Shamos Geometric Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Gary L. Miller Riemann's Hypothesis and Tests for Primality [Citation Graph (0, 0)][DBLP ] Conf ] Michael L. Fredman Two Applications of a Probabilistic Search Technique: Sorting x + y and Building Balanced Search Trees [Citation Graph (0, 0)][DBLP ] Conf ] Donald J. Rose , Robert Endre Tarjan Algorithmic Aspects of Vertex Elimination [Citation Graph (0, 0)][DBLP ] Conf ] Kellogg S. Booth , George S. Lueker Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property [Citation Graph (1, 0)][DBLP ] Conf ] 