Back to Results
First PageMeta Content
Computational complexity theory / Probabilistic complexity theory / Analysis of algorithms / Randomized algorithm / Communication complexity / Factorial / Logarithm / SL / Random self-reducibility / Theoretical computer science / Mathematics / Applied mathematics


The space complexity of approximating the frequency moments Noga Alon † Yossi Matias
Add to Reading List

Document Date: 2002-02-21 20:13:33


Open Document

File Size: 241,12 KB

Share Result on Facebook

Company

Bell Laboratories / AT&T Bell Labs / Yi / AT&T Research Labs / /

Country

United States / Israel / /

/

Facility

Tel Aviv University / /

IndustryTerm

deterministic algorithms / deterministic protocol / randomized approximation algorithm / present algorithm / approximation algorithm / space-efficient randomized algorithms / randomized algorithm / binary inner products / database applications / space efficient randomized algorithms / communication protocol / statistical applications / computing / randomized approximation algorithms / parallel database applications / /

Organization

Israel Science Foundation / Department of Computer Science / A. It / Department of Mathematics / Beverly Sackler Faculty of Exact Sciences / Tel Aviv University / Tel Aviv / /

Person

Raymond Sackler / Murray Hill / Mario Szegedy / Beverly Sackler / Yossi Matias / /

Position

vp / random vector vp / /

Product

Pentax K-x Digital Camera / /

ProvinceOrState

New Jersey / /

PublishedMedium

Theory of Computing / /

Technology

previous algorithm / present algorithm / randomized algorithm / known randomized algorithms / deterministic protocol / randomized approximation algorithm / approximation algorithm / communication protocol / Flajolet-Martin algorithm / randomized approximation algorithms / /

SocialTag