Google
Google Scholar
MS Academic Search
CiteSeerX
Semantic Scholar6. ICALP 1979: Graz, Austria
Hermann A. Maurer:
Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings. Lecture Notes in Computer Science 71, Springer 1979, ISBN 3-540-09510-1- Alberto Bertoni, Giancarlo Mauri, Pierangelo Miglioli:
A Characterization of Abstract Data as Model-Theoretic Invariants. 26-37 - Ronald V. Book, Franz-Josef Brandenburg:
Representing Complexity Classes by Equality Sets (Preliminary Report). 49-57 - Manfred Broy, Walter Dosch, Helmuth Partsch, Peter Pepper, Martin Wirsing:
Existential Quantifiers in Abstract Data Types. 73-87 - Christian Choffrut:
A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings. 88-103 - Mario Coppo, Mariangiola Dezani-Ciancaglini, Patrick Sallé:
Functional Characterization of Some Semantic Equalities inside Lambda-Calculus. 133-146 - Armin B. Cremers, Thomas N. Hibbard:
Arbitration and Queuing Under Limited Shared Storage Requirements (Preliminary Report). 147-160 - Arthur G. Duncan, Lawrence Yelowitz:
Studies in Abstract/Concrete Mappings in Proving Algorithm Correctness. 218-229 - Faith E. Fich, Janusz A. Brzozowski:
A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages. 230-244 - Sorin Istrail:
A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs. 289-303 - Wolfgang Janko:
Hierarchic Index Sequential Search with Optimal Variable Block Size and Its Minimal Expected Number of Comparisons. 304-315 - Hans-Josef Jeanrond:
A Unique Termination Theorem for a Theory with Generalised Commutative Axioms. 316-330 - Richard M. Karp:
Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (Abstract). 338-339 - Friedhelm Meyer auf der Heide:
A Comparison Between Two Variations of a Pebble Game on Graphs. 411-421 - Burkhard Monien, Ivan Hal Sudborough:
On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. 431-445 - Anton Nijholt:
Structure Preserving Transformations on Non-Left-Recursive Grammars (Preliminary Version). 446-459 - Christos H. Papadimitriou, Mihalis Yannakakis:
The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract). 460-470 - Grzegorz Rozenberg:
A Systematic Approach to Formal Language Theory Through Parallel Rewriting. 471-478 - Walter L. Ruzzo:
On the Complexity of General Context-Free Language Parsing and Recognition (Extended Abstract). 489-497 - John E. Savage, Sowmitri Swamy:
Space-Time Tradeoffs for Oblivious Interger Multiplications. 498-504 - Alan L. Selman:
P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. 546-555 - James W. Thatcher, Eric G. Wagner, Jesse B. Wright:
More on Advice on Structuring Compilers and Proving Them Correct. 596-615 - Esko Ukkonen:
A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers. 646-658 - Lutz M. Wegner:
Bracketed Two-Level Grammars - A Decidable and Practical Approach to Language Definitions. 668-682
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2016-09-30 20:24 CEST by the dblp team