SIGN IN
SIGN UP
The space complexity of approximating the frequency moments
Full Text:
PDF
Get this Article
Authors:
Noga Alon
AT&T Bell Labs, Murray Hill, NJ and Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel
Yossi Matias
AT&T Bell Labs, Murray Hill, NJ
Mario Szegedy
AT&T Bell Labs, Murray Hill, NJ
Published in:
· Proceeding
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Pages 20-29
ACM
New York, NY
, USA
©1996
table of contents
ISBN:0-89791-785-5
doi>
10.1145/237814.237823
1996 Article
Bibliometrics
· Downloads (6 Weeks): 28
· Downloads (12 Months): 268
· Downloads (cumulative): 3,404
· Citation Count: 259
Tools and Resources
Buy this Article
Recommend the ACM DL
to your organization
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC '17
Share:
|
Author Tags
complexity classes
computational complexity and cryptography
probability and statistics
theory
verification
Contact Us
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder