Conferences in DBLP
Ronald V. Book Sparse Sets, Tally Sets, and Polynomial Reducibilities. [Citation Graph (0, 0)][DBLP ] Conf ] Corrado Böhm Functional Programming and Combinatory Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Ludmila Cherkasova On Models and Algebras for Concurrent Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Maxime Crochemore String Matching with Constraints. [Citation Graph (1, 0)][DBLP ] Conf ] Lane A. Hemachandra Structure of Complexity Classes: Separations, Collapses, and Completeness. [Citation Graph (0, 0)][DBLP ] Conf ] Efim B. Kinber Inductive Syntactical Synthesis of Programs from Sample Computations. [Citation Graph (0, 0)][DBLP ] Conf ] John H. Reif , James A. Storer 3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles. [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Schöning Robust Orale Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Imre Simon Recognizable Sets with Multiplicities in the Tropical Semiring. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Wirsing , Rolf Hennicker , Ruth Breu Reusable Specification Components. [Citation Graph (0, 0)][DBLP ] Conf ] Burkhard Monien , Ivan Hal Sudborough Comparing Interconnection Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Farid M. Ablayev Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability. [Citation Graph (0, 0)][DBLP ] Conf ] E. Allevi , Alessandra Cherubini , Stefano Crespi-Reghizzi Breadth-First Phrase Structure Grammars and Queue Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Bauernöppel , Hermann Jung Implementing Abstract Data Structures in Hardware. [Citation Graph (0, 0)][DBLP ] Conf ] Joffroy Beauquier , Antoine Petit Distribution of Sequential Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Francis Bossut , Max Dauchet , Bruno Warin Automata and Rational Expressions on Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Bruyère On Maximal Prefix Sets of Words. [Citation Graph (0, 0)][DBLP ] Conf ] Heino Carstensen Infinite Behaviour if Deterministic Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Krzysztof Diks , Tomasz Radzik Testing Isomorphism of Outerplanar Graphs in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Krzysztof Diks , Torben Hagerup , Tomasz Radzik Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. [Citation Graph (0, 0)][DBLP ] Conf ] Ryszard Danecki Multiple Propositional Dynamic Logic of Parallel Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Alessandro D'Atri , Marina Moscarini , Antonio Sassano The Steiner Tree Problem and Homogeneous Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Max Dauchet Termination of Rewriting is Undecidable in the One-Rule Case. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Diekert , Walter Vogler Local Checking of Trace Synchroniziability. [Citation Graph (0, 0)][DBLP ] Conf ] Krzysztof Diks , Hristo Djidjev , Ondrej Sýkora , Imrich Vrto Edge Separators for Planar Graphs and Their Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Frumkin A Fast Parallel Algorithm for Eigenvalue Problem of Jacobi Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Ricard Gavaldà , José L. Balcázar Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Viliam Geffert Context-Free-Like Forms for the Phrase-Structure Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Goerdt On the Expressive Strength of the Finitely Typed Lambda-Terms. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Goerdt Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook. [Citation Graph (0, 0)][DBLP ] Conf ] Ursula Goltz On Representing CCS Programs by Finite Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Rodney R. Howell , Louis E. Rosier , Hsu-Chun Yen A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Juraj Procházka Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Stasys Jukna Two Lower Bounds for Circuits over the Basis (&, V, -). [Citation Graph (0, 0)][DBLP ] Conf ] Stéphane Kaplan Positive/Negative Conditional Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Kratochvíl , Mirko Krivánek On the Computational Complexity of Codes in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Krause , Christoph Meinel , Stephan Waack Separating the Eraser Turing Machine Classes Le , NLe , co-NLe and Pe . [Citation Graph (0, 0)][DBLP ] Conf ] Kim Guldstrand Larsen , Bent Thomsen Compositional Proofs by Partial Specification of Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Laurent , Nicolas Spyratos Introducing Negative Information in Relational Databases. [Citation Graph (2, 0)][DBLP ] Conf ] Philippe le Chenadec On Positive Occur-Checks in Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Krzysztof Lorys , Maciej Liskiewicz Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs. [Citation Graph (0, 0)][DBLP ] Conf ] Satoru Miyano Delta2 p -Complete Lexicographically First Maximal Subgraph Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ewa Orlowska Proof System for Weakest Prespecification and its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Piotrów On Complexity of Counting. [Citation Graph (0, 0)][DBLP ] Conf ] Qi Lu , Jiahua Qian Design, Proof and Analysis of New Efficient Algorithms for Incremental Attribute Evaluation. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Ruzicka On Efficiency of Interval Routing Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Ruzicka , Igor Prívara An Almost Linear Robinson Unification ALgorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Savický Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Anna Slobodová On the Power of Communication in Alternating Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Ewald Speckenmeyer Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability. [Citation Graph (0, 0)][DBLP ] Conf ] Stefano Varricchio Bisections of Free Monoids and a New Unavoidable Regularity. [Citation Graph (0, 0)][DBLP ] Conf ] Walter Vogler Failures Semantics and Deadlocking of Modular Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Weber A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence Problem. [Citation Graph (0, 0)][DBLP ] Conf ] 