Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

New Upper and Lower Bounds on Approximate Counting

Simons Institute via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

New upper and lower bounds on approximate counting

Taught by

Simons Institute

Reviews

Start your review of New Upper and Lower Bounds on Approximate Counting

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.