Journals in DBLP

Inf. Process. Lett.
2000, volume: 75, number: 4

1. Peter Høyer
   Simplified proof of the Fourier Sampling Theorem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:75, n:4, pp:139-143 [Journal]
   
2. 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:145-151 [Journal]
   
3. Bor-Kuan Lu, Fang-Rong Hsu, Chuan Yi Tang
   Guarding in a simple polygon. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:75, n:4, pp:153-158 [Journal]
   
4. Fang-Cheng Leu, Yin-Te Tsai, Chuan Yi Tang
   An efficient external sorting algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:75, n:4, pp:159-163 [Journal]
   
5. Ion I. Mandoiu, Alexander Zelikovsky
   A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:75, n:4, pp:165-167 [Journal]
   
6. 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:169-174 [Journal]
   
7. Paolo Boldi, Sebastiano Vigna
   Coverings that preserve sense of direction. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:75, n:4, pp:175-180 [Journal]
   
8. Refael Hassin, Shlomi Rubinstein
   Better approximations for max TSP. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:75, n:4, pp:181-186 [Journal]