I/O-Efficient Well-Separated Pair Decomposition and Applications
S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.
Download
No fulltext has been uploaded.
Conference Paper
| Published
| English
Author
Govindarajan, Sathish;
Lukovszki, Tamas;
Maheshwari, Anil;
Zeh, Norbert
Publishing Year
Proceedings Title
Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS
Page
585-614
LibreCat-ID
Cite this
Govindarajan S, Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Well-Separated Pair Decomposition and Applications. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS. ; 2000:585-614. doi:10.1007/s00453-005-1197-3
Govindarajan, S., Lukovszki, T., Maheshwari, A., & Zeh, N. (2000). I/O-Efficient Well-Separated Pair Decomposition and Applications. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS (pp. 585–614). https://doi.org/10.1007/s00453-005-1197-3
@inproceedings{Govindarajan_Lukovszki_Maheshwari_Zeh_2000, title={I/O-Efficient Well-Separated Pair Decomposition and Applications}, DOI={10.1007/s00453-005-1197-3}, booktitle={Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS}, author={Govindarajan, Sathish and Lukovszki, Tamas and Maheshwari, Anil and Zeh, Norbert}, year={2000}, pages={585–614} }
Govindarajan, Sathish, Tamas Lukovszki, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 585–614, 2000. https://doi.org/10.1007/s00453-005-1197-3.
S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Well-Separated Pair Decomposition and Applications,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.
Govindarajan, Sathish, et al. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614, doi:10.1007/s00453-005-1197-3.
Google Scholar