Seminars Sorted by Series
Computer Science/Discrete Mathematics Seminar I
Mar
04
2024
Computer Science/Discrete Mathematics Seminar I
Explicit SoS Lower Bounds from High Dimensional Expanders
Max Hopkins
11:00am|Simonyi 101 and Remote Access
Mar
11
2024
Computer Science/Discrete Mathematics Seminar I
Sparsification of Gaussian Processes
Anindya De
11:00am|Simonyi 101 and Remote Access
Mar
18
2024
Computer Science/Discrete Mathematics Seminar I
Computationally Sound Proofs of Network Properties
Rotem Oshman
11:00am|Simonyi 101 and Remote Access
Apr
01
2024
Computer Science/Discrete Mathematics Seminar I
Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries
Huacheng Yu
11:00am|Simonyi 101 and Remote Access
Apr
08
2024
Computer Science/Discrete Mathematics Seminar I
Polynomial Capacity and its Applications: To TSP and Beyond
Jonathan Leake
11:00am|Simonyi 101 and Remote Access
Apr
15
2024
Computer Science/Discrete Mathematics Seminar I
Graphs, CSPs and Codes
Madhu Sudan
11:00am|Simonyi 101 and Remote Access
Apr
22
2024
Computer Science/Discrete Mathematics Seminar I
Additive Combinatorics Without Groups
Huy Tuan Pham
11:00am|Simonyi 101 and Remote Access
Apr
29
2024
Computer Science/Discrete Mathematics Seminar I
Lower Bounds for Set-Multilinear Branching Programs
Shubhangi Saraf
11:00am|Simonyi 101 and Remote Access
May
06
2024
Computer Science/Discrete Mathematics Seminar I
Rounding Large Independent Sets on Expanders
Tim Hsieh
11:00am|Simonyi 101 and Remote Access
May
13
2024
Computer Science/Discrete Mathematics Seminar I
Quantum Mechanics, Semidefinite Programming, and Graph Invariants
Matthew Hastings
11:00am|Simonyi 101 and Remote Access
Computer Science/Discrete Mathematics Seminar II
May
04
2004
Computer Science/Discrete Mathematics Seminar II
Ruling Out PTAS for Graph Min-Bisection
10:30am|S-101
May
04
2004
Computer Science/Discrete Mathematics Seminar II
Ruling Out PTAS for Graph Min-Bisection
10:30am|S-101
Oct
05
2004
Oct
12
2004
Computer Science/Discrete Mathematics Seminar II
The Intersection of a Matroid and a Simplicial Complex
10:30am|S-101
Oct
19
2004
Oct
26
2004
Computer Science/Discrete Mathematics Seminar II
Explicit Constructions of Bipartite Ramsey Graphs
Boaz Barak and Guy Kindler
10:30am|S-101
Nov
02
2004
Computer Science/Discrete Mathematics Seminar II
Explicit Constructions of Bipartite Ramsey Graphs
Boaz Barak and Guy Kindler
10:30am|S-101
Nov
09
2004
Computer Science/Discrete Mathematics Seminar II
Slow Mixing of Local Dynamics for Colourings and Independent Sets
David Galvin
10:30am|S-101
Nov
16
2004
Computer Science/Discrete Mathematics Seminar II
Slow Mixing of Local Dynamics for Colourings and Independent Sets
David Galvin
10:30am|S-101
Nov
23
2004
Computer Science/Discrete Mathematics Seminar II
Learnability and Automatizability
Michael Alekhnovich
10:30am|S-101
Nov
30
2004
Computer Science/Discrete Mathematics Seminar II
On Random Bernoulli Matrices: Singularity and Determinant
10:30am|S-101
Dec
07
2004
Computer Science/Discrete Mathematics Seminar II
Variance/Entropy Decomposition Techniques for Proving Fast Mixing of the Glauber Dynamics
10:30am|S-101
Dec
14
2004
Computer Science/Discrete Mathematics Seminar II
Variance/Entropy Decomposition Techniques for Proving Fast Mixing of the Glauber Dynamics
10:30am|S-101
Jan
18
2005
Computer Science/Discrete Mathematics Seminar II
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
10:30am|S-101
Jan
25
2005
Feb
01
2005
Computer Science/Discrete Mathematics Seminar II
Geometric symmetrizations in high dimension
10:30am|S-101
Feb
08
2005
Feb
15
2005
Computer Science/Discrete Mathematics Seminar II
Fixed Point Properties of Random Groups
10:30am|S-101
Feb
22
2005
Computer Science/Discrete Mathematics Seminar II
Quadratic Forms on Graphs
Konstantin Makarychev
10:30am|S-101
Mar
01
2005
Computer Science/Discrete Mathematics Seminar II
Pseudorandom Walks in Biregular Graphs and the RL vs. L. Problem
10:30am|S-101
Mar
08
2005
Mar
15
2005
Mar
22
2005
Computer Science/Discrete Mathematics Seminar II
1 Dimensional Diffusion Limited Aggregation (DLA)
Gideon Amir
10:30am|S-101
Mar
29
2005
Computer Science/Discrete Mathematics Seminar II
Controlled Linear Programming and Linear Complementarity for Some Infinite Games in NP $\cap$ coNP
Sergei Vorobyov
10:30am|S-101
Apr
05
2005
Apr
12
2005
Computer Science/Discrete Mathematics Seminar II
Cuts, Quadratic Programs and in Between
Muli Safra
10:30am|S-101
Apr
19
2005
Computer Science/Discrete Mathematics Seminar II
Additive Approximation for Edge-Deletion Problems
10:30am|S-101
Apr
26
2005
Computer Science/Discrete Mathematics Seminar II
Lower Bounds for the Noisy Broadcast Problem
Navin Goyal
10:30am|S-101
May
03
2005
Computer Science/Discrete Mathematics Seminar II
Extremal Erodos-Szekeres Permutations and Square Young Tableaux
Dan Romik
10:30am|S-101
May
31
2005
Computer Science/Discrete Mathematics Seminar II
Approximation Algorithms for Unique Games
11:30am|S-101
Sep
27
2005
Computer Science/Discrete Mathematics Seminar II
Property Tau and the Product Replacement Algorithm
Alex Lubotzky
10:30am|S-101
Oct
11
2005
Nov
01
2005
Computer Science/Discrete Mathematics Seminar II
Expander Graphs on the Symmetric Groups
10:30am|S-101
Nov
08
2005
Computer Science/Discrete Mathematics Seminar II
Expander Graphs on the Symmetric Groups, Part II
10:30am|S-101
Nov
22
2005
Computer Science/Discrete Mathematics Seminar II
Euclidean Embeddings of Finite Metric Spaces: Distortion and Expansion
10:30am|S-101
Nov
29
2005
Computer Science/Discrete Mathematics Seminar II
Szemeredi's Regularity Lemma in Analysis
10:30am|S-101