External Links

    Journal: Inf. Process. Lett.

    Volume 33, Issue 3

    113 -- 120Roberto Grossi, Fabrizio Luccio. Simple and Efficient String Matching with k Mismatches
    121 -- 124Takayoshi Shoudai. The Lexicographically First Topological Order Problem is NLOG-Complete
    125 -- 130Lanfranco Lopriore. Software-Controlled Cache Coherence Protocol for Multicache Systems
    131 -- 133E. Robert McCurley. Auxiliary Variables in Partial Correctness Programming Logics
    135 -- 139Selim G. Akl, David Gries, Ivan Stojmenovic. An Optimal Parallel Algorithm for Generating Combinations
    141 -- 143Ronald V. Book, Shouwen Tang. A Note on Sparse Sets and the Polynomial-Time Hierarchy
    145 -- 146Ravi B. Boppana. The Average-Case Parallel Complexity of Sorting
    147 -- 156A. Srinivasa Rao, C. Pandu Rangan. Optimal Parallel Algorithms on Circular-Arc Graphs
    157 -- 162Bruce Parker, Ian Parberry. Constructing Sorting Networks from k-Sorters
    163 -- 168Rudolf Berghammer, Gunther Schmidt, Hans Zierer. Symmetric Quotients and Domain Constructions
    runs on