The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1987, volume: 24, number: 1

  1. Athanasios Alexandrakis, Symeon Bozapalidis
    Weighted Grammars and Kleene's Theorem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:1, pp:1-4 [Journal]
  2. Stuart A. Kurtz, Michael J. O'Donnell, James S. Royer
    How to Prove Representation-Independent Independence Results. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:1, pp:5-10 [Journal]
  3. W. H. J. Feijen, A. J. M. van Gasteren, David Gries
    In-situ Inversion of a Cyclic Permutation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:1, pp:11-14 [Journal]
  4. Taenam Kim, Kyung-Yong Chwa
    An O(n log n log log n) Parallel Maximum Matching Algorithm for Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:1, pp:15-17 [Journal]
  5. Peter H. Hochschild
    Multiple Cuts, Input Repetition, and VLSI Complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:1, pp:19-24 [Journal]
  6. Raphael A. Finkel, Hari Madduri
    An Efficient Deadlock Avoidance Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:1, pp:25-30 [Journal]
  7. Masataka Sassa, Harushi Ishizuka, Ikuo Nakata
    ECLR-Attributed Grammars: A Practical Class of LR-Attributed Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:1, pp:31-41 [Journal]
  8. Arthur J. Bernstein
    Predicate Transfer and Timeout in Message Passing Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:1, pp:43-52 [Journal]
  9. Richard S. Bird, John Hughes
    The alpha-beta Algorithm: An Exercise in Program Transformation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:1, pp:53-57 [Journal]
  10. Toshitsugu Yuba, Mamoru Hoshi
    Binary Search Networks: A New Method for Key Searching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:1, pp:59-65 [Journal]
  11. Vikraman Arvind, Somenath Biswas
    An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:1, pp:67-69 [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