| Publication | Date of Publication | Type |
|---|
Learning reserve prices in second-price auctions
| 2024-09-25 | Paper |
Auction design for value maximizers with budget and return-on-spend constraints
| 2024-09-20 | Paper |
The price of stability for first price auction
| 2024-05-14 | Paper |
Bidder subset selection problem in auction design
| 2024-05-14 | Paper |
Generalized sorting with predictions
| 2024-05-14 | Paper |
Oblivious online contention resolution schemes
| 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788481 (Why is no real title available?)
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788398 (Why is no real title available?)
| 2024-01-15 | Paper |
Better approximation for interdependent SOS valuations
Web and Internet Economics | 2023-08-04 | Paper |
Counting Independent Sets and Colorings on Random Regular Bipartite Graphs
| 2023-02-03 | Paper |
Tight revenue gaps among multiunit mechanisms
SIAM Journal on Computing | 2022-11-15 | Paper |
An FPTAS for the hardcore model on random regular bipartite graphs
Theoretical Computer Science | 2022-08-25 | Paper |
Relaxing the independence assumption in sequential posted pricing, prophet inequality, and random bipartite matching
| 2022-07-06 | Paper |
Bayesian auctions with efficient queries
Artificial Intelligence | 2022-03-02 | Paper |
Zeros of Holant Problems
ACM Transactions on Algorithms | 2022-02-08 | Paper |
Brief Announcement: Bayesian Auctions with Efficient Queries.
| 2021-07-28 | Paper |
On the Complexity of Holant Problems
| 2021-06-15 | Paper |
Dichotomy for Holant\(^\ast\) problems on the Boolean domain
Theory of Computing Systems | 2021-06-11 | Paper |
Zeros of ferromagnetic 2-spin systems
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Tight revenue gaps among simple mechanisms
SIAM Journal on Computing | 2020-09-17 | Paper |
Tight approximation ratio of anonymous pricing
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Uniqueness, spatial mixing, and approximation for ferromagnetic 2-spin systems
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Tight revenue gaps among simple mechanisms
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Approximability of the Six-vertex Model
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Zeros of Holant problems: locations and algorithms
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Correlation-robust analysis of single item auction
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Counting hypergraph colorings in the local lemma regime
SIAM Journal on Computing | 2019-09-02 | Paper |
Counting hypergraph colourings in the local lemma regime
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
A simple FPTAS for counting edge covers
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Correlation decay up to uniqueness in spin systems
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Dichotomy for Holant* problems with a function on domain size 3
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Approximate counting via correlation decay in spin systems
| 2019-05-10 | Paper |
Canonical Paths for MCMC: from Art to Science
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
An FPTAS for counting proper four-colorings on cubic graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems
| 2018-04-19 | Paper |
The value of information concealment
| 2018-03-15 | Paper |
Dichotomy for real Holant\(^{\mathrm c}\) problems
| 2018-03-15 | Paper |
Separation in correlation-robust monopolist problem with budget
| 2018-03-15 | Paper |
Liquid welfare maximization in auctions with multiple items
| 2018-02-13 | Paper |
FPTAS for hardcore and Ising models on hypergraphs
| 2018-01-24 | Paper |
FPTAS for counting monotone CNF
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Dichotomy for Holant* problems of Boolean domain
| 2017-09-29 | Paper |
On the approximability of budget feasible mechanisms
| 2017-09-29 | Paper |
Worst-case mechanism design via Bayesian analysis
SIAM Journal on Computing | 2017-08-18 | Paper |
Holographic algorithms with matchgates capture precisely tractable planar \#CSP
SIAM Journal on Computing | 2017-05-30 | Paper |
The complexity of ferromagnetic two-spin systems with external fields
| 2017-03-22 | Paper |
The complexity of approximating conservative counting CSPs
| 2017-01-30 | Paper |
Nonnegative weighted \#CSP: an effective complexity dichotomy
SIAM Journal on Computing | 2016-12-21 | Paper |
Erratum to: ``Signature theory in holographic algorithms
Algorithmica | 2016-05-31 | Paper |
A dichotomy for real weighted Holant problems
Computational Complexity | 2016-03-21 | Paper |
FPTAS for \#BIS with degree bounds on one side
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Optimal competitive auctions
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Truthful generalized assignments via stable matching
Mathematics of Operations Research | 2015-03-31 | Paper |
Holant problems and counting CSP
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Characterization of truthful mechanisms for one-dimensional single facility location game with payments
Web and Internet Economics | 2015-01-12 | Paper |
FPTAS for counting weighted edge covers
Algorithms - ESA 2014 | 2014-10-08 | Paper |
The complexity of approximating conservative counting CSPs
Journal of Computer and System Sciences | 2014-09-22 | Paper |
FPTAS for weighted Fibonacci gates and its applications
Automata, Languages, and Programming | 2014-07-01 | Paper |
Budget feasible mechanism design, from prior-free to Bayesian
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Worst-case Nash equilibria in restricted routing
Journal of Computer Science and Technology | 2014-02-11 | Paper |
The complexity of complex weighted Boolean \#CSP
Journal of Computer and System Sciences | 2014-01-28 | Paper |
Improved FPTAS for multi-spin systems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Graph homomorphisms with complex values: a dichotomy theorem
SIAM Journal on Computing | 2013-09-25 | Paper |
Competitive auctions for markets with positive externalities
Automata, Languages, and Programming | 2013-08-07 | Paper |
The complexity of symmetric Boolean parity Holant problems
SIAM Journal on Computing | 2013-07-04 | Paper |
An improved randomized truthful mechanism for scheduling unrelated machines
| 2013-03-19 | Paper |
From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems
Algorithmica | 2013-01-28 | Paper |
Holographic algorithms by Fibonacci gates
Linear Algebra and its Applications | 2013-01-16 | Paper |
Holographic reduction, interpolation and hardness
Computational Complexity | 2012-12-27 | Paper |
Inapproximability after uniqueness phase transition in two-spin systems
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Complexity dichotomies of counting problems
| 2012-07-21 | Paper |
The complexity of weighted Boolean \#CSP modulo \(k\)
| 2012-01-23 | Paper |
Signature theory in holographic algorithms
Algorithmica | 2011-12-14 | Paper |
Computational complexity of Holant problems
SIAM Journal on Computing | 2011-11-07 | Paper |
The complexity of symmetric Boolean parity Holant problems (extended abstract)
Automata, Languages and Programming | 2011-07-06 | Paper |
A computational proof of complexity of some restricted counting problems
Theoretical Computer Science | 2011-05-18 | Paper |
Holographic algorithms: from art to science
Journal of Computer and System Sciences | 2011-01-18 | Paper |
From Holant to \#CSP and back: dichotomy for Holant\(^{c }\) problems
Algorithms and Computation | 2010-12-09 | Paper |
On tractable exponential sums
Frontiers in Algorithmics | 2010-09-07 | Paper |
Graph homomorphisms with complex values: a dichotomy theorem (extended abstract)
Automata, Languages and Programming | 2010-09-07 | Paper |
scientific article; zbMATH DE number 5764803 (Why is no real title available?)
| 2010-08-06 | Paper |
On symmetric signatures in holographic algorithms
Theory of Computing Systems | 2010-05-05 | Paper |
On blockwise symmetric signatures for matchgates
Theoretical Computer Science | 2010-02-09 | Paper |
On the theory of matchgate computations
Theory of Computing Systems | 2009-09-18 | Paper |
A Computational Proof of Complexity of Some Restricted Counting Problems
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Holographic algorithms: the power of dimensionality resolved
Theoretical Computer Science | 2009-04-29 | Paper |
Signature Theory in Holographic Algorithms
Algorithms and Computation | 2009-01-29 | Paper |
Holographic algorithms: from art to science
| 2009-01-05 | Paper |
Basis collapse in holographic algorithms
Computational Complexity | 2008-08-20 | Paper |
On Block-Wise Symmetric Signatures for Matchgates
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Holographic Algorithms: The Power of Dimensionality Resolved
Automata, Languages and Programming | 2007-11-28 | Paper |
On Symmetric Signatures in Holographic Algorithms
STACS 2007 | 2007-09-03 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
