| Publication | Date of Publication | Type |
|---|
| The Spectrum of the Grigoriev–Laurent Pseudomoments | 2024-01-10 | Paper |
| The Role of Directionality, Heterogeneity, and Correlations in Epidemic Risk and Spread | 2023-05-10 | Paper |
| Disordered systems insights on computational hardness | 2022-12-13 | Paper |
| Disordered Systems Insights on Computational Hardness | 2022-10-15 | Paper |
| The planted matching problem: phase transitions and exact results | 2022-02-14 | Paper |
| Trigonometric functions in the $p$-norm | 2021-09-28 | Paper |
| Reconstruction of Random Geometric Graphs: Breaking the Omega(r) distortion barrier | 2021-07-29 | Paper |
| The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime | 2021-07-28 | Paper |
| Minimum Circuit Size, Graph Isomorphism, and Related Problems | 2021-06-15 | Paper |
| The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains | 2021-02-02 | Paper |
| A computational approach to animal breeding | 2020-10-28 | Paper |
| Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs | 2020-08-27 | Paper |
| The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime | 2019-09-02 | Paper |
| Rapid mixing for lattice colourings with fewer colours | 2019-07-09 | Paper |
| The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness | 2019-07-03 | Paper |
| Series expansion of the percolation threshold on hypercubic lattices | 2019-03-27 | Paper |
| Oriented and degree-generated block models: generating and inferring communities with inhomogeneous degree distributions | 2018-10-16 | Paper |
| Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization | 2018-09-19 | Paper |
| Minimum Circuit Size, Graph Isomorphism, and Related Problems | 2018-07-19 | Paper |
| The rigidity transition in random graphs | 2017-09-29 | Paper |
| Designing Strassen's algorithm | 2017-08-30 | Paper |
| Percolation Thresholds in Hyperbolic Lattices | 2017-08-19 | Paper |
| Tree codes and a conjecture on exponential sums | 2017-05-19 | Paper |
| Spectral redemption in clustering sparse networks | 2017-02-16 | Paper |
| Codes, lower bounds, and phase transitions in the symmetric rendezvous problem | 2017-01-05 | Paper |
| Matrix multiplication algorithms from group orbits | 2016-12-05 | Paper |
| The phase transition in random regular exact cover | 2016-10-21 | Paper |
| Computational complexity, phase transitions, and message-passing for community detection | 2016-07-29 | Paper |
| Information-theoretic thresholds for community detection in sparse networks | 2016-07-06 | Paper |
| Information-theoretic thresholds for community detection in sparse networks | 2016-01-11 | Paper |
| Approximate Representations, Approximate Homomorphisms, and Low-Dimensional Embeddings of Groups | 2015-11-27 | Paper |
| Group representations that resist random sampling | 2015-11-13 | Paper |
| On the bias of traceroute sampling | 2015-11-11 | Paper |
| Generic quantum Fourier transforms | 2015-09-02 | Paper |
| Generic quantum Fourier transforms | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501376 | 2015-08-03 | Paper |
| Optimal $\varepsilon$-Biased Sets with Just a Little Randomness | 2015-07-31 | Paper |
| Spatial Mixing for Independent Sets in Poisson Random Trees | 2015-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934717 | 2014-12-18 | Paper |
| Limitations of quantum coset states for graph isomorphism | 2014-11-25 | Paper |
| The complexity of the fermionant, and immanants of constant width | 2014-10-06 | Paper |
| Heat and Noise on Cubes and Spheres: The Sensitivity of Randomly Rotated Polynomial Threshold Functions | 2014-08-22 | Paper |
| An Entropic Proof of Chang's Inequality | 2014-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414568 | 2014-05-06 | Paper |
| Small-Bias Sets for Nonabelian Groups | 2013-10-04 | Paper |
| The Power of Choice for Random Satisfiability | 2013-10-04 | Paper |
| Tight Bounds on the Threshold for Permuted k-Colorability | 2012-11-02 | Paper |
| Approximating the Permanent via Nonabelian Determinants | 2012-08-10 | Paper |
| A Graph Integral Formulation of the Circuit Partition Polynomial | 2011-12-08 | Paper |
| Finding conjugate stabilizer subgroups in PSL(2; q) and related groups | 2011-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3090774 | 2011-09-02 | Paper |
| Independent Sets in Random Graphs from the Weighted Second Moment Method | 2011-08-17 | Paper |
| McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks | 2011-08-12 | Paper |
| Limitations of quantum coset states for graph isomorphism | 2011-05-16 | Paper |
| On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism | 2011-01-17 | Paper |
| Regarding a Representation-Theoretic Conjecture of Wigderson | 2010-09-21 | Paper |
| Quasilinear cellular automata | 2010-09-11 | Paper |
| On the bias of traceroute sampling | 2010-08-16 | Paper |
| Almost all graphs with average degree 4 are 3-colorable | 2010-08-05 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624048 | 2009-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3597147 | 2009-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549653 | 2009-01-05 | Paper |
| The Symmetric Group Defies Strong Fourier Sampling | 2008-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549254 | 2008-12-21 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3522655 | 2008-09-03 | Paper |
| The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts | 2008-06-19 | Paper |
| A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas | 2008-01-08 | Paper |
| Counting connected graphs and hypergraphs via the probabilistic method | 2008-01-08 | Paper |
| Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold | 2007-06-26 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| MAX k‐CUT and approximating the chromatic number of random graphs | 2006-06-06 | Paper |
| On the computational power of probabilistic and quantum branching program | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715725 | 2006-01-04 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-16 | Paper |
| New Periodic Orbits for the n-Body Problem | 2005-11-08 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828960 | 2004-11-29 | Paper |
| Almost all graphs with average degree 4 are 3-colorable | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4814340 | 2004-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737169 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449176 | 2004-02-08 | Paper |
| On the 2-colorability of random hypergraphs | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440436 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407708 | 2003-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407712 | 2003-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529537 | 2003-09-18 | Paper |
| An analog characterization of the Grzegorczyk hierarchy | 2003-05-14 | Paper |
| Ribbon tile invariants from the signed area | 2002-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779171 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331195 | 2002-06-10 | Paper |
| Parallel Quantum Computation and Quantum Codes | 2002-04-23 | Paper |
| Hard tiling problems with simple tiles | 2002-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768371 | 2002-01-30 | Paper |
| Queues, stacks, and transcendentality at the transition to chaos | 2002-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762794 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707531 | 2001-04-03 | Paper |
| Iteration, inequalities, and differentiability in analog computers | 2001-03-12 | Paper |
| Internal diffusion-limited aggregation: parallel algorithms and complexity | 2000-10-08 | Paper |
| Height representation, critical exponents, and ergodicity in the four-state triangular Potts antiferromagnet | 2000-10-08 | Paper |
| Unpredictability and undecidability in dynamical systems | 2000-07-16 | Paper |
| Braids in classical dynamics | 2000-07-16 | Paper |
| Quantum automata and quantum grammars | 2000-06-04 | Paper |
| Circuits and expressions with nonassociative gates | 2000-01-01 | Paper |
| The computational complexity of sandpiles | 1999-11-22 | Paper |
| Complexity of two-dimensional patterns | 1999-08-08 | Paper |
| Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness | 1999-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224656 | 1999-05-18 | Paper |
| Closed-form analytic maps in one and two dimensions can simulate universal Turing machines | 1999-01-12 | Paper |
| Dynamical recognizers: real-time language recognition by analog computers | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385615 | 1998-04-20 | Paper |
| Predicting nonlinear cellular automata quickly by decomposing them into linear ones | 1997-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336108 | 1997-05-12 | Paper |
| Recursion theory on the reals and continuous-time computation | 1997-02-27 | Paper |
| Generalized one-sided shifts and maps of the interval | 1992-06-25 | Paper |
| Generalized shifts: unpredictability and undecidability in dynamical systems | 1991-01-01 | Paper |
