External Links

    Journal: Inf. Comput.

    Volume 91, Issue 2

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

    Volume 91, Issue 1

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