| Publication | Date of Publication | Type |
|---|
| Subset sum in time \(2^{n/2}/\text{poly}(n)\) | 2025-01-14 | Paper |
| Mildly exponential lower bounds on tolerant testers for monotonicity, unateness, and juntas | 2024-11-28 | Paper |
| Smoothed complexity of SWAP in local graph partitioning | 2024-11-28 | Paper |
| Reducing Tarski to unique Tarski (In the Black-Box model) | 2024-11-19 | Paper |
| Average-case subset balancing problems | 2024-07-19 | Paper |
| Near-optimal average-case approximate trace reconstruction from few traces | 2024-07-19 | Paper |
| Computational hardness of the Hylland-Zeckhauser scheme | 2024-07-19 | Paper |
| Approximate trace reconstruction from a single trace | 2024-05-14 | Paper |
| Streaming Euclidean MST to a constant factor | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147251 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147269 | 2024-01-15 | Paper |
| New streaming algorithms for high dimensional EMD and MST | 2023-12-08 | Paper |
| A Lower Bound on Cycle-Finding in Sparse Digraphs | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875500 | 2023-02-03 | Paper |
| On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer | 2022-05-31 | Paper |
| Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces | 2021-07-28 | Paper |
| Sample-Based High-Dimensional Convexity Testing. | 2021-07-28 | Paper |
| A game-theoretic framework for autonomous vehicles velocity control: bridging microscopic differential games and macroscopic mean field games | 2021-05-20 | Paper |
| Nearly optimal edge estimation with independent set queries | 2021-02-02 | Paper |
| A Lower Bound on Cycle-Finding in Sparse Digraphs | 2021-02-02 | Paper |
| Smoothed complexity of local max-cut and binary max-CSP | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111156 | 2020-05-26 | Paper |
| Learning and Testing Junta Distributions with Subcube Conditioning | 2020-04-26 | Paper |
| Testing unateness nearly optimally | 2020-01-30 | Paper |
| A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights | 2019-08-30 | Paper |
| Distribution-free Junta Testing | 2019-08-22 | Paper |
| Efficient average-case population recovery in the presence of insertions and deletions | 2019-07-12 | Paper |
| The Complexity of Optimal Multidimensional Pricing | 2019-06-20 | Paper |
| Distribution-free Junta Testing | 2019-03-28 | Paper |
| Settling the Query Complexity of Non-adaptive Junta Testing | 2019-02-25 | Paper |
| Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions | 2018-07-16 | Paper |
| The complexity of optimal multidimensional pricing for a unit-demand buyer | 2018-07-12 | Paper |
| Complexity of Counting CSP with Complex Weights | 2018-05-17 | Paper |
| The Complexity of Non-Monotone Markets | 2018-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4638112 | 2018-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608026 | 2018-03-15 | Paper |
| Complexity Dichotomies for Counting Problems | 2018-01-02 | Paper |
| Near-optimal small-depth lower bounds for small distance connectivity | 2017-09-29 | Paper |
| Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness | 2017-08-17 | Paper |
| Addition is exponentially harder than counting for shallow monotone circuits | 2017-08-17 | Paper |
| The complexity of approximating conservative counting CSPs. | 2017-01-30 | Paper |
| Nonnegative Weighted #CSP: An Effective Complexity Dichotomy | 2016-12-21 | Paper |
| Settling the complexity of computing two-player Nash equilibria | 2015-11-11 | Paper |
| On the Complexity of Nash Equilibria in Anonymous Games | 2015-08-21 | Paper |
| Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries | 2015-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934593 | 2014-12-18 | Paper |
| Recent development in computational complexity characterization of Nash equilibrium | 2014-10-07 | Paper |
| The complexity of approximating conservative counting CSPs | 2014-09-22 | Paper |
| How to compress interactive communication | 2014-08-13 | Paper |
| Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems | 2014-08-07 | Paper |
| The complexity of non-monotone markets | 2014-08-07 | Paper |
| Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities | 2014-07-25 | Paper |
| Complexity of counting CSP with complex weights | 2014-05-13 | Paper |
| Partial derivatives in arithmetic complexity and beyond | 2014-01-15 | Paper |
| Graph homomorphisms with complex values: a dichotomy theorem | 2013-09-25 | Paper |
| How to compress interactive communication | 2013-09-25 | Paper |
| Inapproximability after Uniqueness Phase Transition in Two-Spin Systems | 2012-11-02 | Paper |
| On incentive compatible competitive selection protocols | 2011-09-20 | Paper |
| Quadratic lower bound for permanent vs. determinant in any characteristic | 2011-02-07 | Paper |
| On Tractable Exponential Sums | 2010-09-07 | Paper |
| Graph Homomorphisms with Complex Values: A Dichotomy Theorem | 2010-09-07 | Paper |
| On algorithms for discrete and approximate brouwer fixed points | 2010-08-16 | Paper |
| Quantum separation of local search and fixed point computation | 2010-02-23 | Paper |
| Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria | 2009-12-17 | Paper |
| On the complexity of 2D discrete fixed point problem | 2009-11-04 | Paper |
| A simplicial approach for discrete fixed point theorems | 2009-04-29 | Paper |
| Market equilibria with hybrid linear-Leontief utilities | 2009-04-29 | Paper |
| On the Complexity of 2D Discrete Fixed Point Problem | 2009-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302072 | 2009-01-05 | Paper |
| Matching algorithmic bounds for finding a Brouwer fixed point | 2008-12-21 | Paper |
| Quantum Separation of Local Search and Fixed Point Computation | 2008-07-10 | Paper |
| Computing Exact p-Value for Structured Motif | 2008-06-17 | Paper |
| Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set | 2008-01-04 | Paper |
| A Simplicial Approach for Discrete Fixed Point Theorems | 2007-09-10 | Paper |
| On Incentive Compatible Competitive Selection Protocol | 2007-09-10 | Paper |
| On searching a table consistent with division poset | 2007-02-26 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Testing Sumsets is Hard | N/A | Paper |
