| Publication | Date of Publication | Type |
|---|
Walrasian pricing in multi-unit auctions
Artificial Intelligence | 2023-08-28 | Paper |
Tables should be sorted (on random access machines)
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Dynamic algorithms for the Dyck languages
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Trans-dichotomous algorithms without multiplication — some upper and lower bounds
Lecture Notes in Computer Science | 2022-08-19 | Paper |
scientific article; zbMATH DE number 7204414 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
Lower bounds for union-split-find related problems on random access machines
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Computation of Stackelberg equilibria of finite sequential games
Web and Internet Economics | 2016-01-08 | Paper |
Characterization and computation of equilibria for indivisible goods
Algorithmic Game Theory | 2015-11-04 | Paper |
The complexity of solving reachability games using value and strategy iteration
Theory of Computing Systems | 2015-02-05 | Paper |
The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form
Algorithmic Game Theory | 2015-01-14 | Paper |
Truthful approximations to range voting
Web and Internet Economics | 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
Lecture Notes in Computer Science | 2014-07-07 | Paper |
Exact algorithms for solving stochastic games
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor
Journal of the ACM | 2014-02-17 | Paper |
Approximating the value of a concurrent reachability game in the polynomial time hierarchy
Algorithms and Computation | 2014-01-14 | Paper |
Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
A faster algorithm for solving one-clock priced timed games
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
Solving simple stochastic games with few coin toss positions
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Deterministic graphical games revisited
Journal of Logic and Computation | 2012-05-07 | Paper |
The complexity of solving reachability games using value and strategy iteration
Lecture Notes in Computer Science | 2011-06-17 | Paper |
The computational complexity of trembling hand perfection and other equilibrium refinements
Algorithmic Game Theory | 2010-10-19 | Paper |
Computing sequential equilibria for two-player games
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764905 (Why is no real title available?) | 2010-08-06 | Paper |
Circuits on cylinders.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Computing a quasi-perfect equilibrium of a two-player game
Economic Theory | 2010-02-19 | Paper |
The complexity of solving stochastic games on graphs
Algorithms and Computation | 2009-12-17 | Paper |
Hilbert's thirteenth problem and circuit complexity
Algorithms and Computation | 2009-12-17 | Paper |
Reviewing bounds on the circuit size of the hardest functions
Information Processing Letters | 2009-12-04 | Paper |
On the Complexity of Numerical Analysis
SIAM Journal on Computing | 2009-11-06 | Paper |
Privacy-Enhancing Auctions Using Rational Cryptography
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Finding Equilibria in Games of No Chance
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Deterministic Graphical Games Revisited
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Computing Proper Equilibria of Zero-Sum Games
Computers and Games | 2008-01-04 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
Lecture Notes in Computer Science | 2007-09-10 | Paper |
The computational complexity of one-dimensional sandpiles
Theory of Computing Systems | 2007-09-06 | Paper |
The cell probe complexity of succinct data structures
Theoretical Computer Science | 2007-07-16 | Paper |
Circuits on cylinders
Computational Complexity | 2006-09-28 | Paper |
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity | 2006-02-08 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
On converting CNF to DNF
Theoretical Computer Science | 2005-12-29 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Linear hash functions
Journal of the ACM | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2102768 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2038721 (Why is no real title available?) | 2004-02-08 | Paper |
Lower bounds for dynamic algebraic problems
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1834654 (Why is no real title available?) | 2002-11-25 | Paper |
Deterministic dictionaries
Journal of Algorithms | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1256659 (Why is no real title available?) | 2002-01-17 | Paper |
| scientific article; zbMATH DE number 1263186 (Why is no real title available?) | 2001-08-27 | Paper |
| scientific article; zbMATH DE number 1559562 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1857655 (Why is no real title available?) | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1424315 (Why is no real title available?) | 2000-11-08 | Paper |
| scientific article; zbMATH DE number 1339958 (Why is no real title available?) | 2000-05-04 | Paper |
| scientific article; zbMATH DE number 1405686 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1303598 (Why is no real title available?) | 2000-02-17 | Paper |
Fusion trees can be implemented with \(AC^0\) instructions only
Theoretical Computer Science | 1999-04-29 | Paper |
On data structures and asymmetric communication complexity
Journal of Computer and System Sciences | 1999-01-06 | Paper |
Dynamic word problems
Journal of the ACM | 1998-02-17 | Paper |
The asymptotic complexity of merging networks
Journal of the ACM | 1998-01-19 | Paper |
The asymptotic complexity of merging networks
Journal of the ACM | 1998-01-19 | Paper |
Relative to a random oracle, NP is not small
Journal of Computer and System Sciences | 1997-03-31 | Paper |
On the cell probe complexity of polynomial evaluation
Theoretical Computer Science | 1997-02-28 | Paper |
Complexity models for incremental computation
Theoretical Computer Science | 1994-08-29 | Paper |
| scientific article; zbMATH DE number 512871 (Why is no real title available?) | 1994-03-10 | Paper |
The Complexity of Malign Measures
SIAM Journal on Computing | 1993-05-16 | Paper |
Circuit depth relative to a random oracle
Information Processing Letters | 1993-01-16 | Paper |
