Go to the corresponding LIPIcs Volume Portal 
Braverman, Vladimir ; Grigorescu, Elena ; Lang, Harry ; Woodruff, David P. ; Zhou, Samson
pdfformat: 

@InProceedings{braverman_et_al:LIPIcs:2018:9411, author = {Vladimir Braverman and Elena Grigorescu and Harry Lang and David P. Woodruff and Samson Zhou}, title = {{Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {7:17:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770859}, ISSN = {18688969}, year = {2018}, volume = {116}, editor = {Eric Blais and Klaus Jansen and Jos{\'e} D. P. Rolim and David Steurer}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9411}, URN = {urn:nbn:de:0030drops94118}, doi = {10.4230/LIPIcs.APPROXRANDOM.2018.7}, annote = {Keywords: Streaming algorithms, sliding windows, heavy hitters, distinct elements} }
Keywords:  Streaming algorithms, sliding windows, heavy hitters, distinct elements  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)  
Issue Date:  2018  
Date of publication:  02.08.2018 