Theoretical Computer Science, Volume 64

Volume 64, Number 1, 1989

• Hans-Jörg Stoß:
  On the Representation of Rational Functions of Bounded Complexity. 1-13
  
• Hans-Jörg Stoß:
  Lower Bounds for the Complexity of Polynomials. 15-23
  
• K. Jojczyk, J. Konieczny, T. Kuzak:
  On Interleaving Behaviour of PT-Nets. 25-38
  
• Etsuji Tomita, Kazushi Seino:
  A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic Pushdown Transducers, one of which is Real-Time Strict. 39-53
  
• Hiroyuki Sato:
  E-CCC: Between CCC and Topos. 55-66
  
• Dang Van Hung, Elöd Knuth:
  Semi-Commutations and Petri Nets. 67-81
  
• Eli Shamir, Assaf Schuster:
  Communication Aspects of Networks Based on Geometric Incidence Relations. 83-96
  
• J. Roger Hindley:
  BCK-Combinators and Linear lambda-Terms have Types. 97-105
  
• Zvi Galil, Raffaele Giancarlo:
  Speeding up Dynamic Programming with Applications to Molecular Biology. 107-118
  
• Marco Protasi, Maurizio Talamo:
  On the Number of Arithmetical Operations for Finding Fibonacci Numbers. 119-124
  
• Ephraim Korach, Shlomo Moran, Shmuel Zaks:
  Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. 125-132
  

Volume 64, Number 2, 1989

• Clyde P. Kruskal, Larry Rudolph, Marc Snir:
  Techniques for Parallel Manipulation of Sparse Matrices. 135-157
  
• Yves Robert, Denis Trystram:
  Optimal Scheduling Algorithms for Parallel Gaussian Elimination. 159-173
  
• Gordon Lyon:
  Design Factors for Parallel Processing Benchmarks. 175-189
  
• Jean-Claude Bermond, Jean-Michel Fourneau:
  Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks. 191-201
  
• Ian F. Akyildiz, Horst von Brand:
  Exact Solutions for Open, Closed and Mixed Queueing Networks with Rejection Blocking. 203-219
  

Volume 64, Number 3, 1989

• Eugene W. Stark:
  Concurrent Transition Systems. 221-269
  
• Denis Thérien:
  Programs over Aperiodic Monoids. 271-280
  
• Antoni W. Mazurkiewicz, Edward Ochmanski, Wojciech Penczek:
  Concurrent Systems and Inevitability. 281-304
  
• Rodney R. Howell, Louis E. Rosier:
  Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets. 305-329
  
• Noga Alon, Uri Zwick:
  On Neciporuk's Theorem for Branching Programs. 331-342
  
• Hans Kleine Büning, Theodor Lettmann, Ernst W. Mayr:
  Projections of Vector Addition System Reachability Sets are Semilinear. 343-350
  

Last update Thu May 23 19:35:22 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page