Seminars Sorted by Series
Computer Science/Discrete Mathematics Seminar I
Apr
21
2014
Computer Science/Discrete Mathematics Seminar I
True Randomness: Its Origin and Expansion
Yaoyun Shi
11:15am|S-101
Apr
28
2014
Computer Science/Discrete Mathematics Seminar I
Search games and Optimal Kakeya Sets
Yuval Peres
11:15am|S-101
Sep
22
2014
Computer Science/Discrete Mathematics Seminar I
Colouring graphs with no odd holes
Paul Seymour
11:15am|S-101
Sep
29
2014
Computer Science/Discrete Mathematics Seminar I
Breaking \(e^n\) barrier for deterministic poly-time approximation of the permanent and settling Friedland's conjecture on the Monomer-Dimer Entropy
11:15am|S-101
Oct
06
2014
Computer Science/Discrete Mathematics Seminar I
The communication complexity of distributed subgraph detection
Rotem Oshman
11:15am|S-101
Oct
13
2014
Computer Science/Discrete Mathematics Seminar I
Cool with a Gaussian: an \(O^*(n^3)\) volume algorithm
Santosh Vempala
11:15am|West Bldg. Lect. Hall
Oct
20
2014
Oct
27
2014
Computer Science/Discrete Mathematics Seminar I
Discretization and quantitative differentiation
11:15am|S-101
Nov
03
2014
Computer Science/Discrete Mathematics Seminar I
Information percolation for the Ising model
Eyal Lubetzky
11:15am|S-101
Nov
10
2014
Computer Science/Discrete Mathematics Seminar I
Talagrand's convolution conjecture and geometry via coupling
11:15am|S-101
Nov
17
2014
Computer Science/Discrete Mathematics Seminar I
Mutation as a computational event
Adi Livnat
11:15am|S-101
Nov
24
2014
Computer Science/Discrete Mathematics Seminar I
Computational fair division
Ariel Procaccia
11:15am|S-101
Dec
01
2014
Dec
08
2014
Computer Science/Discrete Mathematics Seminar I
Area Laws and the complexity of quantum states
Umesh Vazirani
11:15am|S-101
Dec
08
2014
Computer Science/Discrete Mathematics Seminar I
Area Laws and the Complexity of Quantum States
Umesh Vazirani
11:15am|Simonyi Hall, Room 101
Jan
26
2015
Computer Science/Discrete Mathematics Seminar I
Publicly-verifiable non-interactive arguments for delegating computation
11:15am|S-101
Feb
02
2015
Computer Science/Discrete Mathematics Seminar I
On monotonicity testing and boolean isoperimetric type theorems
11:15am|S-101
Feb
09
2015
Computer Science/Discrete Mathematics Seminar I
Quantum computing with noninteracting particles
Alex Arkhipov
11:15am|S-101
Feb
09
2015
Computer Science/Discrete Mathematics Seminar I
Quantum Computing with Noninteracting Particles
Alex Arkhipov
11:15am|Simonyi Hall, Room 101
Feb
16
2015
Computer Science/Discrete Mathematics Seminar I
2-Server PIR with sub-polynomial communication
Sivakanth Gopi
11:15am|S-101
Feb
23
2015
Computer Science/Discrete Mathematics Seminar I
Lower bounds for clique vs. independent set
11:15am|S-101
Mar
02
2015
Computer Science/Discrete Mathematics Seminar I
Effective-resistance-reducing flows, spectrally thin trees and asymmetric TSP
Shayan Oveis Gharan
12:30pm|S-101
Mar
09
2015
Computer Science/Discrete Mathematics Seminar I
Strong contraction and influences in tail spaces
Elchanan Mossel
11:15am|West Bldg. Lect. Hall
Mar
16
2015
Computer Science/Discrete Mathematics Seminar I
Tight hardness of the non-commutative Grothendieck problem
11:15am|S-101
Mar
23
2015
Computer Science/Discrete Mathematics Seminar I
Random walks that find perfect objects and the Lovász local lemma
Dimitris Achlioptas
11:15am|S-101
Mar
30
2015
Computer Science/Discrete Mathematics Seminar I
Intelligent learning: similarity control and knowledge transfer
Vladimir Vapnik
11:15am|S-101
Apr
06
2015
Computer Science/Discrete Mathematics Seminar I
Natural algorithms for flow problems
Nisheeth Vishnoi
11:15am|S-101
Apr
13
2015
Computer Science/Discrete Mathematics Seminar I
A new approach to the sensitivity conjecture
11:15am|S-101
Sep
21
2015
Computer Science/Discrete Mathematics Seminar I
Explicit two-source extractors and resilient functions I
11:15am|S-101
Sep
28
2015
Computer Science/Discrete Mathematics Seminar I
Ramsey numbers of degenerate graphs
Choongbum Lee
11:15am|S-101
Oct
05
2015
Computer Science/Discrete Mathematics Seminar I
Is optimization computationally equivalent to online learning?
Elad Hazan
11:15am|West Bldg. Lect. Hall
Oct
12
2015
Computer Science/Discrete Mathematics Seminar I
Factors of polynomials of low individual degree
Rafael Oliveira
11:15am|S-101
Oct
19
2015
Computer Science/Discrete Mathematics Seminar I
No seminar today: FOCS
No seminar today: FOCS
11:15am|S-101
Oct
26
2015
Computer Science/Discrete Mathematics Seminar I
Random words, longest increasing subsequences, and quantum PCA
John Wright
11:15am|S-101
Nov
02
2015
Computer Science/Discrete Mathematics Seminar I
Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs I
11:15am|S-101
Nov
09
2015
Computer Science/Discrete Mathematics Seminar I
Cutting plane method: A faster algorithm for many (combinatorial) optimization problems
Yin Tat Lee
11:15am|S-101
Nov
16
2015
Computer Science/Discrete Mathematics Seminar I
How quaternion algebras over number fields are useful for creating compiler for a quantum computer?
Vadym Kliuchnikov
11:15am|S-101
Nov
23
2015
Nov
30
2015
Computer Science/Discrete Mathematics Seminar I
Lower bounds on the size of semidefinite programming relaxations
11:15am|S-101
Dec
07
2015
Computer Science/Discrete Mathematics Seminar I
Bias vs low rank of polynomials with applications to list decoding and effective algebraic geometry
Abhishek Bhowmick
11:15am|West Bldg. Lect. Hall
Dec
14
2015
Computer Science/Discrete Mathematics Seminar I
Toward the KRW conjecture: cubic lower bounds via communication complexity
11:15am|S-101
Jan
25
2016
Computer Science/Discrete Mathematics Seminar I
Seminar cancelled on account of snow.
Seminar cancelled on account of snow.
11:15am|S-101
Feb
01
2016
Computer Science/Discrete Mathematics Seminar I
Constant-round interactive-proofs for delegating computations
Ron Rothblum
11:15am|S-101
Feb
08
2016
Computer Science/Discrete Mathematics Seminar I
Bipartite perfect matching is in quasi-NC
Stephen Fenner
11:15am|S-101
Feb
22
2016
Computer Science/Discrete Mathematics Seminar I
The deterministic communication complexity of approximate fixed point
Omri Weinstein
11:15am|S-101
Feb
29
2016
Computer Science/Discrete Mathematics Seminar I
Graph isomorphism in quasipolynomial time I
László Babai
11:15am|Wolfensohn Hall
Mar
07
2016
Computer Science/Discrete Mathematics Seminar I
Almost optimal sum of squares lower bound for planted clique
11:15am|S-101
Mar
14
2016
Computer Science/Discrete Mathematics Seminar I
Lower bounds for homogeneous depth-5 arithmetic circuits over finite fields
Mrinal Kumar
11:15am|S-101
Mar
21
2016
Computer Science/Discrete Mathematics Seminar I
Polynomial-time tensor decompositions via sum-of-squares
Tengyu Ma
11:15am|S-101
Mar
28
2016
Computer Science/Discrete Mathematics Seminar I
A local central limit theorem for triangles in a random graph
11:15am|West Building Lecture Hall