Journals in DBLP
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ]