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