Conferences in DBLP
J. W. de Bakker A Sound and Complete Proof System for Partial Program Correctness. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:1-12 [Conf ] J. M. Barzdin The Problem of Reachability and Verification of Programs. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:13-25 [Conf ] Andrzej Blikle Assertion Programming. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:26-42 [Conf ] Ronald V. Book Complexity Classes of Formal Languages (Preliminary Report). [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:43-56 [Conf ] Rusins Freivalds Fast Probabilistic Algorithms. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:57-69 [Conf ] Juris Hartmanis , Theodore P. Baker Relative Succinctness of Representations of Languages and Separation of Complexity Classes. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:70-88 [Conf ] Ivan M. Havel On Two Types of Loops. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:89-107 [Conf ] Matthew Hennessy , Gordon D. Plotkin Full Abstraction for a Simple Parallel Programming Language. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:108-120 [Conf ] Hermann A. Maurer On Some Recent Developments in Cryptography and Their Applications to Computer Science. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:121-130 [Conf ] Kurt Mehlhorn Searching, Sorting and Information Theory. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:131-145 [Conf ] Robin Milner LCF: A Way of Doing Proofs with a Machine. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:146-159 [Conf ] Vaughan R. Pratt Axioms or Algorithms. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:160-169 [Conf ] Arto Salomaa Power from Power Series. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:170-181 [Conf ] A. O. Slisenko Computational Complexity of String and Graph Identification. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:182-190 [Conf ] Derick Wood A Survey of Grammar and L Forms-1978. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:191-200 [Conf ] Akeo Adachi , Takumi Kasai , Etsuro Moriya A Theoretical Study of the Time Analysis of Programs. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:201-207 [Conf ] Hajnal Andréka , István Németi , Ildikó Sain Completeness Problems in Verification of Programs and Program Schemes. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:208-218 [Conf ] Jean-Michel Autebert Relationships between AFDL's and Cylinders. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:219-227 [Conf ] Gérard Comyn , G. Werner Computable Data Types. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:228-236 [Conf ] Guy Cousineau , Patrice Enjalbert Program Equivalence and Provability. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:237-245 [Conf ] Karel Culik II , Juhani Karhumäki Interactive L Systems with Almost Interactionless Behaviour. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:246-257 [Conf ] Robert P. Daley On the Simplification of Constructions in Degrees of Unsolvability via Computational Complexity. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:258-265 [Conf ] Werner Damm An Algebraic Extension of the Chomsky-Hierarchy. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:266-276 [Conf ] Michael I. Dekhtyar Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:277-283 [Conf ] Thomas M. Fischer On the Weighted Path Length of Binary Search Trees for Unknown Access Probabilities. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:284-291 [Conf ] George Gens , Eugene Levner Computational Complexity of Approximation Algorithms for Combinatorial Problems. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:292-300 [Conf ] A. Goralciková , Václav Koubek A Reduct-and-Closure Algorithm for Graphs. [Citation Graph (2, 0)][DBLP ] MFCS, 1979, pp:301-307 [Conf ] Ludmila Gregusová , Ivan Korec Small Universal Minsky Machines. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:308-316 [Conf ] Tsutomu Kamimura , Giora Slutzki Parallel and Two-Way Recognizers of Directed Acyclic Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:317-325 [Conf ] Akira Kanda Fully Effective Solutions of Recursive Domain Equations. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:326-336 [Conf ] Ivan Kramosil A Note on Computational Complexity of a Statistical Deducibility Testing Procedure. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:337-345 [Conf ] Manfred Kudlek Context Free Normal Systems. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:346-353 [Conf ] Matti Linna , Martti Penttonen New Proofs for Jump DPDA's. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:354-362 [Conf ] Aldo de Luca , Antonio Restivo Synchronization and Maximality for Very Pure Subsemigroups of a Free Semigroup. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:363-371 [Conf ] G. B. Marandzjan On the Sets of Minimal Indices of Partial Recursive Functions. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:372-374 [Conf ] Kurt Mehlhorn Some Remarks on Boolean Sums. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:375-380 [Conf ] Grazyna Mirkowska On the Propositional Algorithmic Logic. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:381-389 [Conf ] Anton Nijholt , Eljas Soisalon-Soininen Ch(k) Grammars: A Characterization of LL(k) Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:390-397 [Conf ] Thomas Ottmann , Derick Wood A Uniform Approach to Balanced Binary and Multiway Trees. [Citation Graph (1, 0)][DBLP ] MFCS, 1979, pp:398-407 [Conf ] Gheorghe Paun On the Generative Capacity of Some Classes of Grammars with Regulated Rewriting. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:408-414 [Conf ] Peter Ruzicka Validity Test for Floyd's Operator-Precedence Parsing Algorithms. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:415-424 [Conf ] Peter H. Starke On the Languages of Bounded Petri Nets. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:425-433 [Conf ] Miron Tegze Dyck Language D_{2} Is Not Absolutely Parallel. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:434-442 [Conf ] Jerzy Tiuryn Fixed Points in the Power-Set Algebra of Infinite Trees (Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:443-452 [Conf ] Boris A. Trakhtenbrot On Relaxation Rules in Algorithmic Logic. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:453-462 [Conf ] Vera Trnková L-Fuzzy Functorial Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:463-473 [Conf ] G. E. Tseytlin Schematics of Structural Parallel Programming and its Applications. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:474-481 [Conf ] Mars K. Valiev On Axiomatization of Deterministic Propositional Dynamic Logic. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:482-491 [Conf ] Klaus W. Wagner Bounded Recursion and Complexity Classes. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:492-498 [Conf ] Wolfgang Wechler Characterization of Rational and Algebraic Power Series. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:499-507 [Conf ] Gerd Wechsung A Crossing Measure for 2-Tape Turing Machines. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:508-516 [Conf ] Juraj Wiedermann The Complexity of Lexicographic Sorting and Searching. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:517-522 [Conf ] Józef Winkowski An Algebraic Approach to Concurrence. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:523-532 [Conf ] Hideki Yamasaki On Multitape Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:533-541 [Conf ] Stanislav Zák A Turing Machine Oracle Hierarchy. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:542-551 [Conf ] Gérard Berry , Jean-Jacques Lévy A Survey of Some Syntactic Results in the lambda-Calculus. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:552-566 [Conf ] Guy Cousineau , Maurice Nivat On Rational Expressions Representing Infinite Rational Trees: Application to the Structure of Flow Charts. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:567-580 [Conf ]