@inproceedings{54faa6f1b1c64bae99e15519da1e34d5,
title = "Kinetic dictionaries : How to shoot a moving target",
abstract = "A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point q whether q¿¿¿S. We study trade-offs between the worst-case query time in a kinetic dictionary and the total cost of maintaining it during the motions of the points.",
author = "{Berg, de}, M.",
year = "2003",
language = "English",
isbn = "3-540-20064-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "172--183",
editor = "{Di Battista}, G. and U. Zwick",
booktitle = "Algorithms - ESA 2003 (Proceedings 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003)",
address = "Germany",
}