| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147285 | 2024-01-15 | Paper |
| Bipartite perfect matching as a real polynomial | 2023-11-14 | Paper |
| Bipartite perfect matching as a real polynomial | 2023-10-23 | Paper |
| Complexity of public goods games on graphs | 2023-07-28 | Paper |
| The menu-size complexity of revenue approximation | 2022-07-15 | Paper |
| Beyond Pigouvian taxes: a worst case analysis | 2022-07-06 | Paper |
| Mathematical Logic through Python | 2022-07-05 | Paper |
| Competitive Equilibrium with Indivisible Goods and Generic Budgets | 2021-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111466 | 2020-05-27 | Paper |
| The communication complexity of local search | 2020-01-30 | Paper |
| A stable marriage requires communication | 2019-12-12 | Paper |
| Economic efficiency requires interaction | 2019-12-12 | Paper |
| Selling multiple correlated goods: revenue maximization and menu-size complexity | 2019-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743455 | 2019-05-10 | Paper |
| Compact name-independent routing with minimum stretch | 2018-11-05 | Paper |
| The query complexity of correlated equilibria | 2018-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598283 | 2017-12-19 | Paper |
| Approximate revenue maximization with multiple items | 2017-11-07 | Paper |
| A Stable Marriage Requires Communication | 2017-10-05 | Paper |
| Efficient empirical revenue maximization in single-parameter auction environments | 2017-08-17 | Paper |
| The menu-size complexity of revenue approximation | 2017-08-17 | Paper |
| Correlated and Coarse Equilibria of Single-Item Auctions | 2017-02-10 | Paper |
| Algorithmic mechanism design (extended abstract) | 2016-09-29 | Paper |
| Pseudorandomness for network algorithms | 2016-09-01 | Paper |
| Trade-offs between communication throughput and parallel time | 2016-09-01 | Paper |
| Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions | 2016-04-15 | Paper |
| Economic efficiency requires interaction | 2015-06-26 | Paper |
| A parallel approximation algorithm for positive linear programming | 2015-05-07 | Paper |
| More deterministic simulation in logspace | 2015-05-07 | Paper |
| Multi-unit auctions: beyond Roberts | 2015-02-13 | Paper |
| Online ascending auctions for gradually expiring items | 2015-02-13 | Paper |
| Sampling and Representation Complexity of Revenue Maximization | 2015-01-07 | Paper |
| Truthful randomized mechanisms for combinatorial auctions | 2014-11-25 | Paper |
| Online ascending auctions for gradually expiring items | 2014-10-13 | Paper |
| Limitations of VCG-based mechanisms | 2014-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417663 | 2014-05-22 | Paper |
| Combinatorial agency | 2012-05-14 | Paper |
| Truthful randomized mechanisms for combinatorial auctions | 2012-05-11 | Paper |
| Multi-unit auctions with budget limits | 2012-03-19 | Paper |
| A Quantitative Version of the Gibbard–Satterthwaite Theorem for Three Alternatives | 2011-10-18 | Paper |
| On Yao’s XOR-Lemma | 2011-08-19 | Paper |
| On Constructing 1-1 One-Way Functions | 2011-08-19 | Paper |
| Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders | 2011-04-27 | Paper |
| On the Computational Power of Demand Queries | 2010-09-06 | Paper |
| Approximation algorithms for combinatorial auctions with complement-free bidders | 2010-08-16 | Paper |
| Mixed Strategies in Combinatorial Agency | 2010-08-06 | Paper |
| Informational limitations of ascending combinatorial auctions | 2010-05-21 | Paper |
| Mechanisms for Multi-Unit Auctions | 2010-03-15 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| A modular approach to Roberts' theorem | 2009-12-01 | Paper |
| Free-riding and free-labor in combinatorial agency | 2009-12-01 | Paper |
| Two simplified proofs for Roberts' theorem | 2009-10-19 | Paper |
| Mechanisms for a spatially distributed market | 2009-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624066 | 2009-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624052 | 2009-04-28 | Paper |
| Truthful approximation mechanisms for restricted combinatorial auctions | 2009-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549630 | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3524718 | 2008-09-12 | Paper |
| Combinatorial auctions | 2008-09-12 | Paper |
| Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation | 2007-02-05 | Paper |
| Combinatorial auctions with decreasing marginal utilities | 2006-09-28 | Paper |
| The communication requirements of efficient allocations and supporting prices | 2006-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715672 | 2006-01-04 | Paper |
| Competitive analysis of incentive compatible on-line auctions | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737215 | 2004-08-11 | Paper |
| Errata for: ``On randomized one-round communication complexity | 2003-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542516 | 2002-08-01 | Paper |
| Neighborhood preserving hashing and approximate queries | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234056 | 2001-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527022 | 2001-02-28 | Paper |
| Algorithmic mechanism design | 2001-01-01 | Paper |
| Extracting randomness: A survey and new constructions | 2000-02-17 | Paper |
| Efficient approximation of product distributions | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259976 | 1999-09-07 | Paper |
| On randomized one-round communication complexity | 1999-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231906 | 1999-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234059 | 1999-06-29 | Paper |
| Trade-offs between communication throughput and parallel time | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230323 | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234109 | 1999-03-16 | Paper |
| Products and Help Bits in Decision Trees | 1999-02-22 | Paper |
| Fast Connected Components Algorithms for the EREW PRAM | 1999-02-22 | Paper |
| On data structures and asymmetric communication complexity | 1999-01-06 | Paper |
| Lower bounds on arithmetic circuits via partial derivatives | 1998-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128884 | 1997-04-23 | Paper |
| On rank vs. communication complexity | 1996-09-15 | Paper |
| Randomness is linear in space | 1996-07-16 | Paper |
| Communication Complexity | 1996-04-24 | Paper |
| Amortized Communication Complexity | 1996-01-28 | Paper |
| Fractional Covers and Communication Complexity | 1995-07-10 | Paper |
| On the degree of Boolean functions as real polynomials | 1995-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234123 | 1995-01-01 | Paper |
| Hardness vs randomness | 1994-11-06 | Paper |
| Algebraic methods for interactive proof systems | 1994-08-21 | Paper |
| \(\text{RL}\subseteq \text{SC}\) | 1994-06-19 | Paper |
| \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs | 1994-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284623 | 1994-03-24 | Paper |
| Constant depth circuits, Fourier transform, and learnability | 1993-12-09 | Paper |
| On dice and coins: Models of computation for random generation | 1993-08-30 | Paper |
| The effect of random restrictions on formula size | 1993-06-29 | Paper |
| Probabilistic Analysis of Network Flow Algorithms | 1993-06-29 | Paper |
| The computational complexity of universal hashing | 1993-05-16 | Paper |
| Rounds in Communication Complexity Revisited | 1993-05-16 | Paper |
| On read-once vs. multiple access to randomness in logspace | 1993-05-16 | Paper |
| Pseudorandom generators for space-bounded computation | 1993-03-10 | Paper |
| Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs | 1993-01-17 | Paper |
| CREW PRAM<scp>s</scp> and Decision Trees | 1992-06-27 | Paper |
| Approximate inclusion-exclusion | 1992-06-25 | Paper |
| Pseudorandom bits for constant depth circuits | 1991-01-01 | Paper |
| Parallel Algorithms for Zero-One Supply-Demand Problems | 1989-01-01 | Paper |
| On the cover time of random walks on graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732126 | 1989-01-01 | Paper |
