Journals in DBLP

J. Algorithms
1997, volume: 24, number: 1

1. Shlomo Moran, Gadi Taubenfeld
   A Lower Bound on Wait-Free Counting. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:24, n:1, pp:1-19 [Journal]
   
2. S. Haldar
   An `All Pairs Shortest Paths' Distributed Algorithm Using 2n² Messages. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:24, n:1, pp:20-36 [Journal]
   
3. Greg N. Frederickson
   A Data Structure for Dynamically Maintaining Rooted Trees. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:24, n:1, pp:37-65 [Journal]
   
4. Susanne E. Hambrusch, Hung-Yi Tu
   Edge Weight Reduction Problems in Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:24, n:1, pp:66-93 [Journal]
   
5. Hans L. Bodlaender, Joost Engelfriet
   Domino Treewidth. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:24, n:1, pp:94-123 [Journal]
   
6. Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook
   Page Migration Algorithms Using Work Functions. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:24, n:1, pp:124-157 [Journal]
   
7. Shimon Even, Ami Litman, Peter Winkler
   Computing with Snakes in Directed Networks of Automata. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:24, n:1, pp:158-170 [Journal]
   
8. Andrei Z. Broder, Ernst W. Mayr
   Counting Minimum Weight Spanning Trees. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:24, n:1, pp:171-176 [Journal]
   
9. David Eppstein, Daniel S. Hirschberg
   Choosing Subsets with Maximum Weighted Average. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:24, n:1, pp:177-193 [Journal]
   
10. Monika Rauch Henzinger
    A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:1, pp:194-220 [Journal]