Conferences in DBLP
Karel Culik II , Tero Harju The omega-Sequence Equivalence Problem for DOL Systems Is Decidable [Citation Graph (0, 0)][DBLP ] Conf ] Paul Chew Unique Normal Forms in Term Rewriting Systems with Repeated Variables [Citation Graph (0, 0)][DBLP ] Conf ] Frank M. Hawrusik , K. N. Venkataraman , Ann Yasuhara Classes of Functions for Computing on Binary Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Balakrishnan Krishnamurthy , Robert N. Moll Examples of Hard Tautologies in the Propositional Calculus [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Leivant The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories) [Citation Graph (0, 0)][DBLP ] Conf ] David E. Muller , Paul E. Schupp Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems [Citation Graph (0, 0)][DBLP ] Conf ] Deborah Joseph , Paul Young Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] S. Rao Kosaraju Localized Search in Sorted Lists [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle Convex Decompositions of Polyhedra [Citation Graph (0, 0)][DBLP ] Conf ] Chul E. Kim , Azriel Rosenfeld Digital Straightness and Convexity (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Gaston H. Gonnet , J. Ian Munro A Linear Probing Sort and its Analysis (Preliminary Draft) [Citation Graph (0, 0)][DBLP ] Conf ] Faith E. Fich Lower Bounds for the Cycle Detection Problem [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil , Joel I. Seiferas Time-Space-Optimal String Matching [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Dominic Sleator , Robert Endre Tarjan A Data Structure for Dynamic Trees [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao On the Parallel Computation for the Knapsack Problem [Citation Graph (0, 0)][DBLP ] Conf ] Eshrat Arjomandi , Michael J. Fischer , Nancy A. Lynch A Difference in Efficiency between Synchronous and Asynchronous Systems [Citation Graph (0, 0)][DBLP ] Conf ] John H. Reif , Paul G. Spirakis Distributed Algorithms for Synchronizing Interprocess Communication within Real Time [Citation Graph (0, 0)][DBLP ] Conf ] Tat-hung Chan Reversal Complexity of Counter Machines [Citation Graph (0, 0)][DBLP ] Conf ] Janos Simon Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Bertoni , Giancarlo Mauri , Nicoletta Sabadini A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines [Citation Graph (0, 0)][DBLP ] Conf ] Pavol Duris , Zvi Galil Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] K. N. King Measures of Parallelism in Alternating Computation Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Esko Ukkonen , Eljas Soisalon-Soininen LALR(k) Testing is PSPACE-Complete [Citation Graph (0, 0)][DBLP ] Conf ] Burkhard Monien , Ivan Hal Sudborough Bandwidth Constrained NP-Complete Problems [Citation Graph (0, 0)][DBLP ] Conf ] James B. Orlin The Complexity of Dynamic Languages and Dynamic Optimization Problems [Citation Graph (0, 0)][DBLP ] Conf ] Akeo Adachi , Shigeki Iwata , Takumi Kasai Low Level Complexity for Combinatorial Games [Citation Graph (0, 0)][DBLP ] Conf ] Ernst W. Mayr An Algorithm for the General Petri Net Reachability Problem [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil , Wolfgang J. Paul An Efficient General Purpose Parallel Computer [Citation Graph (0, 0)][DBLP ] Conf ] Leslie G. Valiant , Gordon J. Brebner Universal Schemes for Parallel Communication [Citation Graph (0, 0)][DBLP ] Conf ] Daniel J. Kleitman , Frank Thomson Leighton , Margaret Lepley , Gary L. Miller New Layouts for the Shuffle-Exchange Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Mike Paterson , Walter L. Ruzzo , Lawrence Snyder Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Lipton , Robert Sedgewick Lower Bounds for VLSI [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao The Entropic Limitations on VLSI Computations (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Danny Dolev , Kevin Karplus , Alan Siegel , Alex Strong , Jeffrey D. Ullman Optimal Wiring between Rectangles [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Louis Monier A Model of Computation for VLSI with Related Complexity Results [Citation Graph (0, 0)][DBLP ] Conf ] Jia-Wei Hong , H. T. Kung I/O Complexity: The Red-Blue Pebble Game [Citation Graph (4, 0)][DBLP ] Conf ] Jia-Wei Hong , Arnold L. Rosenberg Graphs that Are Almost Binary Trees (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Ashok K. Chandra , Harry R. Lewis , Johann A. Makowsky Embedded Implicational Dependencies and their Inference Problem [Citation Graph (13, 0)][DBLP ] Conf ] Catriel Beeri , Ronald Fagin , David Maier , Alberto O. Mendelzon , Jeffrey D. Ullman , Mihalis Yannakakis Properties of Acyclic Database Schemes [Citation Graph (32, 0)][DBLP ] Conf ] Mihalis Yannakakis Issues of Correctness in Database Concurrency Control by Locking [Citation Graph (6, 0)][DBLP ] Conf ] Francesco Parisi-Presicce On the Faithful Regular Extensions of Iterative Algebras [Citation Graph (0, 0)][DBLP ] Conf ] Robert S. Streett Propositional Dynamic Logic of Looping and Converse [Citation Graph (0, 0)][DBLP ] Conf ] Ashok K. Chandra , Joseph Y. Halpern , Albert R. Meyer , Rohit Parikh Equations between Regular Terms and an Application to Process Logic [Citation Graph (0, 0)][DBLP ] Conf ] 