The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1984, volume: 19, number: 1

  1. Hari Madduri, Raphael A. Finkel
    Extension of the Banker's Algorithm for Resource Allocation in a Distributed Operating System. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:1-8 [Journal]
  2. Michio Oyamaguchi
    Some Remarks on Subclass Containment Problems for Several Classes of DPDA's. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:9-12 [Journal]
  3. Nam Sung Woo, Carl H. Smith, Ashok K. Agrawala
    A Proof of the Determinacy Property of the Data Flow Schema. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:13-16 [Journal]
  4. J. R. Parker
    On Converting Character Strings to Integers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:17-19 [Journal]
  5. Ulrich Bechtold, Klaus Küspert
    On the Use of Extendible Hashing Without Hashing. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:21-26 [Journal]
  6. Ulrich Faigle, Rainer Schrader
    Minimizing Completion Time for a Class of Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:27-29 [Journal]
  7. Walter J. Savitch, Paul M. B. Vitányi
    On the Power of Real-Time Two-Way Multihead Finite Automata With Jumps. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:31-35 [Journal]
  8. Alan A. Bertossi
    Dominating Sets for Split and Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:37-40 [Journal]
  9. P. A. Subrahmanyam, Jia-Huai You
    On Embedding Functions in Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:41-46 [Journal]
  10. Selim G. Akl
    An Optimal Algorithm for Parallel Selection. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:47-50 [Journal]
  11. Udi Manber
    A Probabilistic Lower Bound for Checking Disjointness of Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:51-53 [Journal]
  12. Paul G. Spirakis, Chee-Keng Yap
    Strong NP-Hardness of Moving Many Discs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:55-59 [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