Seminars & Colloquia Calendar

Time: 11:00AM  On the expressiveness of comparison queries  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Monotonicity problems in graph theory  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Matrix Sketching over Streams  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Explicit Binary Tree Codes with Polylogarithmic Size Alphabet  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Some closure results for polynomial factorization  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Complete Derandomization of Identity Testing of ReadOnce Formulas  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Set Cover in Sublinear Time  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Explicit twosource extractors for nearlogarithmic minentropy  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Hitting Sets with NearOptimal Error for ReadOnce Branching Programs  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  General Strong Polarization  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Kmeans clustering with optimization  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Taking Control by Convex Optimization  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Between Shannon and Hamming: the impact of delay on communication capacity  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Set Cover in Sublinear Time  Location: DIMACS Theory of Computing Seminar CoRE 301

Time: 11:00AM  Approximating the Edit Distance to within a Constant Factor in Truly Subquadratic Time  Location: DIMACS Theory of Computing Seminar CoRE Bldg, Room 301, Rutgers University, Busch Campus, Piscataway, NJ