|
|
Journals in DBLP
J. Algorithms
1986, volume: 7, number: 4
- Ker-I Ko, Shia-Chung Teng
On the Number of Queries Necessary to Identify a Permutation. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:4, pp:449-462 [Journal]
- Philippe Flajolet, Nasser Saheb
The Complexity of Generating an Exponentially Distributed Variate. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:4, pp:463-488 [Journal]
- Micha Hofri, Sami Kamhi
A Stochastic Analysis of the NFD Bin-Packing Algorithm. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:4, pp:489-509 [Journal]
- Michael Kaufmann, Kurt Mehlhorn
Routing Through a Generalized Switchbox. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:4, pp:510-531 [Journal]
- Brenda S. Baker, Steven Fortune, Stephen R. Mahaney
Polygon Containment under Translation. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:4, pp:532-548 [Journal]
- Pawel Winter
Generalized Steiner Problem in Series-Parallel Networks. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:4, pp:549-566 [Journal]
- Noga Alon, László Babai, Alon Itai
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:4, pp:567-583 [Journal]
- David S. Johnson
The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:4, pp:584-601 [Journal]
|
