YoVDO

New Upper and Lower Bounds on Approximate Counting

Offered By: Simons Institute via YouTube

Tags

Sublinear Algorithms Courses Data Structures Courses Space Complexity Courses Probabilistic Data Structures Courses

Course Description

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

Related Courses

Intro to Computer Science
University of Virginia via Udacity Design of Computer Programs
Stanford University via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Algorithms, Part II
Princeton University via Coursera