


default search action
Acta Informatica, Volume 21
Volume 21, 1984
- Rudolf Bayer, Peter Schlichtiger:

Data Management Support for Database Management. 1-28 - Nigel 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 - Eike Best, Klaus Voss:

Free Choice Systems Have Home States. 89-100 - Athanasios K. Tsakalidis:

Maintaining Order in a Generalized Linked List. 101-112 - Shou-Hsuan Stephen Huang, C. K. Wong:

Generalized Binary Split Trees. 113-123 - 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 - Jan A. Bergstra, John V. Tucker:

The Axiomatic Semantics of Programs Based on Hoare's Logic. 293-320 - 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 - Christian Choffrut, Karel Culík II:

On Real-Time Cellular Automata and Trellis Automata. 393-407 - Edward G. Coffman Jr., Michael A. Langston:

A Performance Guarantee for the Greedy Set-Partitioning Algorithm. 409-415 - Gerardo Costa, Colin Stirling:

A Fair Calculus of Communicating Systems. 417-441 - 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 - Marina C. Chen, Martin Rem:

Deadlock-Freedom in Resource Contentions. 585-598 - Daniel M. Berry:

A Denotational Semantics for Shared-Memory Parallelism and Nondeterminism. 599-627 - Jacques Lenfant, Serge Tahé:

Permuting Data with the Omega Network. 629-641 - Rüdiger Valk, Matthias Jantzen:

The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. 643-674

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














