| Publication | Date of Publication | Type |
|---|
| Walrasian pricing in multi-unit auctions | 2023-08-28 | Paper |
| Tables should be sorted (on random access machines) | 2022-12-16 | Paper |
| Dynamic algorithms for the Dyck languages | 2022-12-16 | Paper |
| Trans-dichotomous algorithms without multiplication — some upper and lower bounds | 2022-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111298 | 2020-05-26 | Paper |
| Lower bounds for union-split-find related problems on random access machines | 2016-09-01 | Paper |
| Computation of Stackelberg equilibria of finite sequential games | 2016-01-08 | Paper |
| Characterization and computation of equilibria for indivisible goods | 2015-11-04 | Paper |
| The complexity of solving reachability games using value and strategy iteration | 2015-02-05 | Paper |
| The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form | 2015-01-14 | Paper |
| Truthful approximations to range voting | 2015-01-07 | Paper |
| Lower bounds on the size of selection and rank indexes | 2014-10-13 | Paper |
| Monomial strategies for concurrent reachability games and other stochastic games | 2014-07-07 | Paper |
| Exact algorithms for solving stochastic games | 2014-06-05 | Paper |
| Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor | 2014-02-17 | Paper |
| Approximating the value of a concurrent reachability game in the polynomial time hierarchy | 2014-01-14 | Paper |
| Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract) | 2013-09-17 | Paper |
| A faster algorithm for solving one-clock priced timed games | 2013-08-12 | Paper |
| Solving simple stochastic games with few coin toss positions | 2012-09-25 | Paper |
| Deterministic graphical games revisited | 2012-05-07 | Paper |
| The complexity of solving reachability games using value and strategy iteration | 2011-06-17 | Paper |
| The computational complexity of trembling hand perfection and other equilibrium refinements | 2010-10-19 | Paper |
| Computing sequential equilibria for two-player games | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579499 | 2010-08-06 | Paper |
| Circuits on cylinders. | 2010-04-20 | Paper |
| Computing a quasi-perfect equilibrium of a two-player game | 2010-02-19 | Paper |
| The complexity of solving stochastic games on graphs | 2009-12-17 | Paper |
| Hilbert's thirteenth problem and circuit complexity | 2009-12-17 | Paper |
| Reviewing bounds on the circuit size of the hardest functions | 2009-12-04 | Paper |
| On the Complexity of Numerical Analysis | 2009-11-06 | Paper |
| Privacy-Enhancing Auctions Using Rational Cryptography | 2009-10-20 | Paper |
| Finding Equilibria in Games of No Chance | 2009-03-06 | Paper |
| Deterministic Graphical Games Revisited | 2008-06-19 | Paper |
| Computing Proper Equilibria of Zero-Sum Games | 2008-01-04 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard | 2007-09-10 | Paper |
| The computational complexity of one-dimensional sandpiles | 2007-09-06 | Paper |
| The cell probe complexity of succinct data structures | 2007-07-16 | Paper |
| Circuits on cylinders | 2006-09-28 | Paper |
| Derandomizing Arthur-Merlin games using hitting sets | 2006-02-08 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| On converting CNF to DNF | 2005-12-29 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Linear hash functions | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818856 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449186 | 2004-02-08 | Paper |
| Lower bounds for dynamic algebraic problems | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779150 | 2002-11-25 | Paper |
| Deterministic dictionaries | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230345 | 2002-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234056 | 2001-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527014 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788614 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945529 | 2000-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4265621 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938667 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250224 | 2000-02-17 | Paper |
| Fusion trees can be implemented with \(AC^0\) instructions only | 1999-04-29 | Paper |
| On data structures and asymmetric communication complexity | 1999-01-06 | Paper |
| Dynamic word problems | 1998-02-17 | Paper |
| The asymptotic complexity of merging networks | 1998-01-19 | Paper |
| Relative to a random oracle, NP is not small | 1997-03-31 | Paper |
| On the cell probe complexity of polynomial evaluation | 1997-02-28 | Paper |
| Complexity models for incremental computation | 1994-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281568 | 1994-03-10 | Paper |
| The Complexity of Malign Measures | 1993-05-16 | Paper |
| Circuit depth relative to a random oracle | 1993-01-16 | Paper |
