Information and Computation, Volume 171

Volume 171, Number 1, November 2001

• Paolo Baldan, Andrea Corradini, Ugo Montanari: Contextual Petri Nets, Asymmetric Event Structures, and Processes. 1-49
• Eric Martin, Daniel N. Osherson: Induction by Enumeration. 50-68
• Amos Beimel, Felix Geller, Eyal Kushilevitz: The Query Complexity of Finding Local Minima in the Lattice. 69-83
• Juan Luis Esteban, Jacobo Torán: Space Bounds for Resolution. 84-97
• Paul W. Goldberg: Learning Fixed-Dimension Linear Thresholds from Fragmented Data. 98-122

Volume 171, Number 2, December 2001

• Zhi-Zhong Chen:
  Approximating Unweighted Connectivity Problems in Parallel. 125-136
  
• Benedetto Intrigila, Ivano Salvo, Stefano Sorgi:
  A Characterization of Weakly Church-Rosser Abstract Reduction Systems That Are Not Church-Rosser. 137-155
  
• Johann Blieberger:
  Real-Time Properties of Indirect Recursive Procedures. 156-182
  
• William C. Rounds, Guo-Qiang Zhang:
  Clausal Logic and Logic Programming in Algebraic Domains. 183-200
  
• Pavel Pudlák:
  Complexity Theory and Genetics: The Computational Power of Crossing Over. 201-223
  
• Rudolf Fleischer, Kathleen Romanik, Sven Schuierer, Gerhard Trippen:
  Optimal Robot Localization in Trees. 224-247
  
• Yehuda Hassin, David Peleg:
  Distributed Probabilistic Polling and Applications to Proportionate Agreement. 248-268
  
• Kamal Lodaya, Pascal Weil:
  Rationality in Algebras with a Series Operation. 269-293
  
• Leah Epstein:
  Online Variable Sized Covering. 294-305
  
• Alexander Moshe Rabinovich, Shahar Maoz:
  An Infinite Hierarchy of Temporal Logics over Branching Time. 306-332
  
• Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen:
  Lower Bounds for Dynamic Algebraic Problems. 333-349
  
• Adi Shamir, Boaz Tsaban:
  Guaranteeing the Diversity of Number Generators. 350-363
  
• Jens Palsberg, Tian Zhao:
  Efficient and Flexible Matching of Recursive Types. 364-387