Michal Rolinek

Kolmogorov Group

11 Publications

Mark all

[11]
2018 | Conference Paper | IST-REx-ID: 273 | OA
Mohapatra, Pritish, Michal Rolinek, C V Jawahar, Vladimir Kolmogorov, and M Pawan Kumar. “Efficient Optimization for Rank-Based Loss Functions.” In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 3693–3701. IEEE, 2018. https://doi.org/10.1109/cvpr.2018.00389.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar. “On the Memory Hardness of Data Independent Password Hashing Functions.” In Proceedings of the 2018 on Asia Conference on Computer and Communication Security, 51–65. ACM, 2018. https://doi.org/10.1145/3196494.3196534.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[9]
2018 | Journal Article | IST-REx-ID: 18 | OA
Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria. Charles Babbage Research Centre, 2018.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 6032 | OA
Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms. ACM, 2018. https://doi.org/10.1145/3230649.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[7]
2017 | Journal Article | IST-REx-ID: 644 | OA
Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2017. https://doi.org/10.1137/16M1091836.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[6]
2017 | Thesis | IST-REx-ID: 992 | OA
Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815.
[Published Version] View | Files available | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 1192 | OA
Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. https://doi.org/10.1137/1.9781611974782.20.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 
[4]
2016 | Journal Article | IST-REx-ID: 1377 | OA
Kolmogorov, Vladimir, Thomas Pock, and Michal Rolinek. “Total Variation on a Tree.” SIAM Journal on Imaging Sciences. Society for Industrial and Applied Mathematics , 2016. https://doi.org/10.1137/15M1010257.
[Preprint] View | DOI | Download Preprint (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1636 | OA
Kolmogorov, Vladimir, Michal Rolinek, and Rustem Takhanov. “Effectiveness of Structural Restrictions for Hybrid CSPs.” In 26th International Symposium, 9472:566–77. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-48971-0_48.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2015 | Conference Paper | IST-REx-ID: 1637 | OA
Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs,” 1246–58. IEEE, 2015. https://doi.org/10.1109/FOCS.2015.80.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[1]
2014 | Working Paper | IST-REx-ID: 7038 | OA
Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction to Mathematical Games. IST Austria, n.d.
[Published Version] View | Files available
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Chicago

    Export / Embed

11 Publications

Mark all

[11]
2018 | Conference Paper | IST-REx-ID: 273 | OA
Mohapatra, Pritish, Michal Rolinek, C V Jawahar, Vladimir Kolmogorov, and M Pawan Kumar. “Efficient Optimization for Rank-Based Loss Functions.” In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 3693–3701. IEEE, 2018. https://doi.org/10.1109/cvpr.2018.00389.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar. “On the Memory Hardness of Data Independent Password Hashing Functions.” In Proceedings of the 2018 on Asia Conference on Computer and Communication Security, 51–65. ACM, 2018. https://doi.org/10.1145/3196494.3196534.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[9]
2018 | Journal Article | IST-REx-ID: 18 | OA
Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria. Charles Babbage Research Centre, 2018.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 6032 | OA
Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms. ACM, 2018. https://doi.org/10.1145/3230649.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[7]
2017 | Journal Article | IST-REx-ID: 644 | OA
Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2017. https://doi.org/10.1137/16M1091836.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[6]
2017 | Thesis | IST-REx-ID: 992 | OA
Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815.
[Published Version] View | Files available | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 1192 | OA
Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. https://doi.org/10.1137/1.9781611974782.20.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 
[4]
2016 | Journal Article | IST-REx-ID: 1377 | OA
Kolmogorov, Vladimir, Thomas Pock, and Michal Rolinek. “Total Variation on a Tree.” SIAM Journal on Imaging Sciences. Society for Industrial and Applied Mathematics , 2016. https://doi.org/10.1137/15M1010257.
[Preprint] View | DOI | Download Preprint (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1636 | OA
Kolmogorov, Vladimir, Michal Rolinek, and Rustem Takhanov. “Effectiveness of Structural Restrictions for Hybrid CSPs.” In 26th International Symposium, 9472:566–77. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-48971-0_48.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[2]
2015 | Conference Paper | IST-REx-ID: 1637 | OA
Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs,” 1246–58. IEEE, 2015. https://doi.org/10.1109/FOCS.2015.80.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[1]
2014 | Working Paper | IST-REx-ID: 7038 | OA
Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction to Mathematical Games. IST Austria, n.d.
[Published Version] View | Files available
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Chicago

    Export / Embed