External Links

    Journal: Nord. J. Comput.

    Volume 2, Issue 4

    397 -- 406K.-L. Chung. Fast Median-Finding on Mesh-Connected Computers with Segmented Buses
    407 -- 443Joachim Parrow. Interaction Diagrams
    444 -- 461Claus Rick. A New Flexible Algorithm for the Longest Common Subsequence Problem
    462 -- 495Hans Leo Bodlaender, Teofilo F. Gonzalez, Ton Kloks. Complexity Aspects of Two-Dimensional Data Compression
    496 -- 501Jens Clausen, Jakob Krarup. A Family of Bipartite Cardinality Matching Problems Solvable in O(n:::2:::) Time
    runs on