default search action
Acta Informatica, Volume 11
Volume 11, 1978
- John Darlington:
A Synthesis of Several Sorting Algorithms. 1-30 - Gérard P. Huet, Bernard Lang:
Proving and Applying Program Transformations Expressed with Second-Order Patterns. 31-55 - Abraham Silberschatz, Brian Johnson:
Remarks on "Some Comments on Concurrent Readers and Writers" by Reidar Conradi. 57-60 - Leonard M. Adleman, Kellogg S. Booth, Franco P. Preparata, Walter L. Ruzzo
:
Improved Time and Space Bounds for Boolean Matrix Multiplication. 61-77 - Seymour Ginsburg, Derick Wood:
Precedence Relations in Grammar Forms. 79-88 - Sheila A. Greibach:
Hierarchy Theorems for Two-Way Finite State Transducers. 80-101
Volume 11, 1979
- Colin Adams, Erol Gelenbe, Jean Vicard:
An Experimentally Validated Model of the Paging Drum. 103-117 - Cliff B. Jones
Constructing a Theory of a Data Structure as an Aid to Program Development. 119-137 - Michael A. Arbib, Suad Alagic:
Proof Rules for Gotos. 139-148 - Wolfgang Merzenich:
A Binary Operation on Trees and an Initial Algebra Characterization for Finite Tree Types. 149-168 - Stephan Heilbrunner:
On the Definition of ELR(k) and ELL(k) Grammars. 169-176 - Wilf R. LaLonde:
Constructing LR Parsers for Regular Right Part Grammars. 177-193 - Derek Coleman, Jane W. Hughes:
The Clean Termination of Pascal Programs. 195-210 - Rodney W. Topor:
The Correctness of the Schorr-Waite List Marking Algorithm. 211-221 - David Gries
The Schorr-Waite Graph Marking Algorithm. 223-232 - Michel Latteux:
Intersections de langages algébriques bornés. 233-240 - Jean-Michel Autebert:
Opérations de Cylindre et applications séquentielles gauches inverses. 241-258 - Peter R. J. Asveld, Joost Engelfriet:
Extended Linear Macro Grammars, Iteration Grammars, and Register Programs. 259-285 - Eric C. R. Hehner:
do Considered od: A Contribution to the Programming Calculus. 287-304 - P. Bouchet:
Procédures de reprise dans les systèmes de gestion de base de données réparties. 305-340 - Karl Unterauer:
Dynamic Weighted Binary Search Trees. 341-362 - Rainer Kemp:
The Average Number of Registers Needed to Evaluate a Binary Tree Optimally. 363-372 - Jan van Leeuwen:
A Useful Lemma for Context-Free Programmed Grammars. 373-386
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.
last updated on 2024-12-19 22:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: