Theoretical Computer Science, Volume 196

Volume 196, Numbers 1-2, 6 April 1998

• Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
  The Queue-Read Queue-Write Asynchronous PRAM Model. 3-29
  
• Laurent Colombet, Laurent Desbat:
  Speedup and Efficiency of Large-Size Applications on Heterogeneous Networks. 31-44
  
• Ajay D. Kshemkalyani:
  A Framework for Viewing Atomic Events in Distributed Computations. 45-70
  
• George Horatiu Botorog, Herbert Kuchen:
  Efficient High-Level Parallel Programming. 71-107
  
• Alexandre Tiskin:
  The Bulk-Synchronous Parallel Random Access Machine. 109-130
  
• Miriam Di Ianni:
  Efficient Delay Routing. 131-151
  
• Philip D. MacKenzie, Vijaya Ramachandran:
  ERCW PRAMs and Optical Communication. 153-180
  
• Friedhelm Meyer auf der Heide, Klaus Schröder, Frank Schwarze:
  Routing on Networks of Optical Crossbars. 181-200
  
• Stuart F. Oberman, Michael J. Flynn:
  Reducing the Mean Latency of Floating-Point Addition. 201-214
  
• Axel Podehl, Thomas Rauber, Gudula Rünger:
  A Shared-Memory Implementation of the Hierarchical Radiosity Method. 215-240
  
• Jeffrey K. Hollingsworth, Barton P. Miller:
  Using Cost to Control Instrumentation Overhead. 241-258
  
• Cheng-Hong Cho, Jer-Tsang Wang:
  Triangular Grid Protocol: An Efficient Scheme for Replica Control with Uniform Access Quorums. 259-288
  
• Steven T. Hackstadt, Allen D. Malony:
  DAQV: Distributed Array Query and Visualization Framework. 289-317
  
• J. A. Smith, Santosh K. Shrivastava:
  Performance of Fault-Tolerant Data and Compute Intensive Programs over a Network of Workstations. 319-345
  
• Franco Gasperoni, Uwe Schwiegelshohn:
  List Scheduling in the Presence of Branches: A Theoretical Evaluation. 347-363
  
• Jens Knoop:
  Eliminating Partially Dead Code in Explicitly Parallel Programs. 365-393
  
• Patrick Le Gouëslier d'Argence:
  Affine Scheduling on Bounded Convex Polyhedric Domains is Asymptotically Optimal. 395-415