10 Publications

Mark all

[10]
2019 | Journal Article | IST-REx-ID: 6032   OA
Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 2019;15(2). doi:10.1145/3230649
View | DOI | Download (ext.) | arXiv
 
[9]
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534
View | DOI | Download (ext.)
 
[8]
2018 | Journal Article | IST-REx-ID: 18   OA
Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. Ars Combinatoria. 2018;141(10):269-304.
View | Download (ext.) | arXiv
 
[7]
2018 | Conference Paper | IST-REx-ID: 273   OA
Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. Efficient optimization for rank-based loss functions. In: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE; 2018:3693-3701. doi:10.1109/cvpr.2018.00389
View | DOI | Download (ext.) | arXiv
 
[6]
2017 | Conference Paper | IST-REx-ID: 1192   OA
Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:10.1137/1.9781611974782.20
View | DOI | Download (ext.)
 
[5]
2017 | Journal Article | IST-REx-ID: 644   OA
Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836
View | Files available | DOI | Download (ext.)
 
[4]
2017 | Thesis | IST-REx-ID: 992   OA
Rolinek M. Complexity of Constraint Satisfaction. IST Austria; 2017. doi:10.15479/AT:ISTA:th_815
View | Files available | DOI
 
[3]
2016 | Journal Article | IST-REx-ID: 1377   OA
Kolmogorov V, Pock T, Rolinek M. Total variation on a tree. SIAM Journal on Imaging Sciences. 2016;9(2):605-636. doi:10.1137/15M1010257
View | DOI | Download (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1636   OA
Kolmogorov V, Rolinek M, Takhanov R. Effectiveness of structural restrictions for hybrid CSPs. 2015;9472:566-577. doi:10.1007/978-3-662-48971-0_48
View | DOI | Download (ext.)
 
[1]
2015 | Conference Paper | IST-REx-ID: 1637
Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. In: IEEE; 2015:1246-1258. doi:10.1109/FOCS.2015.80
View | Files available | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

10 Publications

Mark all

[10]
2019 | Journal Article | IST-REx-ID: 6032   OA
Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 2019;15(2). doi:10.1145/3230649
View | DOI | Download (ext.) | arXiv
 
[9]
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534
View | DOI | Download (ext.)
 
[8]
2018 | Journal Article | IST-REx-ID: 18   OA
Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. Ars Combinatoria. 2018;141(10):269-304.
View | Download (ext.) | arXiv
 
[7]
2018 | Conference Paper | IST-REx-ID: 273   OA
Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. Efficient optimization for rank-based loss functions. In: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE; 2018:3693-3701. doi:10.1109/cvpr.2018.00389
View | DOI | Download (ext.) | arXiv
 
[6]
2017 | Conference Paper | IST-REx-ID: 1192   OA
Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:10.1137/1.9781611974782.20
View | DOI | Download (ext.)
 
[5]
2017 | Journal Article | IST-REx-ID: 644   OA
Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836
View | Files available | DOI | Download (ext.)
 
[4]
2017 | Thesis | IST-REx-ID: 992   OA
Rolinek M. Complexity of Constraint Satisfaction. IST Austria; 2017. doi:10.15479/AT:ISTA:th_815
View | Files available | DOI
 
[3]
2016 | Journal Article | IST-REx-ID: 1377   OA
Kolmogorov V, Pock T, Rolinek M. Total variation on a tree. SIAM Journal on Imaging Sciences. 2016;9(2):605-636. doi:10.1137/15M1010257
View | DOI | Download (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1636   OA
Kolmogorov V, Rolinek M, Takhanov R. Effectiveness of structural restrictions for hybrid CSPs. 2015;9472:566-577. doi:10.1007/978-3-662-48971-0_48
View | DOI | Download (ext.)
 
[1]
2015 | Conference Paper | IST-REx-ID: 1637
Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. In: IEEE; 2015:1246-1258. doi:10.1109/FOCS.2015.80
View | Files available | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed