[{"year":"2018","date_created":"2018-12-30T22:59:14Z","fulldoi":"https://doi.org/10.1007/978-3-030-04612-5_2","doi":"10.1007/978-3-030-04612-5_2","scopus_import":"1","article_processing_charge":"No","date_published":"2018-11-21T00:00:00Z","intvolume":" 11316","date_updated":"2026-04-16T09:54:39Z","quality_controlled":"1","external_id":{"isi":["000865933000002"],"arxiv":["1804.04372"]},"alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369"}],"abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. Such games are central in formal verification since they model the interaction between a non-terminating system and its environment. We study bidding games in which the players bid for the right to move the token. Two bidding rules have been defined. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the “bank” rather than the other player. While poorman reachability games have been studied before, we present, for the first time, results on infinite-duration poorman games. A central quantity in these games is the ratio between the two players’ initial budgets. The questions we study concern a necessary and sufficient ratio with which a player can achieve a goal. For reachability objectives, such threshold ratios are known to exist for both bidding rules. We show that the properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case. Our most interesting results concern quantitative poorman games, namely poorman mean-payoff games, where we construct optimal strategies depending on the initial ratio, by showing a connection with random-turn based games. The connection in itself is interesting, because it does not hold for reachability poorman games. We also solve the complexity problems that arise in poorman bidding games.","lang":"eng"}],"_id":"5788","oa_version":"Preprint","day":"21","month":"11","status":"public","isi":1,"title":"Infinite-duration poorman-bidding games","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_identifier":{"isbn":["9783030046118"],"issn":["0302-9743"]},"volume":11316,"arxiv":1,"oa":1,"language":[{"iso":"eng"}],"page":"21-36","publisher":"Springer","conference":{"start_date":"2018-12-15","name":"14th International Conference on Web and Internet Economics, WINE","location":"Oxford, UK","end_date":"2018-12-17"},"citation":{"ama":"Avni G, Henzinger TA, Ibsen-Jensen R. Infinite-duration poorman-bidding games. In: Vol 11316. Springer; 2018:21-36. doi:10.1007/978-3-030-04612-5_2","ieee":"G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.","ista":"Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding games. 14th International Conference on Web and Internet Economics, WINE, LNCS, vol. 11316, 21–36.","mla":"Avni, Guy, et al. Infinite-Duration Poorman-Bidding Games. Vol. 11316, Springer, 2018, pp. 21–36, doi:10.1007/978-3-030-04612-5_2.","apa":"Avni, G., Henzinger, T. A., & Ibsen-Jensen, R. (2018). Infinite-duration poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK: Springer. https://doi.org/10.1007/978-3-030-04612-5_2","chicago":"Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,” 11316:21–36. Springer, 2018. https://doi.org/10.1007/978-3-030-04612-5_2."},"author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","first_name":"Guy","last_name":"Avni"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus"}],"type":"conference","main_file_link":[{"url":"https://arxiv.org/abs/1804.04372","open_access":"1"}]},{"abstract":[{"text":"Due to data compression or low resolution, nearby vertices and edges of a graph drawing may be bundled to a common node or arc. We model such a “compromised” drawing by a piecewise linear map φ:G → ℝ. We wish to perturb φ by an arbitrarily small ε>0 into a proper drawing (in which the vertices are distinct points, any two edges intersect in finitely many points, and no three edges have a common interior point) that minimizes the number of crossings. An ε-perturbation, for every ε>0, is given by a piecewise linear map (Formula Presented), where with ||·|| is the uniform norm (i.e., sup norm). We present a polynomial-time solution for this optimization problem when G is a cycle and the map φ has no spurs (i.e., no two adjacent edges are mapped to overlapping arcs). We also show that the problem becomes NP-complete (i) when G is an arbitrary graph and φ has no spurs, and (ii) when φ may have spurs and G is a cycle or a union of disjoint paths.","lang":"eng"}],"_id":"5791","oa_version":"Preprint","department":[{"_id":"UlWa"}],"alternative_title":["LNCS"],"external_id":{"arxiv":["1808.07608"],"isi":["000672802500016"]},"title":"Crossing minimization in perturbed drawings","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","day":"18","status":"public","isi":1,"scopus_import":"1","article_processing_charge":"No","fulldoi":"https://doi.org/10.1007/978-3-030-04414-5_16","doi":"10.1007/978-3-030-04414-5_16","date_created":"2018-12-30T22:59:15Z","publication_status":"published","year":"2018","quality_controlled":"1","date_updated":"2025-07-10T11:53:00Z","date_published":"2018-12-18T00:00:00Z","author":[{"last_name":"Fulek","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav"},{"full_name":"Tóth, Csaba D.","first_name":"Csaba D.","last_name":"Tóth"}],"conference":{"end_date":"2018-09-28","start_date":"2018-09-26","name":"GD: Graph Drawing and Network Visualization","location":"Barcelona, Spain"},"citation":{"ieee":"R. Fulek and C. D. Tóth, “Crossing minimization in perturbed drawings,” presented at the GD: Graph Drawing and Network Visualization, Barcelona, Spain, 2018, vol. 11282, pp. 229–241.","ama":"Fulek R, Tóth CD. Crossing minimization in perturbed drawings. In: Vol 11282. Springer; 2018:229-241. doi:10.1007/978-3-030-04414-5_16","short":"R. Fulek, C.D. Tóth, in:, Springer, 2018, pp. 229–241.","ista":"Fulek R, Tóth CD. 2018. Crossing minimization in perturbed drawings. GD: Graph Drawing and Network Visualization, LNCS, vol. 11282, 229–241.","mla":"Fulek, Radoslav, and Csaba D. Tóth. Crossing Minimization in Perturbed Drawings. Vol. 11282, Springer, 2018, pp. 229–41, doi:10.1007/978-3-030-04414-5_16.","apa":"Fulek, R., & Tóth, C. D. (2018). Crossing minimization in perturbed drawings (Vol. 11282, pp. 229–241). Presented at the GD: Graph Drawing and Network Visualization, Barcelona, Spain: Springer. https://doi.org/10.1007/978-3-030-04414-5_16","chicago":"Fulek, Radoslav, and Csaba D. Tóth. “Crossing Minimization in Perturbed Drawings,” 11282:229–41. Springer, 2018. https://doi.org/10.1007/978-3-030-04414-5_16."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.07608"}],"type":"conference","volume":"11282 ","publication_identifier":{"isbn":["9783030044138"]},"publisher":"Springer","page":"229-241","arxiv":1,"language":[{"iso":"eng"}],"oa":1},{"ec_funded":1,"_id":"5794","abstract":[{"lang":"eng","text":"We present an approach to interacting quantum many-body systems based on the notion of quantum groups, also known as q-deformed Lie algebras. In particular, we show that, if the symmetry of a free quantum particle corresponds to a Lie group G, in the presence of a many-body environment this particle can be described by a deformed group, Gq. Crucially, the single deformation parameter, q, contains all the information about the many-particle interactions in the system. We exemplify our approach by considering a quantum rotor interacting with a bath of bosons, and demonstrate that extracting the value of q from closed-form solutions in the perturbative regime allows one to predict the behavior of the system for arbitrary values of the impurity-bath coupling strength, in good agreement with nonperturbative calculations. Furthermore, the value of the deformation parameter allows one to predict at which coupling strengths rotor-bath interactions result in a formation of a stable quasiparticle. The approach based on quantum groups does not only allow for a drastic simplification of impurity problems, but also provides valuable insights into hidden symmetries of interacting many-particle systems."}],"oa_version":"Preprint","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF","_id":"26031614-B435-11E9-9278-68D0E5697425","grant_number":"P29902"}],"department":[{"_id":"MiLe"}],"external_id":{"isi":["000454178600009"],"arxiv":["1809.00222"]},"title":"Quantum groups as hidden symmetries of quantum impurities","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"12","day":"17","isi":1,"status":"public","article_processing_charge":"No","scopus_import":"1","fulldoi":"https://doi.org/10.1103/PhysRevLett.121.255302","doi":"10.1103/PhysRevLett.121.255302","publication_status":"published","article_type":"original","date_created":"2019-01-06T22:59:12Z","year":"2018","quality_controlled":"1","date_updated":"2025-04-15T06:50:24Z","intvolume":" 121","date_published":"2018-12-17T00:00:00Z","publication":"Physical Review Letters","author":[{"first_name":"Enderalp","full_name":"Yakaboylu, Enderalp","orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","last_name":"Yakaboylu"},{"last_name":"Shkolnikov","first_name":"Mikhail","id":"35084A62-F248-11E8-B48F-1D18A9856A87","full_name":"Shkolnikov, Mikhail","orcid":"0000-0002-4310-178X"},{"orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","last_name":"Lemeshko"}],"citation":{"ista":"Yakaboylu E, Shkolnikov M, Lemeshko M. 2018. Quantum groups as hidden symmetries of quantum impurities. Physical Review Letters. 121(25), 255302.","mla":"Yakaboylu, Enderalp, et al. “Quantum Groups as Hidden Symmetries of Quantum Impurities.” Physical Review Letters, vol. 121, no. 25, 255302, American Physical Society, 2018, doi:10.1103/PhysRevLett.121.255302.","apa":"Yakaboylu, E., Shkolnikov, M., & Lemeshko, M. (2018). Quantum groups as hidden symmetries of quantum impurities. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.121.255302","chicago":"Yakaboylu, Enderalp, Mikhail Shkolnikov, and Mikhail Lemeshko. “Quantum Groups as Hidden Symmetries of Quantum Impurities.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.121.255302.","ama":"Yakaboylu E, Shkolnikov M, Lemeshko M. Quantum groups as hidden symmetries of quantum impurities. Physical Review Letters. 2018;121(25). doi:10.1103/PhysRevLett.121.255302","ieee":"E. Yakaboylu, M. Shkolnikov, and M. Lemeshko, “Quantum groups as hidden symmetries of quantum impurities,” Physical Review Letters, vol. 121, no. 25. American Physical Society, 2018.","short":"E. Yakaboylu, M. Shkolnikov, M. Lemeshko, Physical Review Letters 121 (2018)."},"article_number":"255302","main_file_link":[{"url":"https://arxiv.org/abs/1809.00222","open_access":"1"}],"issue":"25","type":"journal_article","volume":121,"publication_identifier":{"issn":["00319007"]},"publisher":"American Physical Society","arxiv":1,"language":[{"iso":"eng"}],"oa":1},{"issue":"12","type":"journal_article","article_number":"181286","citation":{"ieee":"B. Corominas-Murtra, M. S. Fibla, S. Valverde, and R. Solé, “Chromatic transitions in the emergence of syntax networks,” Royal Society Open Science, vol. 5, no. 12. The Royal Society, 2018.","ama":"Corominas-Murtra B, Fibla MS, Valverde S, Solé R. Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. 2018;5(12). doi:10.1098/rsos.181286","short":"B. Corominas-Murtra, M.S. Fibla, S. Valverde, R. Solé, Royal Society Open Science 5 (2018).","ista":"Corominas-Murtra B, Fibla MS, Valverde S, Solé R. 2018. Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. 5(12), 181286.","mla":"Corominas-Murtra, Bernat, et al. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society Open Science, vol. 5, no. 12, 181286, The Royal Society, 2018, doi:10.1098/rsos.181286.","apa":"Corominas-Murtra, B., Fibla, M. S., Valverde, S., & Solé, R. (2018). Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. The Royal Society. https://doi.org/10.1098/rsos.181286","chicago":"Corominas-Murtra, Bernat, Martí Sànchez Fibla, Sergi Valverde, and Ricard Solé. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society Open Science. The Royal Society, 2018. https://doi.org/10.1098/rsos.181286."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"file_date_updated":"2020-07-14T12:47:13Z","author":[{"id":"43BE2298-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9806-5643","full_name":"Corominas-Murtra, Bernat","first_name":"Bernat","last_name":"Corominas-Murtra"},{"last_name":"Fibla","full_name":"Fibla, Martí Sànchez","first_name":"Martí Sànchez"},{"full_name":"Valverde, Sergi","first_name":"Sergi","last_name":"Valverde"},{"last_name":"Solé","first_name":"Ricard","full_name":"Solé, Ricard"}],"publisher":"The Royal Society","ddc":["570"],"oa":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2054-5703"]},"volume":5,"acknowledgement":"This work was supported by the James McDonnell Foundation (B.C-M., S.V. and R.S.)","file":[{"content_type":"application/pdf","date_created":"2019-02-05T14:38:09Z","access_level":"open_access","relation":"main_file","checksum":"9664d4417f6b792242e31eea77ce9501","file_id":"5924","creator":"dernst","date_updated":"2020-07-14T12:47:13Z","file_name":"2018_RoyalSocOS_Corominas.pdf","file_size":646732}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Chromatic transitions in the emergence of syntax networks","has_accepted_license":"1","isi":1,"status":"public","day":"12","month":"12","department":[{"_id":"EdHa"}],"oa_version":"Published Version","abstract":[{"text":"The emergence of syntax during childhood is a remarkable example of how complex correlations unfold in nonlinear ways through development. In particular, rapid transitions seem to occur as children reach the age of two, which seems to separate a two-word, tree-like network of syntactic relations among words from the scale-free graphs associated with the adult, complex grammar. Here, we explore the evolution of syntax networks through language acquisition using the chromatic number, which captures the transition and provides a natural link to standard theories on syntactic structures. The data analysis is compared to a null model of network growth dynamics which is shown to display non-trivial and sensible differences. At a more general level, we observe that the chromatic classes define independent regions of the graph, and thus, can be interpreted as the footprints of incompatibility relations, somewhat as opposed to modularity considerations.","lang":"eng"}],"_id":"5859","external_id":{"pmid":["30662738"],"isi":["000456566500027"]},"intvolume":" 5","date_updated":"2023-10-18T06:41:12Z","quality_controlled":"1","pmid":1,"publication":"Royal Society Open Science","date_published":"2018-12-12T00:00:00Z","doi":"10.1098/rsos.181286","fulldoi":"https://doi.org/10.1098/rsos.181286","scopus_import":"1","article_processing_charge":"No","year":"2018","date_created":"2019-01-20T22:59:18Z","article_type":"original","publication_status":"published"},{"doi":"10.7554/eLife.37888","fulldoi":"https://doi.org/10.7554/eLife.37888","article_processing_charge":"No","scopus_import":"1","year":"2018","date_created":"2019-01-20T22:59:19Z","article_type":"original","publication_status":"published","intvolume":" 7","date_updated":"2025-07-10T11:53:05Z","quality_controlled":"1","publication":"eLife","date_published":"2018-06-06T00:00:00Z","department":[{"_id":"MiSi"}],"oa_version":"Published Version","_id":"5861","abstract":[{"text":"In zebrafish larvae, it is the cell type that determines how the cell responds to a chemokine signal.","lang":"eng"}],"external_id":{"isi":["000434375000001"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The cell sets the tone","has_accepted_license":"1","isi":1,"status":"public","month":"06","day":"06","corr_author":"1","publication_identifier":{"issn":["2050-084X"]},"volume":7,"file":[{"file_id":"5973","creator":"dernst","file_size":358141,"date_updated":"2020-07-14T12:47:13Z","file_name":"2018_eLife_Alanko.pdf","access_level":"open_access","date_created":"2019-02-13T10:52:11Z","content_type":"application/pdf","checksum":"f1c7ec2a809408d763c4b529a98f9a3b","relation":"main_file"}],"publisher":"eLife Sciences Publications","ddc":["570"],"language":[{"iso":"eng"}],"oa":1,"citation":{"ista":"Alanko JH, Sixt MK. 2018. The cell sets the tone. eLife. 7, e37888.","mla":"Alanko, Jonna H., and Michael K. Sixt. “The Cell Sets the Tone.” ELife, vol. 7, e37888, eLife Sciences Publications, 2018, doi:10.7554/eLife.37888.","apa":"Alanko, J. H., & Sixt, M. K. (2018). The cell sets the tone. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.37888","chicago":"Alanko, Jonna H, and Michael K Sixt. “The Cell Sets the Tone.” ELife. eLife Sciences Publications, 2018. https://doi.org/10.7554/eLife.37888.","ieee":"J. H. Alanko and M. K. Sixt, “The cell sets the tone,” eLife, vol. 7. eLife Sciences Publications, 2018.","ama":"Alanko JH, Sixt MK. The cell sets the tone. eLife. 2018;7. doi:10.7554/eLife.37888","short":"J.H. Alanko, M.K. Sixt, ELife 7 (2018)."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"file_date_updated":"2020-07-14T12:47:13Z","author":[{"last_name":"Alanko","first_name":"Jonna H","full_name":"Alanko, Jonna H","orcid":"0000-0002-7698-3061","id":"2CC12E8C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179"}],"type":"journal_article","article_number":"e37888"},{"external_id":{"isi":["000441266700006"],"pmid":["30089840"]},"department":[{"_id":"GaNo"}],"abstract":[{"text":"Despite the remarkable number of scientific breakthroughs of the last 100 years, the treatment of neurodevelopmental\r\ndisorders (e.g., autism spectrum disorder, intellectual disability) remains a great challenge. Recent advancements in\r\ngenomics, such as whole-exome or whole-genome sequencing, have enabled scientists to identify numerous\r\nmutations underlying neurodevelopmental disorders. Given the few hundred risk genes that have been discovered,\r\nthe etiological variability and the heterogeneous clinical presentation, the need for genotype — along with phenotype-\r\nbased diagnosis of individual patients has become a requisite. In this review we look at recent advancements in\r\ngenomic analysis and their translation into clinical practice.","lang":"eng"}],"_id":"5888","oa_version":"Published Version","day":"07","month":"08","status":"public","isi":1,"title":"Genomics in neurodevelopmental disorders: an avenue to personalized medicine","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","year":"2018","publication_status":"published","date_created":"2019-01-27T22:59:11Z","fulldoi":"https://doi.org/10.1038/s12276-018-0129-7","doi":"10.1038/s12276-018-0129-7","article_processing_charge":"No","scopus_import":"1","publication":"Experimental & Molecular Medicine","pmid":1,"date_published":"2018-08-07T00:00:00Z","intvolume":" 50","date_updated":"2023-09-11T14:04:41Z","quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"citation":{"ieee":"D.-C. Tarlungeanu and G. Novarino, “Genomics in neurodevelopmental disorders: an avenue to personalized medicine,” Experimental & Molecular Medicine, vol. 50, no. 8. Springer Nature, 2018.","ama":"Tarlungeanu D-C, Novarino G. Genomics in neurodevelopmental disorders: an avenue to personalized medicine. Experimental & Molecular Medicine. 2018;50(8). doi:10.1038/s12276-018-0129-7","short":"D.-C. Tarlungeanu, G. Novarino, Experimental & Molecular Medicine 50 (2018).","mla":"Tarlungeanu, Dora-Clara, and Gaia Novarino. “Genomics in Neurodevelopmental Disorders: An Avenue to Personalized Medicine.” Experimental & Molecular Medicine, vol. 50, no. 8, 100, Springer Nature, 2018, doi:10.1038/s12276-018-0129-7.","ista":"Tarlungeanu D-C, Novarino G. 2018. Genomics in neurodevelopmental disorders: an avenue to personalized medicine. Experimental & Molecular Medicine. 50(8), 100.","apa":"Tarlungeanu, D.-C., & Novarino, G. (2018). Genomics in neurodevelopmental disorders: an avenue to personalized medicine. Experimental & Molecular Medicine. Springer Nature. https://doi.org/10.1038/s12276-018-0129-7","chicago":"Tarlungeanu, Dora-Clara, and Gaia Novarino. “Genomics in Neurodevelopmental Disorders: An Avenue to Personalized Medicine.” Experimental & Molecular Medicine. Springer Nature, 2018. https://doi.org/10.1038/s12276-018-0129-7."},"author":[{"id":"2ABCE612-F248-11E8-B48F-1D18A9856A87","full_name":"Tarlungeanu, Dora-Clara","first_name":"Dora-Clara","last_name":"Tarlungeanu"},{"first_name":"Gaia","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino"}],"file_date_updated":"2020-07-14T12:47:13Z","type":"journal_article","issue":"8","article_number":"100","file":[{"content_type":"application/pdf","access_level":"open_access","date_created":"2019-01-28T15:18:02Z","relation":"main_file","checksum":"4498301c8c53097c9a1a8ef990936eb5","creator":"dernst","file_id":"5893","date_updated":"2020-07-14T12:47:13Z","file_name":"2018_EMM_Tarlungeanu.pdf","file_size":1237482}],"publication_identifier":{"issn":["2092-6413"]},"volume":50,"language":[{"iso":"eng"}],"oa":1,"publisher":"Springer Nature","ddc":["570"]},{"scopus_import":1,"fulldoi":"https://doi.org/10.1007/978-3-319-10575-8_27","doi":"10.1007/978-3-319-10575-8_27","publication_identifier":{"isbn":["978-3-319-10574-1"]},"date_created":"2018-12-11T11:44:24Z","publication_status":"published","year":"2018","quality_controlled":"1","date_updated":"2021-01-12T08:05:10Z","publist_id":"7995","publisher":"Springer","page":"921 - 962","date_published":"2018-05-19T00:00:00Z","publication":"Handbook of Model Checking","language":[{"iso":"eng"}],"_id":"59","abstract":[{"lang":"eng","text":"Graph-based games are an important tool in computer science. They have applications in synthesis, verification, refinement, and far beyond. We review graphbased games with objectives on infinite plays. We give definitions and algorithms to solve the games and to give a winning strategy. The objectives we consider are mostly Boolean, but we also look at quantitative graph-based games and their objectives. Synthesis aims to turn temporal logic specifications into correct reactive systems. We explain the reduction of synthesis to graph-based games (or equivalently tree automata) using synthesis of LTL specifications as an example. We treat the classical approach that uses determinization of parity automata and more modern approaches."}],"author":[{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"}],"oa_version":"None","citation":{"short":"R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Model Checking, 1st ed., Springer, 2018, pp. 921–962.","ieee":"R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Model Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.","ama":"Bloem R, Chatterjee K, Jobstmann B. Graph games and reactive synthesis. In: Henzinger TA, Clarke EM, Veith H, Bloem R, eds. Handbook of Model Checking. 1st ed. Springer; 2018:921-962. doi:10.1007/978-3-319-10575-8_27","chicago":"Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In Handbook of Model Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_27.","apa":"Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27","mla":"Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” Handbook of Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:10.1007/978-3-319-10575-8_27.","ista":"Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962."},"department":[{"_id":"KrCh"}],"editor":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"last_name":"Clarke","first_name":"Edmund M.","full_name":"Clarke, Edmund M."},{"last_name":"Veith","first_name":"Helmut","full_name":"Veith, Helmut"},{"first_name":"Roderick","full_name":"Bloem, Roderick","last_name":"Bloem"}],"title":"Graph games and reactive synthesis","type":"book_chapter","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"19","month":"05","edition":"1","status":"public"},{"date_published":"2018-09-30T00:00:00Z","publication":"2018 International Conference on Embedded Software","date_updated":"2025-07-10T11:53:06Z","quality_controlled":"1","publication_status":"published","date_created":"2019-02-13T09:19:28Z","year":"2018","article_processing_charge":"No","scopus_import":"1","fulldoi":"https://doi.org/10.1109/emsoft.2018.8537203","doi":"10.1109/emsoft.2018.8537203","day":"30","month":"09","isi":1,"status":"public","has_accepted_license":"1","title":"Keynote: The first-order logic of signals","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"isi":["000492828500005"]},"abstract":[{"text":"Formalizing properties of systems with continuous dynamics is a challenging task. In this paper, we propose a formal framework for specifying and monitoring rich temporal properties of real-valued signals. We introduce signal first-order logic (SFO) as a specification language that combines first-order logic with linear-real arithmetic and unary function symbols interpreted as piecewise-linear signals. We first show that while the satisfiability problem for SFO is undecidable, its membership and monitoring problems are decidable. We develop an offline monitoring procedure for SFO that has polynomial complexity in the size of the input trace and the specification, for a fixed number of quantifiers and function symbols. We show that the algorithm has computation time linear in the size of the input trace for the important fragment of bounded-response specifications interpreted over input traces with finite variability. We can use our results to extend signal temporal logic with first-order quantifiers over time and value parameters, while preserving its efficient monitoring. We finally demonstrate the practical appeal of our logic through a case study in the micro-electronics domain.","lang":"eng"}],"_id":"5959","oa_version":"Published Version","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"department":[{"_id":"ToHe"}],"page":"1-10","oa":1,"language":[{"iso":"eng"}],"ddc":["000"],"publisher":"IEEE","file":[{"relation":"main_file","checksum":"234a33ad9055b3458fcdda6af251b33a","content_type":"application/pdf","date_created":"2020-05-14T16:01:29Z","access_level":"open_access","date_updated":"2020-07-14T12:47:13Z","file_name":"2018_EMSOFT_Bakhirkin.pdf","file_size":338006,"file_id":"7839","creator":"dernst"}],"publication_identifier":{"isbn":["9781538655603"]},"type":"conference","author":[{"last_name":"Bakhirkin","first_name":"Alexey","full_name":"Bakhirkin, Alexey"},{"last_name":"Ferrere","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Nickovicl, Deian","first_name":"Deian","last_name":"Nickovicl"}],"file_date_updated":"2020-07-14T12:47:13Z","citation":{"ista":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. 2018. Keynote: The first-order logic of signals. 2018 International Conference on Embedded Software. EMSOFT: Embedded Software, 1–10.","mla":"Bakhirkin, Alexey, et al. “Keynote: The First-Order Logic of Signals.” 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10, doi:10.1109/emsoft.2018.8537203.","apa":"Bakhirkin, A., Ferrere, T., Henzinger, T. A., & Nickovicl, D. (2018). Keynote: The first-order logic of signals. In 2018 International Conference on Embedded Software (pp. 1–10). Turin, Italy: IEEE. https://doi.org/10.1109/emsoft.2018.8537203","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Thomas A Henzinger, and Deian Nickovicl. “Keynote: The First-Order Logic of Signals.” In 2018 International Conference on Embedded Software, 1–10. IEEE, 2018. https://doi.org/10.1109/emsoft.2018.8537203.","ama":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. Keynote: The first-order logic of signals. In: 2018 International Conference on Embedded Software. IEEE; 2018:1-10. doi:10.1109/emsoft.2018.8537203","ieee":"A. Bakhirkin, T. Ferrere, T. A. Henzinger, and D. Nickovicl, “Keynote: The first-order logic of signals,” in 2018 International Conference on Embedded Software, Turin, Italy, 2018, pp. 1–10.","short":"A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10."},"conference":{"end_date":"2018-10-05","location":"Turin, Italy","start_date":"2018-09-30","name":"EMSOFT: Embedded Software"}},{"page":"1500-1516","language":[{"iso":"eng"}],"oa":1,"arxiv":1,"publisher":"SAGE Publications","volume":37,"publication_identifier":{"eissn":["1741-3176"],"issn":["0278-3649"]},"main_file_link":[{"url":"https://arxiv.org/abs/1712.01341","open_access":"1"}],"type":"journal_article","issue":"12","author":[{"last_name":"Rohou","full_name":"Rohou, Simon","first_name":"Simon"},{"first_name":"Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","full_name":"Franek, Peter","orcid":"0000-0001-8878-8397","last_name":"Franek"},{"first_name":"Clément","full_name":"Aubry, Clément","last_name":"Aubry"},{"last_name":"Jaulin","first_name":"Luc","full_name":"Jaulin, Luc"}],"citation":{"ieee":"S. Rohou, P. Franek, C. Aubry, and L. Jaulin, “Proving the existence of loops in robot trajectories,” The International Journal of Robotics Research, vol. 37, no. 12. SAGE Publications, pp. 1500–1516, 2018.","ama":"Rohou S, Franek P, Aubry C, Jaulin L. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 2018;37(12):1500-1516. doi:10.1177/0278364918808367","short":"S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516.","mla":"Rohou, Simon, et al. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research, vol. 37, no. 12, SAGE Publications, 2018, pp. 1500–16, doi:10.1177/0278364918808367.","ista":"Rohou S, Franek P, Aubry C, Jaulin L. 2018. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 37(12), 1500–1516.","apa":"Rohou, S., Franek, P., Aubry, C., & Jaulin, L. (2018). Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. SAGE Publications. https://doi.org/10.1177/0278364918808367","chicago":"Rohou, Simon, Peter Franek, Clément Aubry, and Luc Jaulin. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research. SAGE Publications, 2018. https://doi.org/10.1177/0278364918808367."},"date_published":"2018-10-24T00:00:00Z","publication":"The International Journal of Robotics Research","quality_controlled":"1","date_updated":"2023-09-19T10:41:59Z","intvolume":" 37","publication_status":"published","date_created":"2019-02-13T09:36:20Z","year":"2018","scopus_import":"1","article_processing_charge":"No","doi":"10.1177/0278364918808367","fulldoi":"https://doi.org/10.1177/0278364918808367","status":"public","isi":1,"month":"10","day":"24","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Proving the existence of loops in robot trajectories","external_id":{"isi":["000456881100004"],"arxiv":["1712.01341"]},"oa_version":"Preprint","abstract":[{"lang":"eng","text":"In this paper we present a reliable method to verify the existence of loops along the uncertain trajectory of a robot, based on proprioceptive measurements only, within a bounded-error context. The loop closure detection is one of the key points in simultaneous localization and mapping (SLAM) methods, especially in homogeneous environments with difficult scenes recognitions. The proposed approach is generic and could be coupled with conventional SLAM algorithms to reliably reduce their computing burden, thus improving the localization and mapping processes in the most challenging environments such as unexplored underwater extents. To prove that a robot performed a loop whatever the uncertainties in its evolution, we employ the notion of topological degree that originates in the field of differential topology. We show that a verification tool based on the topological degree is an optimal method for proving robot loops. This is demonstrated both on datasets from real missions involving autonomous underwater vehicles and by a mathematical discussion."}],"_id":"5960","department":[{"_id":"UlWa"}]},{"fulldoi":"https://doi.org/10.1145/3212734.3212798","publication_identifier":{"isbn":["9781450357951"]},"doi":"10.1145/3212734.3212798","scopus_import":"1","article_processing_charge":"No","year":"2018","publication_status":"published","date_created":"2019-02-13T09:48:55Z","publisher":"ACM","date_updated":"2025-06-03T11:56:33Z","quality_controlled":"1","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","language":[{"iso":"eng"}],"page":"487-488","date_published":"2018-07-27T00:00:00Z","conference":{"location":"Egham, United Kingdom","start_date":"2018-07-23","name":"PODC: Principles of Distributed Computing","end_date":"2018-07-27"},"citation":{"ieee":"D.-A. Alistarh, “A brief tutorial on distributed and concurrent machine learning,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 487–488.","ama":"Alistarh D-A. A brief tutorial on distributed and concurrent machine learning. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM; 2018:487-488. doi:10.1145/3212734.3212798","short":"D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 487–488.","apa":"Alistarh, D.-A. (2018). A brief tutorial on distributed and concurrent machine learning. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 487–488). Egham, United Kingdom: ACM. https://doi.org/10.1145/3212734.3212798","ista":"Alistarh D-A. 2018. A brief tutorial on distributed and concurrent machine learning. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 487–488.","mla":"Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 487–88, doi:10.1145/3212734.3212798.","chicago":"Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 487–88. ACM, 2018. https://doi.org/10.1145/3212734.3212798."},"department":[{"_id":"DaAl"}],"author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"_id":"5961","abstract":[{"text":"The area of machine learning has made considerable progress over the past decade, enabled by the widespread availability of large datasets, as well as by improved algorithms and models. Given the large computational demands of machine learning workloads, parallelism, implemented either through single-node concurrency or through multi-node distribution, has been a third key ingredient to advances in machine learning.\r\nThe goal of this tutorial is to provide the audience with an overview of standard distribution techniques in machine learning, with an eye towards the intriguing trade-offs between synchronization and communication costs of distributed machine learning algorithms, on the one hand, and their convergence, on the other.The tutorial will focus on parallelization strategies for the fundamental stochastic gradient descent (SGD) algorithm, which is a key tool when training machine learning models, from classical instances such as linear regression, to state-of-the-art neural network architectures.\r\nThe tutorial will describe the guarantees provided by this algorithm in the sequential case, and then move on to cover both shared-memory and message-passing parallelization strategies, together with the guarantees they provide, and corresponding trade-offs. The presentation will conclude with a broad overview of ongoing research in distributed and concurrent machine learning. The tutorial will assume no prior knowledge beyond familiarity with basic concepts in algebra and analysis.\r\n","lang":"eng"}],"oa_version":"None","external_id":{"isi":["000458186900063"]},"type":"conference","title":"A brief tutorial on distributed and concurrent machine learning","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"27","month":"07","isi":1,"status":"public"},{"publication_identifier":{"isbn":["9781450357951"]},"publisher":"ACM","language":[{"iso":"eng"}],"oa":1,"arxiv":1,"page":"169-178","conference":{"end_date":"2018-07-27","name":"PODC: Principles of Distributed Computing","start_date":"2018-07-23","location":"Egham, United Kingdom"},"citation":{"short":"D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 169–178.","ama":"Alistarh D-A, De Sa C, Konstantinov NH. The convergence of stochastic gradient descent in asynchronous shared memory. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM; 2018:169-178. doi:10.1145/3212734.3212763","ieee":"D.-A. Alistarh, C. De Sa, and N. H. Konstantinov, “The convergence of stochastic gradient descent in asynchronous shared memory,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 169–178.","chicago":"Alistarh, Dan-Adrian, Christopher De Sa, and Nikola H Konstantinov. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 169–78. ACM, 2018. https://doi.org/10.1145/3212734.3212763.","mla":"Alistarh, Dan-Adrian, et al. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 169–78, doi:10.1145/3212734.3212763.","ista":"Alistarh D-A, De Sa C, Konstantinov NH. 2018. The convergence of stochastic gradient descent in asynchronous shared memory. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 169–178.","apa":"Alistarh, D.-A., De Sa, C., & Konstantinov, N. H. (2018). The convergence of stochastic gradient descent in asynchronous shared memory. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 169–178). Egham, United Kingdom: ACM. https://doi.org/10.1145/3212734.3212763"},"author":[{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"},{"first_name":"Christopher","full_name":"De Sa, Christopher","last_name":"De Sa"},{"full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","first_name":"Nikola H","last_name":"Konstantinov"}],"type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.08841"}],"doi":"10.1145/3212734.3212763","fulldoi":"https://doi.org/10.1145/3212734.3212763","scopus_import":"1","article_processing_charge":"No","year":"2018","date_created":"2019-02-13T09:58:58Z","publication_status":"published","quality_controlled":"1","date_updated":"2025-06-03T11:56:41Z","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","date_published":"2018-07-23T00:00:00Z","department":[{"_id":"DaAl"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine learning, representing the optimization backbone for training several classic models, from regression to neural networks. Given the recent practical focus on distributed machine learning, significant work has been dedicated to the convergence properties of this algorithm under the inconsistent and noisy updates arising from execution in a distributed environment. However, surprisingly, the convergence properties of this classic algorithm in the standard shared-memory model are still not well-understood. In this work, we address this gap, and provide new convergence bounds for lock-free concurrent stochastic gradient descent, executing in the classic asynchronous shared memory model, against a strong adaptive adversary. Our results give improved upper and lower bounds on the \"price of asynchrony'' when executing the fundamental SGD algorithm in a concurrent setting. They show that this classic optimization tool can converge faster and with a wider range of parameters than previously known under asynchronous iterations. At the same time, we exhibit a fundamental trade-off between the maximum delay in the system and the rate at which SGD can converge, which governs the set of parameters under which this algorithm can still work efficiently."}],"_id":"5962","external_id":{"isi":["000458186900022"],"arxiv":["1803.08841"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The convergence of stochastic gradient descent in asynchronous shared memory","status":"public","isi":1,"day":"23","month":"07"},{"publication_identifier":{"isbn":["9781450357951"]},"language":[{"iso":"eng"}],"oa":1,"arxiv":1,"page":"377-386","publisher":"ACM","conference":{"location":"Egham, United Kingdom","start_date":"2018-07-23","name":"PODC: Principles of Distributed Computing","end_date":"2018-07-27"},"citation":{"short":"D.-A. Alistarh, T.A. Brown, J. Kopinsky, G. Nadiradze, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 377–386.","ieee":"D.-A. Alistarh, T. A. Brown, J. Kopinsky, and G. Nadiradze, “Relaxed schedulers can efficiently parallelize iterative algorithms,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 377–386.","ama":"Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM; 2018:377-386. doi:10.1145/3212734.3212756","chicago":"Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 377–86. ACM, 2018. https://doi.org/10.1145/3212734.3212756.","mla":"Alistarh, Dan-Adrian, et al. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 377–86, doi:10.1145/3212734.3212756.","ista":"Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. 2018. Relaxed schedulers can efficiently parallelize iterative algorithms. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 377–386.","apa":"Alistarh, D.-A., Brown, T. A., Kopinsky, J., & Nadiradze, G. (2018). Relaxed schedulers can efficiently parallelize iterative algorithms. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 377–386). Egham, United Kingdom: ACM. https://doi.org/10.1145/3212734.3212756"},"author":[{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"},{"first_name":"Trevor A","full_name":"Brown, Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","last_name":"Brown"},{"last_name":"Kopinsky","full_name":"Kopinsky, Justin","first_name":"Justin"},{"first_name":"Giorgi","full_name":"Nadiradze, Giorgi","last_name":"Nadiradze"}],"type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.04155"}],"year":"2018","date_created":"2019-02-13T10:03:25Z","publication_status":"published","doi":"10.1145/3212734.3212756","fulldoi":"https://doi.org/10.1145/3212734.3212756","article_processing_charge":"No","scopus_import":"1","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","date_published":"2018-07-23T00:00:00Z","quality_controlled":"1","date_updated":"2025-06-03T11:56:49Z","external_id":{"arxiv":["1808.04155"],"isi":["000458186900048"]},"department":[{"_id":"DaAl"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"There has been significant progress in understanding the parallelism inherent to iterative sequential algorithms: for many classic algorithms, the depth of the dependence structure is now well understood, and scheduling techniques have been developed to exploit this shallow dependence structure for efficient parallel implementations. A related, applied research strand has studied methods by which certain iterative task-based algorithms can be efficiently parallelized via relaxed concurrent priority schedulers. These allow for high concurrency when inserting and removing tasks, at the cost of executing superfluous work due to the relaxed semantics of the scheduler. In this work, we take a step towards unifying these two research directions, by showing that there exists a family of relaxed priority schedulers that can efficiently and deterministically execute classic iterative algorithms such as greedy maximal independent set (MIS) and matching. Our primary result shows that, given a randomized scheduler with an expected relaxation factor of k in terms of the maximum allowed priority inversions on a task, and any graph on n vertices, the scheduler is able to execute greedy MIS with only an additive factor of \\poly(k) expected additional iterations compared to an exact (but not scalable) scheduler. This counter-intuitive result demonstrates that the overhead of relaxation when computing MIS is not dependent on the input size or structure of the input graph. Experimental results show that this overhead can be clearly offset by the gain in performance due to the highly scalable scheduler. In sum, we present an efficient method to deterministically parallelize iterative sequential algorithms, with provable runtime guarantees in terms of the number of executed tasks to completion."}],"_id":"5963","isi":1,"status":"public","month":"07","day":"23","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Relaxed schedulers can efficiently parallelize iterative algorithms"},{"external_id":{"isi":["000458186900052"]},"department":[{"_id":"DaAl"}],"oa_version":"Submitted Version","_id":"5964","abstract":[{"lang":"eng","text":"A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is an alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. A lock can be viewed as a queue that arbitrates the order in which the critical sections are executed, and a natural question is whether we can use stochastic analysis to predict the resulting throughput. As a preliminary evidence to the affirmative, we describe a simple model that can be used to predict the throughput of coarse-grained lock-based algorithms. We show that our model works well for CLH lock, and we expect it to work for other popular lock designs such as TTAS, MCS, etc."}],"isi":1,"status":"public","day":"23","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Brief Announcement: Performance prediction for coarse-grained locking","year":"2018","date_created":"2019-02-13T10:08:19Z","publication_status":"published","doi":"10.1145/3212734.3212785","fulldoi":"https://doi.org/10.1145/3212734.3212785","scopus_import":"1","article_processing_charge":"No","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","date_published":"2018-07-23T00:00:00Z","date_updated":"2025-06-03T11:58:00Z","quality_controlled":"1","citation":{"ama":"Aksenov V, Alistarh D-A, Kuznetsov P. Brief Announcement: Performance prediction for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM; 2018:411-413. doi:10.1145/3212734.3212785","ieee":"V. Aksenov, D.-A. Alistarh, and P. Kuznetsov, “Brief Announcement: Performance prediction for coarse-grained locking,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 411–413.","short":"V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 411–413.","apa":"Aksenov, V., Alistarh, D.-A., & Kuznetsov, P. (2018). Brief Announcement: Performance prediction for coarse-grained locking. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 411–413). Egham, United Kingdom: ACM. https://doi.org/10.1145/3212734.3212785","ista":"Aksenov V, Alistarh D-A, Kuznetsov P. 2018. Brief Announcement: Performance prediction for coarse-grained locking. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 411–413.","mla":"Aksenov, Vitaly, et al. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 411–13, doi:10.1145/3212734.3212785.","chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 411–13. ACM, 2018. https://doi.org/10.1145/3212734.3212785."},"conference":{"end_date":"2018-07-27","name":"PODC: Principles of Distributed Computing","start_date":"2018-07-23","location":"Egham, United Kingdom"},"author":[{"last_name":"Aksenov","first_name":"Vitaly","full_name":"Aksenov, Vitaly"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh"},{"first_name":"Petr","full_name":"Kuznetsov, Petr","last_name":"Kuznetsov"}],"type":"conference","main_file_link":[{"url":"https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1","open_access":"1"}],"publication_identifier":{"isbn":["9781450357951"]},"language":[{"iso":"eng"}],"oa":1,"page":"411-413","publisher":"ACM"},{"author":[{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"last_name":"Brown","first_name":"Trevor A","full_name":"Brown, Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Justin","full_name":"Kopinsky, Justin","last_name":"Kopinsky"},{"first_name":"Jerry Z.","full_name":"Li, Jerry Z.","last_name":"Li"},{"full_name":"Nadiradze, Giorgi","first_name":"Giorgi","last_name":"Nadiradze"}],"citation":{"apa":"Alistarh, D.-A., Brown, T. A., Kopinsky, J., Li, J. Z., & Nadiradze, G. (2018). Distributionally linearizable data structures. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18 (pp. 133–142). Vienna, Austria: ACM. https://doi.org/10.1145/3210377.3210411","mla":"Alistarh, Dan-Adrian, et al. “Distributionally Linearizable Data Structures.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM, 2018, pp. 133–42, doi:10.1145/3210377.3210411.","ista":"Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. 2018. Distributionally linearizable data structures. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 133–142.","chicago":"Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, 133–42. ACM, 2018. https://doi.org/10.1145/3210377.3210411.","ama":"Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable data structures. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM; 2018:133-142. doi:10.1145/3210377.3210411","ieee":"D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 133–142.","short":"D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM, 2018, pp. 133–142."},"conference":{"location":"Vienna, Austria","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","start_date":"2018-07-16","end_date":"2018-07-18"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.01018"}],"type":"conference","publication_identifier":{"isbn":["9781450357999"]},"publisher":"ACM","page":"133-142","arxiv":1,"oa":1,"language":[{"iso":"eng"}],"_id":"5965","abstract":[{"text":"Relaxed concurrent data structures have become increasingly popular, due to their scalability in graph processing and machine learning applications (\\citeNguyen13, gonzalez2012powergraph ). Despite considerable interest, there exist families of natural, high performing randomized relaxed concurrent data structures, such as the popular MultiQueue~\\citeMQ pattern for implementing relaxed priority queue data structures, for which no guarantees are known in the concurrent setting~\\citeAKLN17. Our main contribution is in showing for the first time that, under a set of analytic assumptions, a family of relaxed concurrent data structures, including variants of MultiQueues, but also a new approximate counting algorithm we call the MultiCounter, provides strong probabilistic guarantees on the degree of relaxation with respect to the sequential specification, in arbitrary concurrent executions. We formalize these guarantees via a new correctness condition called distributional linearizability, tailored to concurrent implementations with randomized relaxations. Our result is based on a new analysis of an asynchronous variant of the classic power-of-two-choices load balancing algorithm, in which placement choices can be based on inconsistent, outdated information (this result may be of independent interest). We validate our results empirically, showing that the MultiCounter algorithm can implement scalable relaxed timestamps.","lang":"eng"}],"oa_version":"Preprint","department":[{"_id":"DaAl"}],"external_id":{"arxiv":["1804.01018"],"isi":["000545269600016"]},"title":"Distributionally linearizable data structures","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"10429","relation":"dissertation_contains","status":"public"}]},"month":"07","day":"16","status":"public","isi":1,"scopus_import":"1","article_processing_charge":"No","fulldoi":"https://doi.org/10.1145/3210377.3210411","doi":"10.1145/3210377.3210411","date_created":"2019-02-13T10:17:19Z","publication_status":"published","year":"2018","quality_controlled":"1","date_updated":"2026-04-08T07:00:45Z","date_published":"2018-07-16T00:00:00Z","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18"},{"type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.00947"}],"conference":{"location":"Vienna, Austria","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","start_date":"2018-07-16","end_date":"2018-07-18"},"citation":{"ieee":"D.-A. Alistarh, S. K. Haider, R. Kübler, and G. Nadiradze, “The transactional conflict problem,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 383–392.","ama":"Alistarh D-A, Haider SK, Kübler R, Nadiradze G. The transactional conflict problem. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM; 2018:383-392. doi:10.1145/3210377.3210406","short":"D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM, 2018, pp. 383–392.","apa":"Alistarh, D.-A., Haider, S. K., Kübler, R., & Nadiradze, G. (2018). The transactional conflict problem. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18 (pp. 383–392). Vienna, Austria: ACM. https://doi.org/10.1145/3210377.3210406","mla":"Alistarh, Dan-Adrian, et al. “The Transactional Conflict Problem.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM, 2018, pp. 383–92, doi:10.1145/3210377.3210406.","ista":"Alistarh D-A, Haider SK, Kübler R, Nadiradze G. 2018. The transactional conflict problem. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 383–392.","chicago":"Alistarh, Dan-Adrian, Syed Kamran Haider, Raphael Kübler, and Giorgi Nadiradze. “The Transactional Conflict Problem.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, 383–92. ACM, 2018. https://doi.org/10.1145/3210377.3210406."},"author":[{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"},{"first_name":"Syed Kamran","full_name":"Haider, Syed Kamran","last_name":"Haider"},{"full_name":"Kübler, Raphael","first_name":"Raphael","last_name":"Kübler"},{"last_name":"Nadiradze","full_name":"Nadiradze, Giorgi","first_name":"Giorgi"}],"arxiv":1,"oa":1,"language":[{"iso":"eng"}],"page":"383-392","publisher":"ACM","publication_identifier":{"isbn":["9781450357999"]},"month":"07","day":"16","isi":1,"status":"public","title":"The transactional conflict problem","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1804.00947"],"isi":["000545269600046"]},"department":[{"_id":"DaAl"}],"_id":"5966","abstract":[{"lang":"eng","text":"The transactional conflict problem arises in transactional systems whenever two or more concurrent transactions clash on a data item. While the standard solution to such conflicts is to immediately abort one of the transactions, some practical systems consider the alternative of delaying conflict resolution for a short interval, which may allow one of the transactions to commit. The challenge in the transactional conflict problem is to choose the optimal length of this delay interval so as to minimize the overall running time penalty for the conflicting transactions. In this paper, we propose a family of optimal online algorithms for the transactional conflict problem. Specifically, we consider variants of this problem which arise in different implementations of transactional systems, namely \"requestor wins'' and \"requestor aborts'' implementations: in the former, the recipient of a coherence request is aborted, whereas in the latter, it is the requestor which has to abort. Both strategies are implemented by real systems. We show that the requestor aborts case can be reduced to a classic instance of the ski rental problem, while the requestor wins case leads to a new version of this classical problem, for which we derive optimal deterministic and randomized algorithms. Moreover, we prove that, under a simplified adversarial model, our algorithms are constant-competitive with the offline optimum in terms of throughput. We validate our algorithmic results empirically through a hardware simulation of hardware transactional memory (HTM), showing that our algorithms can lead to non-trivial performance improvements for classic concurrent data structures."}],"oa_version":"Preprint","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","date_published":"2018-07-16T00:00:00Z","quality_controlled":"1","date_updated":"2025-06-03T11:58:22Z","year":"2018","publication_status":"published","date_created":"2019-02-13T10:26:07Z","fulldoi":"https://doi.org/10.1145/3210377.3210406","doi":"10.1145/3210377.3210406","scopus_import":"1","article_processing_charge":"No"},{"doi":"10.1145/3219166.3219198","fulldoi":"https://doi.org/10.1145/3219166.3219198","article_processing_charge":"No","scopus_import":"1","year":"2018","date_created":"2019-02-13T10:31:41Z","publication_status":"published","quality_controlled":"1","date_updated":"2025-05-14T11:24:35Z","publication":"Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18","date_published":"2018-06-18T00:00:00Z","department":[{"_id":"KrCh"}],"oa_version":"Submitted Version","_id":"5967","abstract":[{"lang":"eng","text":"The Big Match is a multi-stage two-player game. In each stage Player 1 hides one or two pebbles in his hand, and his opponent has to guess that number; Player 1 loses a point if Player 2 is correct, and otherwise he wins a point. As soon as Player 1 hides one pebble, the players cannot change their choices in any future stage.\r\nBlackwell and Ferguson (1968) give an ε-optimal strategy for Player 1 that hides, in each stage, one pebble with a probability that depends on the entire past history. Any strategy that depends just on the clock or on a finite memory is worthless. The long-standing natural open problem has been whether every strategy that depends just on the clock and a finite memory is worthless. We prove that there is such a strategy that is ε-optimal. In fact, we show that just two states of memory are sufficient.\r\n"}],"external_id":{"isi":["000492755100020"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The Big Match with a clock and a bit of memory","has_accepted_license":"1","isi":1,"status":"public","month":"06","day":"18","publication_identifier":{"isbn":["9781450358293"]},"file":[{"checksum":"bb52683e349cfd864f4769a8f38f2798","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_created":"2019-11-19T08:24:24Z","file_size":302539,"file_name":"2018_EC18_Hansen.pdf","date_updated":"2020-07-14T12:47:14Z","file_id":"7054","creator":"dernst"}],"publisher":"ACM","ddc":["000"],"language":[{"iso":"eng"}],"oa":1,"page":"149-150","conference":{"end_date":"2018-06-22","start_date":"2018-06-18","name":"EC: Conference on Economics and Computation","location":"Ithaca, NY, United States"},"citation":{"short":"K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM, 2018, pp. 149–150.","ama":"Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit of memory. In: Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. ACM; 2018:149-150. doi:10.1145/3219166.3219198","ieee":"K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.","chicago":"Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, 149–50. ACM, 2018. https://doi.org/10.1145/3219166.3219198.","mla":"Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM, 2018, pp. 149–50, doi:10.1145/3219166.3219198.","ista":"Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. EC: Conference on Economics and Computation, 149–150.","apa":"Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM. https://doi.org/10.1145/3219166.3219198"},"file_date_updated":"2020-07-14T12:47:14Z","author":[{"last_name":"Hansen","first_name":"Kristoffer Arnsfelt","full_name":"Hansen, Kristoffer Arnsfelt"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Neyman","full_name":"Neyman, Abraham","first_name":"Abraham"}],"type":"conference"},{"publisher":"Society for Industrial and Applied Mathematics","arxiv":1,"oa":1,"language":[{"iso":"eng"}],"page":"2029-2056","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"volume":47,"issue":"6","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.08547"}],"citation":{"short":"V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.","ama":"Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 2018;47(6):2029-2056. doi:10.1137/16m1093306","ieee":"V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” SIAM Journal on Computing, vol. 47, no. 6. Society for Industrial and Applied Mathematics, pp. 2029–2056, 2018.","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2018. https://doi.org/10.1137/16m1093306.","apa":"Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/16m1093306","ista":"Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056.","mla":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial and Applied Mathematics, 2018, pp. 2029–56, doi:10.1137/16m1093306."},"author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"intvolume":" 47","date_updated":"2025-09-22T09:44:20Z","quality_controlled":"1","publication":"SIAM Journal on Computing","date_published":"2018-11-08T00:00:00Z","fulldoi":"https://doi.org/10.1137/16m1093306","doi":"10.1137/16m1093306","scopus_import":"1","article_processing_charge":"No","year":"2018","publication_status":"published","date_created":"2019-02-13T12:59:33Z","title":"Commutativity in the algorithmic Lovász local lemma","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"08","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1193"}]},"month":"11","isi":1,"status":"public","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"department":[{"_id":"VlKo"}],"ec_funded":1,"_id":"5975","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"}],"oa_version":"Preprint","external_id":{"isi":["000453785100001"],"arxiv":["1506.08547"]}},{"month":"11","day":"01","status":"public","isi":1,"title":"FlexMaps: Computational design of flat flexible shells for shaping 3D objects","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","external_id":{"isi":["000455953100064"]},"department":[{"_id":"BeBi"}],"project":[{"call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"Soft-bodied intelligence for Manipulation","grant_number":"645599","_id":"25082902-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"_id":"5976","abstract":[{"lang":"eng","text":"We propose FlexMaps, a novel framework for fabricating smooth shapes out of flat, flexible panels with tailored mechanical properties. We start by mapping the 3D surface onto a 2D domain as in traditional UV mapping to design a set of deformable flat panels called FlexMaps. For these panels, we design and obtain specific mechanical properties such that, once they are assembled, the static equilibrium configuration matches the desired 3D shape. FlexMaps can be fabricated from an almost rigid material, such as wood or plastic, and are made flexible in a controlled way by using computationally designed spiraling microstructures."}],"ec_funded":1,"oa_version":"Published Version","publication":"ACM Transactions on Graphics","date_published":"2018-11-01T00:00:00Z","intvolume":" 37","quality_controlled":"1","date_updated":"2025-03-31T15:59:13Z","year":"2018","date_created":"2019-02-13T13:12:53Z","article_type":"original","publication_status":"published","fulldoi":"https://doi.org/10.1145/3272127.3275076","doi":"10.1145/3272127.3275076","article_processing_charge":"No","scopus_import":"1","issue":"6","type":"journal_article","article_number":"241","citation":{"ama":"Malomo L, Perez Rodriguez J, Iarussi E, et al. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. 2018;37(6). doi:10.1145/3272127.3275076","ieee":"L. Malomo et al., “FlexMaps: Computational design of flat flexible shells for shaping 3D objects,” ACM Transactions on Graphics, vol. 37, no. 6. Association for Computing Machinery, 2018.","short":"L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni, B. Bickel, ACM Transactions on Graphics 37 (2018).","ista":"Malomo L, Perez Rodriguez J, Iarussi E, Pietroni N, Miguel E, Cignoni P, Bickel B. 2018. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. 37(6), 241.","mla":"Malomo, Luigi, et al. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” ACM Transactions on Graphics, vol. 37, no. 6, 241, Association for Computing Machinery, 2018, doi:10.1145/3272127.3275076.","apa":"Malomo, L., Perez Rodriguez, J., Iarussi, E., Pietroni, N., Miguel, E., Cignoni, P., & Bickel, B. (2018). FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3272127.3275076","chicago":"Malomo, Luigi, Jesus Perez Rodriguez, Emmanuel Iarussi, Nico Pietroni, Eder Miguel, Paolo Cignoni, and Bernd Bickel. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” ACM Transactions on Graphics. Association for Computing Machinery, 2018. https://doi.org/10.1145/3272127.3275076."},"author":[{"last_name":"Malomo","full_name":"Malomo, Luigi","first_name":"Luigi"},{"last_name":"Perez Rodriguez","full_name":"Perez Rodriguez, Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","first_name":"Jesus"},{"id":"33F19F16-F248-11E8-B48F-1D18A9856A87","full_name":"Iarussi, Emmanuel","first_name":"Emmanuel","last_name":"Iarussi"},{"first_name":"Nico","full_name":"Pietroni, Nico","last_name":"Pietroni"},{"last_name":"Miguel","full_name":"Miguel, Eder","first_name":"Eder"},{"last_name":"Cignoni","first_name":"Paolo","full_name":"Cignoni, Paolo"},{"last_name":"Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"}],"file_date_updated":"2020-07-14T12:47:14Z","language":[{"iso":"eng"}],"oa":1,"publisher":"Association for Computing Machinery","pubrep_id":"1068","ddc":["000"],"file":[{"file_size":100109811,"file_name":"flexmaps_author_version.pdf","date_updated":"2020-07-14T12:47:14Z","file_id":"6901","creator":"bbickel","checksum":"d0529a41c78b37ab8840685579fb33b4","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_created":"2019-09-23T12:48:52Z"}],"publication_identifier":{"issn":["0730-0301"]},"volume":37},{"issue":"52","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://upcommons.upc.edu/bitstream/2117/130444/1/Zhang%20preprint.pdf"}],"citation":{"short":"Y. Zhang, Y. Liu, K.H. Lim, C. Xing, M. Li, T. Zhang, P. Tang, J. Arbiol, J. Llorca, K.M. Ng, M. Ibáñez, P. Guardia, M. Prato, D. Cadavid, A. Cabot, Angewandte Chemie International Edition 57 (2018) 17063–17068.","ieee":"Y. Zhang et al., “Tin diselenide molecular precursor for solution-processable thermoelectric materials,” Angewandte Chemie International Edition, vol. 57, no. 52. Wiley, pp. 17063–17068, 2018.","ama":"Zhang Y, Liu Y, Lim KH, et al. Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. 2018;57(52):17063-17068. doi:10.1002/anie.201809847","chicago":"Zhang, Yu, Yu Liu, Khak Ho Lim, Congcong Xing, Mengyao Li, Ting Zhang, Pengyi Tang, et al. “Tin Diselenide Molecular Precursor for Solution-Processable Thermoelectric Materials.” Angewandte Chemie International Edition. Wiley, 2018. https://doi.org/10.1002/anie.201809847.","ista":"Zhang Y, Liu Y, Lim KH, Xing C, Li M, Zhang T, Tang P, Arbiol J, Llorca J, Ng KM, Ibáñez M, Guardia P, Prato M, Cadavid D, Cabot A. 2018. Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. 57(52), 17063–17068.","mla":"Zhang, Yu, et al. “Tin Diselenide Molecular Precursor for Solution-Processable Thermoelectric Materials.” Angewandte Chemie International Edition, vol. 57, no. 52, Wiley, 2018, pp. 17063–68, doi:10.1002/anie.201809847.","apa":"Zhang, Y., Liu, Y., Lim, K. H., Xing, C., Li, M., Zhang, T., … Cabot, A. (2018). Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201809847"},"author":[{"last_name":"Zhang","full_name":"Zhang, Yu","first_name":"Yu"},{"first_name":"Yu","full_name":"Liu, Yu","last_name":"Liu"},{"last_name":"Lim","first_name":"Khak Ho","full_name":"Lim, Khak Ho"},{"full_name":"Xing, Congcong","first_name":"Congcong","last_name":"Xing"},{"last_name":"Li","first_name":"Mengyao","full_name":"Li, Mengyao"},{"last_name":"Zhang","full_name":"Zhang, Ting","first_name":"Ting"},{"first_name":"Pengyi","full_name":"Tang, Pengyi","last_name":"Tang"},{"last_name":"Arbiol","full_name":"Arbiol, Jordi","first_name":"Jordi"},{"first_name":"Jordi","full_name":"Llorca, Jordi","last_name":"Llorca"},{"first_name":"Ka Ming","full_name":"Ng, Ka Ming","last_name":"Ng"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Ibáñez"},{"full_name":"Guardia, Pablo","first_name":"Pablo","last_name":"Guardia"},{"first_name":"Mirko","full_name":"Prato, Mirko","last_name":"Prato"},{"first_name":"Doris","full_name":"Cadavid, Doris","last_name":"Cadavid"},{"last_name":"Cabot","full_name":"Cabot, Andreu","first_name":"Andreu"}],"language":[{"iso":"eng"}],"oa":1,"page":"17063-17068","publisher":"Wiley","publication_identifier":{"issn":["1433-7851"]},"volume":57,"day":"21","month":"12","isi":1,"status":"public","title":"Tin diselenide molecular precursor for solution-processable thermoelectric materials","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000454575500020"]},"department":[{"_id":"MaIb"}],"_id":"5982","abstract":[{"lang":"eng","text":"In the present work, we detail a fast and simple solution-based method to synthesize hexagonal SnSe2 nanoplates (NPLs) and their use to produce crystallographically textured SnSe2 nanomaterials. We also demonstrate that the same strategy can be used to produce orthorhombic SnSe nanostructures and nanomaterials. NPLs are grown through a screw dislocation-driven mechanism. This mechanism typically results in pyramidal structures, but we demonstrate here that the growth from multiple dislocations results in flower-like structures. Crystallographically textured SnSe2 bulk nanomaterials obtained from the hot pressing of these SnSe2 structures display highly anisotropic charge and heat transport properties and thermoelectric (TE) figures of merit limited by relatively low electrical conductivities. To improve this parameter, SnSe2 NPLs are blended here with metal nanoparticles. The electrical conductivities of the blends are significantly improved with respect to bare SnSe2 NPLs, what translates into a three-fold increase of the TE Figure of merit, reaching unprecedented ZT values up to 0.65."}],"oa_version":"Submitted Version","publication":"Angewandte Chemie International Edition","date_published":"2018-12-21T00:00:00Z","intvolume":" 57","quality_controlled":"1","date_updated":"2023-09-19T14:28:31Z","year":"2018","article_type":"original","publication_status":"published","date_created":"2019-02-14T10:23:27Z","fulldoi":"https://doi.org/10.1002/anie.201809847","doi":"10.1002/anie.201809847","article_processing_charge":"No","scopus_import":"1"},{"intvolume":" 98","date_updated":"2025-04-14T07:26:59Z","quality_controlled":"1","publication":"Physical Review B","date_published":"2018-12-12T00:00:00Z","doi":"10.1103/physrevb.98.224506","fulldoi":"https://doi.org/10.1103/physrevb.98.224506","article_processing_charge":"No","scopus_import":"1","year":"2018","date_created":"2019-02-14T10:37:09Z","publication_status":"published","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Theory of the rotating polaron: Spectrum and self-localization","isi":1,"status":"public","day":"12","month":"12","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"department":[{"_id":"MiLe"},{"_id":"RoSe"}],"oa_version":"Preprint","_id":"5983","abstract":[{"text":"We study a quantum impurity possessing both translational and internal rotational degrees of freedom interacting with a bosonic bath. Such a system corresponds to a “rotating polaron,” which can be used to model, e.g., a rotating molecule immersed in an ultracold Bose gas or superfluid helium. We derive the Hamiltonian of the rotating polaron and study its spectrum in the weak- and strong-coupling regimes using a combination of variational, diagrammatic, and mean-field approaches. We reveal how the coupling between linear and angular momenta affects stable quasiparticle states, and demonstrate that internal rotation leads to an enhanced self-localization in the translational degrees of freedom.","lang":"eng"}],"ec_funded":1,"external_id":{"isi":["000452992700008"],"arxiv":["1809.01204"]},"publisher":"American Physical Society","language":[{"iso":"eng"}],"oa":1,"arxiv":1,"publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"volume":98,"type":"journal_article","issue":"22","main_file_link":[{"url":"https://arxiv.org/abs/1809.01204","open_access":"1"}],"article_number":"224506","citation":{"ama":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. 2018;98(22). doi:10.1103/physrevb.98.224506","ieee":"E. Yakaboylu, B. Midya, A. Deuchert, N. K. Leopold, and M. Lemeshko, “Theory of the rotating polaron: Spectrum and self-localization,” Physical Review B, vol. 98, no. 22. American Physical Society, 2018.","short":"E. Yakaboylu, B. Midya, A. Deuchert, N.K. Leopold, M. Lemeshko, Physical Review B 98 (2018).","ista":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. 2018. Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. 98(22), 224506.","mla":"Yakaboylu, Enderalp, et al. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” Physical Review B, vol. 98, no. 22, 224506, American Physical Society, 2018, doi:10.1103/physrevb.98.224506.","apa":"Yakaboylu, E., Midya, B., Deuchert, A., Leopold, N. K., & Lemeshko, M. (2018). Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. American Physical Society. https://doi.org/10.1103/physrevb.98.224506","chicago":"Yakaboylu, Enderalp, Bikashkali Midya, Andreas Deuchert, Nikolai K Leopold, and Mikhail Lemeshko. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/physrevb.98.224506."},"author":[{"last_name":"Yakaboylu","first_name":"Enderalp","orcid":"0000-0001-5973-0874","full_name":"Yakaboylu, Enderalp","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Midya","id":"456187FC-F248-11E8-B48F-1D18A9856A87","full_name":"Midya, Bikashkali","first_name":"Bikashkali"},{"id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3146-6746","full_name":"Deuchert, Andreas","first_name":"Andreas","last_name":"Deuchert"},{"last_name":"Leopold","first_name":"Nikolai K","full_name":"Leopold, Nikolai K","orcid":"0000-0002-0495-6822","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko"}]}]