| Publication | Date of Publication | Type |
|---|
| Computational complexity of decision problems about Nash equilibria in win-lose multi-player games | 2024-05-29 | Paper |
| The Big Match with a Clock and a Bit of Memory | 2024-02-23 | Paper |
| Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship | 2024-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089213 | 2022-07-18 | Paper |
| On the computational complexity of decision problems about multi-player Nash equilibria | 2022-06-21 | Paper |
| Computational complexity of computing a quasi-proper equilibrium | 2022-05-20 | Paper |
| Computational complexity of multi-player evolutionarily stable strategies | 2022-03-21 | Paper |
| Weights of exact threshold functions | 2022-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5020524 | 2022-01-06 | Paper |
| Absorbing games with a clock and two bits of memory | 2021-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111270 | 2020-05-26 | Paper |
| On the computational complexity of decision problems about multi-player Nash equilibria | 2020-02-04 | Paper |
| The real computational complexity of minmax value and equilibrium refinements in multi-player games | 2019-09-05 | Paper |
| A Stay-in-a-Set Game without a Stationary Equilibrium | 2019-03-28 | Paper |
| The real computational complexity of minmax value and equilibrium refinements in multi-player games | 2018-02-13 | Paper |
| Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates | 2017-06-08 | Paper |
| Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship | 2017-02-10 | Paper |
| The Big Match in Small Space | 2016-09-29 | Paper |
| Computation of Stackelberg Equilibria of Finite Sequential Games | 2016-01-08 | Paper |
| The complexity of solving reachability games using value and strategy iteration | 2015-02-05 | Paper |
| Learning read-constant polynomials of constant degree modulo composites | 2015-02-05 | Paper |
| Polynomial threshold functions and Boolean threshold circuits | 2015-01-30 | Paper |
| The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form | 2015-01-14 | Paper |
| Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth | 2014-10-14 | Paper |
| Exact algorithms for solving stochastic games | 2014-06-05 | Paper |
| Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates | 2014-05-13 | Paper |
| Patience of matrix games | 2014-04-10 | Paper |
| Polynomial Threshold Functions and Boolean Threshold Circuits | 2013-09-20 | Paper |
| Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques | 2013-03-13 | Paper |
| Deterministic graphical games revisited | 2012-05-07 | Paper |
| The complexity of solving reachability games using value and strategy iteration | 2011-06-17 | Paper |
| Learning Read-Constant Polynomials of Constant Degree Modulo Composites | 2011-06-17 | Paper |
| A new characterization of \(\text{ACC}^{0}\) and probabilistic \(\text{CC}^{0}\) | 2011-02-18 | Paper |
| The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements | 2010-10-19 | Paper |
| Weights of Exact Threshold Functions | 2010-09-03 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Hilbert’s Thirteenth Problem and Circuit Complexity | 2009-12-17 | Paper |
| Depth Reduction for Circuits with a Single Layer of Modular Counting Gates | 2009-08-18 | Paper |
| Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates | 2009-03-06 | Paper |
| Finding Equilibria in Games of No Chance | 2009-03-06 | Paper |
| Dynamic Matchings in Convex Bipartite Graphs | 2008-09-17 | Paper |
| Deterministic Graphical Games Revisited | 2008-06-19 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Constant width planar computation characterizes ACC\(^{0}\) | 2006-10-25 | Paper |
| Circuits on cylinders | 2006-09-28 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
