Journals in DBLP
Ming-Yang Kao , Stephen R. Tate Online Matching with Blocked Input. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:3, pp:113-116 [Journal ] David Fernández-Baca , Mark A. Williams On Matroids and Hierarchical Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:3, pp:117-121 [Journal ] Günter Rote Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:3, pp:123-127 [Journal ] Lars Langemyr Circuits for Computing the GCD of Two Polynomials Over an Algebraic Number Field. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:3, pp:129-134 [Journal ] Charles U. Martel Self-Adjusting Multi-Way Search Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:3, pp:135-141 [Journal ] Subbiah Rajanarayanan , S. Sitharama Iyengar A New Optimal Distributed Algorithm for the Set Intersection Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:3, pp:143-148 [Journal ] Günter Rote , Gerhard J. Woeginger , Binhai Zhu , Zhengyan Wang Counting k-Subsets and Convex k-gons in the Plane. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:3, pp:149-151 [Journal ] Michal Mnuk A div(n) Depth Bollean Circuit for Smooth Modular Inverse. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:3, pp:153-156 [Journal ] P. Pramanik , P. K. Das , A. K. Bandyopadhyay , D. Q. M. Fay A Deadlock-Free Communication Kernel for Loop Architecture. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:3, pp:157-161 [Journal ] Dragan M. Acketa , Jovisa D. Zunic On the Number of Linear Partitions of the (m, n)-Grid. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:3, pp:163-168 [Journal ]