New Upper and Lower Bounds on Approximate Counting

New Upper and Lower Bounds on Approximate Counting

Explore new upper and lower bounds for approximate counting in this 48-minute lecture by Jelani Nelson at the Simons Institute. Delve into the study of approximate counting, first introduced by Morris in the 1970s, and examine matching upper and lower bounds for this problem. Investigate the amortized space complexity of maintaining an array of approximate counters while minimizing total memory. Learn about the findings from two joint works involving collaborators Ishaq Aden-Ali, Yanjun Han, and Huacheng Yu. Gain insights into the Extroverted Sublinear Algorithms research area and its applications in computer science and data analysis.