Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Attend this computer science seminar exploring groundbreaking research on static data structures and cell probe lower bounds. Learn about a novel method for proving lower bounds in Yao's classical cell-probe model that achieves the strongest known results for any explicit problem in this domain, delivering quadratically stronger bounds for space as a function of time while breaking a decades-old barrier. Discover the innovative connection established between the static cell probe model and NC0 generators, concepts extensively studied in cryptography and range avoidance research. Gain insights into this collaborative work with Toniann Pitassi from Columbia University and Russell Impagliazzo from UC San Diego, presented as part of the Computer Science/Discrete Mathematics Seminar series at the Institute for Advanced Study.
