Theoretical Computer Science, Volume 243

Volume 243, Numbers 1-2, 28 July 2000

• Józef Winkowski:
  Processes of timed Petri nets. 1-34
  
• Roberto De Prisco, Butler W. Lampson, Nancy A. Lynch:
  Revisiting the PAXOS algorithm. 35-91
  
• Peter Padawitz:
  Swinging types=functions+relations+transition systems. 93-165
  
• Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
  Decidability and complexity of simultaneous rigid E-unification with one variable and related results. 167-184
  
• Noriko H. Arai:
  Tractability of Cut-free Gentzen-type propositional calculus with permutation inference II. 185-197
  
• Jonathan P. Seldin:
  A Gentzen-style sequent calculus of constructions with expansion rules. 199-215
  
• Shlomo Moran, Sagi Snir:
  Simple and efficient network decomposition and synchronization. 217-241
  
• Rida A. Bazzi:
  Planar quorums. 243-268
  
• K. B. Lakshmanan, Daniel J. Rosenkrantz, S. S. Ravi:
  Alarm placement in systems with fault propagation. 269-288
  
• Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
  Power consumption in packet radio networks. 289-305
  
• Yuh-Jzer Joung:
  Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability. 307-338
  
• David Meier, Beverly A. Sanders:
  Composing leads-to properties. 339-361
  
• Juan A. Garay, Rosario Gennaro, Charanjit S. Jutla, Tal Rabin:
  Secure distributed storage and retrieval. 363-389
  
• Wan Fokkink:
  Language preorder as a precongruence. 391-408
  
• Tuomas Aura, Johan Lilius:
  A causal semantics for time Petri nets. 409-447
  
• Qing Zhou:
  Grzegorczyk's hierarchy of computable analysis. 449-466
  
• Alexander Moshe Rabinovich:
  Symbolic model checking for µ-calculus requires exponential time. 467-475
  
• Fabio Massacci:
  The proof complexity of analytic and clausal tableaux. 477-487
  
• Alfons Geser:
  On normalizing, non-terminating one-rule string rewriting systems. 489-498