Algorithms and Data Structures for External Memory

References 167
[245] V. Mäkinen, G. Navarro, and K. Sadakane, “Advantages of backward searching
— efficient secondary memory and distributed implementation of compressed
suffix arrays,” in Proceedings of the International Symposium on Algorithms
and Computation, pp. 681–692, Springer-Verlag, 2004.
[246] U. Manber and G. Myers, “Suffix arrays: A new method for on-line string
searches,” SIAM Journal on Computing, vol. 22, pp. 935–948, October
1993.
[247] U. Manber and S. Wu, “GLIMPSE: A tool to search through entire file systems,”
in Proceedings of the Winter USENIX Conference, (USENIX Association,
ed.), pp. 23–32, San Francisco: USENIX, January 1994.
[248] G. N. N. Martin, “Spiral storage: Incrementally augmentable hash addressed
storage,” Technical Report CS-RR-027, University of Warwick, March 1979.
[249] Y. Matias, E. Segal, and J. S. Vitter, “Efficient bundle sorting,” in Proceedings
of the ACM-SIAM Symposium on Discrete Algorithms, pp. 839–848, San
Francisco: ACM Press, January 2000.
[250] E. M. McCreight, “A space-economical suffix tree construction algorithm,”
Journal of the ACM, vol. 23, no. 2, pp. 262–272, 1976.
[251] E. M. McCreight, “Priority Search Trees,” SIAM Journal on Computing,
vol. 14, pp. 257–276, May 1985.
[252] K. Mehlhorn and U. Meyer, “External-memory breadth-first search with
sublinear I/O,” in Proceedings of the European Symposium on Algorithms,
pp. 723–735, Springer-Verlag, 2002.
[253] H. Mendelson, “Analysis of extendible hashing,” IEEE Transactions on Software
Engineering, vol. SE-8, pp. 611–619, November 1982.
[254] U. Meyer, “External memory BFS on undirected graphs with bounded
degree,” in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms,
pp. 87–88, Washington, DC: ACM Press, January 2001.
[255] U. Meyer, “On dynamic breadth-first search in external-memory,” in Proceedings
of the Symposium on Theoretical Aspects of Computer Science,
(Schloss Dagstuhl, Germany), pp. 551–560, Internationales Begegnungs- und
Forschungszentrum für Informatik, 2008.
[256] U. Meyer, “On trade-offs in external-memory diameter approximation,” in
Proceedings of the Scandinavian Workshop on Algorithm Theory, (Gothenburg,
Sweden), Springer-Verlag, July 2008.
[257] U. Meyer, P. Sanders, and J. Sibeyn, eds., Algorithms for Memory Hierarchies.
Berlin: Springer-Verlag, 2003.
[258] U. Meyer and N. Zeh, “I/O-efficient undirected shortest paths,” in Proceedings
of the European Symposium on Algorithms, pp. 435–445, Springer-Verlag,
2003.
[259] U. Meyer and N. Zeh, “I/O-efficient undirected shortest paths with unbounded
weights,” in Proceedings of the European Symposium on Algorithms, Springer-
Verlag, 2006.
[260] C. Mohan, “ARIES/KVL: A key-value locking method for concurrency control
of multiaction transactions on B-tree indices,” in Proceedings of the International
Conference on Very Large Databases, pp. 392–405, August 1990.