11 Publications

Mark all

[11]
2019 | Journal Article | IST-REx-ID: 6032   OA
Even delta-matroids and the complexity of planar boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2019).
View | DOI | Download (ext.) | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 193   OA
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
View | DOI | Download (ext.)
 
[9]
2018 | Journal Article | IST-REx-ID: 18   OA
Superconcentrators of density 25.3
V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.
View | Download (ext.) | arXiv
 
[8]
2018 | Conference Paper | IST-REx-ID: 273   OA
Efficient optimization for rank-based loss functions
P. Mohapatra, M. Rolinek, C.V. Jawahar, V. Kolmogorov, M.P. Kumar, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–3701.
View | DOI | Download (ext.) | arXiv
 
[7]
2017 | Conference Paper | IST-REx-ID: 1192   OA
Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
View | DOI | Download (ext.)
 
[6]
2017 | Journal Article | IST-REx-ID: 644   OA
The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.
View | Files available | DOI | Download (ext.)
 
[5]
2017 | Thesis | IST-REx-ID: 992   OA
Complexity of constraint satisfaction
M. Rolinek, Complexity of Constraint Satisfaction, IST Austria, 2017.
View | Files available | DOI
 
[4]
2016 | Journal Article | IST-REx-ID: 1377   OA
Total variation on a tree
V. Kolmogorov, T. Pock, M. Rolinek, SIAM Journal on Imaging Sciences 9 (2016) 605–636.
View | DOI | Download (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1636   OA
Effectiveness of structural restrictions for hybrid CSPs
V. Kolmogorov, M. Rolinek, R. Takhanov, 9472 (2015) 566–577.
View | DOI | Download (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1637
The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, in:, IEEE, 2015, pp. 1246–1258.
View | Files available | DOI | Download (ext.)
 
[1]
2014 | Working Paper | IST-REx-ID: 7038   OA
Playful Math - An introduction to mathematical games
K. Huszár, M. Rolinek, Playful Math - An Introduction to Mathematical Games, IST Austria, n.d.
View | Files available
 

Search

Filter Publications

Display / Sort

Export / Embed

11 Publications

Mark all

[11]
2019 | Journal Article | IST-REx-ID: 6032   OA
Even delta-matroids and the complexity of planar boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2019).
View | DOI | Download (ext.) | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 193   OA
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
View | DOI | Download (ext.)
 
[9]
2018 | Journal Article | IST-REx-ID: 18   OA
Superconcentrators of density 25.3
V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.
View | Download (ext.) | arXiv
 
[8]
2018 | Conference Paper | IST-REx-ID: 273   OA
Efficient optimization for rank-based loss functions
P. Mohapatra, M. Rolinek, C.V. Jawahar, V. Kolmogorov, M.P. Kumar, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–3701.
View | DOI | Download (ext.) | arXiv
 
[7]
2017 | Conference Paper | IST-REx-ID: 1192   OA
Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
View | DOI | Download (ext.)
 
[6]
2017 | Journal Article | IST-REx-ID: 644   OA
The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.
View | Files available | DOI | Download (ext.)
 
[5]
2017 | Thesis | IST-REx-ID: 992   OA
Complexity of constraint satisfaction
M. Rolinek, Complexity of Constraint Satisfaction, IST Austria, 2017.
View | Files available | DOI
 
[4]
2016 | Journal Article | IST-REx-ID: 1377   OA
Total variation on a tree
V. Kolmogorov, T. Pock, M. Rolinek, SIAM Journal on Imaging Sciences 9 (2016) 605–636.
View | DOI | Download (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1636   OA
Effectiveness of structural restrictions for hybrid CSPs
V. Kolmogorov, M. Rolinek, R. Takhanov, 9472 (2015) 566–577.
View | DOI | Download (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1637
The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, in:, IEEE, 2015, pp. 1246–1258.
View | Files available | DOI | Download (ext.)
 
[1]
2014 | Working Paper | IST-REx-ID: 7038   OA
Playful Math - An introduction to mathematical games
K. Huszár, M. Rolinek, Playful Math - An Introduction to Mathematical Games, IST Austria, n.d.
View | Files available
 

Search

Filter Publications

Display / Sort

Export / Embed