1. Michael T. Goodrich and Michael Mitzenmacher. Invertible bloom lookup tables . In Allerton Conference on Communication, Control, and Computing , 2011 . Michael T. Goodrich and Michael Mitzenmacher. Invertible bloom lookup tables. In Allerton Conference on Communication, Control, and Computing, 2011.
2. Yuliang Li , Rui Miao , Changhoon Kim , and Minlan Yu. Lossradar : Fast detection of lost packets in data center networks . In ACM International on Conference on emerging Networking EXperiments and Technologies (CoNext) , 2016 . Yuliang Li, Rui Miao, Changhoon Kim, and Minlan Yu. Lossradar: Fast detection of lost packets in data center networks. In ACM International on Conference on emerging Networking EXperiments and Technologies (CoNext), 2016.
3. Yuliang Li , Rui Miao , Changhoon Kim , and Minlan Yu. Flowradar : A better netflow for data centers . In USENIX Symposium on Networked Systems Design and Implementation (NSDI) , 2016 . Yuliang Li, Rui Miao, Changhoon Kim, and Minlan Yu. Flowradar: A better netflow for data centers. In USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2016.
4. Michael Mitzenmacher and George Varghese . Biff (Bloom filter) codes : Fast error correction for large data sets . In IEEE International Symposium on Information Theory (ISIT) , 2012 . Michael Mitzenmacher and George Varghese. Biff (Bloom filter) codes: Fast error correction for large data sets. In IEEE International Symposium on Information Theory (ISIT), 2012.
5. David Eppstein , Michael T. Goodrich , Frank Uyeda , and George Varghese . What's the difference? : Efficient set reconciliation without prior context . In ACM SIGCOMM , 2011 . David Eppstein, Michael T. Goodrich, Frank Uyeda, and George Varghese. What's the difference?: Efficient set reconciliation without prior context. In ACM SIGCOMM, 2011.