Journal of Algorithms, Volume 54

Volume 54, Number 1, January 2005

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

Volume 54, Number 2, February 2005

• James Aspnes, Orli Waarts:
  Compositional competitiveness for distributed algorithms. 127-151
  
• Kenneth Weber, Vilmar Trevisan, Luiz Felipe Martins:
  A modular integer GCD algorithm. 152-167
  
• Richard Beigel, David Eppstein:
  3-coloring in time O(1.3289ⁿ). 168-204
  
• Mun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho:
  Efficient parallel exponentiation in GF(qn) using normal basis representations. 205-221