DOI,IST REx ID,Research Group,Title of publication
10.4230/LIPIcs.ICALP.2023.72,14084,VlKo,Parameter estimation for Gibbs distributions
10.1109/CVPR52729.2023.01153,14448,VlKo,Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe directions
10.3233/IDA-205623,10737,VlKo,Combining pattern-based CRFs and weighted context-free grammars
10.48550/arXiv.2109.10203,10045,"GradSch,VlKo",Generalized minimum 0-extension problem and discrete convexity
10.4230/LIPIcs.APPROX/RANDOM.2021.31,10072,VlKo,A new notion of commutativity for the algorithmic Lovász Local Lemma
null,10552,VlKo,One-sided Frank-Wolfe algorithms for saddle problems
10.1137/16m109332x,7412,VlKo,A local lemma for focused stochastical algorithms
10.1109/CVPR.2019.01140,7468,VlKo,Map inference via block-coordinate Frank-Wolfe algorithm
10.1109/ICCVW.2019.00097,7639,VlKo,Function norms for neural networks
10.4230/LIPICS.ICALP.2019.77,6725,VlKo,Testing the complexity of a valued CSP language
null,18,VlKo,Superconcentrators of density 25.3
10.1137/16m1093306,5975,VlKo,Commutativity in the algorithmic Lovász local lemma
10.1145/3230649,6032,VlKo,Even delta-matroids and the complexity of planar boolean CSPs
10.1109/cvpr.2018.00389,273,VlKo,Efficient optimization for rank-based loss functions
10.1137/16M1091836,644,VlKo,The complexity of general-valued CSPs
10.1137/1.9781611974782.20,1192,VlKo,Even delta-matroids and the complexity of planar Boolean CSPs
null,274,VlKo,A faster approximation algorithm for the Gibbs partition function
10.1007/978-3-662-49896-5_13,1231,"KrPi,VlKo",On the complexity of scrypt and proofs of space in the parallel random oracle model
10.1007/s00453-015-0017-7,1794,VlKo,Inference algorithms for pattern-based CRFs on sequence data
10.1137/15M1010257,1377,VlKo,Total variation on a tree