I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems

FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45294-x_21 ◽

2001 ◽

pp. 244-255 ◽

Cited By ~ 1

Author(s):

Tamás Lukovszki ◽

Anil Maheshwari ◽

Norbert Zeh

Download Full-text