Acta Informatica, Volume 29

Volume 29, Number 1, 1992

Sanguthevar Rajasekaran, Sandeep Sen: On Parallel Integer Sorting. 1-15
Mark B. Josephs: Receptive Process Theory. 17-31
Ian J. Hayes: Multi-Relations in Z. 33-62
Didier Y. Hinz: A Run-Time Load Balancing Strategy for Highly Parallel Systems. 63-94
Peter Roth: Every Binary Pattern of Length Six is Avoidable on the Two-Letter Alphabet. 95-107

Charles N. Fischer, Jon Mauney: A Simple, Fast, and Effective LL(1) Error Repair Algorithm. 109-120
J. Xu: On-Line Multiversion Database Concurrency Control. 121-160
Joost Engelfriet, Linda Heyker: Context-Free Hypergraph Grammars have the Same Term-Generating Power as Attribute Grammars. 161-210

Peter G. Harrison, Hessam Khoshnevisan: On the Synthesis of Function Inverses. 211-239
Patrick E. O'Neil: The SB-Tree: An Index-Sequential Structure for High-Performance Sequential Access. 241-265
Svante Carlsson, Jingsen Chen: On Partitions and Presortedness of Sequences. 267-280
M. W. Du, S. C. Chang: A Model and a Fast Algorithm for Multiple Errors Spelling Correction. 281-302

Jos C. M. Baeten, Frits W. Vaandrager: An Algebra for Process Creation. 303-334
Aris M. Ouksel, Otto Mayer: A Robust and Efficient Spatial Data Structure. 335-373
Chung-Yee Lee, Surya Danusaputro Liman: Single Machine Flow-Time Scheduling with Scheduled Maintenance. 375-382
Klaus Hinrichs, Jürg Nievergelt, Peter Schorn: An All-Round Sweep Algorithm for 2-Dimensional Nearest-Neighbor Problems. 383-394

Dana S. Richards, Jeffrey S. Salowe: Stacks, Queues, and Deques with Order-Statistic Operations. 395-414
Dong-wan Tcha, Bum-il Lee, Toung-duck Lee: Processors Selection and Traffic Splitting in a Parallel Processors System. 415-423
Anna Slobodová: Communication for Alternating Machines. 425-441
Ricardo A. Baeza-Yates, Walter Cunto: Unbalanced Multiway Trees Improved by Partial Expansions. 443-460
Anthony J. Fisher: A "Yo-Yo" Parsing Algorithm for a Large Class of van Wijngaarden Grammars. 461-481
Aldo de Luca, Stefano Varricchio: On Finitely Recognizable Semigroups. 483-498

Wuxu Peng, S. Purushothaman: Analysis of a Class of Communicating Finite State Machines. 499-522
Nicolas Halbwachs, Fabienne Lagnier, Christophe Ratel: An Experience in Proving Regular Networks of Processes by Modular Model Checking. 523-543
Tero Harju, H. C. M. Kleijn, Michel Latteux: Deterministic Sequential Functions. 545-554
Mogens Nielsen, Grzegorz Rozenberg, P. S. Thiagarajan: Elementary Transition Systems and Refinement. 555-578
Vernon Rego: Naive Asymptotics for Hitting Time Bounds in Markov Chains. 579-594
Oliver Schoett: Two Impossibility Theorems on Behaviour Specification of Abstract Data Types. 595-621
Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi: Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata. 623-643
Leo Marcus, Telis Menas: Expressibility of Output Equals Input. 645-662
Andreas Weber: On the Lengths of Values in a Finite Transducer. 663-687

Donald Sannella, Stefan Sokolowski, Andrzej Tarlecki: Toward Formal Development of Programs from Algebraic Specifications: Parameterisation Revisited. 689-736
S. Arun-Kumar, Matthew Hennessy: An Efficiency Preorder for Processes. 737-760
Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente: Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations. 761-778
Adrian Atanasiu: A Class of Coders Based on GSM. 779-791