| Publication | Date of Publication | Type |
|---|
Verifying the generalization of deep learning to out-of-distribution domains
Journal of Automated Reasoning | 2024-09-27 | Paper |
| Verifying generalization in deep learning | 2024-01-12 | Paper |
| scientific article; zbMATH DE number 7378741 (Why is no real title available?) | 2021-08-04 | Paper |
Approximate Moore graphs are good expanders
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Approximate privacy: foundations and quantification
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Bayesian combinatorial auctions
Journal of the ACM | 2018-08-02 | Paper |
Setting lower bounds on truthfulness
Games and Economic Behavior | 2018-07-12 | Paper |
Inapproximability of truthful mechanisms via generalizations of the Vapnik-Chervonenkis dimension
SIAM Journal on Computing | 2018-01-31 | Paper |
Weakly-acyclic (internet) routing games
Theory of Computing Systems | 2017-11-07 | Paper |
Stateless computation
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Explicit expanding expanders
Algorithmica | 2017-10-10 | Paper |
Explicit expanding expanders
Lecture Notes in Computer Science | 2015-11-19 | Paper |
Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Self-stabilizing uncoupled dynamics
Algorithmic Game Theory | 2015-01-14 | Paper |
| Setting lower bounds on truthfulness (extended abstract) | 2014-12-18 | Paper |
Brief announcement
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Brief announcement
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Truthful randomized mechanisms for combinatorial auctions
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
| Inapproximability for VCG-based combinatorial auctions | 2014-05-22 | Paper |
The communication burden of payment determination
Games and Economic Behavior | 2013-11-14 | Paper |
On the structure of weakly acyclic games
Theory of Computing Systems | 2013-10-21 | Paper |
On communication protocols that compute almost privately
Theoretical Computer Science | 2012-10-11 | Paper |
Truthful randomized mechanisms for combinatorial auctions
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Interdomain Routing and Games
SIAM Journal on Computing | 2012-03-15 | Paper |
Incentive-compatible interdomain routing
Distributed Computing | 2012-02-06 | Paper |
Weakly-Acyclic (Internet) Routing Games
Algorithmic Game Theory | 2011-10-28 | Paper |
On communication protocols that compute almost privately
Algorithmic Game Theory | 2011-10-28 | Paper |
Approximation algorithms for combinatorial auctions with complement-free bidders
Mathematics of Operations Research | 2011-04-27 | Paper |
On the structure of weakly acyclic games
Lecture Notes in Computer Science | 2010-10-19 | Paper |
An improved approximation algorithm for combinatorial auctions with submodular bidders
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Approximation algorithms for combinatorial auctions with complement-free bidders
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5485516 (Why is no real title available?) | 2009-01-05 | Paper |
| Distributed algorithmic mechanism design | 2008-09-12 | Paper |
Bayesian Combinatorial Auctions
Automata, Languages and Programming | 2008-08-28 | Paper |
