Conferences in DBLP
Farid M. Ablayev , Rusins Freivalds Why Sometimes Probabilistic Algorithms Can Be More Effective. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Berstel , Jacques Sakarovitch Recent Results in the Theory of Rational Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Broy Partial Interpretations of Higher Order Algebraic Types (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Michal Chytil Kins of Context-Free Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Hartmut Ehrig , Werner Fey , Francesco Parisi-Presicce , Edward K. Blum Algebraic Theory of Module Specification with Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Peter van Emde Boas A Semantical Model for Integration and Modularization of Rules. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim von zur Gathen Parallel Arithmetic Computations: A Survey. [Citation Graph (0, 0)][DBLP ] Conf ] Ken Hirose An Approach to Proof Checker. [Citation Graph (0, 0)][DBLP ] Conf ] John E. Hopcroft The Promise of Electronic Prototyping. [Citation Graph (0, 0)][DBLP ] Conf ] Oscar H. Ibarra Systolic Arrays: Characterizations and Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] D. T. Lee Geometric Location Problems and Their Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] J. Ian Munro Developing Implicit Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy Tiuryn Higher-Order Arrays and Stacks in Programming. An Application of Complexity Theory to Logics of Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Alt , Torben Hagerup , Kurt Mehlhorn , Franco P. Preparata Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. [Citation Graph (0, 0)][DBLP ] Conf ] Egidio Astesiano , Gianna Reggio , Martin Wirsing Relational Specifications and Observational Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Becker Efficient Testing of Optimal Time Adders (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Siegfried Bublitz , Ute Schürfeld , Bernd Voigt , Ingo Wegener Properties of Complexity Measures for PRAMs and WRAMs. [Citation Graph (0, 0)][DBLP ] Conf ] Virgil Emil Cazanescu Iterative Systems of Equations. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander L. Chistov Polynomial Complexity of the Newton-Puiseux Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , Wojciech Rytter Unique Deciperability for Partially Commutative Alphabet (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Karel Culik II , Juhani Karhumäki The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable. [Citation Graph (0, 0)][DBLP ] Conf ] Krzysztof Diks A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Branislav Durian Quicksort Without a Stack. [Citation Graph (0, 0)][DBLP ] Conf ] S. Dvorák , Branislav Durian Towards an Efficient Merging. [Citation Graph (0, 0)][DBLP ] Conf ] Zoltán Ésik , Pál Dömösi , Ferenc Gécseg , J. Virágh Homomorphic Realizations of Automata with Compositions. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas M. Fischer Refined Bounds on the Complexity of Sorting and Selection in D-Dimensional Space. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas M. Fischer , K. Wolfrum On the Inherent Combinatorial Complexity of Geometric Problems in D-Dimensional Space. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Fleischhack P-Genericity and Strong G-Genericity. [Citation Graph (0, 0)][DBLP ] Conf ] Christiane Frougny Fibonacci Numeration Systems and Rational Functions. [Citation Graph (0, 0)][DBLP ] Conf ] B. Gammatie Safe Implementation Equivalence for Asynchronous Nondeterministic Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Viliam Geffert Grammars with Context Dependency Restricted to Synchronization. [Citation Graph (0, 0)][DBLP ] Conf ] A. Goralciková , Václav Koubek Some Improved Parallelisms for Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Graf A Complete Inference System for an Algebra or Regular Acceptance Models. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Gundermann , Gerd Wechsung Nondeterministic Turing Machines with Modified Acceptance. [Citation Graph (0, 0)][DBLP ] Conf ] Armin Hemmerling Remark on the Power of Compass (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Hinz Regular Chain Code Picture Languages of Nonlinear Descriptional Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Rodney R. Howell , Louis E. Rosier An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic A New Approach to Defining the Complexity for VLSI. [Citation Graph (0, 0)][DBLP ] Conf ] Stasys Jukna Lower Bounds on the Complexity of Local Circuits (Preliminary Report). [Citation Graph (0, 0)][DBLP ] Conf ] Lubor Kollár Optimal Sorting of Seven Element Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan Korec Undecidable Problems Concerning Generalized Pascal Triangles of Commutative Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Václav Koubek , Antonín Ríha Regular Augmentation of Automata and Transducers (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ivan Kramosil On Some Types of Pseudo-Random Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Kriegel The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus. [Citation Graph (0, 0)][DBLP ] Conf ] Antonín Kucera An Alternative, Priority-Free, Solution to Post's Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Ludek Kucera , Alberto Marchetti-Spaccamela , Marco Protasi , Maurizio Talamo Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Werner Kuich Matrix Systems and Principal Cones of Algebraic Power Series. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus-Jörn Lange Two Characterizations of the Logarithmic Alternation Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Meinel p-Projection Reducibility and the Complexity Classes L(nonuniform) and NL(nonuniform). [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Méry A Proof System to Derive Evantually Properties Under Justice Hypothesis. [Citation Graph (0, 0)][DBLP ] Conf ] M. A. Nait Abdallah AL-Khowarizmi: A Formal System for Higher-Order Logic Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Fabienne Romanian , Jacques Sakarovitch One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Brigitte Rozoy Model and Complexity of Termination for Distributed Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Vladislav Rutenburg Complexity of Generalized Graph Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Paul G. Spirakis The Parallel Complexity of Deadlock Detection. [Citation Graph (0, 0)][DBLP ] Conf ] Ludwig Staiger , Werner Nehrlich The Centers of Context-Sensitive Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Jorma Tarhio , Esko Ukkonen A Greedy Algorithm for Constructing Shortest Common Substrings. [Citation Graph (0, 0)][DBLP ] Conf ] Heiko Vogler The OI-Hierarchy is Closed under Control. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Weber , Helmut Seidl On the Degree of Ambiguity of Finite Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Zbigniew W. Ras , Maria Zemankova Learning in Knowledge Based System, a Possibilistic Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Silvio Micali , Avi Wigderson Proofs that Release Minimum Knowledge. [Citation Graph (0, 0)][DBLP ] Conf ] 