External Links

    Journal: J. Algorithms

    Volume 42, Issue 2

    205 -- 230Mikkel Thorup. Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations
    231 -- 254Brenda S. Baker, Raffaele Giancarlo. Sparse Dynamic Programming for Longest Common Subsequence from Fragments
    255 -- 276Mirela Damian-Iordache, Sriram V. Pemmaraju. A (2+epsilon)-Approximation Scheme for Minimum Domination on Circle Graphs
    277 -- 303Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter. Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
    304 -- 316Hatem M. Bahig, Ken Nakamula. Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
    317 -- 333Nicholas Pippenger. Analysis of Carry Propagation in Addition: An Elementary Approach
    334 -- 366Magnús M. Halldórsson, Guy Kortsarz. Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
    runs on