Space-efficient straggler identification in round-trip data streams via newton's identities and invertible bloom filters

Authors:
David Eppstein;Michael T. Goodrich
Affiliations:
Dept. of Computer Science, Univ. of California, Irvine;Dept. of Computer Science, Univ. of California, Irvine
Venue:
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Year:
2007

Citing 17
Cited 1

A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Randomized algorithms

Randomized algorithms
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels

Journal of the ACM (JACM)
Summary cache: a scalable wide-area web cache sharing protocol

IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Group Testing Problems with Sequences in Experimental Molecular Biology

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
What's hot and what's not: tracking most frequent items dynamically

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Deterministic k-set structure

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient parallel algorithms for dead sensor diagnosis and multiple access channels

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
An improved construction for counting bloom filters

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Estimating the multiplicities of conflicts in multiple access channels

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
On the false-positive rate of Bloom filters

Information Processing Letters
Generalized framework for selectors with applications in optimal group testing

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Improved combinatorial group testing for real-world problem sizes

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Tree algorithms for packet broadcast channels

IEEE Transactions on Information Theory
Bounds on the performance of protocols for a multiple-access broadcast channel

IEEE Transactions on Information Theory
Set reconciliation with nearly optimal communication complexity

IEEE Transactions on Information Theory

Deterministic K-set structure

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.