Journals in DBLP

J. Algorithms
1983, volume: 4, number: 3

1. John D. Dixon, Herbert S. Wilf
   The Random Selection of Unlabeled Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:3, pp:205-213 [Journal]
   
2. A. Guénoche
   Random Spanning Tree. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:3, pp:214-220 [Journal]
   
3. W. M. Beynon
   A Formal Account of Some Elementary Continued Fraction Algorithms. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:3, pp:221-240 [Journal]
   
4. T. C. Hu, M. T. Shing
   Multiterminal Flows in Outerplanar Networks. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:3, pp:241-261 [Journal]
   
5. Errol L. Lloyd
   An O(n log m) Algorithm for the Josephus Problem. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:3, pp:262-270 [Journal]
   
6. Eliezer L. Lozinskii
   An Algorithm for Parallel Evaluation of Functions. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:3, pp:271-281 [Journal]
   
7. C. Pandu Rangan
   On the Minimum Number of Additions Required to Compute a Quadratic Form. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:3, pp:282-285 [Journal]
   
8. David S. Johnson
   The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:3, pp:286-300 [Journal]
   
9. Mark H. Overmars
   Corrigendum: Dynamization of Order Decomposable Set Problems. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:3, pp:301- [Journal]