The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Maciej Slusarek
    An Off-Line Storage Allocation Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:71-75 [Journal]
  2. E. Allen Emerson
    Uniform Inevitability is Tree Automaton Ineffable. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:77-79 [Journal]
  3. Anne Grazon
    An Infinite Word Language Which is Not co-CFL. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:81-85 [Journal]
  4. Ouri Wolfson
    Concurrent Execution of Transaction Copies. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:87-93 [Journal]
  5. Dan Field
    A Note on a New Data Structure for in-the-Past Queries. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:95-96 [Journal]
  6. Claudio Rey, Rabab K. Ward
    On Determining the On-Line Minimax Linear Fit to a Discrete Point Set in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:97-101 [Journal]
  7. Bogdan Korel
    The Program Dependence Graph in Static Program Testing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:103-108 [Journal]
  8. Georg Gottlob
    Subsumption and Implication. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:109-111 [Journal]
  9. Masataka Sassa, Ikuo Nakata
    A Simple Realization of LR-Parsers for Regular Right Part Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:113-120 [Journal]
  10. Richard Anderson, Ernst W. Mayr
    Parallelism and the Maximal Path Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:121-126 [Journal]
  11. C. A. R. Hoare, Jifeng He
    The Weakest Prespecification. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:127-132 [Journal]
  12. Mihalis Yannakakis, Fanica Gavril
    The Maximum k-Colorable Subgraph Problem for Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:133-137 [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