Journals in DBLP
Fabrizio Luccio , Linda Pagli A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:1-4 [Journal ] Wojciech Rytter A Note on Two-Way Nondeterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:5-9 [Journal ] Jean-Claude Bermond , Charles Delorme , Jean-Jacques Quisquater Tables of Large Graphs with Given Degree and Diameter. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:10-13 [Journal ] Larry J. Stockmeyer , Vijay V. Vazirani NP-Completeness of Some Generalizations of the Maximum Matching Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:14-19 [Journal ] Coenraad Bron , E. J. Dijkstra , S. Doaitse Swierstra A Memory-Management Unit for the Optimal Exploitation of a Small Address Space. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:20-22 [Journal ] Clement H. C. Leung Optimal Database Reorganisation: Some Practical Difficulties. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:23-27 [Journal ] Maciej M. Syslo A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:28-30 [Journal ] Albert G. Greenberg , Richard E. Ladner , Mike Paterson , Zvi Galil Efficient Parallel Algorithms for Linear Recurrence Computation. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:31-35 [Journal ] Peter M. Winkler On Computability of the Mean Deviation. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:36-38 [Journal ] Karel Culik II , Derick Wood A Note on Some Tree Similarity Measures. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:39-42 [Journal ] Leon S. Levy An Improved List-Searching Algorithm. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:43-45 [Journal ]