@article{06a5c246441347f685d84c64e5f8c1a0,
title = "Dynamic deferred data structuring",
abstract = "Let S be a set of n reals. We show how to process on-line a sequence of r membership queries, insertions and deletions in time O(r log(n + r) + (n + r) log r). This is optimal in the binary comparison model.",
keywords = "Data structure, deferred data structure, dictionary problem, on-line, weight-balanced trees",
author = "Yu-Tai Ching and Kurt Mehlhorn and Smid, {Michiel H.M.}",
year = "1990",
month = jun,
day = "15",
doi = "10.1016/0020-0190(90)90171-S",
language = "English",
volume = "35",
pages = "37--40",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier B.V.",
number = "1",
}