Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




60 Publications

2019 | Conference Paper | IST-REx-ID: 6725 | OA
Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 7000 | OA
Shehu, Yekini, et al. “Convergence Analysis of Projection Method for Variational Inequalities.” Computational and Applied Mathematics, vol. 38, no. 4, 161, Springer Nature, 2019, doi:10.1007/s40314-019-0955-9.
View | DOI | Download Published Version (ext.)
 
2018 | Research Data | IST-REx-ID: 5573 | OA
Alhaija, Hassan, et al. Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow. IST Austria, 2018, doi:10.15479/AT:ISTA:82.
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 5975 | OA
Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial & Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
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
 
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
 
2018 | Journal Article | IST-REx-ID: 703 | OA
Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.
View | DOI | Download Preprint (ext.) | arXiv
 
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
 
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.)
 
2018 | Conference Paper | IST-REx-ID: 5978 | OA
Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI, 2018, pp. 6581–88.
View | Download Preprint (ext.) | arXiv
 

Search

Display / Sort

Citation Style: MLA

Export / Embed