Journals in DBLP

Inf. Process. Lett.
1980, volume: 10, number: 4/5

1. Robert Melville, David Gries
   Controlled Density Sorting. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1980, v:10, n:4/5, pp:169-172 [Journal]
   
2. Alan A. Bertossi
   On the Complexity of Scheduling Jobs on Dedicated Resources to Minimize Set-Up Costs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:10, n:4/5, pp:173-177 [Journal]
   
3. Aviezri S. Fraenkel, Yaacov Yesha
   Complexity of Solving Algebraic Equations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:10, n:4/5, pp:178-179 [Journal]
   
4. Fabrizio Luccio, S. Mazzone
   A Cryptosystem for Multiple Communication. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:10, n:4/5, pp:180-183 [Journal]
   
5. Thomas Lengauer, Robert Endre Tarjan
   The Space Complexity of Pebble Games on Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:10, n:4/5, pp:184-188 [Journal]
   
6. Arthur M. Farley
   Levelling Terrain Trees: A Transshipment Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:10, n:4/5, pp:189-192 [Journal]
   
7. Manfred Broy, Martin Wirsing
   Program Development: From Enumeration to Backtracking. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:10, n:4/5, pp:193-197 [Journal]
   
8. F. Warren Burton, Gilbert N. Lewis
   A Robust Variation of Interpolation Search. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:10, n:4/5, pp:198-201 [Journal]
   
9. Carla D. Savage
   Maximum Matchings and Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1980, v:10, n:4/5, pp:202-205 [Journal]
   
10. R. W. Doran, L. K. Thomas
    Variants of the Software Solution to Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:206-208 [Journal]
    
11. Mark H. Overmars, Jan van Leeuwen
    Further Comments on Bykat's Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:209-212 [Journal]
    
12. Henk Meijer, Selim G. Akl
    The Design and Analysis of a New Hybrid Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:213-218 [Journal]
    
13. Akira Nakamura, Katsushi Inoue
    A Remark on Two-Dimensional Finite Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:219-222 [Journal]
    
14. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the Emptiness of the Intersection of Two D0S Languages Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:223-225 [Journal]
    
15. Kin-Man Chung, Fabrizio Luccio, C. K. Wong
    A New Permutation Algorithm for Bubble Memories. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:226-230 [Journal]
    
16. Corrado Böhm, Antonio Machi, Giovanna Sontacchi
    Complexity Bounds for Equivalence and Isomorphism of Latin Squares. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:231-233 [Journal]
    
17. Ludwik Czaja
    Deadlock and Fairness in Parallel Schemas: A Set-Theoretic Characterization and Decision Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:234-239 [Journal]
    
18. Kellogg S. Booth
    Lexicographically Least Circular Substrings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:240-242 [Journal]
    
19. Peter Buneman, Leon S. Levy
    The Towers of Hanoi Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:243-244 [Journal]
    
20. Katsushi Inoue, Itsuo Takanami
    A Note on Decision Problems for Three-Way Two-Dimensional Finite Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:245-248 [Journal]