Journals in DBLP
Erkki Mäkinen On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:1-5 [Journal ] Ambuj K. Singh Towards an Understanding of Unbounded Variables in Asynchronous Systems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:7-17 [Journal ] L. H. Clark , Farhad Shahrokhi , László A. Székely A Linear Time Algorithm for Graph Partition Problems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:19-24 [Journal ] Helmut Alt , Viliam Geffert , Kurt Mehlhorn A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:25-27 [Journal ] Herbert Fleischner , Gerhard J. Woeginger Detecting Cycles Through Three Fixed Vertices in a Graph. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:29-33 [Journal ] Henk Meijer , David Rappaport Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:35-38 [Journal ] Arunabha Sen , Abhijit Sengupta , Subir Bandyopadhyay On the Routing Problem in Faulty Supercubes. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:39-46 [Journal ] U. K. Sarkar , P. P. Chakrabarti , Sujoy Ghose , S. C. De Sarkar Effective Use of Memory in Iterative Deepening Search. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:47-52 [Journal ] Nimrod Megiddo A Note on Approximate Linear Programming. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:53- [Journal ] Alok Aggarwal , Herbert Edelsbrunner , Prabhakar Raghavan , Prasoon Tiwari Optimal Time Bounds for Some Proximity Problems in the Plane. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:1, pp:55-60 [Journal ]