Journals in DBLP
Franco P. Preparata , Kenneth J. Supowit Testing a Simple Polygon for Monotonicity. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:161-164 [Journal ] Caroline M. Eastman Optimal Bucket Size for Nearest Neighbor Searching in k-d Trees. [Citation Graph (1, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:165-167 [Journal ] Mark H. Overmars , Jan van Leeuwen Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems. [Citation Graph (1, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:168-173 [Journal ] Christiane Frougny Simple Deterministic NTS Languages. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:174-178 [Journal ] Henk Meijer A Note on `A Cryptosystem for Multiple Communication'. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:179-181 [Journal ] Martin E. Hellman Another Cryptanalytic Attack on `A Cryptosystem for Multiple Communication'. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:182-183 [Journal ] Thomas Ottmann , Arto Salomaa , Derick Wood Sub-Regular Grammar Forms. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:184-187 [Journal ] Ichiro Semba Generation of all the Balanced Parenthesis Strings in Lexicographical Order. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:188-192 [Journal ] Aldo de Luca A Combinatorial Property of the Fibonacci Words. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:193-195 [Journal ] Eric C. R. Hehner , R. K. Shyamasundar An Implementation of P and V. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:196-198 [Journal ] David Maier , Sharon C. Salveter Hysterical B-trees. [Citation Graph (2, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:199-202 [Journal ] Christos H. Papadimitriou , Mihalis Yannakakis On Minimal Eulerian Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:203-205 [Journal ] Masao Iri , Kazuo Murota , Shouichi Matsui Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1981, v:12, n:4, pp:206-209 [Journal ]