Information and Computation, Volume 189

Volume 189, Number 1, 25 February 2004

• Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum:
  Counting and sampling H-colourings? 1-16
  
• Stéphane Lengrand, Pierre Lescanne, Daniel J. Dougherty, Mariangiola Dezani-Ciancaglini, Steffen van Bakel:
  Intersection types for explicit substitutions. 17-42
  
• Claire Kenyon, Samuel Kutin:
  Sensitivity, block sensitivity, and l-block sensitivity of boolean functions. 43-53
  
• Jens Palsberg, Tian Zhao:
  Type inference for record concatenation and subtyping. 54-86
  
• Luca Paolini, Simona Ronchi Della Rocca:
  Parametric parameter passing Lambda-calculus. 87-106
  
• Eldar Fischer:
  On the strength of comparisons in property testing. 107-116
  
• Eric Allender, Meena Mahajan:
  The complexity of planarity testing. 117-134
  

Volume 189, Number 2, 15 March 2004

• Funda Ergün, Ravi Kumar, Ronitt Rubinfeld:
  Fast approximate probabilistically checkable proofs. 135-159
  
• Markus Lohrey, Anca Muscholl:
  Bounded MSC communication. 160-181
  
• Albert Atserias, Maria Luisa Bonet:
  On the automatizability of resolution and related propositional proof systems. 182-201
  
• Paul-André Melliès:
  Comparing hierarchies of types in models of linear logic. 202-234
  
• Arun Sharma, Frank Stephan, Yuri Ventsov:
  Generalized notions of mind change complexity. 235-262
  

Last update Tue Feb 14 04:18:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page