11 Publications

Mark all

[11]
2018 | Journal Article | IST-REx-ID: 6032 | OA
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2, 2018.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 273 | OA
P. Mohapatra, M. Rolinek, C. V. Jawahar, V. Kolmogorov, and M. P. Kumar, “Efficient optimization for rank-based loss functions,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 2018, pp. 3693–3701.
View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2018 | Journal Article | IST-REx-ID: 18 | OA
V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars Combinatoria, vol. 141, no. 10, pp. 269–304, 2018.
View | Download Preprint (ext.) | arXiv
 
[8]
2018 | Conference Paper | IST-REx-ID: 193 | OA
J. F. Alwen 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, Incheon, Republic of Korea, 2018, pp. 51–65.
View | DOI | Download Submitted Version (ext.)
 
[7]
2017 | Journal Article | IST-REx-ID: 644 | OA
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” SIAM Journal on Computing, vol. 46, no. 3, pp. 1087–1110, 2017.
View | Files available | DOI | Download Preprint (ext.)
 
[6]
2017 | Thesis | IST-REx-ID: 992 | OA
M. Rolinek, Complexity of constraint satisfaction. IST Austria, 2017.
View | Files available | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 1192 | OA
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.
View | Files available | DOI | Download Submitted Version (ext.)
 
[4]
2016 | Journal Article | IST-REx-ID: 1377 | OA
V. Kolmogorov, T. Pock, and M. Rolinek, “Total variation on a tree,” SIAM Journal on Imaging Sciences, vol. 9, no. 2, pp. 605–636, 2016.
View | DOI | Download Preprint (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1636 | OA
V. Kolmogorov, M. Rolinek, and R. Takhanov, “Effectiveness of structural restrictions for hybrid CSPs,” vol. 9472. Springer, pp. 566–577, 2015.
View | DOI | Download Preprint (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1637 | OA
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States, 2015, pp. 1246–1258.
View | Files available | DOI | Download Preprint (ext.)
 
[1]
2014 | Working Paper | IST-REx-ID: 7038 | OA
K. Huszár and M. Rolinek, Playful Math - An introduction to mathematical games. IST Austria.
View | Files available
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

11 Publications

Mark all

[11]
2018 | Journal Article | IST-REx-ID: 6032 | OA
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2, 2018.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 273 | OA
P. Mohapatra, M. Rolinek, C. V. Jawahar, V. Kolmogorov, and M. P. Kumar, “Efficient optimization for rank-based loss functions,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 2018, pp. 3693–3701.
View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2018 | Journal Article | IST-REx-ID: 18 | OA
V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars Combinatoria, vol. 141, no. 10, pp. 269–304, 2018.
View | Download Preprint (ext.) | arXiv
 
[8]
2018 | Conference Paper | IST-REx-ID: 193 | OA
J. F. Alwen 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, Incheon, Republic of Korea, 2018, pp. 51–65.
View | DOI | Download Submitted Version (ext.)
 
[7]
2017 | Journal Article | IST-REx-ID: 644 | OA
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” SIAM Journal on Computing, vol. 46, no. 3, pp. 1087–1110, 2017.
View | Files available | DOI | Download Preprint (ext.)
 
[6]
2017 | Thesis | IST-REx-ID: 992 | OA
M. Rolinek, Complexity of constraint satisfaction. IST Austria, 2017.
View | Files available | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 1192 | OA
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.
View | Files available | DOI | Download Submitted Version (ext.)
 
[4]
2016 | Journal Article | IST-REx-ID: 1377 | OA
V. Kolmogorov, T. Pock, and M. Rolinek, “Total variation on a tree,” SIAM Journal on Imaging Sciences, vol. 9, no. 2, pp. 605–636, 2016.
View | DOI | Download Preprint (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1636 | OA
V. Kolmogorov, M. Rolinek, and R. Takhanov, “Effectiveness of structural restrictions for hybrid CSPs,” vol. 9472. Springer, pp. 566–577, 2015.
View | DOI | Download Preprint (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1637 | OA
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States, 2015, pp. 1246–1258.
View | Files available | DOI | Download Preprint (ext.)
 
[1]
2014 | Working Paper | IST-REx-ID: 7038 | OA
K. Huszár and M. Rolinek, Playful Math - An introduction to mathematical games. IST Austria.
View | Files available
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed