A simple algorithm for finding frequent elements in streams and bags

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Richard M. Karp International Computer Science Institute and University of California, Berkeley, California
Scott Shenker International Computer Science Institute and University of California, Berkeley, California
Christos H. Papadimitriou University of California, Berkeley, California
Published in:
· Journal
ACM Transactions on Database Systems (TODS) TODS Homepage archive
Volume 28 Issue 1, March 2003
Pages 51 - 55
ACM New York, NY, USA
table of contents doi>10.1145/762471.762473
A simple algorithm for finding frequent elements in streams and bags Published by ACM 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 15
· Downloads (12 Months): 103
· Downloads (cumulative): 2,354
· Citation Count: 119


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