|
Journals in DBLP
Algorithmica 2006, volume: 46, number: 1
- Rudolf Fleischer
Foreword. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:46, n:1, pp:1- [Journal]
- Kazuyuki Amano, Akira Maruoka
The Monotone Circuit Complexity of Quadratic Boolean Functions. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:46, n:1, pp:3-14 [Journal]
- Amitai Armon, Uri Zwick
Multicriteria Global Minimum Cuts. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:46, n:1, pp:15-26 [Journal]
- Fredrik Bengtsson, Jingsen Chen
Efficient Algorithms for k Maximum Sums. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:46, n:1, pp:27-41 [Journal]
- Jin-yi Cai, Osamu Watanabe
Random Access to Advice Strings and Collapsing Results. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:46, n:1, pp:43-57 [Journal]
- Qi Cheng, Ming-Deh A. Huang
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:46, n:1, pp:59-68 [Journal]
- Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc
Deterministic Rendezvous in Graphs. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:46, n:1, pp:69-96 [Journal]
- John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
Adaptive Spatial Partitioning for Multidimensional Data Streams. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:46, n:1, pp:97-117 [Journal]
- Timo von Oertzen
Exact Computation of Polynomial Zeros Expressible by Square Roots. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:46, n:1, pp:119-136 [Journal]
- Joachim von zur Gathen, Igor Shparlinski
GCD of Random Linear Combinations. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:46, n:1, pp:137-148 [Journal]
|