OpenAlex
PricingAboutJobs
Log inGet started
Work

Finding frequent items in data streams

HTML

Year: 2003
Type: article
Source: Theoretical Computer Science
DOI: 10.1016/s0304-3975(03)00400-6
Authors: Moses Charikar, Kevin Chen, Martin Farach-Colton
Institutions: Princeton University, University of California, Berkeley, Rutgers, The State University of New Jersey
Language: English

Topic: Advanced Database Systems and Queries
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Keywords: data streams, count sketch, one-pass algorithms, memory-efficient algorithms, frequency estimation, two-pass algorithm

Open Access status: bronze
OpenAlex ID: W1493892051
FWCI: 68.57
Cites: 21
Cited by: 1,484
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms