Journals in DBLP

J. Algorithms
2002, volume: 42, number: 2

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