Journals in DBLP

J. Algorithms
1996, volume: 20, number: 1

1. Danny Krizanc
   Time-Randomness Trade-offs in Parallel Computation. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1996, v:20, n:1, pp:1-19 [Journal]
   
2. Jens Lagergren
   Efficient Parallel Algorithms for Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1996, v:20, n:1, pp:20-44 [Journal]
   
3. 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:45-86 [Journal]
   
4. 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:87-112 [Journal]
   
5. 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:113-136 [Journal]
   
6. Yair Caro, András Sebö, Michael Tarsi
   Recognizing Greedy Structures. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1996, v:20, n:1, pp:137-156 [Journal]
   
7. 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:157-173 [Journal]
   
8. Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
   A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1996, v:20, n:1, pp:174-201 [Journal]