Algorithms - ESA 2003
From MaRDI portal
Publication:5897280
DOI10.1007/B13632zbMath1266.68236OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897280
Marianne Durand, Philippe Flajolet
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Related Items (12)
Approximate distributed top-\(k\) queries ⋮ A Statistical Analysis of Probabilistic Counting Algorithms ⋮ A note on efficient aggregate queries in sensor networks ⋮ Unnamed Item ⋮ Streaming techniques and data aggregation in networks of tiny artefacts ⋮ Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. ⋮ Measuring the impact of MVC attack in large complex networks ⋮ Give me some slack: efficient network measurements ⋮ Sampling for passive internet measurement: a review ⋮ Order statistics and estimating cardinalities of massive data sets ⋮ I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs ⋮ Two improved range-efficient algorithms for \(F_0\) estimation
This page was built for publication: Algorithms - ESA 2003
