Conferences in DBLP
Valery N. Agafonov From Specification Languages to Specification Knowledge Bases: The PTO Approach. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:1-17 [Conf ] Bruno Courcelle Monadic Second-Order Logic and Context-Free Graph-Grammars. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:18-34 [Conf ] David Harel A Thesis for Bounded Concurrency. [Citation Graph (1, 0)][DBLP ] MFCS, 1989, pp:35-48 [Conf ] Juris Hartmanis , Desh Ranjan Space Bounded Computations: Review And New Separation Results. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:49-66 [Conf ] Ludmila Cherkasova , Vadim E. Kotov Concurrent Nondeterministic Processes: Adequacy of Structure and Behaviour. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:67-87 [Conf ] Kurt Mehlhorn , Stefan Näher LEDA: A Library of Efficient Data Types and Algorithms. [Citation Graph (2, 0)][DBLP ] MFCS, 1989, pp:88-106 [Conf ] Ernst-Rüdiger Olderog Correctness of Concurrent Processes. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:107-132 [Conf ] Boris A. Trakhtenbrot Understanding Nets. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:133-134 [Conf ] Hajnal Andréka , István Németi , Ildikó Sain On the Strength of Temporal Proofs. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:135-144 [Conf ] James H. Andrews Proof-Theoretic Characterisations of Logic Programs. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:145-154 [Conf ] Eric Badouel Algebraic Closed Theories. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:155-164 [Conf ] Frank S. de Boer , Joost N. Kok , Catuscia Palamidessi , Jan J. M. M. Rutten Control Flow versus Logic: A Denotational and a Declarative Model for Guarded Horn Clauses. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:165-176 [Conf ] Cristian Calude , Dragos Vaida Ehrenfeucht Test Set Theorem and Hilbert Basis Theorem: A Constructive Glimpse. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:177-184 [Conf ] Bogdan S. Chlebus , Krzysztof Diks , Wojciech Rytter , Tomasz Szymacha Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:185-195 [Conf ] Jürgen Dassow , Juraj Hromkovic , Juhani Karhumäki , Branislav Rovan , Anna Slobodová On the Power of Synchronization in Parallel Computations. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:196-206 [Conf ] Krzysztof Diks , Torben Hagerup , Wojciech Rytter Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:207-217 [Conf ] Charles Elkan Logical Characterizations of Nonmonotonic TMSs. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:218-224 [Conf ] Jordi Farrés-Casals Proving Correctness of Constructor Implementations. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:225-235 [Conf ] Rob J. van Glabbeek , Ursula Goltz Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:237-248 [Conf ] Mohamed G. Gouda , Rodney R. Howell , Louis E. Rosier System Simulation and the Sensitivity of Self-Stabilization. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:249-258 [Conf ] Lane A. Hemachandra , Albrecht Hoene , Dirk Siefkes Polynomial-Time Functions Generate SAT: On P-Splinters. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:259-269 [Conf ] Uschi Heuter Generalized Definite Tree Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:270-280 [Conf ] Robert Holte , Louis E. Rosier , Igor Tulchinsky , Donald A. Varvel Pinwheel Scheduling With Tow Distinct Numbers. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:281-290 [Conf ] Sebastian Iwanowski Testing Approximate Symmetry in the Plane is NP-hard. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:291-304 [Conf ] C. Jousselin , J.-P. Moskowitz Memory and Algebra. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:305-313 [Conf ] Bettina Just Integer Relations Among Algebraic Numbers. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:314-320 [Conf ] Joost N. Kok An Iterative Metric Fully Abstract Semantics for Nondeterministic Dataflow (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:321-330 [Conf ] Wojciech Kowalczyk Complexity of Decision Problems Under Incomplete Information. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:331-337 [Conf ] Vincenzo Manca , Antonino Salibra , Giuseppe Scollo On the Nature of TELLUS (a Typed Equational Logic Look over Uniform Specification). [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:338-349 [Conf ] Christoph Meinel Switching Graphs and Their Complexity. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:350-359 [Conf ] John-Jules Ch. Meyer , Erik P. de Vink Pomset Semantics for True Concurrency with Synchronization and Recursion (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:360-369 [Conf ] David A. Mix Barrington , Pierre McKenzie Oracle Branching Programs and Logspace versus P. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:370-379 [Conf ] David T. H. Ng , B. John Oommen Generalizing Singly-Linked List Reorganizing Heuristics for Doubly-Linked Lists. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:380-389 [Conf ] Vladimir Palko , Ondrej Sýkora , Imrich Vrto Area Complexity of Merging. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:390-396 [Conf ] Pierre Péladeau Logically Defined Subsets of Nk . [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:397-407 [Conf ] Uwe Petermann An Extended Herbrand Theorem for First-Order Theories with Equality Interpreted in Partial Algebras. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:408-417 [Conf ] Antoine Petit Characterization of Recognizable Trace Languages by Distributed Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:418-430 [Conf ] Mireille Régnier Knuth-Morris-Pratt Algorithm: An Analysis. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:431-444 [Conf ] Ahmed Saoudi Pushdown Automata on Infinite Trees and Omega-Kleene closure of Context-Free Tree Sets. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:445-457 [Conf ] Erik Meineche Schmidt , Michael I. Schwartzbach An Imperative Type Hierarchy with Partial Products. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:458-470 [Conf ] Maciej Slusarek A Coloring Algorithm for Interval Graphs. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:471-480 [Conf ] Bernhard Steffen , Jens Knoop Finite Constants: Characterizations of a New Decidable Set of Constants. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:481-491 [Conf ] Bernhard Steffen Optimal Data Flow Analysis via Observational Equivalence. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:492-502 [Conf ] Vladimir Stetsenko One More Method For Proving Lower Bounds on the Formula Complexity of Boolean Functions. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:503-510 [Conf ] Danuta Szczepanska The Hoare-Like Verification System for a Language with an Exception Handling Mechanism. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:511-522 [Conf ] Andreas Weber On the Length of Values in a Finite Transducer. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:523-533 [Conf ] Pascal Weil On Varieties of Languages Closed Under Products with Counter. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:534-544 [Conf ] Juraj Wiedermann On the Computational Efficiency of Symmetric Neural Networks. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:545-552 [Conf ] Serge Yoccoz Constructive Aspects of the Omega-Rule: Application to Proof Systems in Computer Science and Algorithmic Logic. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:553-565 [Conf ] Marek Zaionc How to Define Functionals of Free Structures in Typed Lambda Calculus. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:566-576 [Conf ] Antoni W. Mazurkiewicz Concurrency, Modularity, and Synchronization. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:577-598 [Conf ] Farid M. Ablayev On Comparing Probabilistic and Deterministic Automata Complexity of Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:599-605 [Conf ]