Low complexity set reconciliation using Bloom filters

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Magnus Skjegstad University of Oslo Graduate Center, Kjeller, Norway
Torleiv Maseng Norwegian Defense Research Establishment, Kjeller, Norway
Published in:
· Proceeding
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Pages 33-41
ACM New York, NY, USA ©2011
table of contents ISBN: 978-1-4503-0779-6 doi>10.1145/1998476.1998483
Low complexity set reconciliation using Bloom filters Published by ACM 2011 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 30
· Downloads (cumulative): 79
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder