
Journals in DBLP
J. Algorithms 1996, volume: 20, number: 1
 Danny Krizanc
TimeRandomness Tradeoffs in Parallel Computation. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:1, pp:119 [Journal]
 Jens Lagergren
Efficient Parallel Algorithms for Graphs of Bounded TreeWidth. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:1, pp:2044 [Journal]
 Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman
Parallel Algorithms with Processor Failures and Delays. [Citation Graph (1, 0)][DBLP] J. Algorithms, 1996, v:20, n:1, pp:4586 [Journal]
 David M. Cohen, Michael L. Fredman
Weighted Binary Trees for Concurrent Searching. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:1, pp:87112 [Journal]
 André van Vliet
On the Asymptotic Worst Case Behavior of Harmonic Fit. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:1, pp:113136 [Journal]
 Yair Caro, András Sebö, Michael Tarsi
Recognizing Greedy Structures. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:1, pp:137156 [Journal]
 Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman
The Complexity of Scheduling Trees with Communication Delays. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:1, pp:157173 [Journal]
 Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
A Linear Algorithm for EdgeColoring SeriesParallel Multigraphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:1, pp:174201 [Journal]
