[{"publication_status":"published","publisher":"Springer","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"acknowledgement":"This work was financially supported by FP7 of the EU through the project “Body on a chip,” ICT-FET-296257, and the ERC Advanced Grant “NeuroCMOS” (contract 267351), as well as by an individual Ambizione Grant 142440 from the Swiss National Science Foundation for Olivier Frey. The research leading to these results also received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. [291734]. We would like to thank Alexander Stettler, ETH Zurich for his expertise and support in the cleanroom, and we acknowledge the Single Cell Unit of D-BSSE, ETH Zurich for assistance in microscopy issues. M.L. is grateful to the members of the Guet and Tkačik groups, IST Austria, for valuable comments and support.","year":"2018","date_updated":"2021-01-12T07:40:42Z","date_created":"2018-12-11T11:45:43Z","volume":1771,"author":[{"full_name":"Misun, Patrick","last_name":"Misun","first_name":"Patrick"},{"full_name":"Birchler, Axel","first_name":"Axel","last_name":"Birchler"},{"id":"29E0800A-F248-11E8-B48F-1D18A9856A87","last_name":"Lang","first_name":"Moritz","full_name":"Lang, Moritz"},{"first_name":"Andreas","last_name":"Hierlemann","full_name":"Hierlemann, Andreas"},{"full_name":"Frey, Olivier","first_name":"Olivier","last_name":"Frey"}],"publist_id":"7574","ec_funded":1,"quality_controlled":"1","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-1-4939-7792-5_15","month":"01","title":"Fabrication and operation of microfluidic hanging drop networks","status":"public","intvolume":" 1771","_id":"305","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","alternative_title":["MIMB"],"type":"journal_article","abstract":[{"text":"The hanging-drop network (HDN) is a technology platform based on a completely open microfluidic network at the bottom of an inverted, surface-patterned substrate. The platform is predominantly used for the formation, culturing, and interaction of self-assembled spherical microtissues (spheroids) under precisely controlled flow conditions. Here, we describe design, fabrication, and operation of microfluidic hanging-drop networks.","lang":"eng"}],"page":"183 - 202","publication":"Methods in Molecular Biology","citation":{"ista":"Misun P, Birchler A, Lang M, Hierlemann A, Frey O. 2018. Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. 1771, 183–202.","ieee":"P. Misun, A. Birchler, M. Lang, A. Hierlemann, and O. Frey, “Fabrication and operation of microfluidic hanging drop networks,” Methods in Molecular Biology, vol. 1771. Springer, pp. 183–202, 2018.","apa":"Misun, P., Birchler, A., Lang, M., Hierlemann, A., & Frey, O. (2018). Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. Springer. https://doi.org/10.1007/978-1-4939-7792-5_15","ama":"Misun P, Birchler A, Lang M, Hierlemann A, Frey O. Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. 2018;1771:183-202. doi:10.1007/978-1-4939-7792-5_15","chicago":"Misun, Patrick, Axel Birchler, Moritz Lang, Andreas Hierlemann, and Olivier Frey. “Fabrication and Operation of Microfluidic Hanging Drop Networks.” Methods in Molecular Biology. Springer, 2018. https://doi.org/10.1007/978-1-4939-7792-5_15.","mla":"Misun, Patrick, et al. “Fabrication and Operation of Microfluidic Hanging Drop Networks.” Methods in Molecular Biology, vol. 1771, Springer, 2018, pp. 183–202, doi:10.1007/978-1-4939-7792-5_15.","short":"P. Misun, A. Birchler, M. Lang, A. Hierlemann, O. Frey, Methods in Molecular Biology 1771 (2018) 183–202."},"date_published":"2018-01-01T00:00:00Z","scopus_import":1,"day":"01"},{"external_id":{"arxiv":["1709.04037"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.04037"}],"oa":1,"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"conference":{"end_date":"2018-01-13","start_date":"2018-01-07","location":"Los Angeles, CA, USA","name":"POPL: Principles of Programming Languages"},"doi":"10.1145/3158122","language":[{"iso":"eng"}],"month":"01","year":"2018","publication_status":"published","publisher":"ACM","department":[{"_id":"KrCh"}],"author":[{"last_name":"Agrawal","first_name":"Sheshansh","full_name":"Agrawal, Sheshansh"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","first_name":"Petr"}],"date_created":"2018-12-11T11:45:50Z","date_updated":"2021-01-12T07:42:07Z","volume":2,"article_number":"34","publist_id":"7540","citation":{"chicago":"Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.","mla":"Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM, 2018, doi:10.1145/3158122.","short":"S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018.","ista":"Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34.","apa":"Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122","ieee":"S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.","ama":"Agrawal S, Chatterjee K, Novotný P. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. In: Vol 2. ACM; 2018. doi:10.1145/3158122"},"date_published":"2018-01-01T00:00:00Z","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"325","status":"public","title":"Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs","intvolume":" 2","oa_version":"Preprint","type":"conference","abstract":[{"lang":"eng","text":"Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem asks whether a given program program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). Although deep theoretical results have been established about RSMs, their application to probabilistic programs with nondeterminism has been limited only to programs of restricted control-flow structure. For non-probabilistic programs, lexicographic ranking functions provide a compositional and practical approach for termination analysis of real-world programs. In this work we introduce lexicographic RSMs and show that they present a sound method for almost-sure termination of probabilistic programs with nondeterminism. We show that lexicographic RSMs provide a tool for compositional reasoning about almost-sure termination, and for probabilistic programs with linear arithmetic they can be synthesized efficiently (in polynomial time). We also show that with additional restrictions even asymptotic bounds on expected termination time can be obtained through lexicographic RSMs. Finally, we present experimental results on benchmarks adapted from previous work to demonstrate the effectiveness of our approach."}],"issue":"POPL"},{"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"408","intvolume":" 1761","title":"In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls","status":"public","abstract":[{"lang":"eng","text":"Adventitious roots (AR) are de novo formed roots that emerge from any part of the plant or from callus in tissue culture, except root tissue. The plant tissue origin and the method by which they are induced determine the physiological properties of emerged ARs. Hence, a standard method encompassing all types of AR does not exist. Here we describe a method for the induction and analysis of AR that emerge from the etiolated hypocotyl of dicot plants. The hypocotyl is formed during embryogenesis and shows a determined developmental pattern which usually does not involve AR formation. However, the hypocotyl shows propensity to form de novo roots under specific circumstances such as removal of the root system, high humidity or flooding, or during de-etiolation. The hypocotyl AR emerge from a pericycle-like cell layer surrounding the vascular tissue of the central cylinder, which is reminiscent to the developmental program of lateral roots. Here we propose an easy protocol for in vitro hypocotyl AR induction from etiolated Arabidopsis seedlings."}],"type":"book_chapter","alternative_title":["MIMB"],"date_published":"2018-03-01T00:00:00Z","citation":{"chicago":"Trinh, Hoang, Inge Verstraeten, and Danny Geelen. “In Vitro Assay for Induction of Adventitious Rooting on Intact Arabidopsis Hypocotyls.” In Root Development , 1761:95–102. Springer Nature, 2018. https://doi.org/10.1007/978-1-4939-7747-5_7.","short":"H. Trinh, I. Verstraeten, D. Geelen, in:, Root Development , Springer Nature, 2018, pp. 95–102.","mla":"Trinh, Hoang, et al. “In Vitro Assay for Induction of Adventitious Rooting on Intact Arabidopsis Hypocotyls.” Root Development , vol. 1761, Springer Nature, 2018, pp. 95–102, doi:10.1007/978-1-4939-7747-5_7.","apa":"Trinh, H., Verstraeten, I., & Geelen, D. (2018). In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls. In Root Development (Vol. 1761, pp. 95–102). Springer Nature. https://doi.org/10.1007/978-1-4939-7747-5_7","ieee":"H. Trinh, I. Verstraeten, and D. Geelen, “In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls,” in Root Development , vol. 1761, Springer Nature, 2018, pp. 95–102.","ista":"Trinh H, Verstraeten I, Geelen D. 2018.In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls. In: Root Development . MIMB, vol. 1761, 95–102.","ama":"Trinh H, Verstraeten I, Geelen D. In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls. In: Root Development . Vol 1761. Springer Nature; 2018:95-102. doi:10.1007/978-1-4939-7747-5_7"},"publication":"Root Development ","page":"95 - 102","article_processing_charge":"No","day":"01","scopus_import":"1","author":[{"first_name":"Hoang","last_name":"Trinh","full_name":"Trinh, Hoang"},{"orcid":"0000-0001-7241-2328","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","last_name":"Verstraeten","first_name":"Inge","full_name":"Verstraeten, Inge"},{"full_name":"Geelen, Danny","last_name":"Geelen","first_name":"Danny"}],"volume":1761,"date_created":"2018-12-11T11:46:18Z","date_updated":"2021-01-12T07:54:21Z","pmid":1,"year":"2018","department":[{"_id":"JiFr"}],"publisher":"Springer Nature","publication_status":"published","publist_id":"7421","doi":"10.1007/978-1-4939-7747-5_7","language":[{"iso":"eng"}],"external_id":{"pmid":["29525951"]},"quality_controlled":"1","publication_identifier":{"issn":["1064-3745"]},"month":"03"},{"_id":"411","year":"2018","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JiFr"}],"publisher":"Springer","intvolume":" 1761","editor":[{"first_name":"Daniela","last_name":"Ristova","full_name":"Ristova, Daniela"},{"full_name":"Barbez, Elke","last_name":"Barbez","first_name":"Elke"}],"publication_status":"published","title":"Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia","status":"public","author":[{"first_name":"Michael","last_name":"Karampelias","full_name":"Karampelias, Michael"},{"full_name":"Tejos, Ricardo","first_name":"Ricardo","last_name":"Tejos"},{"last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"},{"full_name":"Vanneste, Steffen","first_name":"Steffen","last_name":"Vanneste"}],"oa_version":"None","volume":1761,"date_created":"2018-12-11T11:46:20Z","date_updated":"2021-01-12T07:54:34Z","type":"book_chapter","alternative_title":["Methods in Molecular Biology"],"publist_id":"7418","abstract":[{"lang":"eng","text":"Immunolocalization is a valuable tool for cell biology research that allows to rapidly determine the localization and expression levels of endogenous proteins. In plants, whole-mount in situ immunolocalization remains a challenging method, especially in tissues protected by waxy layers and complex cell wall carbohydrates. Here, we present a robust method for whole-mount in situ immunolocalization in primary root meristems and lateral root primordia in Arabidopsis thaliana. For good epitope preservation, fixation is done in an alkaline paraformaldehyde/glutaraldehyde mixture. This fixative is suitable for detecting a wide range of proteins, including integral transmembrane proteins and proteins peripherally attached to the plasma membrane. From initiation until emergence from the primary root, lateral root primordia are surrounded by several layers of differentiated tissues with a complex cell wall composition that interferes with the efficient penetration of all buffers. Therefore, immunolocalization in early lateral root primordia requires a modified method, including a strong solvent treatment for removal of hydrophobic barriers and a specific cocktail of cell wall-degrading enzymes. The presented method allows for easy, reliable, and high-quality in situ detection of the subcellular localization of endogenous proteins in primary and lateral root meristems without the need of time-consuming crosses or making translational fusions to fluorescent proteins."}],"citation":{"ama":"Karampelias M, Tejos R, Friml J, Vanneste S. Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In: Ristova D, Barbez E, eds. Root Development. Methods and Protocols. Vol 1761. MIMB. Springer; 2018:131-143. doi:10.1007/978-1-4939-7747-5_10","ista":"Karampelias M, Tejos R, Friml J, Vanneste S. 2018.Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In: Root Development. Methods and Protocols. Methods in Molecular Biology, vol. 1761, 131–143.","ieee":"M. Karampelias, R. Tejos, J. Friml, and S. Vanneste, “Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia,” in Root Development. Methods and Protocols, vol. 1761, D. Ristova and E. Barbez, Eds. Springer, 2018, pp. 131–143.","apa":"Karampelias, M., Tejos, R., Friml, J., & Vanneste, S. (2018). Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia. In D. Ristova & E. Barbez (Eds.), Root Development. Methods and Protocols (Vol. 1761, pp. 131–143). Springer. https://doi.org/10.1007/978-1-4939-7747-5_10","mla":"Karampelias, Michael, et al. “Optimized Whole Mount in Situ Immunolocalization for Arabidopsis Thaliana Root Meristems and Lateral Root Primordia.” Root Development. Methods and Protocols, edited by Daniela Ristova and Elke Barbez, vol. 1761, Springer, 2018, pp. 131–43, doi:10.1007/978-1-4939-7747-5_10.","short":"M. Karampelias, R. Tejos, J. Friml, S. Vanneste, in:, D. Ristova, E. Barbez (Eds.), Root Development. Methods and Protocols, Springer, 2018, pp. 131–143.","chicago":"Karampelias, Michael, Ricardo Tejos, Jiří Friml, and Steffen Vanneste. “Optimized Whole Mount in Situ Immunolocalization for Arabidopsis Thaliana Root Meristems and Lateral Root Primordia.” In Root Development. Methods and Protocols, edited by Daniela Ristova and Elke Barbez, 1761:131–43. MIMB. Springer, 2018. https://doi.org/10.1007/978-1-4939-7747-5_10."},"publication":"Root Development. Methods and Protocols","page":"131 - 143","quality_controlled":"1","doi":"10.1007/978-1-4939-7747-5_10","date_published":"2018-03-11T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":1,"series_title":"MIMB","day":"11","month":"03"},{"scopus_import":1,"day":"10","month":"01","publication":"Science Translational Medicine","citation":{"chicago":"Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race for the Treatment.” Science Translational Medicine. American Association for the Advancement of Science, 2018. https://doi.org/10.1126/scitranslmed.aar7514.","mla":"Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race for the Treatment.” Science Translational Medicine, vol. 10, no. 423, eaar7514, American Association for the Advancement of Science, 2018, doi:10.1126/scitranslmed.aar7514.","short":"G. Novarino, Science Translational Medicine 10 (2018).","ista":"Novarino G. 2018. Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. 10(423), eaar7514.","ieee":"G. Novarino, “Zika-associated microcephaly: Reduce the stress and race for the treatment,” Science Translational Medicine, vol. 10, no. 423. American Association for the Advancement of Science, 2018.","apa":"Novarino, G. (2018). Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aar7514","ama":"Novarino G. Zika-associated microcephaly: Reduce the stress and race for the treatment. Science Translational Medicine. 2018;10(423). doi:10.1126/scitranslmed.aar7514"},"quality_controlled":"1","date_published":"2018-01-10T00:00:00Z","doi":"10.1126/scitranslmed.aar7514","language":[{"iso":"eng"}],"article_number":"eaar7514","type":"journal_article","abstract":[{"text":"Inhibition of the endoplasmic reticulum stress pathway may hold the key to Zika virus-associated microcephaly treatment. ","lang":"eng"}],"publist_id":"7365","issue":"423","_id":"456","year":"2018","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","title":"Zika-associated microcephaly: Reduce the stress and race for the treatment","publisher":"American Association for the Advancement of Science","department":[{"_id":"GaNo"}],"intvolume":" 10","author":[{"full_name":"Novarino, Gaia","first_name":"Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178"}],"date_created":"2018-12-11T11:46:34Z","date_updated":"2021-01-12T07:59:42Z","volume":10,"oa_version":"None"},{"date_published":"2018-10-01T00:00:00Z","publication":"VÖB Mitteilungen","citation":{"ama":"Petritsch B, Porsche J. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 2018;71(1):199-206. doi:10.31263/voebm.v71i1.1993","ieee":"B. Petritsch and J. Porsche, “IST PubRep and IST DataRep: the institutional repositories at IST Austria,” VÖB Mitteilungen, vol. 71, no. 1. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 199–206, 2018.","apa":"Petritsch, B., & Porsche, J. (2018). IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v71i1.1993","ista":"Petritsch B, Porsche J. 2018. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 71(1), 199–206.","short":"B. Petritsch, J. Porsche, VÖB Mitteilungen 71 (2018) 199–206.","mla":"Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen, vol. 71, no. 1, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018, pp. 199–206, doi:10.31263/voebm.v71i1.1993.","chicago":"Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018. https://doi.org/10.31263/voebm.v71i1.1993."},"page":"199 - 206","day":"01","has_accepted_license":"1","scopus_import":1,"oa_version":"Published Version","file":[{"file_id":"5702","relation":"main_file","checksum":"7ac61bade5f37db011ca435ebcf86797","date_updated":"2020-07-14T12:46:38Z","date_created":"2018-12-17T12:40:27Z","access_level":"open_access","file_name":"2018_VOEB_Petritsch.pdf","creator":"dernst","content_type":"application/pdf","file_size":509434}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"53","status":"public","ddc":["020"],"title":"IST PubRep and IST DataRep: the institutional repositories at IST Austria","intvolume":" 71","abstract":[{"lang":"eng","text":"In 2013, a publication repository was implemented at IST Austria and 2015 after a thorough preparation phase a data repository was implemented - both based on the Open Source Software EPrints. In this text, designed as field report, we will reflect on our experiences with Open Source Software in general and specifically with EPrints regarding technical aspects but also regarding their characteristics of the user community. The second part is a pleading for including the end users in the process of implementation, adaption and evaluation."}],"issue":"1","type":"journal_article","doi":"10.31263/voebm.v71i1.1993","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"10","author":[{"orcid":"0000-0003-2724-4614","id":"406048EC-F248-11E8-B48F-1D18A9856A87","last_name":"Petritsch","first_name":"Barbara","full_name":"Petritsch, Barbara"},{"full_name":"Porsche, Jana","last_name":"Porsche","first_name":"Jana","id":"3252EDC2-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2021-01-12T08:01:26Z","date_created":"2018-12-11T11:44:22Z","volume":71,"year":"2018","publication_status":"published","department":[{"_id":"E-Lib"}],"publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","file_date_updated":"2020-07-14T12:46:38Z","publist_id":"8001","license":"https://creativecommons.org/licenses/by/4.0/"},{"publist_id":"7281","file_date_updated":"2020-07-14T12:46:38Z","volume":31,"date_updated":"2023-02-23T12:23:25Z","date_created":"2018-12-11T11:47:01Z","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"last_name":"King","first_name":"Valerie","full_name":"King, Valerie"},{"full_name":"Saia, Jared","first_name":"Jared","last_name":"Saia"}],"publisher":"Springer","department":[{"_id":"DaAl"}],"publication_status":"published","year":"2018","publication_identifier":{"issn":["01782770"]},"month":"11","language":[{"iso":"eng"}],"doi":"10.1007/s00446-017-0315-1","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"issue":"6","abstract":[{"lang":"eng","text":"We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary. We describe a new randomized consensus protocol with expected message complexity O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear improvement over the best previously known protocol, and within logarithmic factors of a known Ω(n2) message lower bound. The protocol further ensures that no process sends more than O(nlog3n) messages in expectation, which is again within logarithmic factors of optimal. We also present a generalization of the algorithm to an arbitrary number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach is to build a message-efficient, resilient mechanism for aggregating individual processor votes, implementing the message-passing equivalent of a weak shared coin. Roughly, in our protocol, a processor first announces its votes to small groups, then propagates them to increasingly larger groups as it generates more and more votes. To bound the number of messages that an individual process might have to send or receive, the protocol progressively increases the weight of generated votes. The main technical challenge is bounding the impact of votes that are still “in flight” (generated, but not fully propagated) on the final outcome of the shared coin, especially since such votes might have different weights. We achieve this by leveraging the structure of the algorithm, and a technical argument based on martingale concentration bounds. Overall, we show that it is possible to build an efficient message-passing implementation of a shared coin, and in the process (almost-optimally) solve the classic consensus problem in the asynchronous message-passing model."}],"type":"journal_article","oa_version":"Published Version","file":[{"file_id":"5867","relation":"main_file","date_created":"2019-01-22T07:25:51Z","date_updated":"2020-07-14T12:46:38Z","checksum":"69b46e537acdcac745237ddb853fcbb5","file_name":"2017_DistribComp_Alistarh.pdf","access_level":"open_access","creator":"dernst","file_size":595707,"content_type":"application/pdf"}],"intvolume":" 31","title":"Communication-efficient randomized consensus","ddc":["000"],"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"536","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2018-11-01T00:00:00Z","page":"489-501","citation":{"chicago":"Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-017-0315-1.","short":"D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501.","mla":"Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.” Distributed Computing, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:10.1007/s00446-017-0315-1.","ieee":"D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient randomized consensus,” Distributed Computing, vol. 31, no. 6. Springer, pp. 489–501, 2018.","apa":"Alistarh, D.-A., Aspnes, J., King, V., & Saia, J. (2018). Communication-efficient randomized consensus. Distributed Computing. Springer. https://doi.org/10.1007/s00446-017-0315-1","ista":"Alistarh D-A, Aspnes J, King V, Saia J. 2018. Communication-efficient randomized consensus. Distributed Computing. 31(6), 489–501.","ama":"Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized consensus. Distributed Computing. 2018;31(6):489-501. doi:10.1007/s00446-017-0315-1"},"publication":"Distributed Computing"},{"intvolume":" 360","status":"public","title":"The Bogoliubov free energy functional II: The dilute Limit","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"554","oa_version":"Submitted Version","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"We analyse the canonical Bogoliubov free energy functional in three dimensions at low temperatures in the dilute limit. We prove existence of a first-order phase transition and, in the limit (Formula presented.), we determine the critical temperature to be (Formula presented.) to leading order. Here, (Formula presented.) is the critical temperature of the free Bose gas, ρ is the density of the gas and a is the scattering length of the pair-interaction potential V. We also prove asymptotic expansions for the free energy. In particular, we recover the Lee–Huang–Yang formula in the limit (Formula presented.)."}],"page":"347-403","citation":{"short":"M.M. Napiórkowski, R. Reuvers, J. Solovej, Communications in Mathematical Physics 360 (2018) 347–403.","mla":"Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics, vol. 360, no. 1, Springer, 2018, pp. 347–403, doi:10.1007/s00220-017-3064-x.","chicago":"Napiórkowski, Marcin M, Robin Reuvers, and Jan Solovej. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics. Springer, 2018. https://doi.org/10.1007/s00220-017-3064-x.","ama":"Napiórkowski MM, Reuvers R, Solovej J. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 2018;360(1):347-403. doi:10.1007/s00220-017-3064-x","ieee":"M. M. Napiórkowski, R. Reuvers, and J. Solovej, “The Bogoliubov free energy functional II: The dilute Limit,” Communications in Mathematical Physics, vol. 360, no. 1. Springer, pp. 347–403, 2018.","apa":"Napiórkowski, M. M., Reuvers, R., & Solovej, J. (2018). The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-017-3064-x","ista":"Napiórkowski MM, Reuvers R, Solovej J. 2018. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 360(1), 347–403."},"publication":"Communications in Mathematical Physics","date_published":"2018-05-01T00:00:00Z","scopus_import":1,"day":"01","publisher":"Springer","department":[{"_id":"RoSe"}],"publication_status":"published","year":"2018","volume":360,"date_updated":"2021-01-12T08:02:35Z","date_created":"2018-12-11T11:47:09Z","author":[{"id":"4197AD04-F248-11E8-B48F-1D18A9856A87","last_name":"Napiórkowski","first_name":"Marcin M","full_name":"Napiórkowski, Marcin M"},{"first_name":"Robin","last_name":"Reuvers","full_name":"Reuvers, Robin"},{"last_name":"Solovej","first_name":"Jan","full_name":"Solovej, Jan"}],"publist_id":"7260","project":[{"call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27"}],"quality_controlled":"1","oa":1,"external_id":{"arxiv":["1511.05953"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.05953"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00220-017-3064-x","publication_identifier":{"issn":["00103616"]},"month":"05"},{"abstract":[{"lang":"eng","text":"Primary neuronal cell culture preparations are widely used to investigate synaptic functions. This chapter describes a detailed protocol for the preparation of a neuronal cell culture in which giant calyx-type synaptic terminals are formed. This chapter also presents detailed protocols for utilizing the main technical advantages provided by such a preparation, namely, labeling and imaging of synaptic organelles and electrophysiological recordings directly from presynaptic terminals."}],"alternative_title":["Methods in Molecular Biology"],"type":"book_chapter","oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"7046","date_created":"2019-11-19T07:47:43Z","date_updated":"2020-07-14T12:47:09Z","checksum":"8aa174ca65a56fbb19e9f88cff3ac3fd","file_name":"2018_NeurotrophicFactors_Dimitrov.pdf","access_level":"open_access","file_size":787407,"content_type":"application/pdf","creator":"dernst"}],"intvolume":" 1727","title":"Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses","ddc":["570"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"562","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2018-01-01T00:00:00Z","page":"201 - 215","citation":{"short":"D. Dimitrov, L. Guillaud, K. Eguchi, T. Takahashi, in:, S.D. Skaper (Ed.), Neurotrophic Factors, Springer, 2018, pp. 201–215.","mla":"Dimitrov, Dimitar, et al. “Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging and Electrophysiological Analyses.” Neurotrophic Factors, edited by Stephen D. Skaper, vol. 1727, Springer, 2018, pp. 201–15, doi:10.1007/978-1-4939-7571-6_15.","chicago":"Dimitrov, Dimitar, Laurent Guillaud, Kohgaku Eguchi, and Tomoyuki Takahashi. “Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging and Electrophysiological Analyses.” In Neurotrophic Factors, edited by Stephen D. Skaper, 1727:201–15. Springer, 2018. https://doi.org/10.1007/978-1-4939-7571-6_15.","ama":"Dimitrov D, Guillaud L, Eguchi K, Takahashi T. Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In: Skaper SD, ed. Neurotrophic Factors. Vol 1727. Springer; 2018:201-215. doi:10.1007/978-1-4939-7571-6_15","ieee":"D. Dimitrov, L. Guillaud, K. Eguchi, and T. Takahashi, “Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses,” in Neurotrophic Factors, vol. 1727, S. D. Skaper, Ed. Springer, 2018, pp. 201–215.","apa":"Dimitrov, D., Guillaud, L., Eguchi, K., & Takahashi, T. (2018). Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In S. D. Skaper (Ed.), Neurotrophic Factors (Vol. 1727, pp. 201–215). Springer. https://doi.org/10.1007/978-1-4939-7571-6_15","ista":"Dimitrov D, Guillaud L, Eguchi K, Takahashi T. 2018.Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In: Neurotrophic Factors. Methods in Molecular Biology, vol. 1727, 201–215."},"publication":"Neurotrophic Factors","publist_id":"7252","file_date_updated":"2020-07-14T12:47:09Z","volume":1727,"date_created":"2018-12-11T11:47:11Z","date_updated":"2021-01-12T08:03:05Z","author":[{"full_name":"Dimitrov, Dimitar","last_name":"Dimitrov","first_name":"Dimitar"},{"first_name":"Laurent","last_name":"Guillaud","full_name":"Guillaud, Laurent"},{"full_name":"Eguchi, Kohgaku","first_name":"Kohgaku","last_name":"Eguchi","id":"2B7846DC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6170-2546"},{"full_name":"Takahashi, Tomoyuki","first_name":"Tomoyuki","last_name":"Takahashi"}],"department":[{"_id":"RySh"}],"editor":[{"last_name":"Skaper","first_name":"Stephen D.","full_name":"Skaper, Stephen D."}],"publisher":"Springer","publication_status":"published","pmid":1,"year":"2018","month":"01","language":[{"iso":"eng"}],"doi":"10.1007/978-1-4939-7571-6_15","quality_controlled":"1","oa":1,"external_id":{"pmid":["29222783"]}},{"type":"book_chapter","publist_id":"7995","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"}],"editor":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Edmund M.","last_name":"Clarke","full_name":"Clarke, Edmund M."},{"full_name":"Veith, Helmut","first_name":"Helmut","last_name":"Veith"},{"full_name":"Bloem, Roderick","first_name":"Roderick","last_name":"Bloem"}],"publisher":"Springer","department":[{"_id":"KrCh"}],"title":"Graph games and reactive synthesis","publication_status":"published","status":"public","year":"2018","_id":"59","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","date_created":"2018-12-11T11:44:24Z","date_updated":"2021-01-12T08:05:10Z","edition":"1","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"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"}],"scopus_import":1,"publication_identifier":{"isbn":["978-3-319-10574-1"]},"day":"19","month":"05","page":"921 - 962","quality_controlled":"1","citation":{"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.","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.","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.","ista":"Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962.","apa":"Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27","ieee":"R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Model Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.","ama":"Bloem R, Chatterjee K, Jobstmann B. Graph games and reactive synthesis. In: Henzinger TA, Clarke EM, Veith H, Bloem R, eds. Handbook of Model Checking. 1st ed. Springer; 2018:921-962. doi:10.1007/978-3-319-10575-8_27"},"publication":"Handbook of Model Checking","language":[{"iso":"eng"}],"date_published":"2018-05-19T00:00:00Z","doi":"10.1007/978-3-319-10575-8_27"}]