Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters

DOI10.1007/978-3-540-73951-7_55zbMATH Open1209.68155OpenAlexW1553302965MaRDI QIDQ3603564FDOQ3603564

Authors: David Eppstein, Michael T. Goodrich 

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_55

Recommendations

• Algorithms and Computation
• scientific article; zbMATH DE number 2019620
• Finding a Duplicate and a Missing Item in a Stream
• An optimal bloom filter replacement
• Optimal approximations of the frequency moments of data streams

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Cited In (4)

• Deterministic \(k\)-set structure
• Simple multi-party set reconciliation
• Title not available (Why is that?)
• Optimal Las Vegas reduction from one-way set reconciliation to error correction

This page was built for publication: Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603564)