|
|
Journals in DBLP
J. ACM
2004, volume: 51, number: 3
- Jochen Alber, Michael R. Fellows, Rolf Niedermeier
Polynomial-time data reduction for dominating set. [Citation Graph (0, 0)][DBLP]
J. ACM, 2004, v:51, n:3, pp:363-384 [Journal]
- Daniel A. Spielman, Shang-Hua Teng
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. [Citation Graph (0, 0)][DBLP]
J. ACM, 2004, v:51, n:3, pp:385-463 [Journal]
- Peter Bürgisser, Martin Lotz
Lower bounds on the bounded coefficient complexity of bilinear maps. [Citation Graph (0, 0)][DBLP]
J. ACM, 2004, v:51, n:3, pp:464-482 [Journal]
- Wojciech Plandowski
Satisfiability of word equations with constants is in PSPACE. [Citation Graph (0, 0)][DBLP]
J. ACM, 2004, v:51, n:3, pp:483-496 [Journal]
- Ravi Kannan, Santosh Vempala, Adrian Vetta
On clusterings: Good, bad and spectral. [Citation Graph (0, 0)][DBLP]
J. ACM, 2004, v:51, n:3, pp:497-515 [Journal]
|
