The frequent items problem, under polynomial decay, in the streaming model (vol 411, pg 3048, 2010)

G Feigenblat; O Itzhaki; E Porat

doi:https://doi.org/10.1016/j.tcs.2016.09.001

The frequent items problem, under polynomial decay, in the streaming model (vol 411, pg 3048, 2010)

G Feigenblat, O Itzhaki, E Porat

Department of Computer Science

Bar-Ilan University

Research output: Contribution to journal › Article › peer-review

Original language	American English
Pages (from-to)	116-116
Number of pages	1
Journal	Theoretical Computer Science
Volume	648
DOIs	https://doi.org/10.1016/j.tcs.2016.09.001
State	Published - 4 Oct 2016

Access to Document

https://doi.org/10.1016/j.tcs.2016.09.001

Cite this

@article{a99581c8edc143198947aae240a2f6b3,

title = "The frequent items problem, under polynomial decay, in the streaming model (vol 411, pg 3048, 2010)",

author = "G Feigenblat and O Itzhaki and E Porat",

year = "2016",

month = oct,

day = "4",

doi = "https://doi.org/10.1016/j.tcs.2016.09.001",

language = "American English",

volume = "648",

pages = "116--116",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

}

TY - JOUR

T1 - The frequent items problem, under polynomial decay, in the streaming model (vol 411, pg 3048, 2010)

AU - Feigenblat, G

AU - Itzhaki, O

AU - Porat, E

PY - 2016/10/4

Y1 - 2016/10/4

UR - https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=barilanwos&SrcAuth=WosAPI&KeyUT=WOS:000383929500010&DestLinkType=FullRecord&DestApp=WOS

U2 - https://doi.org/10.1016/j.tcs.2016.09.001

DO - https://doi.org/10.1016/j.tcs.2016.09.001

M3 - Article

SN - 0304-3975

VL - 648

SP - 116

EP - 116

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

The frequent items problem, under polynomial decay, in the streaming model (vol 411, pg 3048, 2010)

Access to Document

Other files and links

Cite this