The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1995, volume: 56, number: 1

  1. Stephen Thomas
    Garbage Collection in shared-environment Closure Reducers: Space-Efficient Depth First Copying Using a Tailored Approach. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:1-7 [Journal]
  2. Vladimir Estivill-Castro, Joseph O'Rourke, Jorge Urrutia, Dianna Xu
    Illumination of Polygons with Vertex Lights. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:9-13 [Journal]
  3. Alberto Bertoni, Nicolò Cesa-Bianchi, Guido Fiorino
    Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:15-17 [Journal]
  4. Garrison W. Greenwood
    On the Equity of Mutual Exclusion Algorithms in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:19-22 [Journal]
  5. Ian Parberry
    A Real-Time Algorithm for the (n²-1)-Puzzle. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:23-28 [Journal]
  6. Qian-Ping Gu, Shietung Peng
    Node-to-Node Cluster Fault Tolerant Routing in Star Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:29-35 [Journal]
  7. Sanjeev Saxena, N. Malahal Rao
    Parallel Algorithms for Connectivity Problems on Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:37-44 [Journal]
  8. Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, Gerhard J. Woeginger
    Counting Convex Polygons in Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:45-49 [Journal]
  9. Joseph Y.-T. Leung, W.-D. Wei
    Tighter Bounds on a Heuristic for a Partition Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:51-57 [Journal]
  10. Torben Hagerup
    The Parallel Complexity of Integer Prefix Summation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:59-64 [Journal]
  11. Rossella Petreschi, Andrea Sterbini
    Erratum: Recognizing Strict 2-Threshold Graphs in O(m) Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:65- [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