Journals in DBLP

Inf. Process. Lett.
1981, volume: 12, number: 2

1. Michael Hatzopoulos, John G. Kollias
   Optimal Policy for Database Backup and Recovery. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:2, pp:55-58 [Journal]
   
2. David M. Harland
   Concurrency in a Language Employing Messages. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:2, pp:59-62 [Journal]
   
3. Ingemar Ingemarsson, C. K. Wong
   A User Authentication Scheme for Shared Data Based on a Trap-Door One-Way Function. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:2, pp:63-67 [Journal]
   
4. Jean-Jacques Pansiot
   The Morse Sequence and Iterated Morphisms. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:2, pp:68-70 [Journal]
   
5. Allan Borodin, Leonidas J. Guibas, Nancy A. Lynch, Andrew Chi-Chih Yao
   Efficient Searching Using Partial Ordering. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:2, pp:71-75 [Journal]
   
6. Claus-Peter Schnorr
   How Many Polynomials can be Approximated Faster Than They can be Evaluated? [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:2, pp:76-78 [Journal]
   
7. Joxan Jaffar
   Presburger Arithmetic With Array Segments. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:2, pp:79-82 [Journal]
   
8. David Steinberg, Michael Rodeh
   A Layout for the Shuffle-Exchange Network with Theta(N²/log N) Area. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:2, pp:83-88 [Journal]
   
9. Yossi Shiloach
   Another Look at the Degree Constrained Subgraph Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1981, v:12, n:2, pp:89-92 [Journal]
   
10. Kurt Mehlhorn, Mark H. Overmars
    Optimal Dynamization of Decomposable Searching Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:2, pp:93-98 [Journal]
    
11. Mark H. Overmars
    General Methods for `All Elements' and `All Pairs' Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:2, pp:99-102 [Journal]
    
12. Silvio Micali
    Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:2, pp:103-105 [Journal]
    
13. Martin Tompa
    An Extension of Savitch's Theorem to Small Space Bounds. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:2, pp:106-108 [Journal]