| Publication | Date of Publication | Type |
|---|
Generalized minimum 0-extension problem and discrete convexity
Mathematical Programming. Series A. Series B | 2025-01-17 | Paper |
Parameter estimation for Gibbs distributions
| 2024-11-14 | Paper |
A New Notion of Commutativity for the Algorithmic Lovász Local Lemma
| 2023-11-20 | Paper |
Testing the Complexity of a Valued CSP Language
| 2022-07-21 | Paper |
One-sided Frank-Wolfe algorithms for saddle problems
| 2021-01-29 | Paper |
A local lemma for focused stochastic algorithms
SIAM Journal on Computing | 2019-11-08 | Paper |
Extensions of the Algorithmic Lovasz Local Lemma
| 2019-10-03 | Paper |
The complexity of conservative valued CSPs
| 2019-05-10 | Paper |
Parameter estimation for integer-valued Gibbs distributions
| 2019-04-05 | Paper |
Even delta-matroids and the complexity of planar Boolean CSPs
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Superconcentrators of density 25.3.
| 2018-11-29 | Paper |
Commutativity in the Algorithmic Lovász Local Lemma
SIAM Journal on Computing | 2018-11-20 | Paper |
Even delta-matroids and the complexity of planar Boolean CSPs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The complexity of general-valued CSPs
SIAM Journal on Computing | 2017-07-21 | Paper |
Inference algorithms for pattern-based CRFs on sequence data
Algorithmica | 2016-11-01 | Paper |
Total variation on a tree
SIAM Journal on Imaging Sciences | 2016-08-17 | Paper |
On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Effectiveness of structural restrictions for hybrid CSPs
Algorithms and Computation | 2016-01-11 | Paper |
Proofs of space
Lecture Notes in Computer Science | 2015-12-10 | Paper |
The power of linear programming for general-valued CSPs
SIAM Journal on Computing | 2015-06-02 | Paper |
The complexity of conservative valued CSPs
Journal of the ACM | 2014-02-17 | Paper |
The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization
Automata, Languages, and Programming | 2013-08-06 | Paper |
Towards minimizing \(k\)-submodular functions
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Minimizing a sum of submodular functions
Discrete Applied Mathematics | 2012-10-26 | Paper |
Generalized roof duality and bisubmodular functions
Discrete Applied Mathematics | 2012-05-04 | Paper |
An analysis of convex relaxations for MAP estimation of discrete MRFs
Journal of Machine Learning Research (JMLR) | 2012-04-17 | Paper |
Submodularity on a tree: unifying \(L^\natural\)-convex and bisubmodular functions
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
A faster algorithm for computing the principal sequence of partitions of a graph
Algorithmica | 2010-02-23 | Paper |
New algorithms for convex cost tension problem with application to computer vision
Discrete Optimization | 2009-11-23 | Paper |
Blossom V: A new implementation of a minimum cost perfect matching algorithm
Mathematical Programming Computation | 2009-10-20 | Paper |
scientific article; zbMATH DE number 2062604 (Why is no real title available?)
| 2004-03-29 | Paper |
scientific article; zbMATH DE number 2062605 (Why is no real title available?)
| 2004-03-29 | Paper |
scientific article; zbMATH DE number 1849127 (Why is no real title available?)
| 2003-01-06 | Paper |
Generalized minimum 0-extension problem and discrete convexity
| N/A | Paper |
Parameter estimation for Gibbs distributions
| N/A | Paper |
