--- _id: '1113' abstract: - lang: eng 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.' article_processing_charge: No article_type: original author: - first_name: Radoslav full_name: Fulek, Radoslav id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87 last_name: Fulek orcid: 0000-0001-8485-1774 - first_name: Michael full_name: Pelsmajer, Michael last_name: Pelsmajer - first_name: Marcus full_name: Schaefer, Marcus last_name: Schaefer citation: 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 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 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. 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. ista: Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 21(1), 135–154. 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. short: R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications 21 (2017) 135–154. date_created: 2018-12-11T11:50:13Z date_published: 2017-01-01T00:00:00Z date_updated: 2023-02-23T10:05:57Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.7155/jgaa.00408 ec_funded: 1 external_id: arxiv: - '1608.08662' file: - access_level: open_access content_type: application/pdf creator: dernst date_created: 2019-10-24T10:54:37Z date_updated: 2019-10-24T10:54:37Z file_id: '6967' file_name: 2017_JournalGraphAlgorithms_Fulek.pdf file_size: 573623 relation: main_file success: 1 file_date_updated: 2019-10-24T10:54:37Z has_accepted_license: '1' intvolume: ' 21' issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 135 - 154 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Journal of Graph Algorithms and Applications publication_status: published publisher: Brown University publist_id: '6254' quality_controlled: '1' related_material: record: - id: '1164' relation: earlier_version status: public - id: '1595' relation: earlier_version status: public scopus_import: 1 status: public title: Hanani-Tutte for radial planarity type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 21 year: '2017' ... --- _id: '444' abstract: - lang: eng 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. author: - first_name: Leonid A full_name: Sazanov, Leonid A id: 338D39FE-F248-11E8-B48F-1D18A9856A87 last_name: Sazanov orcid: 0000-0002-0977-7989 citation: 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.' 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.' 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.' 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. date_created: 2018-12-11T11:46:30Z date_published: 2017-11-29T00:00:00Z date_updated: 2021-01-12T07:56:59Z day: '29' department: - _id: LeSa doi: 10.1039/9781788010405-00025 editor: - first_name: Mårten full_name: Wikström, Mårten last_name: Wikström language: - iso: eng month: '11' oa_version: None page: 25 - 59 publication: 'Mechanisms of primary energy transduction in biology ' publication_identifier: isbn: - 978-1-78262-865-1 publication_status: published publisher: Royal Society of Chemistry publist_id: '7379' quality_controlled: '1' series_title: 'Mechanisms of Primary Energy Transduction in Biology ' status: public title: 'Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions' type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '453' 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. 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). ' article_processing_charge: No article_type: original author: - first_name: Todd full_name: Fallesen, Todd last_name: Fallesen - first_name: Johanna full_name: Roostalu, Johanna last_name: Roostalu - first_name: Christian F full_name: Düllberg, Christian F id: 459064DC-F248-11E8-B48F-1D18A9856A87 last_name: Düllberg orcid: 0000-0001-6335-9748 - first_name: Gunnar full_name: Pruessner, Gunnar last_name: Pruessner - first_name: Thomas full_name: Surrey, Thomas last_name: Surrey citation: 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 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. 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. 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. 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. short: T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067. date_created: 2018-12-11T11:46:33Z date_published: 2017-11-07T00:00:00Z date_updated: 2021-01-12T07:59:28Z day: '07' ddc: - '570' department: - _id: MaLo doi: 10.1016/j.bpj.2017.09.006 file: - access_level: open_access checksum: 99a2474088e20ac74b1882c4fbbb45b1 content_type: application/pdf creator: system date_created: 2018-12-12T10:14:03Z date_updated: 2020-07-14T12:46:31Z file_id: '5052' file_name: IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf file_size: 977192 relation: main_file file_date_updated: 2020-07-14T12:46:31Z has_accepted_license: '1' intvolume: ' 113' issue: '9' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 2055 - 2067 publication: Biophysical Journal publication_status: published publisher: Biophysical Society publist_id: '7369' pubrep_id: '965' quality_controlled: '1' status: public title: Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 113 year: '2017' ... --- _id: '464' abstract: - lang: eng 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. article_number: '26' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Veronika full_name: Loitzenbauer, Veronika last_name: Loitzenbauer citation: 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 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. 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. ista: Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26. 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. short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017). date_created: 2018-12-11T11:46:37Z date_published: 2017-09-26T00:00:00Z date_updated: 2023-02-23T10:08:55Z day: '26' ddc: - '004' department: - _id: KrCh doi: 10.23638/LMCS-13(3:26)2017 ec_funded: 1 external_id: arxiv: - '1410.0833' file: - access_level: open_access checksum: 12d469ae69b80361333d7dead965cf5d content_type: application/pdf creator: system date_created: 2018-12-12T10:13:27Z date_updated: 2020-07-14T12:46:32Z file_id: '5010' file_name: IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf file_size: 582940 relation: main_file file_date_updated: 2020-07-14T12:46:32Z has_accepted_license: '1' intvolume: ' 13' issue: '3' language: - iso: eng license: https://creativecommons.org/licenses/by-nd/4.0/ month: '09' oa: 1 oa_version: Published Version project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Logical Methods in Computer Science publication_identifier: issn: - 1860-5974 publication_status: published publisher: International Federation of Computational Logic publist_id: '7357' pubrep_id: '956' quality_controlled: '1' related_material: record: - id: '1661' relation: earlier_version status: public scopus_import: '1' status: public title: Improved algorithms for parity and Streett objectives tmp: image: /image/cc_by_nd.png legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0) short: CC BY-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2017' ... --- _id: '470' 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. acknowledged_ssus: - _id: ScienComp article_number: '103' article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Stefan full_name: Jeschke, Stefan id: 44D6411A-F248-11E8-B48F-1D18A9856A87 last_name: Jeschke - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 citation: 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. ieee: S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics, vol. 36, no. 4. ACM, 2017. ista: Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103. 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. short: S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017). date_created: 2018-12-11T11:46:39Z date_published: 2017-07-01T00:00:00Z date_updated: 2023-02-23T12:20:26Z day: '01' ddc: - '006' department: - _id: ChWo doi: 10.1145/3072959.3073678 ec_funded: 1 file: - access_level: open_access checksum: 82a3b2bfeee4ddef16ecc21675d1a48a content_type: application/pdf creator: wojtan date_created: 2020-01-24T09:32:35Z date_updated: 2020-07-14T12:46:34Z file_id: '7359' file_name: wavepackets_final.pdf file_size: 13131683 relation: main_file file_date_updated: 2020-07-14T12:46:34Z has_accepted_license: '1' intvolume: ' 36' issue: '4' language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: Efficient Simulation of Natural Phenomena at Extremely Large Scales publication: ACM Transactions on Graphics publication_identifier: issn: - '07300301' publication_status: published publisher: ACM publist_id: '7350' quality_controlled: '1' scopus_import: 1 status: public title: Water wave packets type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 36 year: '2017' ... --- _id: '471' 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. ' article_number: '12' author: - first_name: Przemyslaw full_name: Daca, Przemyslaw id: 49351290-F248-11E8-B48F-1D18A9856A87 last_name: Daca - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 - first_name: Tatjana full_name: Petrov, Tatjana id: 3D5811FC-F248-11E8-B48F-1D18A9856A87 last_name: Petrov orcid: 0000-0002-9041-0905 citation: 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 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. 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. 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. 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. short: P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017). date_created: 2018-12-11T11:46:39Z date_published: 2017-05-01T00:00:00Z date_updated: 2023-02-21T16:48:11Z day: '01' department: - _id: ToHe doi: 10.1145/3060139 ec_funded: 1 intvolume: ' 18' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1504.05739 month: '05' oa: 1 oa_version: Submitted Version project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _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) publication_identifier: issn: - '15293785' publication_status: published publisher: ACM publist_id: '7349' quality_controlled: '1' related_material: record: - id: '1234' relation: earlier_version status: public scopus_import: 1 status: public title: Faster statistical model checking for unbounded temporal properties type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 18 year: '2017' ... --- _id: '481' abstract: - lang: eng 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. acknowledgement: 'Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15.' author: - first_name: Therese full_name: Biedl, Therese last_name: Biedl - first_name: Stefan full_name: Huber, Stefan id: 4700A070-F248-11E8-B48F-1D18A9856A87 last_name: Huber orcid: 0000-0002-8871-5814 - first_name: Peter full_name: Palfrader, Peter last_name: Palfrader citation: 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. 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. 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. 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. date_created: 2018-12-11T11:46:43Z date_published: 2017-04-13T00:00:00Z date_updated: 2023-02-21T16:06:22Z day: '13' ddc: - '004' - '514' - '516' department: - _id: HeEd doi: 10.1142/S0218195916600050 file: - access_level: open_access checksum: f79e8558bfe4b368dfefeb8eec2e3a5e content_type: application/pdf creator: system date_created: 2018-12-12T10:09:34Z date_updated: 2020-07-14T12:46:35Z file_id: '4758' file_name: IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf file_size: 769296 relation: main_file file_date_updated: 2020-07-14T12:46:35Z has_accepted_license: '1' intvolume: ' 26' issue: 3-4 language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 211 - 229 publication: International Journal of Computational Geometry and Applications publication_status: published publisher: World Scientific Publishing publist_id: '7338' pubrep_id: '949' quality_controlled: '1' related_material: record: - id: '10892' relation: earlier_version status: public scopus_import: 1 status: public title: Planar matchings for weighted straight skeletons tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 26 year: '2017' ... --- _id: '484' 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. author: - first_name: Phan full_name: Nam, Phan id: 404092F4-F248-11E8-B48F-1D18A9856A87 last_name: Nam - first_name: Marcin M full_name: Napiórkowski, Marcin M id: 4197AD04-F248-11E8-B48F-1D18A9856A87 last_name: Napiórkowski citation: 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 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. 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. 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. short: P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738. date_created: 2018-12-11T11:46:43Z date_published: 2017-01-01T00:00:00Z date_updated: 2021-01-12T08:00:58Z day: '01' department: - _id: RoSe doi: 10.4310/ATMP.2017.v21.n3.a4 ec_funded: 1 intvolume: ' 21' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1509.04631 month: '01' oa: 1 oa_version: Submitted Version page: 683 - 738 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 25C878CE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P27533_N27 name: Structure of the Excitation Spectrum for Many-Body Quantum Systems publication: Advances in Theoretical and Mathematical Physics publication_identifier: issn: - '10950761' publication_status: published publisher: International Press publist_id: '7336' quality_controlled: '1' scopus_import: 1 status: public title: Bogoliubov correction to the mean-field dynamics of interacting bosons type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 21 year: '2017' ... --- _id: '483' abstract: - lang: eng 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. author: - first_name: Paul full_name: Bourgade, Paul last_name: Bourgade - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Horng full_name: Yau, Horng last_name: Yau - first_name: Jun full_name: Yin, Jun last_name: Yin citation: 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 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 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. 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. 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. 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. short: P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800. date_created: 2018-12-11T11:46:43Z date_published: 2017-08-25T00:00:00Z date_updated: 2021-01-12T08:00:57Z day: '25' department: - _id: LaEr doi: 10.4310/ATMP.2017.v21.n3.a5 ec_funded: 1 intvolume: ' 21' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1602.02312 month: '08' oa: 1 oa_version: Submitted Version page: 739 - 800 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Advances in Theoretical and Mathematical Physics publication_identifier: issn: - '10950761' publication_status: published publisher: International Press publist_id: '7337' quality_controlled: '1' scopus_import: 1 status: public title: Universality for a class of random band matrices type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 21 year: '2017' ... --- _id: '487' abstract: - lang: eng 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. author: - first_name: Ghufran full_name: Baig, Ghufran last_name: Baig - first_name: Bozidar full_name: Radunovic, Bozidar last_name: Radunovic - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Matthew full_name: Balkwill, Matthew last_name: Balkwill - first_name: Thomas full_name: Karagiannis, Thomas last_name: Karagiannis - first_name: Lili full_name: Qiu, Lili last_name: Qiu 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' 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. 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. 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.' 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. 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. conference: end_date: 2017-12-15 location: Incheon, South Korea name: 'CoNEXT: Conference on emerging Networking EXperiments and Technologies' start_date: 2017-12-12 date_created: 2018-12-11T11:46:45Z date_published: 2017-11-28T00:00:00Z date_updated: 2023-02-23T12:21:11Z day: '28' department: - _id: DaAl doi: 10.1145/3143361.3143367 language: - iso: eng month: '11' oa_version: None page: 2 - 14 publication: Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies publication_identifier: isbn: - 978-145035422-6 publication_status: published publisher: ACM publist_id: '7333' quality_controlled: '1' scopus_import: 1 status: public title: Towards unlicensed cellular networks in TV white spaces type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '514' 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.' article_number: '16032' author: - first_name: Jean full_name: Simonnet, Jean last_name: Simonnet - first_name: Mérie full_name: Nassar, Mérie last_name: Nassar - first_name: Federico full_name: Stella, Federico id: 39AF1E74-F248-11E8-B48F-1D18A9856A87 last_name: Stella orcid: 0000-0001-9439-3148 - first_name: Ivan full_name: Cohen, Ivan last_name: Cohen - first_name: Bertrand full_name: Mathon, Bertrand last_name: Mathon - first_name: Charlotte full_name: Boccara, Charlotte id: 3FC06552-F248-11E8-B48F-1D18A9856A87 last_name: Boccara orcid: 0000-0001-7237-5109 - first_name: Richard full_name: Miles, Richard last_name: Miles - first_name: Desdemona full_name: Fricker, Desdemona last_name: Fricker citation: 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 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 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. 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. 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. 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. short: J. Simonnet, M. Nassar, F. Stella, I. Cohen, B. Mathon, C.N. Boccara, R. Miles, D. Fricker, Nature Communications 8 (2017). date_created: 2018-12-11T11:46:54Z date_published: 2017-07-01T00:00:00Z date_updated: 2021-01-12T08:01:16Z day: '01' ddc: - '571' department: - _id: JoCs doi: 10.1038/ncomms16032 file: - access_level: open_access checksum: 76d8a2b72a58e56adb410ec37dfa7eee content_type: application/pdf creator: system date_created: 2018-12-12T10:14:31Z date_updated: 2020-07-14T12:46:36Z file_id: '5083' file_name: IST-2018-937-v1+1_2017_Stella_Activity_dependent.pdf file_size: 2948357 relation: main_file file_date_updated: 2020-07-14T12:46:36Z has_accepted_license: '1' intvolume: ' 8' language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - '20411723' publication_status: published publisher: Nature Publishing Group publist_id: '7305' pubrep_id: '937' quality_controlled: '1' scopus_import: 1 status: public title: Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2017' ... --- _id: '515' 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.' article_type: original author: - first_name: James A full_name: Letts, James A id: 322DA418-F248-11E8-B48F-1D18A9856A87 last_name: Letts orcid: 0000-0002-9864-3586 - first_name: Leonid A full_name: Sazanov, Leonid A id: 338D39FE-F248-11E8-B48F-1D18A9856A87 last_name: Sazanov orcid: 0000-0002-0977-7989 citation: 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' 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' 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.' 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.' 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.' 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.' short: J.A. Letts, L.A. Sazanov, Nature Structural and Molecular Biology 24 (2017) 800–808. date_created: 2018-12-11T11:46:54Z date_published: 2017-10-05T00:00:00Z date_updated: 2021-01-12T08:01:17Z day: '05' ddc: - '572' department: - _id: LeSa doi: 10.1038/nsmb.3460 ec_funded: 1 file: - access_level: open_access checksum: 9bc7e8c41b43636dd7566289e511f096 content_type: application/pdf creator: lsazanov date_created: 2019-11-07T12:51:07Z date_updated: 2020-07-14T12:46:36Z file_id: '6993' file_name: 29893_2_merged_1501257589_red.pdf file_size: 4118385 relation: main_file file_date_updated: 2020-07-14T12:46:36Z has_accepted_license: '1' intvolume: ' 24' issue: '10' language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 800 - 808 project: - _id: 2590DB08-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '701309' name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020) publication: Nature Structural and Molecular Biology publication_identifier: issn: - '15459993' publication_status: published publisher: Nature Publishing Group publist_id: '7304' quality_controlled: '1' scopus_import: 1 status: public title: 'Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 24 year: '2017' ... --- _id: '513' 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.' article_number: '043904' author: - first_name: Lukasz full_name: Klotz, Lukasz id: 2C9AF1C2-F248-11E8-B48F-1D18A9856A87 last_name: Klotz orcid: 0000-0003-1740-7635 - first_name: Grégoire M full_name: Lemoult, Grégoire M id: 4787FE80-F248-11E8-B48F-1D18A9856A87 last_name: Lemoult - first_name: Idalia full_name: Frontczak, Idalia last_name: Frontczak - first_name: Laurette full_name: Tuckerman, Laurette last_name: Tuckerman - first_name: José full_name: Wesfreid, José last_name: Wesfreid citation: 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' 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' 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.' 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.' 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.' short: L. Klotz, G.M. Lemoult, I. Frontczak, L. Tuckerman, J. Wesfreid, Physical Review Fluids 2 (2017). date_created: 2018-12-11T11:46:54Z date_published: 2017-04-01T00:00:00Z date_updated: 2021-01-12T08:01:16Z day: '01' department: - _id: BjHo doi: 10.1103/PhysRevFluids.2.043904 intvolume: ' 2' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1704.02619 month: '04' oa: 1 oa_version: Preprint publication: Physical Review Fluids publication_status: published publisher: American Physical Society publist_id: '7306' quality_controlled: '1' scopus_import: 1 status: public title: 'Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2017' ... --- _id: '520' 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. article_type: letter_note author: - first_name: Wei full_name: Du, Wei last_name: Du - first_name: Andreas full_name: Angermayr, Andreas id: 4677C796-F248-11E8-B48F-1D18A9856A87 last_name: Angermayr orcid: 0000-0001-8619-2223 - first_name: Joeri full_name: Jongbloets, Joeri last_name: Jongbloets - first_name: Douwe full_name: Molenaar, Douwe last_name: Molenaar - first_name: Herwig full_name: Bachmann, Herwig last_name: Bachmann - first_name: Klaas full_name: Hellingwerf, Klaas last_name: Hellingwerf - first_name: Filipe full_name: Branco Dos Santos, Filipe last_name: Branco Dos Santos citation: 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 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 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. 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. 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. 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. short: W. Du, A. Angermayr, J. Jongbloets, D. Molenaar, H. Bachmann, K. Hellingwerf, F. Branco Dos Santos, ACS Synthetic Biology 6 (2017) 395–401. date_created: 2018-12-11T11:46:56Z date_published: 2017-03-17T00:00:00Z date_updated: 2021-01-12T08:01:21Z day: '17' department: - _id: ToBo doi: 10.1021/acssynbio.6b00235 external_id: pmid: - '27936615' intvolume: ' 6' issue: '3' language: - iso: eng month: '03' oa_version: None page: 395 - 401 pmid: 1 publication: ACS Synthetic Biology publication_identifier: issn: - '21615063' publication_status: published publisher: American Chemical Society publist_id: '7298' quality_controlled: '1' scopus_import: 1 status: public title: Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803 type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2017' ... --- _id: '521' abstract: - lang: eng 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. author: - first_name: Kyle full_name: Austin, Kyle last_name: Austin - first_name: Ziga full_name: Virk, Ziga id: 2E36B656-F248-11E8-B48F-1D18A9856A87 last_name: Virk citation: 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. ieee: K. Austin and Z. Virk, “Higson compactification and dimension raising,” Topology and its Applications, vol. 215. Elsevier, pp. 45–57, 2017. ista: Austin K, Virk Z. 2017. Higson compactification and dimension raising. Topology and its Applications. 215, 45–57. 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. date_created: 2018-12-11T11:46:56Z date_published: 2017-01-01T00:00:00Z date_updated: 2021-01-12T08:01:21Z day: '01' department: - _id: HeEd doi: 10.1016/j.topol.2016.10.005 intvolume: ' 215' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1608.03954v1 month: '01' oa: 1 oa_version: Submitted Version page: 45 - 57 publication: Topology and its Applications publication_identifier: issn: - '01668641' publication_status: published publisher: Elsevier publist_id: '7299' quality_controlled: '1' status: public title: Higson compactification and dimension raising type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 215 year: '2017' ... --- _id: '534' 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. article_processing_charge: No article_type: original author: - first_name: Benjamin full_name: Burton, Benjamin last_name: Burton - first_name: Arnaud N full_name: De Mesmay, Arnaud N id: 3DB2F25C-F248-11E8-B48F-1D18A9856A87 last_name: De Mesmay - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: 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 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. 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. ista: Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 58(4), 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. short: B. Burton, A.N. de Mesmay, U. Wagner, Discrete & Computational Geometry 58 (2017) 871–888. date_created: 2018-12-11T11:47:01Z date_published: 2017-06-09T00:00:00Z date_updated: 2023-02-21T17:01:34Z day: '09' department: - _id: UlWa doi: 10.1007/s00454-017-9900-0 external_id: arxiv: - '1602.07907' intvolume: ' 58' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1602.07907 month: '06' oa: 1 oa_version: Preprint page: 871 - 888 publication: Discrete & Computational Geometry publication_identifier: issn: - '01795376' publication_status: published publisher: Springer publist_id: '7283' quality_controlled: '1' related_material: record: - id: '1379' relation: earlier_version status: public scopus_import: 1 status: public title: Finding non-orientable surfaces in 3-Manifolds type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 58 year: '2017' ... --- _id: '538' 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. ' author: - first_name: Stephanie full_name: Kainrath, Stephanie id: 32CFBA64-F248-11E8-B48F-1D18A9856A87 last_name: Kainrath - first_name: Manuela full_name: Stadler, Manuela last_name: Stadler - first_name: Eva full_name: Gschaider-Reichhart, Eva id: 3FEE232A-F248-11E8-B48F-1D18A9856A87 last_name: Gschaider-Reichhart orcid: 0000-0002-7218-7738 - first_name: Martin full_name: Distel, Martin last_name: Distel - first_name: Harald L full_name: Janovjak, Harald L id: 33BA6C30-F248-11E8-B48F-1D18A9856A87 last_name: Janovjak orcid: 0000-0002-8023-9315 citation: 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 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 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. 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. 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. 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. short: S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, H.L. Janovjak, Angewandte Chemie 129 (2017) 4679–4682. date_created: 2018-12-11T11:47:02Z date_published: 2017-05-20T00:00:00Z date_updated: 2021-01-12T08:01:33Z day: '20' ddc: - '571' department: - _id: CaGu - _id: HaJa doi: 10.1002/ange.201611998 ec_funded: 1 file: - access_level: open_access checksum: d66fee867e7cdbfa3fe276c2fb0778bb content_type: application/pdf creator: system date_created: 2018-12-12T10:13:24Z date_updated: 2020-07-14T12:46:39Z file_id: '5007' file_name: IST-2018-932-v1+1_Kainrath_et_al-2017-Angewandte_Chemie.pdf file_size: 1668557 relation: main_file file_date_updated: 2020-07-14T12:46:39Z has_accepted_license: '1' intvolume: ' 129' issue: '16' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 4679 - 4682 project: - _id: 25548C20-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '303564' name: Microbial Ion Channels for Synthetic Neurobiology - _id: 255A6082-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: W1232-B24 name: Molecular Drug Targets publication: Angewandte Chemie publication_status: published publisher: Wiley publist_id: '7279' pubrep_id: '932' quality_controlled: '1' status: public title: Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 129 year: '2017' ... --- _id: '540' 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. article_number: e1006758 author: - first_name: Kseniya full_name: Khamina, Kseniya last_name: Khamina - first_name: Alexander full_name: Lercher, Alexander last_name: Lercher - first_name: Michael full_name: Caldera, Michael last_name: Caldera - first_name: Christopher full_name: Schliehe, Christopher last_name: Schliehe - first_name: Bojan full_name: Vilagos, Bojan last_name: Vilagos - first_name: Mehmet full_name: Sahin, Mehmet last_name: Sahin - first_name: Lindsay full_name: Kosack, Lindsay last_name: Kosack - first_name: Anannya full_name: Bhattacharya, Anannya last_name: Bhattacharya - first_name: Peter full_name: Májek, Peter last_name: Májek - first_name: Alexey full_name: Stukalov, Alexey last_name: Stukalov - first_name: Roberto full_name: Sacco, Roberto id: 42C9F57E-F248-11E8-B48F-1D18A9856A87 last_name: Sacco - first_name: Leo full_name: James, Leo last_name: James - first_name: Daniel full_name: Pinschewer, Daniel last_name: Pinschewer - first_name: Keiryn full_name: Bennett, Keiryn last_name: Bennett - first_name: Jörg full_name: Menche, Jörg last_name: Menche - first_name: Andreas full_name: Bergthaler, Andreas last_name: Bergthaler citation: 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 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 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. 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. 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. 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. 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). date_created: 2018-12-11T11:47:03Z date_published: 2017-12-01T00:00:00Z date_updated: 2021-01-12T08:01:48Z day: '01' ddc: - '576' - '616' department: - _id: GaNo doi: 10.1371/journal.ppat.1006758 file: - access_level: open_access checksum: 1aa20f19a1e90664fadce6e7d5284fdc content_type: application/pdf creator: system date_created: 2018-12-12T10:12:26Z date_updated: 2020-07-14T12:46:44Z file_id: '4944' file_name: IST-2018-931-v1+1_journal.ppat.1006758.pdf file_size: 4106772 relation: main_file file_date_updated: 2020-07-14T12:46:44Z has_accepted_license: '1' intvolume: ' 13' issue: '12' language: - iso: eng month: '12' oa: 1 oa_version: Published Version publication: PLoS Pathogens publication_identifier: issn: - '15537366' publication_status: published publisher: Public Library of Science publist_id: '7276' pubrep_id: '931' quality_controlled: '1' scopus_import: 1 status: public title: Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2017' ... --- _id: '466' 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. ' article_number: '15' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Zuzana full_name: Křetínská, Zuzana last_name: Křetínská - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 citation: 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 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 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. 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. 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. 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. short: K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017). date_created: 2018-12-11T11:46:38Z date_published: 2017-07-03T00:00:00Z date_updated: 2023-02-23T12:26:16Z day: '03' ddc: - '004' department: - _id: KrCh doi: 10.23638/LMCS-13(2:15)2017 ec_funded: 1 file: - access_level: open_access checksum: bfa405385ec6229ad5ead89ab5751639 content_type: application/pdf creator: system date_created: 2018-12-12T10:18:32Z date_updated: 2020-07-14T12:46:33Z file_id: '5354' file_name: IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf file_size: 511832 relation: main_file file_date_updated: 2020-07-14T12:46:33Z has_accepted_license: '1' intvolume: ' 13' issue: '2' language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _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 grant_number: '701309' name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020) publication: Logical Methods in Computer Science publication_identifier: issn: - '18605974' publication_status: published publisher: International Federation of Computational Logic publist_id: '7355' pubrep_id: '957' quality_controlled: '1' related_material: record: - id: '1657' relation: earlier_version status: public - id: '5429' relation: earlier_version status: public - id: '5435' relation: earlier_version status: public scopus_import: 1 status: public title: Unifying two views on multiple mean-payoff objectives in Markov decision processes tmp: image: /image/cc_by_nd.png legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0) short: CC BY-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2017' ... --- _id: '467' 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. article_number: '31' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jan full_name: Otop, Jan id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87 last_name: Otop citation: ama: Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769 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 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. ista: Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31. 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. short: K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017). date_created: 2018-12-11T11:46:38Z date_published: 2017-12-01T00:00:00Z date_updated: 2023-02-23T12:26:19Z day: '01' department: - _id: KrCh - _id: ToHe doi: 10.1145/3152769 ec_funded: 1 external_id: arxiv: - '1606.03598' intvolume: ' 18' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1606.03598 month: '12' oa: 1 oa_version: Preprint project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: ACM Transactions on Computational Logic (TOCL) publication_identifier: issn: - '15293785' publication_status: published publisher: ACM publist_id: '7354' quality_controlled: '1' related_material: record: - id: '1656' relation: earlier_version status: public - id: '5415' relation: earlier_version status: public - id: '5436' relation: earlier_version status: public scopus_import: 1 status: public title: Nested weighted automata type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 18 year: '2017' ... --- _id: '465' abstract: - lang: eng 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. ' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Jan full_name: Otop, Jan last_name: Otop citation: 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 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. 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. 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. short: K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017). date_created: 2018-12-11T11:46:37Z date_published: 2017-09-13T00:00:00Z date_updated: 2023-02-23T12:26:25Z day: '13' ddc: - '004' department: - _id: KrCh - _id: ToHe doi: 10.23638/LMCS-13(3:23)2017 ec_funded: 1 file: - access_level: open_access checksum: 08041379ba408d40664f449eb5907a8f content_type: application/pdf creator: system date_created: 2018-12-12T10:14:37Z date_updated: 2020-07-14T12:46:33Z file_id: '5090' file_name: IST-2015-321-v1+1_main.pdf file_size: 279071 relation: main_file - access_level: open_access checksum: 08041379ba408d40664f449eb5907a8f content_type: application/pdf creator: system date_created: 2018-12-12T10:14:38Z date_updated: 2020-07-14T12:46:33Z file_id: '5091' file_name: IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf file_size: 279071 relation: main_file file_date_updated: 2020-07-14T12:46:33Z has_accepted_license: '1' intvolume: ' 13' issue: '3' language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory publication: Logical Methods in Computer Science publication_identifier: issn: - '18605974' publication_status: published publisher: International Federation of Computational Logic publist_id: '7356' pubrep_id: '955' quality_controlled: '1' related_material: record: - id: '1610' relation: earlier_version status: public - id: '5438' relation: earlier_version status: public scopus_import: 1 status: public title: Edit distance for pushdown automata tmp: image: /image/cc_by_nd.png legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0) short: CC BY-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13 year: '2017' ... --- _id: '512' abstract: - lang: eng 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. ' article_number: '82' article_processing_charge: No author: - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin full_name: Nowak, Martin last_name: Nowak citation: 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' 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' 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.' 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.' ista: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.' 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.' short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017). date_created: 2018-12-11T11:46:53Z date_published: 2017-03-06T00:00:00Z date_updated: 2023-02-23T12:26:57Z day: '06' ddc: - '004' department: - _id: KrCh doi: 10.1038/s41598-017-00107-w ec_funded: 1 file: - access_level: open_access checksum: 7d05cbdd914e194a019c0f91fb64e9a8 content_type: application/pdf creator: system date_created: 2018-12-12T10:18:35Z date_updated: 2020-07-14T12:46:36Z file_id: '5357' file_name: IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf file_size: 1536783 relation: main_file file_date_updated: 2020-07-14T12:46:36Z has_accepted_license: '1' intvolume: ' 7' issue: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Scientific Reports publication_identifier: issn: - '20452322' publication_status: published publisher: Nature Publishing Group publist_id: '7307' pubrep_id: '938' quality_controlled: '1' related_material: record: - id: '5449' relation: earlier_version status: public scopus_import: 1 status: public title: 'Amplification on undirected population structures: Comets beat stars' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2017' ... --- _id: '10416' abstract: - lang: eng 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.' 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" article_number: '30' article_processing_charge: No article_type: original author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Bhavya full_name: Choudhary, Bhavya last_name: Choudhary - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 citation: 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. 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. 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. 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. short: K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017). conference: end_date: 2018-01-13 location: Los Angeles, CA, United States name: 'POPL: Programming Languages' start_date: 2018-01-07 date_created: 2021-12-05T23:01:48Z date_published: 2017-12-27T00:00:00Z date_updated: 2023-02-23T12:27:13Z day: '27' ddc: - '000' department: - _id: KrCh doi: 10.1145/3158118 ec_funded: 1 external_id: arxiv: - '1910.00241' file: - access_level: open_access checksum: faa3f7b3fe8aab84b50ed805c26a0ee5 content_type: application/pdf creator: cchlebak date_created: 2021-12-07T08:06:28Z date_updated: 2021-12-07T08:06:28Z file_id: '10421' file_name: 2017_ACMProgLang_Chatterjee.pdf file_size: 460188 relation: main_file success: 1 file_date_updated: 2021-12-07T08:06:28Z has_accepted_license: '1' intvolume: ' 2' issue: POPL language: - iso: eng month: '12' oa: 1 oa_version: Published Version project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: Proceedings of the ACM on Programming Languages publication_identifier: eissn: - 2475-1421 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '5455' relation: earlier_version status: public scopus_import: '1' status: public title: Optimal Dyck reachability for data-dependence and Alias analysis tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 2 year: '2017' ... --- _id: '5455' 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.' alternative_title: - IST Austria Technical Report article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Bhavya full_name: Choudhary, Bhavya last_name: Choudhary - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 citation: 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 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 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. ieee: K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017. ista: Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p. 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. short: K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017. date_created: 2018-12-12T11:39:26Z date_published: 2017-10-23T00:00:00Z date_updated: 2023-02-21T15:54:10Z day: '23' ddc: - '000' department: - _id: KrCh doi: 10.15479/AT:IST-2017-870-v1-1 file: - access_level: open_access checksum: 177a84a46e3ac17e87b31534ad16a4c9 content_type: application/pdf creator: system date_created: 2018-12-12T11:54:02Z date_updated: 2020-07-14T12:46:59Z file_id: '5524' file_name: IST-2017-870-v1+1_main.pdf file_size: 960491 relation: main_file file_date_updated: 2020-07-14T12:46:59Z has_accepted_license: '1' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: '37' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '870' related_material: record: - id: '10416' relation: later_version status: public status: public title: Optimal Dyck reachability for data-dependence and alias analysis type: technical_report user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2017' ... --- _id: '5450' abstract: - lang: eng 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.' author: - first_name: Barbara full_name: Barbara Petritsch id: 406048EC-F248-11E8-B48F-1D18A9856A87 last_name: Petritsch orcid: 0000-0003-2724-4614 citation: ama: Petritsch B. Implementing the Institutional Data Repository IST DataRep. IST Austria; 2017. apa: Petritsch, B. (2017). Implementing the institutional data repository IST DataRep. IST Austria. 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. ista: Petritsch B. 2017. Implementing the institutional data repository IST DataRep, IST Austria,p. mla: Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep. IST Austria, 2017. short: B. Petritsch, Implementing the Institutional Data Repository IST DataRep, IST Austria, 2017. date_created: 2018-12-12T11:39:24Z date_published: 2017-06-26T00:00:00Z date_updated: 2020-07-14T23:05:03Z day: '26' department: - _id: E-Lib extern: 0 file: - access_level: open_access checksum: 6321792dcfa82bf490f17615a9b22355 content_type: application/pdf creator: system date_created: 2018-12-12T11:53:22Z date_updated: 2020-07-14T12:46:59Z file_id: '5483' file_name: IST-2017-724-v1+1_DataRep_Project_Report_2017.pdf file_size: 3460985 relation: main_file file_date_updated: 2020-07-14T12:46:59Z main_file_link: - open_access: '1' url: https://repository.ist.ac.at/id/eprint/724. month: '06' oa: 1 publication_date: 2017-06-26 publisher: IST Austria pubrep_id: '724' status: public title: Implementing the institutional data repository IST DataRep type: report year: '2017' ... --- _id: '10417' 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." 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." article_number: '31' article_processing_charge: No article_type: original author: - first_name: Marek full_name: Chalupa, Marek last_name: Chalupa - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Nishant full_name: Sinha, Nishant last_name: Sinha - first_name: Kapil full_name: Vaidya, Kapil last_name: Vaidya citation: 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' 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. 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. 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. 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. short: M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2017). conference: end_date: 2018-01-13 location: Los Angeles, CA, United States name: 'POPL: Programming Languages' start_date: 2018-01-07 date_created: 2021-12-05T23:01:49Z date_published: 2017-12-27T00:00:00Z date_updated: 2023-02-23T12:27:16Z day: '27' department: - _id: KrCh doi: 10.1145/3158119 ec_funded: 1 external_id: arxiv: - '1610.01188' intvolume: ' 2' issue: POPL language: - iso: eng main_file_link: - open_access: '1' url: https://dl.acm.org/doi/10.1145/3158119 month: '12' oa: 1 oa_version: Published Version project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Proceedings of the ACM on Programming Languages publication_identifier: eissn: - 2475-1421 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '5448' relation: earlier_version status: public - id: '5456' relation: earlier_version status: public scopus_import: '1' status: public title: Data-centric dynamic partial order reduction type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 2 year: '2017' ... --- _id: '5456' 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\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." alternative_title: - IST Austria Technical Report author: - first_name: Marek full_name: Chalupa, Marek last_name: Chalupa - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 - first_name: Nishant full_name: Sinha, Nishant last_name: Sinha - first_name: Kapil full_name: Vaidya, Kapil last_name: Vaidya 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 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. ieee: M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017. ista: Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p. mla: Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017, doi:10.15479/AT:IST-2017-872-v1-1. short: M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017. date_created: 2018-12-12T11:39:26Z date_published: 2017-10-23T00:00:00Z date_updated: 2023-02-23T12:26:54Z day: '23' ddc: - '000' department: - _id: KrCh doi: 10.15479/AT:IST-2017-872-v1-1 file: - access_level: open_access checksum: d2635c4cf013000f0a1b09e80f9e4ab7 content_type: application/pdf creator: system date_created: 2018-12-12T11:53:26Z date_updated: 2020-07-14T12:46:59Z file_id: '5487' file_name: IST-2017-872-v1+1_main.pdf file_size: 910347 relation: main_file file_date_updated: 2020-07-14T12:46:59Z has_accepted_license: '1' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: '36' publication_identifier: issn: - 2664-1690 publication_status: published publisher: IST Austria pubrep_id: '872' related_material: record: - id: '10417' relation: later_version status: public - id: '5448' relation: earlier_version status: public status: public title: Data-centric dynamic partial order reduction type: technical_report user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '551' 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. ' alternative_title: - LIPIcs article_number: '61' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Martin full_name: Nowak, Martin last_name: Nowak citation: 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' 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. 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. 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.' 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. short: K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. conference: end_date: 2017-08-25 location: Aalborg, Denmark name: 'MFCS: Mathematical Foundations of Computer Science (SG)' start_date: 2017-08-21 date_created: 2018-12-11T11:47:08Z date_published: 2017-11-01T00:00:00Z date_updated: 2021-01-12T08:02:34Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.4230/LIPIcs.MFCS.2017.61 file: - access_level: open_access checksum: 2eed5224c0e4e259484a1d71acb8ba6a content_type: application/pdf creator: system date_created: 2018-12-12T10:18:04Z date_updated: 2020-07-14T12:47:00Z file_id: '5322' file_name: IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf file_size: 535077 relation: main_file file_date_updated: 2020-07-14T12:47:00Z has_accepted_license: '1' intvolume: ' 83' language: - iso: eng month: '11' oa: 1 oa_version: Published Version publication: Leibniz International Proceedings in Informatics publication_identifier: isbn: - 978-395977046-0 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '7263' pubrep_id: '924' quality_controlled: '1' scopus_import: 1 status: public title: Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 83 year: '2017' ... --- _id: '552' 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).' alternative_title: - LIPIcs article_number: '39' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Svozil, Alexander last_name: Svozil citation: 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' 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' 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. 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. 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.' 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. conference: end_date: 2017-08-25 location: Aalborg, Denmark name: 'MFCS: Mathematical Foundations of Computer Science (SG)' start_date: 2017-08-21 date_created: 2018-12-11T11:47:08Z date_published: 2017-11-01T00:00:00Z date_updated: 2023-02-14T10:06:46Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.4230/LIPIcs.MFCS.2017.39 ec_funded: 1 file: - access_level: open_access checksum: c67f4866ddbfd555afef1f63ae9a8fc7 content_type: application/pdf creator: system date_created: 2018-12-12T10:16:57Z date_updated: 2020-07-14T12:47:00Z file_id: '5248' file_name: IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf file_size: 610339 relation: main_file file_date_updated: 2020-07-14T12:47:00Z has_accepted_license: '1' intvolume: ' 83' language: - iso: eng license: https://creativecommons.org/licenses/by/3.0/ month: '11' oa: 1 oa_version: Published Version project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Leibniz International Proceedings in Informatics publication_identifier: isbn: - 978-395977046-0 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '7262' pubrep_id: '923' quality_controlled: '1' scopus_import: '1' status: public title: Faster algorithms for mean-payoff parity games tmp: 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) short: CC BY (3.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 83 year: '2017' ... --- _id: '553' 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. ' alternative_title: - LIPIcs article_number: '55' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Kristofer full_name: Hansen, Kristofer last_name: Hansen - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 citation: 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' 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' 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. 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. 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.' 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. short: K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. conference: end_date: 2017-08-25 location: Aalborg, Denmark name: 'MFCS: Mathematical Foundations of Computer Science (SG)' start_date: 2017-08-21 date_created: 2018-12-11T11:47:08Z date_published: 2017-11-01T00:00:00Z date_updated: 2021-01-12T08:02:35Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.4230/LIPIcs.MFCS.2017.55 file: - access_level: open_access checksum: 7101facb56ade363205c695d72dbd173 content_type: application/pdf creator: system date_created: 2018-12-12T10:09:29Z date_updated: 2020-07-14T12:47:00Z file_id: '4753' file_name: IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf file_size: 549967 relation: main_file file_date_updated: 2020-07-14T12:47:00Z has_accepted_license: '1' intvolume: ' 83' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1506.02434 month: '11' oa: 1 oa_version: Published Version publication: Leibniz International Proceedings in Informatics publication_identifier: isbn: - 978-395977046-0 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '7261' pubrep_id: '922' quality_controlled: '1' scopus_import: 1 status: public title: Strategy complexity of concurrent safety games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 83 year: '2017' ... --- _id: '560' 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. article_number: '0104' author: - first_name: Mate full_name: Gerencser, Mate id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87 last_name: Gerencser - first_name: Arnulf full_name: Jentzen, Arnulf last_name: Jentzen - first_name: Diyora full_name: Salimova, Diyora last_name: Salimova citation: 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' 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' 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.' 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.' 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.' 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.' short: 'M. Gerencser, A. Jentzen, D. Salimova, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 473 (2017).' date_created: 2018-12-11T11:47:11Z date_published: 2017-11-01T00:00:00Z date_updated: 2021-01-12T08:03:04Z day: '01' department: - _id: JaMa doi: 10.1098/rspa.2017.0104 ec_funded: 1 intvolume: ' 473' issue: '2207' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1702.03229 month: '11' oa: 1 oa_version: Submitted Version project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: 'Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences' publication_identifier: issn: - '13645021' publication_status: published publisher: Royal Society of London publist_id: '7256' quality_controlled: '1' scopus_import: 1 status: public title: On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 473 year: '2017' ... --- _id: '567' 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" alternative_title: - Courant Lecture Notes article_processing_charge: No author: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Horng full_name: Yau, Horng last_name: Yau citation: 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 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. ieee: L. Erdös and H. Yau, A Dynamical Approach to Random Matrix Theory, vol. 28. American Mathematical Society, 2017. ista: Erdös L, Yau H. 2017. A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 226p. 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. short: L. Erdös, H. Yau, A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 2017. date_created: 2018-12-11T11:47:13Z date_published: 2017-01-01T00:00:00Z date_updated: 2022-05-24T06:57:28Z day: '01' department: - _id: LaEr doi: 10.1090/cln/028 ec_funded: 1 intvolume: ' 28' language: - iso: eng month: '01' oa_version: None page: '226' project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication_identifier: eisbn: - 978-1-4704-4194-4 isbn: - 9-781-4704-3648-3 publication_status: published publisher: American Mathematical Society publist_id: '7247' quality_controlled: '1' series_title: Courant Lecture Notes status: public title: A Dynamical Approach to Random Matrix Theory type: book user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 28 year: '2017' ... --- _id: '568' abstract: - lang: eng 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).' author: - first_name: Peter full_name: Franek, Peter id: 473294AE-F248-11E8-B48F-1D18A9856A87 last_name: Franek - first_name: Marek full_name: Krcál, Marek id: 33E21118-F248-11E8-B48F-1D18A9856A87 last_name: Krcál citation: 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 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 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. 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. ista: Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 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. short: P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342. date_created: 2018-12-11T11:47:14Z date_published: 2017-01-01T00:00:00Z date_updated: 2021-01-12T08:03:12Z day: '01' department: - _id: UlWa - _id: HeEd doi: 10.4310/HHA.2017.v19.n2.a16 ec_funded: 1 intvolume: ' 19' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1507.04310 month: '01' oa: 1 oa_version: Submitted Version page: 313 - 342 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 2590DB08-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '701309' name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020) publication: Homology, Homotopy and Applications publication_identifier: issn: - '15320073' publication_status: published publisher: International Press publist_id: '7246' quality_controlled: '1' scopus_import: 1 status: public title: Persistence of zero sets type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 19 year: '2017' ... --- _id: '570' abstract: - lang: eng 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. ' article_number: e28921 author: - first_name: Mato full_name: Lagator, Mato id: 345D25EC-F248-11E8-B48F-1D18A9856A87 last_name: Lagator - first_name: Srdjan full_name: Sarikas, Srdjan id: 35F0286E-F248-11E8-B48F-1D18A9856A87 last_name: Sarikas - first_name: Hande full_name: Acar, Hande id: 2DDF136A-F248-11E8-B48F-1D18A9856A87 last_name: Acar orcid: 0000-0003-1986-9753 - first_name: Jonathan P full_name: Bollback, Jonathan P id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87 last_name: Bollback orcid: 0000-0002-4624-4612 - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 citation: 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 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. ista: Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. 2017. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 6, e28921. 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. short: M. Lagator, S. Sarikas, H. Acar, J.P. Bollback, C.C. Guet, ELife 6 (2017). date_created: 2018-12-11T11:47:14Z date_published: 2017-11-13T00:00:00Z date_updated: 2021-01-12T08:03:15Z day: '13' ddc: - '576' department: - _id: CaGu - _id: JoBo - _id: NiBa doi: 10.7554/eLife.28921 ec_funded: 1 file: - access_level: open_access checksum: 273ab17f33305e4eaafd911ff88e7c5b content_type: application/pdf creator: system date_created: 2018-12-12T10:14:42Z date_updated: 2020-07-14T12:47:10Z file_id: '5096' file_name: IST-2017-918-v1+1_elife-28921-figures-v3.pdf file_size: 8453470 relation: main_file - access_level: open_access checksum: b433f90576c7be597cd43367946f8e7f content_type: application/pdf creator: system date_created: 2018-12-12T10:14:43Z date_updated: 2020-07-14T12:47:10Z file_id: '5097' file_name: IST-2017-918-v1+2_elife-28921-v3.pdf file_size: 1953221 relation: main_file file_date_updated: 2020-07-14T12:47:10Z has_accepted_license: '1' intvolume: ' 6' language: - iso: eng month: '11' oa: 1 oa_version: Published Version project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 2578D616-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '648440' name: Selective Barriers to Horizontal Gene Transfer publication: eLife publication_identifier: issn: - 2050084X publication_status: published publisher: eLife Sciences Publications publist_id: '7244' pubrep_id: '918' quality_controlled: '1' scopus_import: 1 status: public title: Regulatory network structure determines patterns of intermolecular epistasis tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2017' ... --- _id: '569' 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. article_number: e30867 author: - first_name: Felix full_name: Spira, Felix last_name: Spira - first_name: Sara full_name: Cuylen Haering, Sara last_name: Cuylen Haering - first_name: Shalin full_name: Mehta, Shalin last_name: Mehta - first_name: Matthias full_name: Samwer, Matthias last_name: Samwer - first_name: Anne full_name: Reversat, Anne id: 35B76592-F248-11E8-B48F-1D18A9856A87 last_name: Reversat orcid: 0000-0003-0666-8928 - first_name: Amitabh full_name: Verma, Amitabh last_name: Verma - first_name: Rudolf full_name: Oldenbourg, Rudolf last_name: Oldenbourg - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Daniel full_name: Gerlich, Daniel last_name: Gerlich 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 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. 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. 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. 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. short: F. Spira, S. Cuylen Haering, S. Mehta, M. Samwer, A. Reversat, A. Verma, R. Oldenbourg, M.K. Sixt, D. Gerlich, ELife 6 (2017). date_created: 2018-12-11T11:47:14Z date_published: 2017-11-06T00:00:00Z date_updated: 2023-02-23T12:30:29Z day: '06' ddc: - '570' department: - _id: MiSi doi: 10.7554/eLife.30867 file: - access_level: open_access checksum: ba09c1451153d39e4f4b7cee013e314c content_type: application/pdf creator: system date_created: 2018-12-12T10:10:40Z date_updated: 2020-07-14T12:47:10Z file_id: '4829' file_name: IST-2017-919-v1+1_elife-30867-figures-v1.pdf file_size: 9666973 relation: main_file - access_level: open_access checksum: 01eb51f1d6ad679947415a51c988e137 content_type: application/pdf creator: system date_created: 2018-12-12T10:10:41Z date_updated: 2020-07-14T12:47:10Z file_id: '4830' file_name: IST-2017-919-v1+2_elife-30867-v1.pdf file_size: 5951246 relation: main_file file_date_updated: 2020-07-14T12:47:10Z has_accepted_license: '1' intvolume: ' 6' language: - iso: eng month: '11' oa: 1 oa_version: Published Version publication: eLife publication_identifier: issn: - 2050084X publication_status: published publisher: eLife Sciences Publications publist_id: '7245' pubrep_id: '919' quality_controlled: '1' scopus_import: 1 status: public title: Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2017' ... --- _id: '571' 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. author: - first_name: Florian R full_name: Gärtner, Florian R id: 397A88EE-F248-11E8-B48F-1D18A9856A87 last_name: Gärtner orcid: 0000-0001-6120-3723 - first_name: Zerkah full_name: Ahmad, Zerkah last_name: Ahmad - first_name: Gerhild full_name: Rosenberger, Gerhild last_name: Rosenberger - 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 - first_name: Gökce full_name: Yavuz, Gökce last_name: Yavuz - first_name: Manja full_name: Luckner, Manja last_name: Luckner - first_name: Hellen full_name: Ishikawa Ankerhold, Hellen last_name: Ishikawa Ankerhold - first_name: Roman full_name: Hennel, Roman last_name: Hennel - first_name: Alexandre full_name: Benechet, Alexandre last_name: Benechet - first_name: Michael full_name: Lorenz, Michael last_name: Lorenz - first_name: Sue full_name: Chandraratne, Sue last_name: Chandraratne - first_name: Irene full_name: Schubert, Irene last_name: Schubert - first_name: Sebastian full_name: Helmer, Sebastian last_name: Helmer - first_name: Bianca full_name: Striednig, Bianca last_name: Striednig - first_name: Konstantin full_name: Stark, Konstantin last_name: Stark - 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 full_name: Verschoor, Admar last_name: Verschoor - first_name: Catherine full_name: Leon, Catherine last_name: Leon - first_name: Christian full_name: Gachet, Christian last_name: Gachet - first_name: Thomas full_name: Gudermann, Thomas last_name: Gudermann - first_name: Michael full_name: Mederos Y Schnitzler, Michael last_name: Mederos Y Schnitzler - first_name: Zachary full_name: Pincus, Zachary last_name: Pincus - first_name: Matteo full_name: Iannacone, Matteo last_name: Iannacone - first_name: Rainer full_name: Haas, Rainer last_name: Haas - first_name: Gerhard full_name: Wanner, Gerhard last_name: Wanner - first_name: Kirsten full_name: Lauber, Kirsten last_name: Lauber - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Steffen full_name: Massberg, Steffen last_name: Massberg citation: 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 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 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. 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. 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. 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. 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. date_created: 2018-12-11T11:47:15Z date_published: 2017-11-30T00:00:00Z date_updated: 2021-01-12T08:03:15Z day: '30' department: - _id: MiSi doi: 10.1016/j.cell.2017.11.001 ec_funded: 1 intvolume: ' 171' issue: '6' language: - iso: eng month: '11' oa_version: None page: 1368 - 1382 project: - _id: 260AA4E2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '747687' name: Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells publication: Cell Press publication_identifier: issn: - '00928674' publication_status: published publisher: Cell Press publist_id: '7243' quality_controlled: '1' scopus_import: 1 status: public title: Migrating platelets are mechano scavengers that collect and bundle bacteria type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 171 year: '2017' ... --- _id: '572' abstract: - lang: eng 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. article_number: '2587' article_processing_charge: No author: - first_name: Damilola full_name: Olatunji, Damilola last_name: Olatunji - first_name: Danny full_name: Geelen, Danny last_name: Geelen - first_name: Inge full_name: Verstraeten, Inge id: 362BF7FE-F248-11E8-B48F-1D18A9856A87 last_name: Verstraeten orcid: 0000-0001-7241-2328 citation: 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 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 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. 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. 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. 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. short: D. Olatunji, D. Geelen, I. Verstraeten, International Journal of Molecular Sciences 18 (2017). date_created: 2018-12-11T11:47:15Z date_published: 2017-12-01T00:00:00Z date_updated: 2021-01-12T08:03:16Z day: '01' ddc: - '580' department: - _id: JiFr doi: 10.3390/ijms18122587 file: - access_level: open_access checksum: 82d51f11e493f7eec02976d9a9a9805e content_type: application/pdf creator: system date_created: 2018-12-12T10:08:55Z date_updated: 2020-07-14T12:47:10Z file_id: '4718' file_name: IST-2017-917-v1+1_ijms-18-02587.pdf file_size: 920962 relation: main_file file_date_updated: 2020-07-14T12:47:10Z has_accepted_license: '1' intvolume: ' 18' issue: '12' language: - iso: eng month: '12' oa: 1 oa_version: Published Version publication: International Journal of Molecular Sciences publication_status: published publisher: MDPI publist_id: '7242' pubrep_id: '917' quality_controlled: '1' scopus_import: '1' status: public title: Control of endogenous auxin levels in plant root development tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 18 year: '2017' ... --- _id: '313' 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.' alternative_title: - 'Journal of Physics: Conference Series' article_number: '012004' author: - first_name: Nicolas full_name: Camus, Nicolas last_name: Camus - first_name: Enderalp full_name: Yakaboylu, Enderalp id: 38CB71F6-F248-11E8-B48F-1D18A9856A87 last_name: Yakaboylu orcid: 0000-0001-5973-0874 - first_name: Lutz full_name: Fechner, Lutz last_name: Fechner - 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 - first_name: Karen full_name: Hatsagortsyan, Karen last_name: Hatsagortsyan - first_name: Thomas full_name: Pfeifer, Thomas last_name: Pfeifer - first_name: Cristoph full_name: Keitel, Cristoph last_name: Keitel - first_name: Robert full_name: Moshammer, Robert last_name: Moshammer citation: 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' 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' 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. 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. 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.' 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. 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. conference: end_date: 2017-08-21 location: Kazan, Russian Federation name: Annual International Laser Physics Workshop LPHYS start_date: 2017-08-17 date_created: 2018-12-11T11:45:46Z date_published: 2017-07-14T00:00:00Z date_updated: 2023-02-23T12:36:07Z day: '14' ddc: - '530' department: - _id: MiLe doi: 10.1088/1742-6596/999/1/012004 external_id: arxiv: - '1611.03701' file: - access_level: open_access checksum: 6e70b525a84f6d5fb175c48e9f5cb59a content_type: application/pdf creator: dernst date_created: 2019-01-22T08:34:10Z date_updated: 2020-07-14T12:46:00Z file_id: '5871' file_name: 2017_Physics_Camus.pdf file_size: 949321 relation: main_file file_date_updated: 2020-07-14T12:46:00Z has_accepted_license: '1' intvolume: ' 999' issue: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication_identifier: issn: - '17426588' publication_status: published publisher: American Physical Society publist_id: '7552' quality_controlled: '1' related_material: record: - id: '6013' relation: later_version status: public scopus_import: 1 status: public title: Experimental evidence for Wigner's tunneling time tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 999 year: '2017' ... --- _id: '6013' 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.” article_number: '023201' author: - first_name: Nicolas full_name: Camus, Nicolas last_name: Camus - first_name: Enderalp full_name: Yakaboylu, Enderalp id: 38CB71F6-F248-11E8-B48F-1D18A9856A87 last_name: Yakaboylu orcid: 0000-0001-5973-0874 - first_name: Lutz full_name: Fechner, Lutz last_name: Fechner - 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 - first_name: Karen Z. full_name: Hatsagortsyan, Karen Z. last_name: Hatsagortsyan - first_name: Thomas full_name: Pfeifer, Thomas last_name: Pfeifer - first_name: Christoph H. full_name: Keitel, Christoph H. last_name: Keitel - first_name: Robert full_name: Moshammer, Robert last_name: Moshammer citation: 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 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. ieee: N. Camus et al., “Experimental evidence for quantum tunneling time,” Physical Review Letters, vol. 119, no. 2. American Physical Society, 2017. 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. 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. 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). date_created: 2019-02-14T15:24:13Z date_published: 2017-07-14T00:00:00Z date_updated: 2023-02-23T11:13:36Z day: '14' department: - _id: MiLe doi: 10.1103/PhysRevLett.119.023201 external_id: arxiv: - '1611.03701' intvolume: ' 119' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1611.03701 month: '07' oa: 1 oa_version: Preprint publication: Physical Review Letters publication_identifier: eissn: - 1079-7114 issn: - 0031-9007 publication_status: published publisher: American Physical Society quality_controlled: '1' related_material: record: - id: '313' relation: earlier_version status: public scopus_import: 1 status: public title: Experimental evidence for quantum tunneling time type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 119 year: '2017' ... --- _id: '605' abstract: - lang: eng 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.' alternative_title: - LNCS author: - first_name: Joshua full_name: Brody, Joshua last_name: Brody - first_name: Stefan full_name: Dziembowski, Stefan last_name: Dziembowski - first_name: Sebastian full_name: Faust, Sebastian last_name: Faust - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: 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' 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. 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.' 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.' 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. short: J. Brody, S. Dziembowski, S. Faust, K.Z. Pietrzak, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 56–81. conference: end_date: 2017-11-15 location: Baltimore, MD, United States name: 'TCC: Theory of Cryptography Conference' start_date: 2017-11-12 date_created: 2018-12-11T11:47:27Z date_published: 2017-11-05T00:00:00Z date_updated: 2021-01-12T08:05:53Z day: '05' department: - _id: KrPi doi: 10.1007/978-3-319-70500-2_3 ec_funded: 1 editor: - first_name: Yael full_name: Kalai, Yael last_name: Kalai - first_name: Leonid full_name: Reyzin, Leonid last_name: Reyzin intvolume: ' 10677' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2016/536 month: '11' oa: 1 oa_version: Submitted Version page: 56 - 81 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication_identifier: isbn: - 978-331970499-9 publication_status: published publisher: Springer publist_id: '7200' quality_controlled: '1' scopus_import: 1 status: public title: Position based cryptography and multiparty communication complexity type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 10677 year: '2017' ... --- _id: '604' 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. alternative_title: - Theoretical and Computational Chemistry Series author: - first_name: Mikhail full_name: Lemeshko, Mikhail id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 - first_name: Richard full_name: Schmidt, Richard last_name: Schmidt citation: 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' 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.' 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.' 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.' 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.' 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.' date_created: 2018-12-11T11:47:27Z date_published: 2017-12-14T00:00:00Z date_updated: 2021-01-12T08:05:50Z day: '14' department: - _id: MiLe doi: 10.1039/9781782626800-00444 editor: - first_name: Oliver full_name: Dulieu, Oliver last_name: Dulieu - first_name: Andreas full_name: Osterwalder, Andreas last_name: Osterwalder intvolume: ' 11' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1703.06753 month: '12' oa: 1 oa_version: Submitted Version page: 444 - 495 publication: 'Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero ' publication_identifier: issn: - '20413181' publication_status: published publisher: The Royal Society of Chemistry publist_id: '7201' quality_controlled: '1' scopus_import: 1 series_title: Theoretical and Computational Chemistry Series status: public title: 'Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets' type: book_chapter user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2017' ... --- _id: '609' 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. alternative_title: - LNCS author: - first_name: Joel F full_name: Alwen, Joel F id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87 last_name: Alwen - first_name: Björn full_name: Tackmann, Björn last_name: Tackmann citation: 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' 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.' 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.' ista: 'Alwen JF, Tackmann B. 2017. Moderately hard functions: Definition, instantiations, and applications. TCC: Theory of Cryptography, LNCS, vol. 10677, 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.' short: J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526. conference: end_date: 2017-11-15 location: Baltimore, MD, United States name: 'TCC: Theory of Cryptography' start_date: 2017-11-12 date_created: 2018-12-11T11:47:28Z date_published: 2017-11-05T00:00:00Z date_updated: 2021-01-12T08:06:04Z day: '05' department: - _id: KrPi doi: 10.1007/978-3-319-70500-2_17 editor: - first_name: Yael full_name: Kalai, Yael last_name: Kalai - first_name: Leonid full_name: Reyzin, Leonid last_name: Reyzin intvolume: ' 10677' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2017/945 month: '11' oa: 1 oa_version: Submitted Version page: 493 - 526 publication_identifier: isbn: - 978-331970499-9 publication_status: published publisher: Springer publist_id: '7196' quality_controlled: '1' scopus_import: 1 status: public title: 'Moderately hard functions: Definition, instantiations, and applications' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 10677 year: '2017' ... --- _id: '610' abstract: - lang: eng 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.' 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). author: - first_name: Xavier full_name: Goaoc, Xavier last_name: Goaoc - first_name: Isaac full_name: Mabillard, Isaac id: 32BF9DAA-F248-11E8-B48F-1D18A9856A87 last_name: Mabillard - first_name: Pavel full_name: Paták, Pavel last_name: Paták - first_name: Zuzana full_name: Patakova, Zuzana id: 48B57058-F248-11E8-B48F-1D18A9856A87 last_name: Patakova orcid: 0000-0002-3975-1683 - first_name: Martin full_name: Tancer, Martin id: 38AC689C-F248-11E8-B48F-1D18A9856A87 last_name: Tancer orcid: 0000-0002-1191-6714 - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: 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' 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' 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.' 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.' 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.' 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.' short: X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, Israel Journal of Mathematics 222 (2017) 841–866. date_created: 2018-12-11T11:47:29Z date_published: 2017-10-01T00:00:00Z date_updated: 2023-02-23T10:02:13Z day: '01' department: - _id: UlWa doi: 10.1007/s11856-017-1607-7 ec_funded: 1 intvolume: ' 222' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1610.09063 month: '10' oa: 1 oa_version: Preprint page: 841 - 866 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Israel Journal of Mathematics publication_status: published publisher: Springer publist_id: '7194' quality_controlled: '1' related_material: record: - id: '1511' relation: earlier_version status: public scopus_import: 1 status: public title: 'On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 222 year: '2017' ... --- _id: '611' abstract: - lang: eng 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. author: - first_name: Desmond full_name: Bradley, Desmond last_name: Bradley - first_name: Ping full_name: Xu, Ping last_name: Xu - first_name: Irina full_name: Mohorianu, Irina last_name: Mohorianu - first_name: Annabel full_name: Whibley, Annabel last_name: Whibley - first_name: David full_name: Field, David id: 419049E2-F248-11E8-B48F-1D18A9856A87 last_name: Field orcid: 0000-0002-4014-8478 - first_name: Hugo full_name: Tavares, Hugo last_name: Tavares - first_name: Matthew full_name: Couchman, Matthew last_name: Couchman - first_name: Lucy full_name: Copsey, Lucy last_name: Copsey - first_name: Rosemary full_name: Carpenter, Rosemary last_name: Carpenter - first_name: Miaomiao full_name: Li, Miaomiao last_name: Li - first_name: Qun full_name: Li, Qun last_name: Li - first_name: Yongbiao full_name: Xue, Yongbiao last_name: Xue - first_name: Tamas full_name: Dalmay, Tamas last_name: Dalmay - first_name: Enrico full_name: Coen, Enrico last_name: Coen citation: 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 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. 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. 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. 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. 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. date_created: 2018-12-11T11:47:29Z date_published: 2017-11-17T00:00:00Z date_updated: 2021-01-12T08:06:10Z day: '17' department: - _id: NiBa doi: 10.1126/science.aao3526 intvolume: ' 358' issue: '6365' language: - iso: eng month: '11' oa_version: None page: 925 - 928 publication: Science publication_identifier: issn: - '00368075' publication_status: published publisher: American Association for the Advancement of Science publist_id: '7193' quality_controlled: '1' scopus_import: 1 status: public title: Evolution of flower color pattern through selection on regulatory small RNAs type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 358 year: '2017' ... --- _id: '613' 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.' 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). article_number: '1535' article_processing_charge: Yes (in subscription journal) author: - first_name: Remy P full_name: Chait, Remy P id: 3464AE84-F248-11E8-B48F-1D18A9856A87 last_name: Chait orcid: 0000-0003-0876-3187 - first_name: Jakob full_name: Ruess, Jakob id: 4A245D00-F248-11E8-B48F-1D18A9856A87 last_name: Ruess orcid: 0000-0003-1615-3282 - first_name: Tobias full_name: Bergmiller, Tobias id: 2C471CFA-F248-11E8-B48F-1D18A9856A87 last_name: Bergmiller orcid: 0000-0001-5396-4346 - first_name: Gasper full_name: Tkacik, Gasper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkacik orcid: 0000-0002-6699-1455 - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 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 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. 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. 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. 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. short: R.P. Chait, J. Ruess, T. Bergmiller, G. Tkačik, C.C. Guet, Nature Communications 8 (2017). date_created: 2018-12-11T11:47:30Z date_published: 2017-12-01T00:00:00Z date_updated: 2021-01-12T08:06:15Z day: '01' ddc: - '576' - '579' department: - _id: CaGu - _id: GaTk doi: 10.1038/s41467-017-01683-1 ec_funded: 1 file: - access_level: open_access checksum: 44bb5d0229926c23a9955d9fe0f9723f content_type: application/pdf creator: system date_created: 2018-12-12T10:16:05Z date_updated: 2020-07-14T12:47:20Z file_id: '5190' file_name: IST-2017-911-v1+1_s41467-017-01683-1.pdf file_size: 1951699 relation: main_file file_date_updated: 2020-07-14T12:47:20Z has_accepted_license: '1' intvolume: ' 8' issue: '1' language: - iso: eng month: '12' oa: 1 oa_version: Published Version project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 254E9036-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P28844-B27 name: Biophysics of information processing in gene regulation publication: Nature Communications publication_identifier: issn: - '20411723' publication_status: published publisher: Nature Publishing Group publist_id: '7191' pubrep_id: '911' quality_controlled: '1' scopus_import: 1 status: public title: Shaping bacterial population behavior through computer interfaced control of individual cells tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2017' ... --- _id: '615' 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. author: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Kevin full_name: Schnelli, Kevin id: 434AD0AE-F248-11E8-B48F-1D18A9856A87 last_name: Schnelli orcid: 0000-0003-0954-3231 citation: 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 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. 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. 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. short: L. Erdös, K. Schnelli, Annales de l’institut Henri Poincare (B) Probability and Statistics 53 (2017) 1606–1656. date_created: 2018-12-11T11:47:30Z date_published: 2017-11-01T00:00:00Z date_updated: 2021-01-12T08:06:22Z day: '01' department: - _id: LaEr doi: 10.1214/16-AIHP765 ec_funded: 1 intvolume: ' 53' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1504.00650 month: '11' oa: 1 oa_version: Submitted Version page: 1606 - 1656 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Annales de l'institut Henri Poincare (B) Probability and Statistics publication_identifier: issn: - '02460203' publication_status: published publisher: Institute of Mathematical Statistics publist_id: '7189' quality_controlled: '1' scopus_import: 1 status: public title: Universality for random matrix flows with time dependent density type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 53 year: '2017' ... --- _id: '623' abstract: - lang: eng 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. alternative_title: - ADVSANAT author: - first_name: Elisa full_name: Hill Yardin, Elisa last_name: Hill Yardin - first_name: Sonja full_name: Mckeown, Sonja last_name: Mckeown - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 - first_name: Andreas full_name: Grabrucker, Andreas last_name: Grabrucker citation: 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 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. 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. 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.' 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. 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. date_created: 2018-12-11T11:47:33Z date_published: 2017-05-28T00:00:00Z date_updated: 2021-01-12T08:06:46Z day: '28' department: - _id: GaNo doi: 10.1007/978-3-319-52498-6_9 editor: - first_name: Michael full_name: Schmeisser, Michael last_name: Schmeisser - first_name: Tobias full_name: Boekers, Tobias last_name: Boekers intvolume: ' 224' language: - iso: eng month: '05' oa_version: None page: 159 - 187 publication: Translational Anatomy and Cell Biology of Autism Spectrum Disorder publication_identifier: isbn: - 978-3-319-52496-2 issn: - '03015556' publication_status: published publisher: Springer publist_id: '7177' quality_controlled: '1' scopus_import: 1 series_title: Advances in Anatomy Embryology and Cell Biology status: public title: Extracerebral dysfunction in animal models of autism spectrum disorder type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 224 year: '2017' ... --- _id: '626' 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.' author: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 - first_name: Alison full_name: Etheridge, Alison last_name: Etheridge - first_name: Amandine full_name: Véber, Amandine last_name: Véber 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' 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.' 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.' ista: 'Barton NH, Etheridge A, Véber A. 2017. The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. 118, 50–73.' 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.' short: N.H. Barton, A. Etheridge, A. Véber, Theoretical Population Biology 118 (2017) 50–73. date_created: 2018-12-11T11:47:34Z date_published: 2017-12-01T00:00:00Z date_updated: 2021-01-12T08:06:50Z day: '01' ddc: - '576' department: - _id: NiBa doi: 10.1016/j.tpb.2017.06.001 ec_funded: 1 file: - access_level: open_access checksum: 7dd02bfcfe8f244f4a6c19091aedf2c8 content_type: application/pdf creator: system date_created: 2018-12-12T10:12:45Z date_updated: 2020-07-14T12:47:25Z file_id: '4964' file_name: IST-2017-908-v1+1_1-s2.0-S0040580917300886-main_1_.pdf file_size: 1133924 relation: main_file file_date_updated: 2020-07-14T12:47:25Z has_accepted_license: '1' intvolume: ' 118' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 50 - 73 project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: Theoretical Population Biology publication_identifier: issn: - '00405809' publication_status: published publisher: Academic Press publist_id: '7169' pubrep_id: '908' quality_controlled: '1' scopus_import: 1 status: public title: 'The infinitesimal model: Definition derivation and implications' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 118 year: '2017' ... --- _id: '625' 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. 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.' alternative_title: - LNCS article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Laurent full_name: Doyen, Laurent last_name: Doyen - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 citation: 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' 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 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. 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. 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. 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. date_created: 2018-12-11T11:47:34Z date_published: 2017-07-25T00:00:00Z date_updated: 2022-05-23T08:54:02Z day: '25' ddc: - '000' department: - _id: KrCh - _id: ToHe doi: 10.1007/978-3-319-63121-9_18 ec_funded: 1 editor: - first_name: Luca full_name: Aceto, Luca last_name: Aceto - first_name: Giorgio full_name: Bacci, Giorgio last_name: Bacci - first_name: Anna full_name: Ingólfsdóttir, Anna last_name: Ingólfsdóttir - first_name: Axel full_name: Legay, Axel last_name: Legay - first_name: Radu full_name: Mardare, Radu last_name: Mardare file: - access_level: open_access checksum: b2402766ec02c79801aac634bd8f9f6c content_type: application/pdf creator: dernst date_created: 2019-11-19T08:06:50Z date_updated: 2020-07-14T12:47:25Z file_id: '7048' file_name: 2017_ModelsAlgorithms_Chatterjee.pdf file_size: 192826 relation: main_file file_date_updated: 2020-07-14T12:47:25Z has_accepted_license: '1' intvolume: ' 10460' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 367 - 381 project: - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication: Models, Algorithms, Logics and Tools publication_identifier: isbn: - 978-3-319-63120-2 issn: - 0302-9743 publication_status: published publisher: Springer publist_id: '7170' quality_controlled: '1' scopus_import: '1' series_title: Theoretical Computer Science and General Issues status: public title: The cost of exactness in quantitative reachability type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10460 year: '2017' ... --- _id: '624' abstract: - lang: eng 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. acknowledgement: 'Austrian Science Fund (FWF): M1697, P22249; Swiss National Science Foundation (SNF): 145706; European Commission;FWF Special Research Program: RNA-REG F43' article_number: '3830' author: - first_name: Nela full_name: Nikolic, Nela id: 42D9CABC-F248-11E8-B48F-1D18A9856A87 last_name: Nikolic orcid: 0000-0001-9068-6090 - first_name: Zrinka full_name: Didara, Zrinka last_name: Didara - first_name: Isabella full_name: Moll, Isabella last_name: Moll citation: 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 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. 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. 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. 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. short: N. Nikolic, Z. Didara, I. Moll, PeerJ 2017 (2017). date_created: 2018-12-11T11:47:33Z date_published: 2017-09-21T00:00:00Z date_updated: 2021-01-12T08:06:48Z day: '21' ddc: - '579' department: - _id: CaGu doi: 10.7717/peerj.3830 file: - access_level: open_access checksum: 3d79ae6b6eabc90b0eaaed82ff3493b0 content_type: application/pdf creator: system date_created: 2018-12-12T10:11:51Z date_updated: 2020-07-14T12:47:24Z file_id: '4908' file_name: IST-2017-909-v1+1_peerj-3830.pdf file_size: 682064 relation: main_file file_date_updated: 2020-07-14T12:47:24Z has_accepted_license: '1' intvolume: ' 2017' issue: '9' language: - iso: eng month: '09' oa: 1 oa_version: Published Version publication: PeerJ publication_identifier: issn: - '21678359' publication_status: published publisher: PeerJ publist_id: '7172' pubrep_id: '909' quality_controlled: '1' scopus_import: 1 status: public title: MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2017 year: '2017' ...