[{"title":"Genomics in neurodevelopmental disorders: an avenue to personalized medicine","article_processing_charge":"No","license":"https://creativecommons.org/licenses/by/4.0/","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"}],"external_id":{"pmid":["30089840"],"isi":["000441266700006"]},"publication_status":"published","pmid":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Tarlungeanu","first_name":"Dora-Clara","full_name":"Tarlungeanu, Dora-Clara","id":"2ABCE612-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Novarino","first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia"}],"volume":50,"has_accepted_license":"1","ddc":["570"],"quality_controlled":"1","file":[{"access_level":"open_access","relation":"main_file","checksum":"4498301c8c53097c9a1a8ef990936eb5","file_size":1237482,"date_updated":"2020-07-14T12:47:13Z","file_id":"5893","creator":"dernst","date_created":"2019-01-28T15:18:02Z","file_name":"2018_EMM_Tarlungeanu.pdf","content_type":"application/pdf"}],"issue":"8","doi":"10.1038/s12276-018-0129-7","publication_identifier":{"issn":["2092-6413"]},"publication":"Experimental & Molecular Medicine","year":"2018","date_created":"2019-01-27T22:59:11Z","article_number":"100","month":"08","language":[{"iso":"eng"}],"date_published":"2018-08-07T00:00:00Z","publisher":"Springer Nature","department":[{"_id":"GaNo"}],"date_updated":"2023-09-11T14:04:41Z","isi":1,"oa":1,"file_date_updated":"2020-07-14T12:47:13Z","_id":"5888","scopus_import":"1","intvolume":" 50","oa_version":"Published Version","type":"journal_article","citation":{"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.","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","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.","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.","short":"D.-C. Tarlungeanu, G. Novarino, Experimental & Molecular Medicine 50 (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","ista":"Tarlungeanu D-C, Novarino G. 2018. Genomics in neurodevelopmental disorders: an avenue to personalized medicine. Experimental & Molecular Medicine. 50(8), 100."},"status":"public","day":"07","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)"}},{"status":"public","day":"19","publication":"Handbook of Model Checking","doi":"10.1007/978-3-319-10575-8_27","publication_identifier":{"isbn":["978-3-319-10574-1"]},"date_created":"2018-12-11T11:44:24Z","year":"2018","quality_controlled":"1","citation":{"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.","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","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.","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","ista":"Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962.","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."},"scopus_import":1,"_id":"59","publist_id":"7995","editor":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Clarke, Edmund M.","last_name":"Clarke","first_name":"Edmund M."},{"full_name":"Veith, Helmut","first_name":"Helmut","last_name":"Veith"},{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"}],"type":"book_chapter","oa_version":"None","author":[{"full_name":"Bloem, Roderick","first_name":"Roderick","last_name":"Bloem"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:05:10Z","publisher":"Springer","department":[{"_id":"KrCh"}],"date_published":"2018-05-19T00:00:00Z","title":"Graph games and reactive synthesis","month":"05","language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"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.","lang":"eng"}],"edition":"1","page":"921 - 962"},{"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"citation":{"short":"A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10.","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.","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.","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.","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."},"status":"public","day":"30","oa":1,"file_date_updated":"2020-07-14T12:47:13Z","isi":1,"department":[{"_id":"ToHe"}],"publisher":"IEEE","date_updated":"2025-07-10T11:53:06Z","language":[{"iso":"eng"}],"month":"09","date_published":"2018-09-30T00:00:00Z","type":"conference","oa_version":"Published Version","_id":"5959","scopus_import":"1","file":[{"file_size":338006,"date_updated":"2020-07-14T12:47:13Z","checksum":"234a33ad9055b3458fcdda6af251b33a","relation":"main_file","access_level":"open_access","file_id":"7839","creator":"dernst","file_name":"2018_EMSOFT_Bakhirkin.pdf","content_type":"application/pdf","date_created":"2020-05-14T16:01:29Z"}],"quality_controlled":"1","conference":{"name":"EMSOFT: Embedded Software","start_date":"2018-09-30","location":"Turin, Italy","end_date":"2018-10-05"},"ddc":["000"],"has_accepted_license":"1","year":"2018","date_created":"2019-02-13T09:19:28Z","publication":"2018 International Conference on Embedded Software","publication_identifier":{"isbn":["9781538655603"]},"doi":"10.1109/emsoft.2018.8537203","abstract":[{"lang":"eng","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."}],"external_id":{"isi":["000492828500005"]},"publication_status":"published","page":"1-10","article_processing_charge":"No","title":"Keynote: The first-order logic of signals","author":[{"full_name":"Bakhirkin, Alexey","first_name":"Alexey","last_name":"Bakhirkin"},{"first_name":"Thomas","last_name":"Ferrere","orcid":"0000-0001-5199-3143","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Nickovicl, Deian","first_name":"Deian","last_name":"Nickovicl"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"article_processing_charge":"No","page":"1500-1516","external_id":{"isi":["000456881100004"],"arxiv":["1712.01341"]},"publication_status":"published","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"}],"title":"Proving the existence of loops in robot trajectories","author":[{"full_name":"Rohou, Simon","last_name":"Rohou","first_name":"Simon"},{"orcid":"0000-0001-8878-8397","id":"473294AE-F248-11E8-B48F-1D18A9856A87","full_name":"Franek, Peter","first_name":"Peter","last_name":"Franek"},{"full_name":"Aubry, Clément","last_name":"Aubry","first_name":"Clément"},{"full_name":"Jaulin, Luc","last_name":"Jaulin","first_name":"Luc"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","volume":37,"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1712.01341","open_access":"1"}],"date_created":"2019-02-13T09:36:20Z","year":"2018","doi":"10.1177/0278364918808367","publication_identifier":{"eissn":["1741-3176"],"issn":["0278-3649"]},"issue":"12","publication":"The International Journal of Robotics Research","isi":1,"oa":1,"date_published":"2018-10-24T00:00:00Z","month":"10","language":[{"iso":"eng"}],"date_updated":"2023-09-19T10:41:59Z","department":[{"_id":"UlWa"}],"publisher":"SAGE Publications","arxiv":1,"intvolume":" 37","oa_version":"Preprint","type":"journal_article","scopus_import":"1","_id":"5960","citation":{"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.","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","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.","short":"S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516.","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","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."},"day":"24","status":"public"},{"page":"487-488","article_processing_charge":"No","isi":1,"abstract":[{"lang":"eng","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"}],"external_id":{"isi":["000458186900063"]},"publication_status":"published","month":"07","language":[{"iso":"eng"}],"title":"A brief tutorial on distributed and concurrent machine learning","date_published":"2018-07-27T00:00:00Z","publisher":"ACM","department":[{"_id":"DaAl"}],"date_updated":"2025-06-03T11:56:33Z","oa_version":"None","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","_id":"5961","scopus_import":"1","citation":{"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.","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","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.","short":"D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM, 2018, pp. 487–488.","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","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."},"quality_controlled":"1","conference":{"location":"Egham, United Kingdom","end_date":"2018-07-27","name":"PODC: Principles of Distributed Computing","start_date":"2018-07-23"},"year":"2018","date_created":"2019-02-13T09:48:55Z","doi":"10.1145/3212734.3212798","publication_identifier":{"isbn":["9781450357951"]},"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","status":"public","day":"27"},{"status":"public","day":"23","citation":{"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.","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","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","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."},"_id":"5962","scopus_import":"1","oa_version":"Preprint","type":"conference","month":"07","language":[{"iso":"eng"}],"date_published":"2018-07-23T00:00:00Z","department":[{"_id":"DaAl"}],"publisher":"ACM","arxiv":1,"date_updated":"2025-06-03T11:56:41Z","isi":1,"oa":1,"doi":"10.1145/3212734.3212763","publication_identifier":{"isbn":["9781450357951"]},"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","year":"2018","date_created":"2019-02-13T09:58:58Z","main_file_link":[{"url":"https://arxiv.org/abs/1803.08841","open_access":"1"}],"conference":{"start_date":"2018-07-23","name":"PODC: Principles of Distributed Computing","end_date":"2018-07-27","location":"Egham, United Kingdom"},"quality_controlled":"1","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian"},{"first_name":"Christopher","last_name":"De Sa","full_name":"De Sa, Christopher"},{"last_name":"Konstantinov","first_name":"Nikola H","full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The convergence of stochastic gradient descent in asynchronous shared memory","page":"169-178","article_processing_charge":"No","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."}],"publication_status":"published","external_id":{"isi":["000458186900022"],"arxiv":["1803.08841"]}},{"date_created":"2019-02-13T10:03:25Z","year":"2018","publication_identifier":{"isbn":["9781450357951"]},"doi":"10.1145/3212734.3212756","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.04155"}],"conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2018-07-23","end_date":"2018-07-27","location":"Egham, United Kingdom"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Brown, Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","first_name":"Trevor A","last_name":"Brown"},{"full_name":"Kopinsky, Justin","first_name":"Justin","last_name":"Kopinsky"},{"first_name":"Giorgi","last_name":"Nadiradze","full_name":"Nadiradze, Giorgi"}],"article_processing_charge":"No","page":"377-386","publication_status":"published","external_id":{"isi":["000458186900048"],"arxiv":["1808.04155"]},"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."}],"title":"Relaxed schedulers can efficiently parallelize iterative algorithms","day":"23","status":"public","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.","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.","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","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","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."},"oa_version":"Preprint","type":"conference","scopus_import":"1","_id":"5963","isi":1,"oa":1,"date_published":"2018-07-23T00:00:00Z","month":"07","language":[{"iso":"eng"}],"date_updated":"2025-06-03T11:56:49Z","publisher":"ACM","arxiv":1,"department":[{"_id":"DaAl"}]},{"oa_version":"Submitted Version","type":"conference","scopus_import":"1","_id":"5964","isi":1,"oa":1,"date_published":"2018-07-23T00:00:00Z","month":"07","language":[{"iso":"eng"}],"date_updated":"2025-06-03T11:58:00Z","publisher":"ACM","department":[{"_id":"DaAl"}],"status":"public","day":"23","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.","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.","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","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.","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.","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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Vitaly","last_name":"Aksenov","full_name":"Aksenov, Vitaly"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Kuznetsov, Petr","first_name":"Petr","last_name":"Kuznetsov"}],"article_processing_charge":"No","page":"411-413","external_id":{"isi":["000458186900052"]},"publication_status":"published","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."}],"title":"Brief Announcement: Performance prediction for coarse-grained locking","date_created":"2019-02-13T10:08:19Z","year":"2018","doi":"10.1145/3212734.3212785","publication_identifier":{"isbn":["9781450357951"]},"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1"}],"conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2018-07-23","location":"Egham, United Kingdom","end_date":"2018-07-27"}},{"day":"16","status":"public","citation":{"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.","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","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.","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."},"oa_version":"Preprint","type":"conference","_id":"5965","scopus_import":"1","isi":1,"oa":1,"language":[{"iso":"eng"}],"month":"07","date_published":"2018-07-16T00:00:00Z","arxiv":1,"department":[{"_id":"DaAl"}],"publisher":"ACM","date_updated":"2026-04-08T07:00:45Z","year":"2018","date_created":"2019-02-13T10:17:19Z","publication_identifier":{"isbn":["9781450357999"]},"doi":"10.1145/3210377.3210411","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.01018"}],"conference":{"location":"Vienna, Austria","end_date":"2018-07-18","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","start_date":"2018-07-16"},"author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh"},{"last_name":"Brown","first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A"},{"full_name":"Kopinsky, Justin","last_name":"Kopinsky","first_name":"Justin"},{"full_name":"Li, Jerry Z.","last_name":"Li","first_name":"Jerry Z."},{"last_name":"Nadiradze","first_name":"Giorgi","full_name":"Nadiradze, Giorgi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"dissertation_contains","id":"10429","status":"public"}]},"page":"133-142","article_processing_charge":"No","abstract":[{"lang":"eng","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."}],"publication_status":"published","external_id":{"isi":["000545269600016"],"arxiv":["1804.01018"]},"title":"Distributionally linearizable data structures"},{"conference":{"location":"Vienna, Austria","end_date":"2018-07-18","start_date":"2018-07-16","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.00947"}],"quality_controlled":"1","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","publication_identifier":{"isbn":["9781450357999"]},"doi":"10.1145/3210377.3210406","year":"2018","date_created":"2019-02-13T10:26:07Z","title":"The transactional conflict problem","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."}],"external_id":{"isi":["000545269600046"],"arxiv":["1804.00947"]},"publication_status":"published","page":"383-392","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Haider, Syed Kamran","first_name":"Syed Kamran","last_name":"Haider"},{"full_name":"Kübler, Raphael","first_name":"Raphael","last_name":"Kübler"},{"full_name":"Nadiradze, Giorgi","first_name":"Giorgi","last_name":"Nadiradze"}],"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","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.","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.","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.","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."},"day":"16","status":"public","publisher":"ACM","department":[{"_id":"DaAl"}],"arxiv":1,"date_updated":"2025-06-03T11:58:22Z","month":"07","language":[{"iso":"eng"}],"date_published":"2018-07-16T00:00:00Z","oa":1,"isi":1,"_id":"5966","scopus_import":"1","type":"conference","oa_version":"Preprint"},{"publication_identifier":{"isbn":["9781450358293"]},"doi":"10.1145/3219166.3219198","publication":"Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18","year":"2018","date_created":"2019-02-13T10:31:41Z","has_accepted_license":"1","conference":{"location":"Ithaca, NY, United States","end_date":"2018-06-22","name":"EC: Conference on Economics and Computation","start_date":"2018-06-18"},"ddc":["000"],"file":[{"access_level":"open_access","checksum":"bb52683e349cfd864f4769a8f38f2798","relation":"main_file","file_size":302539,"date_updated":"2020-07-14T12:47:14Z","file_id":"7054","creator":"dernst","date_created":"2019-11-19T08:24:24Z","content_type":"application/pdf","file_name":"2018_EC18_Hansen.pdf"}],"quality_controlled":"1","author":[{"first_name":"Kristoffer Arnsfelt","last_name":"Hansen","full_name":"Hansen, Kristoffer Arnsfelt"},{"first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Neyman, Abraham","first_name":"Abraham","last_name":"Neyman"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The Big Match with a clock and a bit of memory","page":"149-150","article_processing_charge":"No","abstract":[{"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","lang":"eng"}],"publication_status":"published","external_id":{"isi":["000492755100020"]},"day":"18","status":"public","citation":{"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.","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","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.","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.","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.","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","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."},"_id":"5967","scopus_import":"1","oa_version":"Submitted Version","type":"conference","month":"06","language":[{"iso":"eng"}],"date_published":"2018-06-18T00:00:00Z","publisher":"ACM","department":[{"_id":"KrCh"}],"date_updated":"2025-05-14T11:24:35Z","isi":1,"oa":1,"file_date_updated":"2020-07-14T12:47:14Z"},{"year":"2018","date_created":"2019-02-13T12:59:33Z","issue":"6","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"doi":"10.1137/16m1093306","publication":"SIAM Journal on Computing","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.08547"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"}],"volume":47,"related_material":{"record":[{"status":"public","id":"1193","relation":"earlier_version"}]},"page":"2029-2056","article_processing_charge":"No","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."}],"external_id":{"isi":["000453785100001"],"arxiv":["1506.08547"]},"publication_status":"published","title":"Commutativity in the algorithmic Lovász local lemma","ec_funded":1,"day":"08","status":"public","citation":{"short":"V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.","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.","ista":"Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 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","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","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.","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."},"project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"intvolume":" 47","oa_version":"Preprint","type":"journal_article","_id":"5975","scopus_import":"1","isi":1,"oa":1,"language":[{"iso":"eng"}],"month":"11","date_published":"2018-11-08T00:00:00Z","publisher":"Society for Industrial and Applied Mathematics","arxiv":1,"department":[{"_id":"VlKo"}],"date_updated":"2025-09-22T09:44:20Z"},{"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"}],"external_id":{"isi":["000455953100064"]},"publication_status":"published","article_processing_charge":"No","title":"FlexMaps: Computational design of flat flexible shells for shaping 3D objects","volume":37,"author":[{"full_name":"Malomo, Luigi","last_name":"Malomo","first_name":"Luigi"},{"first_name":"Jesus","last_name":"Perez Rodriguez","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","full_name":"Perez Rodriguez, Jesus"},{"last_name":"Iarussi","first_name":"Emmanuel","id":"33F19F16-F248-11E8-B48F-1D18A9856A87","full_name":"Iarussi, Emmanuel"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"},{"full_name":"Miguel, Eder","last_name":"Miguel","first_name":"Eder"},{"first_name":"Paolo","last_name":"Cignoni","full_name":"Cignoni, Paolo"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":100109811,"date_updated":"2020-07-14T12:47:14Z","checksum":"d0529a41c78b37ab8840685579fb33b4","relation":"main_file","access_level":"open_access","file_id":"6901","creator":"bbickel","file_name":"flexmaps_author_version.pdf","content_type":"application/pdf","date_created":"2019-09-23T12:48:52Z"}],"quality_controlled":"1","ddc":["000"],"has_accepted_license":"1","article_number":"241","year":"2018","date_created":"2019-02-13T13:12:53Z","publication":"ACM Transactions on Graphics","issue":"6","doi":"10.1145/3272127.3275076","publication_identifier":{"issn":["0730-0301"]},"oa":1,"file_date_updated":"2020-07-14T12:47:14Z","isi":1,"publisher":"Association for Computing Machinery","department":[{"_id":"BeBi"}],"date_updated":"2025-03-31T15:59:13Z","language":[{"iso":"eng"}],"month":"11","date_published":"2018-11-01T00:00:00Z","type":"journal_article","article_type":"original","oa_version":"Published Version","intvolume":" 37","_id":"5976","scopus_import":"1","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"},{"name":"Soft-bodied intelligence for Manipulation","call_identifier":"H2020","grant_number":"645599","_id":"25082902-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"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","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.","short":"L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni, B. Bickel, ACM Transactions on Graphics 37 (2018).","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.","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."},"ec_funded":1,"pubrep_id":"1068","status":"public","day":"01"},{"article_processing_charge":"No","page":"17063-17068","publication_status":"published","external_id":{"isi":["000454575500020"]},"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."}],"title":"Tin diselenide molecular precursor for solution-processable thermoelectric materials","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Zhang, Yu","first_name":"Yu","last_name":"Zhang"},{"full_name":"Liu, Yu","last_name":"Liu","first_name":"Yu"},{"full_name":"Lim, Khak Ho","last_name":"Lim","first_name":"Khak Ho"},{"last_name":"Xing","first_name":"Congcong","full_name":"Xing, Congcong"},{"first_name":"Mengyao","last_name":"Li","full_name":"Li, Mengyao"},{"last_name":"Zhang","first_name":"Ting","full_name":"Zhang, Ting"},{"last_name":"Tang","first_name":"Pengyi","full_name":"Tang, Pengyi"},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"full_name":"Llorca, Jordi","first_name":"Jordi","last_name":"Llorca"},{"full_name":"Ng, Ka Ming","first_name":"Ka Ming","last_name":"Ng"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez","first_name":"Maria"},{"full_name":"Guardia, Pablo","last_name":"Guardia","first_name":"Pablo"},{"last_name":"Prato","first_name":"Mirko","full_name":"Prato, Mirko"},{"full_name":"Cadavid, Doris","last_name":"Cadavid","first_name":"Doris"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"volume":57,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://upcommons.upc.edu/bitstream/2117/130444/1/Zhang%20preprint.pdf"}],"date_created":"2019-02-14T10:23:27Z","year":"2018","doi":"10.1002/anie.201809847","publication_identifier":{"issn":["1433-7851"]},"issue":"52","publication":"Angewandte Chemie International Edition","isi":1,"oa":1,"date_published":"2018-12-21T00:00:00Z","language":[{"iso":"eng"}],"month":"12","date_updated":"2023-09-19T14:28:31Z","department":[{"_id":"MaIb"}],"publisher":"Wiley","oa_version":"Submitted Version","intvolume":" 57","article_type":"original","type":"journal_article","scopus_import":"1","_id":"5982","citation":{"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","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.","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.","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.","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.","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.","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"},"day":"21","status":"public"},{"external_id":{"isi":["000452992700008"],"arxiv":["1809.01204"]},"publication_status":"published","abstract":[{"lang":"eng","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."}],"article_processing_charge":"No","title":"Theory of the rotating polaron: Spectrum and self-localization","volume":98,"author":[{"first_name":"Enderalp","last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5973-0874","full_name":"Yakaboylu, Enderalp"},{"last_name":"Midya","first_name":"Bikashkali","full_name":"Midya, Bikashkali","id":"456187FC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Deuchert, Andreas","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3146-6746","last_name":"Deuchert","first_name":"Andreas"},{"first_name":"Nikolai K","last_name":"Leopold","orcid":"0000-0002-0495-6822","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","full_name":"Leopold, Nikolai K"},{"last_name":"Lemeshko","first_name":"Mikhail","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01204"}],"article_number":"224506","date_created":"2019-02-14T10:37:09Z","year":"2018","publication":"Physical Review B","doi":"10.1103/physrevb.98.224506","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"issue":"22","oa":1,"isi":1,"date_updated":"2025-04-14T07:26:59Z","department":[{"_id":"MiLe"},{"_id":"RoSe"}],"publisher":"American Physical Society","arxiv":1,"date_published":"2018-12-12T00:00:00Z","language":[{"iso":"eng"}],"month":"12","type":"journal_article","intvolume":" 98","oa_version":"Preprint","scopus_import":"1","_id":"5983","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems"}],"citation":{"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.","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.","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)."},"ec_funded":1,"day":"12","status":"public"},{"date_created":"2019-02-14T10:50:24Z","year":"2018","article_number":"1950","doi":"10.1038/s41467-018-04342-1","publication_identifier":{"issn":["2041-1723"]},"issue":"1","publication":"Nature Communications","quality_controlled":"1","file":[{"access_level":"open_access","checksum":"8325fcc194264af4749e662a73bf66b5","relation":"main_file","file_size":1349914,"date_updated":"2020-07-14T12:47:14Z","file_id":"5985","creator":"kschuh","date_created":"2019-02-14T10:58:29Z","file_name":"2018_Springer_Morri.pdf","content_type":"application/pdf"}],"has_accepted_license":"1","ddc":["570"],"author":[{"last_name":"Morri","first_name":"Maurizio","full_name":"Morri, Maurizio","id":"4863116E-F248-11E8-B48F-1D18A9856A87"},{"id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87","full_name":"Sanchez-Romero, Inmaculada","last_name":"Sanchez-Romero","first_name":"Inmaculada"},{"full_name":"Tichy, Alexandra-Madelaine","id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87","first_name":"Alexandra-Madelaine","last_name":"Tichy"},{"first_name":"Stephanie","last_name":"Kainrath","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","full_name":"Kainrath, Stephanie"},{"full_name":"Gerrard, Elliot J.","last_name":"Gerrard","first_name":"Elliot J."},{"last_name":"Hirschfeld","first_name":"Priscila","id":"435ACB3A-F248-11E8-B48F-1D18A9856A87","full_name":"Hirschfeld, Priscila"},{"first_name":"Jan","last_name":"Schwarz","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87","full_name":"Schwarz, Jan"},{"first_name":"Harald L","last_name":"Janovjak","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","volume":9,"article_processing_charge":"No","publication_status":"published","external_id":{"isi":["000432280000006"]},"abstract":[{"lang":"eng","text":"G-protein-coupled receptors (GPCRs) form the largest receptor family, relay environmental stimuli to changes in cell behavior and represent prime drug targets. Many GPCRs are classified as orphan receptors because of the limited knowledge on their ligands and coupling to cellular signaling machineries. Here, we engineer a library of 63 chimeric receptors that contain the signaling domains of human orphan and understudied GPCRs functionally linked to the light-sensing domain of rhodopsin. Upon stimulation with visible light, we identify activation of canonical cell signaling pathways, including cAMP-, Ca2+-, MAPK/ERK-, and Rho-dependent pathways, downstream of the engineered receptors. For the human pseudogene GPR33, we resurrect a signaling function that supports its hypothesized role as a pathogen entry site. These results demonstrate that substituting unknown chemical activators with a light switch can reveal information about protein function and provide an optically controlled protein library for exploring the physiology and therapeutic potential of understudied GPCRs."}],"title":"Optical functionalization of human class A orphan G-protein-coupled receptors","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)"},"ec_funded":1,"status":"public","day":"01","citation":{"ista":"Morri M, Sanchez-Romero I, Tichy A-M, Kainrath S, Gerrard EJ, Hirschfeld P, Schwarz J, Janovjak HL. 2018. Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. 9(1), 1950.","ama":"Morri M, Sanchez-Romero I, Tichy A-M, et al. Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-04342-1","short":"M. Morri, I. Sanchez-Romero, A.-M. Tichy, S. Kainrath, E.J. Gerrard, P. Hirschfeld, J. Schwarz, H.L. Janovjak, Nature Communications 9 (2018).","ieee":"M. Morri et al., “Optical functionalization of human class A orphan G-protein-coupled receptors,” Nature Communications, vol. 9, no. 1. Springer Nature, 2018.","mla":"Morri, Maurizio, et al. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” Nature Communications, vol. 9, no. 1, 1950, Springer Nature, 2018, doi:10.1038/s41467-018-04342-1.","apa":"Morri, M., Sanchez-Romero, I., Tichy, A.-M., Kainrath, S., Gerrard, E. J., Hirschfeld, P., … Janovjak, H. L. (2018). Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-04342-1","chicago":"Morri, Maurizio, Inmaculada Sanchez-Romero, Alexandra-Madelaine Tichy, Stephanie Kainrath, Elliot J. Gerrard, Priscila Hirschfeld, Jan Schwarz, and Harald L Janovjak. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-04342-1."},"project":[{"call_identifier":"FP7","name":"Microbial Ion Channels for Synthetic Neurobiology","_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564"},{"_id":"255A6082-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","call_identifier":"FWF","name":"Molecular Drug Targets"}],"intvolume":" 9","oa_version":"Published Version","type":"journal_article","scopus_import":"1","_id":"5984","isi":1,"file_date_updated":"2020-07-14T12:47:14Z","oa":1,"date_published":"2018-12-01T00:00:00Z","month":"12","language":[{"iso":"eng"}],"date_updated":"2025-04-15T07:22:42Z","publisher":"Springer Nature","department":[{"_id":"HaJa"},{"_id":"CaGu"},{"_id":"MiSi"}]},{"external_id":{"isi":["000429483700013"]},"publication_status":"published","abstract":[{"lang":"eng","text":"Schistosomes are the causative agents of schistosomiasis, a neglected tropical disease affecting over 230 million people worldwide.Additionally to their major impact on human health, they are also models of choice in evolutionary biology. These parasitic flatwormsare unique among the common hermaphroditic trematodes as they have separate sexes. This so-called “evolutionary scandal”displays a female heterogametic genetic sex-determination system (ZZ males and ZW females), as well as a pronounced adult sexualdimorphism. These phenotypic differences are determined by a shared set of genes in both sexes, potentially leading to intralocussexual conflicts. To resolve these conflicts in sexually selected traits, molecular mechanisms such as sex-biased gene expression couldoccur, but parent-of-origin gene expression also provides an alternative. In this work we investigated the latter mechanism, that is,genes expressed preferentially from either the maternal or the paternal allele, inSchistosoma mansonispecies. To this end, tran-scriptomes from male and female hybrid adults obtained by strain crosses were sequenced. Strain-specific single nucleotide poly-morphism (SNP) markers allowed us to discriminate the parental origin, while reciprocal crosses helped to differentiate parentalexpression from strain-specific expression. We identified genes containing SNPs expressed in a parent-of-origin manner consistentwith paternal and maternal imprints. Although the majority of the SNPs was identified in mitochondrial and Z-specific loci, theremaining SNPs found in male and female transcriptomes were situated in genes that have the potential to explain sexual differencesin schistosome parasites. Furthermore, we identified and validated four new Z-specific scaffolds."}],"article_processing_charge":"No","license":"https://creativecommons.org/licenses/by-nc/4.0/","page":"840-856","title":"Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites","volume":10,"author":[{"full_name":"Kincaid-Smith, Julien","first_name":"Julien","last_name":"Kincaid-Smith"},{"full_name":"Picard, Marion A L","orcid":"0000-0002-8101-2518","id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","last_name":"Picard","first_name":"Marion A L"},{"first_name":"Céline","last_name":"Cosseau","full_name":"Cosseau, Céline"},{"full_name":"Boissier, Jérôme","last_name":"Boissier","first_name":"Jérôme"},{"full_name":"Severac, Dany","last_name":"Severac","first_name":"Dany"},{"full_name":"Grunau, Christoph","last_name":"Grunau","first_name":"Christoph"},{"first_name":"Eve","last_name":"Toulza","full_name":"Toulza, Eve"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"date_updated":"2020-07-14T12:47:15Z","file_size":529755,"access_level":"open_access","relation":"main_file","checksum":"736a459cb77de5824354466bb0331caf","file_id":"5991","creator":"dernst","content_type":"application/pdf","file_name":"2018_GBE_Kincaid_Smith.pdf","date_created":"2019-02-14T12:20:01Z"}],"quality_controlled":"1","ddc":["570"],"has_accepted_license":"1","date_created":"2019-02-14T12:13:52Z","year":"2018","publication":"Genome Biology and Evolution","publication_identifier":{"issn":["1759-6653"]},"doi":"10.1093/gbe/evy037","issue":"3","file_date_updated":"2020-07-14T12:47:15Z","oa":1,"isi":1,"date_updated":"2023-09-19T14:39:08Z","department":[{"_id":"BeVi"}],"publisher":"Oxford University Press","date_published":"2018-03-01T00:00:00Z","language":[{"iso":"eng"}],"month":"03","type":"journal_article","oa_version":"Published Version","intvolume":" 10","scopus_import":"1","_id":"5989","citation":{"apa":"Kincaid-Smith, J., Picard, M. A. L., Cosseau, C., Boissier, J., Severac, D., Grunau, C., & Toulza, E. (2018). Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. Oxford University Press. https://doi.org/10.1093/gbe/evy037","chicago":"Kincaid-Smith, Julien, Marion A L Picard, Céline Cosseau, Jérôme Boissier, Dany Severac, Christoph Grunau, and Eve Toulza. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” Genome Biology and Evolution. Oxford University Press, 2018. https://doi.org/10.1093/gbe/evy037.","mla":"Kincaid-Smith, Julien, et al. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” Genome Biology and Evolution, vol. 10, no. 3, Oxford University Press, 2018, pp. 840–56, doi:10.1093/gbe/evy037.","short":"J. Kincaid-Smith, M.A.L. Picard, C. Cosseau, J. Boissier, D. Severac, C. Grunau, E. Toulza, Genome Biology and Evolution 10 (2018) 840–856.","ieee":"J. Kincaid-Smith et al., “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites,” Genome Biology and Evolution, vol. 10, no. 3. Oxford University Press, pp. 840–856, 2018.","ista":"Kincaid-Smith J, Picard MAL, Cosseau C, Boissier J, Severac D, Grunau C, Toulza E. 2018. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. 10(3), 840–856.","ama":"Kincaid-Smith J, Picard MAL, Cosseau C, et al. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. 2018;10(3):840-856. doi:10.1093/gbe/evy037"},"tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"day":"01","status":"public"},{"citation":{"ieee":"J. Ridderbos et al., “Josephson effect in a few-hole quantum dot,” Advanced Materials, vol. 30, no. 44. Wiley, 2018.","short":"J. Ridderbos, M. Brauns, J. Shen, F.K. de Vries, A. Li, E.P.A.M. Bakkers, A. Brinkman, F.A. Zwanenburg, Advanced Materials 30 (2018).","ista":"Ridderbos J, Brauns M, Shen J, de Vries FK, Li A, Bakkers EPAM, Brinkman A, Zwanenburg FA. 2018. Josephson effect in a few-hole quantum dot. Advanced Materials. 30(44), 1802257.","ama":"Ridderbos J, Brauns M, Shen J, et al. Josephson effect in a few-hole quantum dot. Advanced Materials. 2018;30(44). doi:10.1002/adma.201802257","chicago":"Ridderbos, Joost, Matthias Brauns, Jie Shen, Folkert K. de Vries, Ang Li, Erik P. A. M. Bakkers, Alexander Brinkman, and Floris A. Zwanenburg. “Josephson Effect in a Few-Hole Quantum Dot.” Advanced Materials. Wiley, 2018. https://doi.org/10.1002/adma.201802257.","apa":"Ridderbos, J., Brauns, M., Shen, J., de Vries, F. K., Li, A., Bakkers, E. P. A. M., … Zwanenburg, F. A. (2018). Josephson effect in a few-hole quantum dot. Advanced Materials. Wiley. https://doi.org/10.1002/adma.201802257","mla":"Ridderbos, Joost, et al. “Josephson Effect in a Few-Hole Quantum Dot.” Advanced Materials, vol. 30, no. 44, 1802257, Wiley, 2018, doi:10.1002/adma.201802257."},"day":"02","status":"public","publisher":"Wiley","department":[{"_id":"GeKa"}],"arxiv":1,"date_updated":"2023-09-19T14:29:58Z","language":[{"iso":"eng"}],"month":"11","date_published":"2018-11-02T00:00:00Z","oa":1,"isi":1,"_id":"5990","scopus_import":"1","type":"journal_article","oa_version":"Preprint","intvolume":" 30","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.08487"}],"quality_controlled":"1","publication":"Advanced Materials","issue":"44","publication_identifier":{"issn":["0935-9648"]},"doi":"10.1002/adma.201802257","article_number":"1802257","year":"2018","date_created":"2019-02-14T12:14:26Z","title":"Josephson effect in a few-hole quantum dot","abstract":[{"lang":"eng","text":"A Ge–Si core–shell nanowire is used to realize a Josephson field‐effect transistor with highly transparent contacts to superconducting leads. By changing the electric field, access to two distinct regimes, not combined before in a single device, is gained: in the accumulation mode the device is highly transparent and the supercurrent is carried by multiple subbands, while near depletion, the supercurrent is carried by single‐particle levels of a strongly coupled quantum dot operating in the few‐hole regime. These results establish Ge–Si nanowires as an important platform for hybrid superconductor–semiconductor physics and Majorana fermions."}],"external_id":{"arxiv":["1809.08487"],"isi":["000450232800015"]},"publication_status":"published","article_processing_charge":"No","volume":30,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Joost","last_name":"Ridderbos","full_name":"Ridderbos, Joost"},{"last_name":"Brauns","first_name":"Matthias","id":"33F94E3C-F248-11E8-B48F-1D18A9856A87","full_name":"Brauns, Matthias"},{"last_name":"Shen","first_name":"Jie","full_name":"Shen, Jie"},{"last_name":"de Vries","first_name":"Folkert K.","full_name":"de Vries, Folkert K."},{"first_name":"Ang","last_name":"Li","full_name":"Li, Ang"},{"first_name":"Erik P. A. M.","last_name":"Bakkers","full_name":"Bakkers, Erik P. A. M."},{"full_name":"Brinkman, Alexander","first_name":"Alexander","last_name":"Brinkman"},{"last_name":"Zwanenburg","first_name":"Floris A.","full_name":"Zwanenburg, Floris A."}]},{"ec_funded":1,"day":"01","status":"public","citation":{"short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018).","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2. Association for Computing Machinery, 2018.","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 2018;40(2). doi:10.1145/3174800","ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 40(2), 7.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery, 2018. https://doi.org/10.1145/3174800.","apa":"Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery. https://doi.org/10.1145/3174800","mla":"Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing Machinery, 2018, doi:10.1145/3174800."},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"oa_version":"Submitted Version","intvolume":" 40","type":"journal_article","_id":"5993","scopus_import":"1","isi":1,"oa":1,"language":[{"iso":"eng"}],"month":"06","date_published":"2018-06-01T00:00:00Z","department":[{"_id":"KrCh"}],"publisher":"Association for Computing Machinery","arxiv":1,"date_updated":"2025-04-15T08:12:22Z","year":"2018","date_created":"2019-02-14T12:29:10Z","article_number":"7","issue":"2","publication_identifier":{"issn":["0164-0925"]},"doi":"10.1145/3174800","publication":"ACM Transactions on Programming Languages and Systems","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1510.08517","open_access":"1"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Fu, Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu","first_name":"Hongfei"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotný, Petr","last_name":"Novotný","first_name":"Petr"},{"full_name":"Hasheminezhad, Rouzbeh","first_name":"Rouzbeh","last_name":"Hasheminezhad"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":40,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1438"}]},"article_processing_charge":"No","abstract":[{"lang":"eng","text":"In this article, we consider the termination problem of probabilistic programs with real-valued variables. Thequestions concerned are: qualitative ones that ask (i) whether the program terminates with probability 1(almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); andquantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) tocompute a boundBsuch that the probability not to terminate afterBsteps decreases exponentially (con-centration problem). To solve these questions, we utilize the notion of ranking supermartingales, which isa powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmicsynthesis of linear ranking-supermartingales over affine probabilistic programs (Apps) with both angelic anddemonic non-determinism. An important subclass of Apps is LRApp which is defined as the class of all Appsover which a linear ranking-supermartingale exists.Our main contributions are as follows. Firstly, we show that the membership problem of LRApp (i) canbe decided in polynomial time for Apps with at most demonic non-determinism, and (ii) isNP-hard and inPSPACEfor Apps with angelic non-determinism. Moreover, theNP-hardness result holds already for Appswithout probability and demonic non-determinism. Secondly, we show that the concentration problem overLRApp can be solved in the same complexity as for the membership problem of LRApp. Finally, we show thatthe expectation problem over LRApp can be solved in2EXPTIMEand isPSPACE-hard even for Apps withoutprobability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate theeffectiveness of our approach to answer the qualitative and quantitative questions over Apps with at mostdemonic non-determinism."}],"publication_status":"published","external_id":{"arxiv":["1510.08517"],"isi":["000434634500003"]},"title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs"},{"status":"public","day":"12","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)"},"citation":{"mla":"Velicky, Philipp, et al. “Genome Amplification and Cellular Senescence Are Hallmarks of Human Placenta Development.” PLOS Genetics, vol. 14, no. 10, e1007698, Public Library of Science, 2018, doi:10.1371/journal.pgen.1007698.","apa":"Velicky, P., Meinhardt, G., Plessl, K., Vondra, S., Weiss, T., Haslinger, P., … Pollheimer, J. (2018). Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007698","chicago":"Velicky, Philipp, Gudrun Meinhardt, Kerstin Plessl, Sigrid Vondra, Tamara Weiss, Peter Haslinger, Thomas Lendl, et al. “Genome Amplification and Cellular Senescence Are Hallmarks of Human Placenta Development.” PLOS Genetics. Public Library of Science, 2018. https://doi.org/10.1371/journal.pgen.1007698.","ama":"Velicky P, Meinhardt G, Plessl K, et al. Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. 2018;14(10). doi:10.1371/journal.pgen.1007698","ista":"Velicky P, Meinhardt G, Plessl K, Vondra S, Weiss T, Haslinger P, Lendl T, Aumayr K, Mairhofer M, Zhu X, Schütz B, Hannibal RL, Lindau R, Weil B, Ernerudh J, Neesen J, Egger G, Mikula M, Röhrl C, Urban AE, Baker J, Knöfler M, Pollheimer J. 2018. Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. 14(10), e1007698.","short":"P. Velicky, G. Meinhardt, K. Plessl, S. Vondra, T. Weiss, P. Haslinger, T. Lendl, K. Aumayr, M. Mairhofer, X. Zhu, B. Schütz, R.L. Hannibal, R. Lindau, B. Weil, J. Ernerudh, J. Neesen, G. Egger, M. Mikula, C. Röhrl, A.E. Urban, J. Baker, M. Knöfler, J. Pollheimer, PLOS Genetics 14 (2018).","ieee":"P. Velicky et al., “Genome amplification and cellular senescence are hallmarks of human placenta development,” PLOS Genetics, vol. 14, no. 10. Public Library of Science, 2018."},"scopus_import":"1","_id":"5998","type":"journal_article","intvolume":" 14","oa_version":"Published Version","date_updated":"2023-09-19T14:31:43Z","department":[{"_id":"JoDa"}],"publisher":"Public Library of Science","date_published":"2018-10-12T00:00:00Z","month":"10","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:47:15Z","oa":1,"isi":1,"publication":"PLOS Genetics","doi":"10.1371/journal.pgen.1007698","publication_identifier":{"issn":["1553-7404"]},"issue":"10","article_number":"e1007698","date_created":"2019-02-14T13:07:45Z","year":"2018","ddc":["570"],"has_accepted_license":"1","quality_controlled":"1","file":[{"date_updated":"2020-07-14T12:47:15Z","file_size":4592947,"access_level":"open_access","checksum":"34aa9a5972f61889c19f18be8ee787a0","relation":"main_file","file_id":"6000","creator":"kschuh","file_name":"2018_PLOS_Velicky.pdf","content_type":"application/pdf","date_created":"2019-02-14T13:14:35Z"}],"volume":14,"author":[{"last_name":"Velicky","first_name":"Philipp","full_name":"Velicky, Philipp","orcid":"0000-0002-2340-7431","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Meinhardt","first_name":"Gudrun","full_name":"Meinhardt, Gudrun"},{"full_name":"Plessl, Kerstin","last_name":"Plessl","first_name":"Kerstin"},{"first_name":"Sigrid","last_name":"Vondra","full_name":"Vondra, Sigrid"},{"full_name":"Weiss, Tamara","first_name":"Tamara","last_name":"Weiss"},{"first_name":"Peter","last_name":"Haslinger","full_name":"Haslinger, Peter"},{"first_name":"Thomas","last_name":"Lendl","full_name":"Lendl, Thomas"},{"first_name":"Karin","last_name":"Aumayr","full_name":"Aumayr, Karin"},{"full_name":"Mairhofer, Mario","last_name":"Mairhofer","first_name":"Mario"},{"full_name":"Zhu, Xiaowei","first_name":"Xiaowei","last_name":"Zhu"},{"first_name":"Birgit","last_name":"Schütz","full_name":"Schütz, Birgit"},{"first_name":"Roberta L.","last_name":"Hannibal","full_name":"Hannibal, Roberta L."},{"last_name":"Lindau","first_name":"Robert","full_name":"Lindau, Robert"},{"last_name":"Weil","first_name":"Beatrix","full_name":"Weil, Beatrix"},{"full_name":"Ernerudh, Jan","last_name":"Ernerudh","first_name":"Jan"},{"first_name":"Jürgen","last_name":"Neesen","full_name":"Neesen, Jürgen"},{"full_name":"Egger, Gerda","first_name":"Gerda","last_name":"Egger"},{"full_name":"Mikula, Mario","first_name":"Mario","last_name":"Mikula"},{"full_name":"Röhrl, Clemens","first_name":"Clemens","last_name":"Röhrl"},{"last_name":"Urban","first_name":"Alexander E.","full_name":"Urban, Alexander E."},{"first_name":"Julie","last_name":"Baker","full_name":"Baker, Julie"},{"last_name":"Knöfler","first_name":"Martin","full_name":"Knöfler, Martin"},{"full_name":"Pollheimer, Jürgen","last_name":"Pollheimer","first_name":"Jürgen"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Genome amplification and cellular senescence are hallmarks of human placenta development","external_id":{"isi":["000449328500025"]},"publication_status":"published","abstract":[{"text":"Genome amplification and cellular senescence are commonly associated with pathological processes. While physiological roles for polyploidization and senescence have been described in mouse development, controversy exists over their significance in humans. Here, we describe tetraploidization and senescence as phenomena of normal human placenta development. During pregnancy, placental extravillous trophoblasts (EVTs) invade the pregnant endometrium, termed decidua, to establish an adapted microenvironment required for the developing embryo. This process is critically dependent on continuous cell proliferation and differentiation, which is thought to follow the classical model of cell cycle arrest prior to terminal differentiation. Strikingly, flow cytometry and DNAseq revealed that EVT formation is accompanied with a genome-wide polyploidization, independent of mitotic cycles. DNA replication in these cells was analysed by a fluorescent cell-cycle indicator reporter system, cell cycle marker expression and EdU incorporation. Upon invasion into the decidua, EVTs widely lose their replicative potential and enter a senescent state characterized by high senescence-associated (SA) β-galactosidase activity, induction of a SA secretory phenotype as well as typical metabolic alterations. Furthermore, we show that the shift from endocycle-dependent genome amplification to growth arrest is disturbed in androgenic complete hydatidiform moles (CHM), a hyperplastic pregnancy disorder associated with increased risk of developing choriocarinoma. Senescence is decreased in CHM-EVTs, accompanied by exacerbated endoreduplication and hyperploidy. We propose induction of cellular senescence as a ploidy-limiting mechanism during normal human placentation and unravel a link between excessive polyploidization and reduced senescence in CHM.","lang":"eng"}],"article_processing_charge":"No"}]