Abstract
We study the straggler identification problem, in which an algorithm must determine the identities of the remaining members of a set after it has had a large number of insertion and deletion operations performed on it, and now has relatively few remaining members. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Eppstein, D., & Goodrich, M. T. (2007). Space-efficient straggler identification in round-trip data streams via Newton’s identities and invertible bloom filters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4619 LNCS, pp. 637–648). Springer Verlag. https://doi.org/10.1007/978-3-540-73951-7_55
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
