Information and Computation, Volume 158

Volume 158, Number 1, April 2000

• Petr Jancar: Decidability of Bisimilarity for One-Counter Processes. 1-17
• Torben Hagerup: Parallel Preprocessing for Path Queries without Concurrent Reading. 18-28
• Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe: Tally NP Sets and Easy Census Functions. 29-52
• Yair Bartal, Marek Chrobak, Lawrence L. Larmore: A Randomized Algorithm for Two Servers on the Line. 53-69

Volume 158, Number 2, May 2000

• Eytan Modiano, Anthony Ephremides: Communication Protocols for Secure Distributed Computation of Binary Functions. 71-97
• Ulla Koppenhagen, Ernst W. Mayr: Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups. 98-124
• Hans van Maaren: A Short Note on Some Tractable Cases of the Satisfiability Problem. 125-130