Conferences in DBLP
Alok Aggarwal , Ashok K. Chandra Communication Complexity of PRAMs (Preliminary Version). [Citation Graph (1, 0)][DBLP ] Conf ] Luc Albert , François Fages Average Case Complexity Analysis of the Rete Multi-Pattern Match Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Arnborg , Jens Lagergren , Detlef Seese Problems Easy for Tree-Decomposable Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ralph-Johan Back , Reino Kurki-Suonio Serializability in Distributed Systems with Handshaking. [Citation Graph (0, 0)][DBLP ] Conf ] Chandrajit L. Bajaj , Myung-Soo Kim Algorithms for Planar Geometric Models. [Citation Graph (0, 0)][DBLP ] Conf ] Gyora M. Benedek , Alon Itai Nonuniform Learnability. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Berstel , Christophe Reutenauer Zeta Functions of Recognizable Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender Dynamic Programming on Graphs with Bounded Treewidth. [Citation Graph (0, 0)][DBLP ] Conf ] Jik H. Chang , Oscar H. Ibarra , Michael A. Palis Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Jeffrey S. Salowe , William L. Steiger , Endre Szemerédi Optimal Slope Selection. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Cori , Yves Métivier Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System. [Citation Graph (0, 0)][DBLP ] Conf ] Karel Culik II New Techniques for Proving the Decidability of Equivalence Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Diekert Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Dietzfelbinger , Wolfgang Maass The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Edelsbrunner Geometric Structures in Computational Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Herbert Edelsbrunner , Leonidas J. Guibas , János Pach , Richard Pollack , Raimund Seidel , Micha Sharir Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Reset Sequences for Finite Automata with Application to Design of Parts Orienters. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet , Danièle Gardy , Loÿs Thimonier Random Allocations and Probabilistic Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Jozef Gruska Systolic Architectures, Systems and Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Juris Hartmanis New Developments in Structural Complexity Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Claude Kirchner , Hélène Kirchner , José Meseguer Operational Semantics of OBJ-3 (Extended Abstract). [Citation Graph (1, 0)][DBLP ] Conf ] Peter Kirschenhofer , Helmut Prodinger , Wojciech Szpankowski Do We Really Need to Balance Patricia Trees? (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Joost N. Kok , Jan J. M. M. Rutten Contractions in Comparing Concurrent Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Clyde P. Kruskal , Larry Rudolph , Marc Snir A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ludek Kucera , Alberto Marchetti-Spaccamela , Marco Protasi On the Learnability of DNF Formulae. [Citation Graph (0, 0)][DBLP ] Conf ] Clemens Lautemann Efficient Algorithms on Context-Free Graph Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Lengauer , Egon Wanke Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract). [Citation Graph (1, 0)][DBLP ] Conf ] Andrzej Lingas , Maciej M. Syslo A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn , Chee-Keng Yap Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. [Citation Graph (0, 0)][DBLP ] Conf ] Valtteri Niemi Maximal Dense Intervals of Grammar Forms. [Citation Graph (0, 0)][DBLP ] Conf ] Prakash Panangaden , Eugene W. Stark Computations, Residuals, and the POwer of Indeterminancy. [Citation Graph (0, 0)][DBLP ] Conf ] Sanguthevar Rajasekaran , John H. Reif Nested Annealing: A Provable Improvement to Simulated Annealing. [Citation Graph (0, 0)][DBLP ] Conf ] R. Ramesh , I. V. Ramakrishnan Nonlinear Pattern Matching in Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Ren-ji Tao Invertibility of Linear Finite Automata Over a Ring. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Rohnert Moving Discs Between Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Steven Rudich , Leonard Berman Optimal Circuits and Transitive Automorphism Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Schäfer A Kleene-Presburgerian Approach to Linear Production Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Simon On Minimum Flow and Transitive Reduction. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Claude Spehner La Reconnaissance des Facteurs d'un Language Fini dans un Texte en Temps Lineaire (Resume). [Citation Graph (0, 0)][DBLP ] Conf ] Howard Straubing , Denis Thérien , Wolfgang Thomas regular Languages Defined with Generalized Quantifiers. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Tamassia A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Shouwen Tang , Ronald V. Book Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Gerard Tel Assertional Verification of a Timer Based Protocol. [Citation Graph (0, 0)][DBLP ] Conf ] Satish Thatte Type Inference with Partial Types. [Citation Graph (0, 0)][DBLP ] Conf ] P. S. Thiagarajan Some Behavioural Aspects of Net Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Paavo Turakainen The Equivalence of DGSM Replications on Q-Rational Languages is Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Vijay V. Vazirani , Mihalis Yannakakis Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus W. Wagner On Restricting the Access to an NP-Oracle. [Citation Graph (0, 0)][DBLP ] Conf ] Osamu Watanabe On <=^P_{1-tt}-Sparseness and Nondeterministic Complexity Classes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] W. P. Weijland Semantics for Logic Programs without Occur Check. [Citation Graph (0, 0)][DBLP ] Conf ] Jia-Huai You Outer Narrowing for Equational Theories Based on Constructors. [Citation Graph (0, 0)][DBLP ] Conf ] 