| Publication | Date of Publication | Type |
|---|
| Beyond worst-case budget-feasible mechanism design | 2024-09-25 | Paper |
| Maximizing non-monotone submodular functions over small subsets: beyond \(1/2\)-approximation | 2024-06-24 | Paper |
| Beating greedy matching in sublinear time | 2024-05-14 | Paper |
| Fully-dynamic-to-incremental reductions with known deletion order (e.g. sliding window) | 2024-05-14 | Paper |
| Sublinear time algorithms and complexity of approximate maximum matching | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126359 | 2024-04-09 | Paper |
| Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria | 2023-12-19 | Paper |
| Settling the complexity of Nash equilibrium in congestion games | 2023-11-14 | Paper |
| The randomized communication complexity of randomized auctions | 2023-11-14 | Paper |
| Exponential communication separations between notions of selfishness | 2023-11-14 | Paper |
| The Limitations of Optimization from Samples | 2023-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875712 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875764 | 2023-02-03 | Paper |
| An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model | 2022-12-01 | Paper |
| Communication complexity of approximate Nash equilibria | 2022-07-15 | Paper |
| On the complexity of dynamic mechanism design | 2022-07-15 | Paper |
| Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria | 2022-01-07 | Paper |
| Computing exact minimum cuts without knowing the graph | 2021-06-15 | Paper |
| Fast and deterministic constant factor approximation algorithms for LCS imply new circuit lower bounds | 2021-06-15 | Paper |
| Reducing approximate Longest Common Subsequence to approximate Edit Distance | 2021-02-02 | Paper |
| Does preprocessing help in fast sequence comparisons? | 2021-01-19 | Paper |
| Constant-factor approximation of near-linear edit distance in near-linear time | 2021-01-19 | Paper |
| Honest signaling in zero-sum games is hard, and lying is even harder | 2020-05-27 | Paper |
| An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model | 2020-01-30 | Paper |
| Near-linear time insertion-deletion codes and \((1+\varepsilon)\)-approximating edit distance via indexing | 2020-01-30 | Paper |
| An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation | 2019-10-15 | Paper |
| Fine-grained complexity meets \(\mathrm{IP} = \mathrm{PSPACE}\) | 2019-10-15 | Paper |
| Hardness of approximate nearest neighbor search | 2019-08-22 | Paper |
| On the complexity of dynamic mechanism design | 2018-07-16 | Paper |
| Sorting from Noisier Samples | 2018-07-16 | Paper |
| Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions | 2018-07-16 | Paper |
| Combinatorial prophet inequalities | 2018-07-16 | Paper |
| ETH hardness for densest-\(k\)-subgraph with perfect completeness | 2018-07-16 | Paper |
| Inapproximability of Nash equilibrium | 2018-07-04 | Paper |
| Detecting communities is hard (and counting them is even harder) | 2018-05-03 | Paper |
| The hunting of the SNARK | 2018-02-15 | Paper |
| Robust probabilistic inference | 2017-10-05 | Paper |
| Beyond matroids: secretary problem and prophet inequality with general constraints | 2017-09-29 | Paper |
| Communication complexity of approximate Nash equilibria | 2017-08-17 | Paper |
| The limitations of optimization from samples | 2017-08-17 | Paper |
| On the computational complexity of optimal simple mechanisms | 2016-04-15 | Paper |
| Can almost everybody be almost happy? | 2016-04-15 | Paper |
| Boolean functions whose Fourier transform is concentrated on pairwise disjoint subsets of the input | 2015-12-30 | Paper |
| Inapproximability of Nash equilibrium | 2015-08-21 | Paper |
| On Simplex Pivoting Rules and Complexity Theory | 2014-06-02 | Paper |
| Converting online algorithms to local computation algorithms | 2013-08-12 | Paper |
| Determining Sets for the Discrete Laplacian | 2007-06-26 | Paper |
