[{"day":"06","volume":32,"oa_version":"Preprint","ec_funded":1,"external_id":{"arxiv":["1604.00960"],"isi":["000450810500036"]},"quality_controlled":"1","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://arxiv.org/abs/1604.00960","open_access":"1"}],"abstract":[{"lang":"eng","text":"Inside a two-dimensional region (``cake""), there are m nonoverlapping tiles of a certain kind (``toppings""). We want to expand the toppings while keeping them nonoverlapping, and possibly add some blank pieces of the same ``certain kind,"" such that the entire cake is covered. How many blanks must we add? We study this question in several cases: (1) The cake and toppings are general polygons. (2) The cake and toppings are convex figures. (3) The cake and toppings are axis-parallel rectangles. (4) The cake is an axis-parallel rectilinear polygon and the toppings are axis-parallel rectangles. In all four cases, we provide tight bounds on the number of blanks."}],"year":"2018","date_published":"2018-09-06T00:00:00Z","citation":{"chicago":"Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal Arrangements.” SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics , 2018. https://doi.org/10.1137/16M110407X.","ama":"Akopyan A, Segal Halevi E. Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics. 2018;32(3):2242-2257. doi:10.1137/16M110407X","apa":"Akopyan, A., & Segal Halevi, E. (2018). Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/16M110407X","short":"A. Akopyan, E. Segal Halevi, SIAM Journal on Discrete Mathematics 32 (2018) 2242–2257.","mla":"Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal Arrangements.” SIAM Journal on Discrete Mathematics, vol. 32, no. 3, Society for Industrial and Applied Mathematics , 2018, pp. 2242–57, doi:10.1137/16M110407X.","ieee":"A. Akopyan and E. Segal Halevi, “Counting blanks in polygonal arrangements,” SIAM Journal on Discrete Mathematics, vol. 32, no. 3. Society for Industrial and Applied Mathematics , pp. 2242–2257, 2018.","ista":"Akopyan A, Segal Halevi E. 2018. Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics. 32(3), 2242–2257."},"publication_status":"published","article_processing_charge":"No","publisher":"Society for Industrial and Applied Mathematics ","doi":"10.1137/16M110407X","date_updated":"2025-04-15T06:50:24Z","month":"09","department":[{"_id":"HeEd"}],"title":"Counting blanks in polygonal arrangements","isi":1,"scopus_import":"1","date_created":"2018-12-11T11:44:24Z","status":"public","publication":"SIAM Journal on Discrete Mathematics","language":[{"iso":"eng"}],"intvolume":" 32","page":"2242 - 2257","publist_id":"7996","oa":1,"_id":"58","arxiv":1,"issue":"3","author":[{"orcid":"0000-0002-2548-617X","first_name":"Arseniy","full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan"},{"last_name":"Segal Halevi","full_name":"Segal Halevi, Erel","first_name":"Erel"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"journal_article"},{"_id":"5858","oa":1,"type":"journal_article","author":[{"first_name":"Sabrina","full_name":"Hross, Sabrina","last_name":"Hross"},{"first_name":"Fabian J.","last_name":"Theis","full_name":"Theis, Fabian J."},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179"},{"first_name":"Jan","last_name":"Hasenauer","full_name":"Hasenauer, Jan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:47:13Z","issue":"149","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"Journal of the Royal Society Interface","date_created":"2019-01-20T22:59:18Z","scopus_import":"1","status":"public","intvolume":" 15","file":[{"date_created":"2019-02-05T14:46:44Z","checksum":"56eb4308a15b7190bff938fab1f780e8","access_level":"open_access","file_size":1464288,"relation":"main_file","file_name":"2018_Interface_Hross.pdf","date_updated":"2020-07-14T12:47:13Z","content_type":"application/pdf","creator":"dernst","file_id":"5925"}],"ddc":["570"],"publication_status":"published","doi":"10.1098/rsif.2018.0600","publisher":"Royal Society Publishing","article_processing_charge":"No","publication_identifier":{"issn":["1742-5689"]},"citation":{"ista":"Hross S, Theis FJ, Sixt MK, Hasenauer J. 2018. Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data. Journal of the Royal Society Interface. 15(149), 20180600.","ieee":"S. Hross, F. J. Theis, M. K. Sixt, and J. Hasenauer, “Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data,” Journal of the Royal Society Interface, vol. 15, no. 149. Royal Society Publishing, 2018.","mla":"Hross, Sabrina, et al. “Mechanistic Description of Spatial Processes Using Integrative Modelling of Noise-Corrupted Imaging Data.” Journal of the Royal Society Interface, vol. 15, no. 149, 20180600, Royal Society Publishing, 2018, doi:10.1098/rsif.2018.0600.","short":"S. Hross, F.J. Theis, M.K. Sixt, J. Hasenauer, Journal of the Royal Society Interface 15 (2018).","apa":"Hross, S., Theis, F. J., Sixt, M. K., & Hasenauer, J. (2018). Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data. Journal of the Royal Society Interface. Royal Society Publishing. https://doi.org/10.1098/rsif.2018.0600","ama":"Hross S, Theis FJ, Sixt MK, Hasenauer J. Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data. Journal of the Royal Society Interface. 2018;15(149). doi:10.1098/rsif.2018.0600","chicago":"Hross, Sabrina, Fabian J. Theis, Michael K Sixt, and Jan Hasenauer. “Mechanistic Description of Spatial Processes Using Integrative Modelling of Noise-Corrupted Imaging Data.” Journal of the Royal Society Interface. Royal Society Publishing, 2018. https://doi.org/10.1098/rsif.2018.0600."},"date_published":"2018-12-05T00:00:00Z","year":"2018","title":"Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data","isi":1,"article_number":"20180600","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"month":"12","department":[{"_id":"MiSi"}],"date_updated":"2025-07-10T11:53:04Z","quality_controlled":"1","external_id":{"isi":["000456783800011"]},"oa_version":"Published Version","day":"05","volume":15,"abstract":[{"text":"Spatial patterns are ubiquitous on the subcellular, cellular and tissue level, and can be studied using imaging techniques such as light and fluorescence microscopy. Imaging data provide quantitative information about biological systems; however, mechanisms causing spatial patterning often remain elusive. In recent years, spatio-temporal mathematical modelling has helped to overcome this problem. Yet, outliers and structured noise limit modelling of whole imaging data, and models often consider spatial summary statistics. Here, we introduce an integrated data-driven modelling approach that can cope with measurement artefacts and whole imaging data. Our approach combines mechanistic models of the biological processes with robust statistical models of the measurement process. The parameters of the integrated model are calibrated using a maximum-likelihood approach. We used this integrated modelling approach to study in vivo gradients of the chemokine (C-C motif) ligand 21 (CCL21). CCL21 gradients guide dendritic cells and are important in the adaptive immune response. Using artificial data, we verified that the integrated modelling approach provides reliable parameter estimates in the presence of measurement noise and that bias and variance of these estimates are reduced compared to conventional approaches. The application to experimental data allowed the parametrization and subsequent refinement of the model using additional mechanisms. Among other results, model-based hypothesis testing predicted lymphatic vessel-dependent concentration of heparan sulfate, the binding partner of CCL21. The selected model provided an accurate description of the experimental data and was partially validated using published data. Our findings demonstrate that integrated statistical modelling of whole imaging data is computationally feasible and can provide novel biological insights.","lang":"eng"}]},{"article_processing_charge":"No","publisher":"The Royal Society","publication_identifier":{"issn":["2054-5703"]},"doi":"10.1098/rsos.181286","publication_status":"published","year":"2018","date_published":"2018-12-12T00:00:00Z","citation":{"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.","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","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","short":"B. Corominas-Murtra, M.S. Fibla, S. Valverde, R. Solé, Royal Society Open Science 5 (2018).","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.","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.","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."},"article_number":"181286","isi":1,"title":"Chromatic transitions in the emergence of syntax networks","date_updated":"2023-10-18T06:41:12Z","month":"12","department":[{"_id":"EdHa"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"quality_controlled":"1","external_id":{"isi":["000456566500027"],"pmid":["30662738"]},"volume":5,"day":"12","oa_version":"Published Version","article_type":"original","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","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by the James McDonnell Foundation (B.C-M., S.V. and R.S.)","author":[{"first_name":"Bernat","orcid":"0000-0001-9806-5643","last_name":"Corominas-Murtra","full_name":"Corominas-Murtra, Bernat","id":"43BE2298-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martí Sànchez","full_name":"Fibla, Martí Sànchez","last_name":"Fibla"},{"first_name":"Sergi","last_name":"Valverde","full_name":"Valverde, Sergi"},{"last_name":"Solé","full_name":"Solé, Ricard","first_name":"Ricard"}],"type":"journal_article","issue":"12","file_date_updated":"2020-07-14T12:47:13Z","publication":"Royal Society Open Science","language":[{"iso":"eng"}],"has_accepted_license":"1","date_created":"2019-01-20T22:59:18Z","status":"public","scopus_import":"1","pmid":1,"intvolume":" 5","ddc":["570"],"file":[{"file_size":646732,"relation":"main_file","access_level":"open_access","checksum":"9664d4417f6b792242e31eea77ce9501","date_created":"2019-02-05T14:38:09Z","creator":"dernst","file_id":"5924","content_type":"application/pdf","file_name":"2018_RoyalSocOS_Corominas.pdf","date_updated":"2020-07-14T12:47:13Z"}]},{"arxiv":1,"_id":"5860","oa":1,"author":[{"full_name":"Corominas-Murtra, Bernat","id":"43BE2298-F248-11E8-B48F-1D18A9856A87","last_name":"Corominas-Murtra","first_name":"Bernat","orcid":"0000-0001-9806-5643"},{"last_name":"Seoane","full_name":"Seoane, Luís F.","first_name":"Luís F."},{"last_name":"Solé","full_name":"Solé, Ricard","first_name":"Ricard"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","issue":"149","publication":"Journal of the Royal Society Interface","language":[{"iso":"eng"}],"scopus_import":"1","status":"public","date_created":"2019-01-20T22:59:19Z","intvolume":" 15","publication_identifier":{"issn":["1742-5689"]},"article_processing_charge":"No","publisher":"Royal Society Publishing","doi":"10.1098/rsif.2018.0395","publication_status":"published","date_published":"2018-12-12T00:00:00Z","year":"2018","citation":{"mla":"Corominas-Murtra, Bernat, et al. “Zipf’s Law, Unbounded Complexity and Open-Ended Evolution.” Journal of the Royal Society Interface, vol. 15, no. 149, 20180395, Royal Society Publishing, 2018, doi:10.1098/rsif.2018.0395.","ieee":"B. Corominas-Murtra, L. F. Seoane, and R. Solé, “Zipf’s Law, unbounded complexity and open-ended evolution,” Journal of the Royal Society Interface, vol. 15, no. 149. Royal Society Publishing, 2018.","ista":"Corominas-Murtra B, Seoane LF, Solé R. 2018. Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. 15(149), 20180395.","chicago":"Corominas-Murtra, Bernat, Luís F. Seoane, and Ricard Solé. “Zipf’s Law, Unbounded Complexity and Open-Ended Evolution.” Journal of the Royal Society Interface. Royal Society Publishing, 2018. https://doi.org/10.1098/rsif.2018.0395.","ama":"Corominas-Murtra B, Seoane LF, Solé R. Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. 2018;15(149). doi:10.1098/rsif.2018.0395","apa":"Corominas-Murtra, B., Seoane, L. F., & Solé, R. (2018). Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. Royal Society Publishing. https://doi.org/10.1098/rsif.2018.0395","short":"B. Corominas-Murtra, L.F. Seoane, R. Solé, Journal of the Royal Society Interface 15 (2018)."},"article_number":"20180395","isi":1,"title":"Zipf's Law, unbounded complexity and open-ended evolution","date_updated":"2025-07-10T11:53:04Z","department":[{"_id":"EdHa"}],"month":"12","quality_controlled":"1","external_id":{"arxiv":["1612.01605"],"isi":["000456783800002"]},"volume":15,"oa_version":"Preprint","day":"12","abstract":[{"text":"A major problem for evolutionary theory is understanding the so-called open-ended nature of evolutionary change, from its definition to its origins. Open-ended evolution (OEE) refers to the unbounded increase in complexity that seems to characterize evolution on multiple scales. This property seems to be a characteristic feature of biological and technological evolution and is strongly tied to the generative potential associated with combinatorics, which allows the system to grow and expand their available state spaces. Interestingly, many complex systems presumably displaying OEE, from language to proteins, share a common statistical property: the presence of Zipf's Law. Given an inventory of basic items (such as words or protein domains) required to build more complex structures (sentences or proteins) Zipf's Law tells us that most of these elements are rare whereas a few of them are extremely common. Using algorithmic information theory, in this paper we provide a fundamental definition for open-endedness, which can be understood as postulates. Its statistical counterpart, based on standard Shannon information theory, has the structure of a variational problem which is shown to lead to Zipf's Law as the expected consequence of an evolutionary process displaying OEE. We further explore the problem of information conservation through an OEE process and we conclude that statistical information (standard Shannon information) is not conserved, resulting in the paradoxical situation in which the increase of information content has the effect of erasing itself. We prove that this paradox is solved if we consider non-statistical forms of information. This last result implies that standard information theory may not be a suitable theoretical framework to explore the persistence and increase of the information content in OEE systems.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1612.01605","open_access":"1"}]},{"oa":1,"_id":"5861","file_date_updated":"2020-07-14T12:47:13Z","corr_author":"1","type":"journal_article","author":[{"first_name":"Jonna H","orcid":"0000-0002-7698-3061","id":"2CC12E8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alanko, Jonna H","last_name":"Alanko"},{"orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","scopus_import":"1","date_created":"2019-01-20T22:59:19Z","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"eLife","file":[{"file_id":"5973","creator":"dernst","content_type":"application/pdf","date_updated":"2020-07-14T12:47:13Z","file_name":"2018_eLife_Alanko.pdf","relation":"main_file","file_size":358141,"access_level":"open_access","checksum":"f1c7ec2a809408d763c4b529a98f9a3b","date_created":"2019-02-13T10:52:11Z"}],"ddc":["570"],"intvolume":" 7","citation":{"apa":"Alanko, J. H., & Sixt, M. K. (2018). The cell sets the tone. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.37888","short":"J.H. Alanko, M.K. Sixt, ELife 7 (2018).","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.","ama":"Alanko JH, Sixt MK. The cell sets the tone. eLife. 2018;7. doi:10.7554/eLife.37888","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.","ieee":"J. H. Alanko and M. K. Sixt, “The cell sets the tone,” eLife, vol. 7. eLife Sciences Publications, 2018."},"year":"2018","date_published":"2018-06-06T00:00:00Z","publication_status":"published","doi":"10.7554/eLife.37888","article_processing_charge":"No","publisher":"eLife Sciences Publications","publication_identifier":{"issn":["2050-084X"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"MiSi"}],"month":"06","date_updated":"2025-07-10T11:53:05Z","title":"The cell sets the tone","article_number":"e37888","isi":1,"volume":7,"oa_version":"Published Version","day":"06","quality_controlled":"1","external_id":{"isi":["000434375000001"]},"abstract":[{"lang":"eng","text":"In zebrafish larvae, it is the cell type that determines how the cell responds to a chemokine signal."}],"article_type":"original"},{"external_id":{"isi":["000441266700006"],"pmid":["30089840"]},"quality_controlled":"1","day":"07","oa_version":"Published Version","volume":50,"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"}],"publication_status":"published","publication_identifier":{"issn":["2092-6413"]},"publisher":"Springer Nature","article_processing_charge":"No","doi":"10.1038/s12276-018-0129-7","date_published":"2018-08-07T00:00:00Z","year":"2018","citation":{"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","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.","short":"D.-C. Tarlungeanu, G. Novarino, Experimental & Molecular Medicine 50 (2018).","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","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.","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."},"title":"Genomics in neurodevelopmental disorders: an avenue to personalized medicine","article_number":"100","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_updated":"2023-09-11T14:04:41Z","department":[{"_id":"GaNo"}],"month":"08","has_accepted_license":"1","publication":"Experimental & Molecular Medicine","language":[{"iso":"eng"}],"date_created":"2019-01-27T22:59:11Z","scopus_import":"1","status":"public","intvolume":" 50","pmid":1,"file":[{"creator":"dernst","file_id":"5893","content_type":"application/pdf","file_name":"2018_EMM_Tarlungeanu.pdf","date_updated":"2020-07-14T12:47:13Z","relation":"main_file","file_size":1237482,"access_level":"open_access","checksum":"4498301c8c53097c9a1a8ef990936eb5","date_created":"2019-01-28T15:18:02Z"}],"ddc":["570"],"_id":"5888","oa":1,"author":[{"first_name":"Dora-Clara","full_name":"Tarlungeanu, Dora-Clara","id":"2ABCE612-F248-11E8-B48F-1D18A9856A87","last_name":"Tarlungeanu"},{"orcid":"0000-0002-7673-7178","first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","full_name":"Novarino, Gaia","last_name":"Novarino"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"journal_article","file_date_updated":"2020-07-14T12:47:13Z","issue":"8"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"}],"type":"book_chapter","title":"Graph games and reactive synthesis","date_updated":"2021-01-12T08:05:10Z","department":[{"_id":"KrCh"}],"month":"05","publication_identifier":{"isbn":["978-3-319-10574-1"]},"publisher":"Springer","doi":"10.1007/978-3-319-10575-8_27","_id":"59","publication_status":"published","date_published":"2018-05-19T00:00:00Z","year":"2018","citation":{"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.","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.","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.","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.","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"},"editor":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Edmund M.","full_name":"Clarke, Edmund M.","last_name":"Clarke"},{"full_name":"Veith, Helmut","last_name":"Veith","first_name":"Helmut"},{"first_name":"Roderick","last_name":"Bloem","full_name":"Bloem, Roderick"}],"publist_id":"7995","page":"921 - 962","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."}],"publication":"Handbook of Model Checking","language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2018-12-11T11:44:24Z","status":"public","edition":"1","scopus_import":1,"oa_version":"None","day":"19"},{"file_date_updated":"2020-07-14T12:47:13Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Bakhirkin, Alexey","last_name":"Bakhirkin","first_name":"Alexey"},{"first_name":"Thomas","orcid":"0000-0001-5199-3143","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","last_name":"Ferrere"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Nickovicl","full_name":"Nickovicl, Deian","first_name":"Deian"}],"type":"conference","oa":1,"_id":"5959","ddc":["000"],"file":[{"date_created":"2020-05-14T16:01:29Z","checksum":"234a33ad9055b3458fcdda6af251b33a","access_level":"open_access","file_size":338006,"relation":"main_file","file_name":"2018_EMSOFT_Bakhirkin.pdf","date_updated":"2020-07-14T12:47:13Z","content_type":"application/pdf","creator":"dernst","file_id":"7839"}],"page":"1-10","scopus_import":"1","date_created":"2019-02-13T09:19:28Z","status":"public","publication":"2018 International Conference on Embedded Software","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2025-07-10T11:53:06Z","month":"09","department":[{"_id":"ToHe"}],"isi":1,"title":"Keynote: The first-order logic of signals","date_published":"2018-09-30T00:00:00Z","year":"2018","citation":{"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","short":"A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10.","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","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.","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."},"publisher":"IEEE","article_processing_charge":"No","publication_identifier":{"isbn":["9781538655603"]},"doi":"10.1109/emsoft.2018.8537203","publication_status":"published","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"}],"conference":{"name":"EMSOFT: Embedded Software","end_date":"2018-10-05","location":"Turin, Italy","start_date":"2018-09-30"},"oa_version":"Published Version","day":"30","quality_controlled":"1","external_id":{"isi":["000492828500005"]},"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}]},{"intvolume":" 37","page":"1500-1516","publication":"The International Journal of Robotics Research","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2019-02-13T09:36:20Z","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Simon","full_name":"Rohou, Simon","last_name":"Rohou"},{"last_name":"Franek","id":"473294AE-F248-11E8-B48F-1D18A9856A87","full_name":"Franek, Peter","orcid":"0000-0001-8878-8397","first_name":"Peter"},{"full_name":"Aubry, Clément","last_name":"Aubry","first_name":"Clément"},{"full_name":"Jaulin, Luc","last_name":"Jaulin","first_name":"Luc"}],"type":"journal_article","issue":"12","arxiv":1,"_id":"5960","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.01341"}],"abstract":[{"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.","lang":"eng"}],"external_id":{"arxiv":["1712.01341"],"isi":["000456881100004"]},"quality_controlled":"1","oa_version":"Preprint","volume":37,"day":"24","isi":1,"title":"Proving the existence of loops in robot trajectories","date_updated":"2023-09-19T10:41:59Z","department":[{"_id":"UlWa"}],"month":"10","article_processing_charge":"No","publication_identifier":{"eissn":["1741-3176"],"issn":["0278-3649"]},"publisher":"SAGE Publications","doi":"10.1177/0278364918808367","publication_status":"published","date_published":"2018-10-24T00:00:00Z","year":"2018","citation":{"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.","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.","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.","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.","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","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","short":"S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516."}},{"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"}],"isi":1,"title":"A brief tutorial on distributed and concurrent machine learning","department":[{"_id":"DaAl"}],"month":"07","date_updated":"2025-06-03T11:56:33Z","doi":"10.1145/3212734.3212798","publication_identifier":{"isbn":["9781450357951"]},"publisher":"ACM","article_processing_charge":"No","publication_status":"published","_id":"5961","citation":{"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.","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.","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.","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.","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","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","short":"D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 487–488."},"year":"2018","date_published":"2018-07-27T00:00:00Z","page":"487-488","conference":{"start_date":"2018-07-23","location":"Egham, United Kingdom","name":"PODC: Principles of Distributed Computing","end_date":"2018-07-27"},"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"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","external_id":{"isi":["000458186900063"]},"quality_controlled":"1","status":"public","scopus_import":"1","date_created":"2019-02-13T09:48:55Z","day":"27","oa_version":"None"},{"type":"conference","author":[{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"full_name":"De Sa, Christopher","last_name":"De Sa","first_name":"Christopher"},{"full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","last_name":"Konstantinov","first_name":"Nikola H"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5962","arxiv":1,"oa":1,"page":"169-178","language":[{"iso":"eng"}],"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","scopus_import":"1","status":"public","date_created":"2019-02-13T09:58:58Z","title":"The convergence of stochastic gradient descent in asynchronous shared memory","isi":1,"department":[{"_id":"DaAl"}],"month":"07","date_updated":"2025-06-03T11:56:41Z","publication_status":"published","doi":"10.1145/3212734.3212763","article_processing_charge":"No","publication_identifier":{"isbn":["9781450357951"]},"publisher":"ACM","citation":{"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","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.","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.","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","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.","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."},"year":"2018","date_published":"2018-07-23T00:00:00Z","conference":{"location":"Egham, United Kingdom","start_date":"2018-07-23","end_date":"2018-07-27","name":"PODC: Principles of Distributed Computing"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.08841"}],"abstract":[{"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.","lang":"eng"}],"external_id":{"arxiv":["1803.08841"],"isi":["000458186900022"]},"quality_controlled":"1","oa_version":"Preprint","day":"23"},{"publication_identifier":{"isbn":["9781450357951"]},"article_processing_charge":"No","publisher":"ACM","doi":"10.1145/3212734.3212756","publication_status":"published","date_published":"2018-07-23T00:00:00Z","year":"2018","citation":{"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.","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.","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.","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.","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","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."},"isi":1,"title":"Relaxed schedulers can efficiently parallelize iterative algorithms","date_updated":"2025-06-03T11:56:49Z","department":[{"_id":"DaAl"}],"month":"07","external_id":{"isi":["000458186900048"],"arxiv":["1808.04155"]},"quality_controlled":"1","day":"23","oa_version":"Preprint","conference":{"start_date":"2018-07-23","location":"Egham, United Kingdom","end_date":"2018-07-27","name":"PODC: Principles of Distributed Computing"},"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."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.04155"}],"arxiv":1,"_id":"5963","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A","last_name":"Brown"},{"last_name":"Kopinsky","full_name":"Kopinsky, Justin","first_name":"Justin"},{"full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","first_name":"Giorgi"}],"type":"conference","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2019-02-13T10:03:25Z","status":"public","page":"377-386"},{"isi":1,"title":"Brief Announcement: Performance prediction for coarse-grained locking","date_updated":"2025-06-03T11:58:00Z","month":"07","department":[{"_id":"DaAl"}],"publisher":"ACM","article_processing_charge":"No","publication_identifier":{"isbn":["9781450357951"]},"doi":"10.1145/3212734.3212785","publication_status":"published","year":"2018","date_published":"2018-07-23T00:00:00Z","citation":{"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.","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.","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.","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","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.","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"},"conference":{"start_date":"2018-07-23","location":"Egham, United Kingdom","name":"PODC: Principles of Distributed Computing","end_date":"2018-07-27"},"main_file_link":[{"url":"https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1","open_access":"1"}],"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."}],"quality_controlled":"1","external_id":{"isi":["000458186900052"]},"oa_version":"Submitted Version","day":"23","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Vitaly","full_name":"Aksenov, Vitaly","last_name":"Aksenov"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"},{"first_name":"Petr","full_name":"Kuznetsov, Petr","last_name":"Kuznetsov"}],"type":"conference","_id":"5964","oa":1,"page":"411-413","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","language":[{"iso":"eng"}],"date_created":"2019-02-13T10:08:19Z","status":"public","scopus_import":"1"},{"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"},{"first_name":"Syed Kamran","full_name":"Haider, Syed Kamran","last_name":"Haider"},{"first_name":"Raphael","last_name":"Kübler","full_name":"Kübler, Raphael"},{"first_name":"Giorgi","last_name":"Nadiradze","full_name":"Nadiradze, Giorgi"}],"arxiv":1,"_id":"5966","oa":1,"page":"383-392","language":[{"iso":"eng"}],"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","scopus_import":"1","date_created":"2019-02-13T10:26:07Z","status":"public","isi":1,"title":"The transactional conflict problem","department":[{"_id":"DaAl"}],"month":"07","date_updated":"2025-06-03T11:58:22Z","doi":"10.1145/3210377.3210406","publication_identifier":{"isbn":["9781450357999"]},"article_processing_charge":"No","publisher":"ACM","publication_status":"published","citation":{"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","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.","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.","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","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.","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.","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."},"date_published":"2018-07-16T00:00:00Z","year":"2018","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","end_date":"2018-07-18","location":"Vienna, Austria","start_date":"2018-07-16"},"abstract":[{"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.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.00947"}],"quality_controlled":"1","external_id":{"isi":["000545269600046"],"arxiv":["1804.00947"]},"day":"16","oa_version":"Preprint"},{"file":[{"content_type":"application/pdf","file_name":"2018_EC18_Hansen.pdf","date_updated":"2020-07-14T12:47:14Z","file_id":"7054","creator":"dernst","checksum":"bb52683e349cfd864f4769a8f38f2798","date_created":"2019-11-19T08:24:24Z","relation":"main_file","file_size":302539,"access_level":"open_access"}],"ddc":["000"],"page":"149-150","date_created":"2019-02-13T10:31:41Z","status":"public","scopus_import":"1","has_accepted_license":"1","publication":"Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:47:14Z","author":[{"last_name":"Hansen","full_name":"Hansen, Kristoffer Arnsfelt","first_name":"Kristoffer Arnsfelt"},{"orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Neyman, Abraham","last_name":"Neyman","first_name":"Abraham"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","oa":1,"_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"}],"conference":{"name":"EC: Conference on Economics and Computation","end_date":"2018-06-22","location":"Ithaca, NY, United States","start_date":"2018-06-18"},"day":"18","oa_version":"Submitted Version","external_id":{"isi":["000492755100020"]},"quality_controlled":"1","date_updated":"2025-05-14T11:24:35Z","department":[{"_id":"KrCh"}],"month":"06","title":"The Big Match with a clock and a bit of memory","isi":1,"year":"2018","date_published":"2018-06-18T00:00:00Z","citation":{"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","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.","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.","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","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.","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.","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."},"publication_status":"published","publication_identifier":{"isbn":["9781450358293"]},"article_processing_charge":"No","publisher":"ACM","doi":"10.1145/3219166.3219198"},{"type":"journal_article","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603"},{"first_name":"Peter","last_name":"Mühlbacher","full_name":"Mühlbacher, Peter"}],"arxiv":1,"_id":"5971","oa":1,"language":[{"iso":"eng"}],"publication":"Random matrices: Theory and applications","date_created":"2019-02-13T10:40:54Z","status":"public","scopus_import":"1","article_number":"1950009","isi":1,"title":"Bounds on the norm of Wigner-type random matrices","month":"09","department":[{"_id":"LaEr"}],"date_updated":"2025-04-15T08:05:02Z","doi":"10.1142/s2010326319500096","publication_identifier":{"eissn":["2010-3271"],"issn":["2010-3263"]},"publisher":"World Scientific Publishing","article_processing_charge":"No","publication_status":"published","citation":{"ama":"Erdös L, Mühlbacher P. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications. 2018. doi:10.1142/s2010326319500096","chicago":"Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” Random Matrices: Theory and Applications. World Scientific Publishing, 2018. https://doi.org/10.1142/s2010326319500096.","short":"L. Erdös, P. Mühlbacher, Random Matrices: Theory and Applications (2018).","apa":"Erdös, L., & Mühlbacher, P. (2018). Bounds on the norm of Wigner-type random matrices. Random Matrices: Theory and Applications. World Scientific Publishing. https://doi.org/10.1142/s2010326319500096","ieee":"L. Erdös and P. Mühlbacher, “Bounds on the norm of Wigner-type random matrices,” Random matrices: Theory and applications. World Scientific Publishing, 2018.","mla":"Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” Random Matrices: Theory and Applications, 1950009, World Scientific Publishing, 2018, doi:10.1142/s2010326319500096.","ista":"Erdös L, Mühlbacher P. 2018. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications., 1950009."},"date_published":"2018-09-26T00:00:00Z","year":"2018","abstract":[{"text":"We consider a Wigner-type ensemble, i.e. large hermitian N×N random matrices H=H∗ with centered independent entries and with a general matrix of variances Sxy=𝔼∣∣Hxy∣∣2. The norm of H is asymptotically given by the maximum of the support of the self-consistent density of states. We establish a bound on this maximum in terms of norms of powers of S that substantially improves the earlier bound 2∥S∥1/2∞ given in [O. Ajanki, L. Erdős and T. Krüger, Universality for general Wigner-type matrices, Prob. Theor. Rel. Fields169 (2017) 667–727]. The key element of the proof is an effective Markov chain approximation for the contributions of the weighted Dyck paths appearing in the iterative solution of the corresponding Dyson equation.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1802.05175"}],"project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"quality_controlled":"1","external_id":{"arxiv":["1802.05175"],"isi":["000477677200002"]},"ec_funded":1,"day":"26","oa_version":"Preprint"},{"main_file_link":[{"url":"https://arxiv.org/abs/1506.08547","open_access":"1"}],"abstract":[{"lang":"eng","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."}],"ec_funded":1,"oa_version":"Preprint","day":"08","volume":47,"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"external_id":{"isi":["000453785100001"],"arxiv":["1506.08547"]},"quality_controlled":"1","department":[{"_id":"VlKo"}],"month":"11","date_updated":"2025-09-22T09:44:20Z","isi":1,"title":"Commutativity in the algorithmic Lovász local lemma","citation":{"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","short":"V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.","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.","ama":"Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 2018;47(6):2029-2056. doi: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.","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."},"date_published":"2018-11-08T00:00:00Z","year":"2018","doi":"10.1137/16m1093306","article_processing_charge":"No","publisher":"Society for Industrial and Applied Mathematics","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"publication_status":"published","intvolume":" 47","page":"2029-2056","date_created":"2019-02-13T12:59:33Z","scopus_import":"1","status":"public","language":[{"iso":"eng"}],"publication":"SIAM Journal on Computing","issue":"6","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir"}],"oa":1,"related_material":{"record":[{"id":"1193","status":"public","relation":"earlier_version"}]},"arxiv":1,"_id":"5975"},{"file_date_updated":"2020-07-14T12:47:14Z","issue":"6","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Malomo, Luigi","last_name":"Malomo","first_name":"Luigi"},{"first_name":"Jesus","last_name":"Perez Rodriguez","full_name":"Perez Rodriguez, Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Emmanuel","full_name":"Iarussi, Emmanuel","id":"33F19F16-F248-11E8-B48F-1D18A9856A87","last_name":"Iarussi"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"},{"first_name":"Eder","full_name":"Miguel, Eder","last_name":"Miguel"},{"last_name":"Cignoni","full_name":"Cignoni, Paolo","first_name":"Paolo"},{"first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel"}],"oa":1,"_id":"5976","file":[{"date_created":"2019-09-23T12:48:52Z","checksum":"d0529a41c78b37ab8840685579fb33b4","access_level":"open_access","file_size":100109811,"relation":"main_file","file_name":"flexmaps_author_version.pdf","date_updated":"2020-07-14T12:47:14Z","content_type":"application/pdf","file_id":"6901","creator":"bbickel"}],"ddc":["000"],"intvolume":" 37","status":"public","date_created":"2019-02-13T13:12:53Z","scopus_import":"1","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"ACM Transactions on Graphics","month":"11","department":[{"_id":"BeBi"}],"date_updated":"2025-03-31T15:59:13Z","title":"FlexMaps: Computational design of flat flexible shells for shaping 3D objects","isi":1,"article_number":"241","citation":{"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","short":"L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni, B. Bickel, ACM Transactions on Graphics 37 (2018).","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.","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","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.","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."},"year":"2018","date_published":"2018-11-01T00:00:00Z","publication_status":"published","doi":"10.1145/3272127.3275076","article_processing_charge":"No","publication_identifier":{"issn":["0730-0301"]},"publisher":"Association for Computing Machinery","abstract":[{"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.","lang":"eng"}],"article_type":"original","volume":37,"day":"01","oa_version":"Published Version","ec_funded":1,"pubrep_id":"1068","project":[{"call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"},{"grant_number":"645599","name":"Soft-bodied intelligence for Manipulation","call_identifier":"H2020","_id":"25082902-B435-11E9-9278-68D0E5697425"},{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000455953100064"]},"quality_controlled":"1"},{"page":"6581-6588","conference":{"end_date":"2018-02-07","name":"AAAI: Conference on Artificial Intelligence","location":"New Orleans, LU, United States","start_date":"2018-02-02"},"abstract":[{"lang":"eng","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."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2004.06370"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 32st AAAI Conference on Artificial Intelligence","external_id":{"isi":["000485488906082"],"arxiv":["2004.06370"]},"quality_controlled":"1","status":"public","scopus_import":"1","date_created":"2019-02-13T13:32:48Z","day":"01","oa_version":"Preprint","type":"conference","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"author":[{"first_name":"Stefan","last_name":"Haller","full_name":"Haller, Stefan"},{"full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","first_name":"Paul"},{"full_name":"Savchynskyy, Bogdan","last_name":"Savchynskyy","first_name":"Bogdan"}],"title":"Exact MAP-inference by confining combinatorial search with LP relaxation","month":"02","department":[{"_id":"VlKo"}],"date_updated":"2023-09-19T14:26:52Z","arxiv":1,"publisher":"AAAI Press","article_processing_charge":"No","publication_status":"published","_id":"5978","citation":{"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.","mla":"Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–88.","ieee":"S. Haller, P. Swoboda, and B. Savchynskyy, “Exact MAP-inference by confining combinatorial search with LP relaxation,” in Proceedings of the 32st AAAI Conference on Artificial Intelligence, New Orleans, LU, United States, 2018, pp. 6581–6588.","apa":"Haller, S., Swoboda, P., & Savchynskyy, B. (2018). Exact MAP-inference by confining combinatorial search with LP relaxation. In Proceedings of the 32st AAAI Conference on Artificial Intelligence (pp. 6581–6588). New Orleans, LU, United States: AAAI Press.","short":"S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588.","chicago":"Haller, Stefan, Paul Swoboda, and Bogdan Savchynskyy. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” In Proceedings of the 32st AAAI Conference on Artificial Intelligence, 6581–88. AAAI Press, 2018.","ama":"Haller S, Swoboda P, Savchynskyy B. Exact MAP-inference by confining combinatorial search with LP relaxation. In: Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI Press; 2018:6581-6588."},"date_published":"2018-02-01T00:00:00Z","oa":1,"year":"2018"},{"date_updated":"2023-09-19T14:27:59Z","month":"02","department":[{"_id":"KrPi"}],"issue":"1","isi":1,"author":[{"first_name":"Sanjit","full_name":"Chatterjee, Sanjit","last_name":"Chatterjee"},{"full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","first_name":"Chethan"},{"full_name":"Kumar, Vikas","last_name":"Kumar","first_name":"Vikas"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"journal_article","title":"Private set-intersection with common set-up","date_published":"2018-02-01T00:00:00Z","year":"2018","citation":{"ama":"Chatterjee S, Kamath Hosdurg C, Kumar V. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 2018;12(1):17-47. doi:10.3934/amc.2018002","chicago":"Chatterjee, Sanjit, Chethan Kamath Hosdurg, and Vikas Kumar. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences. AIMS, 2018. https://doi.org/10.3934/amc.2018002.","short":"S. Chatterjee, C. Kamath Hosdurg, V. Kumar, American Institute of Mathematical Sciences 12 (2018) 17–47.","apa":"Chatterjee, S., Kamath Hosdurg, C., & Kumar, V. (2018). Private set-intersection with common set-up. American Institute of Mathematical Sciences. AIMS. https://doi.org/10.3934/amc.2018002","ieee":"S. Chatterjee, C. Kamath Hosdurg, and V. Kumar, “Private set-intersection with common set-up,” American Institute of Mathematical Sciences, vol. 12, no. 1. AIMS, pp. 17–47, 2018.","mla":"Chatterjee, Sanjit, et al. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences, vol. 12, no. 1, AIMS, 2018, pp. 17–47, doi:10.3934/amc.2018002.","ista":"Chatterjee S, Kamath Hosdurg C, Kumar V. 2018. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 12(1), 17–47."},"article_processing_charge":"No","publisher":"AIMS","doi":"10.3934/amc.2018002","_id":"5980","publication_status":"published","abstract":[{"lang":"eng","text":"The problem of private set-intersection (PSI) has been traditionally treated as an instance of the more general problem of multi-party computation (MPC). Consequently, in order to argue security, or compose these protocols one has to rely on the general theory that was developed for the purpose of MPC. The pursuit of efficient protocols, however, has resulted in designs that exploit properties pertaining to PSI. In almost all practical applications where a PSI protocol is deployed, it is expected to be executed multiple times, possibly on related inputs. In this work we initiate a dedicated study of PSI in the multi-interaction (MI) setting. In this model a server sets up the common system parameters and executes set-intersection multiple times with potentially different clients. We discuss a few attacks that arise when protocols are naïvely composed in this manner and, accordingly, craft security definitions for the MI setting and study their inter-relation. Finally, we suggest a set of protocols that are MI-secure, at the same time almost as efficient as their parent, stand-alone, protocols."}],"intvolume":" 12","page":"17-47","date_created":"2019-02-13T13:49:41Z","scopus_import":"1","status":"public","oa_version":"None","day":"01","volume":12,"publication":"American Institute of Mathematical Sciences","language":[{"iso":"eng"}],"external_id":{"isi":["000430950400002"]},"quality_controlled":"1"}]