Acta Informatica, Volume 28

Volume 28, Number 1, 1990

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

Volume 28, Number 2, 1990

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

Volume 28, Number 3, 1991

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

Volume 28, Number 4, 1991

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

Volume 28, Number 5, 1991

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

Volume 28, Number 6, 1991

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

Volume 28, Number 7, 1991

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

Volume 28, Number 8, 1991

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