no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A derandomization using min-wise independent permutations
|
Broder, Andrei Z. |
|
2003 |
1 |
1 |
p. 11-20 10 p. |
article |
2 |
Algorithms for shortest paths and d-cycle problems
|
Bespamyatnikh, Sergei |
|
2003 |
1 |
1 |
p. 1-9 9 p. |
article |
3 |
An efficient fixed-parameter algorithm for 3-Hitting Set
|
Niedermeier, Rolf |
|
2003 |
1 |
1 |
p. 89-102 14 p. |
article |
4 |
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations
|
Duckworth, William |
|
2003 |
1 |
1 |
p. 67-76 10 p. |
article |
5 |
A unifying look at the Apostolico–Giancarlo string-matching algorithm
|
Crochemore, Maxime |
|
2003 |
1 |
1 |
p. 37-52 16 p. |
article |
6 |
Editorial board
|
|
|
2003 |
1 |
1 |
p. v-vi nvt p. |
article |
7 |
On reductions for the Steiner Problem in Graphs
|
Kingston, Jeffrey H |
|
2003 |
1 |
1 |
p. 77-88 12 p. |
article |
8 |
On the number of distinct prime factors of an odd perfect number
|
Cohen, Graeme L. |
|
2003 |
1 |
1 |
p. 21-35 15 p. |
article |
9 |
String matching in O ( n + m ) quantum time
|
Ramesh, H |
|
2003 |
1 |
1 |
p. 103-110 8 p. |
article |
10 |
The consensus string problem for a metric is NP-complete
|
Sim, Jeong Seop |
|
2003 |
1 |
1 |
p. 111-117 7 p. |
article |
11 |
Update games and update networks
|
Dinneen, Michael J. |
|
2003 |
1 |
1 |
p. 53-65 13 p. |
article |