Phase transition in count approximation by count-min sketch with conservative updates

DOI10.1007/978-3-031-30448-4_17arXiv2203.15496MaRDI QIDQ6057335

Gregory Kucherov, Éric Fusy

Publication date: 4 October 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.15496

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• The phase transition in a random hypergraph
• Counting connected graphs inside-out
• Finding frequent items in data streams
• Introduction to Random Graphs
• An improved data stream summary: the count-min sketch and its applications
• Cuckoo hashing
• Cores in random hypergraphs and Boolean formulas
• Local Limit Theorems for the Giant Component of Random Hypergraphs

This page was built for publication: Phase transition in count approximation by count-min sketch with conservative updates