
Journals in DBLP
 Peter Høyer
Simplified proof of the Fourier Sampling Theorem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:4, pp:139143 [Journal]
 K. V. R. C. N. Kishore, Sanjeev Saxena
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:4, pp:145151 [Journal]
 BorKuan Lu, FangRong Hsu, Chuan Yi Tang
Guarding in a simple polygon. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:4, pp:153158 [Journal]
 FangCheng Leu, YinTe Tsai, Chuan Yi Tang
An efficient external sorting algorithm. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:4, pp:159163 [Journal]
 Ion I. Mandoiu, Alexander Zelikovsky
A note on the MST heuristic for bounded edgelength Steiner trees with minimum number of Steiner points. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:4, pp:165167 [Journal]
 Alon Efrat, Matthew J. Katz
Computing Euclidean bottleneck matchings in higher dimensions. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:4, pp:169174 [Journal]
 Paolo Boldi, Sebastiano Vigna
Coverings that preserve sense of direction. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:4, pp:175180 [Journal]
 Refael Hassin, Shlomi Rubinstein
Better approximations for max TSP. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:4, pp:181186 [Journal]
