CSE Colloquium: Approximate Algebraic Structure in Computer Science

Zoom Information: Join from PC, Mac, Linux, iOS or Android: https://psu.zoom.us/j/91336542481?pwd=M1ZhVTY1KytHWGhYMkQ1eXczWS83Zz09 Password: 928034 

or iPhone one-tap (US Toll): +16468769923,91336542481# or +13017158592,91336542481# 

or Telephone: Dial: +1 646 876 9923 (US Toll) +1 301 715 8592 (US Toll) +1 312 626 6799 (US Toll) +1 669 900 6833 (US Toll) +1 253 215 8782 (US Toll) +1 346 248 7799 (US Toll) Meeting ID: 913 3654 2481 Password: 928034 International numbers available: https://psu.zoom.us/u/audaHYdEV 

Abstract: This talk is about approximate algebraic structure. We show how ideas originally developed in the 90’s in the contexts of streaming algorithms and property testing has developed to a powerful theory that is the core of several important problems in mathematics and computer science in areas such as streaming algorithms and property testing, communication complexity, additive number theory, PCP constructions, locally decodable codes, approximation algorithms, etc. 

Biography: Kaave Hosseini has received his PhD in Computer Science at UC San Diego under supervision of Shachar Lovett. He is currently a Postdoctoral Associate in department of Mathematical Sciences at Carnegie Mellon University. His research interests are in Theoretical Computer Science and Additive Combinatorics.