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