External Links

    Journal: Inf. Comput.

    Volume 97, Issue 2

    133 -- 149Raymond Greenlaw. A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching
    150 -- 204Dan E. Willard. A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time
    205 -- 233Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong. Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement
    234 -- 261Tao Jiang. The Synchronization of Nonuniform Networks of Finite Automata
    262 -- 276Shih Ping Tung. Polynomial Time Algorithms for Sentences over Number Fields

    Volume 97, Issue 1

    1 -- 22Sang Cho, Dung T. Huynh. The Parallel Complexity of Finite-State Automata Problems
    23 -- 60Yasubumi Sakakibara. Efficient Learning of Context-Free Grammars from Positive Structural Examples
    61 -- 85Brian A. Coan, Jennifer L. Welch. Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity
    86 -- 96Ingo Wegener. The Worst Case Complexity of McDiarmid and Reed s Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n
    97 -- 131Miklós Bartha. An Algebraic Model of Synchronous Systems
    runs on