The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1983, volume: 16, number: 2

  1. Joanna Jedrzejowicz
    On the Enlargement of the Class of Regular Languages by the Shuffle Closure. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:51-54 [Journal]
  2. Juris Hartmanis
    On Sparse Sets in NP - P. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:55-60 [Journal]
  3. Lloyd Allison
    Stable Marriages by Coroutines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:61-65 [Journal]
  4. Christopher W. Fraser
    A Generalization of Two Code Ordering Optimizations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:67-70 [Journal]
  5. Stefan Eicholz
    Optimal Networks for Distributing Nonsequential Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:71-74 [Journal]
  6. Bernard Chazelle
    A Decision Procedure for Optimal Polyhedron Partitioning. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:75-78 [Journal]
  7. Bowen Alpern, Fred B. Schneider
    Key Exchange Using `Keyless Cryptography'. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:79-81 [Journal]
  8. Micha Hofri
    Should the Two-Headed Disk be Greedy? - Yes, it Should. [Citation Graph (4, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:83-85 [Journal]
  9. Dan Gusfield
    Connectivity and Edge-Disjoint Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:87-89 [Journal]
  10. T. R. Walsh
    Iteration Strikes Back - at the Cyclic Towers of Hanoi. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:91-93 [Journal]
  11. Toshihide Ibaraki, Naoki Katoh
    On-Line Computation of Transitive Closures of Graphs. [Citation Graph (5, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:95-97 [Journal]
  12. Christopher Wood, Eduardo B. Fernández, Tomás Lang
    Minimization of Demand Paging for the LRU Stack Model of Program Behavior. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:99-104 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002