Journals in DBLP

Inf. Process. Lett.
1991, volume: 38, number: 6

1. Peter B. Danzig
   A Cooperative Game with Applications to Computer Networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:6, pp:283-289 [Journal]
   
2. Franco P. Preparata
   Inverting a Vandermonde Matrix in Minimum Parallel Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:6, pp:291-294 [Journal]
   
3. Robert Kennedy
   Parallel Cardinality Stacks and an Application. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:6, pp:295-299 [Journal]
   
4. Sandy Irani
   Two Results on the List Update Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:6, pp:301-306 [Journal]
   
5. Kenneth Luo, William Klostermeyer, Yuan-Chieh Chow, Richard E. Newman-Wolfe
   Optimal Deadlock Resolutions in Edge-Disjoint Reducible Wait-For Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:6, pp:307-313 [Journal]
   
6. Shahram Latifi
   Distributed Subcube Identification Algorithms for Reliable Hypercupes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:6, pp:315-321 [Journal]
   
7. Jerzy R. Nawrocki
   Conflict Detection and Resolution in a Lexical Analyzer Generator. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:6, pp:323-328 [Journal]
   
8. Kieran T. Herley
   A Note on the Token Distribution Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:6, pp:329-334 [Journal]
   
9. David Zuckerman
   On the Time to Traverse all Edges of a Graph. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1991, v:38, n:6, pp:335-337 [Journal]
   
10. Dejan Zivkovic
    A Fast Algorithm for Finding the Compact Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:6, pp:339-342 [Journal]