The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1992, volume: 42, number: 1

  1. Erkki Mäkinen
    On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:1-5 [Journal]
  2. Ambuj K. Singh
    Towards an Understanding of Unbounded Variables in Asynchronous Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:7-17 [Journal]
  3. L. H. Clark, Farhad Shahrokhi, László A. Székely
    A Linear Time Algorithm for Graph Partition Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:19-24 [Journal]
  4. Helmut Alt, Viliam Geffert, Kurt Mehlhorn
    A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:25-27 [Journal]
  5. Herbert Fleischner, Gerhard J. Woeginger
    Detecting Cycles Through Three Fixed Vertices in a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:29-33 [Journal]
  6. Henk Meijer, David Rappaport
    Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:35-38 [Journal]
  7. Arunabha Sen, Abhijit Sengupta, Subir Bandyopadhyay
    On the Routing Problem in Faulty Supercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:39-46 [Journal]
  8. U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
    Effective Use of Memory in Iterative Deepening Search. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:47-52 [Journal]
  9. Nimrod Megiddo
    A Note on Approximate Linear Programming. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:53- [Journal]
  10. Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari
    Optimal Time Bounds for Some Proximity Problems in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:55-60 [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