Information and Computation, Volume 187

Volume 187, Number 1, 25 November 2003

• Peter V. Homeier, David F. Martin:
  Secure mechanical verification of mutually recursive procedures. 1-19
  
• Lefteris M. Kirousis, Phokion G. Kolaitis:
  The complexity of minimal satisfiability problems. 20-39
  
• Juhani Karhumäki, Leonid P. Lisovik:
  A simple undecidable problem: the inclusion problem for finite substitutions on ab*c. 40-48
  
• Jack H. Lutz:
  The dimensions of individual strings and sequences. 49-79
  
• Dietrich Kuske:
  Regular sets of infinite message sequence charts. 80-109
  
• Takashi Mihara:
  Splitting information securely with entanglement. 110-122
  
• Hubert Comon, Florent Jacquemard:
  Ground reducibility is EXPTIME-complete. 123-153
  

Volume 187, Number 2, 15 December 2003

• Michal Parnas, Dana Ron:
  Testing metric properties. 155-195
  
• Yoram Hirshfeld, Alexander Moshe Rabinovich:
  Future temporal logic needs infinitely many modalities. 196-208
  
• Gennaro Costagliola, Vincenzo Deufemia, Filomena Ferrucci, Carmine Gravino:
  On regular drawn symbolic picture languages. 209-245
  
• Israel Gottlieb, Bojana Obrenic:
  Controlling the data space of tree structured computations. 246-276
  
• Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon:
  Uniform-distribution attribute noise learnability. 277-290
  
• Jörg Flum, Martin Grohe:
  Describing parameterized complexity classes. 291-319
  

Last update Fri May 24 20:21:58 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page