{"language":[{"iso":"eng"}],"publication_status":"published","date_created":"2020-09-03T13:26:01Z","type":"conference","user_id":"15415","year":"2001","author":[{"full_name":"Lukovszki, Tamás","last_name":"Lukovszki","first_name":"Tamás"},{"first_name":"Anil","last_name":"Maheshwari","full_name":"Maheshwari, Anil"},{"full_name":"Zeh, Norbert","last_name":"Zeh","first_name":"Norbert"}],"department":[{"_id":"63"}],"status":"public","citation":{"chicago":"Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” In Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001. https://doi.org/10.1007/3-540-45294-x_21.","mla":"Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001, doi:10.1007/3-540-45294-x_21.","apa":"Lukovszki, T., Maheshwari, A., & Zeh, N. (2001). I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS. https://doi.org/10.1007/3-540-45294-x_21","ieee":"T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems,” in Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.","short":"T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.","ama":"Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS. ; 2001. doi:10.1007/3-540-45294-x_21","bibtex":"@inproceedings{Lukovszki_Maheshwari_Zeh_2001, title={I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems}, DOI={10.1007/3-540-45294-x_21}, booktitle={Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS}, author={Lukovszki, Tamás and Maheshwari, Anil and Zeh, Norbert}, year={2001} }"},"title":"I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems","publication":"Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS","doi":"10.1007/3-540-45294-x_21","_id":"18964","date_updated":"2022-01-06T06:53:55Z","publication_identifier":{"isbn":["9783540430025","9783540452942"],"issn":["0302-9743"]}}