Combinatorics Seminar
Printer-friendly versionThe Complexity of Random Constraint Satisfaction Problems
Universality for random matrices beyond mean-field models
Community Detection: Minimaxity and A Computationally Efficient Algorithm
Adjacency matrices of random digraphs: singularity and anti-concentration
Ramanujan Coverings of Graphs
Random Triangle Removal
Cutting Plane Method: A faster algorithm for many combinatorial optimization problems
The exact $k$-SAT threshold for large $k$
Roots of random polynomials
