Acta Informatica, Volume 28

Volume 28, Number 1, 1990

Donald E. Knuth: Nested Satisfiability. 1-6
Kamal Lodaya, R. K. Shyamasundar: Proof Theory for Exception Handling in a Tasking Environment. 7-41
Hessam Khoshnevisan: Efficient Memo-Table Management Strategies. 43-81
Andrzej Ehrenfeucht, Grzegorz Rozenberg: A Characterization of Set Representable Labeled Partial 2-Structures Through Decompositions. 83-94

Jeremy Dick, John Kalmus, Ursula Martin: Automating the Knuth Bendix Ordering. 95-119
Thomas J. Marlowe, Barbara G. Ryder: Properties of Data Flow Frameworks. 121-163
Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann: Binary Search Trees of Almost Optimal Height. 165-178
Michel Latteux, Paavo Turakainen: On Characterizations of Recursively Enumerable Languages. 178-186

Rolf Hennicker: Observational Implementation of Algebraic Specifications. 187-230
Eike Best, Raymond R. Devillers, Astrid Kiehn, Lucia Pomello: Concurrent Bisimulations in Petri Nets. 231-264
Panagiotis J. Tomaras, Demetres D. Kouvatsos: MRE Hierarchical Decomposition of General Queueing Network Models. 265-295

James H. Anderson, Mohamed G. Gouda: A New Explanation of the Glitch Phenomenon. 297-309
Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang: Sufficient-Completeness, Ground-Reducibility and their Complexity. 311-350
Symeon Bozapalidis: Effective Construction of the Syntactic Algebra of a Recognizable Series on Trees. 351-363
Klaus Hülsmann, Gunter Saake: Theoretical Foundations of Handling Large Substitution Sets in Temporal Integrity Monitoring. 365-407

A. Nico Habermann: Alan J. Perlis 1922-1990. 409-410
Gregor Snelting: The Calculus of Context Relations. 411-445
Carol Critchlow, Prakash Panangaden: The Expressive Power of Delay Operators in SCCS. 447-452
Daniel P. Bovet, Pierluigi Crescenzi: Minimum-Delay Schedules in Layered Networks. 453-461
Reiner Kolla, Bernd Serf: The Virtual Feedback Problem in Hierarchical Representations of Combinational Circuits. 463-476
Friedrich Otto, Louxin Zhang: Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class. 477 -510

Jan van den Bos, Chris Laffra: PROCOL: A Concurrent Object-Oriented Language with Protocols Delegation and Constraints. 511-538
Uwe Kastens, William M. Waite: An Abstract Data Type for Name Analysis. 539-558
Peter G. Harrison: On the Expansion of Non-Linear Functions. 559-574
Joost Engelfriet: Branching Processes of Petri Nets. 575-591
Ulrich Faigle, Walter Kern: Some Order Dimension Bounds for Communication Complexity Problems. 593-601
Mark Levene, George Loizou: Correction to Null Values in Nested Relational Databases by Mark A. Roth, H. F. Korth, and A. Silberschatz. 603-605
Mark A. Roth, Henry F. Korth, Abraham Silberschatz: Addendum to Null Values in Nested Relational Databases. 607-610

Werner Pohlmann: A Fixed Point Approach to Parallel Discrete Event Simulation. 611-629
Xiaolei Qian: The Expressive Power of the Bounded-Iteration Construct. 631-656
José M. Bernabéu-Aubán, Mustaque Ahamad, Mostafa H. Ammar: Resource Finding in Store-and-Forward Networks. 657-680
Hsu-Chun Yen: Priority Systems with many Identical Processes. 681-692
David G. Cantor, Erich Kaltofen: On Fast Multiplication of Polynomials over Arbitrary Algebras. 693-701
Thomas P. Whaley: Postorder Trees and Eulerian Numbers. 703-712

Susan Horwitz, Thomas W. Reps: Efficient Comparison of Program Slices. 713-732
Paul Pritchard: Opportunistic Algorithms for Eliminating Supersets. 733-754
Donald W. Gillies, Jane W.-S. Liu: Greed in Resource Scheduling. 755-775
Paolo Atzeni, Edward P. F. Chan: Independent Database Schemes under Functional and Inclusion Dependencies. 777-779
Attahiru Sule Alfa, Mingyuan Chen: Approximating Queue Lengths in Queue Using the Maximum Entropy Principle. 801-815