Vladimir Kolmogorov

From MaRDI portal
Person:334916

Available identifiers

zbMath Open kolmogorov.vladimirMaRDI QIDQ334916

List of research outcomes





PublicationDate of PublicationType
Generalized minimum 0-extension problem and discrete convexity2025-01-17Paper
Parameter estimation for Gibbs distributions2024-11-14Paper
A New Notion of Commutativity for the Algorithmic Lovász Local Lemma2023-11-20Paper
Testing the Complexity of a Valued CSP Language2022-07-21Paper
One-sided Frank-Wolfe algorithms for saddle problems2021-01-29Paper
A local lemma for focused stochastic algorithms2019-11-08Paper
Extensions of the Algorithmic Lovasz Local Lemma2019-10-03Paper
The complexity of conservative valued CSPs2019-05-10Paper
Parameter estimation for integer-valued Gibbs distributions2019-04-05Paper
Even delta-matroids and the complexity of planar Boolean CSPs2019-03-28Paper
Superconcentrators of density 25.3.2018-11-29Paper
Commutativity in the Algorithmic Lovász Local Lemma2018-11-20Paper
Even delta-matroids and the complexity of planar Boolean CSPs2018-07-16Paper
The complexity of general-valued CSPs2017-07-21Paper
Inference algorithms for pattern-based CRFs on sequence data2016-11-01Paper
Total variation on a tree2016-08-17Paper
On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model2016-07-15Paper
Effectiveness of structural restrictions for hybrid CSPs2016-01-11Paper
Proofs of space2015-12-10Paper
The power of linear programming for general-valued CSPs2015-06-02Paper
The complexity of conservative valued CSPs2014-02-17Paper
The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization2013-08-06Paper
Towards minimizing \(k\)-submodular functions2012-11-02Paper
Minimizing a sum of submodular functions2012-10-26Paper
Generalized roof duality and bisubmodular functions2012-05-04Paper
An analysis of convex relaxations for MAP estimation of discrete MRFs2012-04-17Paper
Submodularity on a tree: unifying \(L^\natural\)-convex and bisubmodular functions2011-08-17Paper
A faster algorithm for computing the principal sequence of partitions of a graph2010-02-23Paper
New algorithms for convex cost tension problem with application to computer vision2009-11-23Paper
Blossom V: A new implementation of a minimum cost perfect matching algorithm2009-10-20Paper
https://portal.mardi4nfdi.de/entity/Q44594982004-03-29Paper
https://portal.mardi4nfdi.de/entity/Q44594992004-03-29Paper
https://portal.mardi4nfdi.de/entity/Q47873572003-01-06Paper
Generalized minimum 0-extension problem and discrete convexityN/APaper
Parameter estimation for Gibbs distributionsN/APaper

Research outcomes over time

This page was built for person: Vladimir Kolmogorov