Conferences in DBLP
Jack W. Carlyle , Sheila A. Greibach , Azaria Paz A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report) [Citation Graph (0, 0)][DBLP ] Conf ] Juris Hartmanis , Janos Simon On the Power of Multiplication in Random Access Machines [Citation Graph (0, 0)][DBLP ] Conf ] José Lucas Rangel The Equivalence Problem for Regular Expressions over one Letter Is Elementary [Citation Graph (0, 0)][DBLP ] Conf ] Sartaj Sahni , Teofilo F. Gonzalez P-Complete Problems and Approximate Solutions [Citation Graph (0, 0)][DBLP ] Conf ] Daniel J. Rosenkrantz , Richard Edwin Stearns , Philip M. Lewis II Approximate Algorithms for the Traveling Salesperson Problem [Citation Graph (0, 0)][DBLP ] Conf ] Emily P. Friedman Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Courcelle Recursive Schemes, Algebraic Trees and Deterministic Languages [Citation Graph (0, 0)][DBLP ] Conf ] Joseph A. Goguen , James W. Thatcher Initial Algebra Semantics [Citation Graph (0, 0)][DBLP ] Conf ] Christoph M. Hoffmann , Lawrence H. Landweber Axiomatic Equivalence of Programs with Structured Variables [Citation Graph (0, 0)][DBLP ] Conf ] Nobuki Tokura , Tadao Kasami , Shukichi Furuta Ianov Schemas Augmented by a Pushdown Memory [Citation Graph (0, 0)][DBLP ] Conf ] Ronald L. Rivest On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Alfred V. Aho , Daniel S. Hirschberg , Jeffrey D. Ullman Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Bounds on Selection Networks [Citation Graph (0, 0)][DBLP ] Conf ] H. T. Kung On the Computational Complexity of Finding the Maxima of a Set of Vectors [Citation Graph (0, 0)][DBLP ] Conf ] Ronald L. Rivest On Self-Organizing Sequential Search Heuristics [Citation Graph (0, 0)][DBLP ] Conf ] Harry B. Hunt III , Thomas G. Szymanski , Jeffrey D. Ullman Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] John P. Hayes Minimization of Fanout in Switching Networks [Citation Graph (0, 0)][DBLP ] Conf ] Edmund A. Lamagna , John E. Savage Combinational Complexity of Some Monotone Functions [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Lipton , Lawrence Snyder , Yechezkel Zalcstein A Comparative Study of Models of Parallel Computation [Citation Graph (0, 0)][DBLP ] Conf ] Michel Hack The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems [Citation Graph (0, 0)][DBLP ] Conf ] Robert P. Daley Non-Complex Sequences: Characterizations and Examples [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil Two Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of Computation [Citation Graph (0, 0)][DBLP ] Conf ] Theodore P. Baker ``Natural'' Properties of Flowchart Complexity Measures [Citation Graph (0, 0)][DBLP ] Conf ] Alan J. Demers Skeletal LR Parsing [Citation Graph (0, 0)][DBLP ] Conf ] Armin B. Cremers , Seymour Ginsburg Characterization of Context-Free Grammatical Families [Citation Graph (0, 0)][DBLP ] Conf ] Pawel Kerntopf On Boolean Functions Having Maximal Number of Subfunction Classes [Citation Graph (0, 0)][DBLP ] Conf ] 