10 Publications

Mark all

[10]
2019 | Journal Article | IST-REx-ID: 6032   OA
Kazda A, Kolmogorov V, Rolinek M. 2019. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2).
View | DOI | Download (ext.) | arXiv
 
[9]
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security 51–65.
View | DOI | Download (ext.)
 
[8]
2018 | Journal Article | IST-REx-ID: 18   OA
Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 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. 2018. Efficient optimization for rank-based loss functions. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition 3693–3701.
View | DOI | Download (ext.) | arXiv
 
[6]
2017 | Conference Paper | IST-REx-ID: 1192   OA
Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms 307–326.
View | DOI | Download (ext.)
 
[5]
2017 | Journal Article | IST-REx-ID: 644   OA
Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.
View | Files available | DOI | Download (ext.)
 
[4]
2017 | Thesis | IST-REx-ID: 992   OA
Rolinek M. 2017. Complexity of constraint satisfaction, IST Austria, 97p.
View | Files available | DOI
 
[3]
2016 | Journal Article | IST-REx-ID: 1377   OA
Kolmogorov V, Pock T, Rolinek M. 2016. Total variation on a tree. SIAM Journal on Imaging Sciences. 9(2), 605–636.
View | DOI | Download (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1636   OA
Kolmogorov V, Rolinek M, Takhanov R. 2015. Effectiveness of structural restrictions for hybrid CSPs. 9472, 566–577.
View | DOI | Download (ext.)
 
[1]
2015 | Conference Paper | IST-REx-ID: 1637
Kolmogorov V, Krokhin A, Rolinek M. 2015. The complexity of general-valued CSPs. FOCS: Foundations of Computer Science, 56th Annual Symposium on Foundations of Computer Science, 1246–1258.
View | Files available | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed

10 Publications

Mark all

[10]
2019 | Journal Article | IST-REx-ID: 6032   OA
Kazda A, Kolmogorov V, Rolinek M. 2019. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2).
View | DOI | Download (ext.) | arXiv
 
[9]
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security 51–65.
View | DOI | Download (ext.)
 
[8]
2018 | Journal Article | IST-REx-ID: 18   OA
Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 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. 2018. Efficient optimization for rank-based loss functions. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition 3693–3701.
View | DOI | Download (ext.) | arXiv
 
[6]
2017 | Conference Paper | IST-REx-ID: 1192   OA
Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms 307–326.
View | DOI | Download (ext.)
 
[5]
2017 | Journal Article | IST-REx-ID: 644   OA
Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.
View | Files available | DOI | Download (ext.)
 
[4]
2017 | Thesis | IST-REx-ID: 992   OA
Rolinek M. 2017. Complexity of constraint satisfaction, IST Austria, 97p.
View | Files available | DOI
 
[3]
2016 | Journal Article | IST-REx-ID: 1377   OA
Kolmogorov V, Pock T, Rolinek M. 2016. Total variation on a tree. SIAM Journal on Imaging Sciences. 9(2), 605–636.
View | DOI | Download (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1636   OA
Kolmogorov V, Rolinek M, Takhanov R. 2015. Effectiveness of structural restrictions for hybrid CSPs. 9472, 566–577.
View | DOI | Download (ext.)
 
[1]
2015 | Conference Paper | IST-REx-ID: 1637
Kolmogorov V, Krokhin A, Rolinek M. 2015. The complexity of general-valued CSPs. FOCS: Foundations of Computer Science, 56th Annual Symposium on Foundations of Computer Science, 1246–1258.
View | Files available | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed