
Journals in DBLP
 Devendra Kumar, Abraham Silberschatz
A CounterExample to an Algorithm for the Generalized InputOutput Construct of CSP. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:6, pp:287 [Journal]
 Eyal Kushilevitz
A Simple Algorithm for Learning O (log n)Term DNF. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:6, pp:289292 [Journal]
 Louis Ibarra
Finding Pattern Matchings for Permutations. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:6, pp:293295 [Journal]
 Moshe Dror, Wieslaw Kubiak, Paolo Dell'Olmo
Scheduling Chains to Minimize Mean Flow Time. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:6, pp:297301 [Journal]
 Nader H. Bshouty
On Learning Multivariate Polynomials Under the Uniform Distribution. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:6, pp:303309 [Journal]
 H. S. Chao, FangRong Hsu, Richard C. T. Lee
An Optimal EREW Parallel Algorithm for Computing BreadthFirst Search Trees on Permutation Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:6, pp:311316 [Journal]
 Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky
A Note on Approximating Graph Genus. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:6, pp:317322 [Journal]
 Athena Vakali, Yannis Manolopoulos
An Exact Analysis on Expected Seeks in Shadowed Disks. [Citation Graph (1, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:6, pp:323329 [Journal]
 Paola Flocchini
Minimal Sense of Direction in Regular Networks. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:6, pp:331338 [Journal]
