[{"project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"title":"Hanani-Tutte for radial planarity","external_id":{"arxiv":["1608.08662"]},"article_processing_charge":"No","publist_id":"6254","author":[{"last_name":"Fulek","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pelsmajer, Michael","last_name":"Pelsmajer","first_name":"Michael"},{"last_name":"Schaefer","full_name":"Schaefer, Marcus","first_name":"Marcus"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Fulek, Radoslav, et al. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications, vol. 21, no. 1, Brown University, 2017, pp. 135–54, doi:10.7155/jgaa.00408.","apa":"Fulek, R., Pelsmajer, M., & Schaefer, M. (2017). Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00408","ama":"Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 2017;21(1):135-154. doi:10.7155/jgaa.00408","short":"R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications 21 (2017) 135–154.","ieee":"R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” Journal of Graph Algorithms and Applications, vol. 21, no. 1. Brown University, pp. 135–154, 2017.","chicago":"Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications. Brown University, 2017. https://doi.org/10.7155/jgaa.00408.","ista":"Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 21(1), 135–154."},"oa":1,"quality_controlled":"1","publisher":"Brown University","date_created":"2018-12-11T11:50:13Z","date_published":"2017-01-01T00:00:00Z","doi":"10.7155/jgaa.00408","page":"135 - 154","publication":"Journal of Graph Algorithms and Applications","day":"01","year":"2017","has_accepted_license":"1","status":"public","type":"journal_article","article_type":"original","_id":"1113","file_date_updated":"2019-10-24T10:54:37Z","department":[{"_id":"UlWa"}],"ddc":["510"],"date_updated":"2023-02-23T10:05:57Z","intvolume":" 21","month":"01","scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"A drawing of a graph G is radial if the vertices of G are placed on concentric circles C 1 , . . . , C k with common center c , and edges are drawn radially : every edge intersects every circle centered at c at most once. G is radial planar if it has a radial embedding, that is, a crossing-free radial drawing. If the vertices of G are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the assignment of vertices to circles corresponds to the given ordering or leveling. We show that a graph G is radial planar if G has a radial drawing in which every two edges cross an even number of times; the radial embedding has the same leveling as the radial drawing. In other words, we establish the weak variant of the Hanani-Tutte theorem for radial planarity. This generalizes a result by Pach and Toth.","lang":"eng"}],"ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","id":"1164","status":"public"},{"relation":"earlier_version","status":"public","id":"1595"}]},"volume":21,"issue":"1","language":[{"iso":"eng"}],"file":[{"date_created":"2019-10-24T10:54:37Z","file_name":"2017_JournalGraphAlgorithms_Fulek.pdf","date_updated":"2019-10-24T10:54:37Z","file_size":573623,"creator":"dernst","file_id":"6967","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"publication_status":"published"},{"author":[{"full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A"}],"publist_id":"7379","department":[{"_id":"LeSa"}],"editor":[{"last_name":"Wikström","full_name":"Wikström, Mårten","first_name":"Mårten"}],"title":"Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions","citation":{"mla":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” Mechanisms of Primary Energy Transduction in Biology , edited by Mårten Wikström, Royal Society of Chemistry, 2017, pp. 25–59, doi:10.1039/9781788010405-00025.","short":"L.A. Sazanov, in:, M. Wikström (Ed.), Mechanisms of Primary Energy Transduction in Biology , Royal Society of Chemistry, 2017, pp. 25–59.","ieee":"L. A. Sazanov, “Structure of respiratory complex I: ‘Minimal’ bacterial and ‘de luxe’ mammalian versions,” in Mechanisms of primary energy transduction in biology , M. Wikström, Ed. Royal Society of Chemistry, 2017, pp. 25–59.","ama":"Sazanov LA. Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Wikström M, ed. Mechanisms of Primary Energy Transduction in Biology . Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry; 2017:25-59. doi:10.1039/9781788010405-00025","apa":"Sazanov, L. A. (2017). Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In M. Wikström (Ed.), Mechanisms of primary energy transduction in biology (pp. 25–59). Royal Society of Chemistry. https://doi.org/10.1039/9781788010405-00025","chicago":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” In Mechanisms of Primary Energy Transduction in Biology , edited by Mårten Wikström, 25–59. Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781788010405-00025.","ista":"Sazanov LA. 2017.Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Mechanisms of primary energy transduction in biology . , 25–59."},"date_updated":"2021-01-12T07:56:59Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","status":"public","series_title":"Mechanisms of Primary Energy Transduction in Biology ","_id":"444","page":"25 - 59","date_created":"2018-12-11T11:46:30Z","date_published":"2017-11-29T00:00:00Z","doi":"10.1039/9781788010405-00025","publication_status":"published","year":"2017","publication_identifier":{"isbn":["978-1-78262-865-1"]},"publication":"Mechanisms of primary energy transduction in biology ","language":[{"iso":"eng"}],"day":"29","publisher":"Royal Society of Chemistry","quality_controlled":"1","month":"11","abstract":[{"text":"Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular energy generation, contributing to the proton motive force used to produce ATP. It couples the transfer of two electrons between NADH and quinone to translocation of four protons across the membrane. It is the largest protein assembly of bacterial and mitochondrial respiratory chains, composed, in mammals, of up to 45 subunits with a total molecular weight of ∼1 MDa. Bacterial enzyme is about half the size, providing the important “minimal” model of complex I. The l-shaped complex consists of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where proton translocation takes place. Previously, we have solved the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus and of the membrane domain from Escherichia coli, followed by the atomic structure of intact, entire complex I from T. thermophilus. Recently, we have solved by cryo-EM a first complete atomic structure of mammalian (ovine) mitochondrial complex I. Core subunits are well conserved from the bacterial version, whilst supernumerary subunits form an interlinked, stabilizing shell around the core. Subunits containing additional cofactors, including Zn ion, NADPH and phosphopantetheine, probably have regulatory roles. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative diseases. The structure of mammalian enzyme provides many insights into complex I mechanism, assembly, maturation and dysfunction, allowing detailed molecular analysis of disease-causing mutations.","lang":"eng"}],"oa_version":"None"},{"has_accepted_license":"1","year":"2017","day":"07","publication":"Biophysical Journal","page":"2055 - 2067","doi":"10.1016/j.bpj.2017.09.006","date_published":"2017-11-07T00:00:00Z","date_created":"2018-12-11T11:46:33Z","acknowledgement":"The plasmid for full-length kinesin-1 was a gift from G. Holzwarth and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade for technical assistance. G.P. thanks the Francis Crick Institute, and in particular the Surrey and Salbreux groups, for their hospitality during his sabbatical stay, as well as Imperial College London for making it possible. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European Research Council (Advanced Grant, project 323042). ","quality_controlled":"1","publisher":"Biophysical Society","oa":1,"citation":{"ista":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 113(9), 2055–2067.","chicago":"Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner, and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal. Biophysical Society, 2017. https://doi.org/10.1016/j.bpj.2017.09.006.","short":"T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067.","ieee":"T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement,” Biophysical Journal, vol. 113, no. 9. Biophysical Society, pp. 2055–2067, 2017.","ama":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 2017;113(9):2055-2067. doi:10.1016/j.bpj.2017.09.006","apa":"Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., & Surrey, T. (2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. Biophysical Society. https://doi.org/10.1016/j.bpj.2017.09.006","mla":"Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal, vol. 113, no. 9, Biophysical Society, 2017, pp. 2055–67, doi:10.1016/j.bpj.2017.09.006."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Fallesen","full_name":"Fallesen, Todd","first_name":"Todd"},{"first_name":"Johanna","full_name":"Roostalu, Johanna","last_name":"Roostalu"},{"last_name":"Düllberg","orcid":"0000-0001-6335-9748","full_name":"Düllberg, Christian F","first_name":"Christian F","id":"459064DC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pruessner, Gunnar","last_name":"Pruessner","first_name":"Gunnar"},{"full_name":"Surrey, Thomas","last_name":"Surrey","first_name":"Thomas"}],"publist_id":"7369","article_processing_charge":"No","title":"Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement","publication_status":"published","file":[{"file_size":977192,"date_updated":"2020-07-14T12:46:31Z","creator":"system","file_name":"IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf","date_created":"2018-12-12T10:14:03Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5052","checksum":"99a2474088e20ac74b1882c4fbbb45b1"}],"language":[{"iso":"eng"}],"volume":113,"issue":"9","abstract":[{"lang":"eng","text":"Most kinesin motors move in only one direction along microtubules. Members of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed motors and shown to produce piconewton forces. However, some fungal kinesin-5 motors are bidirectional. The force production of a bidirectional kinesin-5 has not yet been measured. Therefore, it remains unknown whether the mechanism of the unconventional minus-end-directed motility differs fundamentally from that of plus-end-directed stepping. Using force spectroscopy, we have measured here the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in microtubule gliding assays in both plus- and minus-end direction. Correlation analysis of pause forces demonstrated that individual Cin8 molecules produce additive forces in both directions of movement. In ensembles, Cin8 motors were able to produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties appear to be conserved within the kinesin-5 subfamily. Force production was largely independent of the directionality of movement, indicating similarities between the motility mechanisms for both directions. These results provide constraints for the development of models for the bidirectional motility mechanism of fission yeast kinesin-5 and provide insight into the function of this mitotic motor."}],"oa_version":"Published Version","month":"11","intvolume":" 113","date_updated":"2021-01-12T07:59:28Z","ddc":["570"],"department":[{"_id":"MaLo"}],"file_date_updated":"2020-07-14T12:46:31Z","_id":"453","article_type":"original","type":"journal_article","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","pubrep_id":"965"},{"_id":"464","pubrep_id":"956","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"type":"journal_article","ddc":["004"],"date_updated":"2023-02-23T10:08:55Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:32Z","oa_version":"Published Version","abstract":[{"text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"intvolume":" 13","month":"09","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","date_created":"2018-12-12T10:13:27Z","creator":"system","file_size":582940,"date_updated":"2020-07-14T12:46:32Z","checksum":"12d469ae69b80361333d7dead965cf5d","file_id":"5010","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"issn":["1860-5974"]},"ec_funded":1,"license":"https://creativecommons.org/licenses/by-nd/4.0/","issue":"3","related_material":{"record":[{"status":"public","id":"1661","relation":"earlier_version"}]},"volume":13,"article_number":"26","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017."},"title":"Improved algorithms for parity and Streett objectives","external_id":{"arxiv":["1410.0833"]},"article_processing_charge":"No","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer","first_name":"Veronika"}],"publist_id":"7357","oa":1,"quality_controlled":"1","publisher":"International Federation of Computational Logic","publication":"Logical Methods in Computer Science","day":"26","year":"2017","has_accepted_license":"1","date_created":"2018-12-11T11:46:37Z","date_published":"2017-09-26T00:00:00Z","doi":"10.23638/LMCS-13(3:26)2017"},{"project":[{"call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176"}],"article_number":"103","article_processing_charge":"Yes (in subscription journal)","publist_id":"7350","author":[{"full_name":"Jeschke, Stefan","last_name":"Jeschke","first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","last_name":"Wojtan","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"title":"Water wave packets","citation":{"mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.","ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics, vol. 36, no. 4. ACM, 2017.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).","ama":"Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics. 2017;36(4). doi:10.1145/3072959.3073678","apa":"Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3072959.3073678","chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678.","ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"ACM","quality_controlled":"1","date_created":"2018-12-11T11:46:39Z","doi":"10.1145/3072959.3073678","date_published":"2017-07-01T00:00:00Z","year":"2017","has_accepted_license":"1","publication":"ACM Transactions on Graphics","day":"01","article_type":"original","type":"journal_article","status":"public","_id":"470","file_date_updated":"2020-07-14T12:46:34Z","department":[{"_id":"ChWo"}],"date_updated":"2023-02-23T12:20:26Z","ddc":["006"],"scopus_import":1,"intvolume":" 36","month":"07","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"lang":"eng","text":"This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios."}],"oa_version":"Published Version","ec_funded":1,"issue":"4","volume":36,"publication_status":"published","publication_identifier":{"issn":["07300301"]},"language":[{"iso":"eng"}],"file":[{"file_size":13131683,"date_updated":"2020-07-14T12:46:34Z","creator":"wojtan","file_name":"wavepackets_final.pdf","date_created":"2020-01-24T09:32:35Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"7359","checksum":"82a3b2bfeee4ddef16ecc21675d1a48a"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 18(2), 12.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3060139.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2. ACM, 2017.","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 2017;18(2). doi:10.1145/3060139","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3060139","mla":"Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139."},"title":"Faster statistical model checking for unbounded temporal properties","author":[{"last_name":"Daca","full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana","last_name":"Petrov","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","first_name":"Tatjana"}],"publist_id":"7349","article_number":"12","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"publication":"ACM Transactions on Computational Logic (TOCL)","day":"01","year":"2017","date_created":"2018-12-11T11:46:39Z","doi":"10.1145/3060139","date_published":"2017-05-01T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"ACM","date_updated":"2023-02-21T16:48:11Z","department":[{"_id":"ToHe"}],"_id":"471","status":"public","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["15293785"]},"ec_funded":1,"volume":18,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1234"}]},"issue":"2","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds. "}],"intvolume":" 18","month":"05","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.05739"}],"scopus_import":1},{"page":"211 - 229","date_published":"2017-04-13T00:00:00Z","doi":"10.1142/S0218195916600050","date_created":"2018-12-11T11:46:43Z","has_accepted_license":"1","year":"2017","day":"13","publication":"International Journal of Computational Geometry and Applications","quality_controlled":"1","publisher":"World Scientific Publishing","oa":1,"acknowledgement":"Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15.","publist_id":"7338","author":[{"last_name":"Biedl","full_name":"Biedl, Therese","first_name":"Therese"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","last_name":"Huber","orcid":"0000-0002-8871-5814","full_name":"Huber, Stefan"},{"full_name":"Palfrader, Peter","last_name":"Palfrader","first_name":"Peter"}],"title":"Planar matchings for weighted straight skeletons","citation":{"mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:10.1142/S0218195916600050.","short":"T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229.","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 2017;26(3-4):211-229. doi:10.1142/S0218195916600050","apa":"Biedl, T., Huber, S., & Palfrader, P. (2017). Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. World Scientific Publishing. https://doi.org/10.1142/S0218195916600050","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications. World Scientific Publishing, 2017. https://doi.org/10.1142/S0218195916600050.","ista":"Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 26(3–4), 211–229."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":26,"related_material":{"record":[{"id":"10892","status":"public","relation":"earlier_version"}]},"issue":"3-4","publication_status":"published","file":[{"creator":"system","date_updated":"2020-07-14T12:46:35Z","file_size":769296,"date_created":"2018-12-12T10:09:34Z","file_name":"IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"4758","checksum":"f79e8558bfe4b368dfefeb8eec2e3a5e"}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"04","intvolume":" 26","abstract":[{"text":"We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.","lang":"eng"}],"oa_version":"Published Version","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:46:35Z","date_updated":"2023-02-21T16:06:22Z","ddc":["004","514","516"],"type":"journal_article","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","pubrep_id":"949","_id":"481"},{"ec_funded":1,"volume":21,"issue":"3","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["10950761"]},"intvolume":" 21","month":"01","main_file_link":[{"url":"https://arxiv.org/abs/1509.04631","open_access":"1"}],"scopus_import":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory."}],"department":[{"_id":"RoSe"}],"date_updated":"2021-01-12T08:00:58Z","status":"public","type":"journal_article","_id":"484","date_created":"2018-12-11T11:46:43Z","date_published":"2017-01-01T00:00:00Z","doi":"10.4310/ATMP.2017.v21.n3.a4","page":"683 - 738","publication":"Advances in Theoretical and Mathematical Physics","day":"01","year":"2017","oa":1,"quality_controlled":"1","publisher":"International Press","title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","author":[{"last_name":"Nam","full_name":"Nam, Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87","first_name":"Phan"},{"first_name":"Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","full_name":"Napiórkowski, Marcin M","last_name":"Napiórkowski"}],"publist_id":"7336","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a4.","ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738.","mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:10.4310/ATMP.2017.v21.n3.a4.","ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 683–738, 2017.","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 2017;21(3):683-738. doi:10.4310/ATMP.2017.v21.n3.a4","apa":"Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a4"},"project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27","call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}]},{"date_created":"2018-12-11T11:46:43Z","date_published":"2017-08-25T00:00:00Z","doi":"10.4310/ATMP.2017.v21.n3.a5","page":"739 - 800","publication":"Advances in Theoretical and Mathematical Physics","day":"25","year":"2017","oa":1,"publisher":"International Press","quality_controlled":"1","title":"Universality for a class of random band matrices","author":[{"last_name":"Bourgade","full_name":"Bourgade, Paul","first_name":"Paul"},{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng"},{"first_name":"Jun","full_name":"Yin, Jun","last_name":"Yin"}],"publist_id":"7337","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 739–800, doi:10.4310/ATMP.2017.v21.n3.a5.","apa":"Bourgade, P., Erdös, L., Yau, H., & Yin, J. (2017). Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a5","ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 2017;21(3):739-800. doi:10.4310/ATMP.2017.v21.n3.a5","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800.","ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 739–800, 2017.","chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a5.","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800."},"project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"}],"ec_funded":1,"volume":21,"issue":"3","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["10950761"]},"intvolume":" 21","month":"08","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.02312"}],"scopus_import":1,"oa_version":"Submitted Version","abstract":[{"text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices.","lang":"eng"}],"department":[{"_id":"LaEr"}],"date_updated":"2021-01-12T08:00:57Z","status":"public","type":"journal_article","_id":"483"},{"abstract":[{"text":"In this paper we study network architecture for unlicensed cellular networking for outdoor coverage in TV white spaces. The main technology proposed for TV white spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af is originally designed for improved indoor propagation. We show that long links, typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed terminal, and significantly reduce its efficiency. Instead, we propose CellFi, an alternative architecture based on LTE. LTE is designed for long-range coverage and throughput efficiency, but it is also designed to operate in tightly controlled and centrally managed networks. CellFi overcomes these problems by designing an LTE-compatible spectrum database component, mandatory for TV white space networking, and introducing an interference management component for distributed coordination. CellFi interference management is compatible with existing LTE mechanisms, requires no explicit communication between base stations, and is more efficient than CSMA for long links. We evaluate our design through extensive real world evaluation on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af, it increases coverage by 40% and reduces median flow completion times by 2.3x.","lang":"eng"}],"oa_version":"None","scopus_import":1,"quality_controlled":"1","publisher":"ACM","month":"11","publication_identifier":{"isbn":["978-145035422-6"]},"year":"2017","publication_status":"published","day":"28","publication":"Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies","language":[{"iso":"eng"}],"page":"2 - 14","date_published":"2017-11-28T00:00:00Z","doi":"10.1145/3143361.3143367","date_created":"2018-12-11T11:46:45Z","_id":"487","type":"conference","conference":{"location":"Incheon, South Korea","end_date":"2017-12-15","start_date":"2017-12-12","name":"CoNEXT: Conference on emerging Networking EXperiments and Technologies"},"status":"public","citation":{"ama":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards unlicensed cellular networks in TV white spaces. In: Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies. ACM; 2017:2-14. doi:10.1145/3143361.3143367","apa":"Baig, G., Radunovic, B., Alistarh, D.-A., Balkwill, M., Karagiannis, T., & Qiu, L. (2017). Towards unlicensed cellular networks in TV white spaces. In Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies (pp. 2–14). Incheon, South Korea: ACM. https://doi.org/10.1145/3143361.3143367","ieee":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L. Qiu, “Towards unlicensed cellular networks in TV white spaces,” in Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies, Incheon, South Korea, 2017, pp. 2–14.","short":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu, in:, Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14.","mla":"Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.” Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14, doi:10.1145/3143361.3143367.","ista":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. 2017. Towards unlicensed cellular networks in TV white spaces. Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies. CoNEXT: Conference on emerging Networking EXperiments and Technologies, 2–14.","chicago":"Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill, Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV White Spaces.” In Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, 2–14. ACM, 2017. https://doi.org/10.1145/3143361.3143367."},"date_updated":"2023-02-23T12:21:11Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7333","author":[{"last_name":"Baig","full_name":"Baig, Ghufran","first_name":"Ghufran"},{"full_name":"Radunovic, Bozidar","last_name":"Radunovic","first_name":"Bozidar"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Matthew","full_name":"Balkwill, Matthew","last_name":"Balkwill"},{"first_name":"Thomas","full_name":"Karagiannis, Thomas","last_name":"Karagiannis"},{"full_name":"Qiu, Lili","last_name":"Qiu","first_name":"Lili"}],"department":[{"_id":"DaAl"}],"title":"Towards unlicensed cellular networks in TV white spaces"},{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Orientation in space is represented in specialized brain circuits. Persistent head direction signals are transmitted from anterior thalamus to the presubiculum, but the identity of the presubicular target neurons, their connectivity and function in local microcircuits are unknown. Here, we examine how thalamic afferents recruit presubicular principal neurons and Martinotti interneurons, and the ensuing synaptic interactions between these cells. Pyramidal neuron activation of Martinotti cells in superficial layers is strongly facilitating such that high-frequency head directional stimulation efficiently unmutes synaptic excitation. Martinotti-cell feedback plays a dual role: precisely timed spikes may not inhibit the firing of in-tune head direction cells, while exerting lateral inhibition. Autonomous attractor dynamics emerge from a modelled network implementing wiring motifs and timing sensitive synaptic interactions in the pyramidal - Martinotti-cell feedback loop. This inhibitory microcircuit is therefore tuned to refine and maintain head direction information in the presubiculum."}],"month":"07","intvolume":" 8","scopus_import":1,"file":[{"date_created":"2018-12-12T10:14:31Z","file_name":"IST-2018-937-v1+1_2017_Stella_Activity_dependent.pdf","date_updated":"2020-07-14T12:46:36Z","file_size":2948357,"creator":"system","checksum":"76d8a2b72a58e56adb410ec37dfa7eee","file_id":"5083","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["20411723"]},"publication_status":"published","volume":8,"_id":"514","status":"public","pubrep_id":"937","type":"journal_article","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)"},"ddc":["571"],"date_updated":"2021-01-12T08:01:16Z","department":[{"_id":"JoCs"}],"file_date_updated":"2020-07-14T12:46:36Z","publisher":"Nature Publishing Group","quality_controlled":"1","oa":1,"day":"01","publication":"Nature Communications","has_accepted_license":"1","year":"2017","doi":"10.1038/ncomms16032","date_published":"2017-07-01T00:00:00Z","date_created":"2018-12-11T11:46:54Z","article_number":"16032","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"J. Simonnet, M. Nassar, F. Stella, I. Cohen, B. Mathon, C.N. Boccara, R. Miles, D. Fricker, Nature Communications 8 (2017).","ieee":"J. Simonnet et al., “Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum,” Nature Communications, vol. 8. Nature Publishing Group, 2017.","apa":"Simonnet, J., Nassar, M., Stella, F., Cohen, I., Mathon, B., Boccara, C. N., … Fricker, D. (2017). Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms16032","ama":"Simonnet J, Nassar M, Stella F, et al. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 2017;8. doi:10.1038/ncomms16032","mla":"Simonnet, Jean, et al. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” Nature Communications, vol. 8, 16032, Nature Publishing Group, 2017, doi:10.1038/ncomms16032.","ista":"Simonnet J, Nassar M, Stella F, Cohen I, Mathon B, Boccara CN, Miles R, Fricker D. 2017. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 8, 16032.","chicago":"Simonnet, Jean, Mérie Nassar, Federico Stella, Ivan Cohen, Bertrand Mathon, Charlotte N. Boccara, Richard Miles, and Desdemona Fricker. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms16032."},"title":"Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum","author":[{"last_name":"Simonnet","full_name":"Simonnet, Jean","first_name":"Jean"},{"full_name":"Nassar, Mérie","last_name":"Nassar","first_name":"Mérie"},{"full_name":"Stella, Federico","orcid":"0000-0001-9439-3148","last_name":"Stella","first_name":"Federico","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cohen, Ivan","last_name":"Cohen","first_name":"Ivan"},{"first_name":"Bertrand","full_name":"Mathon, Bertrand","last_name":"Mathon"},{"id":"3FC06552-F248-11E8-B48F-1D18A9856A87","first_name":"Charlotte","orcid":"0000-0001-7237-5109","full_name":"Boccara, Charlotte","last_name":"Boccara"},{"first_name":"Richard","full_name":"Miles, Richard","last_name":"Miles"},{"full_name":"Fricker, Desdemona","last_name":"Fricker","first_name":"Desdemona"}],"publist_id":"7305"},{"file":[{"file_size":4118385,"date_updated":"2020-07-14T12:46:36Z","creator":"lsazanov","file_name":"29893_2_merged_1501257589_red.pdf","date_created":"2019-11-07T12:51:07Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"9bc7e8c41b43636dd7566289e511f096","file_id":"6993"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["15459993"]},"publication_status":"published","issue":"10","volume":24,"ec_funded":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The oxidative phosphorylation electron transport chain (OXPHOS-ETC) of the inner mitochondrial membrane is composed of five large protein complexes, named CI-CV. These complexes convert energy from the food we eat into ATP, a small molecule used to power a multitude of essential reactions throughout the cell. OXPHOS-ETC complexes are organized into supercomplexes (SCs) of defined stoichiometry: CI forms a supercomplex with CIII2 and CIV (SC I+III2+IV, known as the respirasome), as well as with CIII2 alone (SC I+III2). CIII2 forms a supercomplex with CIV (SC III2+IV) and CV forms dimers (CV2). Recent cryo-EM studies have revealed the structures of SC I+III2+IV and SC I+III2. Furthermore, recent work has shed light on the assembly and function of the SCs. Here we review and compare these recent studies and discuss how they have advanced our understanding of mitochondrial electron transport."}],"month":"10","intvolume":" 24","scopus_import":1,"ddc":["572"],"date_updated":"2021-01-12T08:01:17Z","file_date_updated":"2020-07-14T12:46:36Z","department":[{"_id":"LeSa"}],"_id":"515","status":"public","article_type":"original","type":"journal_article","day":"05","publication":"Nature Structural and Molecular Biology","has_accepted_license":"1","year":"2017","date_published":"2017-10-05T00:00:00Z","doi":"10.1038/nsmb.3460","date_created":"2018-12-11T11:46:54Z","page":"800 - 808","publisher":"Nature Publishing Group","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Letts, James A., and Leonid A. Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature Structural and Molecular Biology, vol. 24, no. 10, Nature Publishing Group, 2017, pp. 800–08, doi:10.1038/nsmb.3460.","apa":"Letts, J. A., & Sazanov, L. A. (2017). Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. Nature Publishing Group. https://doi.org/10.1038/nsmb.3460","ama":"Letts JA, Sazanov LA. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 2017;24(10):800-808. doi:10.1038/nsmb.3460","ieee":"J. A. Letts and L. A. Sazanov, “Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain,” Nature Structural and Molecular Biology, vol. 24, no. 10. Nature Publishing Group, pp. 800–808, 2017.","short":"J.A. Letts, L.A. Sazanov, Nature Structural and Molecular Biology 24 (2017) 800–808.","chicago":"Letts, James A, and Leonid A Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature Structural and Molecular Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/nsmb.3460.","ista":"Letts JA, Sazanov LA. 2017. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 24(10), 800–808."},"title":"Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain","author":[{"orcid":"0000-0002-9864-3586","full_name":"Letts, James A","last_name":"Letts","id":"322DA418-F248-11E8-B48F-1D18A9856A87","first_name":"James A"},{"first_name":"Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","full_name":"Sazanov, Leonid A","last_name":"Sazanov"}],"publist_id":"7304","project":[{"_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","grant_number":"701309"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:01:16Z","citation":{"ista":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. 2017. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2(4), 043904.","chicago":"Klotz, Lukasz, Grégoire M Lemoult, Idalia Frontczak, Laurette Tuckerman, and José Wesfreid. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids. American Physical Society, 2017. https://doi.org/10.1103/PhysRevFluids.2.043904.","ieee":"L. Klotz, G. M. Lemoult, I. Frontczak, L. Tuckerman, and J. Wesfreid, “Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence,” Physical Review Fluids, vol. 2, no. 4. American Physical Society, 2017.","short":"L. Klotz, G.M. Lemoult, I. Frontczak, L. Tuckerman, J. Wesfreid, Physical Review Fluids 2 (2017).","apa":"Klotz, L., Lemoult, G. M., Frontczak, I., Tuckerman, L., & Wesfreid, J. (2017). Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. American Physical Society. https://doi.org/10.1103/PhysRevFluids.2.043904","ama":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2017;2(4). doi:10.1103/PhysRevFluids.2.043904","mla":"Klotz, Lukasz, et al. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids, vol. 2, no. 4, 043904, American Physical Society, 2017, doi:10.1103/PhysRevFluids.2.043904."},"title":"Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence","department":[{"_id":"BjHo"}],"publist_id":"7306","author":[{"first_name":"Lukasz","id":"2C9AF1C2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1740-7635","full_name":"Klotz, Lukasz","last_name":"Klotz"},{"id":"4787FE80-F248-11E8-B48F-1D18A9856A87","first_name":"Grégoire M","last_name":"Lemoult","full_name":"Lemoult, Grégoire M"},{"full_name":"Frontczak, Idalia","last_name":"Frontczak","first_name":"Idalia"},{"last_name":"Tuckerman","full_name":"Tuckerman, Laurette","first_name":"Laurette"},{"last_name":"Wesfreid","full_name":"Wesfreid, José","first_name":"José"}],"article_number":"043904","_id":"513","status":"public","type":"journal_article","publication":"Physical Review Fluids","language":[{"iso":"eng"}],"day":"01","year":"2017","publication_status":"published","date_created":"2018-12-11T11:46:54Z","date_published":"2017-04-01T00:00:00Z","issue":"4","volume":2,"doi":"10.1103/PhysRevFluids.2.043904","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present an experimental setup that creates a shear flow with zero mean advection velocity achieved by counterbalancing the nonzero streamwise pressure gradient by moving boundaries, which generates plane Couette-Poiseuille flow. We obtain experimental results in the transitional regime for this flow. Using flow visualization, we characterize the subcritical transition to turbulence in Couette-Poiseuille flow and show the existence of turbulent spots generated by a permanent perturbation. Due to the zero mean advection velocity of the base profile, these turbulent structures are nearly stationary. We distinguish two regions of the turbulent spot: the active turbulent core, which is characterized by waviness of the streaks similar to traveling waves, and the surrounding region, which includes in addition the weak undisturbed streaks and oblique waves at the laminar-turbulent interface. We also study the dependence of the size of these two regions on Reynolds number. Finally, we show that the traveling waves move in the downstream (Poiseuille) direction."}],"intvolume":" 2","month":"04","main_file_link":[{"url":"https://arxiv.org/abs/1704.02619","open_access":"1"}],"oa":1,"quality_controlled":"1","scopus_import":1,"publisher":"American Physical Society"},{"department":[{"_id":"ToBo"}],"date_updated":"2021-01-12T08:01:21Z","status":"public","type":"journal_article","article_type":"letter_note","_id":"520","issue":"3","volume":6,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["21615063"]},"publication_status":"published","month":"03","intvolume":" 6","scopus_import":1,"oa_version":"None","pmid":1,"abstract":[{"lang":"eng","text":"Cyanobacteria are mostly engineered to be sustainable cell-factories by genetic manipulations alone. Here, by modulating the concentration of allosteric effectors, we focus on increasing product formation without further burdening the cells with increased expression of enzymes. Resorting to a novel 96-well microplate cultivation system for cyanobacteria, and using lactate-producing strains of Synechocystis PCC6803 expressing different l-lactate dehydrogenases (LDH), we titrated the effect of 2,5-anhydro-mannitol supplementation. The latter acts in cells as a nonmetabolizable analogue of fructose 1,6-bisphosphate, a known allosteric regulator of one of the tested LDHs. In this strain (SAA023), we achieved over 2-fold increase of lactate productivity. Furthermore, we observed that as carbon is increasingly deviated during growth toward product formation, there is an increased fixation rate in the population of spontaneous mutants harboring an impaired production pathway. This is a challenge in the development of green cell factories, which may be countered by the incorporation in biotechnological processes of strategies such as the one pioneered here."}],"title":"Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803","publist_id":"7298","author":[{"full_name":"Du, Wei","last_name":"Du","first_name":"Wei"},{"full_name":"Angermayr, Andreas","orcid":"0000-0001-8619-2223","last_name":"Angermayr","id":"4677C796-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"last_name":"Jongbloets","full_name":"Jongbloets, Joeri","first_name":"Joeri"},{"last_name":"Molenaar","full_name":"Molenaar, Douwe","first_name":"Douwe"},{"last_name":"Bachmann","full_name":"Bachmann, Herwig","first_name":"Herwig"},{"last_name":"Hellingwerf","full_name":"Hellingwerf, Klaas","first_name":"Klaas"},{"first_name":"Filipe","last_name":"Branco Dos Santos","full_name":"Branco Dos Santos, Filipe"}],"external_id":{"pmid":["27936615"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"W. Du et al., “Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803,” ACS Synthetic Biology, vol. 6, no. 3. American Chemical Society, pp. 395–401, 2017.","short":"W. Du, A. Angermayr, J. Jongbloets, D. Molenaar, H. Bachmann, K. Hellingwerf, F. Branco Dos Santos, ACS Synthetic Biology 6 (2017) 395–401.","apa":"Du, W., Angermayr, A., Jongbloets, J., Molenaar, D., Bachmann, H., Hellingwerf, K., & Branco Dos Santos, F. (2017). Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic Biology. American Chemical Society. https://doi.org/10.1021/acssynbio.6b00235","ama":"Du W, Angermayr A, Jongbloets J, et al. Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic Biology. 2017;6(3):395-401. doi:10.1021/acssynbio.6b00235","mla":"Du, Wei, et al. “Nonhierarchical Flux Regulation Exposes the Fitness Burden Associated with Lactate Production in Synechocystis Sp. PCC6803.” ACS Synthetic Biology, vol. 6, no. 3, American Chemical Society, 2017, pp. 395–401, doi:10.1021/acssynbio.6b00235.","ista":"Du W, Angermayr A, Jongbloets J, Molenaar D, Bachmann H, Hellingwerf K, Branco Dos Santos F. 2017. Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic Biology. 6(3), 395–401.","chicago":"Du, Wei, Andreas Angermayr, Joeri Jongbloets, Douwe Molenaar, Herwig Bachmann, Klaas Hellingwerf, and Filipe Branco Dos Santos. “Nonhierarchical Flux Regulation Exposes the Fitness Burden Associated with Lactate Production in Synechocystis Sp. PCC6803.” ACS Synthetic Biology. American Chemical Society, 2017. https://doi.org/10.1021/acssynbio.6b00235."},"date_published":"2017-03-17T00:00:00Z","doi":"10.1021/acssynbio.6b00235","date_created":"2018-12-11T11:46:56Z","page":"395 - 401","day":"17","publication":"ACS Synthetic Biology","year":"2017","quality_controlled":"1","publisher":"American Chemical Society"},{"status":"public","type":"journal_article","_id":"521","department":[{"_id":"HeEd"}],"title":"Higson compactification and dimension raising","author":[{"first_name":"Kyle","full_name":"Austin, Kyle","last_name":"Austin"},{"id":"2E36B656-F248-11E8-B48F-1D18A9856A87","first_name":"Ziga","full_name":"Virk, Ziga","last_name":"Virk"}],"publist_id":"7299","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:01:21Z","citation":{"mla":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” Topology and Its Applications, vol. 215, Elsevier, 2017, pp. 45–57, doi:10.1016/j.topol.2016.10.005.","short":"K. Austin, Z. Virk, Topology and Its Applications 215 (2017) 45–57.","ieee":"K. Austin and Z. Virk, “Higson compactification and dimension raising,” Topology and its Applications, vol. 215. Elsevier, pp. 45–57, 2017.","ama":"Austin K, Virk Z. Higson compactification and dimension raising. Topology and its Applications. 2017;215:45-57. doi:10.1016/j.topol.2016.10.005","apa":"Austin, K., & Virk, Z. (2017). Higson compactification and dimension raising. Topology and Its Applications. Elsevier. https://doi.org/10.1016/j.topol.2016.10.005","chicago":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” Topology and Its Applications. Elsevier, 2017. https://doi.org/10.1016/j.topol.2016.10.005.","ista":"Austin K, Virk Z. 2017. Higson compactification and dimension raising. Topology and its Applications. 215, 45–57."},"intvolume":" 215","month":"01","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1608.03954v1","open_access":"1"}],"quality_controlled":"1","publisher":"Elsevier","oa_version":"Submitted Version","abstract":[{"text":"Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems hold in large scale; that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely n-to-1 maps, which include the natural quotient maps via a finite group action, and prove that they preserve the asymptotic dimension.","lang":"eng"}],"date_created":"2018-12-11T11:46:56Z","doi":"10.1016/j.topol.2016.10.005","date_published":"2017-01-01T00:00:00Z","volume":215,"page":"45 - 57","language":[{"iso":"eng"}],"publication":"Topology and its Applications","day":"01","publication_status":"published","year":"2017","publication_identifier":{"issn":["01668641"]}},{"month":"06","intvolume":" 58","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.07907"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case."}],"issue":"4","related_material":{"record":[{"relation":"earlier_version","id":"1379","status":"public"}]},"volume":58,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["01795376"]},"publication_status":"published","status":"public","article_type":"original","type":"journal_article","_id":"534","department":[{"_id":"UlWa"}],"date_updated":"2023-02-21T17:01:34Z","quality_controlled":"1","publisher":"Springer","oa":1,"doi":"10.1007/s00454-017-9900-0","date_published":"2017-06-09T00:00:00Z","date_created":"2018-12-11T11:47:01Z","page":"871 - 888","day":"09","publication":"Discrete & Computational Geometry","year":"2017","title":"Finding non-orientable surfaces in 3-Manifolds","author":[{"last_name":"Burton","full_name":"Burton, Benjamin","first_name":"Benjamin"},{"id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","first_name":"Arnaud N","last_name":"De Mesmay","full_name":"De Mesmay, Arnaud N"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner"}],"publist_id":"7283","article_processing_charge":"No","external_id":{"arxiv":["1602.07907"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 58(4), 871–888.","chicago":"Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds.” Discrete & Computational Geometry. Springer, 2017. https://doi.org/10.1007/s00454-017-9900-0.","ama":"Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 2017;58(4):871-888. doi:10.1007/s00454-017-9900-0","apa":"Burton, B., de Mesmay, A. N., & Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9900-0","ieee":"B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” Discrete & Computational Geometry, vol. 58, no. 4. Springer, pp. 871–888, 2017.","short":"B. Burton, A.N. de Mesmay, U. Wagner, Discrete & Computational Geometry 58 (2017) 871–888.","mla":"Burton, Benjamin, et al. “Finding Non-Orientable Surfaces in 3-Manifolds.” Discrete & Computational Geometry, vol. 58, no. 4, Springer, 2017, pp. 871–88, doi:10.1007/s00454-017-9900-0."}},{"publication_status":"published","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5007","checksum":"d66fee867e7cdbfa3fe276c2fb0778bb","file_size":1668557,"date_updated":"2020-07-14T12:46:39Z","creator":"system","file_name":"IST-2018-932-v1+1_Kainrath_et_al-2017-Angewandte_Chemie.pdf","date_created":"2018-12-12T10:13:24Z"}],"language":[{"iso":"eng"}],"issue":"16","volume":129,"ec_funded":1,"abstract":[{"lang":"ger","text":"Optogenetik und Photopharmakologie ermöglichen präzise räumliche und zeitliche Kontrolle von Proteinwechselwirkung und -funktion in Zellen und Tieren. Optogenetische Methoden, die auf grünes Licht ansprechen und zum Trennen von Proteinkomplexen geeignet sind, sind nichtweitläufig verfügbar, würden jedoch mehrfarbige Experimente zur Beantwortung von biologischen Fragestellungen ermöglichen. Hier demonstrieren wir die Verwendung von Cobalamin(Vitamin B12)-bindenden Domänen von bakteriellen CarH-Transkriptionsfaktoren zur Grünlicht-induzierten Dissoziation von Rezeptoren. Fusioniert mit dem Fibroblasten-W achstumsfaktor-Rezeptor 1 führten diese im Dunkeln in kultivierten Zellen zu Signalaktivität durch Oligomerisierung, welche durch Beleuchten umgehend aufgehoben wurde. In Zebrafischembryonen, die einen derartigen Rezeptor exprimieren, ermöglichte grünes Licht die Kontrolle über abnormale Signalaktivität während der Embryonalentwicklung. "}],"oa_version":"Published Version","month":"05","intvolume":" 129","date_updated":"2021-01-12T08:01:33Z","ddc":["571"],"file_date_updated":"2020-07-14T12:46:39Z","department":[{"_id":"CaGu"},{"_id":"HaJa"}],"_id":"538","type":"journal_article","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","pubrep_id":"932","has_accepted_license":"1","year":"2017","day":"20","publication":"Angewandte Chemie","page":"4679 - 4682","doi":"10.1002/ange.201611998","date_published":"2017-05-20T00:00:00Z","date_created":"2018-12-11T11:47:02Z","quality_controlled":"1","publisher":"Wiley","oa":1,"citation":{"mla":"Kainrath, Stephanie, et al. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” Angewandte Chemie, vol. 129, no. 16, Wiley, 2017, pp. 4679–82, doi:10.1002/ange.201611998.","apa":"Kainrath, S., Stadler, M., Gschaider-Reichhart, E., Distel, M., & Janovjak, H. L. (2017). Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. Wiley. https://doi.org/10.1002/ange.201611998","ama":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 2017;129(16):4679-4682. doi:10.1002/ange.201611998","ieee":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, and H. L. Janovjak, “Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen,” Angewandte Chemie, vol. 129, no. 16. Wiley, pp. 4679–4682, 2017.","short":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, H.L. Janovjak, Angewandte Chemie 129 (2017) 4679–4682.","chicago":"Kainrath, Stephanie, Manuela Stadler, Eva Gschaider-Reichhart, Martin Distel, and Harald L Janovjak. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” Angewandte Chemie. Wiley, 2017. https://doi.org/10.1002/ange.201611998.","ista":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. 2017. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 129(16), 4679–4682."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7279","author":[{"first_name":"Stephanie","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","last_name":"Kainrath","full_name":"Kainrath, Stephanie"},{"first_name":"Manuela","last_name":"Stadler","full_name":"Stadler, Manuela"},{"first_name":"Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7218-7738","full_name":"Gschaider-Reichhart, Eva","last_name":"Gschaider-Reichhart"},{"full_name":"Distel, Martin","last_name":"Distel","first_name":"Martin"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","first_name":"Harald L","last_name":"Janovjak","full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315"}],"title":"Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen","project":[{"grant_number":"303564","name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7","_id":"25548C20-B435-11E9-9278-68D0E5697425"},{"name":"Molecular Drug Targets","grant_number":"W1232-B24","call_identifier":"FWF","_id":"255A6082-B435-11E9-9278-68D0E5697425"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Khamina, K., Lercher, A., Caldera, M., Schliehe, C., Vilagos, B., Sahin, M., … Bergthaler, A. (2017). Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. Public Library of Science. https://doi.org/10.1371/journal.ppat.1006758","ama":"Khamina K, Lercher A, Caldera M, et al. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 2017;13(12). doi:10.1371/journal.ppat.1006758","ieee":"K. Khamina et al., “Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein,” PLoS Pathogens, vol. 13, no. 12. Public Library of Science, 2017.","short":"K. Khamina, A. Lercher, M. Caldera, C. Schliehe, B. Vilagos, M. Sahin, L. Kosack, A. Bhattacharya, P. Májek, A. Stukalov, R. Sacco, L. James, D. Pinschewer, K. Bennett, J. Menche, A. Bergthaler, PLoS Pathogens 13 (2017).","mla":"Khamina, Kseniya, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens, vol. 13, no. 12, e1006758, Public Library of Science, 2017, doi:10.1371/journal.ppat.1006758.","ista":"Khamina K, Lercher A, Caldera M, Schliehe C, Vilagos B, Sahin M, Kosack L, Bhattacharya A, Májek P, Stukalov A, Sacco R, James L, Pinschewer D, Bennett K, Menche J, Bergthaler A. 2017. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 13(12), e1006758.","chicago":"Khamina, Kseniya, Alexander Lercher, Michael Caldera, Christopher Schliehe, Bojan Vilagos, Mehmet Sahin, Lindsay Kosack, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens. Public Library of Science, 2017. https://doi.org/10.1371/journal.ppat.1006758."},"title":"Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein","publist_id":"7276","author":[{"first_name":"Kseniya","full_name":"Khamina, Kseniya","last_name":"Khamina"},{"last_name":"Lercher","full_name":"Lercher, Alexander","first_name":"Alexander"},{"first_name":"Michael","last_name":"Caldera","full_name":"Caldera, Michael"},{"full_name":"Schliehe, Christopher","last_name":"Schliehe","first_name":"Christopher"},{"first_name":"Bojan","full_name":"Vilagos, Bojan","last_name":"Vilagos"},{"first_name":"Mehmet","last_name":"Sahin","full_name":"Sahin, Mehmet"},{"last_name":"Kosack","full_name":"Kosack, Lindsay","first_name":"Lindsay"},{"first_name":"Anannya","last_name":"Bhattacharya","full_name":"Bhattacharya, Anannya"},{"first_name":"Peter","last_name":"Májek","full_name":"Májek, Peter"},{"full_name":"Stukalov, Alexey","last_name":"Stukalov","first_name":"Alexey"},{"last_name":"Sacco","full_name":"Sacco, Roberto","id":"42C9F57E-F248-11E8-B48F-1D18A9856A87","first_name":"Roberto"},{"full_name":"James, Leo","last_name":"James","first_name":"Leo"},{"first_name":"Daniel","full_name":"Pinschewer, Daniel","last_name":"Pinschewer"},{"full_name":"Bennett, Keiryn","last_name":"Bennett","first_name":"Keiryn"},{"full_name":"Menche, Jörg","last_name":"Menche","first_name":"Jörg"},{"full_name":"Bergthaler, Andreas","last_name":"Bergthaler","first_name":"Andreas"}],"article_number":"e1006758","publication":"PLoS Pathogens","day":"01","year":"2017","has_accepted_license":"1","date_created":"2018-12-11T11:47:03Z","date_published":"2017-12-01T00:00:00Z","doi":"10.1371/journal.ppat.1006758","oa":1,"publisher":"Public Library of Science","quality_controlled":"1","ddc":["576","616"],"date_updated":"2021-01-12T08:01:48Z","file_date_updated":"2020-07-14T12:46:44Z","department":[{"_id":"GaNo"}],"_id":"540","pubrep_id":"931","status":"public","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)"},"type":"journal_article","language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:46:44Z","file_size":4106772,"creator":"system","date_created":"2018-12-12T10:12:26Z","file_name":"IST-2018-931-v1+1_journal.ppat.1006758.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"1aa20f19a1e90664fadce6e7d5284fdc","file_id":"4944"}],"publication_status":"published","publication_identifier":{"issn":["15537366"]},"issue":"12","volume":13,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"RNA-dependent RNA polymerases (RdRps) play a key role in the life cycle of RNA viruses and impact their immunobiology. The arenavirus lymphocytic choriomeningitis virus (LCMV) strain Clone 13 provides a benchmark model for studying chronic infection. A major genetic determinant for its ability to persist maps to a single amino acid exchange in the viral L protein, which exhibits RdRp activity, yet its functional consequences remain elusive. To unravel the L protein interactions with the host proteome, we engineered infectious L protein-tagged LCMV virions by reverse genetics. A subsequent mass-spectrometric analysis of L protein pulldowns from infected human cells revealed a comprehensive network of interacting host proteins. The obtained LCMV L protein interactome was bioinformatically integrated with known host protein interactors of RdRps from other RNA viruses, emphasizing interconnected modules of human proteins. Functional characterization of selected interactors highlighted proviral (DDX3X) as well as antiviral (NKRF, TRIM21) host factors. To corroborate these findings, we infected Trim21-/-mice with LCMV and found impaired virus control in chronic infection. These results provide insights into the complex interactions of the arenavirus LCMV and other viral RdRps with the host proteome and contribute to a better molecular understanding of how chronic viruses interact with their host."}],"intvolume":" 13","month":"12","scopus_import":1},{"has_accepted_license":"1","year":"2017","day":"03","publication":"Logical Methods in Computer Science","date_published":"2017-07-03T00:00:00Z","doi":"10.23638/LMCS-13(2:15)2017","date_created":"2018-12-11T11:46:38Z","quality_controlled":"1","publisher":"International Federation of Computational Logic","oa":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.","apa":"Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 2017;13(2). doi:10.23638/LMCS-13(2:15)2017","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2. International Federation of Computational Logic, 2017.","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(2:15)2017.","ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7355","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Křetínská","full_name":"Křetínská, Zuzana","first_name":"Zuzana"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881"}],"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","article_number":"15","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","grant_number":"701309"}],"publication_identifier":{"issn":["18605974"]},"publication_status":"published","file":[{"creator":"system","file_size":511832,"date_updated":"2020-07-14T12:46:33Z","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf","date_created":"2018-12-12T10:18:32Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"bfa405385ec6229ad5ead89ab5751639","file_id":"5354"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"earlier_version","id":"1657","status":"public"},{"status":"public","id":"5429","relation":"earlier_version"},{"relation":"earlier_version","id":"5435","status":"public"}]},"volume":13,"issue":"2","ec_funded":1,"abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"oa_version":"Published Version","scopus_import":1,"month":"07","intvolume":" 13","date_updated":"2023-02-23T12:26:16Z","ddc":["004"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:33Z","_id":"466","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"status":"public","pubrep_id":"957"},{"ec_funded":1,"related_material":{"record":[{"status":"public","id":"1656","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5415"},{"relation":"earlier_version","id":"5436","status":"public"}]},"issue":"4","volume":18,"publication_status":"published","publication_identifier":{"issn":["15293785"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1606.03598","open_access":"1"}],"scopus_import":1,"intvolume":" 18","month":"12","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"oa_version":"Preprint","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2023-02-23T12:26:19Z","type":"journal_article","status":"public","_id":"467","date_created":"2018-12-11T11:46:38Z","doi":"10.1145/3152769","date_published":"2017-12-01T00:00:00Z","year":"2017","publication":"ACM Transactions on Computational Logic (TOCL)","day":"01","oa":1,"quality_controlled":"1","publisher":"ACM","external_id":{"arxiv":["1606.03598"]},"publist_id":"7354","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}],"title":"Nested weighted automata","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"article_number":"31"},{"scopus_import":1,"intvolume":" 13","month":"09","abstract":[{"text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. ","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"volume":13,"issue":"3","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1610"},{"status":"public","id":"5438","relation":"earlier_version"}]},"publication_status":"published","publication_identifier":{"issn":["18605974"]},"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2015-321-v1+1_main.pdf","date_created":"2018-12-12T10:14:37Z","file_size":279071,"date_updated":"2020-07-14T12:46:33Z","creator":"system","checksum":"08041379ba408d40664f449eb5907a8f","file_id":"5090","content_type":"application/pdf","relation":"main_file","access_level":"open_access"},{"date_created":"2018-12-12T10:14:38Z","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","creator":"system","date_updated":"2020-07-14T12:46:33Z","file_size":279071,"checksum":"08041379ba408d40664f449eb5907a8f","file_id":"5091","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"type":"journal_article","pubrep_id":"955","status":"public","_id":"465","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:46:33Z","date_updated":"2023-02-23T12:26:25Z","ddc":["004"],"oa":1,"publisher":"International Federation of Computational Logic","quality_controlled":"1","date_created":"2018-12-11T11:46:37Z","date_published":"2017-09-13T00:00:00Z","doi":"10.23638/LMCS-13(3:23)2017","year":"2017","has_accepted_license":"1","publication":"Logical Methods in Computer Science","day":"13","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publist_id":"7356","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"},{"first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}],"title":"Edit distance for pushdown automata","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"citation":{"ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w.","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-017-00107-w","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 2017;7(1). doi:10.1038/s41598-017-00107-w","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017).","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1. Nature Publishing Group, 2017.","mla":"Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports, vol. 7, no. 1, 82, Nature Publishing Group, 2017, doi:10.1038/s41598-017-00107-w."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","last_name":"Tkadlec"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"publist_id":"7307","article_processing_charge":"No","title":"Amplification on undirected population structures: Comets beat stars","article_number":"82","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"has_accepted_license":"1","year":"2017","day":"06","publication":"Scientific Reports","doi":"10.1038/s41598-017-00107-w","date_published":"2017-03-06T00:00:00Z","date_created":"2018-12-11T11:46:53Z","publisher":"Nature Publishing Group","quality_controlled":"1","oa":1,"date_updated":"2023-02-23T12:26:57Z","ddc":["004"],"file_date_updated":"2020-07-14T12:46:36Z","department":[{"_id":"KrCh"}],"_id":"512","type":"journal_article","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","pubrep_id":"938","publication_identifier":{"issn":["20452322"]},"publication_status":"published","file":[{"creator":"system","file_size":1536783,"date_updated":"2020-07-14T12:46:36Z","file_name":"IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf","date_created":"2018-12-12T10:18:35Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5357","checksum":"7d05cbdd914e194a019c0f91fb64e9a8"}],"language":[{"iso":"eng"}],"volume":7,"issue":"1","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5449"}]},"ec_funded":1,"abstract":[{"text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Cometswarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively. ","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"month":"03","intvolume":" 7"},{"article_number":"30","project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 30, Association for Computing Machinery, 2017, doi:10.1145/3158118.","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017).","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158118","apa":"Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158118","chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158118.","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2(POPL), 30."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","external_id":{"arxiv":["1910.00241"]},"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Choudhary","full_name":"Choudhary, Bhavya","first_name":"Bhavya"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"}],"title":"Optimal Dyck reachability for data-dependence and Alias analysis","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant (279307: Graph Games).\r\n","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","year":"2017","has_accepted_license":"1","publication":"Proceedings of the ACM on Programming Languages","day":"27","date_created":"2021-12-05T23:01:48Z","date_published":"2017-12-27T00:00:00Z","doi":"10.1145/3158118","_id":"10416","conference":{"name":"POPL: Programming Languages","end_date":"2018-01-13","location":"Los Angeles, CA, United States","start_date":"2018-01-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)"},"type":"journal_article","article_type":"original","status":"public","date_updated":"2023-02-23T12:27:13Z","ddc":["000"],"file_date_updated":"2021-12-07T08:06:28Z","department":[{"_id":"KrCh"}],"abstract":[{"text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths whose parentheses are properly matched. We present new results for Dyck reachability problems with applications to alias analysis and data-dependence analysis. Our main contributions, that include improved upper bounds as well as lower bounds that establish optimality guarantees, are as follows: First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph with n nodes and m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)), where α(n) is the inverse Ackermann function, improving the previously known O(n2) time bound; (ii) a matching lower bound that shows that our algorithm is optimal wrt to worst-case complexity; and (iii) an optimal average-case upper bound of O(m) time, improving the previously known O(m · logn) bound. Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtain analysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is only linear, and only wrt the number of call sites. Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication, which is a long-standing open problem. Thus we establish that the existing combinatorial algorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the same hardness holds for graphs of constant treewidth. Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependence analysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform all existing methods on the two problems, over real-world benchmarks.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 2","month":"12","publication_status":"published","publication_identifier":{"eissn":["2475-1421"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2021-12-07T08:06:28Z","file_size":460188,"creator":"cchlebak","date_created":"2021-12-07T08:06:28Z","file_name":"2017_ACMProgLang_Chatterjee.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"10421","checksum":"faa3f7b3fe8aab84b50ed805c26a0ee5","success":1}],"ec_funded":1,"volume":2,"issue":"POPL","related_material":{"record":[{"status":"public","id":"5455","relation":"earlier_version"}]}},{"citation":{"mla":"Chatterjee, Krishnendu, et al. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017, doi:10.15479/AT:IST-2017-870-v1-1.","apa":"Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria; 2017. doi:10.15479/AT:IST-2017-870-v1-1","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017.","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.","chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-870-v1-1.","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Choudhary","full_name":"Choudhary, Bhavya","first_name":"Bhavya"},{"last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","title":"Optimal Dyck reachability for data-dependence and alias analysis","has_accepted_license":"1","year":"2017","day":"23","page":"37","doi":"10.15479/AT:IST-2017-870-v1-1","date_published":"2017-10-23T00:00:00Z","date_created":"2018-12-12T11:39:26Z","publisher":"IST Austria","oa":1,"date_updated":"2023-02-21T15:54:10Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:59Z","_id":"5455","type":"technical_report","status":"public","pubrep_id":"870","publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","file":[{"file_name":"IST-2017-870-v1+1_main.pdf","date_created":"2018-12-12T11:54:02Z","creator":"system","file_size":960491,"date_updated":"2020-07-14T12:46:59Z","checksum":"177a84a46e3ac17e87b31534ad16a4c9","file_id":"5524","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"10416"}]},"abstract":[{"lang":"eng","text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graphwhere the edges are labeled with different types of opening and closing parentheses, and the reachabilityinformation is computed via paths whose parentheses are properly matched. We present new results for Dyckreachability problems with applications to alias analysis and data-dependence analysis. Our main contributions,that include improved upper bounds as well as lower bounds that establish optimality guarantees, are asfollows:First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph withnnodes andmedges, we present: (i) an algorithmwith worst-case running timeO(m+n·α(n)), whereα(n)is the inverse Ackermann function, improving thepreviously knownO(n2)time bound; (ii) a matching lower bound that shows that our algorithm is optimalwrt to worst-case complexity; and (iii) an optimal average-case upper bound ofO(m)time, improving thepreviously knownO(m·logn)bound.Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtainanalysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almostlinear time, after which the contribution of the library in the complexity of the client analysis is only linear,and only wrt the number of call sites.Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean MatrixMultiplication, which is a long-standing open problem. Thus we establish that the existing combinatorialalgorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the samehardness holds for graphs of constant treewidth.Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependenceanalysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform allexisting methods on the two problems, over real-world benchmarks."}],"oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"month":"10"},{"title":"Implementing the institutional data repository IST DataRep","file_date_updated":"2020-07-14T12:46:59Z","department":[{"_id":"E-Lib"}],"author":[{"last_name":"Petritsch","orcid":"0000-0003-2724-4614","full_name":"Barbara Petritsch","first_name":"Barbara","id":"406048EC-F248-11E8-B48F-1D18A9856A87"}],"extern":0,"citation":{"ista":"Petritsch B. 2017. Implementing the institutional data repository IST DataRep, IST Austria,p.","chicago":"Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep. IST Austria, 2017.","ieee":"B. Petritsch, Implementing the institutional data repository IST DataRep. IST Austria, 2017.","short":"B. Petritsch, Implementing the Institutional Data Repository IST DataRep, IST Austria, 2017.","apa":"Petritsch, B. (2017). Implementing the institutional data repository IST DataRep. IST Austria.","ama":"Petritsch B. Implementing the Institutional Data Repository IST DataRep. IST Austria; 2017.","mla":"Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep. IST Austria, 2017."},"date_updated":"2020-07-14T23:05:03Z","pubrep_id":"724","status":"public","type":"report","_id":"5450","date_created":"2018-12-12T11:39:24Z","date_published":"2017-06-26T00:00:00Z","publication_date":"2017-06-26","file":[{"file_name":"IST-2017-724-v1+1_DataRep_Project_Report_2017.pdf","date_created":"2018-12-12T11:53:22Z","creator":"system","file_size":3460985,"date_updated":"2020-07-14T12:46:59Z","checksum":"6321792dcfa82bf490f17615a9b22355","file_id":"5483","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"day":"26","year":"2017","month":"06","oa":1,"main_file_link":[{"open_access":"1","url":"https://repository.ist.ac.at/id/eprint/724."}],"publisher":"IST Austria","abstract":[{"text":"In this report the implementation of the institutional data repository IST DataRep at IST Austria will be covered: Starting with the research phase when requirements for a repository were established, the procedure of choosing a repository-software and its customization based on the results of user-testings will be discussed. Followed by reflections on the marketing strategies in regard of impact, and at the end sharing some experiences of one year operating IST DataRep.","lang":"eng"}]},{"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF\r\nNFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Czech\r\nScience Foundation grant GBP202/12/G061.","oa":1,"publisher":"Association for Computing Machinery","quality_controlled":"1","publication":"Proceedings of the ACM on Programming Languages","day":"27","year":"2017","date_created":"2021-12-05T23:01:49Z","date_published":"2017-12-27T00:00:00Z","doi":"10.1145/3158119","article_number":"31","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2017).","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158119","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158119","mla":"Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 31, Association for Computing Machinery, 2017, doi:10.1145/3158119.","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2(POPL), 31.","chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158119."},"title":"Data-centric dynamic partial order reduction","external_id":{"arxiv":["1610.01188"]},"article_processing_charge":"No","author":[{"first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"},{"first_name":"Nishant","full_name":"Sinha, Nishant","last_name":"Sinha"},{"first_name":"Kapil","full_name":"Vaidya, Kapil","last_name":"Vaidya"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\n\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence."}],"intvolume":" 2","month":"12","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/10.1145/3158119"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2475-1421"]},"ec_funded":1,"related_material":{"record":[{"status":"public","id":"5448","relation":"earlier_version"},{"status":"public","id":"5456","relation":"earlier_version"}]},"issue":"POPL","volume":2,"_id":"10417","status":"public","conference":{"name":"POPL: Programming Languages","start_date":"2018-01-07","location":"Los Angeles, CA, United States","end_date":"2018-01-13"},"type":"journal_article","article_type":"original","date_updated":"2023-02-23T12:27:16Z","department":[{"_id":"KrCh"}]},{"_id":"5456","status":"public","pubrep_id":"872","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"citation":{"ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-Centric Dynamic Partial Order Reduction. IST Austria; 2017. doi:10.15479/AT:IST-2017-872-v1-1","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria. https://doi.org/10.15479/AT:IST-2017-872-v1-1","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.","mla":"Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017, doi:10.15479/AT:IST-2017-872-v1-1.","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p.","chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1."},"date_updated":"2023-02-23T12:26:54Z","title":"Data-centric dynamic partial order reduction","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:59Z","author":[{"first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"first_name":"Nishant","full_name":"Sinha, Nishant","last_name":"Sinha"},{"last_name":"Vaidya","full_name":"Vaidya, Kapil","first_name":"Kapil"}],"oa_version":"Published Version","abstract":[{"text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.\r\n1. For acyclic architectures, our algorithm is guaranteed to explore exactly one representative trace from each observation class, while spending polynomial time per class. Hence, our algorithm is optimal wrt the observation equivalence, and in several cases explores exponentially fewer traces than any enumerative method based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider an equivalence between traces which is finer than the observation equivalence; but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence. \r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show a significant reduction in both running time and the number of explored equivalence classes.","lang":"eng"}],"month":"10","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"oa":1,"file":[{"date_created":"2018-12-12T11:53:26Z","file_name":"IST-2017-872-v1+1_main.pdf","creator":"system","date_updated":"2020-07-14T12:46:59Z","file_size":910347,"file_id":"5487","checksum":"d2635c4cf013000f0a1b09e80f9e4ab7","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"day":"23","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","publication_status":"published","year":"2017","date_published":"2017-10-23T00:00:00Z","doi":"10.15479/AT:IST-2017-872-v1-1","related_material":{"record":[{"relation":"later_version","id":"10417","status":"public"},{"id":"5448","status":"public","relation":"earlier_version"}]},"date_created":"2018-12-12T11:39:26Z","page":"36"},{"_id":"551","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)"},"conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","end_date":"2017-08-25","location":"Aalborg, Denmark","start_date":"2017-08-21"},"type":"conference","pubrep_id":"924","status":"public","date_updated":"2021-01-12T08:02:34Z","ddc":["004"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:00Z","abstract":[{"lang":"eng","text":"Evolutionary graph theory studies the evolutionary dynamics in a population structure given as a connected graph. Each node of the graph represents an individual of the population, and edges determine how offspring are placed. We consider the classical birth-death Moran process where there are two types of individuals, namely, the residents with fitness 1 and mutants with fitness r. The fitness indicates the reproductive strength. The evolutionary dynamics happens as follows: in the initial step, in a population of all resident individuals a mutant is introduced, and then at each step, an individual is chosen proportional to the fitness of its type to reproduce, and the offspring replaces a neighbor uniformly at random. The process stops when all individuals are either residents or mutants. The probability that all individuals in the end are mutants is called the fixation probability, which is a key factor in the rate of evolution. We consider the problem of approximating the fixation probability. The class of algorithms that is extremely relevant for approximation of the fixation probabilities is the Monte-Carlo simulation of the process. Previous results present a polynomial-time Monte-Carlo algorithm for undirected graphs when r is given in unary. First, we present a simple modification: instead of simulating each step, we discard ineffective steps, where no node changes type (i.e., either residents replace residents, or mutants replace mutants). Using the above simple modification and our result that the number of effective steps is concentrated around the expected number of effective steps, we present faster polynomial-time Monte-Carlo algorithms for undirected graphs. Our algorithms are always at least a factor O(n2/ log n) faster as compared to the previous algorithms, where n is the number of nodes, and is polynomial even if r is given in binary. We also present lower bounds showing that the upper bound on the expected number of effective steps we present is asymptotically tight for undirected graphs. "}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":1,"intvolume":" 83","month":"11","publication_status":"published","publication_identifier":{"isbn":["978-395977046-0"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:18:04Z","file_name":"IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf","date_updated":"2020-07-14T12:47:00Z","file_size":535077,"creator":"system","checksum":"2eed5224c0e4e259484a1d71acb8ba6a","file_id":"5322","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"volume":83,"article_number":"61","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 61.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.61","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.61","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","mla":"Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” Leibniz International Proceedings in Informatics, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.61."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7263","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"title":"Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","year":"2017","has_accepted_license":"1","publication":"Leibniz International Proceedings in Informatics","day":"01","date_created":"2018-12-11T11:47:08Z","date_published":"2017-11-01T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2017.61"},{"file_date_updated":"2020-07-14T12:47:00Z","department":[{"_id":"KrCh"}],"ddc":["004"],"date_updated":"2023-02-14T10:06:46Z","pubrep_id":"923","status":"public","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"conference":{"end_date":"2017-08-25","location":"Aalborg, Denmark","start_date":"2017-08-21","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"type":"conference","_id":"552","license":"https://creativecommons.org/licenses/by/3.0/","ec_funded":1,"volume":83,"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf","date_created":"2018-12-12T10:16:57Z","creator":"system","file_size":610339,"date_updated":"2020-07-14T12:47:00Z","checksum":"c67f4866ddbfd555afef1f63ae9a8fc7","file_id":"5248","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"isbn":["978-395977046-0"]},"intvolume":" 83","month":"11","alternative_title":["LIPIcs"],"scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a meanpayoff condition). There are two variants of the problem, namely, the threshold problem where the quantitative goal is to ensure that the mean-payoff value is above a threshold, and the value problem where the quantitative goal is to ensure the optimal mean-payoff value; in both cases ensuring the qualitative parity objective. The previous best-known algorithms for game graphs with n vertices, m edges, parity objectives with d priorities, and maximal absolute reward value W for mean-payoff objectives, are as follows: O(nd+1 . m . w) for the threshold problem, and O(nd+2 · m · W) for the value problem. Our main contributions are faster algorithms, and the running times of our algorithms are as follows: O(nd-1 · m ·W) for the threshold problem, and O(nd · m · W · log(n · W)) for the value problem. For mean-payoff parity objectives with two priorities, our algorithms match the best-known bounds of the algorithms for mean-payoff games (without conjunction with parity objectives). Our results are relevant in synthesis of reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective)."}],"title":"Faster algorithms for mean-payoff parity games","article_processing_charge":"No","publist_id":"7262","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean-Payoff Parity Games.” Leibniz International Proceedings in Informatics, vol. 83, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.39.","short":"K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","apa":"Chatterjee, K., Henzinger, M. H., & Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.39","ama":"Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.39","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.","ista":"Chatterjee K, Henzinger MH, Svozil A. 2017. Faster algorithms for mean-payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 39."},"project":[{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"article_number":"39","date_created":"2018-12-11T11:47:08Z","date_published":"2017-11-01T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2017.39","publication":"Leibniz International Proceedings in Informatics","day":"01","year":"2017","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"day":"01","publication":"Leibniz International Proceedings in Informatics","has_accepted_license":"1","year":"2017","date_published":"2017-11-01T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2017.55","date_created":"2018-12-11T11:47:08Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.","chicago":"Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.","apa":"Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.55","ama":"Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.55","ieee":"K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","short":"K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.” Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55."},"title":"Strategy complexity of concurrent safety games","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hansen, Kristofer","last_name":"Hansen","first_name":"Kristofer"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"}],"publist_id":"7261","article_number":"55","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"7101facb56ade363205c695d72dbd173","file_id":"4753","creator":"system","date_updated":"2020-07-14T12:47:00Z","file_size":549967,"date_created":"2018-12-12T10:09:29Z","file_name":"IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-395977046-0"]},"publication_status":"published","volume":83,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. Player 1 wins iff a designated goal state is eventually visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed. Our main results are as follows: We show that: (i) the optimal bound on the patience of optimal and -optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. "}],"month":"11","intvolume":" 83","alternative_title":["LIPIcs"],"scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1506.02434","open_access":"1"}],"ddc":["004"],"date_updated":"2021-01-12T08:02:35Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:00Z","_id":"553","status":"public","pubrep_id":"922","type":"conference","conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","location":"Aalborg, Denmark","end_date":"2017-08-25","start_date":"2017-08-21"},"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)"}},{"publisher":"Royal Society of London","quality_controlled":"1","oa":1,"date_published":"2017-11-01T00:00:00Z","doi":"10.1098/rspa.2017.0104","date_created":"2018-12-11T11:47:11Z","year":"2017","day":"01","publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"article_number":"0104","publist_id":"7256","author":[{"first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","full_name":"Gerencser, Mate","last_name":"Gerencser"},{"first_name":"Arnulf","last_name":"Jentzen","full_name":"Jentzen, Arnulf"},{"first_name":"Diyora","last_name":"Salimova","full_name":"Salimova, Diyora"}],"title":"On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions","citation":{"mla":"Gerencser, Mate, et al. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 473, no. 2207, 0104, Royal Society of London, 2017, doi:10.1098/rspa.2017.0104.","apa":"Gerencser, M., Jentzen, A., & Salimova, D. (2017). On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London. https://doi.org/10.1098/rspa.2017.0104","ama":"Gerencser M, Jentzen A, Salimova D. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2017;473(2207). doi:10.1098/rspa.2017.0104","short":"M. Gerencser, A. Jentzen, D. Salimova, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 473 (2017).","ieee":"M. Gerencser, A. Jentzen, and D. Salimova, “On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 473, no. 2207. Royal Society of London, 2017.","chicago":"Gerencser, Mate, Arnulf Jentzen, and Diyora Salimova. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2017. https://doi.org/10.1098/rspa.2017.0104.","ista":"Gerencser M, Jentzen A, Salimova D. 2017. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 473(2207), 0104."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1702.03229","open_access":"1"}],"month":"11","intvolume":" 473","abstract":[{"lang":"eng","text":"In a recent article (Jentzen et al. 2016 Commun. Math. Sci. 14, 1477–1500 (doi:10.4310/CMS.2016.v14. n6.a1)), it has been established that, for every arbitrarily slow convergence speed and every natural number d ? {4, 5, . . .}, there exist d-dimensional stochastic differential equations with infinitely often differentiable and globally bounded coefficients such that no approximation method based on finitely many observations of the driving Brownian motion can converge in absolute mean to the solution faster than the given speed of convergence. In this paper, we strengthen the above result by proving that this slow convergence phenomenon also arises in two (d = 2) and three (d = 3) space dimensions."}],"oa_version":"Submitted Version","volume":473,"issue":"2207","ec_funded":1,"publication_identifier":{"issn":["13645021"]},"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"560","department":[{"_id":"JaMa"}],"date_updated":"2021-01-12T08:03:04Z"},{"title":"A Dynamical Approach to Random Matrix Theory","article_processing_charge":"No","publist_id":"7247","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"last_name":"Yau","full_name":"Yau, Horng","first_name":"Horng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"L. Erdös, H. Yau, A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 2017.","ieee":"L. Erdös and H. Yau, A Dynamical Approach to Random Matrix Theory, vol. 28. American Mathematical Society, 2017.","ama":"Erdös L, Yau H. A Dynamical Approach to Random Matrix Theory. Vol 28. American Mathematical Society; 2017. doi:10.1090/cln/028","apa":"Erdös, L., & Yau, H. (2017). A Dynamical Approach to Random Matrix Theory (Vol. 28). American Mathematical Society. https://doi.org/10.1090/cln/028","mla":"Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory. Vol. 28, American Mathematical Society, 2017, doi:10.1090/cln/028.","ista":"Erdös L, Yau H. 2017. A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 226p.","chicago":"Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory. Vol. 28. Courant Lecture Notes. American Mathematical Society, 2017. https://doi.org/10.1090/cln/028."},"project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"}],"date_created":"2018-12-11T11:47:13Z","doi":"10.1090/cln/028","date_published":"2017-01-01T00:00:00Z","page":"226","day":"01","year":"2017","quality_controlled":"1","publisher":"American Mathematical Society","department":[{"_id":"LaEr"}],"date_updated":"2022-05-24T06:57:28Z","status":"public","type":"book","_id":"567","series_title":"Courant Lecture Notes","ec_funded":1,"volume":28,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9-781-4704-3648-3"],"eisbn":["978-1-4704-4194-4"]},"intvolume":" 28","month":"01","alternative_title":["Courant Lecture Notes"],"oa_version":"None","abstract":[{"lang":"eng","text":"This book is a concise and self-contained introduction of recent techniques to prove local spectral universality for large random matrices. Random matrix theory is a fast expanding research area, and this book mainly focuses on the methods that the authors participated in developing over the past few years. Many other interesting topics are not included, and neither are several new developments within the framework of these methods. The authors have chosen instead to present key concepts that they believe are the core of these methods and should be relevant for future applications. They keep technicalities to a minimum to make the book accessible to graduate students. With this in mind, they include in this book the basic notions and tools for high-dimensional analysis, such as large deviation, entropy, Dirichlet form, and the logarithmic Sobolev inequality.\r\n"}]},{"title":"Persistence of zero sets","author":[{"first_name":"Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","full_name":"Franek, Peter","last_name":"Franek"},{"full_name":"Krcál, Marek","last_name":"Krcál","id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek"}],"publist_id":"7246","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Franek, P., & Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2017.v19.n2.a16","ama":"Franek P, Krcál M. Persistence of zero sets. Homology, Homotopy and Applications. 2017;19(2):313-342. doi:10.4310/HHA.2017.v19.n2.a16","ieee":"P. Franek and M. Krcál, “Persistence of zero sets,” Homology, Homotopy and Applications, vol. 19, no. 2. International Press, pp. 313–342, 2017.","short":"P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.","mla":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications, vol. 19, no. 2, International Press, 2017, pp. 313–42, doi:10.4310/HHA.2017.v19.n2.a16.","ista":"Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.","chicago":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications. International Press, 2017. https://doi.org/10.4310/HHA.2017.v19.n2.a16."},"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"grant_number":"701309","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"doi":"10.4310/HHA.2017.v19.n2.a16","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:47:14Z","page":"313 - 342","day":"01","publication":"Homology, Homotopy and Applications","year":"2017","quality_controlled":"1","publisher":"International Press","oa":1,"department":[{"_id":"UlWa"},{"_id":"HeEd"}],"date_updated":"2021-01-12T08:03:12Z","status":"public","type":"journal_article","_id":"568","issue":"2","volume":19,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["15320073"]},"publication_status":"published","month":"01","intvolume":" 19","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1507.04310","open_access":"1"}],"oa_version":"Submitted Version","abstract":[{"text":"We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the family Z< r(f) := (g-1(0): ||g - f|| < r) of all zero sets of all continuous maps g closer to f than r in the max-norm. All of these sets are outside A := (x: |f(x)| ≥ r) and we claim that Z< r(f) is fully determined by A and an element of a certain cohomotopy group which (by a recent result) is computable whenever the dimension of X is at most 2n - 3. By considering all r > 0 simultaneously, the pointed cohomotopy groups form a persistence module-a structure leading to persistence diagrams as in the case of persistent homology or well groups. Eventually, we get a descriptor of persistent robust properties of zero sets that has better descriptive power (Theorem A) and better computability status (Theorem B) than the established well diagrams. Moreover, if we endow every point of each zero set with gradients of the perturbation, the robust description of the zero sets by elements of cohomotopy groups is in some sense the best possible (Theorem C).","lang":"eng"}]},{"article_number":"e28921","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"call_identifier":"H2020","_id":"2578D616-B435-11E9-9278-68D0E5697425","grant_number":"648440","name":"Selective Barriers to Horizontal Gene Transfer"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. 2017. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 6, e28921.","chicago":"Lagator, Mato, Srdjan Sarikas, Hande Acar, Jonathan P Bollback, and Calin C Guet. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.28921.","ieee":"M. Lagator, S. Sarikas, H. Acar, J. P. Bollback, and C. C. Guet, “Regulatory network structure determines patterns of intermolecular epistasis,” eLife, vol. 6. eLife Sciences Publications, 2017.","short":"M. Lagator, S. Sarikas, H. Acar, J.P. Bollback, C.C. Guet, ELife 6 (2017).","ama":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 2017;6. doi:10.7554/eLife.28921","apa":"Lagator, M., Sarikas, S., Acar, H., Bollback, J. P., & Guet, C. C. (2017). Regulatory network structure determines patterns of intermolecular epistasis. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.28921","mla":"Lagator, Mato, et al. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife, vol. 6, e28921, eLife Sciences Publications, 2017, doi:10.7554/eLife.28921."},"title":"Regulatory network structure determines patterns of intermolecular epistasis","publist_id":"7244","author":[{"last_name":"Lagator","full_name":"Lagator, Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","first_name":"Mato"},{"full_name":"Sarikas, Srdjan","last_name":"Sarikas","first_name":"Srdjan","id":"35F0286E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Acar","full_name":"Acar, Hande","orcid":"0000-0003-1986-9753","first_name":"Hande","id":"2DDF136A-F248-11E8-B48F-1D18A9856A87"},{"id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P","last_name":"Bollback","full_name":"Bollback, Jonathan P","orcid":"0000-0002-4624-4612"},{"last_name":"Guet","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"publisher":"eLife Sciences Publications","quality_controlled":"1","publication":"eLife","day":"13","year":"2017","has_accepted_license":"1","date_created":"2018-12-11T11:47:14Z","date_published":"2017-11-13T00:00:00Z","doi":"10.7554/eLife.28921","_id":"570","pubrep_id":"918","status":"public","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)"},"type":"journal_article","ddc":["576"],"date_updated":"2021-01-12T08:03:15Z","file_date_updated":"2020-07-14T12:47:10Z","department":[{"_id":"CaGu"},{"_id":"JoBo"},{"_id":"NiBa"}],"oa_version":"Published Version","abstract":[{"text":"Most phenotypes are determined by molecular systems composed of specifically interacting molecules. However, unlike for individual components, little is known about the distributions of mutational effects of molecular systems as a whole. We ask how the distribution of mutational effects of a transcriptional regulatory system differs from the distributions of its components, by first independently, and then simultaneously, mutating a transcription factor and the associated promoter it represses. We find that the system distribution exhibits increased phenotypic variation compared to individual component distributions - an effect arising from intermolecular epistasis between the transcription factor and its DNA-binding site. In large part, this epistasis can be qualitatively attributed to the structure of the transcriptional regulatory system and could therefore be a common feature in prokaryotes. Counter-intuitively, intermolecular epistasis can alleviate the constraints of individual components, thereby increasing phenotypic variation that selection could act on and facilitating adaptive evolution. ","lang":"eng"}],"intvolume":" 6","month":"11","scopus_import":1,"language":[{"iso":"eng"}],"file":[{"creator":"system","date_updated":"2020-07-14T12:47:10Z","file_size":8453470,"date_created":"2018-12-12T10:14:42Z","file_name":"IST-2017-918-v1+1_elife-28921-figures-v3.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"273ab17f33305e4eaafd911ff88e7c5b","file_id":"5096"},{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"b433f90576c7be597cd43367946f8e7f","file_id":"5097","creator":"system","file_size":1953221,"date_updated":"2020-07-14T12:47:10Z","file_name":"IST-2017-918-v1+2_elife-28921-v3.pdf","date_created":"2018-12-12T10:14:43Z"}],"publication_status":"published","publication_identifier":{"issn":["2050084X"]},"ec_funded":1,"volume":6},{"oa":1,"publisher":"eLife Sciences Publications","quality_controlled":"1","publication":"eLife","day":"06","year":"2017","has_accepted_license":"1","date_created":"2018-12-11T11:47:14Z","doi":"10.7554/eLife.30867","date_published":"2017-11-06T00:00:00Z","article_number":"e30867","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Spira F, Cuylen Haering S, Mehta S, et al. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 2017;6. doi:10.7554/eLife.30867","apa":"Spira, F., Cuylen Haering, S., Mehta, S., Samwer, M., Reversat, A., Verma, A., … Gerlich, D. (2017). Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.30867","ieee":"F. Spira et al., “Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments,” eLife, vol. 6. eLife Sciences Publications, 2017.","short":"F. Spira, S. Cuylen Haering, S. Mehta, M. Samwer, A. Reversat, A. Verma, R. Oldenbourg, M.K. Sixt, D. Gerlich, ELife 6 (2017).","mla":"Spira, Felix, et al. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife, vol. 6, e30867, eLife Sciences Publications, 2017, doi:10.7554/eLife.30867.","ista":"Spira F, Cuylen Haering S, Mehta S, Samwer M, Reversat A, Verma A, Oldenbourg R, Sixt MK, Gerlich D. 2017. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 6, e30867.","chicago":"Spira, Felix, Sara Cuylen Haering, Shalin Mehta, Matthias Samwer, Anne Reversat, Amitabh Verma, Rudolf Oldenbourg, Michael K Sixt, and Daniel Gerlich. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.30867."},"title":"Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments","author":[{"last_name":"Spira","full_name":"Spira, Felix","first_name":"Felix"},{"last_name":"Cuylen Haering","full_name":"Cuylen Haering, Sara","first_name":"Sara"},{"first_name":"Shalin","full_name":"Mehta, Shalin","last_name":"Mehta"},{"last_name":"Samwer","full_name":"Samwer, Matthias","first_name":"Matthias"},{"first_name":"Anne","id":"35B76592-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0666-8928","full_name":"Reversat, Anne","last_name":"Reversat"},{"first_name":"Amitabh","last_name":"Verma","full_name":"Verma, Amitabh"},{"last_name":"Oldenbourg","full_name":"Oldenbourg, Rudolf","first_name":"Rudolf"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"},{"first_name":"Daniel","full_name":"Gerlich, Daniel","last_name":"Gerlich"}],"publist_id":"7245","oa_version":"Published Version","abstract":[{"lang":"eng","text":"The actomyosin ring generates force to ingress the cytokinetic cleavage furrow in animal cells, yet its filament organization and the mechanism of contractility is not well understood. We quantified actin filament order in human cells using fluorescence polarization microscopy and found that cleavage furrow ingression initiates by contraction of an equatorial actin network with randomly oriented filaments. The network subsequently gradually reoriented actin filaments along the cell equator. This strictly depended on myosin II activity, suggesting local network reorganization by mechanical forces. Cortical laser microsurgery revealed that during cytokinesis progression, mechanical tension increased substantially along the direction of the cell equator, while the network contracted laterally along the pole-to-pole axis without a detectable increase in tension. Our data suggest that an asymmetric increase in cortical tension promotes filament reorientation along the cytokinetic cleavage furrow, which might have implications for diverse other biological processes involving actomyosin rings."}],"intvolume":" 6","month":"11","scopus_import":1,"language":[{"iso":"eng"}],"file":[{"creator":"system","file_size":9666973,"date_updated":"2020-07-14T12:47:10Z","file_name":"IST-2017-919-v1+1_elife-30867-figures-v1.pdf","date_created":"2018-12-12T10:10:40Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4829","checksum":"ba09c1451153d39e4f4b7cee013e314c"},{"file_name":"IST-2017-919-v1+2_elife-30867-v1.pdf","date_created":"2018-12-12T10:10:41Z","creator":"system","file_size":5951246,"date_updated":"2020-07-14T12:47:10Z","file_id":"4830","checksum":"01eb51f1d6ad679947415a51c988e137","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"issn":["2050084X"]},"volume":6,"_id":"569","pubrep_id":"919","status":"public","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)"},"type":"journal_article","ddc":["570"],"date_updated":"2023-02-23T12:30:29Z","file_date_updated":"2020-07-14T12:47:10Z","department":[{"_id":"MiSi"}]},{"_id":"571","status":"public","type":"journal_article","date_updated":"2021-01-12T08:03:15Z","department":[{"_id":"MiSi"}],"oa_version":"None","abstract":[{"lang":"eng","text":"Blood platelets are critical for hemostasis and thrombosis and play diverse roles during immune responses. Despite these versatile tasks in mammalian biology, their skills on a cellular level are deemed limited, mainly consisting in rolling, adhesion, and aggregate formation. Here, we identify an unappreciated asset of platelets and show that adherent platelets use adhesion receptors to mechanically probe the adhesive substrate in their local microenvironment. When actomyosin-dependent traction forces overcome substrate resistance, platelets migrate and pile up the adhesive substrate together with any bound particulate material. They use this ability to act as cellular scavengers, scanning the vascular surface for potential invaders and collecting deposited bacteria. Microbe collection by migrating platelets boosts the activity of professional phagocytes, exacerbating inflammatory tissue injury in sepsis. This assigns platelets a central role in innate immune responses and identifies them as potential targets to dampen inflammatory tissue damage in clinical scenarios of severe systemic infection. In addition to their role in thrombosis and hemostasis, platelets can also migrate to sites of infection to help trap bacteria and clear the vascular surface."}],"month":"11","intvolume":" 171","scopus_import":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["00928674"]},"publication_status":"published","volume":171,"issue":"6","ec_funded":1,"project":[{"grant_number":"747687","name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells","call_identifier":"H2020","_id":"260AA4E2-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Gärtner, Florian R., et al. “Migrating Platelets Are Mechano Scavengers That Collect and Bundle Bacteria.” Cell Press, vol. 171, no. 6, Cell Press, 2017, pp. 1368–82, doi:10.1016/j.cell.2017.11.001.","apa":"Gärtner, F. R., Ahmad, Z., Rosenberger, G., Fan, S., Nicolai, L., Busch, B., … Massberg, S. (2017). Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. Cell Press. https://doi.org/10.1016/j.cell.2017.11.001","ama":"Gärtner FR, Ahmad Z, Rosenberger G, et al. Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. 2017;171(6):1368-1382. doi:10.1016/j.cell.2017.11.001","ieee":"F. R. Gärtner et al., “Migrating platelets are mechano scavengers that collect and bundle bacteria,” Cell Press, vol. 171, no. 6. Cell Press, pp. 1368–1382, 2017.","short":"F.R. Gärtner, Z. Ahmad, G. Rosenberger, S. Fan, L. Nicolai, B. Busch, G. Yavuz, M. Luckner, H. Ishikawa Ankerhold, R. Hennel, A. Benechet, M. Lorenz, S. Chandraratne, I. Schubert, S. Helmer, B. Striednig, K. Stark, M. Janko, R. Böttcher, A. Verschoor, C. Leon, C. Gachet, T. Gudermann, M. Mederos Y Schnitzler, Z. Pincus, M. Iannacone, R. Haas, G. Wanner, K. Lauber, M.K. Sixt, S. Massberg, Cell Press 171 (2017) 1368–1382.","chicago":"Gärtner, Florian R, Zerkah Ahmad, Gerhild Rosenberger, Shuxia Fan, Leo Nicolai, Benjamin Busch, Gökce Yavuz, et al. “Migrating Platelets Are Mechano Scavengers That Collect and Bundle Bacteria.” Cell Press. Cell Press, 2017. https://doi.org/10.1016/j.cell.2017.11.001.","ista":"Gärtner FR, Ahmad Z, Rosenberger G, Fan S, Nicolai L, Busch B, Yavuz G, Luckner M, Ishikawa Ankerhold H, Hennel R, Benechet A, Lorenz M, Chandraratne S, Schubert I, Helmer S, Striednig B, Stark K, Janko M, Böttcher R, Verschoor A, Leon C, Gachet C, Gudermann T, Mederos Y Schnitzler M, Pincus Z, Iannacone M, Haas R, Wanner G, Lauber K, Sixt MK, Massberg S. 2017. Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. 171(6), 1368–1382."},"title":"Migrating platelets are mechano scavengers that collect and bundle bacteria","publist_id":"7243","author":[{"id":"397A88EE-F248-11E8-B48F-1D18A9856A87","first_name":"Florian R","full_name":"Gärtner, Florian R","orcid":"0000-0001-6120-3723","last_name":"Gärtner"},{"last_name":"Ahmad","full_name":"Ahmad, Zerkah","first_name":"Zerkah"},{"full_name":"Rosenberger, Gerhild","last_name":"Rosenberger","first_name":"Gerhild"},{"first_name":"Shuxia","full_name":"Fan, Shuxia","last_name":"Fan"},{"first_name":"Leo","full_name":"Nicolai, Leo","last_name":"Nicolai"},{"first_name":"Benjamin","full_name":"Busch, Benjamin","last_name":"Busch"},{"last_name":"Yavuz","full_name":"Yavuz, Gökce","first_name":"Gökce"},{"first_name":"Manja","full_name":"Luckner, Manja","last_name":"Luckner"},{"last_name":"Ishikawa Ankerhold","full_name":"Ishikawa Ankerhold, Hellen","first_name":"Hellen"},{"last_name":"Hennel","full_name":"Hennel, Roman","first_name":"Roman"},{"first_name":"Alexandre","full_name":"Benechet, Alexandre","last_name":"Benechet"},{"last_name":"Lorenz","full_name":"Lorenz, Michael","first_name":"Michael"},{"last_name":"Chandraratne","full_name":"Chandraratne, Sue","first_name":"Sue"},{"full_name":"Schubert, Irene","last_name":"Schubert","first_name":"Irene"},{"full_name":"Helmer, Sebastian","last_name":"Helmer","first_name":"Sebastian"},{"last_name":"Striednig","full_name":"Striednig, Bianca","first_name":"Bianca"},{"full_name":"Stark, Konstantin","last_name":"Stark","first_name":"Konstantin"},{"first_name":"Marek","full_name":"Janko, Marek","last_name":"Janko"},{"first_name":"Ralph","full_name":"Böttcher, Ralph","last_name":"Böttcher"},{"first_name":"Admar","last_name":"Verschoor","full_name":"Verschoor, Admar"},{"last_name":"Leon","full_name":"Leon, Catherine","first_name":"Catherine"},{"last_name":"Gachet","full_name":"Gachet, Christian","first_name":"Christian"},{"first_name":"Thomas","last_name":"Gudermann","full_name":"Gudermann, Thomas"},{"first_name":"Michael","last_name":"Mederos Y Schnitzler","full_name":"Mederos Y Schnitzler, Michael"},{"first_name":"Zachary","full_name":"Pincus, Zachary","last_name":"Pincus"},{"first_name":"Matteo","last_name":"Iannacone","full_name":"Iannacone, Matteo"},{"first_name":"Rainer","last_name":"Haas","full_name":"Haas, Rainer"},{"last_name":"Wanner","full_name":"Wanner, Gerhard","first_name":"Gerhard"},{"last_name":"Lauber","full_name":"Lauber, Kirsten","first_name":"Kirsten"},{"first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179"},{"first_name":"Steffen","full_name":"Massberg, Steffen","last_name":"Massberg"}],"quality_controlled":"1","publisher":"Cell Press","day":"30","publication":"Cell Press","year":"2017","doi":"10.1016/j.cell.2017.11.001","date_published":"2017-11-30T00:00:00Z","date_created":"2018-12-11T11:47:15Z","page":"1368 - 1382"},{"_id":"572","status":"public","pubrep_id":"917","type":"journal_article","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)"},"ddc":["580"],"date_updated":"2021-01-12T08:03:16Z","department":[{"_id":"JiFr"}],"file_date_updated":"2020-07-14T12:47:10Z","oa_version":"Published Version","abstract":[{"text":"In this review, we summarize the different biosynthesis-related pathways that contribute to the regulation of endogenous auxin in plants. We demonstrate that all known genes involved in auxin biosynthesis also have a role in root formation, from the initiation of a root meristem during embryogenesis to the generation of a functional root system with a primary root, secondary lateral root branches and adventitious roots. Furthermore, the versatile adaptation of root development in response to environmental challenges is mediated by both local and distant control of auxin biosynthesis. In conclusion, auxin homeostasis mediated by spatial and temporal regulation of auxin biosynthesis plays a central role in determining root architecture.","lang":"eng"}],"month":"12","intvolume":" 18","scopus_import":"1","file":[{"file_id":"4718","checksum":"82d51f11e493f7eec02976d9a9a9805e","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2017-917-v1+1_ijms-18-02587.pdf","date_created":"2018-12-12T10:08:55Z","creator":"system","file_size":920962,"date_updated":"2020-07-14T12:47:10Z"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":18,"issue":"12","article_number":"2587","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Olatunji D, Geelen D, Verstraeten I. 2017. Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. 18(12), 2587.","chicago":"Olatunji, Damilola, Danny Geelen, and Inge Verstraeten. “Control of Endogenous Auxin Levels in Plant Root Development.” International Journal of Molecular Sciences. MDPI, 2017. https://doi.org/10.3390/ijms18122587.","apa":"Olatunji, D., Geelen, D., & Verstraeten, I. (2017). Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms18122587","ama":"Olatunji D, Geelen D, Verstraeten I. Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. 2017;18(12). doi:10.3390/ijms18122587","short":"D. Olatunji, D. Geelen, I. Verstraeten, International Journal of Molecular Sciences 18 (2017).","ieee":"D. Olatunji, D. Geelen, and I. Verstraeten, “Control of endogenous auxin levels in plant root development,” International Journal of Molecular Sciences, vol. 18, no. 12. MDPI, 2017.","mla":"Olatunji, Damilola, et al. “Control of Endogenous Auxin Levels in Plant Root Development.” International Journal of Molecular Sciences, vol. 18, no. 12, 2587, MDPI, 2017, doi:10.3390/ijms18122587."},"title":"Control of endogenous auxin levels in plant root development","publist_id":"7242","author":[{"full_name":"Olatunji, Damilola","last_name":"Olatunji","first_name":"Damilola"},{"first_name":"Danny","full_name":"Geelen, Danny","last_name":"Geelen"},{"id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","first_name":"Inge","orcid":"0000-0001-7241-2328","full_name":"Verstraeten, Inge","last_name":"Verstraeten"}],"article_processing_charge":"No","quality_controlled":"1","publisher":"MDPI","oa":1,"day":"01","publication":"International Journal of Molecular Sciences","has_accepted_license":"1","year":"2017","doi":"10.3390/ijms18122587","date_published":"2017-12-01T00:00:00Z","date_created":"2018-12-11T11:47:15Z"},{"abstract":[{"lang":"eng","text":"Different distance metrics produce Voronoi diagrams with different properties. It is a well-known that on the (real) 2D plane or even on any 3D plane, a Voronoi diagram (VD) based on the Euclidean distance metric produces convex Voronoi regions. In this paper, we first show that this metric produces a persistent VD on the 2D digital plane, as it comprises digitally convex Voronoi regions and hence correctly approximates the corresponding VD on the 2D real plane. Next, we show that on a 3D digital plane D, the Euclidean metric spanning over its voxel set does not guarantee a digital VD which is persistent with the real-space VD. As a solution, we introduce a novel concept of functional-plane-convexity, which is ensured by the Euclidean metric spanning over the pedal set of D. Necessary proofs and some visual result have been provided to adjudge the merit and usefulness of the proposed concept."}],"oa_version":"None","alternative_title":["LNCS"],"place":"Cham","month":"05","intvolume":" 10256","publication_identifier":{"isbn":["978-3-319-59107-0","978-3-319-59108-7"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":10256,"_id":"5803","type":"book_chapter","conference":{"start_date":"2017-06-19","end_date":"2017-06-21","location":"Plovdiv, Bulgaria","name":"IWCIA: International Workshop on Combinatorial Image Analysis"},"status":"public","date_updated":"2022-01-28T07:48:24Z","extern":"1","department":[{"_id":"HeEd"}],"quality_controlled":"1","publisher":"Springer Nature","year":"2017","day":"17","publication":"Combinatorial image analysis","page":"93-104","date_published":"2017-05-17T00:00:00Z","doi":"10.1007/978-3-319-59108-7_8","date_created":"2019-01-08T20:42:56Z","citation":{"ista":"Biswas R, Bhowmick P. 2017.Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial image analysis. LNCS, vol. 10256, 93–104.","chicago":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” In Combinatorial Image Analysis, 10256:93–104. Cham: Springer Nature, 2017. https://doi.org/10.1007/978-3-319-59108-7_8.","short":"R. Biswas, P. Bhowmick, in:, Combinatorial Image Analysis, Springer Nature, Cham, 2017, pp. 93–104.","ieee":"R. Biswas and P. Bhowmick, “Construction of persistent Voronoi diagram on 3D digital plane,” in Combinatorial image analysis, vol. 10256, Cham: Springer Nature, 2017, pp. 93–104.","apa":"Biswas, R., & Bhowmick, P. (2017). Construction of persistent Voronoi diagram on 3D digital plane. In Combinatorial image analysis (Vol. 10256, pp. 93–104). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-59108-7_8","ama":"Biswas R, Bhowmick P. Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial Image Analysis. Vol 10256. Cham: Springer Nature; 2017:93-104. doi:10.1007/978-3-319-59108-7_8","mla":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” Combinatorial Image Analysis, vol. 10256, Springer Nature, 2017, pp. 93–104, doi:10.1007/978-3-319-59108-7_8."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita","last_name":"Biswas"},{"full_name":"Bhowmick, Partha","last_name":"Bhowmick","first_name":"Partha"}],"article_processing_charge":"No","title":"Construction of persistent Voronoi diagram on 3D digital plane"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Camus, N., Yakaboylu, E., Fechner, L., Klaiber, M., Laux, M., Mi, Y., … Moshammer, R. (2017). Experimental evidence for Wigner’s tunneling time (Vol. 999). Presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation: American Physical Society. https://doi.org/10.1088/1742-6596/999/1/012004","ama":"Camus N, Yakaboylu E, Fechner L, et al. Experimental evidence for Wigner’s tunneling time. In: Vol 999. American Physical Society; 2017. doi:10.1088/1742-6596/999/1/012004","ieee":"N. Camus et al., “Experimental evidence for Wigner’s tunneling time,” presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation, 2017, vol. 999, no. 1.","short":"N. Camus, E. Yakaboylu, L. Fechner, M. Klaiber, M. Laux, Y. Mi, K. Hatsagortsyan, T. Pfeifer, C. Keitel, R. Moshammer, in:, American Physical Society, 2017.","mla":"Camus, Nicolas, et al. Experimental Evidence for Wigner’s Tunneling Time. Vol. 999, no. 1, 012004, American Physical Society, 2017, doi:10.1088/1742-6596/999/1/012004.","ista":"Camus N, Yakaboylu E, Fechner L, Klaiber M, Laux M, Mi Y, Hatsagortsyan K, Pfeifer T, Keitel C, Moshammer R. 2017. Experimental evidence for Wigner’s tunneling time. Annual International Laser Physics Workshop LPHYS, Journal of Physics: Conference Series, vol. 999, 012004.","chicago":"Camus, Nicolas, Enderalp Yakaboylu, Lutz Fechner, Michael Klaiber, Martin Laux, Yonghao Mi, Karen Hatsagortsyan, Thomas Pfeifer, Cristoph Keitel, and Robert Moshammer. “Experimental Evidence for Wigner’s Tunneling Time,” Vol. 999. American Physical Society, 2017. https://doi.org/10.1088/1742-6596/999/1/012004."},"title":"Experimental evidence for Wigner's tunneling time","external_id":{"arxiv":["1611.03701"]},"publist_id":"7552","author":[{"full_name":"Camus, Nicolas","last_name":"Camus","first_name":"Nicolas"},{"full_name":"Yakaboylu, Enderalp","orcid":"0000-0001-5973-0874","last_name":"Yakaboylu","first_name":"Enderalp","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Lutz","full_name":"Fechner, Lutz","last_name":"Fechner"},{"first_name":"Michael","last_name":"Klaiber","full_name":"Klaiber, Michael"},{"last_name":"Laux","full_name":"Laux, Martin","first_name":"Martin"},{"first_name":"Yonghao","full_name":"Mi, Yonghao","last_name":"Mi"},{"first_name":"Karen","full_name":"Hatsagortsyan, Karen","last_name":"Hatsagortsyan"},{"first_name":"Thomas","full_name":"Pfeifer, Thomas","last_name":"Pfeifer"},{"last_name":"Keitel","full_name":"Keitel, Cristoph","first_name":"Cristoph"},{"first_name":"Robert","last_name":"Moshammer","full_name":"Moshammer, Robert"}],"article_number":"012004","day":"14","year":"2017","has_accepted_license":"1","date_created":"2018-12-11T11:45:46Z","date_published":"2017-07-14T00:00:00Z","doi":"10.1088/1742-6596/999/1/012004","oa":1,"quality_controlled":"1","publisher":"American Physical Society","ddc":["530"],"date_updated":"2023-02-23T12:36:07Z","department":[{"_id":"MiLe"}],"file_date_updated":"2020-07-14T12:46:00Z","_id":"313","status":"public","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)"},"conference":{"name":"Annual International Laser Physics Workshop LPHYS","start_date":"2017-08-17","location":"Kazan, Russian Federation","end_date":"2017-08-21"},"type":"conference","language":[{"iso":"eng"}],"file":[{"date_created":"2019-01-22T08:34:10Z","file_name":"2017_Physics_Camus.pdf","creator":"dernst","date_updated":"2020-07-14T12:46:00Z","file_size":949321,"file_id":"5871","checksum":"6e70b525a84f6d5fb175c48e9f5cb59a","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"issn":["17426588"]},"volume":999,"related_material":{"record":[{"id":"6013","status":"public","relation":"later_version"}]},"issue":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Tunneling of a particle through a potential barrier remains one of the most remarkable quantum phenomena. Owing to advances in laser technology, electric fields comparable to those electrons experience in atoms are readily generated and open opportunities to dynamically investigate the process of electron tunneling through the potential barrier formed by the superposition of both laser and atomic fields. Attosecond-time and angstrom-space resolution of the strong laser-field technique allow to address fundamental questions related to tunneling, which are still open and debated: Which time is spent under the barrier and what momentum is picked up by the particle in the meantime? In this combined experimental and theoretical study we demonstrate that for strong-field ionization the leading quantum mechanical Wigner treatment for the time resolved description of tunneling is valid. We achieve a high sensitivity on the tunneling barrier and unambiguously isolate its effects by performing a differential study of two systems with almost identical tunneling geometry. Moreover, working with a low frequency laser, we essentially limit the non-adiabaticity of the process as a major source of uncertainty. The agreement between experiment and theory implies two substantial corrections with respect to the widely employed quasiclassical treatment: In addition to a non-vanishing longitudinal momentum along the laser field-direction we provide clear evidence for a non-zero tunneling time delay. This addresses also the fundamental question how the transition occurs from the tunnel barrier to free space classical evolution of the ejected electron."}],"intvolume":" 999","month":"07","scopus_import":1,"alternative_title":["Journal of Physics: Conference Series"]},{"abstract":[{"lang":"eng","text":"The first hundred attoseconds of the electron dynamics during strong field tunneling ionization are investigated. We quantify theoretically how the electron’s classical trajectories in the continuum emerge from the tunneling process and test the results with those achieved in parallel from attoclock measurements. An especially high sensitivity on the tunneling barrier is accomplished here by comparing the momentum distributions of two atomic species of slightly deviating atomic potentials (argon and krypton) being ionized under absolutely identical conditions with near-infrared laser pulses (1300 nm). The agreement between experiment and theory provides clear evidence for a nonzero tunneling time delay and a nonvanishing longitudinal momentum of the electron at the “tunnel exit.”"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1611.03701","open_access":"1"}],"scopus_import":1,"intvolume":" 119","month":"07","publication_status":"published","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"language":[{"iso":"eng"}],"issue":"2","volume":119,"related_material":{"record":[{"status":"public","id":"313","relation":"earlier_version"}]},"_id":"6013","type":"journal_article","status":"public","date_updated":"2023-02-23T11:13:36Z","department":[{"_id":"MiLe"}],"oa":1,"quality_controlled":"1","publisher":"American Physical Society","year":"2017","publication":"Physical Review Letters","day":"14","date_created":"2019-02-14T15:24:13Z","date_published":"2017-07-14T00:00:00Z","doi":"10.1103/PhysRevLett.119.023201","article_number":"023201","citation":{"ista":"Camus N, Yakaboylu E, Fechner L, Klaiber M, Laux M, Mi Y, Hatsagortsyan KZ, Pfeifer T, Keitel CH, Moshammer R. 2017. Experimental evidence for quantum tunneling time. Physical Review Letters. 119(2), 023201.","chicago":"Camus, Nicolas, Enderalp Yakaboylu, Lutz Fechner, Michael Klaiber, Martin Laux, Yonghao Mi, Karen Z. Hatsagortsyan, Thomas Pfeifer, Christoph H. Keitel, and Robert Moshammer. “Experimental Evidence for Quantum Tunneling Time.” Physical Review Letters. American Physical Society, 2017. https://doi.org/10.1103/PhysRevLett.119.023201.","short":"N. Camus, E. Yakaboylu, L. Fechner, M. Klaiber, M. Laux, Y. Mi, K.Z. Hatsagortsyan, T. Pfeifer, C.H. Keitel, R. Moshammer, Physical Review Letters 119 (2017).","ieee":"N. Camus et al., “Experimental evidence for quantum tunneling time,” Physical Review Letters, vol. 119, no. 2. American Physical Society, 2017.","ama":"Camus N, Yakaboylu E, Fechner L, et al. Experimental evidence for quantum tunneling time. Physical Review Letters. 2017;119(2). doi:10.1103/PhysRevLett.119.023201","apa":"Camus, N., Yakaboylu, E., Fechner, L., Klaiber, M., Laux, M., Mi, Y., … Moshammer, R. (2017). Experimental evidence for quantum tunneling time. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.119.023201","mla":"Camus, Nicolas, et al. “Experimental Evidence for Quantum Tunneling Time.” Physical Review Letters, vol. 119, no. 2, 023201, American Physical Society, 2017, doi:10.1103/PhysRevLett.119.023201."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1611.03701"]},"author":[{"last_name":"Camus","full_name":"Camus, Nicolas","first_name":"Nicolas"},{"id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","first_name":"Enderalp","last_name":"Yakaboylu","full_name":"Yakaboylu, Enderalp","orcid":"0000-0001-5973-0874"},{"full_name":"Fechner, Lutz","last_name":"Fechner","first_name":"Lutz"},{"first_name":"Michael","full_name":"Klaiber, Michael","last_name":"Klaiber"},{"first_name":"Martin","full_name":"Laux, Martin","last_name":"Laux"},{"first_name":"Yonghao","full_name":"Mi, Yonghao","last_name":"Mi"},{"last_name":"Hatsagortsyan","full_name":"Hatsagortsyan, Karen Z.","first_name":"Karen Z."},{"first_name":"Thomas","full_name":"Pfeifer, Thomas","last_name":"Pfeifer"},{"last_name":"Keitel","full_name":"Keitel, Christoph H.","first_name":"Christoph H."},{"first_name":"Robert","full_name":"Moshammer, Robert","last_name":"Moshammer"}],"title":"Experimental evidence for quantum tunneling time"},{"abstract":[{"text":"Position based cryptography (PBC), proposed in the seminal work of Chandran, Goyal, Moriarty, and Ostrovsky (SIAM J. Computing, 2014), aims at constructing cryptographic schemes in which the identity of the user is his geographic position. Chandran et al. construct PBC schemes for secure positioning and position-based key agreement in the bounded-storage model (Maurer, J. Cryptology, 1992). Apart from bounded memory, their security proofs need a strong additional restriction on the power of the adversary: he cannot compute joint functions of his inputs. Removing this assumption is left as an open problem. We show that an answer to this question would resolve a long standing open problem in multiparty communication complexity: finding a function that is hard to compute with low communication complexity in the simultaneous message model, but easy to compute in the fully adaptive model. On a more positive side: we also show some implications in the other direction, i.e.: we prove that lower bounds on the communication complexity of certain multiparty problems imply existence of PBC primitives. Using this result we then show two attractive ways to “bypass” our hardness result: the first uses the random oracle model, the second weakens the locality requirement in the bounded-storage model to online computability. The random oracle construction is arguably one of the simplest proposed so far in this area. Our results indicate that constructing improved provably secure protocols for PBC requires a better understanding of multiparty communication complexity. This is yet another example where negative results in one area (in our case: lower bounds in multiparty communication complexity) can be used to construct secure cryptographic schemes.","lang":"eng"}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/536"}],"alternative_title":["LNCS"],"scopus_import":1,"intvolume":" 10677","month":"11","publication_status":"published","publication_identifier":{"isbn":["978-331970499-9"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":10677,"_id":"605","conference":{"name":"TCC: Theory of Cryptography Conference","start_date":"2017-11-12","end_date":"2017-11-15","location":"Baltimore, MD, United States"},"type":"conference","status":"public","date_updated":"2021-01-12T08:05:53Z","department":[{"_id":"KrPi"}],"oa":1,"quality_controlled":"1","publisher":"Springer","year":"2017","day":"05","page":"56 - 81","date_created":"2018-12-11T11:47:27Z","doi":"10.1007/978-3-319-70500-2_3","date_published":"2017-11-05T00:00:00Z","project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"citation":{"ista":"Brody J, Dziembowski S, Faust S, Pietrzak KZ. 2017. Position based cryptography and multiparty communication complexity. TCC: Theory of Cryptography Conference, LNCS, vol. 10677, 56–81.","chicago":"Brody, Joshua, Stefan Dziembowski, Sebastian Faust, and Krzysztof Z Pietrzak. “Position Based Cryptography and Multiparty Communication Complexity.” edited by Yael Kalai and Leonid Reyzin, 10677:56–81. Springer, 2017. https://doi.org/10.1007/978-3-319-70500-2_3.","short":"J. Brody, S. Dziembowski, S. Faust, K.Z. Pietrzak, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 56–81.","ieee":"J. Brody, S. Dziembowski, S. Faust, and K. Z. Pietrzak, “Position based cryptography and multiparty communication complexity,” presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States, 2017, vol. 10677, pp. 56–81.","ama":"Brody J, Dziembowski S, Faust S, Pietrzak KZ. Position based cryptography and multiparty communication complexity. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:56-81. doi:10.1007/978-3-319-70500-2_3","apa":"Brody, J., Dziembowski, S., Faust, S., & Pietrzak, K. Z. (2017). Position based cryptography and multiparty communication complexity. In Y. Kalai & L. Reyzin (Eds.) (Vol. 10677, pp. 56–81). Presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States: Springer. https://doi.org/10.1007/978-3-319-70500-2_3","mla":"Brody, Joshua, et al. Position Based Cryptography and Multiparty Communication Complexity. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 56–81, doi:10.1007/978-3-319-70500-2_3."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7200","author":[{"full_name":"Brody, Joshua","last_name":"Brody","first_name":"Joshua"},{"first_name":"Stefan","last_name":"Dziembowski","full_name":"Dziembowski, Stefan"},{"full_name":"Faust, Sebastian","last_name":"Faust","first_name":"Sebastian"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"title":"Position based cryptography and multiparty communication complexity","editor":[{"last_name":"Kalai","full_name":"Kalai, Yael","first_name":"Yael"},{"full_name":"Reyzin, Leonid","last_name":"Reyzin","first_name":"Leonid"}]},{"day":"14","publication":"Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero ","year":"2017","doi":"10.1039/9781782626800-00444","date_published":"2017-12-14T00:00:00Z","date_created":"2018-12-11T11:47:27Z","page":"444 - 495","quality_controlled":"1","publisher":"The Royal Society of Chemistry","oa":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Lemeshko M, Schmidt R. 2017.Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Theoretical and Computational Chemistry Series, vol. 11, 444–495.","chicago":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” In Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , edited by Oliver Dulieu and Andreas Osterwalder, 11:444–95. Theoretical and Computational Chemistry Series. The Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781782626800-00444.","ama":"Lemeshko M, Schmidt R. Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Dulieu O, Osterwalder A, eds. Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Vol 11. Theoretical and Computational Chemistry Series. The Royal Society of Chemistry; 2017:444-495. doi:10.1039/9781782626800-00444","apa":"Lemeshko, M., & Schmidt, R. (2017). Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In O. Dulieu & A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero (Vol. 11, pp. 444–495). The Royal Society of Chemistry. https://doi.org/10.1039/9781782626800-00444","ieee":"M. Lemeshko and R. Schmidt, “Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets,” in Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , vol. 11, O. Dulieu and A. Osterwalder, Eds. The Royal Society of Chemistry, 2017, pp. 444–495.","short":"M. Lemeshko, R. Schmidt, in:, O. Dulieu, A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , The Royal Society of Chemistry, 2017, pp. 444–495.","mla":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , edited by Oliver Dulieu and Andreas Osterwalder, vol. 11, The Royal Society of Chemistry, 2017, pp. 444–95, doi:10.1039/9781782626800-00444."},"title":"Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets","editor":[{"first_name":"Oliver","full_name":"Dulieu, Oliver","last_name":"Dulieu"},{"first_name":"Andreas","last_name":"Osterwalder","full_name":"Osterwalder, Andreas"}],"publist_id":"7201","author":[{"last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schmidt","full_name":"Schmidt, Richard","first_name":"Richard"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["20413181"]},"publication_status":"published","volume":11,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"In several settings of physics and chemistry one has to deal with molecules interacting with some kind of an external environment, be it a gas, a solution, or a crystal surface. Understanding molecular processes in the presence of such a many-particle bath is inherently challenging, and usually requires large-scale numerical computations. Here, we present an alternative approach to the problem, based on the notion of the angulon quasiparticle. We show that molecules rotating inside superfluid helium nanodroplets and Bose–Einstein condensates form angulons, and therefore can be described by straightforward solutions of a simple microscopic Hamiltonian. Casting the problem in the language of angulons allows us not only to greatly simplify it, but also to gain insights into the origins of the observed phenomena and to make predictions for future experimental studies."}],"month":"12","intvolume":" 11","alternative_title":["Theoretical and Computational Chemistry Series"],"scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.06753"}],"date_updated":"2021-01-12T08:05:50Z","department":[{"_id":"MiLe"}],"_id":"604","series_title":"Theoretical and Computational Chemistry Series","status":"public","type":"book_chapter"},{"year":"2017","day":"05","page":"493 - 526","doi":"10.1007/978-3-319-70500-2_17","date_published":"2017-11-05T00:00:00Z","date_created":"2018-12-11T11:47:28Z","publisher":"Springer","quality_controlled":"1","oa":1,"citation":{"ista":"Alwen JF, Tackmann B. 2017. Moderately hard functions: Definition, instantiations, and applications. TCC: Theory of Cryptography, LNCS, vol. 10677, 493–526.","chicago":"Alwen, Joel F, and Björn Tackmann. “Moderately Hard Functions: Definition, Instantiations, and Applications.” edited by Yael Kalai and Leonid Reyzin, 10677:493–526. Springer, 2017. https://doi.org/10.1007/978-3-319-70500-2_17.","ama":"Alwen JF, Tackmann B. Moderately hard functions: Definition, instantiations, and applications. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:493-526. doi:10.1007/978-3-319-70500-2_17","apa":"Alwen, J. F., & Tackmann, B. (2017). Moderately hard functions: Definition, instantiations, and applications. In Y. Kalai & L. Reyzin (Eds.) (Vol. 10677, pp. 493–526). Presented at the TCC: Theory of Cryptography, Baltimore, MD, United States: Springer. https://doi.org/10.1007/978-3-319-70500-2_17","short":"J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.","ieee":"J. F. Alwen and B. Tackmann, “Moderately hard functions: Definition, instantiations, and applications,” presented at the TCC: Theory of Cryptography, Baltimore, MD, United States, 2017, vol. 10677, pp. 493–526.","mla":"Alwen, Joel F., and Björn Tackmann. Moderately Hard Functions: Definition, Instantiations, and Applications. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 493–526, doi:10.1007/978-3-319-70500-2_17."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Alwen","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F"},{"last_name":"Tackmann","full_name":"Tackmann, Björn","first_name":"Björn"}],"publist_id":"7196","editor":[{"last_name":"Kalai","full_name":"Kalai, Yael","first_name":"Yael"},{"first_name":"Leonid","full_name":"Reyzin, Leonid","last_name":"Reyzin"}],"title":"Moderately hard functions: Definition, instantiations, and applications","publication_identifier":{"isbn":["978-331970499-9"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":10677,"abstract":[{"lang":"eng","text":"Several cryptographic schemes and applications are based on functions that are both reasonably efficient to compute and moderately hard to invert, including client puzzles for Denial-of-Service protection, password protection via salted hashes, or recent proof-of-work blockchain systems. Despite their wide use, a definition of this concept has not yet been distilled and formalized explicitly. Instead, either the applications are proven directly based on the assumptions underlying the function, or some property of the function is proven, but the security of the application is argued only informally. The goal of this work is to provide a (universal) definition that decouples the efforts of designing new moderately hard functions and of building protocols based on them, serving as an interface between the two. On a technical level, beyond the mentioned definitions, we instantiate the model for four different notions of hardness. We extend the work of Alwen and Serbinenko (STOC 2015) by providing a general tool for proving security for the first notion of memory-hard functions that allows for provably secure applications. The tool allows us to recover all of the graph-theoretic techniques developed for proving security under the older, non-composable, notion of security used by Alwen and Serbinenko. As an application of our definition of moderately hard functions, we prove the security of two different schemes for proofs of effort (PoE). We also formalize and instantiate the concept of a non-interactive proof of effort (niPoE), in which the proof is not bound to a particular communication context but rather any bit-string chosen by the prover."}],"oa_version":"Submitted Version","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/945"}],"month":"11","intvolume":" 10677","date_updated":"2021-01-12T08:06:04Z","department":[{"_id":"KrPi"}],"_id":"609","type":"conference","conference":{"name":"TCC: Theory of Cryptography","end_date":"2017-11-15","location":"Baltimore, MD, United States","start_date":"2017-11-12"},"status":"public"},{"publication":"Israel Journal of Mathematics","day":"01","year":"2017","date_created":"2018-12-11T11:47:29Z","doi":"10.1007/s11856-017-1607-7","date_published":"2017-10-01T00:00:00Z","page":"841 - 866","acknowledgement":"The work by Z. P. was partially supported by the Israel Science Foundation grant ISF-768/12. The work by Z. P. and M. T. was partially supported by the project CE-ITI (GACR P202/12/G061) of the Czech Science Foundation and by the ERC Advanced Grant No. 267165. Part of the research work of M.T. was conducted at IST Austria, supported by an IST Fellowship. The research of P. P. was supported by the ERC Advanced grant no. 320924. The work by I. M. and U. W. was supported by the Swiss National Science Foundation (grants SNSF-200020-138230 and SNSF-PP00P2-138948). The collaboration between U. W. and X. G. was partially supported by the LabEx Bézout (ANR-10-LABX-58).","oa":1,"publisher":"Springer","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, Israel Journal of Mathematics 222 (2017) 841–866.","ieee":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result,” Israel Journal of Mathematics, vol. 222, no. 2. Springer, pp. 841–866, 2017.","apa":"Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2017). On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-017-1607-7","ama":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. 2017;222(2):841-866. doi:10.1007/s11856-017-1607-7","mla":"Goaoc, Xavier, et al. “On Generalized Heawood Inequalities for Manifolds: A van Kampen–Flores Type Nonembeddability Result.” Israel Journal of Mathematics, vol. 222, no. 2, Springer, 2017, pp. 841–66, doi:10.1007/s11856-017-1607-7.","ista":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. 2017. On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. 222(2), 841–866.","chicago":"Goaoc, Xavier, Isaac Mabillard, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “On Generalized Heawood Inequalities for Manifolds: A van Kampen–Flores Type Nonembeddability Result.” Israel Journal of Mathematics. Springer, 2017. https://doi.org/10.1007/s11856-017-1607-7."},"title":"On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result","author":[{"full_name":"Goaoc, Xavier","last_name":"Goaoc","first_name":"Xavier"},{"id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Isaac","full_name":"Mabillard, Isaac","last_name":"Mabillard"},{"last_name":"Paták","full_name":"Paták, Pavel","first_name":"Pavel"},{"last_name":"Patakova","full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683","first_name":"Zuzana","id":"48B57058-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tancer","orcid":"0000-0002-1191-6714","full_name":"Tancer, Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli"}],"publist_id":"7194","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"related_material":{"record":[{"id":"1511","status":"public","relation":"earlier_version"}]},"volume":222,"issue":"2","oa_version":"Preprint","abstract":[{"text":"The fact that the complete graph K5 does not embed in the plane has been generalized in two independent directions. On the one hand, the solution of the classical Heawood problem for graphs on surfaces established that the complete graph Kn embeds in a closed surface M (other than the Klein bottle) if and only if (n−3)(n−4) ≤ 6b1(M), where b1(M) is the first Z2-Betti number of M. On the other hand, van Kampen and Flores proved that the k-skeleton of the n-dimensional simplex (the higher-dimensional analogue of Kn+1) embeds in R2k if and only if n ≤ 2k + 1. Two decades ago, Kühnel conjectured that the k-skeleton of the n-simplex embeds in a compact, (k − 1)-connected 2k-manifold with kth Z2-Betti number bk only if the following generalized Heawood inequality holds: (k+1 n−k−1) ≤ (k+1 2k+1)bk. This is a common generalization of the case of graphs on surfaces as well as the van Kampen–Flores theorem. In the spirit of Kühnel’s conjecture, we prove that if the k-skeleton of the n-simplex embeds in a compact 2k-manifold with kth Z2-Betti number bk, then n ≤ 2bk(k 2k+2)+2k+4. This bound is weaker than the generalized Heawood inequality, but does not require the assumption that M is (k−1)-connected. Our results generalize to maps without q-covered points, in the spirit of Tverberg’s theorem, for q a prime power. Our proof uses a result of Volovikov about maps that satisfy a certain homological triviality condition.","lang":"eng"}],"intvolume":" 222","month":"10","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1610.09063"}],"scopus_import":1,"date_updated":"2023-02-23T10:02:13Z","department":[{"_id":"UlWa"}],"_id":"610","status":"public","type":"journal_article"},{"oa_version":"None","abstract":[{"text":"Small RNAs (sRNAs) regulate genes in plants and animals. Here, we show that population-wide differences in color patterns in snapdragon flowers are caused by an inverted duplication that generates sRNAs. The complexity and size of the transcripts indicate that the duplication represents an intermediate on the pathway to microRNA evolution. The sRNAs repress a pigment biosynthesis gene, creating a yellow highlight at the site of pollinator entry. The inverted duplication exhibits steep clines in allele frequency in a natural hybrid zone, showing that the allele is under selection. Thus, regulatory interactions of evolutionarily recent sRNAs can be acted upon by selection and contribute to the evolution of phenotypic diversity.","lang":"eng"}],"intvolume":" 358","month":"11","publisher":"American Association for the Advancement of Science","scopus_import":1,"quality_controlled":"1","publication":"Science","language":[{"iso":"eng"}],"day":"17","year":"2017","publication_status":"published","publication_identifier":{"issn":["00368075"]},"date_created":"2018-12-11T11:47:29Z","volume":358,"date_published":"2017-11-17T00:00:00Z","issue":"6365","doi":"10.1126/science.aao3526","page":"925 - 928","_id":"611","status":"public","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:06:10Z","citation":{"ista":"Bradley D, Xu P, Mohorianu I, Whibley A, Field D, Tavares H, Couchman M, Copsey L, Carpenter R, Li M, Li Q, Xue Y, Dalmay T, Coen E. 2017. Evolution of flower color pattern through selection on regulatory small RNAs. Science. 358(6365), 925–928.","chicago":"Bradley, Desmond, Ping Xu, Irina Mohorianu, Annabel Whibley, David Field, Hugo Tavares, Matthew Couchman, et al. “Evolution of Flower Color Pattern through Selection on Regulatory Small RNAs.” Science. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/science.aao3526.","ama":"Bradley D, Xu P, Mohorianu I, et al. Evolution of flower color pattern through selection on regulatory small RNAs. Science. 2017;358(6365):925-928. doi:10.1126/science.aao3526","apa":"Bradley, D., Xu, P., Mohorianu, I., Whibley, A., Field, D., Tavares, H., … Coen, E. (2017). Evolution of flower color pattern through selection on regulatory small RNAs. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aao3526","short":"D. Bradley, P. Xu, I. Mohorianu, A. Whibley, D. Field, H. Tavares, M. Couchman, L. Copsey, R. Carpenter, M. Li, Q. Li, Y. Xue, T. Dalmay, E. Coen, Science 358 (2017) 925–928.","ieee":"D. Bradley et al., “Evolution of flower color pattern through selection on regulatory small RNAs,” Science, vol. 358, no. 6365. American Association for the Advancement of Science, pp. 925–928, 2017.","mla":"Bradley, Desmond, et al. “Evolution of Flower Color Pattern through Selection on Regulatory Small RNAs.” Science, vol. 358, no. 6365, American Association for the Advancement of Science, 2017, pp. 925–28, doi:10.1126/science.aao3526."},"title":"Evolution of flower color pattern through selection on regulatory small RNAs","department":[{"_id":"NiBa"}],"author":[{"first_name":"Desmond","full_name":"Bradley, Desmond","last_name":"Bradley"},{"first_name":"Ping","last_name":"Xu","full_name":"Xu, Ping"},{"first_name":"Irina","last_name":"Mohorianu","full_name":"Mohorianu, Irina"},{"full_name":"Whibley, Annabel","last_name":"Whibley","first_name":"Annabel"},{"full_name":"Field, David","orcid":"0000-0002-4014-8478","last_name":"Field","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Hugo","full_name":"Tavares, Hugo","last_name":"Tavares"},{"first_name":"Matthew","last_name":"Couchman","full_name":"Couchman, Matthew"},{"first_name":"Lucy","last_name":"Copsey","full_name":"Copsey, Lucy"},{"first_name":"Rosemary","full_name":"Carpenter, Rosemary","last_name":"Carpenter"},{"first_name":"Miaomiao","last_name":"Li","full_name":"Li, Miaomiao"},{"first_name":"Qun","last_name":"Li","full_name":"Li, Qun"},{"first_name":"Yongbiao","last_name":"Xue","full_name":"Xue, Yongbiao"},{"first_name":"Tamas","full_name":"Dalmay, Tamas","last_name":"Dalmay"},{"full_name":"Coen, Enrico","last_name":"Coen","first_name":"Enrico"}],"publist_id":"7193"},{"day":"01","publication":"Nature Communications","has_accepted_license":"1","year":"2017","date_published":"2017-12-01T00:00:00Z","doi":"10.1038/s41467-017-01683-1","date_created":"2018-12-11T11:47:30Z","acknowledgement":"We are grateful to M. Lang, H. Janovjak, M. Khammash, A. Milias-Argeitis, M. Rullan, G. Batt, A. Bosma-Moody, Aryan, S. Leibler, and members of the Guet and Tkačik groups for helpful discussion, comments, and suggestions. We thank A. Moglich, T. Mathes, J. Tabor, and S. Schmidl for kind gifts of strains, and R. Hauschild, B. Knep, M. Lang, T. Asenov, E. Papusheva, T. Menner, T. Adletzberger, and J. Merrin for technical assistance. The research leading to these results has 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]. (to R.C. and J.R.), Austrian Science Fund grant FWF P28844 (to G.T.), and internal IST Austria Interdisciplinary Project Support. J.R. acknowledges support from the Agence Nationale de la Recherche (ANR) under Grant Nos. ANR-16-CE33-0018 (MEMIP), ANR-16-CE12-0025 (COGEX) and ANR-10-BINF-06-01 (ICEBERG).","quality_controlled":"1","publisher":"Nature Publishing Group","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Chait RP, Ruess J, Bergmiller T, Tkačik G, Guet CC. Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. 2017;8(1). doi:10.1038/s41467-017-01683-1","apa":"Chait, R. P., Ruess, J., Bergmiller, T., Tkačik, G., & Guet, C. C. (2017). Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-017-01683-1","ieee":"R. P. Chait, J. Ruess, T. Bergmiller, G. Tkačik, and C. C. Guet, “Shaping bacterial population behavior through computer interfaced control of individual cells,” Nature Communications, vol. 8, no. 1. Nature Publishing Group, 2017.","short":"R.P. Chait, J. Ruess, T. Bergmiller, G. Tkačik, C.C. Guet, Nature Communications 8 (2017).","mla":"Chait, Remy P., et al. “Shaping Bacterial Population Behavior through Computer Interfaced Control of Individual Cells.” Nature Communications, vol. 8, no. 1, 1535, Nature Publishing Group, 2017, doi:10.1038/s41467-017-01683-1.","ista":"Chait RP, Ruess J, Bergmiller T, Tkačik G, Guet CC. 2017. Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. 8(1), 1535.","chicago":"Chait, Remy P, Jakob Ruess, Tobias Bergmiller, Gašper Tkačik, and Calin C Guet. “Shaping Bacterial Population Behavior through Computer Interfaced Control of Individual Cells.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/s41467-017-01683-1."},"title":"Shaping bacterial population behavior through computer interfaced control of individual cells","publist_id":"7191","author":[{"last_name":"Chait","full_name":"Chait, Remy P","orcid":"0000-0003-0876-3187","first_name":"Remy P","id":"3464AE84-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ruess","orcid":"0000-0003-1615-3282","full_name":"Ruess, Jakob","first_name":"Jakob","id":"4A245D00-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Bergmiller","orcid":"0000-0001-5396-4346","full_name":"Bergmiller, Tobias","first_name":"Tobias","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","last_name":"Guet"}],"article_processing_charge":"Yes (in subscription journal)","article_number":"1535","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"name":"Biophysics of information processing in gene regulation","grant_number":"P28844-B27","_id":"254E9036-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"file":[{"file_size":1951699,"date_updated":"2020-07-14T12:47:20Z","creator":"system","file_name":"IST-2017-911-v1+1_s41467-017-01683-1.pdf","date_created":"2018-12-12T10:16:05Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"44bb5d0229926c23a9955d9fe0f9723f","file_id":"5190"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["20411723"]},"publication_status":"published","volume":8,"issue":"1","ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Bacteria in groups vary individually, and interact with other bacteria and the environment to produce population-level patterns of gene expression. Investigating such behavior in detail requires measuring and controlling populations at the single-cell level alongside precisely specified interactions and environmental characteristics. Here we present an automated, programmable platform that combines image-based gene expression and growth measurements with on-line optogenetic expression control for hundreds of individual Escherichia coli cells over days, in a dynamically adjustable environment. This integrated platform broadly enables experiments that bridge individual and population behaviors. We demonstrate: (i) population structuring by independent closed-loop control of gene expression in many individual cells, (ii) cell-cell variation control during antibiotic perturbation, (iii) hybrid bio-digital circuits in single cells, and freely specifiable digital communication between individual bacteria. These examples showcase the potential for real-time integration of theoretical models with measurement and control of many individual cells to investigate and engineer microbial population behavior."}],"month":"12","intvolume":" 8","scopus_import":1,"ddc":["576","579"],"date_updated":"2021-01-12T08:06:15Z","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"file_date_updated":"2020-07-14T12:47:20Z","_id":"613","status":"public","pubrep_id":"911","type":"journal_article","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)"}},{"_id":"615","status":"public","type":"journal_article","date_updated":"2021-01-12T08:06:22Z","department":[{"_id":"LaEr"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We show that the Dyson Brownian Motion exhibits local universality after a very short time assuming that local rigidity and level repulsion of the eigenvalues hold. These conditions are verified, hence bulk spectral universality is proven, for a large class of Wigner-like matrices, including deformed Wigner ensembles and ensembles with non-stochastic variance matrices whose limiting densities differ from Wigner's semicircle law."}],"intvolume":" 53","month":"11","main_file_link":[{"url":"https://arxiv.org/abs/1504.00650","open_access":"1"}],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["02460203"]},"ec_funded":1,"issue":"4","volume":53,"project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Erdös, László, and Kevin Schnelli. “Universality for Random Matrix Flows with Time Dependent Density.” Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute of Mathematical Statistics, 2017. https://doi.org/10.1214/16-AIHP765.","ista":"Erdös L, Schnelli K. 2017. Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. 53(4), 1606–1656.","mla":"Erdös, László, and Kevin Schnelli. “Universality for Random Matrix Flows with Time Dependent Density.” Annales de l’institut Henri Poincare (B) Probability and Statistics, vol. 53, no. 4, Institute of Mathematical Statistics, 2017, pp. 1606–56, doi:10.1214/16-AIHP765.","ama":"Erdös L, Schnelli K. Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. 2017;53(4):1606-1656. doi:10.1214/16-AIHP765","apa":"Erdös, L., & Schnelli, K. (2017). Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/16-AIHP765","ieee":"L. Erdös and K. Schnelli, “Universality for random matrix flows with time dependent density,” Annales de l’institut Henri Poincare (B) Probability and Statistics, vol. 53, no. 4. Institute of Mathematical Statistics, pp. 1606–1656, 2017.","short":"L. Erdös, K. Schnelli, Annales de l’institut Henri Poincare (B) Probability and Statistics 53 (2017) 1606–1656."},"title":"Universality for random matrix flows with time dependent density","publist_id":"7189","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"first_name":"Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0954-3231","full_name":"Schnelli, Kevin","last_name":"Schnelli"}],"oa":1,"publisher":"Institute of Mathematical Statistics","quality_controlled":"1","publication":"Annales de l'institut Henri Poincare (B) Probability and Statistics","day":"01","year":"2017","date_created":"2018-12-11T11:47:30Z","doi":"10.1214/16-AIHP765","date_published":"2017-11-01T00:00:00Z","page":"1606 - 1656"},{"department":[{"_id":"GaNo"}],"date_updated":"2021-01-12T08:06:46Z","status":"public","type":"book_chapter","_id":"623","series_title":"Advances in Anatomy Embryology and Cell Biology","volume":224,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-319-52496-2"],"issn":["03015556"]},"publication_status":"published","month":"05","intvolume":" 224","scopus_import":1,"alternative_title":["ADVSANAT"],"oa_version":"None","abstract":[{"text":"Genetic factors might be largely responsible for the development of autism spectrum disorder (ASD) that alone or in combination with specific environmental risk factors trigger the pathology. Multiple mutations identified in ASD patients that impair synaptic function in the central nervous system are well studied in animal models. How these mutations might interact with other risk factors is not fully understood though. Additionally, how systems outside of the brain are altered in the context of ASD is an emerging area of research. Extracerebral influences on the physiology could begin in utero and contribute to changes in the brain and in the development of other body systems and further lead to epigenetic changes. Therefore, multiple recent studies have aimed at elucidating the role of gene-environment interactions in ASD. Here we provide an overview on the extracerebral systems that might play an important associative role in ASD and review evidence regarding the potential roles of inflammation, trace metals, metabolism, genetic susceptibility, enteric nervous system function and the microbiota of the gastrointestinal (GI) tract on the development of endophenotypes in animal models of ASD. By influencing environmental conditions, it might be possible to reduce or limit the severity of ASD pathology.","lang":"eng"}],"title":"Extracerebral dysfunction in animal models of autism spectrum disorder","editor":[{"full_name":"Schmeisser, Michael","last_name":"Schmeisser","first_name":"Michael"},{"first_name":"Tobias","last_name":"Boekers","full_name":"Boekers, Tobias"}],"publist_id":"7177","author":[{"last_name":"Hill Yardin","full_name":"Hill Yardin, Elisa","first_name":"Elisa"},{"first_name":"Sonja","full_name":"Mckeown, Sonja","last_name":"Mckeown"},{"last_name":"Novarino","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia"},{"full_name":"Grabrucker, Andreas","last_name":"Grabrucker","first_name":"Andreas"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Hill Yardin, Elisa, et al. “Extracerebral Dysfunction in Animal Models of Autism Spectrum Disorder.” Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, vol. 224, Springer, 2017, pp. 159–87, doi:10.1007/978-3-319-52498-6_9.","ama":"Hill Yardin E, Mckeown S, Novarino G, Grabrucker A. Extracerebral dysfunction in animal models of autism spectrum disorder. In: Schmeisser M, Boekers T, eds. Translational Anatomy and Cell Biology of Autism Spectrum Disorder. Vol 224. Advances in Anatomy Embryology and Cell Biology. Springer; 2017:159-187. doi:10.1007/978-3-319-52498-6_9","apa":"Hill Yardin, E., Mckeown, S., Novarino, G., & Grabrucker, A. (2017). Extracerebral dysfunction in animal models of autism spectrum disorder. In M. Schmeisser & T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder (Vol. 224, pp. 159–187). Springer. https://doi.org/10.1007/978-3-319-52498-6_9","short":"E. Hill Yardin, S. Mckeown, G. Novarino, A. Grabrucker, in:, M. Schmeisser, T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder, Springer, 2017, pp. 159–187.","ieee":"E. Hill Yardin, S. Mckeown, G. Novarino, and A. Grabrucker, “Extracerebral dysfunction in animal models of autism spectrum disorder,” in Translational Anatomy and Cell Biology of Autism Spectrum Disorder, vol. 224, M. Schmeisser and T. Boekers, Eds. Springer, 2017, pp. 159–187.","chicago":"Hill Yardin, Elisa, Sonja Mckeown, Gaia Novarino, and Andreas Grabrucker. “Extracerebral Dysfunction in Animal Models of Autism Spectrum Disorder.” In Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, 224:159–87. Advances in Anatomy Embryology and Cell Biology. Springer, 2017. https://doi.org/10.1007/978-3-319-52498-6_9.","ista":"Hill Yardin E, Mckeown S, Novarino G, Grabrucker A. 2017.Extracerebral dysfunction in animal models of autism spectrum disorder. In: Translational Anatomy and Cell Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 159–187."},"doi":"10.1007/978-3-319-52498-6_9","date_published":"2017-05-28T00:00:00Z","date_created":"2018-12-11T11:47:33Z","page":"159 - 187","day":"28","publication":"Translational Anatomy and Cell Biology of Autism Spectrum Disorder","year":"2017","publisher":"Springer","quality_controlled":"1"},{"oa":1,"quality_controlled":"1","publisher":"Academic Press","date_created":"2018-12-11T11:47:34Z","date_published":"2017-12-01T00:00:00Z","doi":"10.1016/j.tpb.2017.06.001","page":"50 - 73","publication":"Theoretical Population Biology","day":"01","year":"2017","has_accepted_license":"1","project":[{"call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation"}],"title":"The infinitesimal model: Definition derivation and implications","author":[{"first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton"},{"full_name":"Etheridge, Alison","last_name":"Etheridge","first_name":"Alison"},{"last_name":"Véber","full_name":"Véber, Amandine","first_name":"Amandine"}],"publist_id":"7169","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Barton NH, Etheridge A, Véber A. The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. 2017;118:50-73. doi:10.1016/j.tpb.2017.06.001","apa":"Barton, N. H., Etheridge, A., & Véber, A. (2017). The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2017.06.001","short":"N.H. Barton, A. Etheridge, A. Véber, Theoretical Population Biology 118 (2017) 50–73.","ieee":"N. H. Barton, A. Etheridge, and A. Véber, “The infinitesimal model: Definition derivation and implications,” Theoretical Population Biology, vol. 118. Academic Press, pp. 50–73, 2017.","mla":"Barton, Nicholas H., et al. “The Infinitesimal Model: Definition Derivation and Implications.” Theoretical Population Biology, vol. 118, Academic Press, 2017, pp. 50–73, doi:10.1016/j.tpb.2017.06.001.","ista":"Barton NH, Etheridge A, Véber A. 2017. The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. 118, 50–73.","chicago":"Barton, Nicholas H, Alison Etheridge, and Amandine Véber. “The Infinitesimal Model: Definition Derivation and Implications.” Theoretical Population Biology. Academic Press, 2017. https://doi.org/10.1016/j.tpb.2017.06.001."},"intvolume":" 118","month":"12","scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Our focus here is on the infinitesimal model. In this model, one or several quantitative traits are described as the sum of a genetic and a non-genetic component, the first being distributed within families as a normal random variable centred at the average of the parental genetic components, and with a variance independent of the parental traits. Thus, the variance that segregates within families is not perturbed by selection, and can be predicted from the variance components. This does not necessarily imply that the trait distribution across the whole population should be Gaussian, and indeed selection or population structure may have a substantial effect on the overall trait distribution. One of our main aims is to identify some general conditions on the allelic effects for the infinitesimal model to be accurate. We first review the long history of the infinitesimal model in quantitative genetics. Then we formulate the model at the phenotypic level in terms of individual trait values and relationships between individuals, but including different evolutionary processes: genetic drift, recombination, selection, mutation, population structure, …. We give a range of examples of its application to evolutionary questions related to stabilising selection, assortative mating, effective population size and response to selection, habitat preference and speciation. We provide a mathematical justification of the model as the limit as the number M of underlying loci tends to infinity of a model with Mendelian inheritance, mutation and environmental noise, when the genetic component of the trait is purely additive. We also show how the model generalises to include epistatic effects. We prove in particular that, within each family, the genetic components of the individual trait values in the current generation are indeed normally distributed with a variance independent of ancestral traits, up to an error of order 1∕M. Simulations suggest that in some cases the convergence may be as fast as 1∕M."}],"ec_funded":1,"volume":118,"language":[{"iso":"eng"}],"file":[{"file_id":"4964","checksum":"7dd02bfcfe8f244f4a6c19091aedf2c8","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:12:45Z","file_name":"IST-2017-908-v1+1_1-s2.0-S0040580917300886-main_1_.pdf","creator":"system","date_updated":"2020-07-14T12:47:25Z","file_size":1133924}],"publication_status":"published","publication_identifier":{"issn":["00405809"]},"pubrep_id":"908","status":"public","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)"},"type":"journal_article","_id":"626","file_date_updated":"2020-07-14T12:47:25Z","department":[{"_id":"NiBa"}],"ddc":["576"],"date_updated":"2021-01-12T08:06:50Z"},{"abstract":[{"lang":"eng","text":"In the analysis of reactive systems a quantitative objective assigns a real value to every trace of the system. The value decision problem for a quantitative objective requires a trace whose value is at least a given threshold, and the exact value decision problem requires a trace whose value is exactly the threshold. We compare the computational complexity of the value and exact value decision problems for classical quantitative objectives, such as sum, discounted sum, energy, and mean-payoff for two standard models of reactive systems, namely, graphs and graph games."}],"oa_version":"Submitted Version","scopus_import":"1","alternative_title":["LNCS"],"month":"07","intvolume":" 10460","publication_identifier":{"isbn":["978-3-319-63120-2"],"issn":["0302-9743"]},"publication_status":"published","file":[{"checksum":"b2402766ec02c79801aac634bd8f9f6c","file_id":"7048","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2017_ModelsAlgorithms_Chatterjee.pdf","date_created":"2019-11-19T08:06:50Z","creator":"dernst","file_size":192826,"date_updated":"2020-07-14T12:47:25Z"}],"language":[{"iso":"eng"}],"volume":10460,"ec_funded":1,"_id":"625","series_title":"Theoretical Computer Science and General Issues","type":"book_chapter","status":"public","date_updated":"2022-05-23T08:54:02Z","ddc":["000"],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:25Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 and S11407-N23 (RiSE/SHiNE), and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003.","publisher":"Springer","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2017","day":"25","publication":"Models, Algorithms, Logics and Tools","page":"367 - 381","date_published":"2017-07-25T00:00:00Z","doi":"10.1007/978-3-319-63121-9_18","date_created":"2018-12-11T11:47:34Z","project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.” In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017. https://doi.org/10.1007/978-3-319-63121-9_18.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381.","mla":"Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.” Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.","apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, & R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer. https://doi.org/10.1007/978-3-319-63121-9_18","ama":"Chatterjee K, Doyen L, Henzinger TA. The cost of exactness in quantitative reachability. In: Aceto L, Bacci G, Ingólfsdóttir A, Legay A, Mardare R, eds. Models, Algorithms, Logics and Tools. Vol 10460. Theoretical Computer Science and General Issues. Springer; 2017:367-381. doi:10.1007/978-3-319-63121-9_18","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7170","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","editor":[{"first_name":"Luca","last_name":"Aceto","full_name":"Aceto, Luca"},{"last_name":"Bacci","full_name":"Bacci, Giorgio","first_name":"Giorgio"},{"last_name":"Ingólfsdóttir","full_name":"Ingólfsdóttir, Anna","first_name":"Anna"},{"first_name":"Axel","last_name":"Legay","full_name":"Legay, Axel"},{"full_name":"Mardare, Radu","last_name":"Mardare","first_name":"Radu"}],"title":"The cost of exactness in quantitative reachability"},{"title":"MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations","publist_id":"7172","author":[{"full_name":"Nikolic, Nela","orcid":"0000-0001-9068-6090","last_name":"Nikolic","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87","first_name":"Nela"},{"first_name":"Zrinka","full_name":"Didara, Zrinka","last_name":"Didara"},{"last_name":"Moll","full_name":"Moll, Isabella","first_name":"Isabella"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Nikolic N, Didara Z, Moll I. 2017. MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. 2017(9), 3830.","chicago":"Nikolic, Nela, Zrinka Didara, and Isabella Moll. “MazF Activation Promotes Translational Heterogeneity of the GrcA MRNA in Escherichia Coli Populations.” PeerJ. PeerJ, 2017. https://doi.org/10.7717/peerj.3830.","ama":"Nikolic N, Didara Z, Moll I. MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. 2017;2017(9). doi:10.7717/peerj.3830","apa":"Nikolic, N., Didara, Z., & Moll, I. (2017). MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. PeerJ. https://doi.org/10.7717/peerj.3830","short":"N. Nikolic, Z. Didara, I. Moll, PeerJ 2017 (2017).","ieee":"N. Nikolic, Z. Didara, and I. Moll, “MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations,” PeerJ, vol. 2017, no. 9. PeerJ, 2017.","mla":"Nikolic, Nela, et al. “MazF Activation Promotes Translational Heterogeneity of the GrcA MRNA in Escherichia Coli Populations.” PeerJ, vol. 2017, no. 9, 3830, PeerJ, 2017, doi:10.7717/peerj.3830."},"article_number":"3830","doi":"10.7717/peerj.3830","date_published":"2017-09-21T00:00:00Z","date_created":"2018-12-11T11:47:33Z","day":"21","publication":"PeerJ","has_accepted_license":"1","year":"2017","quality_controlled":"1","publisher":"PeerJ","oa":1,"acknowledgement":"Austrian Science Fund (FWF): M1697, P22249; Swiss National Science Foundation (SNF): 145706; European Commission;FWF Special Research Program: RNA-REG F43","department":[{"_id":"CaGu"}],"file_date_updated":"2020-07-14T12:47:24Z","ddc":["579"],"date_updated":"2021-01-12T08:06:48Z","status":"public","pubrep_id":"909","type":"journal_article","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)"},"_id":"624","issue":"9","volume":2017,"file":[{"date_created":"2018-12-12T10:11:51Z","file_name":"IST-2017-909-v1+1_peerj-3830.pdf","date_updated":"2020-07-14T12:47:24Z","file_size":682064,"creator":"system","checksum":"3d79ae6b6eabc90b0eaaed82ff3493b0","file_id":"4908","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["21678359"]},"publication_status":"published","month":"09","intvolume":" 2017","scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"Bacteria adapt to adverse environmental conditions by altering gene expression patterns. Recently, a novel stress adaptation mechanism has been described that allows Escherichia coli to alter gene expression at the post-transcriptional level. The key player in this regulatory pathway is the endoribonuclease MazF, the toxin component of the toxin-antitoxin module mazEF that is triggered by various stressful conditions. In general, MazF degrades the majority of transcripts by cleaving at ACA sites, which results in the retardation of bacterial growth. Furthermore, MazF can process a small subset of mRNAs and render them leaderless by removing their ribosome binding site. MazF concomitantly modifies ribosomes, making them selective for the translation of leaderless mRNAs. In this study, we employed fluorescent reporter-systems to investigate mazEF expression during stressful conditions, and to infer consequences of the mRNA processing mediated by MazF on gene expression at the single-cell level. Our results suggest that mazEF transcription is maintained at low levels in single cells encountering adverse conditions, such as antibiotic stress or amino acid starvation. Moreover, using the grcA mRNA as a model for MazF-mediated mRNA processing, we found that MazF activation promotes heterogeneity in the grcA reporter expression, resulting in a subpopulation of cells with increased levels of GrcA reporter protein.","lang":"eng"}]},{"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Fu","full_name":"Fu, Hongfei","first_name":"Hongfei"},{"first_name":"Aniket","last_name":"Murhekar","full_name":"Murhekar, Aniket"}],"publist_id":"7166","title":"Automated recurrence analysis for almost linear expected runtime bounds","editor":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"first_name":"Viktor","last_name":"Kunčak","full_name":"Kunčak, Viktor"}],"citation":{"chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.” edited by Rupak Majumdar and Viktor Kunčak, 10426:118–39. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_6.","ista":"Chatterjee K, Fu H, Murhekar A. 2017. Automated recurrence analysis for almost linear expected runtime bounds. CAV: Computer Aided Verification, LNCS, vol. 10426, 118–139.","mla":"Chatterjee, Krishnendu, et al. Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 118–39, doi:10.1007/978-3-319-63387-9_6.","ama":"Chatterjee K, Fu H, Murhekar A. Automated recurrence analysis for almost linear expected runtime bounds. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:118-139. doi:10.1007/978-3-319-63387-9_6","apa":"Chatterjee, K., Fu, H., & Murhekar, A. (2017). Automated recurrence analysis for almost linear expected runtime bounds. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_6","short":"K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 118–139.","ieee":"K. Chatterjee, H. Fu, and A. Murhekar, “Automated recurrence analysis for almost linear expected runtime bounds,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 118–139."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","quality_controlled":"1","oa":1,"page":"118 - 139","doi":"10.1007/978-3-319-63387-9_6","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:47:35Z","year":"2017","day":"01","type":"conference","conference":{"name":"CAV: Computer Aided Verification","start_date":"2017-07-24","end_date":"2017-07-28","location":"Heidelberg, Germany"},"status":"public","_id":"628","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:06:55Z","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.00314"}],"month":"01","intvolume":" 10426","abstract":[{"text":"We consider the problem of developing automated techniques for solving recurrence relations to aid the expected-runtime analysis of programs. The motivation is that several classical textbook algorithms have quite efficient expected-runtime complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., Quick-Sort), or completely ineffective (e.g., Coupon-Collector). Since the main focus of expected-runtime analysis is to obtain efficient bounds, we consider bounds that are either logarithmic, linear or almost-linear (O(log n), O(n), O(n · log n), respectively, where n represents the input size). Our main contribution is an efficient (simple linear-time algorithm) sound approach for deriving such expected-runtime bounds for the analysis of recurrence relations induced by randomized algorithms. The experimental results show that our approach can efficiently derive asymptotically optimal expected-runtime bounds for recurrences of classical randomized algorithms, including Randomized-Search, Quick-Sort, Quick-Select, Coupon-Collector, where the worst-case bounds are either inefficient (such as linear as compared to logarithmic expected-runtime complexity, or quadratic as compared to linear or almost-linear expected-runtime complexity), or ineffective.","lang":"eng"}],"oa_version":"Submitted Version","volume":10426,"ec_funded":1,"publication_identifier":{"isbn":["978-331963386-2"]},"publication_status":"published","language":[{"iso":"eng"}]},{"year":"2017","publication":"Prokaryotic Cytoskeletons","day":"13","page":"419 - 444","date_created":"2018-12-11T11:47:35Z","date_published":"2017-05-13T00:00:00Z","doi":"10.1007/978-3-319-53047-5_15","publisher":"Springer","quality_controlled":"1","citation":{"chicago":"Loose, Martin, Katja Zieske, and Petra Schwille. “Reconstitution of Protein Dynamics Involved in Bacterial Cell Division.” In Prokaryotic Cytoskeletons, 84:419–44. Sub-Cellular Biochemistry. Springer, 2017. https://doi.org/10.1007/978-3-319-53047-5_15.","ista":"Loose M, Zieske K, Schwille P. 2017.Reconstitution of protein dynamics involved in bacterial cell division. In: Prokaryotic Cytoskeletons. vol. 84, 419–444.","mla":"Loose, Martin, et al. “Reconstitution of Protein Dynamics Involved in Bacterial Cell Division.” Prokaryotic Cytoskeletons, vol. 84, Springer, 2017, pp. 419–44, doi:10.1007/978-3-319-53047-5_15.","ieee":"M. Loose, K. Zieske, and P. Schwille, “Reconstitution of protein dynamics involved in bacterial cell division,” in Prokaryotic Cytoskeletons, vol. 84, Springer, 2017, pp. 419–444.","short":"M. Loose, K. Zieske, P. Schwille, in:, Prokaryotic Cytoskeletons, Springer, 2017, pp. 419–444.","ama":"Loose M, Zieske K, Schwille P. Reconstitution of protein dynamics involved in bacterial cell division. In: Prokaryotic Cytoskeletons. Vol 84. Sub-Cellular Biochemistry. Springer; 2017:419-444. doi:10.1007/978-3-319-53047-5_15","apa":"Loose, M., Zieske, K., & Schwille, P. (2017). Reconstitution of protein dynamics involved in bacterial cell division. In Prokaryotic Cytoskeletons (Vol. 84, pp. 419–444). Springer. https://doi.org/10.1007/978-3-319-53047-5_15"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["28500535"]},"author":[{"last_name":"Loose","orcid":"0000-0001-7309-9724","full_name":"Loose, Martin","first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zieske","full_name":"Zieske, Katja","first_name":"Katja"},{"first_name":"Petra","last_name":"Schwille","full_name":"Schwille, Petra"}],"publist_id":"7165","title":"Reconstitution of protein dynamics involved in bacterial cell division","publication_status":"published","publication_identifier":{"eisbn":["978-3-319-53047-5"]},"language":[{"iso":"eng"}],"volume":84,"abstract":[{"lang":"eng","text":"Even simple cells like bacteria have precisely regulated cellular anatomies, which allow them to grow, divide and to respond to internal or external cues with high fidelity. How spatial and temporal intracellular organization in prokaryotic cells is achieved and maintained on the basis of locally interacting proteins still remains largely a mystery. Bulk biochemical assays with purified components and in vivo experiments help us to approach key cellular processes from two opposite ends, in terms of minimal and maximal complexity. However, to understand how cellular phenomena emerge, that are more than the sum of their parts, we have to assemble cellular subsystems step by step from the bottom up. Here, we review recent in vitro reconstitution experiments with proteins of the bacterial cell division machinery and illustrate how they help to shed light on fundamental cellular mechanisms that constitute spatiotemporal order and regulate cell division."}],"pmid":1,"oa_version":"None","scopus_import":1,"intvolume":" 84","month":"05","date_updated":"2021-01-12T08:06:57Z","department":[{"_id":"MaLo"}],"series_title":"Sub-Cellular Biochemistry","_id":"629","type":"book_chapter","status":"public"},{"publication_identifier":{"isbn":["978-161499758-0"]},"publication_status":"published","file":[{"date_created":"2018-12-12T10:11:56Z","file_name":"IST-2017-906-v1+1_SHTI236-0356.pdf","date_updated":"2020-07-14T12:47:27Z","file_size":443635,"creator":"system","checksum":"1254dcc5b04a996d97fad9a726b42727","file_id":"4913","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"volume":236,"license":"https://creativecommons.org/licenses/by-nc/4.0/","abstract":[{"lang":"eng","text":"Background: Standards have become available to share semantically encoded vital parameters from medical devices, as required for example by personal healthcare records. Standardised sharing of biosignal data largely remains open. Objectives: The goal of this work is to explore available biosignal file format and data exchange standards and profiles, and to conceptualise end-To-end solutions. Methods: The authors reviewed and discussed available biosignal file format standards with other members of international standards development organisations (SDOs). Results: A raw concept for standards based acquisition, storage, archiving and sharing of biosignals was developed. The GDF format may serve for storing biosignals. Signals can then be shared using FHIR resources and may be stored on FHIR servers or in DICOM archives, with DICOM waveforms as one possible format. Conclusion: Currently a group of international SDOs (e.g. HL7, IHE, DICOM, IEEE) is engaged in intensive discussions. This discussion extends existing work that already was adopted by large implementer communities. The concept presented here only reports the current status of the discussion in Austria. The discussion will continue internationally, with results to be expected over the coming years."}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["Studies in Health Technology and Informatics"],"month":"01","intvolume":" 236","date_updated":"2021-01-12T08:06:59Z","ddc":["005"],"file_date_updated":"2020-07-14T12:47:27Z","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"_id":"630","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"conference":{"name":"eHealth: Health Informatics Meets eHealth","start_date":"2017-05-23","location":"Vienna, Austria","end_date":"2017-05-24"},"status":"public","pubrep_id":"906","has_accepted_license":"1","year":"2017","day":"01","page":"356 - 362","date_published":"2017-01-01T00:00:00Z","doi":"10.3233/978-1-61499-759-7-356","date_created":"2018-12-11T11:47:36Z","quality_controlled":"1","publisher":"IOS Press","oa":1,"citation":{"mla":"Sauermann, Stefan, et al. Biosignals Standards and FHIR: The Way to Go. Vol. 236, IOS Press, 2017, pp. 356–62, doi:10.3233/978-1-61499-759-7-356.","apa":"Sauermann, S., David, V., Schlögl, A., Egelkraut, R., Frohner, M., Pohn, B., … Mense, A. (2017). Biosignals standards and FHIR: The way to go (Vol. 236, pp. 356–362). Presented at the eHealth: Health Informatics Meets eHealth, Vienna, Austria: IOS Press. https://doi.org/10.3233/978-1-61499-759-7-356","ama":"Sauermann S, David V, Schlögl A, et al. Biosignals standards and FHIR: The way to go. In: Vol 236. IOS Press; 2017:356-362. doi:10.3233/978-1-61499-759-7-356","short":"S. Sauermann, V. David, A. Schlögl, R. Egelkraut, M. Frohner, B. Pohn, P. Urbauer, A. Mense, in:, IOS Press, 2017, pp. 356–362.","ieee":"S. Sauermann et al., “Biosignals standards and FHIR: The way to go,” presented at the eHealth: Health Informatics Meets eHealth, Vienna, Austria, 2017, vol. 236, pp. 356–362.","chicago":"Sauermann, Stefan, Veronika David, Alois Schlögl, Reinhard Egelkraut, Matthias Frohner, Birgit Pohn, Philipp Urbauer, and Alexander Mense. “Biosignals Standards and FHIR: The Way to Go,” 236:356–62. IOS Press, 2017. https://doi.org/10.3233/978-1-61499-759-7-356.","ista":"Sauermann S, David V, Schlögl A, Egelkraut R, Frohner M, Pohn B, Urbauer P, Mense A. 2017. Biosignals standards and FHIR: The way to go. eHealth: Health Informatics Meets eHealth, Studies in Health Technology and Informatics, vol. 236, 356–362."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Sauermann","full_name":"Sauermann, Stefan","first_name":"Stefan"},{"first_name":"Veronika","last_name":"David","full_name":"David, Veronika"},{"first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois"},{"last_name":"Egelkraut","full_name":"Egelkraut, Reinhard","first_name":"Reinhard"},{"first_name":"Matthias","last_name":"Frohner","full_name":"Frohner, Matthias"},{"full_name":"Pohn, Birgit","last_name":"Pohn","first_name":"Birgit"},{"first_name":"Philipp","last_name":"Urbauer","full_name":"Urbauer, Philipp"},{"first_name":"Alexander","full_name":"Mense, Alexander","last_name":"Mense"}],"publist_id":"7164","title":"Biosignals standards and FHIR: The way to go"},{"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"issue":"6","volume":145,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We consider a 2D quantum system of N bosons in a trapping potential |x|s, interacting via a pair potential of the form N2β−1 w(Nβ x). We show that for all 0 < β < (s + 1)/(s + 2), the leading order behavior of ground states of the many-body system is described in the large N limit by the corresponding cubic nonlinear Schrödinger energy functional. Our result covers the focusing case (w < 0) where even the stability of the many-body system is not obvious. This answers an open question mentioned by X. Chen and J. Holmer for harmonic traps (s = 2). Together with the BBGKY hierarchy approach used by these authors, our result implies the convergence of the many-body quantum dynamics to the focusing NLS equation with harmonic trap for all 0 < β < 3/4. "}],"intvolume":" 145","month":"01","main_file_link":[{"url":"https://arxiv.org/abs/1509.09045","open_access":"1"}],"scopus_import":1,"date_updated":"2021-01-12T08:07:03Z","department":[{"_id":"RoSe"}],"_id":"632","status":"public","type":"journal_article","publication":"Proceedings of the American Mathematical Society","day":"01","year":"2017","date_created":"2018-12-11T11:47:36Z","date_published":"2017-01-01T00:00:00Z","doi":"10.1090/proc/13468","page":"2441 - 2454","oa":1,"publisher":"American Mathematical Society","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “A Note on 2D Focusing Many Boson Systems.” Proceedings of the American Mathematical Society. American Mathematical Society, 2017. https://doi.org/10.1090/proc/13468.","ista":"Lewin M, Nam P, Rougerie N. 2017. A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. 145(6), 2441–2454.","mla":"Lewin, Mathieu, et al. “A Note on 2D Focusing Many Boson Systems.” Proceedings of the American Mathematical Society, vol. 145, no. 6, American Mathematical Society, 2017, pp. 2441–54, doi:10.1090/proc/13468.","ama":"Lewin M, Nam P, Rougerie N. A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. 2017;145(6):2441-2454. doi:10.1090/proc/13468","apa":"Lewin, M., Nam, P., & Rougerie, N. (2017). A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/13468","short":"M. Lewin, P. Nam, N. Rougerie, Proceedings of the American Mathematical Society 145 (2017) 2441–2454.","ieee":"M. Lewin, P. Nam, and N. Rougerie, “A note on 2D focusing many boson systems,” Proceedings of the American Mathematical Society, vol. 145, no. 6. American Mathematical Society, pp. 2441–2454, 2017."},"title":"A note on 2D focusing many boson systems","author":[{"full_name":"Lewin, Mathieu","last_name":"Lewin","first_name":"Mathieu"},{"id":"404092F4-F248-11E8-B48F-1D18A9856A87","first_name":"Phan","last_name":"Nam","full_name":"Nam, Phan"},{"first_name":"Nicolas","full_name":"Rougerie, Nicolas","last_name":"Rougerie"}],"publist_id":"7160","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}]},{"quality_controlled":"1","publisher":"Springer","date_created":"2018-12-11T11:47:37Z","date_published":"2017-05-28T00:00:00Z","doi":"10.1007/978-3-319-52498-6_10","page":"189 - 211","publication":"Translational Anatomy and Cell Biology of Autism Spectrum Disorder","day":"28","year":"2017","project":[{"name":"Transmembrane Transporters in Health and Disease","grant_number":"F03523","call_identifier":"FWF","_id":"25473368-B435-11E9-9278-68D0E5697425"}],"editor":[{"full_name":"Schmeisser, Michael","last_name":"Schmeisser","first_name":"Michael"},{"first_name":"Tobias","last_name":"Boekers","full_name":"Boekers, Tobias"}],"title":"Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder","publist_id":"7156","author":[{"full_name":"Schroeder, Jan","last_name":"Schroeder","first_name":"Jan"},{"last_name":"Deliu","orcid":"0000-0002-7370-5293","full_name":"Deliu, Elena","first_name":"Elena","id":"37A40D7E-F248-11E8-B48F-1D18A9856A87"},{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia","last_name":"Novarino","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia"},{"last_name":"Schmeisser","full_name":"Schmeisser, Michael","first_name":"Michael"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Schroeder, Jan, et al. “Genetic and Pharmacological Reversibility of Phenotypes in Mouse Models of Autism Spectrum Disorder.” Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, vol. 224, Springer, 2017, pp. 189–211, doi:10.1007/978-3-319-52498-6_10.","ieee":"J. Schroeder, E. Deliu, G. Novarino, and M. Schmeisser, “Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder,” in Translational Anatomy and Cell Biology of Autism Spectrum Disorder, vol. 224, M. Schmeisser and T. Boekers, Eds. Springer, 2017, pp. 189–211.","short":"J. Schroeder, E. Deliu, G. Novarino, M. Schmeisser, in:, M. Schmeisser, T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder, Springer, 2017, pp. 189–211.","apa":"Schroeder, J., Deliu, E., Novarino, G., & Schmeisser, M. (2017). Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder. In M. Schmeisser & T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder (Vol. 224, pp. 189–211). Springer. https://doi.org/10.1007/978-3-319-52498-6_10","ama":"Schroeder J, Deliu E, Novarino G, Schmeisser M. Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder. In: Schmeisser M, Boekers T, eds. Translational Anatomy and Cell Biology of Autism Spectrum Disorder. Vol 224. Advances in Anatomy Embryology and Cell Biology. Springer; 2017:189-211. doi:10.1007/978-3-319-52498-6_10","chicago":"Schroeder, Jan, Elena Deliu, Gaia Novarino, and Michael Schmeisser. “Genetic and Pharmacological Reversibility of Phenotypes in Mouse Models of Autism Spectrum Disorder.” In Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, 224:189–211. Advances in Anatomy Embryology and Cell Biology. Springer, 2017. https://doi.org/10.1007/978-3-319-52498-6_10.","ista":"Schroeder J, Deliu E, Novarino G, Schmeisser M. 2017.Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder. In: Translational Anatomy and Cell Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 189–211."},"intvolume":" 224","month":"05","scopus_import":1,"alternative_title":["ADVSANAT"],"oa_version":"None","abstract":[{"lang":"eng","text":"As autism spectrum disorder (ASD) is largely regarded as a neurodevelopmental condition, long-time consensus was that its hallmark features are irreversible. However, several studies from recent years using defined mouse models of ASD have provided clear evidence that in mice neurobiological and behavioural alterations can be ameliorated or even reversed by genetic restoration or pharmacological treatment either before or after symptom onset. Here, we review findings on genetic and pharmacological reversibility of phenotypes in mouse models of ASD. Our review should give a comprehensive overview on both aspects and encourage future studies to better understand the underlying molecular mechanisms that might be translatable from animals to humans."}],"volume":224,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eisbn":["978-3-319-52498-6"]},"status":"public","type":"book_chapter","_id":"634","series_title":"Advances in Anatomy Embryology and Cell Biology","department":[{"_id":"GaNo"}],"date_updated":"2021-01-12T08:07:08Z"},{"day":"01","year":"2017","date_created":"2018-12-11T11:47:37Z","doi":"10.1007/978-3-319-63501-9_6","date_published":"2017-01-01T00:00:00Z","page":"83 - 89","publisher":"Springer","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Bak, Stanley, Sergiy Bogomolov, Thomas A Henzinger, and Aviral Kumar. “Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees.” edited by Alessandro Abate and Sylvie Bodo, 10381:83–89. Springer, 2017. https://doi.org/10.1007/978-3-319-63501-9_6.","ista":"Bak S, Bogomolov S, Henzinger TA, Kumar A. 2017. Challenges and tool implementation of hybrid rapidly exploring random trees. NSV: Numerical Software Verification, LNCS, vol. 10381, 83–89.","mla":"Bak, Stanley, et al. Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees. Edited by Alessandro Abate and Sylvie Bodo, vol. 10381, Springer, 2017, pp. 83–89, doi:10.1007/978-3-319-63501-9_6.","ama":"Bak S, Bogomolov S, Henzinger TA, Kumar A. Challenges and tool implementation of hybrid rapidly exploring random trees. In: Abate A, Bodo S, eds. Vol 10381. Springer; 2017:83-89. doi:10.1007/978-3-319-63501-9_6","apa":"Bak, S., Bogomolov, S., Henzinger, T. A., & Kumar, A. (2017). Challenges and tool implementation of hybrid rapidly exploring random trees. In A. Abate & S. Bodo (Eds.) (Vol. 10381, pp. 83–89). Presented at the NSV: Numerical Software Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63501-9_6","short":"S. Bak, S. Bogomolov, T.A. Henzinger, A. Kumar, in:, A. Abate, S. Bodo (Eds.), Springer, 2017, pp. 83–89.","ieee":"S. Bak, S. Bogomolov, T. A. Henzinger, and A. Kumar, “Challenges and tool implementation of hybrid rapidly exploring random trees,” presented at the NSV: Numerical Software Verification, Heidelberg, Germany, 2017, vol. 10381, pp. 83–89."},"editor":[{"first_name":"Alessandro","last_name":"Abate","full_name":"Abate, Alessandro"},{"first_name":"Sylvie","last_name":"Bodo","full_name":"Bodo, Sylvie"}],"title":"Challenges and tool implementation of hybrid rapidly exploring random trees","publist_id":"7159","author":[{"first_name":"Stanley","full_name":"Bak, Stanley","last_name":"Bak"},{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy","last_name":"Bogomolov","full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"first_name":"Aviral","full_name":"Kumar, Aviral","last_name":"Kumar"}],"project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-331963500-2"]},"volume":10381,"oa_version":"None","abstract":[{"text":"A Rapidly-exploring Random Tree (RRT) is an algorithm which can search a non-convex region of space by incrementally building a space-filling tree. The tree is constructed from random points drawn from system’s state space and is biased to grow towards large unexplored areas in the system. RRT can provide better coverage of a system’s possible behaviors compared with random simulations, but is more lightweight than full reachability analysis. In this paper, we explore some of the design decisions encountered while implementing a hybrid extension of the RRT algorithm, which have not been elaborated on before. In particular, we focus on handling non-determinism, which arises due to discrete transitions. We introduce the notion of important points to account for this phenomena. We showcase our ideas using heater and navigation benchmarks.","lang":"eng"}],"intvolume":" 10381","month":"01","scopus_import":1,"alternative_title":["LNCS"],"date_updated":"2021-01-12T08:07:06Z","department":[{"_id":"ToHe"}],"_id":"633","status":"public","conference":{"location":"Heidelberg, Germany","end_date":"2017-07-23","start_date":"2017-07-22","name":"NSV: Numerical Software Verification"},"type":"conference"},{"page":"33 - 62","date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-319-56617-7_2","date_created":"2018-12-11T11:47:37Z","year":"2017","day":"01","publisher":"Springer","quality_controlled":"1","oa":1,"publist_id":"7154","author":[{"first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","last_name":"Alwen"},{"first_name":"Binchi","last_name":"Chen","full_name":"Chen, Binchi"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"},{"last_name":"Reyzin","full_name":"Reyzin, Leonid","first_name":"Leonid"},{"last_name":"Tessaro","full_name":"Tessaro, Stefano","first_name":"Stefano"}],"title":"Scrypt is maximally memory hard","editor":[{"full_name":"Coron, Jean-Sébastien","last_name":"Coron","first_name":"Jean-Sébastien"},{"first_name":"Jesper","last_name":"Buus Nielsen","full_name":"Buus Nielsen, Jesper"}],"citation":{"ista":"Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 33–62.","chicago":"Alwen, Joel F, Binchi Chen, Krzysztof Z Pietrzak, Leonid Reyzin, and Stefano Tessaro. “Scrypt Is Maximally Memory Hard.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:33–62. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_2.","ieee":"J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62.","short":"J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.","ama":"Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. Scrypt is maximally memory hard. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:33-62. doi:10.1007/978-3-319-56617-7_2","apa":"Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., & Tessaro, S. (2017). Scrypt is maximally memory hard. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol. 10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_2","mla":"Alwen, Joel F., et al. Scrypt Is Maximally Memory Hard. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:10.1007/978-3-319-56617-7_2."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"volume":10212,"ec_funded":1,"publication_identifier":{"isbn":["978-331956616-0"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/989"}],"month":"01","intvolume":" 10212","abstract":[{"text":"Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is dominated by memory cost. As memory, unlike computation, costs about the same across different platforms, MHFs cannot be evaluated at significantly lower cost on dedicated hardware like ASICs. MHFs have found widespread applications including password hashing, key derivation, and proofs-of-work. This paper focuses on scrypt, a simple candidate MHF designed by Percival, and described in RFC 7914. It has been used within a number of cryptocurrencies (e.g., Litecoin and Dogecoin) and has been an inspiration for Argon2d, one of the winners of the recent password-hashing competition. Despite its popularity, no rigorous lower bounds on its memory complexity are known. We prove that scrypt is optimally memory-hard, i.e., its cumulative memory complexity (cmc) in the parallel random oracle model is Ω(n2w), where w and n are the output length and number of invocations of the underlying hash function, respectively. High cmc is a strong security target for MHFs introduced by Alwen and Serbinenko (STOC’15) which implies high memory cost even for adversaries who can amortize the cost over many evaluations and evaluate the underlying hash functions many times in parallel. Our proof is the first showing optimal memory-hardness for any MHF. Our result improves both quantitatively and qualitatively upon the recent work by Alwen et al. (EUROCRYPT’16) who proved a weaker lower bound of Ω(n2w/ log2 n) for a restricted class of adversaries.","lang":"eng"}],"oa_version":"Submitted Version","department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T08:07:10Z","type":"conference","conference":{"start_date":"2017-04-30","end_date":"2017-05-04","location":"Paris, France","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"status":"public","_id":"635"},{"oa_version":"Submitted Version","abstract":[{"text":"Signal regular expressions can specify sequential properties of real-valued signals based on threshold conditions, regular operations, and duration constraints. In this paper we endow them with a quantitative semantics which indicates how robustly a signal matches or does not match a given expression. First, we show that this semantics is a safe approximation of a distance between the signal and the language defined by the expression. Then, we consider the robust matching problem, that is, computing the quantitative semantics of every segment of a given signal relative to an expression. We present an algorithm that solves this problem for piecewise-constant and piecewise-linear signals and show that for such signals the robustness map is a piecewise-linear function. The availability of an indicator describing how robustly a signal segment matches some regular pattern provides a general framework for quantitative monitoring of cyber-physical systems.","lang":"eng"}],"month":"08","intvolume":" 10419","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01552132","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331965764-6"]},"publication_status":"published","volume":10419,"_id":"636","status":"public","type":"conference","conference":{"start_date":"2017-09-05","location":"Berlin, Germany","end_date":"2017-09-07","name":"FORMATS: Formal Modelling and Analysis of Timed Systems"},"date_updated":"2021-01-12T08:07:14Z","department":[{"_id":"ToHe"}],"quality_controlled":"1","publisher":"Springer","oa":1,"day":"03","year":"2017","doi":"10.1007/978-3-319-65765-3_11","date_published":"2017-08-03T00:00:00Z","date_created":"2018-12-11T11:47:38Z","page":"189 - 206","project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Bakhirkin, A., Ferrere, T., Maler, O., & Ulus, D. (2017). On the quantitative semantics of regular expressions over real-valued signals. In A. Abate & G. Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_11","ama":"Bakhirkin A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol 10419. Springer; 2017:189-206. doi:10.1007/978-3-319-65765-3_11","ieee":"A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics of regular expressions over real-valued signals,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 189–206.","short":"A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts (Eds.), Springer, 2017, pp. 189–206.","mla":"Bakhirkin, Alexey, et al. On the Quantitative Semantics of Regular Expressions over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi:10.1007/978-3-319-65765-3_11.","ista":"Bakhirkin A, Ferrere T, Maler O, Ulus D. 2017. On the quantitative semantics of regular expressions over real-valued signals. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 189–206.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the Quantitative Semantics of Regular Expressions over Real-Valued Signals.” edited by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_11."},"editor":[{"last_name":"Abate","full_name":"Abate, Alessandro","first_name":"Alessandro"},{"first_name":"Gilles","full_name":"Geeraerts, Gilles","last_name":"Geeraerts"}],"title":"On the quantitative semantics of regular expressions over real-valued signals","publist_id":"7152","author":[{"last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey","first_name":"Alexey"},{"last_name":"Ferrere","full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"},{"last_name":"Maler","full_name":"Maler, Oded","first_name":"Oded"},{"first_name":"Dogan","full_name":"Ulus, Dogan","last_name":"Ulus"}]},{"conference":{"name":"NSV: Numerical Software Verification","start_date":"2016-07-17","end_date":"2016-07-18","location":"Toronto, ON, Canada"},"type":"conference_editor","status":"public","_id":"638","series_title":"LNCS","article_processing_charge":"No","publist_id":"7150","department":[{"_id":"ToHe"}],"editor":[{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy","last_name":"Bogomolov"},{"full_name":"Martel, Matthieu","last_name":"Martel","first_name":"Matthieu"},{"first_name":"Pavithra","full_name":"Prabhakar, Pavithra","last_name":"Prabhakar"}],"title":"Numerical Software Verification","citation":{"apa":"Bogomolov, S., Martel, M., & Prabhakar, P. (Eds.). (2017). Numerical Software Verification (Vol. 10152). Presented at the NSV: Numerical Software Verification, Toronto, ON, Canada: Springer. https://doi.org/10.1007/978-3-319-54292-8","ama":"Bogomolov S, Martel M, Prabhakar P, eds. Numerical Software Verification. Vol 10152. Springer; 2017. doi:10.1007/978-3-319-54292-8","short":"S. Bogomolov, M. Martel, P. Prabhakar, eds., Numerical Software Verification, Springer, 2017.","ieee":"S. Bogomolov, M. Martel, and P. Prabhakar, Eds., Numerical Software Verification, vol. 10152. Springer, 2017.","mla":"Bogomolov, Sergiy, et al., editors. Numerical Software Verification. Vol. 10152, Springer, 2017, doi:10.1007/978-3-319-54292-8.","ista":"Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification, Springer,p.","chicago":"Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. Numerical Software Verification. Vol. 10152. LNCS. Springer, 2017. https://doi.org/10.1007/978-3-319-54292-8."},"date_updated":"2022-05-24T07:09:52Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Springer","intvolume":" 10152","month":"01","abstract":[{"lang":"eng","text":"This book constitutes the refereed proceedings of the 9th InternationalWorkshop on Numerical Software Verification, NSV 2016, held in Toronto, ON, Canada in July 2011 - colocated with CAV 2016, the 28th International Conference on Computer Aided Verification.\r\nThe NSV workshop is dedicated to the development of logical and mathematical techniques for the reasoning about programmability and reliability."}],"oa_version":"None","date_created":"2018-12-11T11:47:38Z","date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-319-54292-8","volume":10152,"publication_status":"published","year":"2017","publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-319-54292-8"]},"language":[{"iso":"eng"}],"day":"01"},{"_id":"640","status":"public","conference":{"location":"Paris, France","end_date":"2017-05-04","start_date":"2017-04-30","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"type":"conference","date_updated":"2021-01-12T08:07:22Z","department":[{"_id":"KrPi"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Data-independent Memory Hard Functions (iMHFS) are finding a growing number of applications in security; especially in the domain of password hashing. An important property of a concrete iMHF is specified by fixing a directed acyclic graph (DAG) Gn on n nodes. The quality of that iMHF is then captured by the following two pebbling complexities of Gn: – The parallel cumulative pebbling complexity Π∥cc(Gn) must be as high as possible (to ensure that the amortized cost of computing the function on dedicated hardware is dominated by the cost of memory). – The sequential space-time pebbling complexity Πst(Gn) should be as close as possible to Π∥cc(Gn) (to ensure that using many cores in parallel and amortizing over many instances does not give much of an advantage). In this paper we construct a family of DAGs with best possible parameters in an asymptotic sense, i.e., where Π∥cc(Gn) = Ω(n2/ log(n)) (which matches a known upper bound) and Πst(Gn) is within a constant factor of Π∥cc(Gn). Our analysis relies on a new connection between the pebbling complexity of a DAG and its depth-robustness (DR) – a well studied combinatorial property. We show that high DR is sufficient for high Π∥cc. Alwen and Blocki (CRYPTO’16) showed that high DR is necessary and so, together, these results fully characterize DAGs with high Π∥cc in terms of DR. Complementing these results, we provide new upper and lower bounds on the Π∥cc of several important candidate iMHFs from the literature. We give the first lower bounds on the memory hardness of the Catena and Balloon Hashing functions in a parallel model of computation and we give the first lower bounds of any kind for (a version) of Argon2i. Finally we describe a new class of pebbling attacks improving on those of Alwen and Blocki (CRYPTO’16). By instantiating these attacks we upperbound the Π∥cc of the Password Hashing Competition winner Argon2i and one of the Balloon Hashing functions by O (n1.71). We also show an upper bound of O(n1.625) for the Catena functions and the two remaining Balloon Hashing functions."}],"intvolume":" 10212","month":"04","main_file_link":[{"url":"https://eprint.iacr.org/2016/875","open_access":"1"}],"scopus_import":1,"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-331956616-0"]},"ec_funded":1,"volume":10212,"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Alwen, Joel F., et al. Depth-Robust Graphs and Their Cumulative Memory Complexity. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 3–32, doi:10.1007/978-3-319-56617-7_1.","short":"J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.","ieee":"J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.","ama":"Alwen JF, Blocki J, Pietrzak KZ. Depth-robust graphs and their cumulative memory complexity. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:3-32. doi:10.1007/978-3-319-56617-7_1","apa":"Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2017). Depth-robust graphs and their cumulative memory complexity. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_1","chicago":"Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Depth-Robust Graphs and Their Cumulative Memory Complexity.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:3–32. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_1.","ista":"Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 3–32."},"title":"Depth-robust graphs and their cumulative memory complexity","editor":[{"last_name":"Coron","full_name":"Coron, Jean-Sébastien","first_name":"Jean-Sébastien"},{"full_name":"Buus Nielsen, Jesper","last_name":"Buus Nielsen","first_name":"Jesper"}],"author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F"},{"last_name":"Blocki","full_name":"Blocki, Jeremiah","first_name":"Jeremiah"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"publist_id":"7148","oa":1,"publisher":"Springer","quality_controlled":"1","day":"01","year":"2017","date_created":"2018-12-11T11:47:39Z","date_published":"2017-04-01T00:00:00Z","doi":"10.1007/978-3-319-56617-7_1","page":"3 - 32"},{"status":"public","type":"conference","conference":{"end_date":"2017-06-08","location":"Kolding, Denmark","start_date":"2017-06-04","name":"SSVM: Scale Space and Variational Methods in Computer Vision"},"_id":"641","department":[{"_id":"VlKo"}],"title":"Graphical model parameter learning by inverse linear programming","editor":[{"first_name":"François","last_name":"Lauze","full_name":"Lauze, François"},{"full_name":"Dong, Yiqiu","last_name":"Dong","first_name":"Yiqiu"},{"last_name":"Bjorholm Dahl","full_name":"Bjorholm Dahl, Anders","first_name":"Anders"}],"author":[{"first_name":"Vera","last_name":"Trajkovska","full_name":"Trajkovska, Vera"},{"first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","full_name":"Swoboda, Paul","last_name":"Swoboda"},{"full_name":"Åström, Freddie","last_name":"Åström","first_name":"Freddie"},{"last_name":"Petra","full_name":"Petra, Stefanie","first_name":"Stefanie"}],"publist_id":"7147","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:07:23Z","citation":{"chicago":"Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_26.","ista":"Trajkovska V, Swoboda P, Åström F, Petra S. 2017. Graphical model parameter learning by inverse linear programming. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 323–334.","mla":"Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:10.1007/978-3-319-58771-4_26.","ieee":"V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter learning by inverse linear programming,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 323–334.","short":"V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.","apa":"Trajkovska, V., Swoboda, P., Åström, F., & Petra, S. (2017). Graphical model parameter learning by inverse linear programming. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_26","ama":"Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26"},"month":"01","intvolume":" 10302","quality_controlled":"1","publisher":"Springer","alternative_title":["LNCS"],"scopus_import":1,"oa_version":"None","abstract":[{"lang":"eng","text":"We introduce two novel methods for learning parameters of graphical models for image labelling. The following two tasks underline both methods: (i) perturb model parameters based on given features and ground truth labelings, so as to exactly reproduce these labelings as optima of the local polytope relaxation of the labelling problem; (ii) train a predictor for the perturbed model parameters so that improved model parameters can be applied to the labelling of novel data. Our first method implements task (i) by inverse linear programming and task (ii) using a regressor e.g. a Gaussian process. Our second approach simultaneously solves tasks (i) and (ii) in a joint manner, while being restricted to linearly parameterised predictors. Experiments demonstrate the merits of both approaches."}],"volume":10302,"doi":"10.1007/978-3-319-58771-4_26","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:47:39Z","page":"323 - 334","day":"01","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331958770-7"]},"publication_status":"published","year":"2017"},{"_id":"6426","type":"technical_report","status":"public","date_updated":"2023-02-21T16:59:21Z","citation":{"ista":"Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p.","chicago":"Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. Synchronizing the Asynchronous. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2018-853-v2-2.","short":"T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017.","ieee":"T. A. Henzinger, B. Kragl, and S. Qadeer, Synchronizing the asynchronous. IST Austria, 2017.","ama":"Henzinger TA, Kragl B, Qadeer S. Synchronizing the Asynchronous. IST Austria; 2017. doi:10.15479/AT:IST-2018-853-v2-2","apa":"Henzinger, T. A., Kragl, B., & Qadeer, S. (2017). Synchronizing the asynchronous. IST Austria. https://doi.org/10.15479/AT:IST-2018-853-v2-2","mla":"Henzinger, Thomas A., et al. Synchronizing the Asynchronous. IST Austria, 2017, doi:10.15479/AT:IST-2018-853-v2-2."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","last_name":"Kragl"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"file_date_updated":"2020-07-14T12:47:30Z","title":"Synchronizing the asynchronous","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent asynchronous computation threads. We show that specifications and correctness proofs for asynchronous programs can be structured by introducing the fiction, for proof purposes, that intermediate, non-quiescent states of asynchronous operations can be ignored. Then, the task of specification becomes relatively simple and the task of verification can be naturally decomposed into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure of an asynchronous program, the atomic effect of non-atomic operations and the synchronous effect of asynchronous operations. This structuring of specifications and proofs corresponds to the introduction of multiple layers of stepwise refinement for asynchronous programs. We present the first proof rule, called synchronization, to reduce asynchronous invocations on a lower layer to synchronous invocations on a higher layer. We implemented our proof method in CIVL and evaluated it on a collection of benchmark programs."}],"oa_version":"Published Version","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"month":"08","year":"2017","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"day":"04","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"6431","checksum":"b48d42725182d7ca10107a118815f4cf","date_updated":"2020-07-14T12:47:30Z","file_size":971347,"creator":"dernst","date_created":"2019-05-13T08:14:44Z","file_name":"main(1).pdf"}],"page":"28","date_created":"2019-05-13T08:15:55Z","date_published":"2017-08-04T00:00:00Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"133"}]},"doi":"10.15479/AT:IST-2018-853-v2-2"},{"publisher":"Chinese Physiological Society","quality_controlled":"1","date_created":"2018-12-11T11:47:40Z","doi":"10.4077/CJP.2017.BAF469","date_published":"2017-08-31T00:00:00Z","page":"207 - 214","publication":"Chinese Journal of Physiology","day":"31","year":"2017","title":"Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats","external_id":{"pmid":["28847140"]},"article_processing_charge":"No","publist_id":"7142","author":[{"full_name":"Sun, Wuping","last_name":"Sun","first_name":"Wuping"},{"first_name":"Ming-Zhu","id":"34009CFA-F248-11E8-B48F-1D18A9856A87","last_name":"Zhai","full_name":"Zhai, Ming-Zhu"},{"first_name":"Qian","full_name":"Zhou, Qian","last_name":"Zhou"},{"first_name":"Chengrui","last_name":"Qian","full_name":"Qian, Chengrui"},{"full_name":"Jiang, Changyu","last_name":"Jiang","first_name":"Changyu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Sun, Wuping, Ming-Zhu Zhai, Qian Zhou, Chengrui Qian, and Changyu Jiang. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” Chinese Journal of Physiology. Chinese Physiological Society, 2017. https://doi.org/10.4077/CJP.2017.BAF469.","ista":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. 2017. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 60(4), 207–214.","mla":"Sun, Wuping, et al. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” Chinese Journal of Physiology, vol. 60, no. 4, Chinese Physiological Society, 2017, pp. 207–14, doi:10.4077/CJP.2017.BAF469.","ieee":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, and C. Jiang, “Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats,” Chinese Journal of Physiology, vol. 60, no. 4. Chinese Physiological Society, pp. 207–214, 2017.","short":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, C. Jiang, Chinese Journal of Physiology 60 (2017) 207–214.","ama":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 2017;60(4):207-214. doi:10.4077/CJP.2017.BAF469","apa":"Sun, W., Zhai, M.-Z., Zhou, Q., Qian, C., & Jiang, C. (2017). Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. Chinese Physiological Society. https://doi.org/10.4077/CJP.2017.BAF469"},"intvolume":" 60","month":"08","scopus_import":1,"oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","text":"It has been reported that nicotinamide-overload induces oxidative stress associated with insulin resistance, the key feature of type 2 diabetes mellitus (T2DM). This study aimed to investigate the effects of B vitamins in T2DM. Glucose tolerance tests (GTT) were carried out in adult Sprague-Dawley rats treated with or without cumulative doses of B vitamins. More specifically, insulin tolerance tests (ITT) were also carried out in adult Sprague-Dawley rats treated with or without cumulative doses of Vitamin B3. We found that cumulative Vitamin B1 and Vitamin B3 administration significantly increased the plasma H2O2 levels associated with high insulin levels. Only Vitamin B3 reduced muscular and hepatic glycogen contents. Cumulative administration of nicotinic acid, another form of Vitamin B3, also significantly increased plasma insulin level and H2O2 generation. Moreover, cumulative administration of nicotinic acid or nicotinamide impaired glucose metabolism. This study suggested that excess Vitamin B1 and Vitamin B3 caused oxidative stress and insulin resistance."}],"volume":60,"issue":"4","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["03044920"]},"status":"public","article_type":"original","type":"journal_article","_id":"643","department":[{"_id":"RySh"}],"ddc":["570"],"date_updated":"2021-01-12T08:07:28Z"},{"title":"Localization errors in solving stochastic partial differential equations in the whole space","publist_id":"7144","author":[{"full_name":"Gerencser, Mate","last_name":"Gerencser","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate"},{"first_name":"István","full_name":"Gyöngy, István","last_name":"Gyöngy"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Gerencser M, Gyöngy I. 2017. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 86(307), 2373–2397.","chicago":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation. American Mathematical Society, 2017. https://doi.org/10.1090/mcom/3201.","short":"M. Gerencser, I. Gyöngy, Mathematics of Computation 86 (2017) 2373–2397.","ieee":"M. Gerencser and I. Gyöngy, “Localization errors in solving stochastic partial differential equations in the whole space,” Mathematics of Computation, vol. 86, no. 307. American Mathematical Society, pp. 2373–2397, 2017.","apa":"Gerencser, M., & Gyöngy, I. (2017). Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. American Mathematical Society. https://doi.org/10.1090/mcom/3201","ama":"Gerencser M, Gyöngy I. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 2017;86(307):2373-2397. doi:10.1090/mcom/3201","mla":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation, vol. 86, no. 307, American Mathematical Society, 2017, pp. 2373–97, doi:10.1090/mcom/3201."},"doi":"10.1090/mcom/3201","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:47:40Z","page":"2373 - 2397","day":"01","publication":"Mathematics of Computation","year":"2017","quality_controlled":"1","publisher":"American Mathematical Society","oa":1,"department":[{"_id":"JaMa"}],"date_updated":"2021-01-12T08:07:26Z","status":"public","type":"journal_article","_id":"642","volume":86,"issue":"307","language":[{"iso":"eng"}],"publication_identifier":{"issn":["00255718"]},"publication_status":"published","month":"01","intvolume":" 86","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.05535"}],"oa_version":"Submitted Version","abstract":[{"text":"Cauchy problems with SPDEs on the whole space are localized to Cauchy problems on a ball of radius R. This localization reduces various kinds of spatial approximation schemes to finite dimensional problems. The error is shown to be exponentially small. As an application, a numerical scheme is presented which combines the localization and the space and time discretization, and thus is fully implementable.","lang":"eng"}]},{"status":"public","conference":{"name":"CAV: Computer Aided Verification","start_date":"2017-07-24","end_date":"2017-07-28","location":"Heidelberg, Germany"},"type":"conference","_id":"645","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:07:32Z","intvolume":" 10426","month":"07","main_file_link":[{"url":"https://arxiv.org/abs/1705.02326","open_access":"1"}],"alternative_title":["LNCS"],"scopus_import":1,"oa_version":"Submitted Version","abstract":[{"text":"Markov decision processes (MDPs) are standard models for probabilistic systems with non-deterministic behaviours. Long-run average rewards provide a mathematically elegant formalism for expressing long term performance. Value iteration (VI) is one of the simplest and most efficient algorithmic approaches to MDPs with other properties, such as reachability objectives. Unfortunately, a naive extension of VI does not work for MDPs with long-run average rewards, as there is no known stopping criterion. In this work our contributions are threefold. (1) We refute a conjecture related to stopping criteria for MDPs with long-run average rewards. (2) We present two practical algorithms for MDPs with long-run average rewards based on VI. First, we show that a combination of applying VI locally for each maximal end-component (MEC) and VI for reachability objectives can provide approximation guarantees. Second, extending the above approach with a simulation-guided on-demand variant of VI, we present an anytime algorithm that is able to deal with very large models. (3) Finally, we present experimental results showing that our methods significantly outperform the standard approaches on several benchmarks.","lang":"eng"}],"ec_funded":1,"volume":10426,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-331963386-2"]},"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"title":"Value iteration for long run average reward in markov decision processes","editor":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"first_name":"Viktor","full_name":"Kunčak, Viktor","last_name":"Kunčak"}],"publist_id":"7135","author":[{"first_name":"Pranav","last_name":"Ashok","full_name":"Ashok, Pranav"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca","full_name":"Daca, Przemyslaw"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881"},{"first_name":"Tobias","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.","ieee":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.","ama":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration for long run average reward in markov decision processes. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:201-221. doi:10.1007/978-3-319-63387-9_10","apa":"Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., & Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_10","mla":"Ashok, Pranav, et al. Value Iteration for Long Run Average Reward in Markov Decision Processes. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:10.1007/978-3-319-63387-9_10.","ista":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.","chicago":"Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_10."},"oa":1,"publisher":"Springer","quality_controlled":"1","date_created":"2018-12-11T11:47:41Z","doi":"10.1007/978-3-319-63387-9_10","date_published":"2017-07-13T00:00:00Z","page":"201 - 221","day":"13","year":"2017"},{"type":"journal_article","status":"public","_id":"644","department":[{"_id":"VlKo"}],"date_updated":"2023-02-23T10:07:49Z","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1502.07327"}],"month":"06","intvolume":" 46","abstract":[{"lang":"eng","text":"An instance of the valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates an infeasible assignment. The goal is to find an assignment of labels to the variables that minimizes the sum. We study, assuming that P 6= NP, how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in f0;1g corresponds to ordinary CSPs, where one deals only with the feasibility issue, and there is no optimization. This case is the subject of the algebraic CSP dichotomy conjecture predicting for which constraint languages CSPs are tractable (i.e., solvable in polynomial time) and for which they are NP-hard. The case when all allowed functions take only finite values corresponds to a finitevalued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Živný. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP (i.e., the problem of deciding whether a given instance has a feasible solution) corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs."}],"oa_version":"Preprint","issue":"3","related_material":{"record":[{"relation":"other","id":"1637","status":"public"}]},"volume":46,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"author":[{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andrei","full_name":"Krokhin, Andrei","last_name":"Krokhin"},{"last_name":"Rolinek","full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal"}],"publist_id":"7138","title":"The complexity of general-valued CSPs","citation":{"apa":"Kolmogorov, V., Krokhin, A., & Rolinek, M. (2017). The complexity of general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16M1091836","ama":"Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836","ieee":"V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” SIAM Journal on Computing, vol. 46, no. 3. SIAM, pp. 1087–1110, 2017.","short":"V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.","mla":"Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.","ista":"Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.","chicago":"Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2017. https://doi.org/10.1137/16M1091836."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"SIAM","quality_controlled":"1","oa":1,"page":"1087 - 1110","date_published":"2017-06-29T00:00:00Z","doi":"10.1137/16M1091836","date_created":"2018-12-11T11:47:40Z","year":"2017","day":"29","publication":"SIAM Journal on Computing"},{"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"title":"A novel convex relaxation for non binary discrete tomography","editor":[{"first_name":"François","last_name":"Lauze","full_name":"Lauze, François"},{"first_name":"Yiqiu","full_name":"Dong, Yiqiu","last_name":"Dong"},{"first_name":"Anders","last_name":"Bjorholm Dahl","full_name":"Bjorholm Dahl, Anders"}],"publist_id":"7132","author":[{"full_name":"Kuske, Jan","last_name":"Kuske","first_name":"Jan"},{"full_name":"Swoboda, Paul","last_name":"Swoboda","id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul"},{"first_name":"Stefanie","full_name":"Petra, Stefanie","last_name":"Petra"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.","apa":"Kuske, J., Swoboda, P., & Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_19","ama":"Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:10.1007/978-3-319-58771-4_19","short":"J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.","ieee":"J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary discrete tomography,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.","chicago":"Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_19.","ista":"Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246."},"quality_controlled":"1","publisher":"Springer","oa":1,"date_published":"2017-06-01T00:00:00Z","doi":"10.1007/978-3-319-58771-4_19","date_created":"2018-12-11T11:47:41Z","page":"235 - 246","day":"01","year":"2017","status":"public","type":"conference","conference":{"end_date":"2017-06-08","location":"Kolding, Denmark","start_date":"2017-06-04","name":"SSVM: Scale Space and Variational Methods in Computer Vision"},"_id":"646","department":[{"_id":"VlKo"}],"date_updated":"2021-01-12T08:07:34Z","month":"06","intvolume":" 10302","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1703.03769","open_access":"1"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art approaches that split the problem into a continuous reconstruction problem for the linear measurement constraints and a discrete labeling problem to enforce discrete-valued reconstructions, we propose a joint formulation that addresses both problems simultaneously, resulting in a tighter convex relaxation. For this purpose a constrained graphical model is set up and evaluated using a novel relaxation optimized by dual decomposition. We evaluate our approach experimentally and show superior solutions both mathematically (tighter relaxation) and experimentally in comparison to previously proposed relaxations."}],"volume":10302,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331958770-7"]},"publication_status":"published"},{"quality_controlled":"1","publisher":"Springer","oa":1,"day":"01","year":"2017","doi":"10.1007/978-3-319-55911-7_43","date_published":"2017-04-01T00:00:00Z","date_created":"2018-12-11T11:47:42Z","page":"600 - 613","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Skórski M. 2017. On the complexity of breaking pseudoentropy. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 600–613.","chicago":"Skórski, Maciej. “On the Complexity of Breaking Pseudoentropy.” edited by Gerhard Jäger and Silvia Steila, 10185:600–613. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_43.","apa":"Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_43","ama":"Skórski M. On the complexity of breaking pseudoentropy. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:600-613. doi:10.1007/978-3-319-55911-7_43","ieee":"M. Skórski, “On the complexity of breaking pseudoentropy,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 600–613.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613.","mla":"Skórski, Maciej. On the Complexity of Breaking Pseudoentropy. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:10.1007/978-3-319-55911-7_43."},"title":"On the complexity of breaking pseudoentropy","editor":[{"first_name":"Gerhard","full_name":"Jäger, Gerhard","last_name":"Jäger"},{"first_name":"Silvia","full_name":"Steila, Silvia","last_name":"Steila"}],"publist_id":"7125","author":[{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej","last_name":"Skórski","full_name":"Skórski, Maciej"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Pseudoentropy has found a lot of important applications to cryptography and complexity theory. In this paper we focus on the foundational problem that has not been investigated so far, namely by how much pseudoentropy (the amount seen by computationally bounded attackers) differs from its information-theoretic counterpart (seen by unbounded observers), given certain limits on attacker’s computational power? We provide the following answer for HILL pseudoentropy, which exhibits a threshold behavior around the size exponential in the entropy amount:– If the attacker size (s) and advantage () satisfy s (formula presented) where k is the claimed amount of pseudoentropy, then the pseudoentropy boils down to the information-theoretic smooth entropy. – If s (formula presented) then pseudoentropy could be arbitrarily bigger than the information-theoretic smooth entropy. Besides answering the posted question, we show an elegant application of our result to the complexity theory, namely that it implies the clas-sical result on the existence of functions hard to approximate (due to Pippenger). In our approach we utilize non-constructive techniques: the duality of linear programming and the probabilistic method."}],"month":"04","intvolume":" 10185","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/1186.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331955910-0"]},"publication_status":"published","volume":10185,"_id":"648","status":"public","type":"conference","conference":{"name":"TAMC: Theory and Applications of Models of Computation","location":"Bern, Switzerland","end_date":"2017-04-22","start_date":"2017-04-20"},"date_updated":"2021-01-12T08:07:39Z","department":[{"_id":"KrPi"}]},{"department":[{"_id":"JaMa"}],"date_updated":"2022-05-24T07:01:33Z","status":"public","type":"book_chapter","_id":"649","series_title":"Lecture Notes in Mathematics","volume":2184,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-319-58001-2"],"eissn":["978-3-319-58002-9"]},"publication_status":"published","month":"10","intvolume":" 2184","scopus_import":"1","oa_version":"None","abstract":[{"text":"We give a short overview on a recently developed notion of Ricci curvature for discrete spaces. This notion relies on geodesic convexity properties of the relative entropy along geodesics in the space of probability densities, for a metric which is similar to (but different from) the 2-Wasserstein metric. The theory can be considered as a discrete counterpart to the theory of Ricci curvature for geodesic measure spaces developed by Lott–Sturm–Villani.","lang":"eng"}],"editor":[{"first_name":"Laurent","last_name":"Najman","full_name":"Najman, Laurent"},{"full_name":"Romon, Pascal","last_name":"Romon","first_name":"Pascal"}],"title":"Entropic Ricci curvature for discrete spaces","publist_id":"7123","author":[{"orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","last_name":"Maas","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Maas J. 2017.Entropic Ricci curvature for discrete spaces. In: Modern Approaches to Discrete Curvature. vol. 2184, 159–174.","chicago":"Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” In Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, 2184:159–74. Lecture Notes in Mathematics. Springer, 2017. https://doi.org/10.1007/978-3-319-58002-9_5.","short":"J. Maas, in:, L. Najman, P. Romon (Eds.), Modern Approaches to Discrete Curvature, Springer, 2017, pp. 159–174.","ieee":"J. Maas, “Entropic Ricci curvature for discrete spaces,” in Modern Approaches to Discrete Curvature, vol. 2184, L. Najman and P. Romon, Eds. Springer, 2017, pp. 159–174.","apa":"Maas, J. (2017). Entropic Ricci curvature for discrete spaces. In L. Najman & P. Romon (Eds.), Modern Approaches to Discrete Curvature (Vol. 2184, pp. 159–174). Springer. https://doi.org/10.1007/978-3-319-58002-9_5","ama":"Maas J. Entropic Ricci curvature for discrete spaces. In: Najman L, Romon P, eds. Modern Approaches to Discrete Curvature. Vol 2184. Lecture Notes in Mathematics. Springer; 2017:159-174. doi:10.1007/978-3-319-58002-9_5","mla":"Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, vol. 2184, Springer, 2017, pp. 159–74, doi:10.1007/978-3-319-58002-9_5."},"doi":"10.1007/978-3-319-58002-9_5","date_published":"2017-10-05T00:00:00Z","date_created":"2018-12-11T11:47:42Z","page":"159 - 174","day":"05","publication":"Modern Approaches to Discrete Curvature","year":"2017","quality_controlled":"1","publisher":"Springer"},{"volume":10185,"publication_identifier":{"issn":["03029743"]},"publication_status":"published","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/965.pdf"}],"month":"01","intvolume":" 10185","abstract":[{"text":"In this work we present a short and unified proof for the Strong and Weak Regularity Lemma, based on the cryptographic tech-nique called low-complexity approximations. In short, both problems reduce to a task of finding constructively an approximation for a certain target function under a class of distinguishers (test functions), where dis-tinguishers are combinations of simple rectangle-indicators. In our case these approximations can be learned by a simple iterative procedure, which yields a unified and simple proof, achieving for any graph with density d and any approximation parameter the partition size. The novelty in our proof is: (a) a simple approach which yields both strong and weaker variant, and (b) improvements when d = o(1). At an abstract level, our proof can be seen a refinement and simplification of the “analytic” proof given by Lovasz and Szegedy.","lang":"eng"}],"oa_version":"Submitted Version","department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T08:07:46Z","type":"conference","conference":{"location":"Bern, Switzerland","end_date":"2017-04-22","start_date":"2017-04-20","name":"TAMC: Theory and Applications of Models of Computation"},"status":"public","_id":"650","page":"586 - 599","date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-319-55911-7_42","date_created":"2018-12-11T11:47:42Z","year":"2017","day":"01","publisher":"Springer","quality_controlled":"1","oa":1,"publist_id":"7119","author":[{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej","last_name":"Skórski","full_name":"Skórski, Maciej"}],"title":"A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds","editor":[{"first_name":"Gerhard","full_name":"Jäger, Gerhard","last_name":"Jäger"},{"last_name":"Steila","full_name":"Steila, Silvia","first_name":"Silvia"}],"citation":{"chicago":"Skórski, Maciej. “A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds.” edited by Gerhard Jäger and Silvia Steila, 10185:586–99. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_42.","ista":"Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 586–599.","mla":"Skórski, Maciej. A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:10.1007/978-3-319-55911-7_42.","ieee":"M. Skórski, “A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 586–599.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 586–599.","ama":"Skórski M. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:586-599. doi:10.1007/978-3-319-55911-7_42","apa":"Skórski, M. (2017). A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 586–599). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_42"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"_id":"6519","status":"public","conference":{"name":"CSL: Conference on Computer Science Logic","location":"Stockholm, Sweden","end_date":"2017-08-24","start_date":"2017-08-20"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"conference","ddc":["004"],"date_updated":"2023-02-14T10:08:25Z","file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","abstract":[{"text":"Graph games with omega-regular winning conditions provide a mathematical framework to analyze a wide range of problems in the analysis of reactive systems and programs (such as the synthesis of reactive systems, program repair, and the verification of branching time properties). Parity conditions are canonical forms to specify omega-regular winning conditions. Graph games with parity conditions are equivalent to mu-calculus model checking, and thus a very important algorithmic problem. Symbolic algorithms are of great significance because they provide scalable algorithms for the analysis of large finite-state systems, as well as algorithms for the analysis of infinite-state systems with finite quotient. A set-based symbolic algorithm uses the basic set operations and the one-step predecessor operators. We consider graph games with n vertices and parity conditions with c priorities (equivalently, a mu-calculus formula with c alternations of least and greatest fixed points). While many explicit algorithms exist for graph games with parity conditions, for set-based symbolic algorithms there are only two algorithms (notice that we use space to refer to the number of sets stored by a symbolic algorithm): (a) the basic algorithm that requires O(n^c) symbolic operations and linear space; and (b) an improved algorithm that requires O(n^{c/2+1}) symbolic operations but also O(n^{c/2+1}) space (i.e., exponential space). In this work we present two set-based symbolic algorithms for parity games: (a) our first algorithm requires O(n^{c/2+1}) symbolic operations and only requires linear space; and (b) developing on our first algorithm, we present an algorithm that requires O(n^{c/3+1}) symbolic operations and only linear space. We also present the first linear space set-based symbolic algorithm for parity games that requires at most a sub-exponential number of symbolic operations. ","lang":"eng"}],"intvolume":" 82","month":"08","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"file_id":"6520","checksum":"7c2c9d09970af79026d7e37d9b632ef8","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2017_LIPIcs-Chatterjee.pdf","date_created":"2019-06-04T12:56:52Z","creator":"kschuh","file_size":710185,"date_updated":"2020-07-14T12:47:33Z"}],"publication_status":"published","ec_funded":1,"volume":82,"article_number":"18","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 18.","mla":"Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for Parity Games. Vol. 82, 18, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, doi:10.4230/LIPICS.CSL.2017.18.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18","ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik; 2017. doi:10.4230/LIPICS.CSL.2017.18"},"title":"Improved set-based symbolic algorithms for parity games","article_processing_charge":"No","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Dvorák","full_name":"Dvorák, Wolfgang","first_name":"Wolfgang"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"first_name":"Veronika","full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer"}],"oa":1,"publisher":"Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik","quality_controlled":"1","day":"01","year":"2017","has_accepted_license":"1","date_created":"2019-06-04T12:42:43Z","doi":"10.4230/LIPICS.CSL.2017.18","date_published":"2017-08-01T00:00:00Z"},{"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"date_published":"2017-12-01T00:00:00Z","doi":"10.4230/LIPICS.ISAAC.2017.34","date_created":"2019-06-04T12:11:52Z","day":"01","has_accepted_license":"1","year":"2017","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"261FA626-B435-11E9-9278-68D0E5697425","name":"Eliminating intersections in drawings of graphs","grant_number":"M02281"}],"article_number":"34","title":"Embedding graphs into embedded graphs","author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav","last_name":"Fulek","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34.","chicago":"Fulek, Radoslav. “Embedding Graphs into Embedded Graphs,” Vol. 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ISAAC.2017.34.","ieee":"R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand, 2017, vol. 92.","short":"R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ama":"Fulek R. Embedding graphs into embedded graphs. In: Vol 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ISAAC.2017.34","apa":"Fulek, R. (2017). Embedding graphs into embedded graphs (Vol. 92). Presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ISAAC.2017.34","mla":"Fulek, Radoslav. Embedding Graphs into Embedded Graphs. Vol. 92, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ISAAC.2017.34."},"month":"12","intvolume":" 92","scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A (possibly degenerate) drawing of a graph G in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a drawing of a planar graph G in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class, i.e., the rotation system (or equivalently the faces) of the embedding of G and the choice of outer face are fixed. In other words, we show that c-planarity with embedded pipes is tractable for graphs with fixed embeddings. To the best of our knowledge an analogous result was previously known essentially only when G is a cycle."}],"volume":92,"ec_funded":1,"file":[{"file_id":"6518","checksum":"fc7a643e29621c8bbe49d36b39081f31","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-06-04T12:20:35Z","file_name":"2017_LIPIcs-Fulek.pdf","creator":"kschuh","date_updated":"2020-07-14T12:47:33Z","file_size":588982}],"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"conference","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)"},"conference":{"name":"ISAAC: International Symposium on Algorithms and Computation","location":"Phuket, Thailand","end_date":"2017-12-22","start_date":"2017-12-09"},"_id":"6517","department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:47:33Z","ddc":["510"],"date_updated":"2021-01-12T08:07:51Z"},{"quality_controlled":"1","scopus_import":1,"publisher":"IEEE","month":"02","abstract":[{"lang":"eng","text":"We present an approach that enables robots to self-organize their sensorimotor behavior from scratch without providing specific information about neither the robot nor its environment. This is achieved by a simple neural control law that increases the consistency between external sensor dynamics and internal neural dynamics of the utterly simple controller. In this way, the embodiment and the agent-environment coupling are the only source of individual development. We show how an anthropomorphic tendon driven arm-shoulder system develops different behaviors depending on that coupling. For instance: Given a bottle half-filled with water, the arm starts to shake it, driven by the physical response of the water. When attaching a brush, the arm can be manipulated into wiping a table, and when connected to a revolvable wheel it finds out how to rotate it. Thus, the robot may be said to discover the affordances of the world. When allowing two (simulated) humanoid robots to interact physically, they engage into a joint behavior development leading to, for instance, spontaneous cooperation. More social effects are observed if the robots can visually perceive each other. Although, as an observer, it is tempting to attribute an apparent intentionality, there is nothing of the kind put in. As a conclusion, we argue that emergent behavior may be much less rooted in explicit intentions, internal motivations, or specific reward systems than is commonly believed."}],"oa_version":"None","date_published":"2017-02-07T00:00:00Z","doi":"10.1109/DEVLRN.2016.7846789","date_created":"2018-12-11T11:47:43Z","publication_identifier":{"isbn":["978-150905069-7"]},"year":"2017","publication_status":"published","day":"07","language":[{"iso":"eng"}],"type":"conference","conference":{"start_date":"2016-09-19","end_date":"2016-09-22","location":"Cergy-Pontoise, France","name":"ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics "},"status":"public","_id":"652","article_number":"7846789","author":[{"first_name":"Ralf","last_name":"Der","full_name":"Der, Ralf"},{"last_name":"Martius","full_name":"Martius, Georg S","first_name":"Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7100","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"title":"Dynamical self consistency leads to behavioral development and emergent social interactions in robots","citation":{"ista":"Der R, Martius GS. 2017. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , 7846789.","chicago":"Der, Ralf, and Georg S Martius. “Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots.” IEEE, 2017. https://doi.org/10.1109/DEVLRN.2016.7846789.","short":"R. Der, G.S. Martius, in:, IEEE, 2017.","ieee":"R. Der and G. S. Martius, “Dynamical self consistency leads to behavioral development and emergent social interactions in robots,” presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France, 2017.","ama":"Der R, Martius GS. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. In: IEEE; 2017. doi:10.1109/DEVLRN.2016.7846789","apa":"Der, R., & Martius, G. S. (2017). Dynamical self consistency leads to behavioral development and emergent social interactions in robots. Presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France: IEEE. https://doi.org/10.1109/DEVLRN.2016.7846789","mla":"Der, Ralf, and Georg S. Martius. Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots. 7846789, IEEE, 2017, doi:10.1109/DEVLRN.2016.7846789."},"date_updated":"2021-01-12T08:07:51Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"_id":"651","status":"public","type":"journal_article","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:07:49Z","citation":{"chicago":"Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” Nature. Nature Publishing Group, 2017. https://doi.org/10.1038/541161a.","ista":"Hof B. 2017. Fluid dynamics: Water flows out of touch. Nature. 541(7636), 161–162.","mla":"Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” Nature, vol. 541, no. 7636, Nature Publishing Group, 2017, pp. 161–62, doi:10.1038/541161a.","short":"B. Hof, Nature 541 (2017) 161–162.","ieee":"B. Hof, “Fluid dynamics: Water flows out of touch,” Nature, vol. 541, no. 7636. Nature Publishing Group, pp. 161–162, 2017.","ama":"Hof B. Fluid dynamics: Water flows out of touch. Nature. 2017;541(7636):161-162. doi:10.1038/541161a","apa":"Hof, B. (2017). Fluid dynamics: Water flows out of touch. Nature. Nature Publishing Group. https://doi.org/10.1038/541161a"},"department":[{"_id":"BjHo"}],"title":"Fluid dynamics: Water flows out of touch","publist_id":"7116","author":[{"orcid":"0000-0003-2057-2754","full_name":"Hof, Björn","last_name":"Hof","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"None","abstract":[{"text":"Superhydrophobic surfaces reduce the frictional drag between water and solid materials, but this effect is often temporary. The realization of sustained drag reduction has applications for water vehicles and pipeline flows.\r\n\r\n","lang":"eng"}],"month":"01","intvolume":" 541","scopus_import":1,"quality_controlled":"1","publisher":"Nature Publishing Group","day":"11","publication":"Nature","language":[{"iso":"eng"}],"publication_identifier":{"issn":["00280836"]},"year":"2017","publication_status":"published","volume":541,"date_published":"2017-01-11T00:00:00Z","doi":"10.1038/541161a","issue":"7636","date_created":"2018-12-11T11:47:43Z","page":"161 - 162"},{"_id":"653","status":"public","article_type":"original","type":"journal_article","ddc":["000"],"date_updated":"2022-06-10T09:55:08Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:33Z","oa_version":"Submitted Version","pmid":1,"abstract":[{"lang":"eng","text":"The extent of heterogeneity among driver gene mutations present in naturally occurring metastases - that is, treatment-naive metastatic disease - is largely unknown. To address this issue, we carried out 60× whole-genome sequencing of 26 metastases from four patients with pancreatic cancer. We found that identical mutations in known driver genes were present in every metastatic lesion for each patient studied. Passenger gene mutations, which do not have known or predicted functional consequences, accounted for all intratumoral heterogeneity. Even with respect to these passenger mutations, our analysis suggests that the genetic similarity among the founding cells of metastases was higher than that expected for any two cells randomly taken from a normal tissue. The uniformity of known driver gene mutations among metastases in the same patient has critical and encouraging implications for the success of future targeted therapies in advanced-stage disease."}],"month":"03","intvolume":" 49","scopus_import":"1","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"7050","checksum":"e442dc3b7420a36ec805e9bb45cc1a2e","creator":"dernst","date_updated":"2020-07-14T12:47:33Z","file_size":908099,"date_created":"2019-11-19T08:13:50Z","file_name":"2017_NatureGenetics_Makohon.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["10614036"]},"publication_status":"published","volume":49,"issue":"3","ec_funded":1,"project":[{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Makohon Moore, M. Zhang, J. Reiter, I. Božić, B. Allen, D. Kundu, K. Chatterjee, F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban, M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature Genetics 49 (2017) 358–366.","ieee":"A. Makohon Moore et al., “Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer,” Nature Genetics, vol. 49, no. 3. Nature Publishing Group, pp. 358–366, 2017.","ama":"Makohon Moore A, Zhang M, Reiter J, et al. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 2017;49(3):358-366. doi:10.1038/ng.3764","apa":"Makohon Moore, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. Nature Publishing Group. https://doi.org/10.1038/ng.3764","mla":"Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:10.1038/ng.3764.","ista":"Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366.","chicago":"Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics. Nature Publishing Group, 2017. https://doi.org/10.1038/ng.3764."},"title":"Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer","publist_id":"7092","author":[{"first_name":"Alvin","full_name":"Makohon Moore, Alvin","last_name":"Makohon Moore"},{"first_name":"Ming","full_name":"Zhang, Ming","last_name":"Zhang"},{"last_name":"Reiter","orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes"},{"full_name":"Božić, Ivana","last_name":"Božić","first_name":"Ivana"},{"full_name":"Allen, Benjamin","last_name":"Allen","first_name":"Benjamin"},{"id":"1d4c0f4f-e8a3-11ec-a351-e36772758c45","first_name":"Deepanjan","last_name":"Kundu","full_name":"Kundu, Deepanjan"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Wong","full_name":"Wong, Fay","first_name":"Fay"},{"first_name":"Yuchen","full_name":"Jiao, Yuchen","last_name":"Jiao"},{"first_name":"Zachary","last_name":"Kohutek","full_name":"Kohutek, Zachary"},{"first_name":"Jungeui","last_name":"Hong","full_name":"Hong, Jungeui"},{"first_name":"Marc","last_name":"Attiyeh","full_name":"Attiyeh, Marc"},{"full_name":"Javier, Breanna","last_name":"Javier","first_name":"Breanna"},{"first_name":"Laura","full_name":"Wood, Laura","last_name":"Wood"},{"full_name":"Hruban, Ralph","last_name":"Hruban","first_name":"Ralph"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"},{"first_name":"Nickolas","last_name":"Papadopoulos","full_name":"Papadopoulos, Nickolas"},{"last_name":"Kinzler","full_name":"Kinzler, Kenneth","first_name":"Kenneth"},{"first_name":"Bert","full_name":"Vogelstein, Bert","last_name":"Vogelstein"},{"last_name":"Iacobuzio Donahue","full_name":"Iacobuzio Donahue, Christine","first_name":"Christine"}],"external_id":{"pmid":["28092682"]},"article_processing_charge":"No","acknowledgement":"We thank the Memorial Sloan Kettering Cancer Center Molecular Cytology core facility for immunohistochemistry staining. This work was supported by Office of Naval Research grant N00014-16-1-2914, the Bill and Melinda Gates Foundation (OPP1148627), and a gift from B. Wu and E. Larson (M.A.N.), National Institutes of Health grants CA179991 (C.A.I.-D. and I.B.), F31 CA180682 (A.P.M.-M.), CA43460 (B.V.), and P50 CA62924, the Monastra Foundation, the Virginia and D.K. Ludwig Fund for Cancer Research, the Lustgarten Foundation for Pancreatic Cancer Research, the Sol Goldman Center for Pancreatic Cancer Research, the Sol Goldman Sequencing Center, ERC Start grant 279307: Graph Games (J.G.R., D.K., and C.K.), Austrian Science Fund (FWF) grant P23499-N23 (J.G.R., D.K., and C.K.), and FWF NFN grant S11407-N23 RiSE/SHiNE (J.G.R., D.K., and C.K.).","quality_controlled":"1","publisher":"Nature Publishing Group","oa":1,"day":"01","publication":"Nature Genetics","has_accepted_license":"1","year":"2017","date_published":"2017-03-01T00:00:00Z","doi":"10.1038/ng.3764","date_created":"2018-12-11T11:47:43Z","page":"358 - 366"},{"citation":{"mla":"Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–17, doi:10.1145/3133956.3134031.","ama":"Alwen JF, Blocki J, Harsha B. Practical graphs for optimal side-channel resistant memory-hard functions. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM Press; 2017:1001-1017. doi:10.1145/3133956.3134031","apa":"Alwen, J. F., Blocki, J., & Harsha, B. (2017). Practical graphs for optimal side-channel resistant memory-hard functions. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1001–1017). Dallas, TX, USA: ACM Press. https://doi.org/10.1145/3133956.3134031","ieee":"J. F. Alwen, J. Blocki, and B. Harsha, “Practical graphs for optimal side-channel resistant memory-hard functions,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA, 2017, pp. 1001–1017.","short":"J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.","chicago":"Alwen, Joel F, Jeremiah Blocki, and Ben Harsha. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 1001–17. ACM Press, 2017. https://doi.org/10.1145/3133956.3134031.","ista":"Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1001–1017."},"date_updated":"2021-01-12T08:07:53Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Alwen, Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F"},{"full_name":"Blocki, Jeremiah","last_name":"Blocki","first_name":"Jeremiah"},{"first_name":"Ben","full_name":"Harsha, Ben","last_name":"Harsha"}],"department":[{"_id":"KrPi"}],"title":"Practical graphs for optimal side-channel resistant memory-hard functions","_id":"6527","conference":{"name":"CCS: Conference on Computer and Communications Security","end_date":"2017-11-03","location":"Dallas, TX, USA","start_date":"2017-10-30"},"type":"conference","project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"status":"public","publication_status":"published","year":"2017","publication_identifier":{"isbn":["9781450349468"]},"publication":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","language":[{"iso":"eng"}],"day":"30","page":"1001-1017","date_created":"2019-06-06T13:21:29Z","ec_funded":1,"doi":"10.1145/3133956.3134031","date_published":"2017-10-30T00:00:00Z","abstract":[{"lang":"eng","text":"A memory-hard function (MHF) ƒn with parameter n can be computed in sequential time and space n. Simultaneously, a high amortized parallel area-time complexity (aAT) is incurred per evaluation. In practice, MHFs are used to limit the rate at which an adversary (using a custom computational device) can evaluate a security sensitive function that still occasionally needs to be evaluated by honest users (using an off-the-shelf general purpose device). The most prevalent examples of such sensitive functions are Key Derivation Functions (KDFs) and password hashing algorithms where rate limits help mitigate off-line dictionary attacks. As the honest users' inputs to these functions are often (low-entropy) passwords special attention is given to a class of side-channel resistant MHFs called iMHFs.\r\n\r\nEssentially all iMHFs can be viewed as some mode of operation (making n calls to some round function) given by a directed acyclic graph (DAG) with very low indegree. Recently, a combinatorial property of a DAG has been identified (called \"depth-robustness\") which results in good provable security for an iMHF based on that DAG. Depth-robust DAGs have also proven useful in other cryptographic applications. Unfortunately, up till now, all known very depth-robust DAGs are impractically complicated and little is known about their exact (i.e. non-asymptotic) depth-robustness both in theory and in practice.\r\n\r\nIn this work we build and analyze (both formally and empirically) several exceedingly simple and efficient to navigate practical DAGs for use in iMHFs and other applications. For each DAG we:\r\n*Prove that their depth-robustness is asymptotically maximal.\r\n*Prove bounds of at least 3 orders of magnitude better on their exact depth-robustness compared to known bounds for other practical iMHF.\r\n*Implement and empirically evaluate their depth-robustness and aAT against a variety of state-of-the art (and several new) depth-reduction and low aAT attacks. \r\nWe find that, against all attacks, the new DAGs perform significantly better in practice than Argon2i, the most widely deployed iMHF in practice.\r\n\r\nAlong the way we also improve the best known empirical attacks on the aAT of Argon2i by implementing and testing several heuristic versions of a (hitherto purely theoretical) depth-reduction attack. Finally, we demonstrate practicality of our constructions by modifying the Argon2i code base to use one of the new high aAT DAGs. Experimental benchmarks on a standard off-the-shelf CPU show that the new modifications do not adversely affect the impressive throughput of Argon2i (despite seemingly enjoying significantly higher aAT).\r\n"}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/443"}],"oa":1,"scopus_import":1,"quality_controlled":"1","publisher":"ACM Press","month":"10"},{"scopus_import":1,"month":"03","intvolume":" 144","abstract":[{"lang":"eng","text":"In November 2016, developmental biologists, synthetic biologists and engineers gathered in Paris for a meeting called ‘Engineering the embryo’. The participants shared an interest in exploring how synthetic systems can reveal new principles of embryonic development, and how the in vitro manipulation and modeling of development using stem cells can be used to integrate ideas and expertise from physics, developmental biology and tissue engineering. As we review here, the conference pinpointed some of the challenges arising at the intersection of these fields, along with great enthusiasm for finding new approaches and collaborations."}],"oa_version":"Submitted Version","volume":144,"issue":"5","ec_funded":1,"publication_identifier":{"issn":["09501991"]},"publication_status":"published","file":[{"file_name":"IST-2018-987-v1+1_2017_KichevaRivron__Creating_to.pdf","date_created":"2018-12-12T10:15:20Z","file_size":228206,"date_updated":"2020-07-14T12:47:33Z","creator":"system","checksum":"eef22a0f42a55b232cb2d1188a2322cb","file_id":"5139","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"type":"journal_article","status":"public","pubrep_id":"987","_id":"654","file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"AnKi"}],"date_updated":"2021-01-12T08:07:54Z","ddc":["571"],"publisher":"Company of Biologists","quality_controlled":"1","oa":1,"page":"733 - 736","doi":"10.1242/dev.144915","date_published":"2017-03-01T00:00:00Z","date_created":"2018-12-11T11:47:44Z","has_accepted_license":"1","year":"2017","day":"01","publication":"Development","project":[{"grant_number":"680037","name":"Coordination of Patterning And Growth In the Spinal Cord","_id":"B6FC0238-B512-11E9-945C-1524E6697425","call_identifier":"H2020"}],"author":[{"first_name":"Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","last_name":"Kicheva","orcid":"0000-0003-4509-4998","full_name":"Kicheva, Anna"},{"last_name":"Rivron","full_name":"Rivron, Nicolas","first_name":"Nicolas"}],"publist_id":"7089","title":"Creating to understand – developmental biology meets engineering in Paris","citation":{"apa":"Kicheva, A., & Rivron, N. (2017). Creating to understand – developmental biology meets engineering in Paris. Development. Company of Biologists. https://doi.org/10.1242/dev.144915","ama":"Kicheva A, Rivron N. Creating to understand – developmental biology meets engineering in Paris. Development. 2017;144(5):733-736. doi:10.1242/dev.144915","ieee":"A. Kicheva and N. Rivron, “Creating to understand – developmental biology meets engineering in Paris,” Development, vol. 144, no. 5. Company of Biologists, pp. 733–736, 2017.","short":"A. Kicheva, N. Rivron, Development 144 (2017) 733–736.","mla":"Kicheva, Anna, and Nicolas Rivron. “Creating to Understand – Developmental Biology Meets Engineering in Paris.” Development, vol. 144, no. 5, Company of Biologists, 2017, pp. 733–36, doi:10.1242/dev.144915.","ista":"Kicheva A, Rivron N. 2017. Creating to understand – developmental biology meets engineering in Paris. Development. 144(5), 733–736.","chicago":"Kicheva, Anna, and Nicolas Rivron. “Creating to Understand – Developmental Biology Meets Engineering in Paris.” Development. Company of Biologists, 2017. https://doi.org/10.1242/dev.144915."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781509040964"]},"publication_status":"published","ec_funded":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"This paper studies the complexity of estimating Rényi divergences of discrete distributions: p observed from samples and the baseline distribution q known a priori. Extending the results of Acharya et al. (SODA'15) on estimating Rényi entropy, we present improved estimation techniques together with upper and lower bounds on the sample complexity. We show that, contrarily to estimating Rényi entropy where a sublinear (in the alphabet size) number of samples suffices, the sample complexity is heavily dependent on events occurring unlikely in q, and is unbounded in general (no matter what an estimation technique is used). For any divergence of integer order bigger than 1, we provide upper and lower bounds on the number of samples dependent on probabilities of p and q (the lower bounds hold for non-integer orders as well). We conclude that the worst-case sample complexity is polynomial in the alphabet size if and only if the probabilities of q are non-negligible. This gives theoretical insights into heuristics used in the applied literature to handle numerical instability, which occurs for small probabilities of q. Our result shows that they should be handled with care not only because of numerical issues, but also because of a blow up in the sample complexity."}],"month":"08","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1702.01666","open_access":"1"}],"date_updated":"2021-01-12T08:07:53Z","department":[{"_id":"KrPi"}],"_id":"6526","status":"public","type":"conference","conference":{"name":"ISIT: International Symposium on Information Theory","start_date":"2017-06-25","location":"Aachen, Germany","end_date":"2017-06-30"},"day":"09","publication":"2017 IEEE International Symposium on Information Theory (ISIT)","year":"2017","doi":"10.1109/isit.2017.8006529","date_published":"2017-08-09T00:00:00Z","date_created":"2019-06-06T12:53:09Z","quality_controlled":"1","publisher":"IEEE","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017 IEEE International Symposium on Information Theory (ISIT). ISIT: International Symposium on Information Theory, 8006529.","chicago":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. https://doi.org/10.1109/isit.2017.8006529.","short":"M. Skórski, in:, 2017 IEEE International Symposium on Information Theory (ISIT), IEEE, 2017.","ieee":"M. Skórski, “On the complexity of estimating Rènyi divergences,” in 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 2017.","apa":"Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In 2017 IEEE International Symposium on Information Theory (ISIT). Aachen, Germany: IEEE. https://doi.org/10.1109/isit.2017.8006529","ama":"Skórski M. On the complexity of estimating Rènyi divergences. In: 2017 IEEE International Symposium on Information Theory (ISIT). IEEE; 2017. doi:10.1109/isit.2017.8006529","mla":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” 2017 IEEE International Symposium on Information Theory (ISIT), 8006529, IEEE, 2017, doi:10.1109/isit.2017.8006529."},"title":"On the complexity of estimating Rènyi divergences","author":[{"full_name":"Skórski, Maciej","last_name":"Skórski","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej"}],"external_id":{"arxiv":["1702.01666"]},"article_number":"8006529","project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}]},{"file":[{"file_name":"IST-2017-904-v1+1_elife-23136-v2.pdf","date_created":"2018-12-12T10:08:53Z","file_size":5520359,"date_updated":"2020-07-14T12:47:33Z","creator":"system","checksum":"39e1c3e82ddac83a30422fa72fa1a383","file_id":"4716","content_type":"application/pdf","relation":"main_file","access_level":"open_access"},{"date_created":"2018-12-12T10:08:54Z","file_name":"IST-2017-904-v1+2_elife-23136-figures-v2.pdf","date_updated":"2020-07-14T12:47:33Z","file_size":11242920,"creator":"system","file_id":"4717","checksum":"a6d542253028f52e00aa29739ddffe8f","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2050084X"]},"publication_status":"published","volume":6,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The bacterial flagellum is a self-assembling nanomachine. The external flagellar filament, several times longer than a bacterial cell body, is made of a few tens of thousands subunits of a single protein: flagellin. A fundamental problem concerns the molecular mechanism of how the flagellum grows outside the cell, where no discernible energy source is available. Here, we monitored the dynamic assembly of individual flagella using in situ labelling and real-time immunostaining of elongating flagellar filaments. We report that the rate of flagellum growth, initially ~1,700 amino acids per second, decreases with length and that the previously proposed chain mechanism does not contribute to the filament elongation dynamics. Inhibition of the proton motive force-dependent export apparatus revealed a major contribution of substrate injection in driving filament elongation. The combination of experimental and mathematical evidence demonstrates that a simple, injection-diffusion mechanism controls bacterial flagella growth outside the cell."}],"month":"03","intvolume":" 6","scopus_import":1,"ddc":["579"],"date_updated":"2021-01-12T08:07:55Z","file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"CaGu"}],"_id":"655","status":"public","pubrep_id":"904","type":"journal_article","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)"},"day":"06","publication":"eLife","has_accepted_license":"1","year":"2017","doi":"10.7554/eLife.23136","date_published":"2017-03-06T00:00:00Z","date_created":"2018-12-11T11:47:44Z","publisher":"eLife Sciences Publications","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Renault, Thibaud, Anthony Abraham, Tobias Bergmiller, Guillaume Paradis, Simon Rainville, Emmanuelle Charpentier, Calin C Guet, et al. “Bacterial Flagella Grow through an Injection Diffusion Mechanism.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.23136.","ista":"Renault T, Abraham A, Bergmiller T, Paradis G, Rainville S, Charpentier E, Guet CC, Tu Y, Namba K, Keener J, Minamino T, Erhardt M. 2017. Bacterial flagella grow through an injection diffusion mechanism. eLife. 6, e23136.","mla":"Renault, Thibaud, et al. “Bacterial Flagella Grow through an Injection Diffusion Mechanism.” ELife, vol. 6, e23136, eLife Sciences Publications, 2017, doi:10.7554/eLife.23136.","short":"T. Renault, A. Abraham, T. Bergmiller, G. Paradis, S. Rainville, E. Charpentier, C.C. Guet, Y. Tu, K. Namba, J. Keener, T. Minamino, M. Erhardt, ELife 6 (2017).","ieee":"T. Renault et al., “Bacterial flagella grow through an injection diffusion mechanism,” eLife, vol. 6. eLife Sciences Publications, 2017.","ama":"Renault T, Abraham A, Bergmiller T, et al. Bacterial flagella grow through an injection diffusion mechanism. eLife. 2017;6. doi:10.7554/eLife.23136","apa":"Renault, T., Abraham, A., Bergmiller, T., Paradis, G., Rainville, S., Charpentier, E., … Erhardt, M. (2017). Bacterial flagella grow through an injection diffusion mechanism. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.23136"},"title":"Bacterial flagella grow through an injection diffusion mechanism","author":[{"first_name":"Thibaud","last_name":"Renault","full_name":"Renault, Thibaud"},{"first_name":"Anthony","last_name":"Abraham","full_name":"Abraham, Anthony"},{"id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias","orcid":"0000-0001-5396-4346","full_name":"Bergmiller, Tobias","last_name":"Bergmiller"},{"last_name":"Paradis","full_name":"Paradis, Guillaume","first_name":"Guillaume"},{"first_name":"Simon","full_name":"Rainville, Simon","last_name":"Rainville"},{"last_name":"Charpentier","full_name":"Charpentier, Emmanuelle","first_name":"Emmanuelle"},{"full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C"},{"first_name":"Yuhai","last_name":"Tu","full_name":"Tu, Yuhai"},{"last_name":"Namba","full_name":"Namba, Keiichi","first_name":"Keiichi"},{"first_name":"James","last_name":"Keener","full_name":"Keener, James"},{"first_name":"Tohru","last_name":"Minamino","full_name":"Minamino, Tohru"},{"last_name":"Erhardt","full_name":"Erhardt, Marc","first_name":"Marc"}],"publist_id":"7082","article_number":"e23136"},{"title":"Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo","publist_id":"7076","author":[{"last_name":"Möller","full_name":"Möller, Barbara","first_name":"Barbara"},{"first_name":"Colette","last_name":"Ten Hove","full_name":"Ten Hove, Colette"},{"first_name":"Daoquan","full_name":"Xiang, Daoquan","last_name":"Xiang"},{"first_name":"Nerys","last_name":"Williams","full_name":"Williams, Nerys"},{"full_name":"López, Lorena","last_name":"López","first_name":"Lorena"},{"full_name":"Yoshida, Saiko","last_name":"Yoshida","first_name":"Saiko","id":"2E46069C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Smit, Margot","last_name":"Smit","first_name":"Margot"},{"first_name":"Raju","last_name":"Datla","full_name":"Datla, Raju"},{"full_name":"Weijers, Dolf","last_name":"Weijers","first_name":"Dolf"}],"external_id":{"pmid":["28265057"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Möller, B., Ten Hove, C., Xiang, D., Williams, N., López, L., Yoshida, S., … Weijers, D. (2017). Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1616493114","ama":"Möller B, Ten Hove C, Xiang D, et al. Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. 2017;114(12):E2533-E2539. doi:10.1073/pnas.1616493114","short":"B. Möller, C. Ten Hove, D. Xiang, N. Williams, L. López, S. Yoshida, M. Smit, R. Datla, D. Weijers, PNAS 114 (2017) E2533–E2539.","ieee":"B. Möller et al., “Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo,” PNAS, vol. 114, no. 12. National Academy of Sciences, pp. E2533–E2539, 2017.","mla":"Möller, Barbara, et al. “Auxin Response Cell Autonomously Controls Ground Tissue Initiation in the Early Arabidopsis Embryo.” PNAS, vol. 114, no. 12, National Academy of Sciences, 2017, pp. E2533–39, doi:10.1073/pnas.1616493114.","ista":"Möller B, Ten Hove C, Xiang D, Williams N, López L, Yoshida S, Smit M, Datla R, Weijers D. 2017. Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. 114(12), E2533–E2539.","chicago":"Möller, Barbara, Colette Ten Hove, Daoquan Xiang, Nerys Williams, Lorena López, Saiko Yoshida, Margot Smit, Raju Datla, and Dolf Weijers. “Auxin Response Cell Autonomously Controls Ground Tissue Initiation in the Early Arabidopsis Embryo.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1616493114."},"publisher":"National Academy of Sciences","quality_controlled":"1","oa":1,"date_published":"2017-03-21T00:00:00Z","doi":"10.1073/pnas.1616493114","date_created":"2018-12-11T11:47:45Z","page":"E2533 - E2539","day":"21","publication":"PNAS","year":"2017","status":"public","type":"journal_article","_id":"657","department":[{"_id":"JiFr"}],"date_updated":"2021-01-12T08:08:02Z","month":"03","intvolume":" 114","scopus_import":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5373392/","open_access":"1"}],"oa_version":"Submitted Version","pmid":1,"abstract":[{"text":"Plant organs are typically organized into three main tissue layers. The middle ground tissue layer comprises the majority of the plant body and serves a wide range of functions, including photosynthesis, selective nutrient uptake and storage, and gravity sensing. Ground tissue patterning and maintenance in Arabidopsis are controlled by a well-established gene network revolving around the key regulator SHORT-ROOT (SHR). In contrast, it is completely unknown how ground tissue identity is first specified from totipotent precursor cells in the embryo. The plant signaling molecule auxin, acting through AUXIN RESPONSE FACTOR (ARF) transcription factors, is critical for embryo patterning. The auxin effector ARF5/MONOPTEROS (MP) acts both cell-autonomously and noncell-autonomously to control embryonic vascular tissue formation and root initiation, respectively. Here we show that auxin response and ARF activity cell-autonomously control the asymmetric division of the first ground tissue cells. By identifying embryonic target genes, we show that MP transcriptionally initiates the ground tissue lineage and acts upstream of the regulatory network that controls ground tissue patterning and maintenance. Strikingly, whereas the SHR network depends on MP, this MP function is, at least in part, SHR independent. Our study therefore identifies auxin response as a regulator of ground tissue specification in the embryonic root, and reveals that ground tissue initiation and maintenance use different regulators and mechanisms. Moreover, our data provide a framework for the simultaneous formation of multiple cell types by the same transcriptional regulator.","lang":"eng"}],"issue":"12","volume":114,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["00278424"]},"publication_status":"published"},{"scopus_import":1,"publisher":"American Association for the Advancement of Science","quality_controlled":"1","month":"03","intvolume":" 9","abstract":[{"text":"Human neurons transplanted into a mouse model for Alzheimer’s disease show human-specific vulnerability to β-amyloid plaques and may help to identify new therapeutic targets.","lang":"eng"}],"oa_version":"None","date_published":"2017-03-15T00:00:00Z","issue":"381","volume":9,"doi":"10.1126/scitranslmed.aam9867","date_created":"2018-12-11T11:47:45Z","publication_identifier":{"issn":["19466234"]},"publication_status":"published","year":"2017","day":"15","language":[{"iso":"eng"}],"publication":"Science Translational Medicine","type":"journal_article","status":"public","_id":"656","article_number":"eaam9867","publist_id":"7079","author":[{"last_name":"Novarino","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"}],"title":"Modeling Alzheimer's disease in mice with human neurons","department":[{"_id":"GaNo"}],"citation":{"ama":"Novarino G. Modeling Alzheimer’s disease in mice with human neurons. Science Translational Medicine. 2017;9(381). doi:10.1126/scitranslmed.aam9867","apa":"Novarino, G. (2017). Modeling Alzheimer’s disease in mice with human neurons. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aam9867","ieee":"G. Novarino, “Modeling Alzheimer’s disease in mice with human neurons,” Science Translational Medicine, vol. 9, no. 381. American Association for the Advancement of Science, 2017.","short":"G. Novarino, Science Translational Medicine 9 (2017).","mla":"Novarino, Gaia. “Modeling Alzheimer’s Disease in Mice with Human Neurons.” Science Translational Medicine, vol. 9, no. 381, eaam9867, American Association for the Advancement of Science, 2017, doi:10.1126/scitranslmed.aam9867.","ista":"Novarino G. 2017. Modeling Alzheimer’s disease in mice with human neurons. Science Translational Medicine. 9(381), eaam9867.","chicago":"Novarino, Gaia. “Modeling Alzheimer’s Disease in Mice with Human Neurons.” Science Translational Medicine. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/scitranslmed.aam9867."},"date_updated":"2021-01-12T08:07:59Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"date_created":"2018-12-11T11:47:45Z","doi":"10.3389/fnbot.2017.00008","date_published":"2017-03-16T00:00:00Z","year":"2017","has_accepted_license":"1","publication":"Frontiers in Neurorobotics","day":"16","oa":1,"quality_controlled":"1","publisher":"Frontiers Research Foundation","article_processing_charge":"Yes","author":[{"full_name":"Der, Ralf","last_name":"Der","first_name":"Ralf"},{"last_name":"Martius","full_name":"Martius, Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","first_name":"Georg S"}],"publist_id":"7078","title":"Self organized behavior generation for musculoskeletal robots","citation":{"mla":"Der, Ralf, and Georg S. Martius. “Self Organized Behavior Generation for Musculoskeletal Robots.” Frontiers in Neurorobotics, vol. 11, no. MAR, 00008, Frontiers Research Foundation, 2017, doi:10.3389/fnbot.2017.00008.","short":"R. Der, G.S. Martius, Frontiers in Neurorobotics 11 (2017).","ieee":"R. Der and G. S. Martius, “Self organized behavior generation for musculoskeletal robots,” Frontiers in Neurorobotics, vol. 11, no. MAR. Frontiers Research Foundation, 2017.","ama":"Der R, Martius GS. Self organized behavior generation for musculoskeletal robots. Frontiers in Neurorobotics. 2017;11(MAR). doi:10.3389/fnbot.2017.00008","apa":"Der, R., & Martius, G. S. (2017). Self organized behavior generation for musculoskeletal robots. Frontiers in Neurorobotics. Frontiers Research Foundation. https://doi.org/10.3389/fnbot.2017.00008","chicago":"Der, Ralf, and Georg S Martius. “Self Organized Behavior Generation for Musculoskeletal Robots.” Frontiers in Neurorobotics. Frontiers Research Foundation, 2017. https://doi.org/10.3389/fnbot.2017.00008.","ista":"Der R, Martius GS. 2017. Self organized behavior generation for musculoskeletal robots. Frontiers in Neurorobotics. 11(MAR), 00008."},"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"article_number":"00008","ec_funded":1,"volume":11,"issue":"MAR","publication_status":"published","publication_identifier":{"issn":["16625218"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"b1bc43f96d1df3313c03032c2a46388d","file_id":"5371","file_size":8439566,"date_updated":"2020-07-14T12:47:33Z","creator":"system","file_name":"IST-2017-903-v1+1_fnbot-11-00008.pdf","date_created":"2018-12-12T10:18:49Z"}],"scopus_import":1,"intvolume":" 11","month":"03","abstract":[{"lang":"eng","text":"With the accelerated development of robot technologies, control becomes one of the central themes of research. In traditional approaches, the controller, by its internal functionality, finds appropriate actions on the basis of specific objectives for the task at hand. While very successful in many applications, self-organized control schemes seem to be favored in large complex systems with unknown dynamics or which are difficult to model. Reasons are the expected scalability, robustness, and resilience of self-organizing systems. The paper presents a self-learning neurocontroller based on extrinsic differential plasticity introduced recently, applying it to an anthropomorphic musculoskeletal robot arm with attached objects of unknown physical dynamics. The central finding of the paper is the following effect: by the mere feedback through the internal dynamics of the object, the robot is learning to relate each of the objects with a very specific sensorimotor pattern. Specifically, an attached pendulum pilots the arm into a circular motion, a half-filled bottle produces axis oriented shaking behavior, a wheel is getting rotated, and wiping patterns emerge automatically in a table-plus-brush setting. By these object-specific dynamical patterns, the robot may be said to recognize the object's identity, or in other words, it discovers dynamical affordances of objects. Furthermore, when including hand coordinates obtained from a camera, a dedicated hand-eye coordination self-organizes spontaneously. These phenomena are discussed from a specific dynamical system perspective. Central is the dedicated working regime at the border to instability with its potentially infinite reservoir of (limit cycle) attractors "waiting" to be excited. Besides converging toward one of these attractors, variate behavior is also arising from a self-induced attractor morphing driven by the learning rule. We claim that experimental investigations with this anthropomorphic, self-learning robot not only generate interesting and potentially useful behaviors, but may also help to better understand what subjective human muscle feelings are, how they can be rooted in sensorimotor patterns, and how these concepts may feed back on robotics."}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:33Z","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"date_updated":"2021-01-12T08:08:04Z","ddc":["006"],"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)"},"type":"journal_article","pubrep_id":"903","status":"public","_id":"658"},{"date_updated":"2021-01-12T08:08:06Z","ddc":["570"],"department":[{"_id":"MiSi"}],"file_date_updated":"2020-07-14T12:47:34Z","_id":"659","type":"journal_article","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","pubrep_id":"902","publication_identifier":{"issn":["20411723"]},"publication_status":"published","file":[{"date_created":"2018-12-12T10:14:21Z","file_name":"IST-2017-902-v1+1_Kage_et_al-2017-Nature_Communications.pdf","creator":"system","date_updated":"2020-07-14T12:47:34Z","file_size":9523746,"checksum":"dae30190291c3630e8102d8714a8d23e","file_id":"5072","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"volume":8,"abstract":[{"text":"Migration frequently involves Rac-mediated protrusion of lamellipodia, formed by Arp2/3 complex-dependent branching thought to be crucial for force generation and stability of these networks. The formins FMNL2 and FMNL3 are Cdc42 effectors targeting to the lamellipodium tip and shown here to nucleate and elongate actin filaments with complementary activities in vitro. In migrating B16-F1 melanoma cells, both formins contribute to the velocity of lamellipodium protrusion. Loss of FMNL2/3 function in melanoma cells and fibroblasts reduces lamellipodial width, actin filament density and -bundling, without changing patterns of Arp2/3 complex incorporation. Strikingly, in melanoma cells, FMNL2/3 gene inactivation almost completely abolishes protrusion forces exerted by lamellipodia and modifies their ultrastructural organization. Consistently, CRISPR/Cas-mediated depletion of FMNL2/3 in fibroblasts reduces both migration and capability of cells to move against viscous media. Together, we conclude that force generation in lamellipodia strongly depends on FMNL formin activity, operating in addition to Arp2/3 complex-dependent filament branching.","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"month":"03","intvolume":" 8","citation":{"chicago":"Kage, Frieda, Moritz Winterhoff, Vanessa Dimchev, Jan Müller, Tobias Thalheim, Anika Freise, Stefan Brühmann, et al. “FMNL Formins Boost Lamellipodial Force Generation.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms14832.","ista":"Kage F, Winterhoff M, Dimchev V, Müller J, Thalheim T, Freise A, Brühmann S, Kollasser J, Block J, Dimchev GA, Geyer M, Schnittler H, Brakebusch C, Stradal T, Carlier M, Sixt MK, Käs J, Faix J, Rottner K. 2017. FMNL formins boost lamellipodial force generation. Nature Communications. 8, 14832.","mla":"Kage, Frieda, et al. “FMNL Formins Boost Lamellipodial Force Generation.” Nature Communications, vol. 8, 14832, Nature Publishing Group, 2017, doi:10.1038/ncomms14832.","apa":"Kage, F., Winterhoff, M., Dimchev, V., Müller, J., Thalheim, T., Freise, A., … Rottner, K. (2017). FMNL formins boost lamellipodial force generation. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14832","ama":"Kage F, Winterhoff M, Dimchev V, et al. FMNL formins boost lamellipodial force generation. Nature Communications. 2017;8. doi:10.1038/ncomms14832","ieee":"F. Kage et al., “FMNL formins boost lamellipodial force generation,” Nature Communications, vol. 8. Nature Publishing Group, 2017.","short":"F. Kage, M. Winterhoff, V. Dimchev, J. Müller, T. Thalheim, A. Freise, S. Brühmann, J. Kollasser, J. Block, G.A. Dimchev, M. Geyer, H. Schnittler, C. Brakebusch, T. Stradal, M. Carlier, M.K. Sixt, J. Käs, J. Faix, K. Rottner, Nature Communications 8 (2017)."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7075","author":[{"last_name":"Kage","full_name":"Kage, Frieda","first_name":"Frieda"},{"last_name":"Winterhoff","full_name":"Winterhoff, Moritz","first_name":"Moritz"},{"full_name":"Dimchev, Vanessa","last_name":"Dimchev","first_name":"Vanessa"},{"first_name":"Jan","id":"AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D","full_name":"Müller, Jan","last_name":"Müller"},{"full_name":"Thalheim, Tobias","last_name":"Thalheim","first_name":"Tobias"},{"last_name":"Freise","full_name":"Freise, Anika","first_name":"Anika"},{"first_name":"Stefan","full_name":"Brühmann, Stefan","last_name":"Brühmann"},{"full_name":"Kollasser, Jana","last_name":"Kollasser","first_name":"Jana"},{"first_name":"Jennifer","last_name":"Block","full_name":"Block, Jennifer"},{"first_name":"Georgi A","full_name":"Dimchev, Georgi A","last_name":"Dimchev"},{"first_name":"Matthias","full_name":"Geyer, Matthias","last_name":"Geyer"},{"first_name":"Hams","full_name":"Schnittler, Hams","last_name":"Schnittler"},{"last_name":"Brakebusch","full_name":"Brakebusch, Cord","first_name":"Cord"},{"first_name":"Theresia","full_name":"Stradal, Theresia","last_name":"Stradal"},{"first_name":"Marie","full_name":"Carlier, Marie","last_name":"Carlier"},{"last_name":"Sixt","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Käs, Josef","last_name":"Käs","first_name":"Josef"},{"full_name":"Faix, Jan","last_name":"Faix","first_name":"Jan"},{"first_name":"Klemens","last_name":"Rottner","full_name":"Rottner, Klemens"}],"article_processing_charge":"No","title":"FMNL formins boost lamellipodial force generation","article_number":"14832","has_accepted_license":"1","year":"2017","day":"22","publication":"Nature Communications","doi":"10.1038/ncomms14832","date_published":"2017-03-22T00:00:00Z","date_created":"2018-12-11T11:47:46Z","quality_controlled":"1","publisher":"Nature Publishing Group","oa":1},{"oa_version":"Submitted Version","pmid":1,"abstract":[{"lang":"eng","text":"Growing microtubules are protected from depolymerization by the presence of a GTP or GDP/Pi cap. End-binding proteins of the EB1 family bind to the stabilizing cap, allowing monitoring of its size in real time. The cap size has been shown to correlate with instantaneous microtubule stability. Here we have quantitatively characterized the properties of cap size fluctuations during steadystate growth and have developed a theory predicting their timescale and amplitude from the kinetics of microtubule growth and cap maturation. In contrast to growth speed fluctuations, cap size fluctuations show a characteristic timescale, which is defined by the lifetime of the cap sites. Growth fluctuations affect the amplitude of cap size fluctuations; however, cap size does not affect growth speed, indicating that microtubules are far from instability during most of their time of growth. Our theory provides the basis for a quantitative understanding of microtubule stability fluctuations during steady-state growth."}],"month":"03","intvolume":" 114","scopus_import":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5380103/","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["00278424"]},"publication_status":"published","issue":"13","volume":114,"_id":"660","status":"public","type":"journal_article","date_updated":"2021-01-12T08:08:09Z","department":[{"_id":"MaLo"}],"acknowledgement":"We thank Philippe Cluzel for helpful discussions and Gunnar Pruessner for data analysis advice. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK Grant FC001163, Medical Research Council Grant FC001163, and Wellcome Trust Grant FC001163. This work was also supported by European Research Council Advanced Grant Project 323042 (to C.D. and T.S.).","publisher":"National Academy of Sciences","quality_controlled":"1","oa":1,"day":"28","publication":"PNAS","year":"2017","doi":"10.1073/pnas.1620274114","date_published":"2017-03-28T00:00:00Z","date_created":"2018-12-11T11:47:46Z","page":"3427 - 3432","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"J. Rickman, C. F. Düllberg, N. Cade, L. Griffin, and T. Surrey, “Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation,” PNAS, vol. 114, no. 13. National Academy of Sciences, pp. 3427–3432, 2017.","short":"J. Rickman, C.F. Düllberg, N. Cade, L. Griffin, T. Surrey, PNAS 114 (2017) 3427–3432.","ama":"Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. PNAS. 2017;114(13):3427-3432. doi:10.1073/pnas.1620274114","apa":"Rickman, J., Düllberg, C. F., Cade, N., Griffin, L., & Surrey, T. (2017). Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1620274114","mla":"Rickman, Jamie, et al. “Steady State EB Cap Size Fluctuations Are Determined by Stochastic Microtubule Growth and Maturation.” PNAS, vol. 114, no. 13, National Academy of Sciences, 2017, pp. 3427–32, doi:10.1073/pnas.1620274114.","ista":"Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. 2017. Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. PNAS. 114(13), 3427–3432.","chicago":"Rickman, Jamie, Christian F Düllberg, Nicholas Cade, Lewis Griffin, and Thomas Surrey. “Steady State EB Cap Size Fluctuations Are Determined by Stochastic Microtubule Growth and Maturation.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1620274114."},"title":"Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation","publist_id":"7073","author":[{"first_name":"Jamie","last_name":"Rickman","full_name":"Rickman, Jamie"},{"orcid":"0000-0001-6335-9748","full_name":"Düllberg, Christian F","last_name":"Düllberg","id":"459064DC-F248-11E8-B48F-1D18A9856A87","first_name":"Christian F"},{"first_name":"Nicholas","last_name":"Cade","full_name":"Cade, Nicholas"},{"first_name":"Lewis","last_name":"Griffin","full_name":"Griffin, Lewis"},{"full_name":"Surrey, Thomas","last_name":"Surrey","first_name":"Thomas"}],"external_id":{"pmid":["28280102"]}},{"quality_controlled":"1","publisher":"American Institute of Physics","oa":1,"doi":"10.1063/1.4981525","date_published":"2017-04-01T00:00:00Z","date_created":"2018-12-11T11:47:47Z","year":"2017","day":"01","publication":"Physics of Fluids","project":[{"name":"Astrophysical instability of currents and turbulences","grant_number":"SFB 963 TP A8","_id":"2511D90C-B435-11E9-9278-68D0E5697425"}],"article_number":"044107","author":[{"full_name":"Shi, Liang","last_name":"Shi","first_name":"Liang"},{"full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","last_name":"Hof","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Markus","last_name":"Rampp","full_name":"Rampp, Markus"},{"last_name":"Avila","full_name":"Avila, Marc","first_name":"Marc"}],"publist_id":"7072","title":"Hydrodynamic turbulence in quasi Keplerian rotating flows","citation":{"mla":"Shi, Liang, et al. “Hydrodynamic Turbulence in Quasi Keplerian Rotating Flows.” Physics of Fluids, vol. 29, no. 4, 044107, American Institute of Physics, 2017, doi:10.1063/1.4981525.","ieee":"L. Shi, B. Hof, M. Rampp, and M. Avila, “Hydrodynamic turbulence in quasi Keplerian rotating flows,” Physics of Fluids, vol. 29, no. 4. American Institute of Physics, 2017.","short":"L. Shi, B. Hof, M. Rampp, M. Avila, Physics of Fluids 29 (2017).","ama":"Shi L, Hof B, Rampp M, Avila M. Hydrodynamic turbulence in quasi Keplerian rotating flows. Physics of Fluids. 2017;29(4). doi:10.1063/1.4981525","apa":"Shi, L., Hof, B., Rampp, M., & Avila, M. (2017). Hydrodynamic turbulence in quasi Keplerian rotating flows. Physics of Fluids. American Institute of Physics. https://doi.org/10.1063/1.4981525","chicago":"Shi, Liang, Björn Hof, Markus Rampp, and Marc Avila. “Hydrodynamic Turbulence in Quasi Keplerian Rotating Flows.” Physics of Fluids. American Institute of Physics, 2017. https://doi.org/10.1063/1.4981525.","ista":"Shi L, Hof B, Rampp M, Avila M. 2017. Hydrodynamic turbulence in quasi Keplerian rotating flows. Physics of Fluids. 29(4), 044107."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.01714"}],"month":"04","intvolume":" 29","abstract":[{"text":"We report a direct-numerical-simulation study of the Taylor-Couette flow in the quasi-Keplerian regime at shear Reynolds numbers up to (105). Quasi-Keplerian rotating flow has been investigated for decades as a simplified model system to study the origin of turbulence in accretion disks that is not fully understood. The flow in this study is axially periodic and thus the experimental end-wall effects on the stability of the flow are avoided. Using optimal linear perturbations as initial conditions, our simulations find no sustained turbulence: the strong initial perturbations distort the velocity profile and trigger turbulence that eventually decays.","lang":"eng"}],"oa_version":"Submitted Version","issue":"4","volume":29,"publication_identifier":{"issn":["10706631"]},"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"662","department":[{"_id":"BjHo"}],"date_updated":"2021-01-12T08:08:15Z"},{"publisher":"ACM","quality_controlled":"1","oa":1,"page":"163 - 172","doi":"10.1145/3049797.3049814","date_published":"2017-04-01T00:00:00Z","date_created":"2018-12-11T11:47:47Z","has_accepted_license":"1","year":"2017","day":"01","publication":"Proceedings of the 20th International Conference on Hybrid Systems","author":[{"full_name":"Kong, Hui","orcid":"0000-0002-3066-6941","last_name":"Kong","first_name":"Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sergiy","last_name":"Bogomolov","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy"},{"first_name":"Christian","full_name":"Schilling, Christian","last_name":"Schilling"},{"first_name":"Yu","last_name":"Jiang","full_name":"Jiang, Yu"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"publist_id":"7067","title":"Safety verification of nonlinear hybrid systems based on invariant clusters","citation":{"chicago":"Kong, Hui, Sergiy Bogomolov, Christian Schilling, Yu Jiang, and Thomas A Henzinger. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” In Proceedings of the 20th International Conference on Hybrid Systems, 163–72. ACM, 2017. https://doi.org/10.1145/3049797.3049814.","ista":"Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. 2017. Safety verification of nonlinear hybrid systems based on invariant clusters. Proceedings of the 20th International Conference on Hybrid Systems. HSCC: Hybrid Systems Computation and Control , 163–172.","mla":"Kong, Hui, et al. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–72, doi:10.1145/3049797.3049814.","ieee":"H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, and T. A. Henzinger, “Safety verification of nonlinear hybrid systems based on invariant clusters,” in Proceedings of the 20th International Conference on Hybrid Systems, Pittsburgh, PA, United States, 2017, pp. 163–172.","short":"H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, T.A. Henzinger, in:, Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–172.","ama":"Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. Safety verification of nonlinear hybrid systems based on invariant clusters. In: Proceedings of the 20th International Conference on Hybrid Systems. ACM; 2017:163-172. doi:10.1145/3049797.3049814","apa":"Kong, H., Bogomolov, S., Schilling, C., Jiang, Y., & Henzinger, T. A. (2017). Safety verification of nonlinear hybrid systems based on invariant clusters. In Proceedings of the 20th International Conference on Hybrid Systems (pp. 163–172). Pittsburgh, PA, United States: ACM. https://doi.org/10.1145/3049797.3049814"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"month":"04","abstract":[{"lang":"eng","text":"In this paper, we propose an approach to automatically compute invariant clusters for nonlinear semialgebraic hybrid systems. An invariant cluster for an ordinary differential equation (ODE) is a multivariate polynomial invariant g(u→, x→) = 0, parametric in u→, which can yield an infinite number of concrete invariants by assigning different values to u→ so that every trajectory of the system can be overapproximated precisely by the intersection of a group of concrete invariants. For semialgebraic systems, which involve ODEs with multivariate polynomial right-hand sides, given a template multivariate polynomial g(u→, x→), an invariant cluster can be obtained by first computing the remainder of the Lie derivative of g(u→, x→) divided by g(u→, x→) and then solving the system of polynomial equations obtained from the coefficients of the remainder. Based on invariant clusters and sum-of-squares (SOS) programming, we present a new method for the safety verification of hybrid systems. Experiments on nonlinear benchmark systems from biology and control theory show that our approach is efficient. "}],"oa_version":"Submitted Version","publication_identifier":{"isbn":["978-145034590-3"]},"publication_status":"published","file":[{"file_name":"IST-2017-817-v1+1_p163-kong.pdf","date_created":"2018-12-12T10:11:20Z","creator":"system","file_size":1650530,"date_updated":"2020-07-14T12:47:34Z","file_id":"4873","checksum":"b7667434cbf5b5f0ade3bea1dbe5bf63","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"type":"conference","conference":{"name":"HSCC: Hybrid Systems Computation and Control ","start_date":"2017-04-18","location":"Pittsburgh, PA, United States","end_date":"2017-04-20"},"status":"public","pubrep_id":"817","_id":"663","file_date_updated":"2020-07-14T12:47:34Z","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:08:17Z","ddc":["000"]},{"date_created":"2018-12-11T11:47:48Z","doi":"10.1126/scitranslmed.aan2786","date_published":"2017-04-26T00:00:00Z","volume":9,"issue":"387","language":[{"iso":"eng"}],"publication":"Science Translational Medicine","day":"26","year":"2017","publication_status":"published","publication_identifier":{"issn":["19466234"]},"intvolume":" 9","month":"04","quality_controlled":"1","scopus_import":1,"publisher":"American Association for the Advancement of Science","oa_version":"None","abstract":[{"text":"Perinatal exposure to penicillin may result in longlasting gut and behavioral changes.","lang":"eng"}],"title":"The antisocial side of antibiotics","department":[{"_id":"GaNo"}],"publist_id":"7060","author":[{"first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","last_name":"Novarino"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:08:30Z","citation":{"ista":"Novarino G. 2017. The antisocial side of antibiotics. Science Translational Medicine. 9(387), 2786.","chicago":"Novarino, Gaia. “The Antisocial Side of Antibiotics.” Science Translational Medicine. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/scitranslmed.aan2786.","ieee":"G. Novarino, “The antisocial side of antibiotics,” Science Translational Medicine, vol. 9, no. 387. American Association for the Advancement of Science, 2017.","short":"G. Novarino, Science Translational Medicine 9 (2017).","apa":"Novarino, G. (2017). The antisocial side of antibiotics. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aan2786","ama":"Novarino G. The antisocial side of antibiotics. Science Translational Medicine. 2017;9(387). doi:10.1126/scitranslmed.aan2786","mla":"Novarino, Gaia. “The Antisocial Side of Antibiotics.” Science Translational Medicine, vol. 9, no. 387, 2786, American Association for the Advancement of Science, 2017, doi:10.1126/scitranslmed.aan2786."},"status":"public","type":"journal_article","article_number":"2786","_id":"667"},{"ddc":["570"],"date_updated":"2021-01-12T08:08:34Z","department":[{"_id":"MiSi"}],"file_date_updated":"2020-07-14T12:47:37Z","_id":"668","status":"public","type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"d488162874326a4bb056065fa549dc4a","file_id":"6971","creator":"dernst","file_size":5647880,"date_updated":"2020-07-14T12:47:37Z","file_name":"2017_JBC_Horsthemke.pdf","date_created":"2019-10-24T15:25:42Z"}],"publication_status":"published","publication_identifier":{"issn":["00219258"]},"volume":292,"issue":"17","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Macrophage filopodia, finger-like membrane protrusions, were first implicated in phagocytosis more than 100 years ago, but little is still known about the involvement of these actin-dependent structures in particle clearance. Using spinning disk confocal microscopy to image filopodial dynamics in mouse resident Lifeact-EGFP macrophages, we show that filopodia, or filopodia-like structures, support pathogen clearance by multiple means. Filopodia supported the phagocytic uptake of bacterial (Escherichia coli) particles by (i) capturing along the filopodial shaft and surfing toward the cell body, the most common mode of capture; (ii) capturing via the tip followed by retraction; (iii) combinations of surfing and retraction; or (iv) sweeping actions. In addition, filopodia supported the uptake of zymosan (Saccharomyces cerevisiae) particles by (i) providing fixation, (ii) capturing at the tip and filopodia-guided actin anterograde flow with phagocytic cup formation, and (iii) the rapid growth of new protrusions. To explore the role of filopodia-inducing Cdc42, we generated myeloid-restricted Cdc42 knock-out mice. Cdc42-deficient macrophages exhibited rapid phagocytic cup kinetics, but reduced particle clearance, which could be explained by the marked rounded-up morphology of these cells. Macrophages lacking Myo10, thought to act downstream of Cdc42, had normal morphology, motility, and phagocytic cup formation, but displayed markedly reduced filopodia formation. In conclusion, live-cell imaging revealed multiple mechanisms involving macrophage filopodia in particle capture and engulfment. Cdc42 is not critical for filopodia or phagocytic cup formation, but plays a key role in driving macrophage lamellipodial spreading."}],"intvolume":" 292","month":"04","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Horsthemke M, Bachg A, Groll K, Moyzio S, Müther B, Hemkemeyer S, Wedlich Söldner R, Sixt MK, Tacke S, Bähler M, Hanley P. 2017. Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. Journal of Biological Chemistry. 292(17), 7258–7273.","chicago":"Horsthemke, Markus, Anne Bachg, Katharina Groll, Sven Moyzio, Barbara Müther, Sandra Hemkemeyer, Roland Wedlich Söldner, et al. “Multiple Roles of Filopodial Dynamics in Particle Capture and Phagocytosis and Phenotypes of Cdc42 and Myo10 Deletion.” Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology, 2017. https://doi.org/10.1074/jbc.M116.766923.","apa":"Horsthemke, M., Bachg, A., Groll, K., Moyzio, S., Müther, B., Hemkemeyer, S., … Hanley, P. (2017). Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology. https://doi.org/10.1074/jbc.M116.766923","ama":"Horsthemke M, Bachg A, Groll K, et al. Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. Journal of Biological Chemistry. 2017;292(17):7258-7273. doi:10.1074/jbc.M116.766923","short":"M. Horsthemke, A. Bachg, K. Groll, S. Moyzio, B. Müther, S. Hemkemeyer, R. Wedlich Söldner, M.K. Sixt, S. Tacke, M. Bähler, P. Hanley, Journal of Biological Chemistry 292 (2017) 7258–7273.","ieee":"M. Horsthemke et al., “Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion,” Journal of Biological Chemistry, vol. 292, no. 17. American Society for Biochemistry and Molecular Biology, pp. 7258–7273, 2017.","mla":"Horsthemke, Markus, et al. “Multiple Roles of Filopodial Dynamics in Particle Capture and Phagocytosis and Phenotypes of Cdc42 and Myo10 Deletion.” Journal of Biological Chemistry, vol. 292, no. 17, American Society for Biochemistry and Molecular Biology, 2017, pp. 7258–73, doi:10.1074/jbc.M116.766923."},"title":"Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion","publist_id":"7059","author":[{"full_name":"Horsthemke, Markus","last_name":"Horsthemke","first_name":"Markus"},{"full_name":"Bachg, Anne","last_name":"Bachg","first_name":"Anne"},{"first_name":"Katharina","last_name":"Groll","full_name":"Groll, Katharina"},{"last_name":"Moyzio","full_name":"Moyzio, Sven","first_name":"Sven"},{"first_name":"Barbara","full_name":"Müther, Barbara","last_name":"Müther"},{"first_name":"Sandra","last_name":"Hemkemeyer","full_name":"Hemkemeyer, Sandra"},{"first_name":"Roland","full_name":"Wedlich Söldner, Roland","last_name":"Wedlich Söldner"},{"first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"},{"last_name":"Tacke","full_name":"Tacke, Sebastian","first_name":"Sebastian"},{"first_name":"Martin","full_name":"Bähler, Martin","last_name":"Bähler"},{"first_name":"Peter","full_name":"Hanley, Peter","last_name":"Hanley"}],"publication":"Journal of Biological Chemistry","day":"28","year":"2017","has_accepted_license":"1","date_created":"2018-12-11T11:47:49Z","date_published":"2017-04-28T00:00:00Z","doi":"10.1074/jbc.M116.766923","page":"7258 - 7273","oa":1,"quality_controlled":"1","publisher":"American Society for Biochemistry and Molecular Biology"},{"citation":{"mla":"Synek, Lukáš, et al. “EXO70C2 Is a Key Regulatory Factor for Optimal Tip Growth of Pollen.” Plant Physiology, vol. 174, no. 1, American Society of Plant Biologists, 2017, pp. 223–40, doi:10.1104/pp.16.01282.","ama":"Synek L, Vukašinović N, Kulich I, et al. EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. 2017;174(1):223-240. doi:10.1104/pp.16.01282","apa":"Synek, L., Vukašinović, N., Kulich, I., Hála, M., Aldorfová, K., Fendrych, M., & Žárský, V. (2017). EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. American Society of Plant Biologists. https://doi.org/10.1104/pp.16.01282","ieee":"L. Synek et al., “EXO70C2 is a key regulatory factor for optimal tip growth of pollen,” Plant Physiology, vol. 174, no. 1. American Society of Plant Biologists, pp. 223–240, 2017.","short":"L. Synek, N. Vukašinović, I. Kulich, M. Hála, K. Aldorfová, M. Fendrych, V. Žárský, Plant Physiology 174 (2017) 223–240.","chicago":"Synek, Lukáš, Nemanja Vukašinović, Ivan Kulich, Michal Hála, Klára Aldorfová, Matyas Fendrych, and Viktor Žárský. “EXO70C2 Is a Key Regulatory Factor for Optimal Tip Growth of Pollen.” Plant Physiology. American Society of Plant Biologists, 2017. https://doi.org/10.1104/pp.16.01282.","ista":"Synek L, Vukašinović N, Kulich I, Hála M, Aldorfová K, Fendrych M, Žárský V. 2017. EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. 174(1), 223–240."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7058","author":[{"first_name":"Lukáš","full_name":"Synek, Lukáš","last_name":"Synek"},{"first_name":"Nemanja","full_name":"Vukašinović, Nemanja","last_name":"Vukašinović"},{"first_name":"Ivan","last_name":"Kulich","full_name":"Kulich, Ivan"},{"first_name":"Michal","last_name":"Hála","full_name":"Hála, Michal"},{"last_name":"Aldorfová","full_name":"Aldorfová, Klára","first_name":"Klára"},{"orcid":"0000-0002-9767-8699","full_name":"Fendrych, Matyas","last_name":"Fendrych","first_name":"Matyas","id":"43905548-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Žárský","full_name":"Žárský, Viktor","first_name":"Viktor"}],"article_processing_charge":"No","external_id":{"pmid":["28356503"]},"title":"EXO70C2 is a key regulatory factor for optimal tip growth of pollen","has_accepted_license":"1","year":"2017","day":"01","publication":"Plant Physiology","page":"223 - 240","doi":"10.1104/pp.16.01282","date_published":"2017-05-01T00:00:00Z","date_created":"2018-12-11T11:47:49Z","quality_controlled":"1","publisher":"American Society of Plant Biologists","oa":1,"date_updated":"2021-01-12T08:08:35Z","ddc":["580"],"file_date_updated":"2020-07-14T12:47:37Z","department":[{"_id":"JiFr"}],"_id":"669","article_type":"original","type":"journal_article","status":"public","publication_identifier":{"issn":["00320889"]},"publication_status":"published","file":[{"file_id":"7041","checksum":"97155acc6aa5f0d0a78e0589a932fe02","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-11-18T16:16:18Z","file_name":"2017_PlantPhysio_Synek.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:37Z","file_size":2176903}],"language":[{"iso":"eng"}],"issue":"1","volume":174,"abstract":[{"lang":"eng","text":"The exocyst, a eukaryotic tethering complex, coregulates targeted exocytosis as an effector of small GTPases in polarized cell growth. In land plants, several exocyst subunits are encoded by double or triple paralogs, culminating in tens of EXO70 paralogs. Out of 23 Arabidopsis thaliana EXO70 isoforms, we analyzed seven isoforms expressed in pollen. Genetic and microscopic analyses of single mutants in EXO70A2, EXO70C1, EXO70C2, EXO70F1, EXO70H3, EXO70H5, and EXO70H6 genes revealed that only a loss-of-function EXO70C2 allele resulted in a significant male-specific transmission defect (segregation 40%:51%:9%) due to aberrant pollen tube growth. Mutant pollen tubes grown in vitro exhibited an enhanced growth rate and a decreased thickness of the tip cell wall, causing tip bursts. However, exo70C2 pollen tubes could frequently recover and restart their speedy elongation, resulting in a repetitive stop-and-go growth dynamics. A pollenspecific depletion of the closest paralog, EXO70C1, using artificial microRNA in the exo70C2 mutant background, resulted in a complete pollen-specific transmission defect, suggesting redundant functions of EXO70C1 and EXO70C2. Both EXO70C1 and EXO70C2, GFP tagged and expressed under the control of their native promoters, localized in the cytoplasm of pollen grains, pollen tubes, and also root trichoblast cells. The expression of EXO70C2-GFP complemented the aberrant growth of exo70C2 pollen tubes. The absent EXO70C2 interactions with core exocyst subunits in the yeast two-hybrid assay, cytoplasmic localization, and genetic effect suggest an unconventional EXO70 function possibly as a regulator of exocytosis outside the exocyst complex. In conclusion, EXO70C2 is a novel factor contributing to the regulation of optimal tip growth of Arabidopsis pollen tubes. "}],"pmid":1,"oa_version":"Submitted Version","scopus_import":1,"month":"05","intvolume":" 174"},{"project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Hilbe C, Martinez V, Chatterjee K, Nowak M. 2017. Memory-n strategies of direct reciprocity. PNAS. 114(18), 4715–4720.","chicago":"Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1621239114.","ama":"Hilbe C, Martinez V, Chatterjee K, Nowak M. Memory-n strategies of direct reciprocity. PNAS. 2017;114(18):4715-4720. doi:10.1073/pnas.1621239114","apa":"Hilbe, C., Martinez, V., Chatterjee, K., & Nowak, M. (2017). Memory-n strategies of direct reciprocity. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1621239114","short":"C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720.","ieee":"C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of direct reciprocity,” PNAS, vol. 114, no. 18. National Academy of Sciences, pp. 4715–4720, 2017.","mla":"Hilbe, Christian, et al. “Memory-n Strategies of Direct Reciprocity.” PNAS, vol. 114, no. 18, National Academy of Sciences, 2017, pp. 4715–20, doi:10.1073/pnas.1621239114."},"title":"Memory-n strategies of direct reciprocity","article_processing_charge":"Yes (in subscription journal)","external_id":{"pmid":["28420786"]},"publist_id":"7053","author":[{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","last_name":"Hilbe"},{"last_name":"Martinez","full_name":"Martinez, Vaquero","first_name":"Vaquero"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"oa":1,"quality_controlled":"1","publisher":"National Academy of Sciences","publication":"PNAS","day":"02","year":"2017","date_created":"2018-12-11T11:47:50Z","date_published":"2017-05-02T00:00:00Z","doi":"10.1073/pnas.1621239114","page":"4715 - 4720","_id":"671","status":"public","type":"journal_article","date_updated":"2021-01-12T08:08:37Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","pmid":1,"abstract":[{"text":"Humans routinely use conditionally cooperative strategies when interacting in repeated social dilemmas. They are more likely to cooperate if others cooperated before, and are ready to retaliate if others defected. To capture the emergence of reciprocity, most previous models consider subjects who can only choose from a restricted set of representative strategies, or who react to the outcome of the very last round only. As players memorize more rounds, the dimension of the strategy space increases exponentially. This increasing computational complexity renders simulations for individuals with higher cognitive abilities infeasible, especially if multiplayer interactions are taken into account. Here, we take an axiomatic approach instead. We propose several properties that a robust cooperative strategy for a repeated multiplayer dilemma should have. These properties naturally lead to a unique class of cooperative strategies, which contains the classical Win-Stay Lose-Shift rule as a special case. A comprehensive numerical analysis for the prisoner's dilemma and for the public goods game suggests that strategies of this class readily evolve across various memory-n spaces. Our results reveal that successful strategies depend not only on how cooperative others were in the past but also on the respective context of cooperation.","lang":"eng"}],"intvolume":" 114","month":"05","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5422766/","open_access":"1"}],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["00278424"]},"ec_funded":1,"issue":"18","volume":114},{"type":"journal_article","article_type":"original","status":"public","_id":"670","department":[{"_id":"ChWo"}],"date_updated":"2021-01-12T08:08:37Z","ddc":["000"],"scopus_import":1,"main_file_link":[{"url":"https://hal.inria.fr/hal-01647113/file/eg_2017_schreck_paper_tearing.pdf","open_access":"1"}],"month":"05","intvolume":" 36","abstract":[{"text":"We propose an efficient method to model paper tearing in the context of interactive modeling. The method uses geometrical information to automatically detect potential starting points of tears. We further introduce a new hybrid geometrical and physical-based method to compute the trajectory of tears while procedurally synthesizing high resolution details of the tearing path using a texture based approach. The results obtained are compared with real paper and with previous studies on the expected geometric paths of paper that tears.","lang":"eng"}],"oa_version":"Published Version","issue":"2","volume":36,"publication_identifier":{"issn":["01677055"]},"publication_status":"published","language":[{"iso":"eng"}],"project":[{"grant_number":"P 24352-N23","name":"Deep Pictures: Creating Visual and Haptic Vector Images","call_identifier":"FWF","_id":"25357BD2-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Schreck, Camille","last_name":"Schreck","first_name":"Camille","id":"2B14B676-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rohmer, Damien","last_name":"Rohmer","first_name":"Damien"},{"last_name":"Hahmann","full_name":"Hahmann, Stefanie","first_name":"Stefanie"}],"publist_id":"7056","article_processing_charge":"No","title":"Interactive paper tearing","citation":{"ista":"Schreck C, Rohmer D, Hahmann S. 2017. Interactive paper tearing. Computer Graphics Forum. 36(2), 95–106.","chicago":"Schreck, Camille, Damien Rohmer, and Stefanie Hahmann. “Interactive Paper Tearing.” Computer Graphics Forum. Wiley, 2017. https://doi.org/10.1111/cgf.13110.","apa":"Schreck, C., Rohmer, D., & Hahmann, S. (2017). Interactive paper tearing. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.13110","ama":"Schreck C, Rohmer D, Hahmann S. Interactive paper tearing. Computer Graphics Forum. 2017;36(2):95-106. doi:10.1111/cgf.13110","short":"C. Schreck, D. Rohmer, S. Hahmann, Computer Graphics Forum 36 (2017) 95–106.","ieee":"C. Schreck, D. Rohmer, and S. Hahmann, “Interactive paper tearing,” Computer Graphics Forum, vol. 36, no. 2. Wiley, pp. 95–106, 2017.","mla":"Schreck, Camille, et al. “Interactive Paper Tearing.” Computer Graphics Forum, vol. 36, no. 2, Wiley, 2017, pp. 95–106, doi:10.1111/cgf.13110."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Wiley","oa":1,"page":"95 - 106","date_published":"2017-05-01T00:00:00Z","doi":"10.1111/cgf.13110","date_created":"2018-12-11T11:47:49Z","year":"2017","day":"01","publication":"Computer Graphics Forum"},{"title":"Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia","author":[{"id":"368EE576-F248-11E8-B48F-1D18A9856A87","first_name":"Kari","full_name":"Vaahtomeri, Kari","orcid":"0000-0001-7829-3518","last_name":"Vaahtomeri"},{"id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","first_name":"Markus","full_name":"Brown, Markus","last_name":"Brown"},{"id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Hauschild","full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522"},{"id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","first_name":"Ingrid","full_name":"De Vries, Ingrid","last_name":"De Vries"},{"last_name":"Leithner","full_name":"Leithner, Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander F"},{"id":"3C23B994-F248-11E8-B48F-1D18A9856A87","first_name":"Matthias","full_name":"Mehling, Matthias","orcid":"0000-0001-8599-1226","last_name":"Mehling"},{"last_name":"Kaufmann","orcid":"0000-0001-9735-5315","full_name":"Kaufmann, Walter","first_name":"Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7052","article_processing_charge":"Yes","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Vaahtomeri, Kari, Markus Brown, Robert Hauschild, Ingrid de Vries, Alexander F Leithner, Matthias Mehling, Walter Kaufmann, and Michael K Sixt. “Locally Triggered Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” Cell Reports. Cell Press, 2017. https://doi.org/10.1016/j.celrep.2017.04.027.","ista":"Vaahtomeri K, Brown M, Hauschild R, de Vries I, Leithner AF, Mehling M, Kaufmann W, Sixt MK. 2017. Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. Cell Reports. 19(5), 902–909.","mla":"Vaahtomeri, Kari, et al. “Locally Triggered Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” Cell Reports, vol. 19, no. 5, Cell Press, 2017, pp. 902–09, doi:10.1016/j.celrep.2017.04.027.","apa":"Vaahtomeri, K., Brown, M., Hauschild, R., de Vries, I., Leithner, A. F., Mehling, M., … Sixt, M. K. (2017). Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2017.04.027","ama":"Vaahtomeri K, Brown M, Hauschild R, et al. Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. Cell Reports. 2017;19(5):902-909. doi:10.1016/j.celrep.2017.04.027","short":"K. Vaahtomeri, M. Brown, R. Hauschild, I. de Vries, A.F. Leithner, M. Mehling, W. Kaufmann, M.K. Sixt, Cell Reports 19 (2017) 902–909.","ieee":"K. Vaahtomeri et al., “Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia,” Cell Reports, vol. 19, no. 5. Cell Press, pp. 902–909, 2017."},"project":[{"call_identifier":"FP7","_id":"25A603A2-B435-11E9-9278-68D0E5697425","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","grant_number":"281556"},{"grant_number":"Y 564-B12","name":"Cytoskeletal force generation and transduction of leukocytes (FWF)","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"date_published":"2017-05-02T00:00:00Z","doi":"10.1016/j.celrep.2017.04.027","date_created":"2018-12-11T11:47:50Z","page":"902 - 909","day":"02","publication":"Cell Reports","has_accepted_license":"1","year":"2017","publisher":"Cell Press","quality_controlled":"1","oa":1,"department":[{"_id":"MiSi"},{"_id":"Bio"},{"_id":"EM-Fac"}],"file_date_updated":"2020-07-14T12:47:38Z","ddc":["570"],"date_updated":"2023-02-23T12:50:09Z","status":"public","pubrep_id":"900","type":"journal_article","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"_id":"672","issue":"5","volume":19,"ec_funded":1,"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5109","checksum":"8fdddaab1f1d76a6ec9ca94dcb6b07a2","creator":"system","file_size":2248814,"date_updated":"2020-07-14T12:47:38Z","file_name":"IST-2017-900-v1+1_1-s2.0-S2211124717305211-main.pdf","date_created":"2018-12-12T10:14:54Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["22111247"]},"publication_status":"published","month":"05","intvolume":" 19","scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Trafficking cells frequently transmigrate through epithelial and endothelial monolayers. How monolayers cooperate with the penetrating cells to support their transit is poorly understood. We studied dendritic cell (DC) entry into lymphatic capillaries as a model system for transendothelial migration. We find that the chemokine CCL21, which is the decisive guidance cue for intravasation, mainly localizes in the trans-Golgi network and intracellular vesicles of lymphatic endothelial cells. Upon DC transmigration, these Golgi deposits disperse and CCL21 becomes extracellularly enriched at the sites of endothelial cell-cell junctions. When we reconstitute the transmigration process in vitro, we find that secretion of CCL21-positive vesicles is triggered by a DC contact-induced calcium signal, and selective calcium chelation in lymphatic endothelium attenuates transmigration. Altogether, our data demonstrate a chemokine-mediated feedback between DCs and lymphatic endothelium, which facilitates transendothelial migration."}]},{"_id":"674","type":"journal_article","status":"public","date_updated":"2023-02-23T12:50:44Z","department":[{"_id":"MiSi"},{"_id":"Bio"},{"_id":"NanoFab"}],"abstract":[{"lang":"eng","text":"Navigation of cells along gradients of guidance cues is a determining step in many developmental and immunological processes. Gradients can either be soluble or immobilized to tissues as demonstrated for the haptotactic migration of dendritic cells (DCs) toward higher concentrations of immobilized chemokine CCL21. To elucidate how gradient characteristics govern cellular response patterns, we here introduce an in vitro system allowing to track migratory responses of DCs to precisely controlled immobilized gradients of CCL21. We find that haptotactic sensing depends on the absolute CCL21 concentration and local steepness of the gradient, consistent with a scenario where DC directionality is governed by the signal-to-noise ratio of CCL21 binding to the receptor CCR7. We find that the conditions for optimal DC guidance are perfectly provided by the CCL21 gradients we measure in vivo. Furthermore, we find that CCR7 signal termination by the G-protein-coupled receptor kinase 6 (GRK6) is crucial for haptotactic but dispensable for chemotactic CCL21 gradient sensing in vitro and confirm those observations in vivo. These findings suggest that stable, tissue-bound CCL21 gradients as sustainable “roads” ensure optimal guidance in vivo."}],"oa_version":"None","scopus_import":1,"month":"05","intvolume":" 27","publication_identifier":{"issn":["09609822"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"9","volume":27,"ec_funded":1,"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"grant_number":"Y 564-B12","name":"Cytoskeletal force generation and transduction of leukocytes (FWF)","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"citation":{"ista":"Schwarz J, Bierbaum V, Vaahtomeri K, Hauschild R, Brown M, de Vries I, Leithner AF, Reversat A, Merrin J, Tarrant T, Bollenbach MT, Sixt MK. 2017. Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. Current Biology. 27(9), 1314–1325.","chicago":"Schwarz, Jan, Veronika Bierbaum, Kari Vaahtomeri, Robert Hauschild, Markus Brown, Ingrid de Vries, Alexander F Leithner, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” Current Biology. Cell Press, 2017. https://doi.org/10.1016/j.cub.2017.04.004.","short":"J. Schwarz, V. Bierbaum, K. Vaahtomeri, R. Hauschild, M. Brown, I. de Vries, A.F. Leithner, A. Reversat, J. Merrin, T. Tarrant, M.T. Bollenbach, M.K. Sixt, Current Biology 27 (2017) 1314–1325.","ieee":"J. Schwarz et al., “Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6,” Current Biology, vol. 27, no. 9. Cell Press, pp. 1314–1325, 2017.","apa":"Schwarz, J., Bierbaum, V., Vaahtomeri, K., Hauschild, R., Brown, M., de Vries, I., … Sixt, M. K. (2017). Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2017.04.004","ama":"Schwarz J, Bierbaum V, Vaahtomeri K, et al. Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. Current Biology. 2017;27(9):1314-1325. doi:10.1016/j.cub.2017.04.004","mla":"Schwarz, Jan, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” Current Biology, vol. 27, no. 9, Cell Press, 2017, pp. 1314–25, doi:10.1016/j.cub.2017.04.004."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87","full_name":"Schwarz, Jan","last_name":"Schwarz"},{"full_name":"Bierbaum, Veronika","last_name":"Bierbaum","id":"3FD04378-F248-11E8-B48F-1D18A9856A87","first_name":"Veronika"},{"first_name":"Kari","id":"368EE576-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7829-3518","full_name":"Vaahtomeri, Kari","last_name":"Vaahtomeri"},{"last_name":"Hauschild","orcid":"0000-0001-9843-3522","full_name":"Hauschild, Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"},{"last_name":"Brown","full_name":"Brown, Markus","first_name":"Markus","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"De Vries","full_name":"De Vries, Ingrid","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","first_name":"Ingrid"},{"full_name":"Leithner, Alexander F","last_name":"Leithner","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander F"},{"last_name":"Reversat","orcid":"0000-0003-0666-8928","full_name":"Reversat, Anne","id":"35B76592-F248-11E8-B48F-1D18A9856A87","first_name":"Anne"},{"first_name":"Jack","id":"4515C308-F248-11E8-B48F-1D18A9856A87","last_name":"Merrin","orcid":"0000-0001-5145-4609","full_name":"Merrin, Jack"},{"full_name":"Tarrant, Teresa","last_name":"Tarrant","first_name":"Teresa"},{"last_name":"Bollenbach","orcid":"0000-0003-4398-476X","full_name":"Bollenbach, Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias"},{"first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt"}],"publist_id":"7050","title":"Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6","quality_controlled":"1","publisher":"Cell Press","year":"2017","day":"09","publication":"Current Biology","page":"1314 - 1325","doi":"10.1016/j.cub.2017.04.004","date_published":"2017-05-09T00:00:00Z","date_created":"2018-12-11T11:47:51Z"},{"scopus_import":1,"intvolume":" 19","month":"05","abstract":[{"lang":"eng","text":"The INO80 complex (INO80-C) is an evolutionarily conserved nucleosome remodeler that acts in transcription, replication, and genome stability. It is required for resistance against genotoxic agents and is involved in the repair of DNA double-strand breaks (DSBs) by homologous recombination (HR). However, the causes of the HR defect in INO80-C mutant cells are controversial. Here, we unite previous findings using a system to study HR with high spatial resolution in budding yeast. We find that INO80-C has at least two distinct functions during HR—DNA end resection and presynaptic filament formation. Importantly, the second function is linked to the histone variant H2A.Z. In the absence of H2A.Z, presynaptic filament formation and HR are restored in INO80-C-deficient mutants, suggesting that presynaptic filament formation is the crucial INO80-C function during HR."}],"oa_version":"Published Version","issue":"7","volume":19,"publication_status":"published","publication_identifier":{"issn":["22111247"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:15:48Z","file_name":"IST-2017-899-v1+1_1-s2.0-S2211124717305454-main.pdf","creator":"system","date_updated":"2020-07-14T12:47:40Z","file_size":3005610,"checksum":"efc7287d9c6354983cb151880e9ad72a","file_id":"5171","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"type":"journal_article","pubrep_id":"899","status":"public","_id":"677","department":[{"_id":"MiSi"}],"file_date_updated":"2020-07-14T12:47:40Z","date_updated":"2021-01-12T08:08:57Z","ddc":["570"],"oa":1,"publisher":"Cell Press","quality_controlled":"1","page":"1294 - 1303","date_created":"2018-12-11T11:47:52Z","date_published":"2017-05-16T00:00:00Z","doi":"10.1016/j.celrep.2017.04.051","year":"2017","has_accepted_license":"1","publication":"Cell Reports","day":"16","author":[{"full_name":"Lademann, Claudio","last_name":"Lademann","first_name":"Claudio"},{"full_name":"Renkawitz, Jörg","orcid":"0000-0003-2856-3369","last_name":"Renkawitz","first_name":"Jörg","id":"3F0587C8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Boris","last_name":"Pfander","full_name":"Pfander, Boris"},{"last_name":"Jentsch","full_name":"Jentsch, Stefan","first_name":"Stefan"}],"publist_id":"7046","title":"The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination","citation":{"ieee":"C. Lademann, J. Renkawitz, B. Pfander, and S. Jentsch, “The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination,” Cell Reports, vol. 19, no. 7. Cell Press, pp. 1294–1303, 2017.","short":"C. Lademann, J. Renkawitz, B. Pfander, S. Jentsch, Cell Reports 19 (2017) 1294–1303.","ama":"Lademann C, Renkawitz J, Pfander B, Jentsch S. The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. Cell Reports. 2017;19(7):1294-1303. doi:10.1016/j.celrep.2017.04.051","apa":"Lademann, C., Renkawitz, J., Pfander, B., & Jentsch, S. (2017). The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2017.04.051","mla":"Lademann, Claudio, et al. “The INO80 Complex Removes H2A.Z to Promote Presynaptic Filament Formation during Homologous Recombination.” Cell Reports, vol. 19, no. 7, Cell Press, 2017, pp. 1294–303, doi:10.1016/j.celrep.2017.04.051.","ista":"Lademann C, Renkawitz J, Pfander B, Jentsch S. 2017. The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. Cell Reports. 19(7), 1294–1303.","chicago":"Lademann, Claudio, Jörg Renkawitz, Boris Pfander, and Stefan Jentsch. “The INO80 Complex Removes H2A.Z to Promote Presynaptic Filament Formation during Homologous Recombination.” Cell Reports. Cell Press, 2017. https://doi.org/10.1016/j.celrep.2017.04.051."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"department":[{"_id":"CaHe"}],"title":"Multiscale force sensing in development","publist_id":"7040","author":[{"last_name":"Petridou","orcid":"0000-0002-8451-1195","full_name":"Petridou, Nicoletta","first_name":"Nicoletta","id":"2A003F6C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Spiro, Zoltan P","last_name":"Spiro","first_name":"Zoltan P","id":"426AD026-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:08:59Z","citation":{"chicago":"Petridou, Nicoletta, Zoltan P Spiro, and Carl-Philipp J Heisenberg. “Multiscale Force Sensing in Development.” Nature Cell Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/ncb3524.","ista":"Petridou N, Spiro ZP, Heisenberg C-PJ. 2017. Multiscale force sensing in development. Nature Cell Biology. 19(6), 581–588.","mla":"Petridou, Nicoletta, et al. “Multiscale Force Sensing in Development.” Nature Cell Biology, vol. 19, no. 6, Nature Publishing Group, 2017, pp. 581–88, doi:10.1038/ncb3524.","short":"N. Petridou, Z.P. Spiro, C.-P.J. Heisenberg, Nature Cell Biology 19 (2017) 581–588.","ieee":"N. Petridou, Z. P. Spiro, and C.-P. J. Heisenberg, “Multiscale force sensing in development,” Nature Cell Biology, vol. 19, no. 6. Nature Publishing Group, pp. 581–588, 2017.","apa":"Petridou, N., Spiro, Z. P., & Heisenberg, C.-P. J. (2017). Multiscale force sensing in development. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/ncb3524","ama":"Petridou N, Spiro ZP, Heisenberg C-PJ. Multiscale force sensing in development. Nature Cell Biology. 2017;19(6):581-588. doi:10.1038/ncb3524"},"status":"public","project":[{"_id":"25236028-B435-11E9-9278-68D0E5697425","grant_number":"ALTF534-2016","name":"The generation and function of anisotropic tissue tension in zebrafish epiboly (EMBO Fellowship)"}],"type":"journal_article","_id":"678","date_created":"2018-12-11T11:47:53Z","date_published":"2017-05-31T00:00:00Z","volume":19,"issue":"6","doi":"10.1038/ncb3524","page":"581 - 588","language":[{"iso":"eng"}],"publication":"Nature Cell Biology","day":"31","year":"2017","publication_status":"published","publication_identifier":{"issn":["14657392"]},"intvolume":" 19","month":"05","publisher":"Nature Publishing Group","quality_controlled":"1","scopus_import":1,"oa_version":"None","abstract":[{"lang":"eng","text":"The seminal observation that mechanical signals can elicit changes in biochemical signalling within cells, a process commonly termed mechanosensation and mechanotransduction, has revolutionized our understanding of the role of cell mechanics in various fundamental biological processes, such as cell motility, adhesion, proliferation and differentiation. In this Review, we will discuss how the interplay and feedback between mechanical and biochemical signals control tissue morphogenesis and cell fate specification in embryonic development."}]},{"abstract":[{"text":"Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information. In this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile where all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players' objective, then the objective of every player is violated. We present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games. We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1311.3238","open_access":"1"}],"month":"06","intvolume":" 254","publication_identifier":{"issn":["08905401"]},"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"10885"}]},"volume":254,"ec_funded":1,"_id":"681","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-02-21T16:06:02Z","department":[{"_id":"KrCh"}],"publisher":"Elsevier","quality_controlled":"1","oa":1,"year":"2017","day":"01","publication":"Information and Computation","page":"296 - 315","date_published":"2017-06-01T00:00:00Z","doi":"10.1016/j.ic.2016.10.012","date_created":"2018-12-11T11:47:53Z","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"citation":{"ista":"Chatterjee K, Doyen L, Filiot E, Raskin J. 2017. Doomsday equilibria for omega-regular games. Information and Computation. 254, 296–315.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean Raskin. “Doomsday Equilibria for Omega-Regular Games.” Information and Computation. Elsevier, 2017. https://doi.org/10.1016/j.ic.2016.10.012.","short":"K. Chatterjee, L. Doyen, E. Filiot, J. Raskin, Information and Computation 254 (2017) 296–315.","ieee":"K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin, “Doomsday equilibria for omega-regular games,” Information and Computation, vol. 254. Elsevier, pp. 296–315, 2017.","apa":"Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J. (2017). Doomsday equilibria for omega-regular games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2016.10.012","ama":"Chatterjee K, Doyen L, Filiot E, Raskin J. Doomsday equilibria for omega-regular games. Information and Computation. 2017;254:296-315. doi:10.1016/j.ic.2016.10.012","mla":"Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” Information and Computation, vol. 254, Elsevier, 2017, pp. 296–315, doi:10.1016/j.ic.2016.10.012."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7036","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"last_name":"Filiot","full_name":"Filiot, Emmanuel","first_name":"Emmanuel"},{"first_name":"Jean","full_name":"Raskin, Jean","last_name":"Raskin"}],"article_processing_charge":"No","external_id":{"arxiv":["1311.3238"]},"title":"Doomsday equilibria for omega-regular games"},{"_id":"6841","type":"conference","conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2017-04-24","end_date":"2017-04-26","location":"Toulon, France"},"project":[{"name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"status":"public","citation":{"mla":"Martius, Georg S., and Christoph Lampert. “Extrapolation and Learning Equations.” 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, International Conference on Learning Representations, 2017.","short":"G.S. Martius, C. Lampert, in:, 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, International Conference on Learning Representations, 2017.","ieee":"G. S. Martius and C. Lampert, “Extrapolation and learning equations,” in 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, Toulon, France, 2017.","apa":"Martius, G. S., & Lampert, C. (2017). Extrapolation and learning equations. In 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. Toulon, France: International Conference on Learning Representations.","ama":"Martius GS, Lampert C. Extrapolation and learning equations. In: 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. International Conference on Learning Representations; 2017.","chicago":"Martius, Georg S, and Christoph Lampert. “Extrapolation and Learning Equations.” In 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. International Conference on Learning Representations, 2017.","ista":"Martius GS, Lampert C. 2017. Extrapolation and learning equations. 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. ICLR: International Conference on Learning Representations."},"date_updated":"2021-01-12T08:09:17Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Martius, Georg S","last_name":"Martius","first_name":"Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"external_id":{"arxiv":["1610.02995"]},"title":"Extrapolation and learning equations","department":[{"_id":"ChLa"}],"abstract":[{"text":"In classical machine learning, regression is treated as a black box process of identifying a suitable function from a hypothesis set without attempting to gain insight into the mechanism connecting inputs and outputs. In the natural sciences, however, finding an interpretable function for a phenomenon is the prime goal as it allows to understand and generalize results. This paper proposes a novel type of function learning network, called equation learner (EQL), that can learn analytical expressions and is able to extrapolate to unseen domains. It is implemented as an end-to-end differentiable feed-forward network and allows for efficient gradient based training. Due to sparsity regularization concise interpretable expressions can be obtained. Often the true underlying source expression is identified.","lang":"eng"}],"oa_version":"Preprint","quality_controlled":"1","publisher":"International Conference on Learning Representations","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1610.02995","open_access":"1"}],"oa":1,"month":"02","publication_status":"published","year":"2017","day":"21","language":[{"iso":"eng"}],"publication":"5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings","date_published":"2017-02-21T00:00:00Z","date_created":"2019-09-01T22:01:00Z","ec_funded":1},{"publist_id":"7026","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"}],"article_processing_charge":"No","title":"Obligation blackwell games and p-automata","citation":{"ista":"Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 82(2), 420–452.","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic. Cambridge University Press, 2017. https://doi.org/10.1017/jsl.2016.71.","ama":"Chatterjee K, Piterman N. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 2017;82(2):420-452. doi:10.1017/jsl.2016.71","apa":"Chatterjee, K., & Piterman, N. (2017). Obligation blackwell games and p-automata. Journal of Symbolic Logic. Cambridge University Press. https://doi.org/10.1017/jsl.2016.71","ieee":"K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,” Journal of Symbolic Logic, vol. 82, no. 2. Cambridge University Press, pp. 420–452, 2017.","short":"K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.","mla":"Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic, vol. 82, no. 2, Cambridge University Press, 2017, pp. 420–52, doi:10.1017/jsl.2016.71."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"420 - 452","doi":"10.1017/jsl.2016.71","date_published":"2017-06-01T00:00:00Z","date_created":"2018-12-11T11:47:54Z","year":"2017","day":"01","publication":"Journal of Symbolic Logic","quality_controlled":"1","publisher":"Cambridge University Press","oa":1,"department":[{"_id":"KrCh"}],"date_updated":"2021-04-16T12:10:53Z","type":"journal_article","status":"public","_id":"684","issue":"2","volume":82,"publication_identifier":{"issn":["0022-4812"],"eissn":["1943-5886"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1206.5174"}],"month":"06","intvolume":" 82","abstract":[{"lang":"eng","text":"We generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1. We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP∩co-NP. We also show that obligation games provide a game framework for reasoning about p-automata. © 2017 The Association for Symbolic Logic."}],"oa_version":"Submitted Version"},{"publication":"Mechanisms of Development","day":"01","year":"2017","has_accepted_license":"1","date_created":"2018-12-11T11:47:55Z","date_published":"2017-06-01T00:00:00Z","doi":"10.1016/j.mod.2017.03.005","page":"26 - 31","oa":1,"quality_controlled":"1","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years after D’Arcy Thompson’s ‘on Growth and Form.’” Mechanisms of Development, vol. 145, Elsevier, 2017, pp. 26–31, doi:10.1016/j.mod.2017.03.005.","apa":"Briscoe, J., & Kicheva, A. (2017). The physics of development 100 years after D’Arcy Thompson’s “on growth and form.” Mechanisms of Development. Elsevier. https://doi.org/10.1016/j.mod.2017.03.005","ama":"Briscoe J, Kicheva A. The physics of development 100 years after D’Arcy Thompson’s “on growth and form.” Mechanisms of Development. 2017;145:26-31. doi:10.1016/j.mod.2017.03.005","short":"J. Briscoe, A. Kicheva, Mechanisms of Development 145 (2017) 26–31.","ieee":"J. Briscoe and A. Kicheva, “The physics of development 100 years after D’Arcy Thompson’s ‘on growth and form,’” Mechanisms of Development, vol. 145. Elsevier, pp. 26–31, 2017.","chicago":"Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years after D’Arcy Thompson’s ‘on Growth and Form.’” Mechanisms of Development. Elsevier, 2017. https://doi.org/10.1016/j.mod.2017.03.005.","ista":"Briscoe J, Kicheva A. 2017. The physics of development 100 years after D’Arcy Thompson’s “on growth and form”. Mechanisms of Development. 145, 26–31."},"title":"The physics of development 100 years after D'Arcy Thompson's “on growth and form”","external_id":{"pmid":["28366718"]},"publist_id":"7025","author":[{"first_name":"James","full_name":"Briscoe, James","last_name":"Briscoe"},{"id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","first_name":"Anna","last_name":"Kicheva","orcid":"0000-0003-4509-4998","full_name":"Kicheva, Anna"}],"project":[{"grant_number":"680037","name":"Coordination of Patterning And Growth In the Spinal Cord","call_identifier":"H2020","_id":"B6FC0238-B512-11E9-945C-1524E6697425"}],"language":[{"iso":"eng"}],"file":[{"file_id":"6335","checksum":"727043d2e4199fbef6b3704e6d1ac105","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-04-17T07:58:48Z","file_name":"2017_Briscoe_Kicheva_and_DArcy_accepted_version.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:42Z","file_size":652313}],"publication_status":"published","publication_identifier":{"issn":["09254773"]},"ec_funded":1,"volume":145,"oa_version":"Submitted Version","pmid":1,"abstract":[{"text":"By applying methods and principles from the physical sciences to biological problems, D'Arcy Thompson's On Growth and Form demonstrated how mathematical reasoning reveals elegant, simple explanations for seemingly complex processes. This has had a profound influence on subsequent generations of developmental biologists. We discuss how this influence can be traced through twentieth century morphologists, embryologists and theoreticians to current research that explores the molecular and cellular mechanisms of tissue growth and patterning, including our own studies of the vertebrate neural tube.","lang":"eng"}],"intvolume":" 145","month":"06","scopus_import":1,"ddc":["571"],"date_updated":"2021-01-12T08:09:20Z","department":[{"_id":"AnKi"}],"file_date_updated":"2020-07-14T12:47:42Z","_id":"685","pubrep_id":"985","status":"public","type":"journal_article"}]