Journals in DBLP

Inf. Process. Lett.
1986, volume: 22, number: 4

1. Brigitte Jaumard, Michel Minoux
   An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:4, pp:163-169 [Journal]
   
2. J. Mark Keil
   Total Domination in Interval Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:4, pp:171-174 [Journal]
   
3. Wolfgang Panny
   A Note on the Higher Moments of the Expected Behavior of Straight Insertion Sort. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:4, pp:175-177 [Journal]
   
4. M. C. Hambury
   Two Tagless Variations on the Deutsch-Schorr-Waite Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:4, pp:179-183 [Journal]
   
5. Michael C. Loui, Teresa A. Matsushita, Douglas B. West
   Election in a Complete Network with a Sense of Direction. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:4, pp:185-187 [Journal]
   
6. Svante Carlsson
   Splitmerge - A Fast Stable Merging Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:4, pp:189-192 [Journal]
   
7. Bruno Codenotti, Grazia Lotti
   A Note on the VLSI Counter. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:4, pp:193-195 [Journal]
   
8. H. Gajewska, Robert Endre Tarjan
   Deques with Heap Order. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:4, pp:197-200 [Journal]
   
9. Dana S. Richards
   Data Compression and Gray-Code Sorting. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:22, n:4, pp:201-205 [Journal]
   
10. Key-Sun Choi, Gil-Chang Kim
    A Controlled Quantification in Parsing of Montague Grammar. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:4, pp:207-216 [Journal]