Information and Computation, Volume 91

Volume 91, Number 1, 1991

Matthias Krause: Lower Bounds for Depth-Restricted Branching Programs. 1-14 BibTeX
Nicole Bidoit, Christine Froidevaux: General Logical Databases and Programs: Default Logic Semantics and Stratification. 15-54 BibTeX
Roberto M. Amadio: Recursion over Realizability Structures. 55-85 BibTeX
Samuel R. Buss, Louise Hay: On Truth-Table Reducibility to SAT. 86-102 BibTeX
Kirk Pruhs, Udi Manber: The Complexity of Controlled Selection. 103-127 BibTeX
Dan Geiger, Azaria Paz, Judea Pearl: Axioms and Algorithms for Inferences Involving Probabilistic Independence. 128-141 BibTeX
Joachim von zur Gathen, Gadiel Seroussi: Boolean Circuits Versus Arithmetic Circuits. 142-154 BibTeX

P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal: Approximate Algorithms for the Knapsack Problem on Parallel Computers. 155-171 BibTeX
Lajos Rónyai: Computing the Order of Centralizers in Linear Groups. 172-176 BibTeX
Marek Chrobak, Howard J. Karloff, Tomasz Radzik: Connectivity vs. Reachability. 177-188 BibTeX
N. G. de Bruijn: Telescopic Mappings in Typed Lambda Calculus. 189-204 BibTeX
Brian A. Coan, Cynthia Dwork: Simultaneity Is Harder than Agreement. 205-231 BibTeX
Kim Guldstrand Larsen, Glynn Winskel: Using Information Systems to Solve Recursive Domain Equations. 232-258 BibTeX
Stephen J. Bellatoni: Parallel Random Access Machines with Bounded Memory Wordsize. 259-273 BibTeX