Acta Informatica, Volume 35

Volume 35, Number 1, 1998

• Vincent D. Blondel:
  Structured Numbers: Properties of a Hierarchy of Operations on Binary Trees. 1-15
  
• Rainer Kemp:
  Generating Words Lexicographically: An Average-Case Analysis. 17-89
  

Volume 35, Number 2, 1998

• Beverly A. Sanders:
  Data Refinement of Mixed Specifications. 91-129
  
• Ralph-Johan Back, Qiwen Xu:
  Refinement of Fair Action Systems. 131-165
  
• Stefan Andrei, Cristian Masalagiu:
  About the Collatz Conjecture. 167-179
  

Volume 35, Number 3, 1998

• Elvira Locuratolo, Fausto Rabitti:
  Conceptual Classes and System Classes in Object Databases. 181-210
  
• Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Andreas Stafylopatis:
  Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases. 211-243
  
• Edward Y. C. Cheng, Michael Kaminski:
  Context-Free Languages over Infinite Alphabets. 245-267
  

Volume 35, Number 4, 1998

• Derrick G. Kourie, G. Deon Oosthuizen:
  Lattices in Machine Learning: Complexity Issues. 269-292
  
• Alexander Moshe Rabinovich:
  Modularity and Expressibility for Nets of Relations. 293-327
  
• Thomas Buchholz, Martin Kutrib:
  On Time Computability of Functions in One-Way Cellular Automata. 329-352
  

Volume 35, Number 5, 1998

• Michele Boreale, Davide Sangiorgi:
  A Fully Abstract Semantics for Causality in the \pi-Calculus. 353-400
  
• Lila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu:
  DNA Computing, Sticker Systems, and Universality. 401-420
  
• Reuven Bar-Yehuda, Sergio Fogel:
  Partitioning a Sequence into Few Monotone Subsequences. 421-440
  

Volume 35, Number 6, 1998

• Roberto Baldoni, Jean-Michel Hélary, Michel Raynal:
  Consistent Records in Asynchronous Computations. 441-455
  
• Shmuel Sagiv, Nissim Francez, Michael Rodeh, Reinhard Wilhelm:
  A Logic-Based Approach to Program Flow Analysis. 457-504
  
• Zoltán Ésik, Michael Bertol:
  Nonfinite Axiomatizability of the Equational Theory of Shuffle. 505-539
  

Volume 35, Number 7, 1998

• Jop F. Sibeyn:
  List Ranking on Meshes. 543-566
  
• Volker Diekert, Paul Gastin:
  Approximating Traces. 567-593
  
• Hing Leung:
  On Finite Automata with Limited Nondeterminism. 595-624
  
• Juha Honkala:
  Decision Problems Concerning Thinness and Slenderness of Formal Languages. 625-636
  

Volume 35, Number 8, 1998

• Jan Van den Bussche, Luca Cabibbo:
  Converting Untyped Formulas to Typed Ones. 637-643
  
• Danièle Beauquier, Anatol Slissenko:
  Polytime Model Checking for Timed Probabilistic Computation Tree Logic. 645-664
  
• Salvatore Caporaso, Michele Zito:
  On a Relation Between Uniform Coding and Problems of the Form DTIMEF(F) =? DSPACEF(F). 665-672
  
• Hsu-Chun Yen:
  Priority Conflict-Free Petri Nets. 673-688
  
• Huei-Jan Shyr, Shyr-Shen Yu:
  Bi-Catenation and Shuffle Product of Languages. 689-707
  
• Chen-Ming Fan, Huei-Jan Shyr, Shyr-Shen Yu:
  d-Words and d-Languages. 709-727
  

Volume 35, Number 9, 1998

• Amílcar Sernadas, Cristina Sernadas, Carlos Caleiro:
  Denotational Semantics of Object Specification. 729-773
  
• Alistair Moffat, Ola Petersson, Nicholas C. Wormald:
  A Tree-Based Mergesort. 775-793
  
• Eric Sanlaville, Günter Schmidt:
  Machine Scheduling with Availability Constraints. 795-811
  

Volume 35, Number 10, 1998

• Eike Best, Wojciech Fraczak, Richard P. Hopkins, Hanna Klaudel, Elisabeth Pelz:
  M-Nets: An Algebra of High-Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages. 813-857
  
• Kim S. Larsen:
  Amortized Constant Relaxed Rebalancing Using Standard Rotations. 859-874
  
• Christoph Wedler, Christian Lengauer:
  On Linear List Recursion in Parallel. 875-909
  

Volume 35, Number 11, 1998

• Hsien-Kuei Hwang:
  Asymptotic Expansions of the Mergesort Recurrences. 911-919
  
• Ralph-Johan Back, Michael J. Butler:
  Fusion and Simultaneous Execution in the Refinement Calculus. 921-949
  
• Michel Bidoit, Rolf Hennicker:
  Modular Correctness Proofs of Behavioural Implementations. 951-1005
  

Volume 35, Number 12, 1998

• Lex Bijlsma, Rob Nederpelt:
  Dijkstra-Scholten Predicate Calculus: Concepts and Misconceptions. 1007-1036
  
• Nicoletta De Francesco, Antonella Santone:
  A Transformation System for Concurrent Processes. 1037-1073
  
• Joost Engelfriet, Tjalling Gelsema:
  Axioms for Generalized Graphs, Illustrated by a Cantor-Bernstein Proposition. 1075-1096
  

Last update Sat May 25 15:24:16 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page