Michal Rolinek

Kolmogorov Group

11 Publications

Mark all

[11]
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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[10]
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[9]
2018 | Journal Article | IST-REx-ID: 18 | OA
Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 6032 | OA
Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[7]
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[6]
2017 | Thesis | IST-REx-ID: 992 | OA
Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 
[5]
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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 
[4]
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.
[Preprint] View | DOI | Download Preprint (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1636 | OA
Kolmogorov V, Rolinek M, Takhanov R. 2015. Effectiveness of structural restrictions for hybrid CSPs. 26th International Symposium. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 9472, 566–577.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2015 | Conference Paper | IST-REx-ID: 1637 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[1]
2014 | Working Paper | IST-REx-ID: 7038 | OA
Huszár K, Rolinek M. Playful Math - An introduction to mathematical games, IST Austria, 5p.
[Published Version] View | Files available
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: ISTA Annual Report

    Export / Embed

11 Publications

Mark all

[11]
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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[10]
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[9]
2018 | Journal Article | IST-REx-ID: 18 | OA
Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 6032 | OA
Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[7]
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[6]
2017 | Thesis | IST-REx-ID: 992 | OA
Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 
[5]
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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 
[4]
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.
[Preprint] View | DOI | Download Preprint (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1636 | OA
Kolmogorov V, Rolinek M, Takhanov R. 2015. Effectiveness of structural restrictions for hybrid CSPs. 26th International Symposium. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 9472, 566–577.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2015 | Conference Paper | IST-REx-ID: 1637 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[1]
2014 | Working Paper | IST-REx-ID: 7038 | OA
Huszár K, Rolinek M. Playful Math - An introduction to mathematical games, IST Austria, 5p.
[Published Version] View | Files available
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: ISTA Annual Report

    Export / Embed