Journals in DBLP
Igor Litovsky Prefix-Free Languages as omega-Generators. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:2, pp:61-65 [Journal ] Fabrizio Luccio , Andrea Pietracaprina , Geppino Pucci Analysis of Parallel Uniform Hashing. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:2, pp:67-69 [Journal ] Timothy Law Snyder Lower Bounds for Rectilinear Steiner Trees in Bounded Space. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:2, pp:71-74 [Journal ] C. C. Handley A Space Efficient Distributive Sort. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:2, pp:75-78 [Journal ] Roberto Tamassia An Incremental Reconstruction Method for Dynamic Planar Point Location. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:2, pp:79-83 [Journal ] Yoshihiro Tanaka A Dual Algorithm for the Satisfiability Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:2, pp:85-89 [Journal ] Richard Beigel , Lane A. Hemachandra , Gerd Wechsung Probabilistic Polynomial Time is Closed under Parity Reductions. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:2, pp:91-94 [Journal ] Joakim von Wright Program Inversion in the Refinement Calculus. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:2, pp:95-100 [Journal ] Alan Gibbons , Ridha Ziani The Balanced Binary Tree Technique on Mesh-Connected Computers. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:2, pp:101-109 [Journal ] Xin He An Efficient Parallel Algorithm for Finding Minimum Weight Matching for Points on a Convex Polygon. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:2, pp:111-116 [Journal ] Svante Carlsson An Optimal Algorithm for Deleting the Root of a Heap. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:37, n:2, pp:117-120 [Journal ]