| Publication | Date of Publication | Type |
|---|
| Rounding via low dimensional embeddings | 2024-09-25 | Paper |
| Improved monotonicity testers via hypercube embeddings | 2024-09-25 | Paper |
| Communication and information complexity | 2024-03-22 | Paper |
| New separations results for external information | 2023-11-14 | Paper |
| Optimal tiling of the euclidean space using permutation-symmetric bodies | 2023-07-12 | Paper |
| Optimal Short-Circuit Resilient Formulas | 2023-04-27 | Paper |
| On the computational power of radio channels | 2023-02-03 | Paper |
| Improved Monotonicity Testers via Hypercube Embeddings | 2022-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091761 | 2022-07-27 | Paper |
| An Invariance Principle for the Multi-slice, with Applications | 2021-10-20 | Paper |
| Semi-Direct Sum Theorem and Nearest Neighbor under ℓ∞ | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993274 | 2021-06-15 | Paper |
| Information value of two-prover games | 2021-06-15 | Paper |
| Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs | 2020-10-29 | Paper |
| Reliable communication over highly connected noisy networks | 2019-11-27 | Paper |
| Hitting sets with near-optimal error for read-once branching programs | 2019-08-22 | Paper |
| Interactive compression to external information | 2019-08-22 | Paper |
| Finding Endogenously Formed Communities | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633811 | 2019-05-06 | Paper |
| Information complexity and applications. | 2019-03-14 | Paper |
| The Price of Uncertain Priors in Source Coding | 2019-01-28 | Paper |
| Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness | 2018-12-19 | Paper |
| Constant-Rate Coding for Multiparty Interactive Communication Is Impossible | 2018-08-02 | Paper |
| Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions | 2018-07-16 | Paper |
| ETH Hardness for Densest-k-Subgraph with Perfect Completeness | 2018-07-16 | Paper |
| Coding for Interactive Communication Correcting Insertions and Deletions | 2018-06-27 | Paper |
| Network coding in undirected graphs is either very helpful or not helpful at all | 2018-05-03 | Paper |
| Tight space-noise tradeoffs in computing the ergodic measure | 2018-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608040 | 2018-03-15 | Paper |
| Information complexity is computable | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598200 | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4591371 | 2017-11-14 | Paper |
| Interactive Information Complexity | 2017-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4589018 | 2017-11-06 | Paper |
| Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis | 2017-10-05 | Paper |
| Parallel algorithms for select and partition with noisy comparisons | 2017-09-29 | Paper |
| Communication lower bounds for statistical estimation problems via a distributed data processing inequality | 2017-09-29 | Paper |
| Constant-rate coding for multiparty interactive communication is impossible | 2017-09-29 | Paper |
| Reliable Communication over Highly Connected Noisy Networks | 2017-09-29 | Paper |
| Strategyproof mechanisms for competitive influence in networks | 2017-07-07 | Paper |
| Simulating Noisy Channel Interaction | 2017-05-19 | Paper |
| Information Equals Amortized Communication | 2017-05-16 | Paper |
| On the convergence of the Hegselmann-Krause system | 2017-05-16 | Paper |
| Toward Coding for Maximum Errors in Interactive Communication | 2017-05-16 | Paper |
| List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise | 2017-03-10 | Paper |
| Search using queries on indistinguishable items | 2017-01-30 | Paper |
| Information lower bounds via self-reducibility | 2017-01-18 | Paper |
| A discrepancy lower bound for information complexity | 2016-11-29 | Paper |
| Towards deterministic tree code constructions | 2016-10-07 | Paper |
| Noise vs computational intractability in dynamics | 2016-10-07 | Paper |
| Optimal provision-after-wait in healthcare | 2016-04-15 | Paper |
| On information complexity in the broadcast model | 2016-03-23 | Paper |
| Interactive Information Complexity | 2015-11-25 | Paper |
| Pebbles and Branching Programs for Tree Evaluation | 2015-09-24 | Paper |
| An Interactive Information Odometer and Applications | 2015-08-21 | Paper |
| Small Value Parallel Repetition for General Games | 2015-08-21 | Paper |
| Stability in Large Matching Markets with Complementarities | 2014-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191570 | 2014-10-06 | Paper |
| Pseudorandom Generators for Regular Branching Programs | 2014-09-18 | Paper |
| How to compress interactive communication | 2014-08-13 | Paper |
| An information complexity approach to extended formulations | 2014-08-07 | Paper |
| From information to exact communication | 2014-08-07 | Paper |
| Information Equals Amortized Communication | 2014-07-30 | Paper |
| The Grothendieck Constant is Strictly Smaller than Krivine's Bound | 2014-07-30 | Paper |
| Public vs Private Coin in Bounded-Round Information | 2014-07-01 | Paper |
| Towards coding for maximum errors in interactive communication | 2014-06-05 | Paper |
| Interactive information complexity | 2014-05-13 | Paper |
| Thurston equivalence to a rational map is decidable | 2014-03-25 | Paper |
| The Grothendieck constant is strictly smaller than Krivine's bound | 2014-03-11 | Paper |
| How to compress interactive communication | 2013-09-25 | Paper |
| Direct product via round-preserving compression | 2013-08-06 | Paper |
| Information Lower Bounds via Self-reducibility | 2013-06-14 | Paper |
| The rate of convergence of the walk on spheres algorithm | 2013-02-04 | Paper |
| A discrepancy lower bound for information complexity | 2012-11-02 | Paper |
| Fractional pebbling and thrifty branching programs | 2012-10-24 | Paper |
| Computability of Brolin-Lyubich measure | 2011-12-13 | Paper |
| Inapproximability of NP-Complete Variants of Nash Equilibrium | 2011-08-17 | Paper |
| Space-efficient counting in graphs on surfaces | 2011-02-18 | Paper |
| Monotonicity and implementability | 2010-11-17 | Paper |
| Position Auctions with Budgets: Existence and Uniqueness | 2010-10-18 | Paper |
| Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits | 2010-08-09 | Paper |
| Noisy sorting without resampling | 2010-08-06 | Paper |
| On computational complexity of Siegel Julia sets | 2010-07-19 | Paper |
| Constructing locally connected non-computable Julia sets | 2010-01-11 | Paper |
| Branching Programs for Tree Evaluation | 2009-10-16 | Paper |
| Derandomization of Euclidean Random Walks | 2009-02-17 | Paper |
| Computability of Julia sets | 2009-02-05 | Paper |
| Constructing non-computable Julia sets | 2009-01-05 | Paper |
| On the computational complexity of the Riemann mapping | 2008-09-03 | Paper |
| Filled Julia sets with empty interior are computable | 2008-09-02 | Paper |
| Computability of Julia sets | 2008-07-10 | Paper |
| Mafia: A theoretical study of players and coalitions in a partial information environment | 2008-07-01 | Paper |
| The complexity of properly learning simple concept classes | 2007-11-30 | Paper |
| Termination of Integer Linear Programs | 2007-09-05 | Paper |
| Parabolic Julia sets are polynomial time computable | 2006-09-25 | Paper |
| Non-computable Julia sets | 2006-05-17 | Paper |
| On computability of Julia sets: answers to questions of Milnor and Shub | 2006-04-07 | Paper |
| Computing over the reals: foundations for scientific computing. | 2006-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692860 | 2005-09-28 | Paper |
| Chebyshev systems and estimation theory for discrete distributions. | 2003-05-07 | Paper |
| A Monte Carlo algorithm for a lottery problem | 2001-07-12 | Paper |
