Bibliography

1

P. K. Agarwal, L. Arge, and S. Govindarajan.
CRB-Tree: An Efficient Indexing Scheme for Range Aggregate Queries.
In Proc. 9th Int'l Conference on Database Theory (ICDT '03), pages 143-157, 2003.

2

D. Ajwani.
Design, Implementation and Experimental Study of External Memory BFS Algorithms.
Master's thesis, Max-Planck-Institut für Informatik, Saarbrücken, Germany, January 2005.

3

L. Arge.
The Buffer Tree: A New Technique for Optimal I/O-Algorithms.
In 4th Workshop on Algorithms and Data Structures, number 955 in LNCS, pages 334-345. Springer, 1995.

4

L. Arge, K. H. Hinrichs, J. Vahrenhold, and J. S. Vitter.
Efficient Bulk Operations on Dynamic R-trees.
In 1st Workshop on Algorithm Engineering and Experimentation (ALENEX '99), Lecture Notes in Computer Science, pages 328-348. Springer-Verlag, 1999.

5

L. Arge, O. Procopiuc, and J. S. Vitter.
Implementing I/O-efficient Data Structures Using TPIE.
In 10th European Symposium on Algorithms (ESA), volume 2461 of LNCS, pages 88-100. Springer, 2002.

6

R. D. Barve, E. F. Grove, and J. S. Vitter.
Simple randomized mergesort on parallel disks.
Parallel Computing, 23(4):601-631, 1997.

7

Klaus Brengel, Andreas Crauser, Paolo Ferragina, and Ulrich Meyer.
An experimental study of priority queues in external memory.
ACM Journal of Experimental Algorithms, 5(17), 2000.

8

Y.-J. Chiang.
Dynamic and I/O-Efficient Algorithms for Computational Geometry and Graph Algorithms.
PhD thesis, Brown University, 1995.

9

Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren E. Vengroff, and Jeffey S. Vitter.
External-memory graph algorithms.
In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 139-149, 1995.

10

A. Crauser and P. Ferragina.
A theoretical and experimental study on the construction of suffix arrays in external memory.
Algorithmica, 32(1):1-35, 2002.

11

A. Crauser and K. Mehlhorn.
LEDA-SM, extending LEDA to secondary memory.
In 3rd International Workshop on Algorithmic Engineering (WAE), volume 1668 of LNCS, pages 228-242, 1999.

12

K. Czarnecki and U. Eisenecker.
Generative Programming: Methods, Tools, and Applications.
Addison Wesley Professional, 2000.

13

E. R. Davidson and T. H. Cormen.
Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs.
In 19th International Parallel and Distributed Processing Symposium (IPDPS 2005).
to appear.

14

R. Dementiev, L. Kettner, and P. Sanders.
Stxxl: Standard Template Library for XXL Data Sets.
In 13th Ann. European Symposium on Algorithms (ESA), 2005.
to appear.

15

R. Dementiev, J. Mehnert, J. Kärkkäinen, and P. Sanders.
Better External Memory Suffix Array Construction.
In Workshop on Algorithm Engineering & Experiments, Vancouver, 2005.
http://i10www.ira.uka.de/dementiev/files/DKMS05.pdf see also http://i10www.ira.uka.de/dementiev/esuffix/docu/data/diplom.pdf.

16

R. Dementiev and P. Sanders.
Asynchronous parallel disk sorting.
In 15th ACM Symposium on Parallelism in Algorithms and Architectures, pages 138-148, San Diego, 2003.

17

R. Dementiev, P. Sanders, D. Schultes, and J. Sibeyn.
Engineering an External Memory Minimum Spanning Tree Algorithm.
In IFIP TCS, pages 195-208, Toulouse, 2004.

18

R. Fadel, K. V. Jakobsen, J. Katajainen, and J. Teuhola.
External heaps combined with effective buffering.
In 4th Australasian Theory Symposium, volume 19-2 of Australian Computer Science Communications, pages 72-78. Springer, 1997.

19

Frank Harary and Helene J. Kommel.
Matrix measures for transitivity and balance.
Journal of Mathematical Sociology, 6:199-210, 1979.

20

Andrew Hume.
Handbook of massive data sets, chapter Billing in the large, pages 895 - 909.
Kluwer Academic Publishers, 2002.

21

D. A. Hutchinson, P. Sanders, and J. S. Vitter.
Duality between prefetching and queued writing with parallel disks.
In 9th European Symposium on Algorithms (ESA), number 2161 in LNCS, pages 62-73. Springer, 2001.

22

L. Arge, R. Barve, D. Hutchinson, O. Procopiuc, L. Toma, D. E. Vengroff, R. Wickeremesinghe.
TPIE: User manual and reference, November 2003.

23

L. Laura, S. Leonardi, S. Millozzi, U. Meyer, , and J.F. Sibeyn.
Algorithms and Experiments for the Webgraph.
In 11th Ann. European Symposium on Algorithms (ESA), pages 703-714, 2003.

24

K. Mehlhorn and U. Meyer.
External-Memory Breadth-First Search with Sublinear I/O.
In 10th Ann. European Symposium on Algorithms (ESA), volume 2461 of LNCS, pages 723-735, 2002.

25

K. Mehlhorn and S. Näher.
The LEDA Platform of Combinatorial and Geometric Computing.
Cambridge University Press, 1999.

26

Jens Mehnert.
External Memory Suffix Array Construction.
Master's thesis, University of Saarland, Germany, November 2004.
http://i10www.ira.uka.de/dementiev/esuffix/docu/data/diplom.pdf.

27

U. Meyer, P. Sanders, and J. Sibeyn, editors.
Algorithms for Memory Hierarchies, volume 2625 of LNCS Tutorial.
Springer, 2003.

28

R. W. Moore.
Enabling petabyte computing.
http://www.nap.edu/html/whitepapers/ch-48.html, 2000.

29

K. Munagala and A. Ranade.
I/O-complexity of graph algorithms.
In Proc. 10th Symp. on Discrete Algorithms, pages 687-694. ACM-SIAM, 1999.

30

O. Procopiuc, P. K. Agarwal, L. Arge, and J. S. Vitter.
Bkd-tree: A Dynamic Scalable KD-Tree.
In Proc. 8th Int'l Symposium on Spatial and Temporal Databases (SSTD '03), pages 46-65.

31

Peter Sanders.
Fast priority queues for cached memory.
ACM Journal of Experimental Algorithmics, 5, 2000.

32

Dominik Schultes.
External Memory Spanning Forests and Connected Components.
http://i10www.ira.uka.de/dementiev/files/cc.pdf, September 2003.

33

A. Silberschatz, H. F. Korth, and S. Sudarshan.
Database System Concepts.
McGraw-Hill, 4th edition, 2001.

34

A. A. Stepanov and M. Lee.
The Standard Template Library.
Technical Report X3J16/94-0095, WG21/N0482, Silicon Graphics Inc., Hewlett Packard Laboratories, 1994.

35

D. E. Vengroff.
A Transparent Parallel I/O Environment.
In Third DAGS Symposium on Parallel Computation, pages 117-134, Hanover, NH, July 1994.

36

D. E. Vengroff and J. S. Vitter.
I/O-Efficient Scientific Computation using TPIE.
In Goddard Conference on Mass Storage Systems and Technologies, volume 2, pages 553-570, 1996.
published in NASA Conference Publication 3340.

37

J. S. Vitter and D. A. Hutchinson.
Distribution sort with randomized cycling.
In 12th ACM-SIAM Symposium on Discrete Algorithms, pages 77-86, 2001.

38

J. S. Vitter and E. A. M. Shriver.
Algorithms for parallel memory, I/II.
Algorithmica, 12(2/3):110-169, 1994.

39

Norbert Ralf Zeh.
I/O Efficient Algorithms for Shortest Path Related Problems.
PhD thesis, Carleton University, Ottawa, April 2002.