Journals in DBLP

J. Algorithms
2005, volume: 54, number: 1

1. Daniel J. Bernstein
   Factoring into coprimes in essentially linear time. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:54, n:1, pp:1-30 [Journal]
   
2. John M. Boyer
   Simple constant amortized time generation of fixed length numeric partitions. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:54, n:1, pp:31-39 [Journal]
   
3. Rainer Schuler
   An algorithm for the satisfiability problem of formulas in conjunctive normal form. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:54, n:1, pp:40-44 [Journal]
   
4. Biing-Feng Wang
   Linear time algorithms for the ring loading problem with demand splitting. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:54, n:1, pp:45-57 [Journal]
   
5. Robin Pemantle
   A probabilistic model for the degree of the cancellation polynomial in Gosper's algorithm. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:54, n:1, pp:58-71 [Journal]
   
6. Robin Pemantle
   Cycles in random k-ary maps and the poor performance of random number generation. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:54, n:1, pp:72-84 [Journal]
   
7. S. Muthukrishnan, Torsten Suel
   Approximation algorithms for array partitioning problems. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:54, n:1, pp:85-104 [Journal]
   
8. Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith Ellen Fich
   Estimating the maximum. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:54, n:1, pp:105-114 [Journal]
   
9. Dean Hoffman, Peter Johnson, Nadine Wilson
   Generating Huffman sequences. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2005, v:54, n:1, pp:115-121 [Journal]
   
10. Martin Kochol
    3-coloring and 3-clique-ordering of locally connected graphs: . [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:54, n:1, pp:122-125 [Journal]