[{"oa_version":"Submitted Version","type":"conference","department":[{"_id":"KrPi"},{"_id":"HeEd"},{"_id":"VlKo"}],"_id":"193","publist_id":"7723","title":"On the memory hardness of data independent password hashing functions","publication_status":"published","author":[{"full_name":"Alwen, Joel F","first_name":"Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gazi, Peter","last_name":"Gazi","first_name":"Peter"},{"first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan"},{"first_name":"Karen","last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"},{"first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","last_name":"Osang","full_name":"Osang, Georg F","orcid":"0000-0002-8882-5116"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"},{"full_name":"Reyzin, Lenoid","last_name":"Reyzin","first_name":"Lenoid"},{"full_name":"Rolinek, Michal","first_name":"Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek"},{"full_name":"Rybar, Michal","first_name":"Michal","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","last_name":"Rybar"}],"citation":{"apa":"Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z., … Rybar, M. (2018). On the memory hardness of data independent password hashing functions. In <i>Proceedings of the 2018 on Asia Conference on Computer and Communication Security</i> (pp. 51–65). Incheon, Republic of Korea: ACM. <a href=\"https://doi.org/10.1145/3196494.3196534\">https://doi.org/10.1145/3196494.3196534</a>","ieee":"J. F. Alwen <i>et al.</i>, “On the memory hardness of data independent password hashing functions,” in <i>Proceedings of the 2018 on Asia Conference on Computer and Communication Security</i>, Incheon, Republic of Korea, 2018, pp. 51–65.","ama":"Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: <i>Proceedings of the 2018 on Asia Conference on Computer and Communication Security</i>. ACM; 2018:51-65. doi:<a href=\"https://doi.org/10.1145/3196494.3196534\">10.1145/3196494.3196534</a>","ista":"Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security , 51–65.","chicago":"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 <i>Proceedings of the 2018 on Asia Conference on Computer and Communication Security</i>, 51–65. ACM, 2018. <a href=\"https://doi.org/10.1145/3196494.3196534\">https://doi.org/10.1145/3196494.3196534</a>.","short":"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.","mla":"Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” <i>Proceedings of the 2018 on Asia Conference on Computer and Communication Security</i>, ACM, 2018, pp. 51–65, doi:<a href=\"https://doi.org/10.1145/3196494.3196534\">10.1145/3196494.3196534</a>."},"project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"},{"grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks"}],"day":"01","year":"2018","doi":"10.1145/3196494.3196534","date_updated":"2024-11-04T13:52:29Z","date_published":"2018-06-01T00:00:00Z","external_id":{"isi":["000516620100005"]},"language":[{"iso":"eng"}],"acknowledgement":"Leonid Reyzin was supported in part by IST Austria and by US NSF grants 1012910, 1012798, and 1422965; this research was performed while he was visiting IST Austria.","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/783"}],"isi":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","ec_funded":1,"publication":"Proceedings of the 2018 on Asia Conference on Computer and Communication Security","conference":{"name":"ASIACCS: Asia Conference on Computer and Communications Security ","start_date":"2018-06-04","location":"Incheon, Republic of Korea","end_date":"2018-06-08"},"month":"06","abstract":[{"text":"We show attacks on five data-independent memory-hard functions (iMHF) that were submitted to the password hashing competition (PHC). Informally, an MHF is a function which cannot be evaluated on dedicated hardware, like ASICs, at significantly lower hardware and/or energy cost than evaluating a single instance on a standard single-core architecture. Data-independent means the memory access pattern of the function is independent of the input; this makes iMHFs harder to construct than data-dependent ones, but the latter can be attacked by various side-channel attacks. Following [Alwen-Blocki'16], we capture the evaluation of an iMHF as a directed acyclic graph (DAG). The cumulative parallel pebbling complexity of this DAG is a measure for the hardware cost of evaluating the iMHF on an ASIC. Ideally, one would like the complexity of a DAG underlying an iMHF to be as close to quadratic in the number of nodes of the graph as possible. Instead, we show that (the DAGs underlying) the following iMHFs are far from this bound: Rig.v2, TwoCats and Gambit each having an exponent no more than 1.75. Moreover, we show that the complexity of the iMHF modes of the PHC finalists Pomelo and Lyra2 have exponents at most 1.83 and 1.67 respectively. To show this we investigate a combinatorial property of each underlying DAG (called its depth-robustness. By establishing upper bounds on this property we are then able to apply the general technique of [Alwen-Block'16] for analyzing the hardware costs of an iMHF.","lang":"eng"}],"status":"public","page":"51 - 65","publisher":"ACM","oa":1,"date_created":"2018-12-11T11:45:07Z","quality_controlled":"1","article_processing_charge":"No"},{"datarep_id":"82","contributor":[{"first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","contributor_type":"researcher"}],"author":[{"full_name":"Alhaija, Hassan","last_name":"Alhaija","first_name":"Hassan"},{"first_name":"Anita","last_name":"Sellent","full_name":"Sellent, Anita"},{"full_name":"Kondermann, Daniel","last_name":"Kondermann","first_name":"Daniel"},{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"}],"citation":{"mla":"Alhaija, Hassan, et al. <i>Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:82\">10.15479/AT:ISTA:82</a>.","short":"H. Alhaija, A. Sellent, D. Kondermann, C. Rother, (2018).","chicago":"Alhaija, Hassan, Anita Sellent, Daniel Kondermann, and Carsten Rother. “Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:82\">https://doi.org/10.15479/AT:ISTA:82</a>.","ista":"Alhaija H, Sellent A, Kondermann D, Rother C. 2018. Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:82\">10.15479/AT:ISTA:82</a>.","ama":"Alhaija H, Sellent A, Kondermann D, Rother C. Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:82\">10.15479/AT:ISTA:82</a>","apa":"Alhaija, H., Sellent, A., Kondermann, D., &#38; Rother, C. (2018). Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:82\">https://doi.org/10.15479/AT:ISTA:82</a>","ieee":"H. Alhaija, A. Sellent, D. Kondermann, and C. Rother, “Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow.” Institute of Science and Technology Austria, 2018."},"title":"Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow","type":"research_data","oa_version":"Published Version","_id":"5573","department":[{"_id":"VlKo"}],"ddc":["001"],"file_date_updated":"2020-07-14T12:47:05Z","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","date_created":"2018-12-12T12:31:36Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","oa":1,"related_material":{"link":[{"relation":"research_paper","url":"https://doi.org/10.1007/978-3-319-24947-6_23"}]},"keyword":["graph matching","quadratic assignment problem<"],"abstract":[{"text":"Graph matching problems for large displacement optical flow of RGB-D images.","lang":"eng"}],"doi":"10.15479/AT:ISTA:82","status":"public","month":"01","year":"2018","day":"04","file":[{"relation":"main_file","date_updated":"2020-07-14T12:47:05Z","file_name":"IST-2018-82-v1+1_GraphFlowMatchingProblems.zip","checksum":"53c17082848e12f3c2e1b4185b578208","content_type":"application/zip","file_size":1737958,"access_level":"open_access","creator":"system","date_created":"2018-12-12T13:02:34Z","file_id":"5600"}],"tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","short":"CC0 (1.0)"},"license":"https://creativecommons.org/publicdomain/zero/1.0/","date_updated":"2024-02-21T13:41:17Z","date_published":"2018-01-04T00:00:00Z"},{"_id":"5975","department":[{"_id":"VlKo"}],"intvolume":"        47","type":"journal_article","oa_version":"Preprint","citation":{"ista":"Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056.","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” <i>SIAM Journal on Computing</i>. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/16m1093306\">https://doi.org/10.1137/16m1093306</a>.","short":"V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.","mla":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” <i>SIAM Journal on Computing</i>, vol. 47, no. 6, Society for Industrial and Applied Mathematics, 2018, pp. 2029–56, doi:<a href=\"https://doi.org/10.1137/16m1093306\">10.1137/16m1093306</a>.","ieee":"V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” <i>SIAM Journal on Computing</i>, vol. 47, no. 6. Society for Industrial and Applied Mathematics, pp. 2029–2056, 2018.","apa":"Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. <i>SIAM Journal on Computing</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/16m1093306\">https://doi.org/10.1137/16m1093306</a>","ama":"Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. <i>SIAM Journal on Computing</i>. 2018;47(6):2029-2056. doi:<a href=\"https://doi.org/10.1137/16m1093306\">10.1137/16m1093306</a>"},"author":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"}],"publication_status":"published","project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"title":"Commutativity in the algorithmic Lovász local lemma","arxiv":1,"external_id":{"arxiv":["1506.08547"],"isi":["000453785100001"]},"date_updated":"2025-09-22T09:44:20Z","date_published":"2018-11-08T00:00:00Z","doi":"10.1137/16m1093306","day":"08","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"1193","relation":"earlier_version","status":"public"}]},"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1506.08547","open_access":"1"}],"isi":1,"issue":"6","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"publication":"SIAM Journal on Computing","ec_funded":1,"page":"2029-2056","abstract":[{"text":"We consider the recent formulation of the algorithmic Lov ́asz Local Lemma  [N. Har-vey and J. Vondr ́ak, inProceedings of FOCS, 2015, pp. 1327–1345; D. Achlioptas and F. Iliopoulos,inProceedings of SODA, 2016, pp. 2024–2038; D. Achlioptas, F. Iliopoulos, and V. Kolmogorov,ALocal Lemma for Focused Stochastic Algorithms, arXiv preprint, 2018] for finding objects that avoid“bad  features,”  or  “flaws.”   It  extends  the  Moser–Tardos  resampling  algorithm  [R.  A.  Moser  andG. Tardos,J. ACM, 57 (2010), 11] to more general discrete spaces.  At each step the method picks aflaw present in the current state and goes to a new state according to some prespecified probabilitydistribution (which depends on the current state and the selected flaw).  However, the recent formu-lation is less flexible than the Moser–Tardos method since it requires a specific flaw selection rule,whereas the algorithm of Moser and Tardos allows an arbitrary rule (and thus can potentially beimplemented more efficiently).  We formulate a new “commutativity” condition and prove that it issufficient for an arbitrary rule to work.  It also enables an efficient parallelization under an additionalassumption.  We then show that existing resampling oracles for perfect matchings and permutationsdo satisfy this condition.","lang":"eng"}],"status":"public","month":"11","volume":47,"article_processing_charge":"No","date_created":"2019-02-13T12:59:33Z","oa":1,"quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics"},{"department":[{"_id":"VlKo"}],"conference":{"location":"New Orleans, LU, United States","end_date":"2018-02-07","name":"AAAI: Conference on Artificial Intelligence","start_date":"2018-02-02"},"_id":"5978","oa_version":"Preprint","publication":"Proceedings of the 32st AAAI Conference on Artificial Intelligence","type":"conference","title":"Exact MAP-inference by confining combinatorial search with LP relaxation","citation":{"ieee":"S. Haller, P. Swoboda, and B. Savchynskyy, “Exact MAP-inference by confining combinatorial search with LP relaxation,” in <i>Proceedings of the 32st AAAI Conference on Artificial Intelligence</i>, New Orleans, LU, United States, 2018, pp. 6581–6588.","apa":"Haller, S., Swoboda, P., &#38; Savchynskyy, B. (2018). Exact MAP-inference by confining combinatorial search with LP relaxation. In <i>Proceedings of the 32st AAAI Conference on Artificial Intelligence</i> (pp. 6581–6588). New Orleans, LU, United States: AAAI Press.","ama":"Haller S, Swoboda P, Savchynskyy B. Exact MAP-inference by confining combinatorial search with LP relaxation. In: <i>Proceedings of the 32st AAAI Conference on Artificial Intelligence</i>. AAAI Press; 2018:6581-6588.","ista":"Haller S, Swoboda P, Savchynskyy B. 2018. Exact MAP-inference by confining combinatorial search with LP relaxation. Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence, 6581–6588.","chicago":"Haller, Stefan, Paul Swoboda, and Bogdan Savchynskyy. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” In <i>Proceedings of the 32st AAAI Conference on Artificial Intelligence</i>, 6581–88. AAAI Press, 2018.","short":"S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588.","mla":"Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” <i>Proceedings of the 32st AAAI Conference on Artificial Intelligence</i>, AAAI Press, 2018, pp. 6581–88."},"author":[{"first_name":"Stefan","last_name":"Haller","full_name":"Haller, Stefan"},{"first_name":"Paul","last_name":"Swoboda","id":"446560C6-F248-11E8-B48F-1D18A9856A87","full_name":"Swoboda, Paul"},{"full_name":"Savchynskyy, Bogdan","first_name":"Bogdan","last_name":"Savchynskyy"}],"publication_status":"published","arxiv":1,"date_updated":"2023-09-19T14:26:52Z","date_published":"2018-02-01T00:00:00Z","external_id":{"arxiv":["2004.06370"],"isi":["000485488906082"]},"page":"6581-6588","month":"02","day":"01","year":"2018","status":"public","abstract":[{"text":"We consider the MAP-inference problem for graphical models,which is a valued constraint satisfaction problem defined onreal numbers with a natural summation operation. We proposea family of relaxations (different from the famous Sherali-Adams hierarchy), which naturally define lower bounds for itsoptimum. This family always contains a tight relaxation andwe give an algorithm able to find it and therefore, solve theinitial non-relaxed NP-hard problem.The relaxations we consider decompose the original probleminto two non-overlapping parts: an easy LP-tight part and adifficult one. For the latter part a combinatorial solver must beused. As we show in our experiments, in a number of applica-tions the second, difficult part constitutes only a small fractionof the whole problem. This property allows to significantlyreduce the computational time of the combinatorial solver andtherefore solve problems which were out of reach before.","lang":"eng"}],"quality_controlled":"1","scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"date_created":"2019-02-13T13:32:48Z","article_processing_charge":"No","publisher":"AAAI Press","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2004.06370","open_access":"1"}],"isi":1},{"external_id":{"isi":["000468036500007"],"arxiv":["1602.03124"]},"date_published":"2018-12-01T00:00:00Z","date_updated":"2025-06-04T08:46:58Z","doi":"10.1145/3230649","year":"2018","day":"01","related_material":{"record":[{"relation":"earlier_version","id":"1192","status":"public"}]},"scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"2","isi":1,"main_file_link":[{"url":"https://arxiv.org/abs/1602.03124","open_access":"1"}],"language":[{"iso":"eng"}],"_id":"6032","department":[{"_id":"VlKo"}],"intvolume":"        15","type":"journal_article","oa_version":"Preprint","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"616160"}],"author":[{"first_name":"Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","last_name":"Kazda","full_name":"Kazda, Alexandr"},{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"first_name":"Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal"}],"citation":{"ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar boolean CSPs. <i>ACM Transactions on Algorithms</i>. 2018;15(2). doi:<a href=\"https://doi.org/10.1145/3230649\">10.1145/3230649</a>","apa":"Kazda, A., Kolmogorov, V., &#38; Rolinek, M. (2018). Even delta-matroids and the complexity of planar boolean CSPs. <i>ACM Transactions on Algorithms</i>. ACM. <a href=\"https://doi.org/10.1145/3230649\">https://doi.org/10.1145/3230649</a>","ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” <i>ACM Transactions on Algorithms</i>, vol. 15, no. 2. ACM, 2018.","chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” <i>ACM Transactions on Algorithms</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3230649\">https://doi.org/10.1145/3230649</a>.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).","ista":"Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.","mla":"Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” <i>ACM Transactions on Algorithms</i>, vol. 15, no. 2, 22, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3230649\">10.1145/3230649</a>."},"publication_status":"published","title":"Even delta-matroids and the complexity of planar boolean CSPs","arxiv":1,"status":"public","abstract":[{"lang":"eng","text":"The main result of this article is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Using a reduction to even Δ-matroids, we then extend the tractability result to larger classes of Δ-matroids that we call efficiently coverable. It properly includes classes that were known to be tractable before, namely, co-independent, compact, local, linear, and binary, with the following caveat:We represent Δ-matroids by lists of tuples, while the last two use a representation by matrices. Since an n ×n matrix can represent exponentially many tuples, our tractability result is not strictly stronger than the known algorithm for linear and binary Δ-matroids."}],"month":"12","article_processing_charge":"No","volume":15,"quality_controlled":"1","date_created":"2019-02-17T22:59:25Z","oa":1,"article_number":"22","publisher":"ACM","article_type":"original","publication":"ACM Transactions on Algorithms","ec_funded":1},{"scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"10","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.7828"}],"isi":1,"language":[{"iso":"eng"}],"external_id":{"isi":["000446809500022"],"arxiv":["1405.7828"]},"date_published":"2018-10-01T00:00:00Z","date_updated":"2023-09-19T14:46:18Z","day":"01","year":"2018","publication_status":"published","author":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"},{"last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","full_name":"Rolinek, Michal"}],"citation":{"mla":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” <i>Ars Combinatoria</i>, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.","chicago":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” <i>Ars Combinatoria</i>. Charles Babbage Research Centre, 2018.","short":"V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.","ista":"Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304.","ama":"Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. <i>Ars Combinatoria</i>. 2018;141(10):269-304.","ieee":"V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” <i>Ars Combinatoria</i>, vol. 141, no. 10. Charles Babbage Research Centre, pp. 269–304, 2018.","apa":"Kolmogorov, V., &#38; Rolinek, M. (2018). Superconcentrators of density 25.3. <i>Ars Combinatoria</i>. Charles Babbage Research Centre."},"title":"Superconcentrators of density 25.3","publist_id":"8037","arxiv":1,"_id":"18","department":[{"_id":"VlKo"}],"intvolume":"       141","type":"journal_article","oa_version":"Preprint","article_processing_charge":"No","volume":141,"quality_controlled":"1","oa":1,"date_created":"2018-12-11T11:44:11Z","publisher":"Charles Babbage Research Centre","page":"269 - 304","status":"public","abstract":[{"lang":"eng","text":"An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. We prove the existence of such superconcentrators with asymptotic density 25.3 (where the density is the number of edges divided by N). The previously best known densities were 28 [12] and 27.4136 [17]."}],"month":"10","publication_identifier":{"issn":["0381-7032"]},"publication":"Ars Combinatoria"},{"publication_identifier":{"issn":["0162-8828"]},"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","volume":40,"article_processing_charge":"No","quality_controlled":"1","oa":1,"date_created":"2018-12-11T11:48:01Z","publisher":"IEEE","page":"1668-1682","status":"public","abstract":[{"text":"We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision.","lang":"eng"}],"month":"07","corr_author":"1","citation":{"mla":"Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:<a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">10.1109/TPAMI.2017.2730884</a>.","chicago":"Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">https://doi.org/10.1109/TPAMI.2017.2730884</a>.","short":"A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.","ista":"Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682.","ama":"Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2018;40(7):1668-1682. doi:<a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">10.1109/TPAMI.2017.2730884</a>","ieee":"A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.","apa":"Shekhovtsov, A., Swoboda, P., &#38; Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2017.2730884\">https://doi.org/10.1109/TPAMI.2017.2730884</a>"},"author":[{"first_name":"Alexander","last_name":"Shekhovtsov","full_name":"Shekhovtsov, Alexander"},{"full_name":"Swoboda, Paul","last_name":"Swoboda","id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul"},{"last_name":"Savchynskyy","first_name":"Bogdan","full_name":"Savchynskyy, Bogdan"}],"publication_status":"published","title":"Maximum persistency via iterative relaxed inference with graphical models","publist_id":"6992","arxiv":1,"_id":"703","department":[{"_id":"VlKo"}],"intvolume":"        40","type":"journal_article","oa_version":"Preprint","scopus_import":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","issue":"7","isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.07902"}],"language":[{"iso":"eng"}],"external_id":{"isi":["000434294800010"],"arxiv":["1508.07902"]},"date_published":"2018-07-01T00:00:00Z","date_updated":"2026-04-16T09:54:52Z","doi":"10.1109/TPAMI.2017.2730884","year":"2018","day":"01"},{"publist_id":"6159","arxiv":1,"author":[{"id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","last_name":"Kazda","first_name":"Alexandr","full_name":"Kazda, Alexandr"},{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"},{"full_name":"Rolinek, Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal"}],"citation":{"mla":"Kazda, Alexandr, et al. <i>Even Delta-Matroids and the Complexity of Planar Boolean CSPs</i>. SIAM, 2017, pp. 307–26, doi:<a href=\"https://doi.org/10.1137/1.9781611974782.20\">10.1137/1.9781611974782.20</a>.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.","chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. <a href=\"https://doi.org/10.1137/1.9781611974782.20\">https://doi.org/10.1137/1.9781611974782.20</a>.","ista":"Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms, 307–326.","ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:<a href=\"https://doi.org/10.1137/1.9781611974782.20\">10.1137/1.9781611974782.20</a>","ieee":"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.","apa":"Kazda, A., Kolmogorov, V., &#38; Rolinek, M. (2017). Even delta-matroids and the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain: SIAM. <a href=\"https://doi.org/10.1137/1.9781611974782.20\">https://doi.org/10.1137/1.9781611974782.20</a>"},"publication_status":"published","project":[{"grant_number":"616160","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"title":"Even delta-matroids and the complexity of planar Boolean CSPs","type":"conference","oa_version":"Submitted Version","_id":"1192","department":[{"_id":"VlKo"}],"isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.03124"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"6032","relation":"later_version"}]},"doi":"10.1137/1.9781611974782.20","year":"2017","day":"01","external_id":{"isi":["000426965800020"],"arxiv":["1602.03124"]},"date_updated":"2025-06-04T08:46:59Z","date_published":"2017-01-01T00:00:00Z","ec_funded":1,"publication_identifier":{"isbn":["978-161197478-2"]},"conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2017-01-16","end_date":"2017-01019","location":"Barcelona, Spain"},"publisher":"SIAM","article_processing_charge":"No","oa":1,"date_created":"2018-12-11T11:50:38Z","quality_controlled":"1","abstract":[{"lang":"eng","text":"The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even Δ-matroid constraints allows us to extend the tractability result to a larger class of Δ-matroids that includes many classes that were known to be tractable before, namely co-independent, compact, local and binary."}],"status":"public","month":"01","page":"307 - 326"},{"project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"citation":{"ieee":"V. Kolmogorov, “A faster approximation algorithm for the Gibbs partition function,” in <i>Proceedings of the 31st Conference On Learning Theory</i>, 2017, vol. 75, pp. 228–249.","apa":"Kolmogorov, V. (2017). A faster approximation algorithm for the Gibbs partition function. In <i>Proceedings of the 31st Conference On Learning Theory</i> (Vol. 75, pp. 228–249). ML Research Press.","ama":"Kolmogorov V. A faster approximation algorithm for the Gibbs partition function. In: <i>Proceedings of the 31st Conference On Learning Theory</i>. Vol 75. ML Research Press; 2017:228-249.","mla":"Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition Function.” <i>Proceedings of the 31st Conference On Learning Theory</i>, vol. 75, ML Research Press, 2017, pp. 228–49.","ista":"Kolmogorov V. 2017. A faster approximation algorithm for the Gibbs partition function. Proceedings of the 31st Conference On Learning Theory. COLT: Annual Conference on Learning Theory  vol. 75, 228–249.","chicago":"Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition Function.” In <i>Proceedings of the 31st Conference On Learning Theory</i>, 75:228–49. ML Research Press, 2017.","short":"V. Kolmogorov, in:, Proceedings of the 31st Conference On Learning Theory, ML Research Press, 2017, pp. 228–249."},"author":[{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"publication_status":"published","title":"A faster approximation algorithm for the Gibbs partition function","publist_id":"7628","arxiv":1,"_id":"274","department":[{"_id":"VlKo"}],"intvolume":"        75","type":"conference","oa_version":"Published Version","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"external_id":{"arxiv":["1608.04223"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"relation":"main_file","date_updated":"2020-07-14T12:45:45Z","file_name":"2018_PMLR_Kolmogorov.pdf","checksum":"89db06a0e8083524449cb59b56bf4e5b","content_type":"application/pdf","file_size":408974,"access_level":"open_access","creator":"dernst","date_created":"2020-05-12T09:23:27Z","file_id":"7820"}],"date_updated":"2024-11-04T13:52:32Z","date_published":"2017-12-27T00:00:00Z","year":"2017","day":"27","conference":{"end_date":"2018-07-09","name":"COLT: Annual Conference on Learning Theory ","start_date":"2018-07-06"},"publication":"Proceedings of the 31st Conference On Learning Theory","ec_funded":1,"volume":75,"article_processing_charge":"No","quality_controlled":"1","date_created":"2018-12-11T11:45:33Z","oa":1,"ddc":["510"],"publisher":"ML Research Press","file_date_updated":"2020-07-14T12:45:45Z","license":"https://creativecommons.org/licenses/by/4.0/","page":"228-249","status":"public","abstract":[{"lang":"eng","text":"We consider the problem of estimating the partition function Z(β)=∑xexp(−β(H(x)) of a Gibbs distribution with a Hamilton H(⋅), or more precisely the logarithm of the ratio q=lnZ(0)/Z(β). It has been recently shown how to approximate q with high probability assuming the existence of an oracle that produces samples from the Gibbs distribution for a given parameter value in [0,β]. The current best known approach due to Huber [9] uses O(qlnn⋅[lnq+lnlnn+ε−2]) oracle calls on average where ε is the desired accuracy of approximation and H(⋅) is assumed to lie in {0}∪[1,n]. We improve the complexity to O(qlnn⋅ε−2) oracle calls. We also show that the same complexity can be achieved if exact oracles are replaced with approximate sampling oracles that are within O(ε2qlnn) variation distance from exact oracles. Finally, we prove a lower bound of Ω(q⋅ε−2) oracle calls under a natural model of computation."}],"month":"12"},{"acknowledgement":"We thank Vladimir Kolmogorov and Stephan Saalfeld forinspiring discussions.","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:03Z","ddc":["000"],"keyword":["graph matching","feature matching","QAP","MAP-inference"],"oa":1,"date_created":"2018-12-12T12:31:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","article_processing_charge":"No","day":"13","month":"02","year":"2017","status":"public","doi":"10.15479/AT:ISTA:57","abstract":[{"text":"Graph matching problems as described in \"Active Graph Matching for Automatic Joint Segmentation and Annotation of C. Elegans.\" by Kainmueller, Dagmar and Jug, Florian and Rother, Carsten and Myers, Gene, MICCAI 2014. Problems are in OpenGM2 hdf5 format (see http://hciweb2.iwr.uni-heidelberg.de/opengm/) and a custom text format used by the feature matching solver described in \"Feature Correspondence via Graph Matching: Models and Global Optimization.\" by Lorenzo Torresani, Vladimir Kolmogorov and Carsten Rother, ECCV 2008, code at http://pub.ist.ac.at/~vnk/software/GraphMatching-v1.02.src.zip. ","lang":"eng"}],"date_published":"2017-02-13T00:00:00Z","date_updated":"2024-02-21T13:46:31Z","file":[{"content_type":"application/zip","checksum":"3dc3e1306a66028a34181ebef2923139","file_name":"IST-2017-57-v1+1_wormMatchingProblems.zip","file_size":327042819,"relation":"main_file","date_updated":"2020-07-14T12:47:03Z","file_id":"5614","access_level":"open_access","date_created":"2018-12-12T13:02:54Z","creator":"system"}],"tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","short":"CC0 (1.0)"},"datarep_id":"57","title":"Graph matching problems for annotating C. Elegans","citation":{"ama":"Kainmueller D, Jug F, Rother C, Meyers G. Graph matching problems for annotating C. Elegans. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:57\">10.15479/AT:ISTA:57</a>","ieee":"D. Kainmueller, F. Jug, C. Rother, and G. Meyers, “Graph matching problems for annotating C. Elegans.” Institute of Science and Technology Austria, 2017.","apa":"Kainmueller, D., Jug, F., Rother, C., &#38; Meyers, G. (2017). Graph matching problems for annotating C. Elegans. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:57\">https://doi.org/10.15479/AT:ISTA:57</a>","short":"D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017).","chicago":"Kainmueller, Dagmar, Florian Jug, Carsten Rother, and Gene Meyers. “Graph Matching Problems for Annotating C. Elegans.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:57\">https://doi.org/10.15479/AT:ISTA:57</a>.","ista":"Kainmueller D, Jug F, Rother C, Meyers G. 2017. Graph matching problems for annotating C. Elegans, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:57\">10.15479/AT:ISTA:57</a>.","mla":"Kainmueller, Dagmar, et al. <i>Graph Matching Problems for Annotating C. Elegans</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:57\">10.15479/AT:ISTA:57</a>."},"author":[{"full_name":"Kainmueller, Dagmar","last_name":"Kainmueller","first_name":"Dagmar"},{"full_name":"Jug, Florian","first_name":"Florian","last_name":"Jug"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"},{"last_name":"Meyers","first_name":"Gene","full_name":"Meyers, Gene"}],"oa_version":"Published Version","type":"research_data","department":[{"_id":"VlKo"}],"_id":"5561"},{"page":"323 - 334","status":"public","abstract":[{"text":"We introduce two novel methods for learning parameters of graphical models for image labelling. The following two tasks underline both methods: (i) perturb model parameters based on given features and ground truth labelings, so as to exactly reproduce these labelings as optima of the local polytope relaxation of the labelling problem; (ii) train a predictor for the perturbed model parameters so that improved model parameters can be applied to the labelling of novel data. Our first method implements task (i) by inverse linear programming and task (ii) using a regressor e.g. a Gaussian process. Our second approach simultaneously solves tasks (i) and (ii) in a joint manner, while being restricted to linearly parameterised predictors. Experiments demonstrate the merits of both approaches.","lang":"eng"}],"month":"01","article_processing_charge":"No","volume":10302,"quality_controlled":"1","date_created":"2018-12-11T11:47:39Z","publisher":"Springer","publication_identifier":{"isbn":["978-331958770-7"]},"conference":{"start_date":"2017-06-04","name":"SSVM: Scale Space and Variational Methods in Computer Vision","location":"Kolding, Denmark","end_date":"2017-06-08"},"external_id":{"isi":["000432210900026"]},"date_updated":"2025-09-11T07:20:56Z","date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-319-58771-4_26","day":"01","year":"2017","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","alternative_title":["LNCS"],"isi":1,"language":[{"iso":"eng"}],"_id":"641","department":[{"_id":"VlKo"}],"intvolume":"     10302","type":"conference","oa_version":"None","citation":{"mla":"Trajkovska, Vera, et al. <i>Graphical Model Parameter Learning by Inverse Linear Programming</i>. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_26\">10.1007/978-3-319-58771-4_26</a>.","chicago":"Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_26\">https://doi.org/10.1007/978-3-319-58771-4_26</a>.","short":"V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.","ista":"Trajkovska V, Swoboda P, Åström F, Petra S. 2017. Graphical model parameter learning by inverse linear programming. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 323–334.","ama":"Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_26\">10.1007/978-3-319-58771-4_26</a>","ieee":"V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter learning by inverse linear programming,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 323–334.","apa":"Trajkovska, V., Swoboda, P., Åström, F., &#38; Petra, S. (2017). Graphical model parameter learning by inverse linear programming. In F. Lauze, Y. Dong, &#38; A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_26\">https://doi.org/10.1007/978-3-319-58771-4_26</a>"},"publication_status":"published","author":[{"full_name":"Trajkovska, Vera","last_name":"Trajkovska","first_name":"Vera"},{"full_name":"Swoboda, Paul","first_name":"Paul","last_name":"Swoboda","id":"446560C6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Freddie","last_name":"Åström","full_name":"Åström, Freddie"},{"full_name":"Petra, Stefanie","first_name":"Stefanie","last_name":"Petra"}],"title":"Graphical model parameter learning by inverse linear programming","editor":[{"full_name":"Lauze, François","first_name":"François","last_name":"Lauze"},{"last_name":"Dong","first_name":"Yiqiu","full_name":"Dong, Yiqiu"},{"full_name":"Bjorholm Dahl, Anders","first_name":"Anders","last_name":"Bjorholm Dahl"}],"publist_id":"7147"},{"scopus_import":"1","has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"isi":1,"date_updated":"2024-11-04T13:52:34Z","date_published":"2017-07-01T00:00:00Z","file":[{"access_level":"open_access","date_created":"2019-01-18T12:52:46Z","creator":"dernst","file_id":"5849","relation":"main_file","date_updated":"2020-07-14T12:48:15Z","content_type":"application/pdf","file_name":"Swoboda_A_Message_Passing_CVPR_2017_paper.pdf","checksum":"7e51dacefa693574581a32da3eff63dc","file_size":883264}],"external_id":{"isi":["000418371405009"]},"day":"01","year":"2017","doi":"10.1109/CVPR.2017.530","title":"A message passing algorithm for the minimum cost multicut problem","project":[{"grant_number":"616160","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"corr_author":"1","citation":{"short":"P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.","chicago":"Swoboda, Paul, and Bjoern Andres. “A Message Passing Algorithm for the Minimum Cost Multicut Problem,” 2017:4990–99. IEEE, 2017. <a href=\"https://doi.org/10.1109/CVPR.2017.530\">https://doi.org/10.1109/CVPR.2017.530</a>.","ista":"Swoboda P, Andres B. 2017. A message passing algorithm for the minimum cost multicut problem. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4990–4999.","mla":"Swoboda, Paul, and Bjoern Andres. <i>A Message Passing Algorithm for the Minimum Cost Multicut Problem</i>. Vol. 2017, IEEE, 2017, pp. 4990–99, doi:<a href=\"https://doi.org/10.1109/CVPR.2017.530\">10.1109/CVPR.2017.530</a>.","ama":"Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:<a href=\"https://doi.org/10.1109/CVPR.2017.530\">10.1109/CVPR.2017.530</a>","ieee":"P. Swoboda and B. Andres, “A message passing algorithm for the minimum cost multicut problem,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4990–4999.","apa":"Swoboda, P., &#38; Andres, B. (2017). A message passing algorithm for the minimum cost multicut problem (Vol. 2017, pp. 4990–4999). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2017.530\">https://doi.org/10.1109/CVPR.2017.530</a>"},"publication_status":"published","author":[{"first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","full_name":"Swoboda, Paul"},{"first_name":"Bjoern","last_name":"Andres","full_name":"Andres, Bjoern"}],"publist_id":"6526","department":[{"_id":"VlKo"}],"intvolume":"      2017","_id":"915","oa_version":"Submitted Version","type":"conference","quality_controlled":"1","date_created":"2018-12-11T11:49:11Z","oa":1,"article_processing_charge":"No","volume":2017,"publisher":"IEEE","file_date_updated":"2020-07-14T12:48:15Z","ddc":["000"],"page":"4990-4999","month":"07","status":"public","abstract":[{"text":"We propose a dual decomposition and linear program relaxation of the NP-hard minimum cost multicut problem. Unlike other polyhedral relaxations of the multicut polytope, it is amenable to efficient optimization by message passing. Like other polyhedral relaxations, it can be tightened efficiently by cutting planes.  We define an algorithm that alternates between message passing and efficient separation of cycle- and odd-wheel inequalities. This algorithm is more efficient than state-of-the-art algorithms based on linear programming, including algorithms written in the framework of leading commercial software, as we show in experiments with large instances of the problem from applications in computer vision, biomedical image analysis and data mining.","lang":"eng"}],"conference":{"end_date":"2017-07-26","location":"Honolulu, HA, United States","start_date":"2017-07-21","name":"CVPR: Computer Vision and Pattern Recognition"},"publication_identifier":{"isbn":["978-153860457-1"]},"ec_funded":1},{"title":"A study of lagrangean decompositions and dual ascent solvers for graph matching","citation":{"mla":"Swoboda, Paul, et al. <i>A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching</i>. Vol. 2017, IEEE, 2017, pp. 7062–71, doi:<a href=\"https://doi.org/10.1109/CVPR.2017.747\">10.1109/CVPR.2017.747</a>.","chicago":"Swoboda, Paul, Carsten Rother, Carsten Abu Alhaija, Dagmar Kainmueller, and Bogdan Savchynskyy. “A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching,” 2017:7062–71. IEEE, 2017. <a href=\"https://doi.org/10.1109/CVPR.2017.747\">https://doi.org/10.1109/CVPR.2017.747</a>.","short":"P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:, IEEE, 2017, pp. 7062–7071.","ista":"Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. 2017. A study of lagrangean decompositions and dual ascent solvers for graph matching. CVPR: Computer Vision and Pattern Recognition vol. 2017, 7062–7071.","ama":"Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. A study of lagrangean decompositions and dual ascent solvers for graph matching. In: Vol 2017. IEEE; 2017:7062-7071. doi:<a href=\"https://doi.org/10.1109/CVPR.2017.747\">10.1109/CVPR.2017.747</a>","ieee":"P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, and B. Savchynskyy, “A study of lagrangean decompositions and dual ascent solvers for graph matching,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 7062–7071.","apa":"Swoboda, P., Rother, C., Abu Alhaija, C., Kainmueller, D., &#38; Savchynskyy, B. (2017). A study of lagrangean decompositions and dual ascent solvers for graph matching (Vol. 2017, pp. 7062–7071). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2017.747\">https://doi.org/10.1109/CVPR.2017.747</a>"},"author":[{"full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","first_name":"Paul"},{"full_name":"Rother, Carsten","last_name":"Rother","first_name":"Carsten"},{"full_name":"Abu Alhaija, Carsten","last_name":"Abu Alhaija","first_name":"Carsten"},{"full_name":"Kainmueller, Dagmar","first_name":"Dagmar","last_name":"Kainmueller"},{"first_name":"Bogdan","last_name":"Savchynskyy","full_name":"Savchynskyy, Bogdan"}],"publication_status":"published","corr_author":"1","project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"publist_id":"6525","department":[{"_id":"VlKo"}],"intvolume":"      2017","_id":"916","oa_version":"Submitted Version","type":"conference","has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","language":[{"iso":"eng"}],"isi":1,"date_updated":"2024-11-04T13:52:34Z","date_published":"2017-01-01T00:00:00Z","external_id":{"isi":["000418371407018"]},"file":[{"file_id":"5848","access_level":"open_access","creator":"dernst","date_created":"2019-01-18T12:49:38Z","checksum":"e38a2740daad1ea178465843b5072906","file_name":"2017_CVPR_Swoboda2.pdf","content_type":"application/pdf","file_size":944332,"relation":"main_file","date_updated":"2020-07-14T12:48:15Z"}],"day":"01","year":"2017","doi":"10.1109/CVPR.2017.747","conference":{"location":"Honolulu, HA, United States","end_date":"2017-07-26","name":"CVPR: Computer Vision and Pattern Recognition","start_date":"2017-07-21"},"publication_identifier":{"isbn":["978-153860457-1"]},"ec_funded":1,"date_created":"2018-12-11T11:49:11Z","oa":1,"quality_controlled":"1","article_processing_charge":"No","volume":2017,"file_date_updated":"2020-07-14T12:48:15Z","publisher":"IEEE","ddc":["000"],"page":"7062-7071","month":"01","abstract":[{"text":"We study the quadratic assignment problem, in computer vision also known as graph matching. Two leading solvers for this problem optimize the Lagrange decomposition duals with sub-gradient and dual ascent (also known as message passing) updates. We explore this direction further and propose several additional Lagrangean relaxations of the graph matching problem along with corresponding algorithms, which are all based on a common dual ascent framework. Our extensive empirical evaluation gives several theoretical insights and suggests a new state-of-the-art anytime solver for the considered problem. Our improvement over state-of-the-art is particularly visible on a new dataset with large-scale sparse problem instances containing more than 500 graph nodes each.","lang":"eng"}],"status":"public"},{"publist_id":"6524","project":[{"call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"corr_author":"1","publication_status":"published","citation":{"ama":"Swoboda P, Kuske J, Savchynskyy B. A dual ascent framework for Lagrangean decomposition of combinatorial problems. In: Vol 2017. IEEE; 2017:4950-4960. doi:<a href=\"https://doi.org/10.1109/CVPR.2017.526\">10.1109/CVPR.2017.526</a>","ieee":"P. Swoboda, J. Kuske, and B. Savchynskyy, “A dual ascent framework for Lagrangean decomposition of combinatorial problems,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4950–4960.","apa":"Swoboda, P., Kuske, J., &#38; Savchynskyy, B. (2017). A dual ascent framework for Lagrangean decomposition of combinatorial problems (Vol. 2017, pp. 4950–4960). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2017.526\">https://doi.org/10.1109/CVPR.2017.526</a>","mla":"Swoboda, Paul, et al. <i>A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems</i>. Vol. 2017, IEEE, 2017, pp. 4950–60, doi:<a href=\"https://doi.org/10.1109/CVPR.2017.526\">10.1109/CVPR.2017.526</a>.","short":"P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.","chicago":"Swoboda, Paul, Jan Kuske, and Bogdan Savchynskyy. “A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems,” 2017:4950–60. IEEE, 2017. <a href=\"https://doi.org/10.1109/CVPR.2017.526\">https://doi.org/10.1109/CVPR.2017.526</a>.","ista":"Swoboda P, Kuske J, Savchynskyy B. 2017. A dual ascent framework for Lagrangean decomposition of combinatorial problems. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4950–4960."},"author":[{"last_name":"Swoboda","id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","full_name":"Swoboda, Paul"},{"first_name":"Jan","last_name":"Kuske","full_name":"Kuske, Jan"},{"first_name":"Bogdan","last_name":"Savchynskyy","full_name":"Savchynskyy, Bogdan"}],"title":"A dual ascent framework for Lagrangean decomposition of combinatorial problems","type":"conference","oa_version":"Submitted Version","_id":"917","department":[{"_id":"VlKo"}],"intvolume":"      2017","isi":1,"language":[{"iso":"eng"}],"scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","doi":"10.1109/CVPR.2017.526","day":"01","year":"2017","file":[{"creator":"dernst","date_created":"2019-01-18T12:45:55Z","access_level":"open_access","file_id":"5847","date_updated":"2020-07-14T12:48:15Z","relation":"main_file","file_size":898652,"file_name":"2017_CVPR_Swoboda.pdf","checksum":"72fd291046bd8e5717961bd68f6b6f03","content_type":"application/pdf"}],"external_id":{"isi":["000418371405005"]},"date_updated":"2024-11-04T13:52:34Z","date_published":"2017-07-01T00:00:00Z","ec_funded":1,"publication_identifier":{"isbn":["978-153860457-1"]},"conference":{"start_date":"2017-07-21","name":"CVPR: Computer Vision and Pattern Recognition","end_date":"2017-07-26","location":"Honolulu, HA, United States"},"ddc":["000"],"publisher":"IEEE","file_date_updated":"2020-07-14T12:48:15Z","article_processing_charge":"No","volume":2017,"quality_controlled":"1","oa":1,"date_created":"2018-12-11T11:49:11Z","status":"public","abstract":[{"text":"We  propose  a  general  dual  ascent  framework  for  Lagrangean decomposition of combinatorial problems.  Although methods of this type have shown their efficiency for a number of problems, so far there was no general algorithm applicable to multiple problem types. In this work, we propose such a general algorithm. It depends on several parameters, which can be used to optimize its performance in each particular setting. We demonstrate efficacy of our method on graph matching and multicut problems, where it outperforms state-of-the-art solvers including those based on subgradient optimization and off-the-shelf linear programming solvers.","lang":"eng"}],"month":"07","page":"4950-4960"},{"department":[{"_id":"VlKo"}],"intvolume":"        46","_id":"644","oa_version":"Preprint","type":"journal_article","title":"The complexity of general-valued CSPs","publication_status":"published","citation":{"ama":"Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. <i>SIAM Journal on Computing</i>. 2017;46(3):1087-1110. doi:<a href=\"https://doi.org/10.1137/16M1091836\">10.1137/16M1091836</a>","apa":"Kolmogorov, V., Krokhin, A., &#38; Rolinek, M. (2017). The complexity of general-valued CSPs. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/16M1091836\">https://doi.org/10.1137/16M1091836</a>","ieee":"V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” <i>SIAM Journal on Computing</i>, vol. 46, no. 3. SIAM, pp. 1087–1110, 2017.","mla":"Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” <i>SIAM Journal on Computing</i>, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:<a href=\"https://doi.org/10.1137/16M1091836\">10.1137/16M1091836</a>.","short":"V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.","chicago":"Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” <i>SIAM Journal on Computing</i>. SIAM, 2017. <a href=\"https://doi.org/10.1137/16M1091836\">https://doi.org/10.1137/16M1091836</a>.","ista":"Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110."},"author":[{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"},{"first_name":"Andrei","last_name":"Krokhin","full_name":"Krokhin, Andrei"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","first_name":"Michal"}],"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"arxiv":1,"publist_id":"7138","date_updated":"2025-09-23T13:45:56Z","date_published":"2017-06-29T00:00:00Z","external_id":{"isi":["000404774300010"],"arxiv":["1502.07327"]},"day":"29","year":"2017","doi":"10.1137/16M1091836","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"id":"1637","relation":"other","status":"public"}]},"scopus_import":"1","language":[{"iso":"eng"}],"isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1502.07327"}],"issue":"3","ec_funded":1,"publication":"SIAM Journal on Computing","page":"1087 - 1110","month":"06","abstract":[{"text":"An instance of the valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates an infeasible assignment. The goal is to find an assignment of labels to the variables that minimizes the sum. We study, assuming that P 6= NP, how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in f0;1g corresponds to ordinary CSPs, where one deals only with the feasibility issue, and there is no optimization. This case is the subject of the algebraic CSP dichotomy conjecture predicting for which constraint languages CSPs are tractable (i.e., solvable in polynomial time) and for which they are NP-hard. The case when all allowed functions take only finite values corresponds to a finitevalued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Živný. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP (i.e., the problem of deciding whether a given instance has a feasible solution) corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs.","lang":"eng"}],"status":"public","date_created":"2018-12-11T11:47:40Z","oa":1,"quality_controlled":"1","article_processing_charge":"No","volume":46,"publisher":"SIAM"},{"page":"235 - 246","abstract":[{"text":"We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art approaches that split the problem into a continuous reconstruction problem for the linear measurement constraints and a discrete labeling problem to enforce discrete-valued reconstructions, we propose a joint formulation that addresses both problems simultaneously, resulting in a tighter convex relaxation. For this purpose a constrained graphical model is set up and evaluated using a novel relaxation optimized by dual decomposition. We evaluate our approach experimentally and show superior solutions both mathematically (tighter relaxation) and experimentally in comparison to previously proposed relaxations.","lang":"eng"}],"status":"public","month":"06","volume":10302,"article_processing_charge":"No","oa":1,"date_created":"2018-12-11T11:47:41Z","quality_controlled":"1","publisher":"Springer","publication_identifier":{"isbn":["978-331958770-7"]},"conference":{"location":"Kolding, Denmark","end_date":"2017-06-08","name":"SSVM: Scale Space and Variational Methods in Computer Vision","start_date":"2017-06-04"},"ec_funded":1,"external_id":{"isi":["000432210900019"],"arxiv":["1703.03769"]},"date_published":"2017-06-01T00:00:00Z","date_updated":"2025-09-11T07:16:00Z","doi":"10.1007/978-3-319-58771-4_19","day":"01","year":"2017","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.03769"}],"isi":1,"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"_id":"646","department":[{"_id":"VlKo"}],"intvolume":"     10302","type":"conference","oa_version":"Submitted Version","author":[{"first_name":"Jan","last_name":"Kuske","full_name":"Kuske, Jan"},{"first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","full_name":"Swoboda, Paul"},{"first_name":"Stefanie","last_name":"Petra","full_name":"Petra, Stefanie"}],"publication_status":"published","citation":{"short":"J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.","chicago":"Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">https://doi.org/10.1007/978-3-319-58771-4_19</a>.","ista":"Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246.","mla":"Kuske, Jan, et al. <i>A Novel Convex Relaxation for Non Binary Discrete Tomography</i>. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">10.1007/978-3-319-58771-4_19</a>.","ama":"Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">10.1007/978-3-319-58771-4_19</a>","ieee":"J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary discrete tomography,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.","apa":"Kuske, J., Swoboda, P., &#38; Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, &#38; A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">https://doi.org/10.1007/978-3-319-58771-4_19</a>"},"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"title":"A novel convex relaxation for non binary discrete tomography","publist_id":"7132","editor":[{"first_name":"François","last_name":"Lauze","full_name":"Lauze, François"},{"last_name":"Dong","first_name":"Yiqiu","full_name":"Dong, Yiqiu"},{"full_name":"Bjorholm Dahl, Anders","first_name":"Anders","last_name":"Bjorholm Dahl"}],"arxiv":1},{"publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","ec_funded":1,"pubrep_id":"815","page":"97","abstract":[{"text":"An instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of\r\nvariables, a finite domain of labels, and a set of constraints, each constraint acting on\r\na subset of the variables. The goal is to find an assignment of labels to its variables\r\nthat satisfies all constraints (or decide whether one exists). If we allow more general\r\n“soft” constraints, which come with (possibly infinite) costs of particular assignments,\r\nwe obtain instances from a richer class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal is to find an assignment with minimum total cost.\r\nIn this thesis, we focus (assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage, that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe complexity classification modulo (missing pieces of) complexity classification for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’ perfect\r\nmatching algorithm. This generalization contributes to complexity classfications in two\r\nways. First, it gives a new (largest known) polynomial-time solvable class of Boolean\r\nCSPs in which every variable may appear in at most two constraints and second, it\r\nsettles full classification of Boolean CSPs with planar drawing (again parametrized by a\r\nconstraint language).","lang":"eng"}],"status":"public","month":"05","article_processing_charge":"No","date_created":"2018-12-11T11:49:35Z","oa":1,"ddc":["004"],"file_date_updated":"2020-07-14T12:48:18Z","publisher":"Institute of Science and Technology Austria","_id":"992","department":[{"_id":"VlKo"}],"supervisor":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"}],"type":"dissertation","oa_version":"Published Version","citation":{"ista":"Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria.","chicago":"Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">https://doi.org/10.15479/AT:ISTA:th_815</a>.","short":"M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017.","mla":"Rolinek, Michal. <i>Complexity of Constraint Satisfaction</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">10.15479/AT:ISTA:th_815</a>.","ieee":"M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science and Technology Austria, 2017.","apa":"Rolinek, M. (2017). <i>Complexity of constraint satisfaction</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">https://doi.org/10.15479/AT:ISTA:th_815</a>","ama":"Rolinek M. Complexity of constraint satisfaction. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">10.15479/AT:ISTA:th_815</a>"},"publication_status":"published","author":[{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","first_name":"Michal"}],"corr_author":"1","project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"OA_place":"publisher","title":"Complexity of constraint satisfaction","publist_id":"6407","file":[{"file_id":"4654","access_level":"open_access","date_created":"2018-12-12T10:07:55Z","creator":"system","content_type":"application/pdf","checksum":"81761fb939acb7585c36629f765b4373","file_name":"IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf","file_size":786145,"relation":"main_file","date_updated":"2020-07-14T12:48:18Z"},{"file_name":"2017_Thesis_Rolinek_source.zip","checksum":"2b2d7e1d6c1c79a9795a7aa0f860baf3","content_type":"application/zip","file_size":5936337,"relation":"source_file","date_updated":"2020-07-14T12:48:18Z","file_id":"6208","access_level":"closed","creator":"dernst","date_created":"2019-04-05T08:43:24Z"}],"date_updated":"2026-04-08T14:17:06Z","date_published":"2017-05-01T00:00:00Z","doi":"10.15479/AT:ISTA:th_815","year":"2017","day":"01","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"acknowledgement":"FP7/2007-2013/ERC grant agreement no 616160"},{"publisher":"IEEE","article_number":"7782993","quality_controlled":"1","date_created":"2018-12-11T11:50:38Z","oa":1,"volume":"2016-December","article_processing_charge":"No","month":"12","status":"public","abstract":[{"text":"We consider the recent formulation of the Algorithmic Lovász Local Lemma [1], [2] for finding objects that avoid &quot;bad features&quot;, or &quot;flaws&quot;. It extends the Moser-Tardos resampling algorithm [3] to more general discrete spaces. At each step the method picks a flaw present in the current state and &quot;resamples&quot; it using a &quot;resampling oracle&quot; provided by the user. However, it is less flexible than the Moser-Tardos method since [1], [2] require a specific flaw selection rule, whereas [3] allows an arbitrary rule (and thus can potentially be implemented more efficiently). We formulate a new &quot;commutativity&quot; condition, and prove that it is sufficient for an arbitrary rule to work. It also enables an efficient parallelization under an additional assumption. We then show that existing resampling oracles for perfect matchings and permutations do satisfy this condition. Finally, we generalize the precondition in [2] (in the case of symmetric potential causality graphs). This unifies special cases that previously were treated separately.","lang":"eng"}],"ec_funded":1,"publication":"Proceedings - Annual IEEE Symposium on Foundations of Computer Science","conference":{"name":"FOCS: Foundations of Computer Science","start_date":"2016-09-09","location":"New Brunswick, NJ, USA ","end_date":"2016-09-11"},"acknowledgement":"European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1506.08547v7","open_access":"1"}],"isi":1,"related_material":{"record":[{"id":"5975","relation":"later_version","status":"public"}]},"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2016","day":"15","doi":"10.1109/FOCS.2016.88","date_updated":"2025-09-22T09:44:20Z","date_published":"2016-12-15T00:00:00Z","external_id":{"isi":["000391198500082"],"arxiv":["1506.08547"]},"arxiv":1,"publist_id":"6158","title":"Commutativity in the algorithmic Lovasz local lemma","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"616160"}],"author":[{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"citation":{"mla":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>, vol. 2016–December, 7782993, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/FOCS.2016.88\">10.1109/FOCS.2016.88</a>.","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” In <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>, Vol. 2016–December. IEEE, 2016. <a href=\"https://doi.org/10.1109/FOCS.2016.88\">https://doi.org/10.1109/FOCS.2016.88</a>.","short":"V. Kolmogorov, in:, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2016.","ista":"Kolmogorov V. 2016. Commutativity in the algorithmic Lovasz local lemma. Proceedings - Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2016–December, 7782993.","ama":"Kolmogorov V. Commutativity in the algorithmic Lovasz local lemma. In: <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>. Vol 2016-December. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/FOCS.2016.88\">10.1109/FOCS.2016.88</a>","apa":"Kolmogorov, V. (2016). Commutativity in the algorithmic Lovasz local lemma. In <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i> (Vol. 2016–December). New Brunswick, NJ, USA : IEEE. <a href=\"https://doi.org/10.1109/FOCS.2016.88\">https://doi.org/10.1109/FOCS.2016.88</a>","ieee":"V. Kolmogorov, “Commutativity in the algorithmic Lovasz local lemma,” in <i>Proceedings - Annual IEEE Symposium on Foundations of Computer Science</i>, New Brunswick, NJ, USA , 2016, vol. 2016–December."},"publication_status":"published","oa_version":"Preprint","type":"conference","department":[{"_id":"VlKo"}],"_id":"1193"},{"doi":"10.1007/978-3-662-49896-5_13","day":"28","year":"2016","external_id":{"isi":["000389727200013"]},"date_published":"2016-04-28T00:00:00Z","date_updated":"2025-09-22T09:22:54Z","alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/100"}],"isi":1,"acknowledgement":"Joël Alwen, Chethan Kamath, and Krzysztof Pietrzak’s research is partially supported by an ERC starting grant (259668-PSPC). Vladimir Kolmogorov is partially supported by an ERC consolidator grant (616160-DOICV). Binyi Chen was partially supported by NSF grants CNS-1423566 and CNS-1514526, and a gift from the Gareatis Foundation. Stefano Tessaro was partially supported by NSF grants CNS-1423566, CNS-1528178, a Hellman Fellowship, and the Glen and Susanne Culler Chair.\r\n\r\nThis work was done in part while the authors were visiting the Simons Institute for the Theory of Computing, supported by the Simons Foundation and by the DIMACS/Simons Collaboration in Cryptography through NSF grant CNS-1523467.","language":[{"iso":"eng"}],"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"conference","oa_version":"Submitted Version","_id":"1231","intvolume":"      9666","department":[{"_id":"KrPi"},{"_id":"VlKo"}],"publist_id":"6103","project":[{"grant_number":"259668","call_identifier":"FP7","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425"},{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"citation":{"mla":"Alwen, Joel F., et al. <i>On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model</i>. Vol. 9666, Springer, 2016, pp. 358–87, doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">10.1007/978-3-662-49896-5_13</a>.","short":"J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.","chicago":"Alwen, Joel F, Binyi Chen, Chethan Kamath Hosdurg, Vladimir Kolmogorov, Krzysztof Z Pietrzak, and Stefano Tessaro. “On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model,” 9666:358–87. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">https://doi.org/10.1007/978-3-662-49896-5_13</a>.","ista":"Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666, 358–387.","ama":"Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Vol 9666. Springer; 2016:358-387. doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">10.1007/978-3-662-49896-5_13</a>","ieee":"J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.","apa":"Alwen, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z., &#38; Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">https://doi.org/10.1007/978-3-662-49896-5_13</a>"},"publication_status":"published","author":[{"first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","full_name":"Alwen, Joel F"},{"first_name":"Binyi","last_name":"Chen","full_name":"Chen, Binyi"},{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","first_name":"Chethan","full_name":"Kamath Hosdurg, Chethan"},{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tessaro, Stefano","last_name":"Tessaro","first_name":"Stefano"}],"title":"On the complexity of scrypt and proofs of space in the parallel random oracle model","status":"public","abstract":[{"text":"We study the time-and memory-complexities of the problem of computing labels of (multiple) randomly selected challenge-nodes in a directed acyclic graph. The w-bit label of a node is the hash of the labels of its parents, and the hash function is modeled as a random oracle. Specific instances of this problem underlie both proofs of space [Dziembowski et al. CRYPTO’15] as well as popular memory-hard functions like scrypt. As our main tool, we introduce the new notion of a probabilistic parallel entangled pebbling game, a new type of combinatorial pebbling game on a graph, which is closely related to the labeling game on the same graph. As a first application of our framework, we prove that for scrypt, when the underlying hash function is invoked n times, the cumulative memory complexity (CMC) (a notion recently introduced by Alwen and Serbinenko (STOC’15) to capture amortized memory-hardness for parallel adversaries) is at least Ω(w · (n/ log(n))2). This bound holds for adversaries that can store many natural functions of the labels (e.g., linear combinations), but still not arbitrary functions thereof. We then introduce and study a combinatorial quantity, and show how a sufficiently small upper bound on it (which we conjecture) extends our CMC bound for scrypt to hold against arbitrary adversaries. We also show that such an upper bound solves the main open problem for proofs-of-space protocols: namely, establishing that the time complexity of computing the label of a random node in a graph on n nodes (given an initial kw-bit state) reduces tightly to the time complexity for black pebbling on the same graph (given an initial k-node pebbling).","lang":"eng"}],"month":"04","page":"358 - 387","publisher":"Springer","volume":9666,"article_processing_charge":"No","quality_controlled":"1","oa":1,"date_created":"2018-12-11T11:50:51Z","ec_funded":1,"conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","start_date":"2016-05-08","end_date":"2016-05-12","location":"Vienna, Austria"}},{"date_updated":"2025-09-22T08:10:54Z","date_published":"2016-07-20T00:00:00Z","external_id":{"isi":["000383151800008"],"arxiv":["1512.07009"]},"day":"20","year":"2016","doi":"10.1142/S0218196716500430","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","language":[{"iso":"eng"}],"acknowledgement":"Libor Barto and Alexandr Kazda were supported by the the Grant Agency of the Czech Republic, grant GACR 13-01832S. ","isi":1,"main_file_link":[{"url":"http://arxiv.org/abs/1512.07009","open_access":"1"}],"issue":"5","intvolume":"        26","department":[{"_id":"VlKo"}],"_id":"1353","oa_version":"Preprint","type":"journal_article","title":"Deciding absorption","citation":{"mla":"Barto, Libor, and Alexandr Kazda. “Deciding Absorption.” <i>International Journal of Algebra and Computation</i>, vol. 26, no. 5, World Scientific Publishing, 2016, pp. 1033–60, doi:<a href=\"https://doi.org/10.1142/S0218196716500430\">10.1142/S0218196716500430</a>.","short":"L. Barto, A. Kazda, International Journal of Algebra and Computation 26 (2016) 1033–1060.","chicago":"Barto, Libor, and Alexandr Kazda. “Deciding Absorption.” <i>International Journal of Algebra and Computation</i>. World Scientific Publishing, 2016. <a href=\"https://doi.org/10.1142/S0218196716500430\">https://doi.org/10.1142/S0218196716500430</a>.","ista":"Barto L, Kazda A. 2016. Deciding absorption. International Journal of Algebra and Computation. 26(5), 1033–1060.","ama":"Barto L, Kazda A. Deciding absorption. <i>International Journal of Algebra and Computation</i>. 2016;26(5):1033-1060. doi:<a href=\"https://doi.org/10.1142/S0218196716500430\">10.1142/S0218196716500430</a>","apa":"Barto, L., &#38; Kazda, A. (2016). Deciding absorption. <i>International Journal of Algebra and Computation</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218196716500430\">https://doi.org/10.1142/S0218196716500430</a>","ieee":"L. Barto and A. Kazda, “Deciding absorption,” <i>International Journal of Algebra and Computation</i>, vol. 26, no. 5. World Scientific Publishing, pp. 1033–1060, 2016."},"publication_status":"published","author":[{"full_name":"Barto, Libor","first_name":"Libor","last_name":"Barto"},{"full_name":"Kazda, Alexandr","first_name":"Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","last_name":"Kazda"}],"arxiv":1,"publist_id":"5893","page":"1033 - 1060","month":"07","abstract":[{"lang":"eng","text":"We characterize absorption in finite idempotent algebras by means of Jónsson absorption and cube term blockers. As an application we show that it is decidable whether a given subset is an absorbing subuniverse of an algebra given by the tables of its basic operations."}],"status":"public","date_created":"2018-12-11T11:51:32Z","oa":1,"quality_controlled":"1","volume":26,"article_processing_charge":"No","publisher":"World Scientific Publishing","publication":"International Journal of Algebra and Computation"}]