Information and Computation, Volume 174

Volume 174, Number 1, April 2002

• John Case, Matthias Ott, Arun Sharma, Frank Stephan:
  Learning to Win Process-Control Games Watching Game-Masters. 1-19
  
• Andreas Blass, Yuri Gurevich, Jan Van den Bussche:
  Abstract State Machines and Computationally Complete Query Languages. 20-36
  
• Martín Abadi, Cédric Fournet, Georges Gonthier:
  Secure Implementation of Channel Abstractions. 37-83
  
• Stéphane Demri, Ph. Schnoebelen:
  The Complexity of Propositional Linear Temporal Logics in Simple Cases. 84-103
  

Volume 174, Number 2, May 2002

• Robert Givan, David A. McAllester, Carl Witty, Dexter Kozen:
  Tarskian Set Constraints. 105-131
  
• Arnaud Durand, Malika More:
  Nonerasing, Counting, and Majority over the Linear Time Hierarchy. 132-142
  
• Nobuko Yoshida, Matthew Hennessy:
  Assigning Types to Processes. 143-179
  
• Alberto Apostolico, Mikhail J. Atallah:
  Compact Recognizers of Episode Sequences. 180-192
  
• Steven S. Seiden:
  A General Decomposition Theorem for the k-Server Problem. 193-202
  
• Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern:
  Scalable Secure Storage When Half the System Is Faulty. 203-213
  

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