|
|
Journals in DBLP
J. Algorithms
1997, volume: 25, number: 1
- Bonnie Berger, Peter W. Shor
Tight Bounds for the Maximum Acyclic Subgraph Problem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1997, v:25, n:1, pp:1-18 [Journal]
- Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen
A Reliable Randomized Algorithm for the Closest-Pair Problem. [Citation Graph (1, 0)][DBLP]
J. Algorithms, 1997, v:25, n:1, pp:19-51 [Journal]
- Michel Habib, Lhouari Nourine, George Steiner
Gray Codes for the Ideals of Interval Orders. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1997, v:25, n:1, pp:52-66 [Journal]
- Mohammad Hossain Heydari, Ivan Hal Sudborough
On the Diameter of the Pancake Network. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1997, v:25, n:1, pp:67-94 [Journal]
- Yehuda Afek, Gideon Stupp
Optimal Time-Space Tradeoff for Shared Memory Leader Election. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1997, v:25, n:1, pp:95-117 [Journal]
- Michael Krivelevich
Approximate Set Covering in Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1997, v:25, n:1, pp:118-143 [Journal]
- Michel Barbeau, Froduald Kabanza, Richard St.-Denis
An Efficient Algorithm for Controller Synthesis under Full Observation. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1997, v:25, n:1, pp:144-161 [Journal]
- Noga Alon, Dmitry N. Kozlov
Coins with Arbitrary Weights. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1997, v:25, n:1, pp:162-176 [Journal]
- Binay K. Bhattacharya, Sandeep Sen
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1997, v:25, n:1, pp:177-193 [Journal]
- Andrew Chi-Chih Yao, Frances F. Yao
Dictionary Look-Up with One Error. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1997, v:25, n:1, pp:194-202 [Journal]
|
