|
Journals in DBLP
- Roy Friedman, Roman Vitenberg, Gregory Chockler
On the composability of consistency conditions. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:86, n:4, pp:169-176 [Journal]
- Li Lin, Yunfei Jiang
The computation of hitting sets: Review and new algorithms. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:86, n:4, pp:177-184 [Journal]
- Hsun-Jung Cho, Li-Yen Hsu
Generalized honeycomb torus. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:86, n:4, pp:185-190 [Journal]
- Rastislav Kralovic, Peter Ruzicka
Minimum feedback vertex sets in shuffle-based interconnection networks. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:86, n:4, pp:191-196 [Journal]
- Susanne E. Hambrusch, Chuan-Ming Liu
Data replication in static tree structures. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:86, n:4, pp:197-202 [Journal]
- Esther M. Arkin, Joseph S. B. Mitchell, Christine D. Piatko
Minimum-link watchman tours. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:86, n:4, pp:203-207 [Journal]
- Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas
Reflected min-max heaps. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:86, n:4, pp:209-214 [Journal]
- Luc Devroye, Pat Morin
Cuckoo hashing: Further analysis. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:86, n:4, pp:215-219 [Journal]
- Stefan D. Bruda, Selim G. Akl
On limits on the computational power of data-accumulating algorithms. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:86, n:4, pp:221-227 [Journal]
|