A Nearly Linear Time Algorithm

Piotr Indyk (MIT) https://simons.berkeley.edu/talks/piotr-indyk-mit-2023-10-11 Sketching and

... in

Alina Ene, Boston University https://simons.berkeley.edu/talks/alina-ene-09-13-17 Discrete Optimization via Continuous ...

Alexandr Andoni; Negev Shekel Nosatzki Affiliations: Columbia University; Columbia University https://arxiv.org/abs/2005.07678.

Overview and proof of a

Jonathan Kelner Massachusetts Institute of Technology February 24, 2014 In this talk, I will describe a new framework for ...

STOC 2021 -

Jon Kelner, Massachusetts Institute of Technology Fast

A talk given at SWAT 2020. Paper: https://arxiv.org/abs/1908.11829.

We give the first

Ronitt Rubinfeld, Massachusetts Institute of Technology Succinct Data Representations and Applications ...

Comparison-based sorting has an Omege(n log n) lower bound. I illustrate decision trees by the example of insertion sort, and ...

Speaker : Sushant Sachdeva Affiliation : University of Toronto Abstract : We give the first