| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
An algorithm for the satisfiability problem of formulas in conjunctive normal form
|
Schuler, Rainer
|
|
2005
|
54 |
1 |
p. 40-44
5 p.
|
article
|
| 2 |
Approximation algorithms for array partitioning problems
|
Muthukrishnan, S.
|
|
2005
|
54 |
1 |
p. 85-104
20 p.
|
article
|
| 3 |
A probabilistic model for the degree of the cancellation polynomial in Gosper's algorithm
|
Pemantle, Robin
|
|
2005
|
54 |
1 |
p. 58-71
14 p.
|
article
|
| 4 |
3-coloring and 3-clique-ordering of locally connected graphs
|
Kochol, Martin
|
|
2005
|
54 |
1 |
p. 122-125
4 p.
|
article
|
| 5 |
Cycles in random k-ary maps and the poor performance of random number generation
|
Pemantle, Robin
|
|
2005
|
54 |
1 |
p. 72-84
13 p.
|
article
|
| 6 |
Editorial Board
|
|
|
2005
|
54 |
1 |
p. IFC-
1 p.
|
article
|
| 7 |
Estimating the maximum
|
Gum, Ben
|
|
2005
|
54 |
1 |
p. 105-114
10 p.
|
article
|
| 8 |
Factoring into coprimes in essentially linear time
|
Bernstein, Daniel J.
|
|
2005
|
54 |
1 |
p. 1-30
30 p.
|
article
|
| 9 |
Generating Huffman sequences
|
Hoffman, Dean
|
|
2005
|
54 |
1 |
p. 115-121
7 p.
|
article
|
| 10 |
Linear time algorithms for the ring loading problem with demand splitting
|
Wang, Biing-Feng
|
|
2005
|
54 |
1 |
p. 45-57
13 p.
|
article
|
| 11 |
Papers to appear in forthcoming issues
|
|
|
2005
|
54 |
1 |
p. 126-
1 p.
|
article
|
| 12 |
Simple constant amortized time generation of fixed length numeric partitions
|
Boyer, John M.
|
|
2005
|
54 |
1 |
p. 31-39
9 p.
|
article
|
Journal description