1. Λίστα Εργασιών External Memory Data Structures Vitter, J. S. and Shriver, E. 1994a. Algorithms for parallel memory I: Two-level memories. Algorithmica 12, 2–3, 110–147. Vitter, J. S. and Shriver, E. A.1994b. Algorithms for parallel memory II: Hierarchical multilevel S. Lanka, E. Mays, Fully Persistent B+-trees, ACM International Conference on Management of Data, 426-435, 1992. Varman P. & Verma R. An Efficient Multiversion Access Structure. IEEE Transactions on Knowledge and Data Engineering, 391-409. 1997 B. Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer, An asymptotically optimal multiversion B-tree, The VLDB Journal, 264-275. P. Ferragina and R. Grossi. The string B-tree: a new data structure for string search in external memory and its applications. J. ACM, 46(2):236-280, 1999.

2. External Memory Geometric Data Structures Arge, L. 1995a. The buffer tree: A new technique for optimal I/O-algorithms. In Proceedings of the Workshop on Algorithms and Data Structures, Vol. 955 of Lecture Notes in Computer Science, Springer-Verlag, 334–345, 1995. A complete version appears as BRICS Technical Report RS–96–28, University of Aarhus. Arge, L. 1997. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, eds, Algorithmic Foundations of GIS, Vol. 1340 of Lecture Notes in Computer Science, Springer-Verlag, 213–254. Arge, L. and Vahrenhold, J. I/O-efficient dynamic planar point location. In Proceedings of the ACM Symposium on Computational Geometry (June), Vol. 9, 191–200, 2000. Kanellakis, P. C.,Ramaswamy, S., Vengroff, D. E., and Vitter, J. S. 1996. Indexing for data models with constraints and classes. Journal of Computer and System Sciences 52, 3, 589–612. Arge, L. and Vitter, J. S. Optimal dynamic interval management in external memory. In Proceedings of the IEEE Symposium on Foundations of Computer Science, 1996. Arge, L., Samoladas, V., and Vitter, J. S. 1999b Two-dimensional indexability and optimal range search indexing. In Proceedings of the ACMConference Principles of Database Systems (Philadelphia, May–June), Vol. 18, 346–357, 1999.

3. Cache Oblivious Data Structures M. Frigo, C.E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. 40th IEEE Symp. on Foundations of Computer Science (FOCS 99), pages 285-297, 1999. M. A. Bender, E. Demaine, and M. Farach-Colton.“Cache Oblivious B-Trees" Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS), pages 399-409, 2000. Gerth Stψlting Brodal and Rolf Fagerberg, Funnel Heap – A Cache Oblivious Priority Queue, In Proc. 13th Annual International Symposium on Algorithms and Computation, volume 2518 of Lecture Notes in Computer Science, pages 219-228. Springer Verlag, Berlin, 2002 Gianni Franceschini, Roberto Grossi, J. Ian Munro, and Linda Pagli. Implicit B-trees: A New Data Structure for the Dictionary Problem. Journal of Computer and System Sciences, special issue of the 43th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2004. Gianni Franceschini and Roberto Grossi. Implicit dictionaries supporting searches and amortized updates in O(log n loglog n). In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 670-678. SIAM, 2003.

4. External Memory Algorithms A. Broder and M. Henzinger. Algorithmic Aspects of Information Retrieval on the Web, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende. M.Najork, A. Heydon, High Performance Web Crawling, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende. W. Aiello, F. Chung, L. Lu, Random Evolution in Massive Graphs. Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende. O. Goldreich, Property Testing in Massive Graphs, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende. R. Baeza-Yates, A. Moffat, G. Navarro, Searching Large Text Collections, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende. J. Dula, F. Lopez, Data Envelopment Analysis (DEA) in Massive Data Sets, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende. P. Bradley, O. Mangasarian, D. Musicant, Optimization Methods in Massive Data Sets, in Massive Data Sets, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende. F. Murtagh, Clustering in Massive Data Sets, in Massive Data Sets, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende. M. Riedewald, D. Agrawal, A. Abbadi, Managing and Analyzing Massive Data Sets with Data Cubes, in Massive Data Sets, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende. M. Goodchild, K. Clarke, Data Quality in Massive Data Sets in Massive Data Sets, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende. T. Johnson, Data Warehousing, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende. Q. Ma, M. Wang, J. Gatliker, Mining Biomolecular Data Using Background Knowledge and Artificial Neural Networks, Handbook of Massice Data Sets, ed. Abello, Pardalos, Resende.