11 Publications

Mark all

[11]
2018 | Journal Article | IST-REx-ID: 6032 | OA
Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 273 | OA
Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–701, doi:10.1109/cvpr.2018.00389.
View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2018 | Journal Article | IST-REx-ID: 18 | OA
Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.
View | Download Preprint (ext.) | arXiv
 
[8]
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
View | DOI | Download Submitted Version (ext.)
 
[7]
2017 | Journal Article | IST-REx-ID: 644 | OA
Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
View | Files available | DOI | Download Preprint (ext.)
 
[6]
2017 | Thesis | IST-REx-ID: 992 | OA
Rolinek, Michal. Complexity of Constraint Satisfaction. IST Austria, 2017, doi:10.15479/AT:ISTA:th_815.
View | Files available | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 1192 | OA
Kazda, Alexandr, et al. Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SIAM, 2017, pp. 307–26, doi:10.1137/1.9781611974782.20.
View | Files available | DOI | Download Submitted Version (ext.)
 
[4]
2016 | Journal Article | IST-REx-ID: 1377 | OA
Kolmogorov, Vladimir, et al. “Total Variation on a Tree.” SIAM Journal on Imaging Sciences, vol. 9, no. 2, Society for Industrial and Applied Mathematics , 2016, pp. 605–36, doi:10.1137/15M1010257.
View | DOI | Download Preprint (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1636 | OA
Kolmogorov, Vladimir, et al. Effectiveness of Structural Restrictions for Hybrid CSPs. Vol. 9472, Springer, 2015, pp. 566–77, doi:10.1007/978-3-662-48971-0_48.
View | DOI | Download Preprint (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1637 | OA
Kolmogorov, Vladimir, et al. The Complexity of General-Valued CSPs. IEEE, 2015, pp. 1246–58, doi:10.1109/FOCS.2015.80.
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.
View | Files available
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

11 Publications

Mark all

[11]
2018 | Journal Article | IST-REx-ID: 6032 | OA
Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[10]
2018 | Conference Paper | IST-REx-ID: 273 | OA
Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–701, doi:10.1109/cvpr.2018.00389.
View | DOI | Download Preprint (ext.) | arXiv
 
[9]
2018 | Journal Article | IST-REx-ID: 18 | OA
Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.
View | Download Preprint (ext.) | arXiv
 
[8]
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
View | DOI | Download Submitted Version (ext.)
 
[7]
2017 | Journal Article | IST-REx-ID: 644 | OA
Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
View | Files available | DOI | Download Preprint (ext.)
 
[6]
2017 | Thesis | IST-REx-ID: 992 | OA
Rolinek, Michal. Complexity of Constraint Satisfaction. IST Austria, 2017, doi:10.15479/AT:ISTA:th_815.
View | Files available | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 1192 | OA
Kazda, Alexandr, et al. Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SIAM, 2017, pp. 307–26, doi:10.1137/1.9781611974782.20.
View | Files available | DOI | Download Submitted Version (ext.)
 
[4]
2016 | Journal Article | IST-REx-ID: 1377 | OA
Kolmogorov, Vladimir, et al. “Total Variation on a Tree.” SIAM Journal on Imaging Sciences, vol. 9, no. 2, Society for Industrial and Applied Mathematics , 2016, pp. 605–36, doi:10.1137/15M1010257.
View | DOI | Download Preprint (ext.)
 
[3]
2015 | Conference Paper | IST-REx-ID: 1636 | OA
Kolmogorov, Vladimir, et al. Effectiveness of Structural Restrictions for Hybrid CSPs. Vol. 9472, Springer, 2015, pp. 566–77, doi:10.1007/978-3-662-48971-0_48.
View | DOI | Download Preprint (ext.)
 
[2]
2015 | Conference Paper | IST-REx-ID: 1637 | OA
Kolmogorov, Vladimir, et al. The Complexity of General-Valued CSPs. IEEE, 2015, pp. 1246–58, doi:10.1109/FOCS.2015.80.
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.
View | Files available
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed