Acta Informatica, Volume 21
Volume 21, 1984
- N. P. Chapman: LALR (1, 1) Parser Generation for Regular Right Part Grammars. 29-45
- Jayme Luiz Szwarcfiter: Optimal Multiway Search Trees for Variable Size Keys. 47-60
- Matthew Hennessy: Axiomatising Finite Delay Operators. 61-88
- Athanasios K. Tsakalidis: Maintaining Order in a Generalized Linked List. 101-112
- Boris D. Lubachevsky: An Approach to Automating the Verification of Compact Parallel Coordination Programs I. 125-169
- Norbert Blum, Martin Seysen: Characterization of all Optimal Networks for a Simultaneous Computation of AND and NOR. 171-181
- Will D. Gillett: On Binary Tree Encodements. 183-192
- Oscar H. Ibarra, Sam M. Kim: A Characterization of Systolic Binary Tree Automata and Applications. 193-207
- Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson, Françoise Gire: Bicentres de langages algébriques. 209-227
- Luc Devroye: A Probabilistic Analysis of the Height of Tries and of the Complexity of Triesort. 229-237
- Richard S. Bird: Using Circular Programs to Eliminate Multiple Traversals of Data. 239-250
- Howard Barringer, J. H. Cheng, Cliff B. Jones: A Logic Covering Undefinedness in Program Proofs. 251-269
- Ralf Hartmut Güting: Optimal Divide-and-Conquer to Compute Measure and Contour for a Set of Iso-Rectangles. 271-291
- Donald L. Iglehart, Gerald S. Shedler: Simulation Output Analysis for Local Area Computer Networks. 321-338
- Kurt Mehlhorn, Uzi Vishkin: Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. 339-374
- Pierre Deransart, Martin Jourdan, Bernard Lorho: Speeding up Circularity Tests for Attribute Grammars. 375-391
- Edward G. Coffman Jr., Michael A. Langston: A Performance Guarantee for the Greedy Set-Partitioning Algorithm. 409-415
- Donald Sannella: A Set-Theoretic Semantics for Clear. 443-472
- Mikhail A. Bulyonkov: Polyvariant Mixed Computation for Analyzer Programs. 473-484
- Clement H. C. Leung, Qui Hoon Choo: The Paging Drum Queue: A Uniform Perspective and Further Results. 485-500
- Stefan Hertel, Martti Mäntylä, Kurt Mehlhorn, Jürg Nievergelt: Space Sweep Solves Intersection of Convex Polyhedra. 501-519
- G. Bauer, Friedrich Otto: Finite Complete Rewriting Systems and the Complexity of the Word Problem. 521-540
Volume 21, 1985
- William E. Wright: Some Average Performance Measures for the B-Tree. 541-557
- A. J. Fisher: Practical LL(1)-Based Parsing of van Wijngaarden Grammars. 559-584
- Daniel M. Berry: A Denotational Semantics for Shared-Memory Parallelism and Nondeterminism. 599-627
- Rüdiger Valk, Matthias Jantzen: The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. 643-674
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team