[{"_id":"9844","year":"2017","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","department":[{"_id":"CaGu"}],"publisher":"Public Library of Science","title":"Source data for figures and tables","status":"public","related_material":{"record":[{"id":"541","status":"public","relation":"used_in_publication"}]},"author":[{"orcid":"0000-0001-9068-6090","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87","last_name":"Nikolic","first_name":"Nela","full_name":"Nikolic, Nela"},{"last_name":"Schreiber","first_name":"Frank","full_name":"Schreiber, Frank"},{"full_name":"Dal Co, Alma","first_name":"Alma","last_name":"Dal Co"},{"full_name":"Kiviet, Daniel","first_name":"Daniel","last_name":"Kiviet"},{"last_name":"Bergmiller","first_name":"Tobias","orcid":"0000-0001-5396-4346","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","full_name":"Bergmiller, Tobias"},{"last_name":"Littmann","first_name":"Sten","full_name":"Littmann, Sten"},{"first_name":"Marcel","last_name":"Kuypers","full_name":"Kuypers, Marcel"},{"first_name":"Martin","last_name":"Ackermann","full_name":"Ackermann, Martin"}],"oa_version":"Published Version","date_created":"2021-08-09T13:27:16Z","date_updated":"2023-02-23T12:25:04Z","type":"research_data_reference","citation":{"mla":"Nikolic, Nela, et al. Source Data for Figures and Tables. Public Library of Science, 2017, doi:10.1371/journal.pgen.1007122.s018.","short":"N. Nikolic, F. Schreiber, A. Dal Co, D. Kiviet, T. Bergmiller, S. Littmann, M. Kuypers, M. Ackermann, (2017).","chicago":"Nikolic, Nela, Frank Schreiber, Alma Dal Co, Daniel Kiviet, Tobias Bergmiller, Sten Littmann, Marcel Kuypers, and Martin Ackermann. “Source Data for Figures and Tables.” Public Library of Science, 2017. https://doi.org/10.1371/journal.pgen.1007122.s018.","ama":"Nikolic N, Schreiber F, Dal Co A, et al. Source data for figures and tables. 2017. doi:10.1371/journal.pgen.1007122.s018","ista":"Nikolic N, Schreiber F, Dal Co A, Kiviet D, Bergmiller T, Littmann S, Kuypers M, Ackermann M. 2017. Source data for figures and tables, Public Library of Science, 10.1371/journal.pgen.1007122.s018.","apa":"Nikolic, N., Schreiber, F., Dal Co, A., Kiviet, D., Bergmiller, T., Littmann, S., … Ackermann, M. (2017). Source data for figures and tables. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007122.s018","ieee":"N. Nikolic et al., “Source data for figures and tables.” Public Library of Science, 2017."},"date_published":"2017-12-18T00:00:00Z","doi":"10.1371/journal.pgen.1007122.s018","article_processing_charge":"No","day":"18","month":"12"},{"conference":{"end_date":"2017-03-03","location":"Grundlsee, Austria","start_date":"2017-03-01","name":"AHPC: Austrian HPC Meeting"},"date_published":"2017-03-03T00:00:00Z","language":[{"iso":"eng"}],"publication":"AHPC17 – Austrian HPC Meeting 2017","citation":{"ama":"Schlögl A, Kiss J. Scientific Computing at IST Austria. In: AHPC17 – Austrian HPC Meeting 2017. FSP Scientific Computing; 2017:28.","ieee":"A. Schlögl and J. Kiss, “Scientific Computing at IST Austria,” in AHPC17 – Austrian HPC Meeting 2017, Grundlsee, Austria, 2017, p. 28.","apa":"Schlögl, A., & Kiss, J. (2017). Scientific Computing at IST Austria. In AHPC17 – Austrian HPC Meeting 2017 (p. 28). Grundlsee, Austria: FSP Scientific Computing.","ista":"Schlögl A, Kiss J. 2017. Scientific Computing at IST Austria. AHPC17 – Austrian HPC Meeting 2017. AHPC: Austrian HPC Meeting, 28.","short":"A. Schlögl, J. Kiss, in:, AHPC17 – Austrian HPC Meeting 2017, FSP Scientific Computing, 2017, p. 28.","mla":"Schlögl, Alois, and Janos Kiss. “Scientific Computing at IST Austria.” AHPC17 – Austrian HPC Meeting 2017, FSP Scientific Computing, 2017, p. 28.","chicago":"Schlögl, Alois, and Janos Kiss. “Scientific Computing at IST Austria.” In AHPC17 – Austrian HPC Meeting 2017, 28. FSP Scientific Computing, 2017."},"oa":1,"main_file_link":[{"open_access":"1","url":"https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ahpc17/BOOKLET_AHPC17.pdf"}],"page":"28","month":"03","day":"03","has_accepted_license":"1","article_processing_charge":"No","author":[{"full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","first_name":"Alois"},{"last_name":"Kiss","first_name":"Janos","id":"3D3A06F8-F248-11E8-B48F-1D18A9856A87","full_name":"Kiss, Janos"}],"date_created":"2023-05-05T12:58:53Z","date_updated":"2023-05-16T07:22:23Z","file":[{"creator":"dernst","content_type":"application/pdf","file_size":1005486,"file_name":"2017_AHPC_Schloegl.pdf","access_level":"open_access","date_created":"2023-05-16T07:20:50Z","date_updated":"2023-05-16T07:20:50Z","success":1,"checksum":"7bcc499479d4f4c5ce6c0071c24ca6c6","file_id":"12969","relation":"main_file"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12905","year":"2017","status":"public","ddc":["000"],"publication_status":"published","title":"Scientific Computing at IST Austria","department":[{"_id":"ScienComp"}],"publisher":"FSP Scientific Computing","file_date_updated":"2023-05-16T07:20:50Z","type":"conference_abstract"},{"language":[{"iso":"eng"}],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Uppsala, Sweden","start_date":"2017-04-22","end_date":"2017-04-29"},"doi":"10.1007/978-3-662-54577-5_26","quality_controlled":"1","external_id":{"arxiv":["1701.05738"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1701.05738"}],"month":"03","publication_identifier":{"isbn":["9783662545768"],"eissn":["1611-3349"],"eisbn":["9783662545775"],"issn":["0302-9743"]},"date_updated":"2023-06-21T13:29:46Z","date_created":"2023-06-21T13:21:14Z","volume":10205,"author":[{"full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias"},{"first_name":"Clara","last_name":"Waldmann","full_name":"Waldmann, Clara"},{"full_name":"Weininger, Maximilian","last_name":"Weininger","first_name":"Maximilian"}],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Springer","acknowledgement":"This work is partially funded by the DFG project “Verified Model Checkers” and by the Czech Science Foundation, grant No. P202/12/G061.","year":"2017","date_published":"2017-03-31T00:00:00Z","page":"443-460","publication":"Tools and Algorithms for the Construction and Analysis of Systems","citation":{"ista":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2017. Index appearance record for transforming Rabin automata into parity automata. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10205, 443–460.","ieee":"J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record for transforming Rabin automata into parity automata,” in Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 443–460.","apa":"Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2017). Index appearance record for transforming Rabin automata into parity automata. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 10205, pp. 443–460). Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_26","ama":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record for transforming Rabin automata into parity automata. In: Tools and Algorithms for the Construction and Analysis of Systems. Vol 10205. Springer; 2017:443-460. doi:10.1007/978-3-662-54577-5_26","chicago":"Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.” In Tools and Algorithms for the Construction and Analysis of Systems, 10205:443–60. Springer, 2017. https://doi.org/10.1007/978-3-662-54577-5_26.","mla":"Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.” Tools and Algorithms for the Construction and Analysis of Systems, vol. 10205, Springer, 2017, pp. 443–60, doi:10.1007/978-3-662-54577-5_26.","short":"J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, in:, Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2017, pp. 443–460."},"day":"31","article_processing_charge":"No","oa_version":"Preprint","status":"public","title":"Index appearance record for transforming Rabin automata into parity automata","intvolume":" 10205","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13160","abstract":[{"text":"Transforming deterministic ω\r\n-automata into deterministic parity automata is traditionally done using variants of appearance records. We present a more efficient variant of this approach, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and find out that our method produces smaller automata than previous approaches. Moreover, the experiments demonstrate the potential of our method for LTL synthesis, using LTL-to-Rabin translators. It leads to significantly smaller parity automata when compared to state-of-the-art approaches on complex formulae.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference"},{"quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1705.01433"]},"language":[{"iso":"eng"}],"conference":{"start_date":"2017-09-05","location":"Berlin, Germany","end_date":"2017-09-07","name":"CONCUR: Concurrency Theory"},"doi":"10.4230/LIPIcs.CONCUR.2017.21","month":"09","publication_identifier":{"issn":["1868-8969"]},"publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2017","date_created":"2018-12-11T11:49:22Z","date_updated":"2023-08-29T07:02:13Z","volume":85,"author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","first_name":"Ventsislav K","last_name":"Chonev","full_name":"Chonev, Ventsislav K"}],"related_material":{"record":[{"id":"6752","status":"public","relation":"later_version"}]},"article_number":"17","license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2020-07-14T12:48:16Z","publist_id":"6466","citation":{"chicago":"Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration Bidding Games,” Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21.","short":"G. Avni, T.A. Henzinger, V.K. Chonev, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.21.","apa":"Avni, G., Henzinger, T. A., & Chonev, V. K. (2017). Infinite-duration bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21","ieee":"G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85.","ista":"Avni G, Henzinger TA, Chonev VK. 2017. Infinite-duration bidding games. CONCUR: Concurrency Theory, LIPIcs, vol. 85, 17.","ama":"Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.CONCUR.2017.21"},"date_published":"2017-09-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","title":"Infinite-duration bidding games","status":"public","ddc":["000"],"intvolume":" 85","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"950","file":[{"creator":"system","file_size":335170,"content_type":"application/pdf","file_name":"IST-2017-844-v1+1_concur-cr.pdf","access_level":"open_access","date_created":"2018-12-12T10:18:00Z","date_updated":"2020-07-14T12:48:16Z","checksum":"6d5cccf755207b91ccbef95d8275b013","file_id":"5318","relation":"main_file"}],"oa_version":"Published Version","pubrep_id":"844","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"Two-player games on graphs are widely studied in formal methods as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common modes to determine how the players move the token through the graph; e.g., in turn-based games the players alternate turns in moving the token. We study the bidding mode of moving the token, which, to the best of our knowledge, has never been studied in infinite-duration games. Both players have separate budgets, which sum up to $1$. In each turn, a bidding takes place. Both players submit bids simultaneously, and a bid is legal if it does not exceed the available budget. The winner of the bidding pays his bid to the other player and moves the token. For reachability objectives, repeated bidding games have been studied and are called Richman games. There, a central question is the existence and computation of threshold budgets; namely, a value t\\in [0,1] such that if\\PO's budget exceeds $t$, he can win the game, and if\\PT's budget exceeds 1-t, he can win the game. We focus on parity games and mean-payoff games. We show the existence of threshold budgets in these games, and reduce the problem of finding them to Richman games. We also determine the strategy-complexity of an optimal strategy. Our most interesting result shows that memoryless strategies suffice for mean-payoff bidding games. \r\n"}]},{"intvolume":" 77","ddc":["514","516"],"title":"A proof of the orbit conjecture for flipping edge labelled triangulations","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"683","file":[{"content_type":"application/pdf","file_size":710007,"creator":"system","access_level":"open_access","file_name":"IST-2017-896-v1+1_LIPIcs-SoCG-2017-49.pdf","checksum":"24fdde981cc513352a78dcf9b0660ae9","date_updated":"2020-07-14T12:47:41Z","date_created":"2018-12-12T10:17:12Z","relation":"main_file","file_id":"5265"}],"oa_version":"Published Version","pubrep_id":"896","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"text":"Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation via a sequence of flips, but we characterize when this is possible. There is an obvious necessary condition: for each label l, if edge e has label l in the first triangulation and edge f has label l in the second triangulation, then there must be some sequence of flips that moves label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot formulated the Orbit Conjecture, which states that this necessary condition is also sufficient, i.e. that all labels can be simultaneously mapped to their destination if and only if each label individually can be mapped to its destination. We prove this conjecture. Furthermore, we give a polynomial-time algorithm to find a sequence of flips to reconfigure one labelled triangulation to another, if such a sequence exists, and we prove an upper bound of O(n7) on the length of the flip sequence. Our proof uses the topological result that the sets of pairwise non-crossing edges on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional ball (this follows from a result of Orden and Santos; we give a different proof based on a shelling argument). The dual cell complex of this simplicial ball, called the flip complex, has the usual flip graph as its 1-skeleton. We use properties of the 2-skeleton of the flip complex to prove the Orbit Conjecture.","lang":"eng"}],"citation":{"ama":"Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge labelled triangulations. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.SoCG.2017.49","ista":"Lubiw A, Masárová Z, Wagner U. 2017. A proof of the orbit conjecture for flipping edge labelled triangulations. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 77, 49.","apa":"Lubiw, A., Masárová, Z., & Wagner, U. (2017). A proof of the orbit conjecture for flipping edge labelled triangulations (Vol. 77). Presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2017.49","ieee":"A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for flipping edge labelled triangulations,” presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia, 2017, vol. 77.","mla":"Lubiw, Anna, et al. A Proof of the Orbit Conjecture for Flipping Edge Labelled Triangulations. Vol. 77, 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.SoCG.2017.49.","short":"A. Lubiw, Z. Masárová, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","chicago":"Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge Labelled Triangulations,” Vol. 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.SoCG.2017.49."},"date_published":"2017-06-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2017","volume":77,"date_created":"2018-12-11T11:47:54Z","date_updated":"2023-09-05T15:01:43Z","related_material":{"record":[{"id":"5986","relation":"later_version","status":"public"}]},"author":[{"last_name":"Lubiw","first_name":"Anna","full_name":"Lubiw, Anna"},{"full_name":"Masárová, Zuzana","first_name":"Zuzana","last_name":"Masárová","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6660-1322"},{"first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"article_number":"49","publist_id":"7033","file_date_updated":"2020-07-14T12:47:41Z","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SoCG.2017.49","conference":{"location":"Brisbane, Australia","start_date":"2017-07-04","end_date":"2017-07-07","name":"SoCG: Symposium on Computational Geometry"},"month":"06"},{"file_date_updated":"2020-07-14T12:44:34Z","publist_id":"6203","ec_funded":1,"acknowledgement":" First of all, I want to thank my advisor, prof. Thomas A. Henzinger, for his guidance during my PhD program. I am grateful for the freedom I was given to pursue my research interests, and his continuous support. Working with prof. Henzinger was a truly inspiring experience and taught me what it means to be a scientist. I want to express my gratitude to my collaborators: Nikola Beneš, Krishnendu Chatterjee, Martin Chmelík, Ashutosh Gupta, Willibald Krenn, Jan Kˇretínský, Dejan Nickovic, Andrey Kupriyanov, and Tatjana Petrov. I have learned a great deal from my collaborators, and without their help this thesis would not be possible. In addition, I want to thank the members of my thesis committee: Dirk Beyer, Dejan Nickovic, and Georg Weissenbacher for their advice and reviewing this dissertation. I would especially like to acknowledge the late Helmut Veith, who was a member of my committee. I will remember Helmut for his kindness, enthusiasm, and wit, as well as for being an inspiring scientist. Finally, I would like to thank my colleagues for making my stay at IST such a pleasant experience: Guy Avni, Sergiy Bogomolov, Ventsislav Chonev, Rasmus Ibsen-Jensen, Mirco Giacobbe, Bernhard Kragl, Hui Kong, Petr Novotný, Jan Otop, Andreas Pavlogiannis, Tantjana Petrov, Arjun Radhakrishna, Jakob Ruess, Thorsten Tarrach, as well as other members of groups Henzinger and Chatterjee. ","year":"2017","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Institute of Science and Technology Austria","author":[{"full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","first_name":"Przemyslaw"}],"related_material":{"record":[{"id":"1093","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"1230"},{"relation":"part_of_dissertation","status":"public","id":"1234"},{"id":"1391","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"1501"},{"relation":"part_of_dissertation","status":"public","id":"1502"},{"id":"2063","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"2167"}]},"date_created":"2018-12-11T11:50:27Z","date_updated":"2023-09-07T11:58:34Z","month":"01","publication_identifier":{"issn":["2663-337X"]},"oa":1,"project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"doi":"10.15479/AT:ISTA:TH_730","supervisor":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"This dissertation concerns the automatic verification of probabilistic systems and programs with arrays by statistical and logical methods. Although statistical and logical methods are different in nature, we show that they can be successfully combined for system analysis. In the first part of the dissertation we present a new statistical algorithm for the verification of probabilistic systems with respect to unbounded properties, including linear temporal logic. Our algorithm often performs faster than the previous approaches, and at the same time requires less information about the system. In addition, our method can be generalized to unbounded quantitative properties such as mean-payoff bounds. In the second part, we introduce two techniques for comparing probabilistic systems. Probabilistic systems are typically compared using the notion of equivalence, which requires the systems to have the equal probability of all behaviors. However, this notion is often too strict, since probabilities are typically only empirically estimated, and any imprecision may break the relation between processes. On the one hand, we propose to replace the Boolean notion of equivalence by a quantitative distance of similarity. For this purpose, we introduce a statistical framework for estimating distances between Markov chains based on their simulation runs, and we investigate which distances can be approximated in our framework. On the other hand, we propose to compare systems with respect to a new qualitative logic, which expresses that behaviors occur with probability one or a positive probability. This qualitative analysis is robust with respect to modeling errors and applicable to many domains. In the last part, we present a new quantifier-free logic for integer arrays, which allows us to express counting. Counting properties are prevalent in array-manipulating programs, however they cannot be expressed in the quantified fragments of the theory of arrays. We present a decision procedure for our logic, and provide several complexity results."}],"_id":"1155","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["004","005"],"title":"Statistical and logical methods for property checking","pubrep_id":"730","file":[{"file_name":"IST-2017-730-v1+1_Statistical_and_Logical_Methods_for_Property_Checking.pdf","access_level":"open_access","creator":"system","file_size":1028586,"content_type":"application/pdf","file_id":"4880","relation":"main_file","date_created":"2018-12-12T10:11:26Z","date_updated":"2020-07-14T12:44:34Z","checksum":"1406a681cb737508234fde34766be2c2"}],"oa_version":"Published Version","day":"02","article_processing_charge":"No","has_accepted_license":"1","citation":{"ista":"Daca P. 2017. Statistical and logical methods for property checking. Institute of Science and Technology Austria.","ieee":"P. Daca, “Statistical and logical methods for property checking,” Institute of Science and Technology Austria, 2017.","apa":"Daca, P. (2017). Statistical and logical methods for property checking. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_730","ama":"Daca P. Statistical and logical methods for property checking. 2017. doi:10.15479/AT:ISTA:TH_730","chicago":"Daca, Przemyslaw. “Statistical and Logical Methods for Property Checking.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:TH_730.","mla":"Daca, Przemyslaw. Statistical and Logical Methods for Property Checking. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:TH_730.","short":"P. Daca, Statistical and Logical Methods for Property Checking, Institute of Science and Technology Austria, 2017."},"page":"163","date_published":"2017-01-02T00:00:00Z"},{"has_accepted_license":"1","article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"]},"month":"02","day":"01","date_published":"2017-02-01T00:00:00Z","language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"last_name":"Bollback","first_name":"Jonathan P","orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","full_name":"Bollback, Jonathan P"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","full_name":"Barton, Nicholas H"}],"citation":{"chicago":"Payne, Pavel. “Bacterial Herd and Social Immunity to Phages.” Institute of Science and Technology Austria, 2017.","short":"P. Payne, Bacterial Herd and Social Immunity to Phages, Institute of Science and Technology Austria, 2017.","mla":"Payne, Pavel. Bacterial Herd and Social Immunity to Phages. Institute of Science and Technology Austria, 2017.","ieee":"P. Payne, “Bacterial herd and social immunity to phages,” Institute of Science and Technology Austria, 2017.","apa":"Payne, P. (2017). Bacterial herd and social immunity to phages. Institute of Science and Technology Austria.","ista":"Payne P. 2017. Bacterial herd and social immunity to phages. Institute of Science and Technology Austria.","ama":"Payne P. Bacterial herd and social immunity to phages. 2017."},"oa":1,"page":"83","file_date_updated":"2021-02-22T13:45:59Z","abstract":[{"text":"Bacteria and their pathogens – phages – are the most abundant living entities on Earth. Throughout their coevolution, bacteria have evolved multiple immune systems to overcome the ubiquitous threat from the phages. Although the molecu- lar details of these immune systems’ functions are relatively well understood, their epidemiological consequences for the phage-bacterial communities have been largely neglected. In this thesis we employed both experimental and theoretical methods to explore whether herd and social immunity may arise in bacterial popu- lations. Using our experimental system consisting of Escherichia coli strains with a CRISPR based immunity to the T7 phage we show that herd immunity arises in phage-bacterial communities and that it is accentuated when the populations are spatially structured. By fitting a mathematical model, we inferred expressions for the herd immunity threshold and the velocity of spread of a phage epidemic in partially resistant bacterial populations, which both depend on the bacterial growth rate, phage burst size and phage latent period. We also investigated the poten- tial for social immunity in Streptococcus thermophilus and its phage 2972 using a bioinformatic analysis of potentially coding short open reading frames with a signalling signature, encoded within the CRISPR associated genes. Subsequently, we tested one identified potentially signalling peptide and found that its addition to a phage-challenged culture increases probability of survival of bacteria two fold, although the results were only marginally significant. Together, these results demonstrate that the ubiquitous arms races between bacteria and phages have further consequences at the level of the population.","lang":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"author":[{"full_name":"Payne, Pavel","orcid":"0000-0002-2711-9453","id":"35F78294-F248-11E8-B48F-1D18A9856A87","last_name":"Payne","first_name":"Pavel"}],"oa_version":"Published Version","file":[{"access_level":"closed","file_name":"thesis_pavel_payne_final_w_signature_page.pdf","file_size":3025175,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"6292","checksum":"a0fc5c26a89c0ea759947ffba87d0d8f","date_updated":"2020-07-14T12:47:27Z","date_created":"2019-04-09T15:15:32Z"},{"date_created":"2021-02-22T13:45:59Z","date_updated":"2021-02-22T13:45:59Z","success":1,"checksum":"af531e921a7f64a9e0af4cd8783b2226","file_id":"9187","relation":"main_file","creator":"dernst","file_size":3111536,"content_type":"application/pdf","file_name":"2017_Payne_Thesis.pdf","access_level":"open_access"}],"date_created":"2019-04-09T15:16:45Z","date_updated":"2023-09-07T12:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6291","year":"2017","department":[{"_id":"NiBa"},{"_id":"JoBo"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","status":"public","title":"Bacterial herd and social immunity to phages","ddc":["570"]},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1098/rsbl.2017.0646"}],"external_id":{"pmid":["29237814"]},"oa":1,"project":[{"grant_number":"RGY0079/2011","_id":"251BCBEC-B435-11E9-9278-68D0E5697425","name":"Multi-Level Conflicts in Evolutionary Dynamics of Restriction-Modification Systems (HFSP Young investigators' grant)"},{"_id":"251D65D8-B435-11E9-9278-68D0E5697425","grant_number":"24210","name":"Effects of Stochasticity on the Function of Restriction-Modi cation Systems at the Single-Cell Level (DOC Fellowship)"}],"quality_controlled":"1","doi":"10.1098/rsbl.2017.0646","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1744-9561"]},"month":"12","pmid":1,"year":"2017","acknowledgement":"This work was funded by an HFSP Young Investigators' grant RGY0079/2011 (C.C.G.). M.P. is a recipient of a DOC Fellowship of the Austrian Academy of Science at the Institute of Science and Technology Austria.","publisher":"The Royal Society","department":[{"_id":"CaGu"}],"publication_status":"published","related_material":{"record":[{"id":"9847","status":"public","relation":"research_data"},{"relation":"dissertation_contains","status":"public","id":"202"}]},"author":[{"last_name":"Pleska","first_name":"Maros","orcid":"0000-0001-7460-7479","id":"4569785E-F248-11E8-B48F-1D18A9856A87","full_name":"Pleska, Maros"},{"full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","first_name":"Calin C","last_name":"Guet"}],"volume":13,"date_created":"2018-12-11T11:47:11Z","date_updated":"2023-09-07T11:59:32Z","article_number":"20170646","publist_id":"7253","citation":{"ama":"Pleska M, Guet CC. Effects of mutations in phage restriction sites during escape from restriction–modification. Biology Letters. 2017;13(12). doi:10.1098/rsbl.2017.0646","ista":"Pleska M, Guet CC. 2017. Effects of mutations in phage restriction sites during escape from restriction–modification. Biology Letters. 13(12), 20170646.","ieee":"M. Pleska and C. C. Guet, “Effects of mutations in phage restriction sites during escape from restriction–modification,” Biology Letters, vol. 13, no. 12. The Royal Society, 2017.","apa":"Pleska, M., & Guet, C. C. (2017). Effects of mutations in phage restriction sites during escape from restriction–modification. Biology Letters. The Royal Society. https://doi.org/10.1098/rsbl.2017.0646","mla":"Pleska, Maros, and Calin C. Guet. “Effects of Mutations in Phage Restriction Sites during Escape from Restriction–Modification.” Biology Letters, vol. 13, no. 12, 20170646, The Royal Society, 2017, doi:10.1098/rsbl.2017.0646.","short":"M. Pleska, C.C. Guet, Biology Letters 13 (2017).","chicago":"Pleska, Maros, and Calin C Guet. “Effects of Mutations in Phage Restriction Sites during Escape from Restriction–Modification.” Biology Letters. The Royal Society, 2017. https://doi.org/10.1098/rsbl.2017.0646."},"publication":"Biology Letters","article_type":"original","date_published":"2017-12-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"561","intvolume":" 13","status":"public","title":"Effects of mutations in phage restriction sites during escape from restriction–modification","oa_version":"Published Version","type":"journal_article","issue":"12","abstract":[{"lang":"eng","text":"Restriction–modification systems are widespread genetic elements that protect bacteria from bacteriophage infections by recognizing and cleaving heterologous DNA at short, well-defined sequences called restriction sites. Bioinformatic evidence shows that restriction sites are significantly underrepresented in bacteriophage genomes, presumably because bacteriophages with fewer restriction sites are more likely to escape cleavage by restriction–modification systems. However, how mutations in restriction sites affect the likelihood of bacteriophage escape is unknown. Using the bacteriophage l and the restriction–modification system EcoRI, we show that while mutation effects at different restriction sites are unequal, they are independent. As a result, the probability of bacteriophage escape increases with each mutated restriction site. Our results experimentally support the role of restriction site avoidance as a response to selection imposed by restriction–modification systems and offer an insight into the events underlying the process of bacteriophage escape."}]},{"date_created":"2018-12-11T11:48:40Z","date_updated":"2023-09-07T12:00:26Z","author":[{"id":"39B66846-F248-11E8-B48F-1D18A9856A87","last_name":"Mitosch","first_name":"Karin","full_name":"Mitosch, Karin"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"2001"},{"id":"666","status":"public","relation":"part_of_dissertation"}]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"ToBo"}],"year":"2017","acknowledgement":"First of all, I would like to express great gratitude to my PhD supervisor Tobias Bollenbach. Through his open and trusting attitude I had the freedom to explore different scientific directions during this project, and follow the research lines of my interest. I am thankful for constructive and often extensive discussions and his support and commitment during the different stages of my PhD. I want to thank my committee members, Călin Guet, Terry Hwa and Nassos Typas for their interest and their valuable input to this project. Special thanks to Nassos for career guidance, and for accepting me in his lab. A big thank you goes to the past, present and affiliated members of the Bollenbach group: Guillaume Chevereau, Marjon de Vos, Marta Lukačišinová, Veronika Bierbaum, Qi Qin, Marcin Zagórski, Martin Lukačišin, Andreas Angermayr, Bor Kavčič, Julia Tischler, Dilay Ayhan, Jaroslav Ferenc, and Georg Rieckh. I enjoyed working and discussing with you very much and I will miss our lengthy group meetings, our inspiring journal clubs, and our common lunches. Special thanks to Bor for great mental and professional support during the hard months of thesis writing, and to Marta for very creative times during the beginning of our PhDs. May the ‘Bacterial Survival Guide’ decorate the walls of IST forever! A great thanks to my friend and collaborator Georg Rieckh for his enthusiasm and for getting so involved in these projects, for his endurance and for his company throughout the years. Thanks to the FriSBi crowd at IST Austria for interesting meetings and discussions. In particular I want to thank Magdalena Steinrück, and Anna Andersson for inspiring exchange, and enjoyable time together. Thanks to everybody who contributed to the cover for Cell Systems: The constructive input from Tobias Bollenbach, Bor Kavčič, Georg Rieckh, Marta Lukačišinová, and Sebastian Nozzi, and the professional implementation by the graphic designer Martina Markus from the University of Cologne. Thanks to all my office mates in the first floor Bertalanffy building throughout the years: for ensuring a pleasant working atmosphere, and for your company! In general, I want to thank all the people that make IST such a great environment, with the many possibilities to shape our own social and research environment. I want to thank my family for all kind of practical support during the years, and my second family in Argentina for their enthusiasm. Thanks to my brother Bernhard and my sister Martina for being great siblings, and to Helena and Valentin for the joy you brought to my life. My deep gratitude goes to Sebastian Nozzi, for constant support, patience, love and for believing in me. ","file_date_updated":"2020-07-14T12:48:09Z","publist_id":"6831","supervisor":[{"orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","first_name":"Mark Tobias","full_name":"Bollenbach, Mark Tobias"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:th_862","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"09","publication_identifier":{"issn":["2663-337X"]},"file":[{"file_id":"6210","relation":"source_file","date_created":"2019-04-05T08:48:51Z","date_updated":"2020-07-14T12:48:09Z","checksum":"da3993c5f90f59a8e8623cc31ad501dd","file_name":"Thesis_KarinMitosch.docx","access_level":"closed","creator":"dernst","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":6331071},{"checksum":"24c3d9e51992f1b721f3df55aa13fcb8","date_created":"2019-04-05T08:48:51Z","date_updated":"2020-07-14T12:48:09Z","relation":"main_file","file_id":"6211","file_size":9289852,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"Thesis_KarinMitosch.pdf"}],"oa_version":"Published Version","pubrep_id":"862","ddc":["571","579"],"status":"public","title":"Timing, variability and cross-protection in bacteria – insights from dynamic gene expression responses to antibiotics","_id":"818","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"Antibiotics have diverse effects on bacteria, including massive changes in bacterial gene expression. Whereas the gene expression changes under many antibiotics have been measured, the temporal organization of these responses and their dependence on the bacterial growth rate are unclear. As described in Chapter 1, we quantified the temporal gene expression changes in the bacterium Escherichia coli in response to the sudden exposure to antibiotics using a fluorescent reporter library and a robotic system. Our data show temporally structured gene expression responses, with response times for individual genes ranging from tens of minutes to several hours. We observed that many stress response genes were activated in response to antibiotics. As certain stress responses cross-protect bacteria from other stressors, we then asked whether cellular responses to antibiotics have a similar protective role in Chapter 2. Indeed, we found that the trimethoprim-induced acid stress response protects bacteria from subsequent acid stress. We combined microfluidics with time-lapse imaging to monitor survival, intracellular pH, and acid stress response in single cells. This approach revealed that the variable expression of the acid resistance operon gadBC strongly correlates with single-cell survival time. Cells with higher gadBC expression following trimethoprim maintain higher intracellular pH and survive the acid stress longer. Overall, we provide a way to identify single-cell cross-protection between antibiotics and environmental stressors from temporal gene expression data, and show how antibiotics can increase bacterial fitness in changing environments. While gene expression changes to antibiotics show a clear temporal structure at the population-level, it is unclear whether this clear temporal order is followed by every single cell. Using dual-reporter strains described in Chapter 3, we measured gene expression dynamics of promoter pairs in the same cells using microfluidics and microscopy. Chapter 4 shows that the oxidative stress response and the DNA stress response showed little timing variability and a clear temporal order under the antibiotic nitrofurantoin. In contrast, the acid stress response under trimethoprim ran independently from all other activated response programs including the DNA stress response, which showed particularly high timing variability in this stress condition. In summary, this approach provides insight into the temporal organization of gene expression programs at the single-cell level and suggests dependencies between response programs and the underlying variability-introducing mechanisms. Altogether, this work advances our understanding of the diverse effects that antibiotics have on bacteria. These results were obtained by taking into account gene expression dynamics, which allowed us to identify general principles, molecular mechanisms, and dependencies between genes. Our findings may have implications for infectious disease treatments, and microbial communities in the human body and in nature. ","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","date_published":"2017-09-27T00:00:00Z","page":"113","citation":{"ama":"Mitosch K. Timing, variability and cross-protection in bacteria – insights from dynamic gene expression responses to antibiotics. 2017. doi:10.15479/AT:ISTA:th_862","ista":"Mitosch K. 2017. Timing, variability and cross-protection in bacteria – insights from dynamic gene expression responses to antibiotics. Institute of Science and Technology Austria.","apa":"Mitosch, K. (2017). Timing, variability and cross-protection in bacteria – insights from dynamic gene expression responses to antibiotics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_862","ieee":"K. Mitosch, “Timing, variability and cross-protection in bacteria – insights from dynamic gene expression responses to antibiotics,” Institute of Science and Technology Austria, 2017.","mla":"Mitosch, Karin. Timing, Variability and Cross-Protection in Bacteria – Insights from Dynamic Gene Expression Responses to Antibiotics. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_862.","short":"K. Mitosch, Timing, Variability and Cross-Protection in Bacteria – Insights from Dynamic Gene Expression Responses to Antibiotics, Institute of Science and Technology Austria, 2017.","chicago":"Mitosch, Karin. “Timing, Variability and Cross-Protection in Bacteria – Insights from Dynamic Gene Expression Responses to Antibiotics.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_862."},"day":"27","has_accepted_license":"1","article_processing_charge":"No"},{"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","file_date_updated":"2020-07-14T12:47:35Z","publist_id":"7061","ec_funded":1,"date_updated":"2023-09-07T12:00:25Z","date_created":"2018-12-11T11:47:48Z","volume":4,"author":[{"id":"39B66846-F248-11E8-B48F-1D18A9856A87","first_name":"Karin","last_name":"Mitosch","full_name":"Mitosch, Karin"},{"full_name":"Rieckh, Georg","first_name":"Georg","last_name":"Rieckh","id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bollenbach, Tobias","last_name":"Bollenbach","first_name":"Tobias","orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"818"}]},"publication_status":"published","publisher":"Cell Press","department":[{"_id":"ToBo"},{"_id":"GaTk"}],"year":"2017","month":"04","publication_identifier":{"issn":["24054712"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.cels.2017.03.001","quality_controlled":"1","project":[{"name":"Optimality principles in responses to antibiotics","call_identifier":"FP7","_id":"25E83C2C-B435-11E9-9278-68D0E5697425","grant_number":"303507"},{"call_identifier":"FWF","name":"Revealing the mechanisms underlying drug interactions","_id":"25E9AF9E-B435-11E9-9278-68D0E5697425","grant_number":"P27201-B22"},{"_id":"25EB3A80-B435-11E9-9278-68D0E5697425","grant_number":"RGP0042/2013","name":"Revealing the fundamental limits of cell growth"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"abstract":[{"text":"Antibiotics elicit drastic changes in microbial gene expression, including the induction of stress response genes. While certain stress responses are known to “cross-protect” bacteria from other stressors, it is unclear whether cellular responses to antibiotics have a similar protective role. By measuring the genome-wide transcriptional response dynamics of Escherichia coli to four antibiotics, we found that trimethoprim induces a rapid acid stress response that protects bacteria from subsequent exposure to acid. Combining microfluidics with time-lapse imaging to monitor survival and acid stress response in single cells revealed that the noisy expression of the acid resistance operon gadBC correlates with single-cell survival. Cells with higher gadBC expression following trimethoprim maintain higher intracellular pH and survive the acid stress longer. The seemingly random single-cell survival under acid stress can therefore be predicted from gadBC expression and rationalized in terms of GadB/C molecular function. Overall, we provide a roadmap for identifying the molecular mechanisms of single-cell cross-protection between antibiotics and other stressors.","lang":"eng"}],"issue":"4","type":"journal_article","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5041","date_updated":"2020-07-14T12:47:35Z","date_created":"2018-12-12T10:13:54Z","checksum":"04ff20011c3d9a601c514aa999a5fe1a","file_name":"IST-2017-901-v1+1_1-s2.0-S2405471217300868-main.pdf","access_level":"open_access","file_size":2438660,"content_type":"application/pdf","creator":"system"}],"pubrep_id":"901","title":"Noisy response to antibiotic stress predicts subsequent single cell survival in an acidic environment","status":"public","ddc":["576","610"],"intvolume":" 4","_id":"666","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"26","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","scopus_import":1,"date_published":"2017-04-26T00:00:00Z","page":"393 - 403","publication":"Cell Systems","citation":{"mla":"Mitosch, Karin, et al. “Noisy Response to Antibiotic Stress Predicts Subsequent Single Cell Survival in an Acidic Environment.” Cell Systems, vol. 4, no. 4, Cell Press, 2017, pp. 393–403, doi:10.1016/j.cels.2017.03.001.","short":"K. Mitosch, G. Rieckh, M.T. Bollenbach, Cell Systems 4 (2017) 393–403.","chicago":"Mitosch, Karin, Georg Rieckh, and Mark Tobias Bollenbach. “Noisy Response to Antibiotic Stress Predicts Subsequent Single Cell Survival in an Acidic Environment.” Cell Systems. Cell Press, 2017. https://doi.org/10.1016/j.cels.2017.03.001.","ama":"Mitosch K, Rieckh G, Bollenbach MT. Noisy response to antibiotic stress predicts subsequent single cell survival in an acidic environment. Cell Systems. 2017;4(4):393-403. doi:10.1016/j.cels.2017.03.001","ista":"Mitosch K, Rieckh G, Bollenbach MT. 2017. Noisy response to antibiotic stress predicts subsequent single cell survival in an acidic environment. Cell Systems. 4(4), 393–403.","ieee":"K. Mitosch, G. Rieckh, and M. T. Bollenbach, “Noisy response to antibiotic stress predicts subsequent single cell survival in an acidic environment,” Cell Systems, vol. 4, no. 4. Cell Press, pp. 393–403, 2017.","apa":"Mitosch, K., Rieckh, G., & Bollenbach, M. T. (2017). Noisy response to antibiotic stress predicts subsequent single cell survival in an acidic environment. Cell Systems. Cell Press. https://doi.org/10.1016/j.cels.2017.03.001"}},{"month":"08","publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","supervisor":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:th_854","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"license":"https://creativecommons.org/licenses/by-nd/4.0/","file_date_updated":"2020-07-14T12:48:10Z","ec_funded":1,"publist_id":"6828","date_updated":"2023-09-07T12:01:59Z","date_created":"2018-12-11T11:48:41Z","author":[{"full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"1071"},{"id":"1437","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"1602"},{"status":"public","relation":"part_of_dissertation","id":"1604"},{"id":"1607","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"1714"}]},"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Institute of Science and Technology Austria","year":"2017","acknowledgement":"First, I am thankful to my advisor, Krishnendu Chatterjee, for offering me the opportunity to\r\nmaterialize my scientific curiosity in a remarkably wide range of interesting topics, as well as for his constant availability and continuous support throughout my doctoral studies. I have had the privilege of collaborating with, discussing and getting inspired by all members of my committee: Thomas A. Henzinger, Ulrich Schmid and Martin A. Nowak. The role of the above four people has been very instrumental both to the research carried out for this dissertation, and to the researcher I evolved to in the process.\r\nI have greatly enjoyed my numerous brainstorming sessions with Rasmus Ibsen-Jensen, many\r\nof which led to results on low-treewidth graphs presented here. I thank Alex Kößler for our\r\ndiscussions on modeling and analyzing real-time scheduling algorithms, Yaron Velner for our\r\ncollaboration on the Quantitative Interprocedural Analysis framework, and Nishant Sinha for our initial discussions on partial order reduction techniques in stateless model checking. I also thank Jan Otop, Ben Adlam, Bernhard Kragl and Josef Tkadlec for our fruitful collaborations on\r\ntopics outside the scope of this dissertation, as well as the interns Prateesh Goyal, Amir Kafshdar Goharshady, Samarth Mishra, Bhavya Choudhary and Marek Chalupa, with whom I have shared my excitement on various research topics. Together with my collaborators, I thank officemates and members of the Chatterjee and Henzinger groups throughout the years, Thorsten Tarrach, Ventsi Chonev, Roopsha Samanta, Przemek Daca, Mirco Giacobbe, Tanja Petrov, Ashutosh\r\nGupta, Arjun Radhakrishna, Petr Novontý, Christian Hilbe, Jakob Ruess, Martin Chmelik,\r\nCezara Dragoi, Johannes Reiter, Andrey Kupriyanov, Guy Avni, Sasha Rubin, Jessica Davies, Hongfei Fu, Thomas Ferrère, Pavol Cerný, Ali Sezgin, Jan Kretínský, Sergiy Bogomolov, Hui\r\nKong, Benjamin Aminof, Duc-Hiep Chu, and Damien Zufferey. Besides collaborations and office spaces, with many of the above people I have been fortunate to share numerous whiteboard\r\ndiscussions, as well as memorable long walks and amicable meals accompanied by stimulating\r\nconversations. I am highly indebted to Elisabeth Hacker for her continuous assistance in matters\r\nthat often exceeded her official duties, and who made my integration in Austria a smooth process.","day":"09","article_processing_charge":"No","has_accepted_license":"1","date_published":"2017-08-09T00:00:00Z","page":"418","citation":{"ama":"Pavlogiannis A. Algorithmic advances in program analysis and their applications. 2017. doi:10.15479/AT:ISTA:th_854","ista":"Pavlogiannis A. 2017. Algorithmic advances in program analysis and their applications. Institute of Science and Technology Austria.","ieee":"A. Pavlogiannis, “Algorithmic advances in program analysis and their applications,” Institute of Science and Technology Austria, 2017.","apa":"Pavlogiannis, A. (2017). Algorithmic advances in program analysis and their applications. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_854","mla":"Pavlogiannis, Andreas. Algorithmic Advances in Program Analysis and Their Applications. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_854.","short":"A. Pavlogiannis, Algorithmic Advances in Program Analysis and Their Applications, Institute of Science and Technology Austria, 2017.","chicago":"Pavlogiannis, Andreas. “Algorithmic Advances in Program Analysis and Their Applications.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_854."},"abstract":[{"lang":"eng","text":"This dissertation focuses on algorithmic aspects of program verification, and presents modeling and complexity advances on several problems related to the\r\nstatic analysis of programs, the stateless model checking of concurrent programs, and the competitive analysis of real-time scheduling algorithms.\r\nOur contributions can be broadly grouped into five categories.\r\n\r\nOur first contribution is a set of new algorithms and data structures for the quantitative and data-flow analysis of programs, based on the graph-theoretic notion of treewidth.\r\nIt has been observed that the control-flow graphs of typical programs have special structure, and are characterized as graphs of small treewidth.\r\nWe utilize this structural property to provide faster algorithms for the quantitative and data-flow analysis of recursive and concurrent programs.\r\nIn most cases we make an algebraic treatment of the considered problem,\r\nwhere several interesting analyses, such as the reachability, shortest path, and certain kind of data-flow analysis problems follow as special cases. \r\nWe exploit the constant-treewidth property to obtain algorithmic improvements for on-demand versions of the problems, \r\nand provide data structures with various tradeoffs between the resources spent in the preprocessing and querying phase.\r\nWe also improve on the algorithmic complexity of quantitative problems outside the algebraic path framework,\r\nnamely of the minimum mean-payoff, minimum ratio, and minimum initial credit for energy problems.\r\n\r\n\r\nOur second contribution is a set of algorithms for Dyck reachability with applications to data-dependence analysis and alias analysis.\r\nIn particular, we develop an optimal algorithm for Dyck reachability on bidirected graphs, which are ubiquitous in context-insensitive, field-sensitive points-to analysis.\r\nAdditionally, we develop an efficient algorithm for context-sensitive data-dependence analysis via Dyck reachability,\r\nwhere the task is to obtain analysis summaries of library code in the presence of callbacks.\r\nOur algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is (i)~linear in the number of call sites and (ii)~only logarithmic in the size of the whole library, as opposed to linear in the size of the whole library.\r\nFinally, we prove that Dyck reachability is Boolean Matrix Multiplication-hard in general, and the hardness also holds for graphs of constant treewidth.\r\nThis hardness result strongly indicates that there exist no combinatorial algorithms for Dyck reachability with truly subcubic complexity.\r\n\r\n\r\nOur third contribution is the formalization and algorithmic treatment of the Quantitative Interprocedural Analysis framework.\r\nIn this framework, the transitions of a recursive program are annotated as good, bad or neutral, and receive a weight which measures\r\nthe magnitude of their respective effect.\r\nThe Quantitative Interprocedural Analysis problem asks to determine whether there exists an infinite run of the program where the long-run ratio of the bad weights over the good weights is above a given threshold.\r\nWe illustrate how several quantitative problems related to static analysis of recursive programs can be instantiated in this framework,\r\nand present some case studies to this direction.\r\n\r\n\r\nOur fourth contribution is a new dynamic partial-order reduction for the stateless model checking of concurrent programs. Traditional approaches rely on the standard Mazurkiewicz equivalence between traces, by means of partitioning the trace space into equivalence classes, and attempting to explore a few representatives from each class.\r\nWe present a new dynamic partial-order reduction method called the Data-centric Partial Order Reduction (DC-DPOR).\r\nOur algorithm is based on a new equivalence between traces, called the observation equivalence.\r\nDC-DPOR explores a coarser partitioning of the trace space than any exploration method based on the standard Mazurkiewicz equivalence.\r\nDepending on the program, the new partitioning can be even exponentially coarser.\r\nAdditionally, DC-DPOR spends only polynomial time in each explored class.\r\n\r\n\r\nOur fifth contribution is the use of automata and game-theoretic verification techniques in the competitive analysis and synthesis of real-time scheduling algorithms for firm-deadline tasks.\r\nOn the analysis side, we leverage automata on infinite words to compute the competitive ratio of real-time schedulers subject to various environmental constraints.\r\nOn the synthesis side, we introduce a new instance of two-player mean-payoff partial-information games, and show\r\nhow the synthesis of an optimal real-time scheduler can be reduced to computing winning strategies in this new type of games."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","file":[{"file_name":"IST-2017-854-v1+1_Pavlogiannis_Thesis_PubRep.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":4103115,"file_id":"4900","relation":"main_file","date_created":"2018-12-12T10:11:44Z","date_updated":"2020-07-14T12:48:10Z","checksum":"3a3ec003f6ee73f41f82a544d63dfc77"},{"relation":"source_file","file_id":"6201","date_created":"2019-04-05T07:59:31Z","date_updated":"2020-07-14T12:48:10Z","checksum":"bd2facc45ff8a2e20c5ed313c2ccaa83","file_name":"2017_thesis_Pavlogiannis.zip","access_level":"closed","file_size":14744374,"content_type":"application/zip","creator":"dernst"}],"oa_version":"Published Version","pubrep_id":"854","ddc":["000"],"title":"Algorithmic advances in program analysis and their applications","status":"public","_id":"821","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"day":"25","article_processing_charge":"No","has_accepted_license":"1","date_published":"2017-08-25T00:00:00Z","citation":{"mla":"Jesse, Fabienne. The Lac Operon in the Wild. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_857.","short":"F. Jesse, The Lac Operon in the Wild, Institute of Science and Technology Austria, 2017.","chicago":"Jesse, Fabienne. “The Lac Operon in the Wild.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_857.","ama":"Jesse F. The lac operon in the wild. 2017. doi:10.15479/AT:ISTA:th_857","ista":"Jesse F. 2017. The lac operon in the wild. Institute of Science and Technology Austria.","ieee":"F. Jesse, “The lac operon in the wild,” Institute of Science and Technology Austria, 2017.","apa":"Jesse, F. (2017). The lac operon in the wild. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_857"},"page":"87","abstract":[{"lang":"eng","text":"The lac operon is a classic model system for bacterial gene regulation, and has been studied extensively in E. coli, a classic model organism. However, not much is known about E. coli’s ecology and life outside the laboratory, in particular in soil and water environments. The natural diversity of the lac operon outside the laboratory, its role in the ecology of E. coli and the selection pressures it is exposed to, are similarly unknown.\r\nIn Chapter Two of this thesis, I explore the genetic diversity, phylogenetic history and signatures of selection of the lac operon across 20 natural isolates of E. coli and divergent clades of Escherichia. I found that complete lac operons were present in all isolates examined, which in all but one case were functional. The lac operon phylogeny conformed to the whole-genome phylogeny of the divergent Escherichia clades, which excludes horizontal gene transfer as an explanation for the presence of functional lac operons in these clades. All lac operon genes showed a signature of purifying selection; this signature was strongest for the lacY gene. Lac operon genes of human and environmental isolates showed similar signatures of selection, except the lacZ gene, which showed a stronger signature of selection in environmental isolates.\r\nIn Chapter Three, I try to identify the natural genetic variation relevant for phenotype and fitness in the lac operon, comparing growth rate on lactose and LacZ activity of the lac operons of these wild isolates in a common genetic background. Sequence variation in the lac promoter region, upstream of the -10 and -35 RNA polymerase binding motif, predicted variation in LacZ activity at full induction, using a thermodynamic model of polymerase binding (Tugrul, 2016). However, neither variation in LacZ activity, nor RNA polymerase binding predicted by the model correlated with variation in growth rate. Lac operons of human and environmental isolates did not differ systematically in either growth rate on lactose or LacZ protein activity, suggesting that these lac operons have been exposed to similar selection pressures. We thus have no evidence that the phenotypic variation we measured is relevant for fitness.\r\nTo start assessing the effect of genomic background on the growth phenotype conferred by the lac operon, I compared growth on minimal medium with lactose between lac operon constructs and the corresponding original isolates, I found that maximal growth rate was determined by genomic background, with almost all backgrounds conferring higher growth rates than lab strain K12 MG1655. However, I found no evidence that the lactose concentration at which growth was half maximal depended on genomic background."}],"type":"dissertation","alternative_title":["ISTA Thesis"],"pubrep_id":"857","file":[{"file_id":"5252","relation":"main_file","date_updated":"2020-07-14T12:48:10Z","date_created":"2018-12-12T10:17:00Z","checksum":"c62257a7bff0c5f39e1abffc6bfcca5c","file_name":"IST-2017-857-v1+1_thesis_fabienne.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":3417773},{"checksum":"fc87d7d72fce52824a3ae7dcad0413a8","date_created":"2019-04-05T08:51:59Z","date_updated":"2020-07-14T12:48:10Z","relation":"source_file","file_id":"6212","content_type":"application/x-tex","file_size":215899,"creator":"dernst","access_level":"closed","file_name":"2017_thesis_Jesse_source.tex"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"820","title":"The lac operon in the wild","ddc":["576","577","579"],"status":"public","month":"08","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:th_857","degree_awarded":"PhD","supervisor":[{"last_name":"Bollback","first_name":"Jonathan P","orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","full_name":"Bollback, Jonathan P"}],"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"grant_number":"648440","_id":"2578D616-B435-11E9-9278-68D0E5697425","name":"Selective Barriers to Horizontal Gene Transfer","call_identifier":"H2020"}],"file_date_updated":"2020-07-14T12:48:10Z","ec_funded":1,"publist_id":"6829","author":[{"id":"4C8C26A4-F248-11E8-B48F-1D18A9856A87","first_name":"Fabienne","last_name":"Jesse","full_name":"Jesse, Fabienne"}],"date_updated":"2023-09-07T12:01:21Z","date_created":"2018-12-11T11:48:41Z","acknowledgement":"ERC H2020 programme (grant agreement no. 648440)\r\nThanks to Jon Bollback for giving me the chance to do this work, for sharing the ideas that lay at the basis of this work, for his honesty and openness, showing himself to me as a person and not just as a boss. Thanks to Nick Barton for his guidance at the last stage, reading and commenting extensively on several versions of this manuscript, and for his encouragement; thanks to both Jon and Nick for their kindness and patience. Thanks to Erik van Nimwegen and Calin Guet for their time and willingness to be in my thesis committee, and to Erik van Nimwegen especially for agreeing to enter my thesis committee at the last moment, and for his very sharp, helpful and relevant comments during and after the defense. Thanks to my collaborators and discussion partners: Anne Kupczok, for her guidance, ideas and discussions during the construction of the manuscript of Chapter Two, and her comments on the manuscript; Georg Rieckh for making me aware of the issue of parameter identifiability, suggesting how to solve it, and for his unfortunate idea to start the plasmid enterprise in the first place; Murat Tugrul for sharing his model, for his enthusiasm, and his comments on Chapter Three; Srdjan Sarikas for his collaboration on the Monod model fitting, fast forwarding the analysis to turbo speed and making beautiful figures, and making the discussion fun on top of it all; Vanessa Barone for her last minute comments, especially on Chapter Three, providing a sharp and very helpful experimentalist perspective at the last moment; Maros Pleska and Marjon de Vos for their comments on the manuscript of Chapter Two; Gasper Tkacik for his crucial input on the relation between growth rate and lactose concentration; Bor Kavcic for his input on growth rate modeling and error propagation. Thanks to the Bollback, Bollenbach, Barton, Guet and Tkacik group members for both pro- viding an inspiring and supportive scientific environment to work in, as well as a lot of warmth and colour to everyday life. And thanks to the friends I found here, to the people who were there for me and to the people who changed my life, making it stranger and more beautiful than I could have imagined, Maros, Vanessa, Tade, Suzi, Andrej, Peter, Tiago, Kristof, Karin, Irene, Misha, Mato, Guillaume and Zanin. ","year":"2017","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"JoBo"}]},{"day":"26","article_processing_charge":"No","has_accepted_license":"1","citation":{"chicago":"Rybar, Michal. “(The Exact Security of) Message Authentication Codes.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_828.","mla":"Rybar, Michal. (The Exact Security of) Message Authentication Codes. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_828.","short":"M. Rybar, (The Exact Security of) Message Authentication Codes, Institute of Science and Technology Austria, 2017.","ista":"Rybar M. 2017. (The exact security of) Message authentication codes. Institute of Science and Technology Austria.","ieee":"M. Rybar, “(The exact security of) Message authentication codes,” Institute of Science and Technology Austria, 2017.","apa":"Rybar, M. (2017). (The exact security of) Message authentication codes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_828","ama":"Rybar M. (The exact security of) Message authentication codes. 2017. doi:10.15479/AT:ISTA:th_828"},"page":"86","date_published":"2017-06-26T00:00:00Z","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"In this thesis we discuss the exact security of message authentications codes HMAC , NMAC , and PMAC . NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular and widely deployed message authentication code (MAC). PMAC is a block-cipher based mode of operation, which also happens to be the most famous fully parallel MAC. NMAC was introduced by Bellare, Canetti and Krawczyk Crypto’96, who proved it to be a secure pseudorandom function (PRF), and thus also a MAC, under two assumptions. Unfortunately, for many instantiations of HMAC one of them has been found to be wrong. To restore the provable guarantees for NMAC , Bellare [Crypto’06] showed its security without this assumption. PMAC was introduced by Black and Rogaway at Eurocrypt 2002. If instantiated with a pseudorandom permutation over n -bit strings, PMAC constitutes a provably secure variable input-length PRF. For adversaries making q queries, each of length at most ` (in n -bit blocks), and of total length σ ≤ q` , the original paper proves an upper bound on the distinguishing advantage of O ( σ 2 / 2 n ), while the currently best bound is O ( qσ/ 2 n ). In this work we show that this bound is tight by giving an attack with advantage Ω( q 2 `/ 2 n ). In the PMAC construction one initially XORs a mask to every message block, where the mask for the i th block is computed as τ i := γ i · L , where L is a (secret) random value, and γ i is the i -th codeword of the Gray code. Our attack applies more generally to any sequence of γ i ’s which contains a large coset of a subgroup of GF (2 n ). As for NMAC , our first contribution is a simpler and uniform proof: If f is an ε -secure PRF (against q queries) and a δ - non-adaptively secure PRF (against q queries), then NMAC f is an ( ε + `qδ )-secure PRF against q queries of length at most ` blocks each. We also show that this ε + `qδ bound is basically tight by constructing an f for which an attack with advantage `qδ exists. Moreover, we analyze the PRF-security of a modification of NMAC called NI by An and Bellare that avoids the constant rekeying on multi-block messages in NMAC and allows for an information-theoretic analysis. We carry out such an analysis, obtaining a tight `q 2 / 2 c bound for this step, improving over the trivial bound of ` 2 q 2 / 2 c . Finally, we investigate, if the security of PMAC can be further improved by using τ i ’s that are k -wise independent, for k > 1 (the original has k = 1). We observe that the security of PMAC will not increase in general if k = 2, and then prove that the security increases to O ( q 2 / 2 n ), if the k = 4. Due to simple extension attacks, this is the best bound one can hope for, using any distribution on the masks. Whether k = 3 is already sufficient to get this level of security is left as an open problem. Keywords: Message authentication codes, Pseudorandom functions, HMAC, PMAC. "}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"838","status":"public","ddc":["000"],"title":"(The exact security of) Message authentication codes","pubrep_id":"828","file":[{"file_id":"4799","relation":"main_file","date_created":"2018-12-12T10:10:13Z","date_updated":"2020-07-14T12:48:12Z","checksum":"ff8639ec4bded6186f44c7bd3ee26804","file_name":"IST-2017-828-v1+3_2017_Rybar_thesis.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":847400},{"date_updated":"2020-07-14T12:48:12Z","date_created":"2019-04-05T08:24:11Z","checksum":"3462101745ce8ad199c2d0f75dae4a7e","file_id":"6202","relation":"source_file","creator":"dernst","content_type":"application/zip","file_size":26054879,"file_name":"2017_Thesis_Rybar_source.zip","access_level":"closed"}],"oa_version":"Published Version","month":"06","publication_identifier":{"issn":["2663-337X"]},"oa":1,"doi":"10.15479/AT:ISTA:th_828","degree_awarded":"PhD","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:48:12Z","publist_id":"6810","year":"2017","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Institute of Science and Technology Austria","author":[{"id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Rybar","full_name":"Rybar, Michal"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"2082"},{"id":"6196","relation":"part_of_dissertation","status":"public"}]},"date_created":"2018-12-11T11:48:46Z","date_updated":"2023-09-07T12:02:28Z"},{"_id":"6196","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"title":"The exact security of PMAC","status":"public","intvolume":" 2016","file":[{"creator":"dernst","file_size":597335,"content_type":"application/pdf","access_level":"open_access","file_name":"2017_IACR_Gazi.pdf","checksum":"f23161d685dd957ae8d7274132999684","date_created":"2019-04-04T13:53:58Z","date_updated":"2020-07-14T12:47:24Z","file_id":"6197","relation":"main_file"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"PMAC is a simple and parallel block-cipher mode of operation, which was introduced by Black and Rogaway at Eurocrypt 2002. If instantiated with a (pseudo)random permutation over n-bit strings, PMAC constitutes a provably secure variable input-length (pseudo)random function. For adversaries making q queries, each of length at most l (in n-bit blocks), and of total length σ ≤ ql, the original paper proves an upper bound on the distinguishing advantage of Ο(σ2/2n), while the currently best bound is Ο (qσ/2n).In this work we show that this bound is tight by giving an attack with advantage Ω (q2l/2n). In the PMAC construction one initially XORs a mask to every message block, where the mask for the ith block is computed as τi := γi·L, where L is a (secret) random value, and γi is the i-th codeword of the Gray code. Our attack applies more generally to any sequence of γi’s which contains a large coset of a subgroup of GF(2n). We then investigate if the security of PMAC can be further improved by using τi’s that are k-wise independent, for k > 1 (the original distribution is only 1-wise independent). We observe that the security of PMAC will not increase in general, even if the masks are chosen from a 2-wise independent distribution, and then prove that the security increases to O(q<2/2n), if the τi are 4-wise independent. Due to simple extension attacks, this is the best bound one can hope for, using any distribution on the masks. Whether 3-wise independence is already sufficient to get this level of security is left as an open problem."}],"issue":"2","publication":"IACR Transactions on Symmetric Cryptology","citation":{"ista":"Gazi P, Pietrzak KZ, Rybar M. 2017. The exact security of PMAC. IACR Transactions on Symmetric Cryptology. 2016(2), 145–161.","ieee":"P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact security of PMAC,” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2. Ruhr University Bochum, pp. 145–161, 2017.","apa":"Gazi, P., Pietrzak, K. Z., & Rybar, M. (2017). The exact security of PMAC. IACR Transactions on Symmetric Cryptology. Ruhr University Bochum. https://doi.org/10.13154/TOSC.V2016.I2.145-161","ama":"Gazi P, Pietrzak KZ, Rybar M. The exact security of PMAC. IACR Transactions on Symmetric Cryptology. 2017;2016(2):145-161. doi:10.13154/TOSC.V2016.I2.145-161","chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact Security of PMAC.” IACR Transactions on Symmetric Cryptology. Ruhr University Bochum, 2017. https://doi.org/10.13154/TOSC.V2016.I2.145-161.","mla":"Gazi, Peter, et al. “The Exact Security of PMAC.” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2, Ruhr University Bochum, 2017, pp. 145–61, doi:10.13154/TOSC.V2016.I2.145-161.","short":"P. Gazi, K.Z. Pietrzak, M. Rybar, IACR Transactions on Symmetric Cryptology 2016 (2017) 145–161."},"page":"145-161","date_published":"2017-02-03T00:00:00Z","day":"03","has_accepted_license":"1","year":"2017","publication_status":"published","publisher":"Ruhr University Bochum","department":[{"_id":"KrPi"}],"author":[{"full_name":"Gazi, Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Gazi"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"full_name":"Rybar, Michal","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","last_name":"Rybar","first_name":"Michal"}],"related_material":{"record":[{"id":"838","status":"public","relation":"dissertation_contains"}]},"date_created":"2019-04-04T13:48:23Z","date_updated":"2023-09-07T12:02:27Z","volume":2016,"file_date_updated":"2020-07-14T12:47:24Z","ec_funded":1,"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"doi":"10.13154/TOSC.V2016.I2.145-161","language":[{"iso":"eng"}],"month":"02","publication_identifier":{"eissn":["2519-173X"]}},{"file":[{"access_level":"closed","file_name":"2017_Xu_Haibing_Thesis_Source.docx","creator":"dernst","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":3589490,"file_id":"6213","relation":"source_file","checksum":"f11925fbbce31e495124b6bc4f10573c","date_updated":"2020-07-14T12:48:12Z","date_created":"2019-04-05T08:59:51Z"},{"file_size":11668613,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2017_Xu_Thesis_IST.pdf","checksum":"ffb10749a537d615fab1ef0937ccb157","date_updated":"2020-07-14T12:48:12Z","date_created":"2019-04-05T08:59:51Z","relation":"main_file","file_id":"6214"}],"oa_version":"Published Version","pubrep_id":"858","ddc":["571"],"status":"public","title":"Reactivation of the hippocampal cognitive map in goal-directed spatial tasks","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"837","abstract":[{"text":"The hippocampus is a key brain region for memory and notably for spatial memory, and is needed for both spatial working and reference memories. Hippocampal place cells selectively discharge in specific locations of the environment to form mnemonic represen tations of space. Several behavioral protocols have been designed to test spatial memory which requires the experimental subject to utilize working memory and reference memory. However, less is known about how these memory traces are presented in the hippo campus, especially considering tasks that require both spatial working and long -term reference memory demand. The aim of my thesis was to elucidate how spatial working memory, reference memory, and the combination of both are represented in the hippocampus. In this thesis, using a radial eight -arm maze, I examined how the combined demand on these memories influenced place cell assemblies while reference memories were partially updated by changing some of the reward- arms. This was contrasted with task varian ts requiring working or reference memories only. Reference memory update led to gradual place field shifts towards the rewards on the switched arms. Cells developed enhanced firing in passes between newly -rewarded arms as compared to those containing an unchanged reward. The working memory task did not show such gradual changes. Place assemblies on occasions replayed trajectories of the maze; at decision points the next arm choice was preferentially replayed in tasks needing reference memory while in the pure working memory task the previously visited arm was replayed. Hence trajectory replay only reflected the decision of the animal in tasks needing reference memory update. At the reward locations, in all three tasks outbound trajectories of the current arm were preferentially replayed, showing the animals’ next path to the center. At reward locations trajectories were replayed preferentially in reverse temporal order. Moreover, in the center reverse replay was seen in the working memory task but in the other tasks forward replay was seen. Hence, the direction of reactivation was determined by the goal locations so that part of the trajectory which was closer to the goal was reactivated later in an HSE while places further away from the goal were reactivated earlier. Altogether my work demonstrated that reference memory update triggers several levels of reorganization of the hippocampal cognitive map which are not seen in simpler working memory demand s. Moreover, hippocampus is likely to be involved in spatial decisions through reactivating planned trajectories when reference memory recall is required for such a decision. ","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","date_published":"2017-08-23T00:00:00Z","page":"93","citation":{"chicago":"Xu, Haibing. “Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial Tasks.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_858.","short":"H. Xu, Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial Tasks, Institute of Science and Technology Austria, 2017.","mla":"Xu, Haibing. Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial Tasks. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_858.","ieee":"H. Xu, “Reactivation of the hippocampal cognitive map in goal-directed spatial tasks,” Institute of Science and Technology Austria, 2017.","apa":"Xu, H. (2017). Reactivation of the hippocampal cognitive map in goal-directed spatial tasks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_858","ista":"Xu H. 2017. Reactivation of the hippocampal cognitive map in goal-directed spatial tasks. Institute of Science and Technology Austria.","ama":"Xu H. Reactivation of the hippocampal cognitive map in goal-directed spatial tasks. 2017. doi:10.15479/AT:ISTA:th_858"},"has_accepted_license":"1","article_processing_charge":"No","day":"23","date_created":"2018-12-11T11:48:46Z","date_updated":"2023-09-07T12:06:38Z","related_material":{"record":[{"id":"5828","relation":"part_of_dissertation","status":"public"}]},"author":[{"full_name":"Xu, Haibing","last_name":"Xu","first_name":"Haibing","id":"310349D0-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"JoCs"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","acknowledgement":"I am very grateful for the opportunity I have had as a graduate student to explore and incredibly interesting branch of neuroscience, and for the people who made it possible. Firstly, I would like to offer my thanks to my supervisor Professor Jozsef Csicsvari for his great support, guidance and patience offered over the years. The door to his office was always open whenever I had questions. I have learned a lot from him about carefully designing experiments, asking interesting questions and how to integrate results into a broader picture. I also express my gratitude to the remarkable post- doc , Dr. Joseph O’Neill. He is a gre at scientific role model who is always willing to teach , and advice and talk through problems with his full attention. Many thanks to my wonderful “office mates” over the years and their support and encouragement, Alice Avernhe, Philipp Schönenberger, Desiree Dickerson, Karel Blahna, Charlotte Boccara, Igor Gridchyn, Peter Baracskay, Krisztián Kovács, Dámaris Rangel, Karola Käfer and Federico Stella. They were the ones in the lab for the many useful discussions about science and for making the laboratory such a nice and friendly place to work in. A special thank goes to Michael LoBianco and Jago Wallenschus for wonderful technical support. I would also like to thank Professor Peter Jonas and Professor David M Bannerman for being my qualifying exam and thesi s committee members despite their busy schedule. I am also very thankful to IST Austria for their support all throughout my PhD. ","year":"2017","publist_id":"6811","file_date_updated":"2020-07-14T12:48:12Z","language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"last_name":"Csicsvari","first_name":"Jozsef L","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L"}],"doi":"10.15479/AT:ISTA:th_858","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_identifier":{"issn":["2663-337X"]},"month":"08"},{"publist_id":"6483","file_date_updated":"2020-07-14T12:48:15Z","date_created":"2018-12-11T11:49:18Z","date_updated":"2023-09-07T12:06:09Z","related_material":{"record":[{"id":"1591","status":"public","relation":"part_of_dissertation"}]},"author":[{"full_name":"Adamowski, Maciek","last_name":"Adamowski","first_name":"Maciek","orcid":"0000-0001-6463-5257","id":"45F536D2-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"JiFr"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","year":"2017","publication_identifier":{"issn":["2663-337X"]},"month":"06","language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"first_name":"Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří"}],"doi":"10.15479/AT:ISTA:th_842","oa":1,"abstract":[{"lang":"eng","text":"The thesis encompasses several topics of plant cell biology which were studied in the model plant Arabidopsis thaliana. Chapter 1 concerns the plant hormone auxin and its polar transport through cells and tissues. The highly controlled, directional transport of auxin is facilitated by plasma membrane-localized transporters. Transporters from the PIN family direct auxin transport due to their polarized localizations at cell membranes. Substantial effort has been put into research on cellular trafficking of PIN proteins, which is thought to underlie their polar distribution. I participated in a forward genetic screen aimed at identifying novel regulators of PIN polarity. The screen yielded several genes which may be involved in PIN polarity regulation or participate in polar auxin transport by other means. Chapter 2 focuses on the endomembrane system, with particular attention to clathrin-mediated endocytosis. The project started with identification of several proteins that interact with clathrin light chains. Among them, I focused on two putative homologues of auxilin, which in non-plant systems is an endocytotic factor known for uncoating clathrin-coated vesicles in the final step of endocytosis. The body of my work consisted of an in-depth characterization of transgenic A. thaliana lines overexpressing these putative auxilins in an inducible manner. Overexpression of these proteins leads to an inhibition of endocytosis, as documented by imaging of cargoes and clathrin-related endocytic machinery. An extension of this work is an investigation into a concept of homeostatic regulation acting between distinct transport processes in the endomembrane system. With auxilin overexpressing lines, where endocytosis is blocked specifically, I made observations on the mutual relationship between two opposite trafficking processes of secretion and endocytosis. In Chapter 3, I analyze cortical microtubule arrays and their relationship to auxin signaling and polarized growth in elongating cells. In plants, microtubules are organized into arrays just below the plasma membrane, and it is thought that their function is to guide membrane-docked cellulose synthase complexes. These, in turn, influence cell wall structure and cell shape by directed deposition of cellulose fibres. In elongating cells, cortical microtubule arrays are able to reorient in relation to long cell axis, and these reorientations have been linked to cell growth and to signaling of growth-regulating factors such as auxin or light. In this chapter, I am addressing the causal relationship between microtubule array reorientation, growth, and auxin signaling. I arrive at a model where array reorientation is not guided by auxin directly, but instead is only controlled by growth, which, in turn, is regulated by auxin."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","file":[{"access_level":"closed","file_name":"2017_Adamowski-Thesis_Source.docx","creator":"dernst","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":46903863,"file_id":"6215","relation":"source_file","checksum":"193425764d9aaaed3ac57062a867b315","date_updated":"2020-07-14T12:48:15Z","date_created":"2019-04-05T09:03:20Z"},{"file_name":"2017_Adamowski-Thesis.pdf","access_level":"open_access","creator":"dernst","file_size":8698888,"content_type":"application/pdf","file_id":"6216","relation":"main_file","date_updated":"2020-07-14T12:48:15Z","date_created":"2019-04-05T09:03:19Z","checksum":"df5ab01be81f821e1b958596a1ec8d21"}],"oa_version":"Published Version","pubrep_id":"842","title":"Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana ","ddc":["581","583","580"],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"938","has_accepted_license":"1","article_processing_charge":"No","day":"02","date_published":"2017-06-02T00:00:00Z","page":"117","citation":{"apa":"Adamowski, M. (2017). Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_842","ieee":"M. Adamowski, “Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana ,” Institute of Science and Technology Austria, 2017.","ista":"Adamowski M. 2017. Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana . Institute of Science and Technology Austria.","ama":"Adamowski M. Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana . 2017. doi:10.15479/AT:ISTA:th_842","chicago":"Adamowski, Maciek. “Investigations into Cell Polarity and Trafficking in the Plant Model Arabidopsis Thaliana .” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_842.","short":"M. Adamowski, Investigations into Cell Polarity and Trafficking in the Plant Model Arabidopsis Thaliana , Institute of Science and Technology Austria, 2017.","mla":"Adamowski, Maciek. Investigations into Cell Polarity and Trafficking in the Plant Model Arabidopsis Thaliana . Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_842."}},{"author":[{"id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","first_name":"Michal","full_name":"Rolinek, Michal"}],"date_updated":"2023-09-07T12:05:41Z","date_created":"2018-12-11T11:49:35Z","acknowledgement":"FP7/2007-2013/ERC grant agreement no 616160","year":"2017","department":[{"_id":"VlKo"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","publist_id":"6407","ec_funded":1,"file_date_updated":"2020-07-14T12:48:18Z","doi":"10.15479/AT:ISTA:th_815","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"}],"degree_awarded":"PhD","oa":1,"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"publication_identifier":{"issn":["2663-337X"]},"month":"05","pubrep_id":"815","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"4654","date_updated":"2020-07-14T12:48:18Z","date_created":"2018-12-12T10:07:55Z","checksum":"81761fb939acb7585c36629f765b4373","file_name":"IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf","access_level":"open_access","content_type":"application/pdf","file_size":786145,"creator":"system"},{"date_created":"2019-04-05T08:43:24Z","date_updated":"2020-07-14T12:48:18Z","checksum":"2b2d7e1d6c1c79a9795a7aa0f860baf3","relation":"source_file","file_id":"6208","content_type":"application/zip","file_size":5936337,"creator":"dernst","file_name":"2017_Thesis_Rolinek_source.zip","access_level":"closed"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"992","status":"public","ddc":["004"],"title":"Complexity of constraint satisfaction","abstract":[{"text":"An instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of\r\nvariables, a finite domain of labels, and a set of constraints, each constraint acting on\r\na subset of the variables. The goal is to find an assignment of labels to its variables\r\nthat satisfies all constraints (or decide whether one exists). If we allow more general\r\n“soft” constraints, which come with (possibly infinite) costs of particular assignments,\r\nwe obtain instances from a richer class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal is to find an assignment with minimum total cost.\r\nIn this thesis, we focus (assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage, that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe complexity classification modulo (missing pieces of) complexity classification for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’ perfect\r\nmatching algorithm. This generalization contributes to complexity classfications in two\r\nways. First, it gives a new (largest known) polynomial-time solvable class of Boolean\r\nCSPs in which every variable may appear in at most two constraints and second, it\r\nsettles full classification of Boolean CSPs with planar drawing (again parametrized by a\r\nconstraint language).","lang":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"date_published":"2017-05-01T00:00:00Z","citation":{"chicago":"Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815.","short":"M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017.","mla":"Rolinek, Michal. Complexity of Constraint Satisfaction. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_815.","apa":"Rolinek, M. (2017). Complexity of constraint satisfaction. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_815","ieee":"M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science and Technology Austria, 2017.","ista":"Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria.","ama":"Rolinek M. Complexity of constraint satisfaction. 2017. doi:10.15479/AT:ISTA:th_815"},"page":"97","article_processing_charge":"No","has_accepted_license":"1","day":"01"},{"type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"Mapping every simplex in the Delaunay mosaic of a discrete point set to the radius of the smallest empty circumsphere gives a generalized discrete Morse function. Choosing the points from a Poisson point process in ℝ n , we study the expected number of simplices in the Delaunay mosaic as well as the expected number of critical simplices and nonsingular intervals in the corresponding generalized discrete gradient. Observing connections with other probabilistic models, we obtain precise expressions for the expected numbers in low dimensions. In particular, we obtain the expected numbers of simplices in the Poisson–Delaunay mosaic in dimensions n ≤ 4."}],"_id":"718","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 49","status":"public","title":"Expected sizes of poisson Delaunay mosaics and their discrete Morse functions","oa_version":"Preprint","scopus_import":1,"day":"01","citation":{"short":"H. Edelsbrunner, A. Nikitenko, M. Reitzner, Advances in Applied Probability 49 (2017) 745–767.","mla":"Edelsbrunner, Herbert, et al. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” Advances in Applied Probability, vol. 49, no. 3, Cambridge University Press, 2017, pp. 745–67, doi:10.1017/apr.2017.20.","chicago":"Edelsbrunner, Herbert, Anton Nikitenko, and Matthias Reitzner. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” Advances in Applied Probability. Cambridge University Press, 2017. https://doi.org/10.1017/apr.2017.20.","ama":"Edelsbrunner H, Nikitenko A, Reitzner M. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. 2017;49(3):745-767. doi:10.1017/apr.2017.20","ieee":"H. Edelsbrunner, A. Nikitenko, and M. Reitzner, “Expected sizes of poisson Delaunay mosaics and their discrete Morse functions,” Advances in Applied Probability, vol. 49, no. 3. Cambridge University Press, pp. 745–767, 2017.","apa":"Edelsbrunner, H., Nikitenko, A., & Reitzner, M. (2017). Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. Cambridge University Press. https://doi.org/10.1017/apr.2017.20","ista":"Edelsbrunner H, Nikitenko A, Reitzner M. 2017. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. 49(3), 745–767."},"publication":"Advances in Applied Probability","page":"745 - 767","date_published":"2017-09-01T00:00:00Z","ec_funded":1,"publist_id":"6962","year":"2017","department":[{"_id":"HeEd"}],"publisher":"Cambridge University Press","publication_status":"published","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6287"}]},"author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Nikitenko, Anton","last_name":"Nikitenko","first_name":"Anton","orcid":"0000-0002-0659-3201","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Reitzner","first_name":"Matthias","full_name":"Reitzner, Matthias"}],"volume":49,"date_created":"2018-12-11T11:48:07Z","date_updated":"2023-09-07T12:07:12Z","publication_identifier":{"issn":["00018678"]},"month":"09","main_file_link":[{"url":"https://arxiv.org/abs/1607.05915","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1607.05915"]},"project":[{"name":"Topological Complex Systems","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1017/apr.2017.20","language":[{"iso":"eng"}]},{"ec_funded":1,"publist_id":"7257","volume":10625,"date_updated":"2023-09-07T12:30:22Z","date_created":"2018-12-11T11:47:10Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"83"}]},"author":[{"full_name":"Abusalah, Hamza M","first_name":"Hamza M","last_name":"Abusalah","id":"40297222-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"first_name":"Bram","last_name":"Cohen","full_name":"Cohen, Bram"},{"first_name":"Danylo","last_name":"Khilko","full_name":"Khilko, Danylo"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Leonid","last_name":"Reyzin","full_name":"Reyzin, Leonid"}],"publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published","year":"2017","publication_identifier":{"isbn":["978-331970696-2"]},"month":"11","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-70697-9_13","conference":{"end_date":"2017-12-07","start_date":"2017-12-03","location":"Hong Kong, China","name":"ASIACRYPT: Theory and Applications of Cryptology and Information Security"},"project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/893.pdf"}],"abstract":[{"text":"Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather sophisticated graph pebbling lower bounds. Much simpler and in several aspects more efficient schemes based on inverting random functions have been suggested, but they don’t give meaningful security guarantees due to existing time-memory trade-offs. In particular, Hellman showed that any permutation over a domain of size N can be inverted in time T by an algorithm that is given S bits of auxiliary information whenever (Formula presented). For functions Hellman gives a weaker attack with S2· T≈ N2 (e.g., S= T≈ N2/3). To prove lower bounds, one considers an adversary who has access to an oracle f: [ N] → [N] and can make T oracle queries. The best known lower bound is S· T∈ Ω(N) and holds for random functions and permutations. We construct functions that provably require more time and/or space to invert. Specifically, for any constant k we construct a function [N] → [N] that cannot be inverted unless Sk· T∈ Ω(Nk) (in particular, S= T≈ (Formula presented). Our construction does not contradict Hellman’s time-memory trade-off, because it cannot be efficiently evaluated in forward direction. However, its entire function table can be computed in time quasilinear in N, which is sufficient for the PoS application. Our simplest construction is built from a random function oracle g: [N] × [N] → [ N] and a random permutation oracle f: [N] → N] and is defined as h(x) = g(x, x′) where f(x) = π(f(x′)) with π being any involution without a fixed point, e.g. flipping all the bits. For this function we prove that any adversary who gets S bits of auxiliary information, makes at most T oracle queries, and inverts h on an ϵ fraction of outputs must satisfy S2· T∈ Ω(ϵ2N2).","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Submitted Version","intvolume":" 10625","title":"Beyond Hellman’s time-memory trade-offs with applications to proofs of space","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"559","day":"18","scopus_import":1,"date_published":"2017-11-18T00:00:00Z","page":"357 - 379","citation":{"mla":"Abusalah, Hamza M., et al. Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space. Vol. 10625, Springer, 2017, pp. 357–79, doi:10.1007/978-3-319-70697-9_13.","short":"H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.","chicago":"Abusalah, Hamza M, Joel F Alwen, Bram Cohen, Danylo Khilko, Krzysztof Z Pietrzak, and Leonid Reyzin. “Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space,” 10625:357–79. Springer, 2017. https://doi.org/10.1007/978-3-319-70697-9_13.","ama":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. In: Vol 10625. Springer; 2017:357-379. doi:10.1007/978-3-319-70697-9_13","ista":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625, 357–379.","apa":"Abusalah, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., & Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China: Springer. https://doi.org/10.1007/978-3-319-70697-9_13","ieee":"H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379."}},{"oa_version":"Published Version","file":[{"file_name":"IST-2018-926-v1+1_euclid.ecp.1511233247.pdf","access_level":"open_access","creator":"system","file_size":470876,"content_type":"application/pdf","file_id":"4663","relation":"main_file","date_updated":"2020-07-14T12:47:00Z","date_created":"2018-12-12T10:08:04Z","checksum":"0ec05303a0de190de145654237984c79"}],"pubrep_id":"926","intvolume":" 22","status":"public","title":"Singularities of the density of states of random Gram matrices","ddc":["539"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"550","abstract":[{"text":"For large random matrices X with independent, centered entries but not necessarily identical variances, the eigenvalue density of XX* is well-approximated by a deterministic measure on ℝ. We show that the density of this measure has only square and cubic-root singularities away from zero. We also extend the bulk local law in [5] to the vicinity of these singularities.","lang":"eng"}],"type":"journal_article","date_published":"2017-11-21T00:00:00Z","citation":{"ista":"Alt J. 2017. Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. 22, 63.","apa":"Alt, J. (2017). Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/17-ECP97","ieee":"J. Alt, “Singularities of the density of states of random Gram matrices,” Electronic Communications in Probability, vol. 22. Institute of Mathematical Statistics, 2017.","ama":"Alt J. Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. 2017;22. doi:10.1214/17-ECP97","chicago":"Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” Electronic Communications in Probability. Institute of Mathematical Statistics, 2017. https://doi.org/10.1214/17-ECP97.","mla":"Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” Electronic Communications in Probability, vol. 22, 63, Institute of Mathematical Statistics, 2017, doi:10.1214/17-ECP97.","short":"J. Alt, Electronic Communications in Probability 22 (2017)."},"publication":"Electronic Communications in Probability","has_accepted_license":"1","day":"21","scopus_import":1,"volume":22,"date_created":"2018-12-11T11:47:07Z","date_updated":"2023-09-07T12:38:08Z","related_material":{"record":[{"id":"149","status":"public","relation":"dissertation_contains"}]},"author":[{"full_name":"Alt, Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","last_name":"Alt","first_name":"Johannes"}],"department":[{"_id":"LaEr"}],"publisher":"Institute of Mathematical Statistics","publication_status":"published","year":"2017","ec_funded":1,"publist_id":"7265","file_date_updated":"2020-07-14T12:47:00Z","article_number":"63","language":[{"iso":"eng"}],"doi":"10.1214/17-ECP97","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_identifier":{"issn":["1083589X"]},"month":"11"}]