| Publication | Date of Publication | Type |
|---|
| Balancing Covariates in Randomized Experiments with the Gram–Schmidt Walk Design | 2024-12-10 | Paper |
| Hardness results for Weaver's discrepancy problem | 2024-08-22 | Paper |
| Robust and Practical Solution of Laplacian Equations by Approximate Elimination | 2023-03-01 | Paper |
| The complexity of error-correcting codes | 2022-12-09 | Paper |
| Interlacing families. III: Sharper restricted invertibility estimates | 2022-05-31 | Paper |
| Finite free convolutions of polynomials | 2022-04-21 | Paper |
| Interlacing families. IV: Bipartite Ramanujan graphs of all sizes | 2018-12-19 | Paper |
| Ramanujan graphs and the solution of the Kadison-Singer problem | 2017-10-25 | Paper |
| Sparsified Cholesky and multigrid solvers for connection Laplacians | 2017-09-29 | Paper |
| The Minimum Distance of Turbo-Like Codes | 2017-08-08 | Paper |
| Graphs, vectors, and matrices | 2016-12-20 | Paper |
| Nearly-linear size holographic proofs | 2016-09-01 | Paper |
| A remark on matrix rigidity | 2016-06-09 | Paper |
| Interlacing families. I: Bipartite Ramanujan graphs of all degrees | 2015-07-06 | Paper |
| Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem | 2015-07-06 | Paper |
| An efficient parallel solver for SDD linear systems | 2015-06-26 | Paper |
| Algorithms for Lipschitz Learning on Graphs | 2015-05-01 | Paper |
| Randomness efficient identity testing of multivariate polynomials | 2015-02-27 | Paper |
| Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time | 2015-02-27 | Paper |
| Twice-Ramanujan sparsifiers | 2015-02-04 | Paper |
| Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems | 2014-12-17 | Paper |
| A randomized polynomial-time simplex algorithm for linear programming | 2014-11-25 | Paper |
| Twice-Ramanujan sparsifiers | 2014-06-26 | Paper |
| Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs | 2014-06-05 | Paper |
| A Cheeger Inequality for the Graph Connection Laplacian | 2014-04-30 | Paper |
| A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning | 2013-07-04 | Paper |
| Twice-Ramanujan sparsifiers | 2013-03-19 | Paper |
| An elementary proof of the restricted invertibility theorem | 2012-11-13 | Paper |
| Algorithms, graph theory, and the solution of Laplacian linear equations | 2012-11-01 | Paper |
| Graph sparsification by effective resistances | 2012-03-15 | Paper |
| Algorithms, graph theory, and linear equations in Laplacian matrices | 2011-11-11 | Paper |
| Spectral sparsification of graphs | 2011-11-07 | Paper |
| Smoothed analysis of condition numbers and complexity implications for linear programming | 2011-02-14 | Paper |
| Smoothed analysis of algorithms | 2010-08-17 | Paper |
| Exponential algorithmic speedup by a quantum walk | 2010-08-16 | Paper |
| Lower-stretch spanning trees | 2010-08-16 | Paper |
| Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems | 2010-08-15 | Paper |
| Smoothed analysis. Motivation and discrete models | 2010-04-20 | Paper |
| Lower-Stretch Spanning Trees | 2009-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302080 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549731 | 2009-01-05 | Paper |
| Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices | 2007-05-03 | Paper |
| PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES | 2007-03-21 | Paper |
| Spectral partitioning works: planar graphs and finite element meshes | 2007-03-09 | Paper |
| Smoothed analysis of algorithms and heuristics: progress and open questions | 2007-02-12 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Euro-Par 2004 Parallel Processing | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542543 | 2004-01-14 | Paper |
| Smoothed analysis of termination of linear programming algorithms | 2003-09-01 | Paper |
| Improved low-density parity-check codes using irregular graphs | 2002-08-04 | Paper |
| Efficient erasure correcting codes | 2002-08-04 | Paper |
| Alternation in interaction | 2002-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418806 | 2002-01-01 | Paper |
| Min-max-boundary domain decomposition | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4524330 | 2001-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526978 | 2001-02-28 | Paper |
| Expander codes | 2000-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258577 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228513 | 1999-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218415 | 1998-11-11 | Paper |
| Linear-time encodable and decodable error-correcting codes | 1997-06-12 | Paper |
| PP is closed under intersection | 1995-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234087 | 1995-01-01 | Paper |
| The power of adaptiveness and additional queries in random-self- reductions | 1994-09-01 | Paper |
