Anshelevich, Elliot; Zhang, Lisa Path decomposition under a new cost measure with applications to optical network design. (English) Zbl 1445.68144 ACM Trans. Algorithms 4, No. 1, Article No. 15, 20 p. (2008). MSC: 68R10 68M10 68W25 90B10 90B18 PDFBibTeX XMLCite \textit{E. Anshelevich} and \textit{L. Zhang}, ACM Trans. Algorithms 4, No. 1, Article No. 15, 20 p. (2008; Zbl 1445.68144) Full Text: DOI
Lemire, Daniel; Kaser, Owen Hierarchical bin buffering: online local moments for dynamic external memory arrays. (English) Zbl 1445.68071 ACM Trans. Algorithms 4, No. 1, Article No. 14, 31 p. (2008). MSC: 68P05 68W05 68W40 PDFBibTeX XMLCite \textit{D. Lemire} and \textit{O. Kaser}, ACM Trans. Algorithms 4, No. 1, Article No. 14, 31 p. (2008; Zbl 1445.68071) Full Text: DOI
Karakostas, George Faster approximation schemes for fractional multicommodity flow problems. (English) Zbl 1446.90152 ACM Trans. Algorithms 4, No. 1, Article No. 13, 17 p. (2008). MSC: 90C31 68W25 90B10 90C35 PDFBibTeX XMLCite \textit{G. Karakostas}, ACM Trans. Algorithms 4, No. 1, Article No. 13, 17 p. (2008; Zbl 1446.90152) Full Text: DOI
Guerraoui, Rachid; Levy, Ron R.; Pochon, Bastian; Pugh, Jim The collective memory of amnesic processes. (English) Zbl 1445.68033 ACM Trans. Algorithms 4, No. 1, Article No. 12, 31 p. (2008). MSC: 68M14 68M10 PDFBibTeX XMLCite \textit{R. Guerraoui} et al., ACM Trans. Algorithms 4, No. 1, Article No. 12, 31 p. (2008; Zbl 1445.68033) Full Text: DOI Link
Gandhi, Rajiv; Halldórsson, Magnús M.; Kortsarz, Guy; Shachnai, Hadas Improved bounds for scheduling conflicting jobs with minsum criteria. (English) Zbl 1446.90078 ACM Trans. Algorithms 4, No. 1, Article No. 11, 20 p. (2008). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{R. Gandhi} et al., ACM Trans. Algorithms 4, No. 1, Article No. 11, 20 p. (2008; Zbl 1446.90078) Full Text: DOI
Gudmundsson, Joachim; Levcopoulos, Christos; Narasimhan, Giri; Smid, Michiel Approximate distance oracles for geometric spanners. (English) Zbl 1445.68068 ACM Trans. Algorithms 4, No. 1, Article No. 10, 34 p. (2008). MSC: 68P05 68R10 68U05 68W25 PDFBibTeX XMLCite \textit{J. Gudmundsson} et al., ACM Trans. Algorithms 4, No. 1, Article No. 10, 34 p. (2008; Zbl 1445.68068) Full Text: DOI
Arge, Lars; de Berg, Mark; Haverkort, Herman; Yi, Ke The priority R-tree: a practically efficient and worst-case optimal R-tree. (English) Zbl 1445.68060 ACM Trans. Algorithms 4, No. 1, Article No. 9, 30 p. (2008). MSC: 68P05 PDFBibTeX XMLCite \textit{L. Arge} et al., ACM Trans. Algorithms 4, No. 1, Article No. 9, 30 p. (2008; Zbl 1445.68060) Full Text: DOI
Buchsbaum, Adam L.; Gansner, Emden R.; Procopiuc, Cecilia M.; Venkatasubramanian, Suresh Rectangular layouts and contact graphs. (English) Zbl 1445.68154 ACM Trans. Algorithms 4, No. 1, Article No. 8, 28 p. (2008). MSC: 68R10 68Q17 68U05 68W25 68W40 PDFBibTeX XMLCite \textit{A. L. Buchsbaum} et al., ACM Trans. Algorithms 4, No. 1, Article No. 8, 28 p. (2008; Zbl 1445.68154) Full Text: DOI arXiv
Gabow, Harold N.; Nie, Shuxin Finding a long directed cycle. (English) Zbl 1445.05102 ACM Trans. Algorithms 4, No. 1, Article No. 7, 21 p. (2008). MSC: 05C85 05C20 05C38 68Q25 68W25 PDFBibTeX XMLCite \textit{H. N. Gabow} and \textit{S. Nie}, ACM Trans. Algorithms 4, No. 1, Article No. 7, 21 p. (2008; Zbl 1445.05102) Full Text: DOI
Roditty, Liam A faster and simpler fully dynamic transitive closure. (English) Zbl 1446.68122 ACM Trans. Algorithms 4, No. 1, Article No. 6, 16 p. (2008). MSC: 68R10 05C20 05C85 68W40 PDFBibTeX XMLCite \textit{L. Roditty}, ACM Trans. Algorithms 4, No. 1, Article No. 6, 16 p. (2008; Zbl 1446.68122) Full Text: DOI
Pettie, Seth; Ramachandran, Vijaya Randomized minimum spanning tree algorithms using exponentially fewer random bits. (English) Zbl 1445.68344 ACM Trans. Algorithms 4, No. 1, Article No. 5, 27 p. (2008). MSC: 68W20 05C85 68R10 PDFBibTeX XMLCite \textit{S. Pettie} and \textit{V. Ramachandran}, ACM Trans. Algorithms 4, No. 1, Article No. 5, 27 p. (2008; Zbl 1445.68344) Full Text: DOI
Barbay, Jérémy; Kenyon, Claire Alternation and redundancy analysis of the intersection problem. (English) Zbl 1445.68338 ACM Trans. Algorithms 4, No. 1, Article No. 4, 18 p. (2008). MSC: 68W20 68P20 68U35 68W40 PDFBibTeX XMLCite \textit{J. Barbay} and \textit{C. Kenyon}, ACM Trans. Algorithms 4, No. 1, Article No. 4, 18 p. (2008; Zbl 1445.68338) Full Text: DOI
Kaplan, Haim; Tarjan, Robert Endre Thin heaps, thick heaps. (English) Zbl 1446.68042 ACM Trans. Algorithms 4, No. 1, Article No. 3, 14 p. (2008). MSC: 68P05 PDFBibTeX XMLCite \textit{H. Kaplan} and \textit{R. E. Tarjan}, ACM Trans. Algorithms 4, No. 1, Article No. 3, 14 p. (2008; Zbl 1446.68042) Full Text: DOI
Franceschini, Gianni; Grossi, Roberto No sorting? Better searching! (English) Zbl 1446.68049 ACM Trans. Algorithms 4, No. 1, Article No. 2, 13 p. (2008). MSC: 68P10 68P05 68Q25 PDFBibTeX XMLCite \textit{G. Franceschini} and \textit{R. Grossi}, ACM Trans. Algorithms 4, No. 1, Article No. 2, 13 p. (2008; Zbl 1446.68049) Full Text: DOI
Ružić, Milan Uniform deterministic dictionaries. (English) Zbl 1445.68073 ACM Trans. Algorithms 4, No. 1, Article No. 1, 23 p. (2008). MSC: 68P05 68W40 PDFBibTeX XMLCite \textit{M. Ružić}, ACM Trans. Algorithms 4, No. 1, Article No. 1, 23 p. (2008; Zbl 1445.68073) Full Text: DOI