Acta Informatica, Volume 26

Volume 26, Number 1/2, 1988

Johannes G. G. van de Vorst: The Formal Development of a Parallel Program Performing LU-Decomposition. 1-17
Dean Jacobs, Martin S. Feather: Corrections to ``A Synthesis of Several Sorting Algorithms'' by J. Darlington. 19-23
Elisa Bertino, Daniela Musto: Correctness of Semantic Integrity Checking in Database Management Systems. 25-57
Pierpaolo Degano, Rocco De Nicola, Ugo Montanari: A Distributed Operational Semantics for CCS Based on Condition/Event Systems. 59-91
Klaus Sutner, Wolfgang Maass: Motion Planning Among Time Dependent Obstacles. 93-122
Luc Devroye: Applications of the Theory of Records in the Study of Random Trees. 123-130
Joost Engelfriet, Heiko Vogler: High Level Tree Transducers and Iterated Pushdown Tree Transducers. 131-192

Walter Cunto, Patricio V. Poblete: Transforming Unbalanced Multiway Trees into a Practical External Data Structure. 193-211
Peter Lipps, Ulrich Möncke, Matthias Olk, Reinhard Wilhelm: Attribute (Re)evaluation in OPTRAN. 213-239
Demetres D. Kouvatsos, John Almond: Maximum Entropy Two-Station Cyclic Queues with Multiple General Servers. 241-267, Errata: 501, 787
Christos Levcopoulos, Mark H. Overmars: A Balanced Search Tree with O (1) Worst-case Update Time. 269-277
Róbert Szelepcsényi: The Method of Forced Enumeration for Nondeterministic Automata. 279-284
Eric C. R. Hehner, Lorene E. Gupta, Andrew J. Malton: Erratum: Predicative Methodology. 285

Joseph M. Morris: Laws of Data Refinement. 287-308
Wim H. Hesselink: Predicate-Transformer Semantics of General Recursion. 309-332
Walter Vogler: Failures Semantics and Deadlocking of Modular Petri Nets. 333-348
Ricardo A. Baeza-Yates: Modeling Splits in File Structures. 349-362,
Johannes Köbler, Uwe Schöning, Jacobo Torán: On Counting and Approximation. 363-379
Edward G. Belaga: Through the Mincing Machine with a Boolean Layer Cake. 381-407

A. Bijlsma, P. A. Matthews, J. G. Wiltink: A Sharp Proof Rule for Procedures in wp Semantics. 409-419
Bin Zhang, Meichun Hsu: Unsafe Operations in B-Trees. 421-438
Ricardo A. Baeza-Yates: The Expected Behaviour of B+-Trees. 439-471
Bing-Chao Huang, Michael A. Langston: Stable Duplicate-Key Extraction with Optimal Time and Space Bounds. 473-484
Paul Helman: A Family of NP-Complete Data Aggregation Problems. 485-499
Demetres D. Kouvatsos, John Almond: Erratum: Maximum Entropy Two-Station Cyclic Queues with Multiple General Servers. 501

Laurent Pierre, Sylviane R. Schwer: Rational Index of Vector Addition Systems Languages. 503-525
Helmut Seidl: On the Finite Degree of Ambiguity of Finite Tree Automata. 527-542
Yennun Huang, Pankaj Jalote: Analytic Models for the Primary Site Approach to Fault-Tolerance. 543-557
Ian F. Akyildiz, Horst von Brand: Computational Algorithms for Networks of Queues with Rejection Blocking. 559-576
K. V. S. Ramarao: Complexity of Distributed Commit Protocols. 577-595

Witold Litwin, Yehoshua Sagiv, K. Vidyasankar: Concurrency and Trie Hashing. 597-614
Mark A. Roth, Henry F. Korth, Abraham Silberschatz: Null Values in Nested Relational Databases. 615-642
Yijie Han, Yoshihide Igarashi: Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array. 643-655
Annegret Habel, Hans-Jörg Kreowski, Walter Vogler: Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages. 657-677
Igal Adiri, John L. Bruno, Esther Frostig, A. H. G. Rinnooy Kan: Single Machine Flow-Time Scheduling With a Single Breakdown. 679-696

János Csirik: An On-Line Algorithm for Variable-Sized Bin Packing. 697-709
Rainer Kemp: The Expected Additive Weight of Trees. 711-740
Arunabha Sen: Supercube: An Optimally Fault Tolerant Network Architecture. 741-748
Jean-Michel Autebert, Joaquim Gabarró: Iterated GSMs and Co-CFL. 749-769
Hans-Ulrich Simon: Continuous Reductions Among Combinatorial Optimization Problems. 771-785
Demetres D. Kouvatsos, John Almond: Erratum: Maximum Entropy Two-Station Cyclic Queues with Multiple General Servers. 787