Mehlhorn, Kurt; Meyer, Ulrich External-memory breadth-first search with sublinear I/O. (English) Zbl 1019.68595 Möhring, Rolf (ed.) et al., Algorithms - ESA 2002. 10th annual European symposium, Rome, Italy, September 17-21, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2461, 723-735 (2002). MSC: 68R10 68T20 05C85 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{U. Meyer}, Lect. Notes Comput. Sci. 2461, 723--735 (2002; Zbl 1019.68595) Full Text: Link
Crauser, A.; Ferragina, P.; Mehlhorn, K.; Meyer, U.; Ramos, E. A. Randomized external-memory algorithms for line segment intersection and other geometric problems. (English) Zbl 1074.68669 Int. J. Comput. Geom. Appl. 11, No. 3, 305-337 (2001). MSC: 68W20 68U05 PDFBibTeX XMLCite \textit{A. Crauser} et al., Int. J. Comput. Geom. Appl. 11, No. 3, 305--337 (2001; Zbl 1074.68669) Full Text: DOI
Crauser, A.; Ferragina, P.; Mehlhorn, K.; Meyer, U.; Ramos, E. A. I/O-optimal computation of segment intersections. (English) Zbl 0952.68149 Abello, James M. (ed.) et al., External memory algorithms. DIMACS workshop external memory algorithms and visualization, Rutgers Univ., New Brunswick, NJ, USA, May 20-22, 1998. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 50, 131-138 (1999). MSC: 68U05 68W05 PDFBibTeX XMLCite \textit{A. Crauser} et al., DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 50, 131--138 (1999; Zbl 0952.68149)
Crauser, A.; Mehlhorn, K.; Meyer, U.; Sanders, P. A parallelization of Dijkstra’s shortest path algorithm. (English) Zbl 0912.05056 Brim, Luboš (ed.) et al., Mathematical foundations of computer science 1998. 23rd international symposium, MFCS ’98. Brno, Czech Republic, August 24–28, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1450, 722-731 (1998). Reviewer: A.Kapralski (Kraków) MSC: 05C85 05C80 68R10 PDFBibTeX XMLCite \textit{A. Crauser} et al., Lect. Notes Comput. Sci. 1450, 722--731 (1998; Zbl 0912.05056)