Conferences in DBLP
Friedhelm Meyer auf der Heide On Genuinely Time Bounded Compuations. [Citation Graph (0, 0)][DBLP ] Conf ] Peter D. Mosses Unified Algebras and Action Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Berstel Properties of Infinite Words: Recent Result. [Citation Graph (0, 0)][DBLP ] Conf ] Francisca Lucio-Carrasco , Antonio Gavilanes-Franco A First Order Logic for Partial Functions (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Hennicker Observational Implementations. [Citation Graph (0, 0)][DBLP ] Conf ] Panagiotis Alevizos , Jean-Daniel Boissonnat , Franco P. Preparata On the Boundary of a Union of Rays. [Citation Graph (0, 0)][DBLP ] Conf ] Franco P. Preparata , Roberto Tamassia Dynamic Planar Point Location with Optimal Query Time. [Citation Graph (0, 0)][DBLP ] Conf ] Hristo Djidjev , Andrzej Lingas , Jörg-Rüdiger Sack An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Gutjahr , Emo Welzl , Gerhard J. Woeginger Polynomial Graph-Colorings. [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide , Rolf Wanka Time-Optimal Simulations of Networks by Universal Parallel Computers. [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Hinz Classes of Picture Languages that Cannot be Distinguished in the Chain Code Concept and Deletion of Redundant Retreats. [Citation Graph (0, 0)][DBLP ] Conf ] Christiane Frougny Linear Numeration Systems, Theta-Developments and Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey Shallit A Generalization of Automatic Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Diekert Word Problems over TRaces Which are Solvable in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Otfried Schwarzkopf Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Donald S. Fussell , Ramakrishna Thurimella Successive Approximation in Parallel Graph Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Gerhard Buntrock , Albrecht Hoene Reversals and Alternation. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Lane A. Hemachandra On the Power of Parity Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] K. Ganesan , Steven Homer Complete Problems and Strong Polynomial Reducibilities. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Szepietowski If Deterministic and Nondeterministic Space Complexities are Equal for log log n then they are also Equal for log n . [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Georg Schnitger On the Complexity of Approximating the Independent Set Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Lavault Average Number of Messages for Distributed Leader Finding in Rings of Processors. [Citation Graph (0, 0)][DBLP ] Conf ] Mark H. Overmars , Nicola Santoro TIME vs BITS. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , Hans L. Bodlaender Distributed Computing on TRansitive Networks: The Thorus. [Citation Graph (0, 0)][DBLP ] Conf ] Nicola Santoro , Peter Widmayer Time is Not a Healer. [Citation Graph (0, 0)][DBLP ] Conf ] Rüdiger Reischuk , Bernd Schmeltz Area Efficient Methods to Increase the Reliability of Combinatorial Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Doenhardt Fault Masking Probabilities with Single and Multiple Signature Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Miki Hermann Chain Properties of Rule Closures. [Citation Graph (0, 0)][DBLP ] Conf ] Paliath Narendran , Jonathan Stillman It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair. [Citation Graph (0, 0)][DBLP ] Conf ] Friederike Nickl Algebraic Specifications for Domain THeory. [Citation Graph (0, 0)][DBLP ] Conf ] Aïda Batarekh , V. S. Subrahmanian The Query Topology in Logic Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Beaudry , Pierre McKenzie , Denis Thérien Testing Membership: Beyond Permutation Groups (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ernst W. Mayr Membership in Plynomial Ideals over Q Is Exponential Space Complete. [Citation Graph (0, 0)][DBLP ] Conf ] Rakesh M. Verma , I. V. Ramakrishnan Some Complexity Theoretic Aspects of AC Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Bengt Jonsson , Joachim Parrow Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Bernadette Charron-Bost Measure of Parallelism of Distributed Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Jancar Decidability of Waek Fairness in Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Eric Pin , Howard Straubing , Denis Thérien New Results on the Generalized Star-Height Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Karel Culik II , Juhani Karhumäki On the Equivalence Problem for Deterministic Multitape Automata and Transducers. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Seidl Deciding Equivalence of Finite Tree Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Marc J. van Kreveld , Mark H. Overmars Concatenable Segment Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Schwill Shorest Edge-Disjoint Paths in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Bala Kalyanasundaram , Georg Schnitger Rounds versus Time for the Two Person Pebble Game (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Maria Morandi Cecchi , F. Nachria , O. Viele AXE: The Syntax Driven Diagram Editor for Visual Languages used in the Software Engineering Environments AxIS. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Himsolt Graph^Ed: An Interactive Garpg Editor. [Citation Graph (0, 0)][DBLP ] Conf ] M. Jäger SAMPLE: A Language Dependent Prototyping Environment. [Citation Graph (0, 0)][DBLP ] Conf ] Tomasz Janowski Examining the Satisfiability of Formulas of Propositional Dynamic Logic. [Citation Graph (0, 0)][DBLP ] Conf ] V. Kell , Albert Maier , Andreas Potthoff , Wolfgang Thomas , U. Wermuth AMORE: A System for Computing Automata, MOnoidsm and Regular Expressions. [Citation Graph (0, 0)][DBLP ] Conf ] Olov Schelén , N. O. Forsgren A Proof System for Type Theory and CCS. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Wolff Implementation of a Transition Sematics for Parallel Programs with Shared Variables. [Citation Graph (0, 0)][DBLP ] Conf ] 