[{"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"status":"public","ec_funded":1,"citation":{"ista":"Bogomolov S, Magazzeni D, Minopoli S, Wehrle M. 2015. PDDL+ planning with hybrid automata: Foundations of translating must behavior. ICAPS: International Conference on Automated Planning and Scheduling, 42–46.","chicago":"Bogomolov, Sergiy, Daniele Magazzeni, Stefano Minopoli, and Martin Wehrle. “PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior,” 42–46. AAAI Press, 2015.","apa":"Bogomolov, S., Magazzeni, D., Minopoli, S., &#38; Wehrle, M. (2015). PDDL+ planning with hybrid automata: Foundations of translating must behavior (pp. 42–46). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Jerusalem, Israel: AAAI Press.","mla":"Bogomolov, Sergiy, et al. <i>PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior</i>. AAAI Press, 2015, pp. 42–46.","ama":"Bogomolov S, Magazzeni D, Minopoli S, Wehrle M. PDDL+ planning with hybrid automata: Foundations of translating must behavior. In: AAAI Press; 2015:42-46.","ieee":"S. Bogomolov, D. Magazzeni, S. Minopoli, and M. Wehrle, “PDDL+ planning with hybrid automata: Foundations of translating must behavior,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Jerusalem, Israel, 2015, pp. 42–46.","short":"S. Bogomolov, D. Magazzeni, S. Minopoli, M. Wehrle, in:, AAAI Press, 2015, pp. 42–46."},"conference":{"location":"Jerusalem, Israel","name":"ICAPS: International Conference on Automated Planning and Scheduling","start_date":"2015-06-07","end_date":"2015-06-11"},"acknowledgement":"This work was partly supported by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR 14 AVACS, http://www.avacs.org/), by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and by the Swiss National Science Foundation (SNSF) as part of the project “Automated Reformulation and Pruning in Factored State Spaces (ARAP)”.","date_published":"2015-06-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","month":"06","department":[{"_id":"ToHe"}],"publist_id":"5479","page":"42 - 46","abstract":[{"lang":"eng","text":"Planning in hybrid domains poses a special challenge due to the involved mixed discrete-continuous dynamics. A recent solving approach for such domains is based on applying model checking techniques on a translation of PDDL+ planning problems to hybrid automata. However, the proposed translation is limited because must behavior is only overapproximated, and hence, processes and events are not reflected exactly. In this paper, we present the theoretical foundation of an exact PDDL+ translation. We propose a schema to convert a hybrid automaton with must transitions into an equivalent hybrid automaton featuring only may transitions."}],"main_file_link":[{"url":"https://www.aaai.org/ocs/index.php/ICAPS/ICAPS15/paper/view/10606/10394"}],"quality_controlled":"1","publication_status":"published","author":[{"last_name":"Bogomolov","full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy","orcid":"0000-0002-0686-0365"},{"first_name":"Daniele","full_name":"Magazzeni, Daniele","last_name":"Magazzeni"},{"first_name":"Stefano","last_name":"Minopoli","full_name":"Minopoli, Stefano"},{"first_name":"Martin","full_name":"Wehrle, Martin","last_name":"Wehrle"}],"scopus_import":1,"day":"01","title":"PDDL+ planning with hybrid automata: Foundations of translating must behavior","publisher":"AAAI Press","oa_version":"None","date_updated":"2021-01-12T06:52:25Z","_id":"1670","type":"conference","date_created":"2018-12-11T11:53:23Z"},{"publisher":"Springer","doi":"10.1007/978-3-662-47989-6_18","alternative_title":["LNCS"],"type":"conference","date_updated":"2021-01-12T06:52:25Z","_id":"1671","ddc":["004","005"],"page":"368 - 387","quality_controlled":"1","year":"2015","publist_id":"5478","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"status":"public","date_published":"2015-08-01T00:00:00Z","conference":{"location":"Santa Barbara, CA, United States","name":"CRYPTO: International Cryptology Conference","start_date":"2015-08-16","end_date":"2015-08-20"},"ec_funded":1,"title":"The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC","oa_version":"Submitted Version","author":[{"first_name":"Peter","last_name":"Gazi","full_name":"Gazi, Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z"},{"last_name":"Tessaro","full_name":"Tessaro, Stefano","first_name":"Stefano"}],"scopus_import":1,"day":"01","date_created":"2018-12-11T11:53:23Z","volume":9215,"abstract":[{"text":"This paper studies the concrete security of PRFs and MACs obtained by keying hash functions based on the sponge paradigm. One such hash function is KECCAK, selected as NIST’s new SHA-3 standard. In contrast to other approaches like HMAC, the exact security of keyed sponges is not well understood. Indeed, recent security analyses delivered concrete security bounds which are far from existing attacks. This paper aims to close this gap. We prove (nearly) exact bounds on the concrete PRF security of keyed sponges using a random permutation. These bounds are tight for the most relevant ranges of parameters, i.e., for messages of length (roughly) l ≤ min{2n/4, 2r} blocks, where n is the state size and r is the desired output length; and for l ≤ q queries (to the construction or the underlying permutation). Moreover, we also improve standard-model bounds. As an intermediate step of independent interest, we prove tight bounds on the PRF security of the truncated CBC-MAC construction, which operates as plain CBC-MAC, but only returns a prefix of the output.","lang":"eng"}],"intvolume":"      9215","has_accepted_license":"1","publication_status":"published","file_date_updated":"2020-07-14T12:45:11Z","month":"08","file":[{"file_id":"4827","file_size":592296,"date_created":"2018-12-12T10:10:38Z","date_updated":"2020-07-14T12:45:11Z","creator":"system","relation":"main_file","checksum":"17d854227b3b753fd34f5d29e5b5a32e","file_name":"IST-2016-673-v1+1_053.pdf","content_type":"application/pdf","access_level":"open_access"}],"department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"pubrep_id":"673","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"P. Gazi, K. Z. Pietrzak, and S. Tessaro, “The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9215, pp. 368–387.","short":"P. Gazi, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2015, pp. 368–387.","ama":"Gazi P, Pietrzak KZ, Tessaro S. The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC. In: Vol 9215. Springer; 2015:368-387. doi:<a href=\"https://doi.org/10.1007/978-3-662-47989-6_18\">10.1007/978-3-662-47989-6_18</a>","apa":"Gazi, P., Pietrzak, K. Z., &#38; Tessaro, S. (2015). The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC (Vol. 9215, pp. 368–387). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-662-47989-6_18\">https://doi.org/10.1007/978-3-662-47989-6_18</a>","mla":"Gazi, Peter, et al. <i>The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC</i>. Vol. 9215, Springer, 2015, pp. 368–87, doi:<a href=\"https://doi.org/10.1007/978-3-662-47989-6_18\">10.1007/978-3-662-47989-6_18</a>.","ista":"Gazi P, Pietrzak KZ, Tessaro S. 2015. The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC. CRYPTO: International Cryptology Conference, LNCS, vol. 9215, 368–387.","chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC,” 9215:368–87. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47989-6_18\">https://doi.org/10.1007/978-3-662-47989-6_18</a>."}},{"quality_controlled":"1","page":"763 - 780","ddc":["000"],"date_updated":"2022-06-07T09:51:55Z","_id":"1672","type":"conference","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-662-48000-7_37","alternative_title":["LNCS"],"article_processing_charge":"No","publisher":"Springer","ec_funded":1,"date_published":"2015-08-01T00:00:00Z","acknowledgement":"Joël Alwen was supported by the ERC starting grant (259668-PSPC). Rafail Ostrovsky was supported in part by NSF grants 09165174, 1065276, 1118126 and 1136174, US-Israel BSF grant 2008411, OKAWA Foundation Research Award, IBM Faculty Research Award, Xerox Faculty Research Award, B. John Garrick Foundation Award, Teradata Research Award, Lockheed-Martin Corporation Research Award, and the Defense Advanced Research Projects Agency through the U.S. Office of Naval Research under Contract N00014 -11 -1-0392. The views expressed are those of the author and do not reflect the official policy or position of the Department of Defense or the U.S. Government. Vassilis Zikas was supported in part by the Swiss National Science Foundation (SNF) via the Ambizione grant PZ00P-2142549.","conference":{"location":"Santa Barbara, CA, United States","end_date":"2015-08-20","start_date":"2015-08-16","name":"CRYPTO: International Cryptology Conference"},"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7"}],"status":"public","publication":"Advances in Cryptology - CRYPTO 2015","publist_id":"5476","year":"2015","publication_identifier":{"isbn":["978-3-662-47999-5"],"eisbn":["978-3-662-48000-7"]},"publication_status":"published","file_date_updated":"2020-07-14T12:45:11Z","has_accepted_license":"1","intvolume":"      9216","abstract":[{"text":"Composable notions of incoercibility aim to forbid a coercer from using anything beyond the coerced parties’ inputs and outputs to catch them when they try to deceive him. Existing definitions are restricted to weak coercion types, and/or are not universally composable. Furthermore, they often make too strong assumptions on the knowledge of coerced parties—e.g., they assume they known the identities and/or the strategies of other coerced parties, or those of corrupted parties— which makes them unsuitable for applications of incoercibility such as e-voting, where colluding adversarial parties may attempt to coerce honest voters, e.g., by offering them money for a promised vote, and use their own view to check that the voter keeps his end of the bargain. In this work we put forward the first universally composable notion of incoercible multi-party computation, which satisfies the above intuition and does not assume collusions among coerced parties or knowledge of the corrupted set. We define natural notions of UC incoercibility corresponding to standard coercion-types, i.e., receipt-freeness and resistance to full-active coercion. Importantly, our suggested notion has the unique property that it builds on top of the well studied UC framework by Canetti instead of modifying it. This guarantees backwards compatibility, and allows us to inherit results from the rich UC literature. We then present MPC protocols which realize our notions of UC incoercibility given access to an arguably minimal setup—namely honestly generate tamper-proof hardware performing a very simple cryptographic operation—e.g., a smart card. This is, to our knowledge, the first proposed construction of an MPC protocol (for more than two parties) that is incoercibly secure and universally composable, and therefore the first construction of a universally composable receipt-free e-voting protocol.","lang":"eng"}],"volume":9216,"date_created":"2018-12-11T11:53:23Z","author":[{"last_name":"Alwen","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F"},{"first_name":"Rafail","full_name":"Ostrovsky, Rafail","last_name":"Ostrovsky"},{"last_name":"Zhou","full_name":"Zhou, Hongsheng","first_name":"Hongsheng"},{"full_name":"Zikas, Vassilis","last_name":"Zikas","first_name":"Vassilis"}],"day":"01","scopus_import":"1","oa_version":"Submitted Version","title":"Incoercible multi-party computation and universally composable receipt-free voting","citation":{"apa":"Alwen, J. F., Ostrovsky, R., Zhou, H., &#38; Zikas, V. (2015). Incoercible multi-party computation and universally composable receipt-free voting. In <i>Advances in Cryptology - CRYPTO 2015</i> (Vol. 9216, pp. 763–780). Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48000-7_37\">https://doi.org/10.1007/978-3-662-48000-7_37</a>","mla":"Alwen, Joel F., et al. “Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting.” <i>Advances in Cryptology - CRYPTO 2015</i>, vol. 9216, Springer, 2015, pp. 763–80, doi:<a href=\"https://doi.org/10.1007/978-3-662-48000-7_37\">10.1007/978-3-662-48000-7_37</a>.","ista":"Alwen JF, Ostrovsky R, Zhou H, Zikas V. 2015. Incoercible multi-party computation and universally composable receipt-free voting. Advances in Cryptology - CRYPTO 2015. CRYPTO: International Cryptology ConferenceLecture Notes in Computer Science, LNCS, vol. 9216, 763–780.","chicago":"Alwen, Joel F, Rafail Ostrovsky, Hongsheng Zhou, and Vassilis Zikas. “Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting.” In <i>Advances in Cryptology - CRYPTO 2015</i>, 9216:763–80. Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48000-7_37\">https://doi.org/10.1007/978-3-662-48000-7_37</a>.","ieee":"J. F. Alwen, R. Ostrovsky, H. Zhou, and V. Zikas, “Incoercible multi-party computation and universally composable receipt-free voting,” in <i>Advances in Cryptology - CRYPTO 2015</i>, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 763–780.","short":"J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, in:, Advances in Cryptology - CRYPTO 2015, Springer, 2015, pp. 763–780.","ama":"Alwen JF, Ostrovsky R, Zhou H, Zikas V. Incoercible multi-party computation and universally composable receipt-free voting. In: <i>Advances in Cryptology - CRYPTO 2015</i>. Vol 9216. Lecture Notes in Computer Science. Springer; 2015:763-780. doi:<a href=\"https://doi.org/10.1007/978-3-662-48000-7_37\">10.1007/978-3-662-48000-7_37</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"file":[{"file_id":"7853","date_created":"2020-05-15T08:55:29Z","file_size":397363,"date_updated":"2020-07-14T12:45:11Z","creator":"dernst","relation":"main_file","checksum":"5b6649e80d1f781a8910f7cce6427f78","file_name":"2015_CRYPTO_Alwen.pdf","access_level":"open_access","content_type":"application/pdf"}],"month":"08"},{"acknowledgement":"K.C. gratefully acknowledges support from ERC Start grant no. (279307: Graph Games), Austrian Science Fund (FWF) grant no. P23499-N23, and FWF NFN grant no. S11407-N23 (RiSE). ","date_published":"2015-09-08T00:00:00Z","ec_funded":1,"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"status":"public","publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","publist_id":"5477","year":"2015","quality_controlled":"1","ddc":["000"],"type":"journal_article","date_updated":"2021-01-12T06:52:26Z","_id":"1673","publisher":"Royal Society of London","doi":"10.1098/rspa.2015.0114","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","issue":"2181","citation":{"chicago":"Adlam, Ben, Krishnendu Chatterjee, and Martin Nowak. “Amplifiers of Selection.” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. Royal Society of London, 2015. <a href=\"https://doi.org/10.1098/rspa.2015.0114\">https://doi.org/10.1098/rspa.2015.0114</a>.","ista":"Adlam B, Chatterjee K, Nowak M. 2015. Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 471(2181), 20150114.","apa":"Adlam, B., Chatterjee, K., &#38; Nowak, M. (2015). Amplifiers of selection. <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. Royal Society of London. <a href=\"https://doi.org/10.1098/rspa.2015.0114\">https://doi.org/10.1098/rspa.2015.0114</a>","mla":"Adlam, Ben, et al. “Amplifiers of Selection.” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>, vol. 471, no. 2181, 20150114, Royal Society of London, 2015, doi:<a href=\"https://doi.org/10.1098/rspa.2015.0114\">10.1098/rspa.2015.0114</a>.","ama":"Adlam B, Chatterjee K, Nowak M. Amplifiers of selection. <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. 2015;471(2181). doi:<a href=\"https://doi.org/10.1098/rspa.2015.0114\">10.1098/rspa.2015.0114</a>","ieee":"B. Adlam, K. Chatterjee, and M. Nowak, “Amplifiers of selection,” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>, vol. 471, no. 2181. Royal Society of London, 2015.","short":"B. Adlam, K. Chatterjee, M. Nowak, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471 (2015)."},"language":[{"iso":"eng"}],"oa":1,"article_number":"20150114","file":[{"content_type":"application/pdf","access_level":"open_access","file_name":"2015_rspa_Adlam.pdf","checksum":"e613d94d283c776322403a28aad11bdd","relation":"main_file","creator":"kschuh","date_updated":"2020-07-14T12:45:11Z","file_size":391466,"date_created":"2019-04-18T12:39:56Z","file_id":"6342"}],"department":[{"_id":"KrCh"}],"month":"09","publication_status":"published","file_date_updated":"2020-07-14T12:45:11Z","intvolume":"       471","abstract":[{"text":"When a new mutant arises in a population, there is a probability it outcompetes the residents and fixes. The structure of the population can affect this fixation probability. Suppressing population structures reduce the difference between two competing variants, while amplifying population structures enhance the difference. Suppressors are ubiquitous and easy to construct, but amplifiers for the large population limit are more elusive and only a few examples have been discovered. Whether or not a population structure is an amplifier of selection depends on the probability distribution for the placement of the invading mutant. First, we prove that there exist only bounded amplifiers for adversarial placement-that is, for arbitrary initial conditions. Next, we show that the Star population structure, which is known to amplify for mutants placed uniformly at random, does not amplify for mutants that arise through reproduction and are therefore placed proportional to the temperatures of the vertices. Finally, we construct population structures that amplify for all mutational events that arise through reproduction, uniformly at random, or through some combination of the two. ","lang":"eng"}],"has_accepted_license":"1","date_created":"2018-12-11T11:53:24Z","volume":471,"oa_version":"Published Version","title":"Amplifiers of selection","author":[{"first_name":"Ben","last_name":"Adlam","full_name":"Adlam, Ben"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"scopus_import":1,"day":"08"},{"publisher":"World Scientific Publishing","oa_version":"Preprint","title":"Edge universality for deformed Wigner matrices","day":"01","scopus_import":1,"author":[{"first_name":"Jioon","full_name":"Lee, Jioon","last_name":"Lee"},{"full_name":"Schnelli, Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","last_name":"Schnelli","orcid":"0000-0003-0954-3231","first_name":"Kevin"}],"doi":"10.1142/S0129055X1550018X","date_created":"2018-12-11T11:53:24Z","type":"journal_article","_id":"1674","volume":27,"date_updated":"2021-01-12T06:52:26Z","abstract":[{"text":"We consider N × N random matrices of the form H = W + V where W is a real symmetric Wigner matrix and V a random or deterministic, real, diagonal matrix whose entries are independent of W. We assume subexponential decay for the matrix entries of W and we choose V so that the eigenvalues of W and V are typically of the same order. For a large class of diagonal matrices V, we show that the rescaled distribution of the extremal eigenvalues is given by the Tracy-Widom distribution F1 in the limit of large N. Our proofs also apply to the complex Hermitian setting, i.e. when W is a complex Hermitian Wigner matrix.","lang":"eng"}],"intvolume":"        27","publication_status":"published","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.8015"}],"month":"09","year":"2015","article_number":"1550018","publist_id":"5475","department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"publication":"Reviews in Mathematical Physics","status":"public","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-09-01T00:00:00Z","citation":{"chicago":"Lee, Jioon, and Kevin Schnelli. “Edge Universality for Deformed Wigner Matrices.” <i>Reviews in Mathematical Physics</i>. World Scientific Publishing, 2015. <a href=\"https://doi.org/10.1142/S0129055X1550018X\">https://doi.org/10.1142/S0129055X1550018X</a>.","ista":"Lee J, Schnelli K. 2015. Edge universality for deformed Wigner matrices. Reviews in Mathematical Physics. 27(8), 1550018.","mla":"Lee, Jioon, and Kevin Schnelli. “Edge Universality for Deformed Wigner Matrices.” <i>Reviews in Mathematical Physics</i>, vol. 27, no. 8, 1550018, World Scientific Publishing, 2015, doi:<a href=\"https://doi.org/10.1142/S0129055X1550018X\">10.1142/S0129055X1550018X</a>.","apa":"Lee, J., &#38; Schnelli, K. (2015). Edge universality for deformed Wigner matrices. <i>Reviews in Mathematical Physics</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129055X1550018X\">https://doi.org/10.1142/S0129055X1550018X</a>","ama":"Lee J, Schnelli K. Edge universality for deformed Wigner matrices. <i>Reviews in Mathematical Physics</i>. 2015;27(8). doi:<a href=\"https://doi.org/10.1142/S0129055X1550018X\">10.1142/S0129055X1550018X</a>","short":"J. Lee, K. Schnelli, Reviews in Mathematical Physics 27 (2015).","ieee":"J. Lee and K. Schnelli, “Edge universality for deformed Wigner matrices,” <i>Reviews in Mathematical Physics</i>, vol. 27, no. 8. World Scientific Publishing, 2015."},"issue":"8"},{"conference":{"start_date":"2015-08-16","end_date":"2015-08-20","name":"CRYPTO: International Cryptology Conference","location":"Santa Barbara, CA, United States"},"date_published":"2015-08-01T00:00:00Z","ec_funded":1,"status":"public","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice"},{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"publist_id":"5474","related_material":{"record":[{"id":"2274","status":"public","relation":"earlier_version"}]},"year":"2015","quality_controlled":"1","page":"585 - 605","series_title":"Lecture Notes in Computer Science","type":"conference","_id":"1675","date_updated":"2023-02-23T10:35:50Z","publisher":"Springer","alternative_title":["LNCS"],"doi":"10.1007/978-3-662-48000-7_29","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2015. Proofs of space. 9216, 585–605.","chicago":"Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. “Proofs of Space.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48000-7_29\">https://doi.org/10.1007/978-3-662-48000-7_29</a>.","apa":"Dziembowski, S., Faust, S., Kolmogorov, V., &#38; Pietrzak, K. Z. (2015). Proofs of space. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48000-7_29\">https://doi.org/10.1007/978-3-662-48000-7_29</a>","mla":"Dziembowski, Stefan, et al. <i>Proofs of Space</i>. Vol. 9216, Springer, 2015, pp. 585–605, doi:<a href=\"https://doi.org/10.1007/978-3-662-48000-7_29\">10.1007/978-3-662-48000-7_29</a>.","ama":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. Proofs of space. 2015;9216:585-605. doi:<a href=\"https://doi.org/10.1007/978-3-662-48000-7_29\">10.1007/978-3-662-48000-7_29</a>","ieee":"S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” vol. 9216. Springer, pp. 585–605, 2015.","short":"S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, 9216 (2015) 585–605."},"pubrep_id":"671","language":[{"iso":"eng"}],"department":[{"_id":"VlKo"},{"_id":"KrPi"}],"month":"08","publication_status":"published","abstract":[{"text":"Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto’92) as protection to a shared resource. The basic idea is to ask the service requestor to dedicate some non-trivial amount of computational work to every request. The original applications included prevention of spam and protection against denial of service attacks. More recently, PoWs have been used to prevent double spending in the Bitcoin digital currency system. In this work, we put forward an alternative concept for PoWs - so-called proofs of space (PoS), where a service requestor must dedicate a significant amount of disk space as opposed to computation. We construct secure PoS schemes in the random oracle model (with one additional mild assumption required for the proof to go through), using graphs with high “pebbling complexity” and Merkle hash-trees. We discuss some applications, including follow-up work where a decentralized digital currency scheme called Spacecoin is constructed that uses PoS (instead of wasteful PoW like in Bitcoin) to prevent double spending. The main technical contribution of this work is the construction of (directed, loop-free) graphs on N vertices with in-degree O(log logN) such that even if one places Θ(N) pebbles on the nodes of the graph, there’s a constant fraction of nodes that needs Θ(N) steps to be pebbled (where in every step one can put a pebble on a node if all its parents have a pebble).","lang":"eng"}],"intvolume":"      9216","date_created":"2018-12-11T11:53:24Z","volume":9216,"title":"Proofs of space","oa_version":"None","scopus_import":1,"day":"01","author":[{"first_name":"Stefan","last_name":"Dziembowski","full_name":"Dziembowski, Stefan"},{"last_name":"Faust","full_name":"Faust, Sebastian","first_name":"Sebastian"},{"first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}]},{"title":"Editorial overview: Cell adhesion and migration","publisher":"Elsevier","oa_version":"None","scopus_import":1,"day":"01","doi":"10.1016/j.ceb.2015.09.004","author":[{"last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","first_name":"Michael K","orcid":"0000-0002-6620-9179"},{"last_name":"Raz","full_name":"Raz, Erez","first_name":"Erez"}],"date_created":"2018-12-11T11:53:25Z","type":"journal_article","_id":"1676","volume":36,"date_updated":"2021-01-12T06:52:27Z","intvolume":"        36","page":"4 - 6","publication_status":"published","month":"10","year":"2015","publist_id":"5473","department":[{"_id":"MiSi"}],"publication":"Current Opinion in Cell Biology","language":[{"iso":"eng"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-10-01T00:00:00Z","citation":{"apa":"Sixt, M. K., &#38; Raz, E. (2015). Editorial overview: Cell adhesion and migration. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2015.09.004\">https://doi.org/10.1016/j.ceb.2015.09.004</a>","mla":"Sixt, Michael K., and Erez Raz. “Editorial Overview: Cell Adhesion and Migration.” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10, Elsevier, 2015, pp. 4–6, doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.09.004\">10.1016/j.ceb.2015.09.004</a>.","ista":"Sixt MK, Raz E. 2015. Editorial overview: Cell adhesion and migration. Current Opinion in Cell Biology. 36(10), 4–6.","chicago":"Sixt, Michael K, and Erez Raz. “Editorial Overview: Cell Adhesion and Migration.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ceb.2015.09.004\">https://doi.org/10.1016/j.ceb.2015.09.004</a>.","ieee":"M. K. Sixt and E. Raz, “Editorial overview: Cell adhesion and migration,” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10. Elsevier, pp. 4–6, 2015.","short":"M.K. Sixt, E. Raz, Current Opinion in Cell Biology 36 (2015) 4–6.","ama":"Sixt MK, Raz E. Editorial overview: Cell adhesion and migration. <i>Current Opinion in Cell Biology</i>. 2015;36(10):4-6. doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.09.004\">10.1016/j.ceb.2015.09.004</a>"},"issue":"10"},{"article_number":"103301","department":[{"_id":"LaEr"}],"month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Alt J. 2015. The local semicircle law for random matrices with a fourfold symmetry. Journal of Mathematical Physics. 56(10), 103301.","chicago":"Alt, Johannes. “The Local Semicircle Law for Random Matrices with a Fourfold Symmetry.” <i>Journal of Mathematical Physics</i>. American Institute of Physics, 2015. <a href=\"https://doi.org/10.1063/1.4932606\">https://doi.org/10.1063/1.4932606</a>.","apa":"Alt, J. (2015). The local semicircle law for random matrices with a fourfold symmetry. <i>Journal of Mathematical Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4932606\">https://doi.org/10.1063/1.4932606</a>","mla":"Alt, Johannes. “The Local Semicircle Law for Random Matrices with a Fourfold Symmetry.” <i>Journal of Mathematical Physics</i>, vol. 56, no. 10, 103301, American Institute of Physics, 2015, doi:<a href=\"https://doi.org/10.1063/1.4932606\">10.1063/1.4932606</a>.","ama":"Alt J. The local semicircle law for random matrices with a fourfold symmetry. <i>Journal of Mathematical Physics</i>. 2015;56(10). doi:<a href=\"https://doi.org/10.1063/1.4932606\">10.1063/1.4932606</a>","ieee":"J. Alt, “The local semicircle law for random matrices with a fourfold symmetry,” <i>Journal of Mathematical Physics</i>, vol. 56, no. 10. American Institute of Physics, 2015.","short":"J. Alt, Journal of Mathematical Physics 56 (2015)."},"issue":"10","language":[{"iso":"eng"}],"oa":1,"date_created":"2018-12-11T11:53:25Z","volume":56,"oa_version":"Preprint","title":"The local semicircle law for random matrices with a fourfold symmetry","day":"09","scopus_import":1,"author":[{"first_name":"Johannes","last_name":"Alt","full_name":"Alt, Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","intvolume":"        56","abstract":[{"text":"We consider real symmetric and complex Hermitian random matrices with the additional symmetry hxy = hN-y,N-x. The matrix elements are independent (up to the fourfold symmetry) and not necessarily identically distributed. This ensemble naturally arises as the Fourier transform of a Gaussian orthogonal ensemble. Italso occurs as the flip matrix model - an approximation of the two-dimensional Anderson model at small disorder. We show that the density of states converges to the Wigner semicircle law despite the new symmetry type. We also prove the local version of the semicircle law on the optimal scale.","lang":"eng"}],"publist_id":"5472","related_material":{"record":[{"id":"149","status":"public","relation":"dissertation_contains"}]},"year":"2015","date_published":"2015-10-09T00:00:00Z","ec_funded":1,"status":"public","publication":"Journal of Mathematical Physics","project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"type":"journal_article","_id":"1677","date_updated":"2023-09-07T12:38:08Z","publisher":"American Institute of Physics","doi":"10.1063/1.4932606","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1506.04683"}]},{"month":"10","department":[{"_id":"HaJa"},{"_id":"LifeSc"}],"file":[{"date_created":"2018-12-12T10:10:51Z","file_size":1308364,"date_updated":"2020-07-14T12:45:12Z","creator":"system","file_id":"4842","file_name":"IST-2017-837-v1+1_ingles-prieto.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"e9fb251dfcb7cd209b83f17867e61321"}],"oa":1,"pubrep_id":"837","language":[{"iso":"eng"}],"issue":"12","citation":{"ieee":"Á. Inglés Prieto <i>et al.</i>, “Light-assisted small-molecule screening against protein kinases,” <i>Nature Chemical Biology</i>, vol. 11, no. 12. Nature Publishing Group, pp. 952–954, 2015.","short":"Á. Inglés Prieto, E. Gschaider-Reichhart, M. Muellner, M. Nowak, S. Nijman, M. Grusch, H.L. Janovjak, Nature Chemical Biology 11 (2015) 952–954.","ama":"Inglés Prieto Á, Gschaider-Reichhart E, Muellner M, et al. Light-assisted small-molecule screening against protein kinases. <i>Nature Chemical Biology</i>. 2015;11(12):952-954. doi:<a href=\"https://doi.org/10.1038/nchembio.1933\">10.1038/nchembio.1933</a>","apa":"Inglés Prieto, Á., Gschaider-Reichhart, E., Muellner, M., Nowak, M., Nijman, S., Grusch, M., &#38; Janovjak, H. L. (2015). Light-assisted small-molecule screening against protein kinases. <i>Nature Chemical Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nchembio.1933\">https://doi.org/10.1038/nchembio.1933</a>","mla":"Inglés Prieto, Álvaro, et al. “Light-Assisted Small-Molecule Screening against Protein Kinases.” <i>Nature Chemical Biology</i>, vol. 11, no. 12, Nature Publishing Group, 2015, pp. 952–54, doi:<a href=\"https://doi.org/10.1038/nchembio.1933\">10.1038/nchembio.1933</a>.","ista":"Inglés Prieto Á, Gschaider-Reichhart E, Muellner M, Nowak M, Nijman S, Grusch M, Janovjak HL. 2015. Light-assisted small-molecule screening against protein kinases. Nature Chemical Biology. 11(12), 952–954.","chicago":"Inglés Prieto, Álvaro, Eva Gschaider-Reichhart, Markus Muellner, Matthias Nowak, Sebastian Nijman, Michael Grusch, and Harald L Janovjak. “Light-Assisted Small-Molecule Screening against Protein Kinases.” <i>Nature Chemical Biology</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/nchembio.1933\">https://doi.org/10.1038/nchembio.1933</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","full_name":"Inglés Prieto, Álvaro","last_name":"Inglés Prieto","orcid":"0000-0002-5409-8571","first_name":"Álvaro"},{"orcid":"0000-0002-7218-7738","first_name":"Eva","last_name":"Gschaider-Reichhart","full_name":"Gschaider-Reichhart, Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Muellner, Markus","last_name":"Muellner","first_name":"Markus"},{"first_name":"Matthias","last_name":"Nowak","full_name":"Nowak, Matthias","id":"30845DAA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sebastian","last_name":"Nijman","full_name":"Nijman, Sebastian"},{"full_name":"Grusch, Michael","last_name":"Grusch","first_name":"Michael"},{"orcid":"0000-0002-8023-9315","first_name":"Harald L","last_name":"Janovjak","full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"day":"12","oa_version":"Submitted Version","title":"Light-assisted small-molecule screening against protein kinases","volume":11,"date_created":"2018-12-11T11:53:25Z","has_accepted_license":"1","intvolume":"        11","abstract":[{"text":"High-throughput live-cell screens are intricate elements of systems biology studies and drug discovery pipelines. Here, we demonstrate an optogenetics-assisted method that avoids the need for chemical activators and reporters, reduces the number of operational steps and increases information content in a cell-based small-molecule screen against human protein kinases, including an orphan receptor tyrosine kinase. This blueprint for all-optical screening can be adapted to many drug targets and cellular processes.","lang":"eng"}],"publication_status":"published","file_date_updated":"2020-07-14T12:45:12Z","year":"2015","related_material":{"record":[{"id":"418","status":"public","relation":"dissertation_contains"}]},"publist_id":"5471","project":[{"name":"Microbial Ion Channels for Synthetic Neurobiology","grant_number":"303564","call_identifier":"FP7","_id":"25548C20-B435-11E9-9278-68D0E5697425"},{"_id":"255BFFFA-B435-11E9-9278-68D0E5697425","grant_number":"RGY0084/2012","name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors (HFSP Young Investigator)"},{"_id":"255A6082-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","name":"Molecular Drug Targets","call_identifier":"FWF"}],"status":"public","publication":"Nature Chemical Biology","ec_funded":1,"date_published":"2015-10-12T00:00:00Z","acknowledgement":"This work was supported by grants from the European Union Seventh Framework Programme (CIG-303564 to H.J. and ERC-StG-311166 to S.M.B.N.), the Human Frontier Science Program (RGY0084_2012 to H.J.) and the Herzfelder Foundation (to M.G.). A.I.-P. was supported by a Ramon Areces fellowship, and E.R. by the graduate program MolecularDrugTargets (Austrian Science Fund (FWF): W 1232) and a FemTech fellowship (3580812 Austrian Research Promotion Agency).","doi":"10.1038/nchembio.1933","publisher":"Nature Publishing Group","date_updated":"2023-09-07T12:49:09Z","_id":"1678","type":"journal_article","page":"952 - 954","ddc":["571"],"quality_controlled":"1"},{"publist_id":"5469","year":"2015","date_published":"2015-09-24T00:00:00Z","status":"public","publication":"Physics of Fluids","type":"journal_article","date_updated":"2021-01-12T06:52:28Z","_id":"1679","publisher":"American Institute of Physics","doi":"10.1063/1.4930850","quality_controlled":"1","ddc":["532"],"article_number":"091102","file":[{"date_updated":"2020-07-14T12:45:12Z","creator":"system","file_size":872366,"date_created":"2018-12-12T10:13:35Z","file_id":"5019","content_type":"application/pdf","access_level":"open_access","file_name":"IST-2017-748-v1+1_1.4930850.pdf","checksum":"604bba3c2496aadb3efcff77de01ce6c","relation":"main_file"}],"department":[{"_id":"BjHo"}],"month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"9","citation":{"ieee":"G. M. Lemoult, P. Maier, and B. Hof, “Taylor’s Forest,” <i>Physics of Fluids</i>, vol. 27, no. 9. American Institute of Physics, 2015.","short":"G.M. Lemoult, P. Maier, B. Hof, Physics of Fluids 27 (2015).","ama":"Lemoult GM, Maier P, Hof B. Taylor’s Forest. <i>Physics of Fluids</i>. 2015;27(9). doi:<a href=\"https://doi.org/10.1063/1.4930850\">10.1063/1.4930850</a>","apa":"Lemoult, G. M., Maier, P., &#38; Hof, B. (2015). Taylor’s Forest. <i>Physics of Fluids</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4930850\">https://doi.org/10.1063/1.4930850</a>","mla":"Lemoult, Grégoire M., et al. “Taylor’s Forest.” <i>Physics of Fluids</i>, vol. 27, no. 9, 091102, American Institute of Physics, 2015, doi:<a href=\"https://doi.org/10.1063/1.4930850\">10.1063/1.4930850</a>.","ista":"Lemoult GM, Maier P, Hof B. 2015. Taylor’s Forest. Physics of Fluids. 27(9), 091102.","chicago":"Lemoult, Grégoire M, Philipp Maier, and Björn Hof. “Taylor’s Forest.” <i>Physics of Fluids</i>. American Institute of Physics, 2015. <a href=\"https://doi.org/10.1063/1.4930850\">https://doi.org/10.1063/1.4930850</a>."},"pubrep_id":"748","language":[{"iso":"eng"}],"oa":1,"date_created":"2018-12-11T11:53:26Z","volume":27,"title":"Taylor's Forest","oa_version":"Published Version","author":[{"full_name":"Lemoult, Grégoire M","id":"4787FE80-F248-11E8-B48F-1D18A9856A87","last_name":"Lemoult","first_name":"Grégoire M"},{"first_name":"Philipp","full_name":"Maier, Philipp","id":"384F7C04-F248-11E8-B48F-1D18A9856A87","last_name":"Maier"},{"last_name":"Hof","full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","first_name":"Björn"}],"scopus_import":1,"day":"24","publication_status":"published","file_date_updated":"2020-07-14T12:45:12Z","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","image":"/images/cc_by.png","short":"CC BY (4.0)"},"intvolume":"        27","has_accepted_license":"1"},{"abstract":[{"text":"We consider the satisfiability problem for modal logic over first-order definable classes of frames.We confirm the conjecture from Hemaspaandra and Schnoor [2008] that modal logic is decidable over classes definable by universal Horn formulae. We provide a full classification of Horn formulae with respect to the complexity of the corresponding satisfiability problem. It turns out, that except for the trivial case of inconsistent formulae, local satisfiability is eitherNP-complete or PSPACE-complete, and global satisfiability is NP-complete, PSPACE-complete, or ExpTime-complete. We also show that the finite satisfiability problem for modal logic over Horn definable classes of frames is decidable. On the negative side, we show undecidability of two related problems. First, we exhibit a simple universal three-variable formula defining the class of frames over which modal logic is undecidable. Second, we consider the satisfiability problem of bimodal logic over Horn definable classes of frames, and also present a formula leading to undecidability.","lang":"eng"}],"intvolume":"        17","quality_controlled":"1","publication_status":"published","day":"01","doi":"10.1145/2817825","author":[{"first_name":"Jakub","full_name":"Michaliszyn, Jakub","last_name":"Michaliszyn"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"},{"first_name":"Emanuel","last_name":"Kieroňski","full_name":"Kieroňski, Emanuel"}],"publisher":"ACM","title":"On the decidability of elementary modal logics","oa_version":"None","_id":"1680","volume":17,"date_updated":"2021-01-12T06:52:29Z","date_created":"2018-12-11T11:53:26Z","type":"journal_article","publication":"ACM Transactions on Computational Logic","language":[{"iso":"eng"}],"status":"public","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"citation":{"ista":"Michaliszyn J, Otop J, Kieroňski E. 2015. On the decidability of elementary modal logics. ACM Transactions on Computational Logic. 17(1), 2.","chicago":"Michaliszyn, Jakub, Jan Otop, and Emanuel Kieroňski. “On the Decidability of Elementary Modal Logics.” <i>ACM Transactions on Computational Logic</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2817825\">https://doi.org/10.1145/2817825</a>.","apa":"Michaliszyn, J., Otop, J., &#38; Kieroňski, E. (2015). On the decidability of elementary modal logics. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/2817825\">https://doi.org/10.1145/2817825</a>","mla":"Michaliszyn, Jakub, et al. “On the Decidability of Elementary Modal Logics.” <i>ACM Transactions on Computational Logic</i>, vol. 17, no. 1, 2, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2817825\">10.1145/2817825</a>.","ama":"Michaliszyn J, Otop J, Kieroňski E. On the decidability of elementary modal logics. <i>ACM Transactions on Computational Logic</i>. 2015;17(1). doi:<a href=\"https://doi.org/10.1145/2817825\">10.1145/2817825</a>","ieee":"J. Michaliszyn, J. Otop, and E. Kieroňski, “On the decidability of elementary modal logics,” <i>ACM Transactions on Computational Logic</i>, vol. 17, no. 1. ACM, 2015.","short":"J. Michaliszyn, J. Otop, E. Kieroňski, ACM Transactions on Computational Logic 17 (2015)."},"issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-09-01T00:00:00Z","year":"2015","month":"09","department":[{"_id":"ToHe"}],"article_number":"2","publist_id":"5468"},{"quality_controlled":"1","page":"413 - 437","ddc":["000"],"date_updated":"2023-10-17T11:42:52Z","_id":"1681","type":"journal_article","doi":"10.3390/g6040413","article_processing_charge":"No","publisher":"MDPI","ec_funded":1,"date_published":"2015-09-29T00:00:00Z","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"status":"public","publication":"Games","publist_id":"5467","year":"2015","publication_identifier":{"eissn":["2073-4336"]},"publication_status":"published","file_date_updated":"2020-07-14T12:45:12Z","has_accepted_license":"1","intvolume":"         6","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","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"lang":"eng","text":"In many social situations, individuals endeavor to find the single best possible partner, but are constrained to evaluate the candidates in sequence. Examples include the search for mates, economic partnerships, or any other long-term ties where the choice to interact involves two parties. Surprisingly, however, previous theoretical work on mutual choice problems focuses on finding equilibrium solutions, while ignoring the evolutionary dynamics of decisions. Empirically, this may be of high importance, as some equilibrium solutions can never be reached unless the population undergoes radical changes and a sufficient number of individuals change their decisions simultaneously. To address this question, we apply a mutual choice sequential search problem in an evolutionary game-theoretical model that allows one to find solutions that are favored by evolution. As an example, we study the influence of sequential search on the evolutionary dynamics of cooperation. For this, we focus on the classic snowdrift game and the prisoner’s dilemma game."}],"volume":6,"article_type":"original","date_created":"2018-12-11T11:53:26Z","author":[{"last_name":"Priklopil","full_name":"Priklopil, Tadeas","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","first_name":"Tadeas"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","day":"29","title":"Evolution of decisions in population games with sequentially searching individuals","oa_version":"Published Version","issue":"4","citation":{"ama":"Priklopil T, Chatterjee K. Evolution of decisions in population games with sequentially searching individuals. <i>Games</i>. 2015;6(4):413-437. doi:<a href=\"https://doi.org/10.3390/g6040413\">10.3390/g6040413</a>","ieee":"T. Priklopil and K. Chatterjee, “Evolution of decisions in population games with sequentially searching individuals,” <i>Games</i>, vol. 6, no. 4. MDPI, pp. 413–437, 2015.","short":"T. Priklopil, K. Chatterjee, Games 6 (2015) 413–437.","ista":"Priklopil T, Chatterjee K. 2015. Evolution of decisions in population games with sequentially searching individuals. Games. 6(4), 413–437.","chicago":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” <i>Games</i>. MDPI, 2015. <a href=\"https://doi.org/10.3390/g6040413\">https://doi.org/10.3390/g6040413</a>.","apa":"Priklopil, T., &#38; Chatterjee, K. (2015). Evolution of decisions in population games with sequentially searching individuals. <i>Games</i>. MDPI. <a href=\"https://doi.org/10.3390/g6040413\">https://doi.org/10.3390/g6040413</a>","mla":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” <i>Games</i>, vol. 6, no. 4, MDPI, 2015, pp. 413–37, doi:<a href=\"https://doi.org/10.3390/g6040413\">10.3390/g6040413</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"pubrep_id":"448","department":[{"_id":"NiBa"},{"_id":"KrCh"}],"file":[{"file_id":"4959","file_size":518832,"date_created":"2018-12-12T10:12:41Z","creator":"system","date_updated":"2020-07-14T12:45:12Z","relation":"main_file","checksum":"912e1acbaf201100f447a43e4d5958bd","file_name":"IST-2016-448-v1+1_games-06-00413.pdf","content_type":"application/pdf","access_level":"open_access"}],"month":"09"},{"date_created":"2018-12-11T11:53:27Z","type":"journal_article","_id":"1682","volume":62,"date_updated":"2021-01-12T06:52:30Z","publisher":"ACM","oa_version":"Preprint","title":"Robust satisfiability of systems of equations","scopus_import":1,"day":"01","doi":"10.1145/2751524","author":[{"full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter"},{"first_name":"Marek","last_name":"Krcál","id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek"}],"quality_controlled":"1","publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.0858"}],"abstract":[{"lang":"eng","text":"We study the problem of robust satisfiability of systems of nonlinear equations, namely, whether for a given continuous function f:K→ ℝn on a finite simplicial complex K and α &gt; 0, it holds that each function g: K → ℝn such that ||g - f || ∞ &lt; α, has a root in K. Via a reduction to the extension problem of maps into a sphere, we particularly show that this problem is decidable in polynomial time for every fixed n, assuming dimK ≤ 2n - 3. This is a substantial extension of previous computational applications of topological degree and related concepts in numerical and interval analysis. Via a reverse reduction, we prove that the problem is undecidable when dim K &gt; 2n - 2, where the threshold comes from the stable range in homotopy theory. For the lucidity of our exposition, we focus on the setting when f is simplexwise linear. Such functions can approximate general continuous functions, and thus we get approximation schemes and undecidability of the robust satisfiability in other possible settings."}],"intvolume":"        62","article_number":"26","publist_id":"5466","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"month":"08","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-08-01T00:00:00Z","citation":{"chicago":"Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” <i>Journal of the ACM</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2751524\">https://doi.org/10.1145/2751524</a>.","ista":"Franek P, Krcál M. 2015. Robust satisfiability of systems of equations. Journal of the ACM. 62(4), 26.","mla":"Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” <i>Journal of the ACM</i>, vol. 62, no. 4, 26, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2751524\">10.1145/2751524</a>.","apa":"Franek, P., &#38; Krcál, M. (2015). Robust satisfiability of systems of equations. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2751524\">https://doi.org/10.1145/2751524</a>","ama":"Franek P, Krcál M. Robust satisfiability of systems of equations. <i>Journal of the ACM</i>. 2015;62(4). doi:<a href=\"https://doi.org/10.1145/2751524\">10.1145/2751524</a>","short":"P. Franek, M. Krcál, Journal of the ACM 62 (2015).","ieee":"P. Franek and M. Krcál, “Robust satisfiability of systems of equations,” <i>Journal of the ACM</i>, vol. 62, no. 4. ACM, 2015."},"issue":"4","publication":"Journal of the ACM","language":[{"iso":"eng"}],"status":"public","oa":1},{"date_created":"2018-12-11T11:53:27Z","type":"journal_article","volume":33,"_id":"1683","date_updated":"2021-01-12T06:52:30Z","title":"Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions","oa_version":"None","publisher":"Elsevier","scopus_import":1,"day":"01","doi":"10.1016/j.sbi.2015.08.008","author":[{"orcid":"0000-0002-9864-3586","first_name":"Jame A","last_name":"Letts","full_name":"Letts, Jame A","id":"322DA418-F248-11E8-B48F-1D18A9856A87"},{"id":"338D39FE-F248-11E8-B48F-1D18A9856A87","full_name":"Sazanov, Leonid A","last_name":"Sazanov","orcid":"0000-0002-0977-7989","first_name":"Leonid A"}],"publication_status":"published","quality_controlled":"1","intvolume":"        33","abstract":[{"lang":"eng","text":"The 1 MDa, 45-subunit proton-pumping NADH-ubiquinone oxidoreductase (complex I) is the largest complex of the mitochondrial electron transport chain. The molecular mechanism of complex I is central to the metabolism of cells, but has yet to be fully characterized. The last two years have seen steady progress towards this goal with the first atomic-resolution structure of the entire bacterial complex I, a 5 Å cryo-electron microscopy map of bovine mitochondrial complex I and a ∼3.8 Å resolution X-ray crystallographic study of mitochondrial complex I from yeast Yarrowia lipotytica. In this review we will discuss what we have learned from these studies and what remains to be elucidated."}],"page":"135 - 145","publist_id":"5465","department":[{"_id":"LeSa"}],"month":"08","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-08-01T00:00:00Z","citation":{"mla":"Letts, James A., and Leonid A. Sazanov. “Gaining Mass: The Structure of Respiratory Complex I-from Bacterial towards Mitochondrial Versions.” <i>Current Opinion in Structural Biology</i>, vol. 33, no. 8, Elsevier, 2015, pp. 135–45, doi:<a href=\"https://doi.org/10.1016/j.sbi.2015.08.008\">10.1016/j.sbi.2015.08.008</a>.","apa":"Letts, J. A., &#38; Sazanov, L. A. (2015). Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions. <i>Current Opinion in Structural Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.sbi.2015.08.008\">https://doi.org/10.1016/j.sbi.2015.08.008</a>","chicago":"Letts, James A, and Leonid A Sazanov. “Gaining Mass: The Structure of Respiratory Complex I-from Bacterial towards Mitochondrial Versions.” <i>Current Opinion in Structural Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.sbi.2015.08.008\">https://doi.org/10.1016/j.sbi.2015.08.008</a>.","ista":"Letts JA, Sazanov LA. 2015. Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions. Current Opinion in Structural Biology. 33(8), 135–145.","short":"J.A. Letts, L.A. Sazanov, Current Opinion in Structural Biology 33 (2015) 135–145.","ieee":"J. A. Letts and L. A. Sazanov, “Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions,” <i>Current Opinion in Structural Biology</i>, vol. 33, no. 8. Elsevier, pp. 135–145, 2015.","ama":"Letts JA, Sazanov LA. Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions. <i>Current Opinion in Structural Biology</i>. 2015;33(8):135-145. doi:<a href=\"https://doi.org/10.1016/j.sbi.2015.08.008\">10.1016/j.sbi.2015.08.008</a>"},"issue":"8","language":[{"iso":"eng"}],"status":"public","publication":"Current Opinion in Structural Biology"},{"department":[{"_id":"UlWa"}],"month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Cohen Addad, V., &#38; de Mesmay, A. N. (2015). A fixed parameter tractable approximation scheme for the optimal cut graph of a surface (Vol. 9294, pp. 386–398). Presented at the ESA: European Symposium on Algorithms, Patras, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48350-3_33\">https://doi.org/10.1007/978-3-662-48350-3_33</a>","mla":"Cohen Addad, Vincent, and Arnaud N. de Mesmay. <i>A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface</i>. Vol. 9294, Springer, 2015, pp. 386–98, doi:<a href=\"https://doi.org/10.1007/978-3-662-48350-3_33\">10.1007/978-3-662-48350-3_33</a>.","ista":"Cohen Addad V, de Mesmay AN. 2015. A fixed parameter tractable approximation scheme for the optimal cut graph of a surface. ESA: European Symposium on Algorithms, LNCS, vol. 9294, 386–398.","chicago":"Cohen Addad, Vincent, and Arnaud N de Mesmay. “A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface,” 9294:386–98. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48350-3_33\">https://doi.org/10.1007/978-3-662-48350-3_33</a>.","ieee":"V. Cohen Addad and A. N. de Mesmay, “A fixed parameter tractable approximation scheme for the optimal cut graph of a surface,” presented at the ESA: European Symposium on Algorithms, Patras, Greece, 2015, vol. 9294, pp. 386–398.","short":"V. Cohen Addad, A.N. de Mesmay, in:, Springer, 2015, pp. 386–398.","ama":"Cohen Addad V, de Mesmay AN. A fixed parameter tractable approximation scheme for the optimal cut graph of a surface. In: Vol 9294. Springer; 2015:386-398. doi:<a href=\"https://doi.org/10.1007/978-3-662-48350-3_33\">10.1007/978-3-662-48350-3_33</a>"},"language":[{"iso":"eng"}],"oa":1,"date_created":"2018-12-11T11:53:27Z","volume":9294,"title":"A fixed parameter tractable approximation scheme for the optimal cut graph of a surface","oa_version":"Preprint","author":[{"full_name":"Cohen Addad, Vincent","last_name":"Cohen Addad","first_name":"Vincent"},{"full_name":"De Mesmay, Arnaud N","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","last_name":"De Mesmay","first_name":"Arnaud N"}],"scopus_import":1,"day":"01","publication_status":"published","abstract":[{"text":"Given a graph G cellularly embedded on a surface Σ of genus g, a cut graph is a subgraph of G such that cutting Σ along G yields a topological disk. We provide a fixed parameter tractable approximation scheme for the problem of computing the shortest cut graph, that is, for any ε &gt; 0, we show how to compute a (1 + ε) approximation of the shortest cut graph in time f(ε, g)n3.\r\nOur techniques first rely on the computation of a spanner for the problem using the technique of brick decompositions, to reduce the problem to the case of bounded tree-width. Then, to solve the bounded tree-width case, we introduce a variant of the surface-cut decomposition of Rué, Sau and Thilikos, which may be of independent interest.","lang":"eng"}],"intvolume":"      9294","publist_id":"5462","year":"2015","conference":{"end_date":"2015-09-16","start_date":"2015-09-14","name":"ESA: European Symposium on Algorithms","location":"Patras, Greece"},"date_published":"2015-09-01T00:00:00Z","ec_funded":1,"project":[{"call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"status":"public","type":"conference","date_updated":"2021-01-12T06:52:31Z","_id":"1685","publisher":"Springer","doi":"10.1007/978-3-662-48350-3_33","alternative_title":["LNCS"],"quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1507.01688","open_access":"1"}],"page":"386 - 398"},{"intvolume":"       349","page":"1055 - 1056","publication_status":"published","quality_controlled":"1","publisher":"American Association for the Advancement of Science","title":"Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection","oa_version":"None","scopus_import":1,"day":"04","doi":"10.1126/science.aad0867","author":[{"last_name":"Kiermaier","full_name":"Kiermaier, Eva","id":"3EB04B78-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6165-5738","first_name":"Eva"},{"orcid":"0000-0002-6620-9179","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","last_name":"Sixt"}],"date_created":"2018-12-11T11:53:28Z","type":"journal_article","_id":"1686","volume":349,"date_updated":"2021-01-12T06:52:31Z","status":"public","language":[{"iso":"eng"}],"publication":"Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-09-04T00:00:00Z","citation":{"ista":"Kiermaier E, Sixt MK. 2015. Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection. Science. 349(6252), 1055–1056.","chicago":"Kiermaier, Eva, and Michael K Sixt. “Fragmented Communication between Immune Cells: Neutrophils Blaze a Trail with Migratory Cues for T Cells to Follow to Sites of Infection.” <i>Science</i>. American Association for the Advancement of Science, 2015. <a href=\"https://doi.org/10.1126/science.aad0867\">https://doi.org/10.1126/science.aad0867</a>.","apa":"Kiermaier, E., &#38; Sixt, M. K. (2015). Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aad0867\">https://doi.org/10.1126/science.aad0867</a>","mla":"Kiermaier, Eva, and Michael K. Sixt. “Fragmented Communication between Immune Cells: Neutrophils Blaze a Trail with Migratory Cues for T Cells to Follow to Sites of Infection.” <i>Science</i>, vol. 349, no. 6252, American Association for the Advancement of Science, 2015, pp. 1055–56, doi:<a href=\"https://doi.org/10.1126/science.aad0867\">10.1126/science.aad0867</a>.","ama":"Kiermaier E, Sixt MK. Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection. <i>Science</i>. 2015;349(6252):1055-1056. doi:<a href=\"https://doi.org/10.1126/science.aad0867\">10.1126/science.aad0867</a>","ieee":"E. Kiermaier and M. K. Sixt, “Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection,” <i>Science</i>, vol. 349, no. 6252. American Association for the Advancement of Science, pp. 1055–1056, 2015.","short":"E. Kiermaier, M.K. Sixt, Science 349 (2015) 1055–1056."},"issue":"6252","month":"09","year":"2015","publist_id":"5459","department":[{"_id":"MiSi"}]},{"ec_funded":1,"date_published":"2015-10-01T00:00:00Z","project":[{"_id":"25A603A2-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"281556","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)"}],"publication":"Current Opinion in Cell Biology","status":"public","publist_id":"5458","year":"2015","quality_controlled":"1","page":"93 - 102","ddc":["570"],"date_updated":"2021-01-12T06:52:31Z","_id":"1687","type":"journal_article","doi":"10.1016/j.ceb.2015.08.001","publisher":"Elsevier","issue":"10","citation":{"ista":"Sarris M, Sixt MK. 2015. Navigating in tissue mazes: Chemoattractant interpretation in complex environments. Current Opinion in Cell Biology. 36(10), 93–102.","chicago":"Sarris, Milka, and Michael K Sixt. “Navigating in Tissue Mazes: Chemoattractant Interpretation in Complex Environments.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ceb.2015.08.001\">https://doi.org/10.1016/j.ceb.2015.08.001</a>.","mla":"Sarris, Milka, and Michael K. Sixt. “Navigating in Tissue Mazes: Chemoattractant Interpretation in Complex Environments.” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10, Elsevier, 2015, pp. 93–102, doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.08.001\">10.1016/j.ceb.2015.08.001</a>.","apa":"Sarris, M., &#38; Sixt, M. K. (2015). Navigating in tissue mazes: Chemoattractant interpretation in complex environments. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2015.08.001\">https://doi.org/10.1016/j.ceb.2015.08.001</a>","ama":"Sarris M, Sixt MK. Navigating in tissue mazes: Chemoattractant interpretation in complex environments. <i>Current Opinion in Cell Biology</i>. 2015;36(10):93-102. doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.08.001\">10.1016/j.ceb.2015.08.001</a>","short":"M. Sarris, M.K. Sixt, Current Opinion in Cell Biology 36 (2015) 93–102.","ieee":"M. Sarris and M. K. Sixt, “Navigating in tissue mazes: Chemoattractant interpretation in complex environments,” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10. Elsevier, pp. 93–102, 2015."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"pubrep_id":"445","department":[{"_id":"MiSi"}],"file":[{"access_level":"open_access","content_type":"application/pdf","file_name":"IST-2016-445-v1+1_1-s2.0-S0955067415001064-main.pdf","checksum":"c29973924b790aab02fdd91857759cfb","relation":"main_file","date_updated":"2020-07-14T12:45:12Z","creator":"system","date_created":"2018-12-12T10:11:21Z","file_size":797964,"file_id":"4875"}],"month":"10","publication_status":"published","file_date_updated":"2020-07-14T12:45:12Z","has_accepted_license":"1","intvolume":"        36","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","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"lang":"eng","text":"Guided cell movement is essential for development and integrity of animals and crucially involved in cellular immune responses. Leukocytes are professional migratory cells that can navigate through most types of tissues and sense a wide range of directional cues. The responses of these cells to attractants have been mainly explored in tissue culture settings. How leukocytes make directional decisions in situ, within the challenging environment of a tissue maze, is less understood. Here we review recent advances in how leukocytes sense chemical cues in complex tissue settings and make links with paradigms of directed migration in development and Dictyostelium discoideum amoebae."}],"volume":36,"date_created":"2018-12-11T11:53:28Z","author":[{"first_name":"Milka","last_name":"Sarris","full_name":"Sarris, Milka"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179","first_name":"Michael K"}],"scopus_import":1,"day":"01","title":"Navigating in tissue mazes: Chemoattractant interpretation in complex environments","oa_version":"Published Version"},{"acknowledgement":"R. K. was supported by the Russian Foundation for Basic Research Grant 15-31-20403 (mol_a_ved) and grant 15-01-99563. J. K., Z. P., and M. T. were partially supported by ERC Advanced Research Grant No. 267165 (DISCONV) and by the project CE-ITI (GAČR P202/12/G061) of the Czech Science Foundation. J. K. was also partially supported by Swiss National Science Foundation Grants 200021-137574 and 200020-14453. P. P., Z. P., and M. T. were partially supported by the Charles University Grant GAUK 421511. P. P. was also partially supported by the Charles University Grant SVV-2014-260107. Z. P. was also partially supported by the Charles University Grant SVV-2014-260103.","date_published":"2015-10-01T00:00:00Z","publication":"Discrete & Computational Geometry","status":"public","publist_id":"5457","year":"2015","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1403.8147"}],"quality_controlled":"1","page":"610 - 636","_id":"1688","date_updated":"2021-01-12T06:52:32Z","type":"journal_article","doi":"10.1007/s00454-015-9720-z","publisher":"Springer","citation":{"ama":"Karasev R, Kynčl J, Paták P, Patakova Z, Tancer M. Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. <i>Discrete &#38; Computational Geometry</i>. 2015;54(3):610-636. doi:<a href=\"https://doi.org/10.1007/s00454-015-9720-z\">10.1007/s00454-015-9720-z</a>","short":"R. Karasev, J. Kynčl, P. Paták, Z. Patakova, M. Tancer, Discrete &#38; Computational Geometry 54 (2015) 610–636.","ieee":"R. Karasev, J. Kynčl, P. Paták, Z. Patakova, and M. Tancer, “Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex,” <i>Discrete &#38; Computational Geometry</i>, vol. 54, no. 3. Springer, pp. 610–636, 2015.","chicago":"Karasev, Roman, Jan Kynčl, Pavel Paták, Zuzana Patakova, and Martin Tancer. “Bounds for Pach’s Selection Theorem and for the Minimum Solid Angle in a Simplex.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00454-015-9720-z\">https://doi.org/10.1007/s00454-015-9720-z</a>.","ista":"Karasev R, Kynčl J, Paták P, Patakova Z, Tancer M. 2015. Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete &#38; Computational Geometry. 54(3), 610–636.","mla":"Karasev, Roman, et al. “Bounds for Pach’s Selection Theorem and for the Minimum Solid Angle in a Simplex.” <i>Discrete &#38; Computational Geometry</i>, vol. 54, no. 3, Springer, 2015, pp. 610–36, doi:<a href=\"https://doi.org/10.1007/s00454-015-9720-z\">10.1007/s00454-015-9720-z</a>.","apa":"Karasev, R., Kynčl, J., Paták, P., Patakova, Z., &#38; Tancer, M. (2015). Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-015-9720-z\">https://doi.org/10.1007/s00454-015-9720-z</a>"},"issue":"3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"UlWa"}],"month":"10","publication_status":"published","intvolume":"        54","abstract":[{"lang":"eng","text":"We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant (Formula presented.) such that whenever (Formula presented.) are n-element subsets of (Formula presented.), we can find a point (Formula presented.) and subsets (Formula presented.) for every i∈[d+1], each of size at least cdn, such that p belongs to all rainbowd-simplices determined by (Formula presented.) simplices with one vertex in each Yi. We show a super-exponentially decreasing upper bound (Formula presented.). The ideas used in the proof of the upper bound also help us to prove Pach’s theorem with (Formula presented.), which is a lower bound doubly exponentially decreasing in d (up to some polynomial in the exponent). For comparison, Pach’s original approach yields a triply exponentially decreasing lower bound. On the other hand, Fox, Pach, and Suk recently obtained a hypergraph density result implying a proof of Pach’s theorem with (Formula presented.). In our construction for the upper bound, we use the fact that the minimum solid angle of every d-simplex is super-exponentially small. This fact was previously unknown and might be of independent interest. For the lower bound, we improve the ‘separation’ part of the argument by showing that in one of the key steps only d+1 separations are necessary, compared to 2d separations in the original proof. We also provide a measure version of Pach’s theorem."}],"volume":54,"date_created":"2018-12-11T11:53:28Z","scopus_import":1,"day":"01","author":[{"full_name":"Karasev, Roman","last_name":"Karasev","first_name":"Roman"},{"first_name":"Jan","last_name":"Kynčl","full_name":"Kynčl, Jan"},{"first_name":"Pavel","full_name":"Paták, Pavel","last_name":"Paták"},{"first_name":"Zuzana","orcid":"0000-0002-3975-1683","last_name":"Patakova","full_name":"Patakova, Zuzana"},{"last_name":"Tancer","full_name":"Tancer, Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","first_name":"Martin"}],"title":"Bounds for Pach's selection theorem and for the minimum solid angle in a simplex","oa_version":"Preprint"},{"day":"14","scopus_import":1,"doi":"10.1145/2728606.2728608","author":[{"first_name":"Mária","last_name":"Svoreňová","full_name":"Svoreňová, Mária"},{"last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","first_name":"Jan"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Ivana","full_name":"Cěrná, Ivana","last_name":"Cěrná"},{"last_name":"Belta","full_name":"Belta, Cǎlin","first_name":"Cǎlin"}],"oa_version":"Preprint","publisher":"ACM","title":"Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games","_id":"1689","date_updated":"2023-09-20T09:43:09Z","date_created":"2018-12-11T11:53:29Z","type":"conference","page":"259 - 268","abstract":[{"lang":"eng","text":"We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. We demonstrate our approach on an illustrative case study."}],"main_file_link":[{"url":"http://arxiv.org/abs/1410.5387","open_access":"1"}],"publication_status":"published","year":"2015","related_material":{"record":[{"relation":"later_version","status":"public","id":"1407"}]},"month":"04","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publist_id":"5456","oa":1,"publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","language":[{"iso":"eng"}],"status":"public","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"citation":{"ama":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In: <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>. ACM; 2015:259-268. doi:<a href=\"https://doi.org/10.1145/2728606.2728608\">10.1145/2728606.2728608</a>","ieee":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” in <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, Seattle, WA, United States, 2015, pp. 259–268.","short":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–268.","ista":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 259–268.","chicago":"Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” In <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, 259–68. ACM, 2015. <a href=\"https://doi.org/10.1145/2728606.2728608\">https://doi.org/10.1145/2728606.2728608</a>.","apa":"Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., &#38; Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i> (pp. 259–268). Seattle, WA, United States: ACM. <a href=\"https://doi.org/10.1145/2728606.2728608\">https://doi.org/10.1145/2728606.2728608</a>","mla":"Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, ACM, 2015, pp. 259–68, doi:<a href=\"https://doi.org/10.1145/2728606.2728608\">10.1145/2728606.2728608</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Seattle, WA, United States","name":"HSCC: Hybrid Systems - Computation and Control","end_date":"2015-04-16","start_date":"2015-04-14"},"date_published":"2015-04-14T00:00:00Z"},{"publisher":"Springer","oa_version":"None","title":"HYST: A source transformation and translation tool for hybrid automaton models","day":"14","doi":"10.1145/2728606.2728630","author":[{"first_name":"Stanley","full_name":"Bak, Stanley","last_name":"Bak"},{"last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","first_name":"Sergiy"},{"first_name":"Taylor","last_name":"Johnson","full_name":"Johnson, Taylor"}],"date_created":"2018-12-11T11:53:29Z","type":"conference","_id":"1690","date_updated":"2021-01-12T06:52:33Z","abstract":[{"text":"A number of powerful and scalable hybrid systems model checkers have recently emerged. Although all of them honor roughly the same hybrid systems semantics, they have drastically different model description languages. This situation (a) makes it difficult to quickly evaluate a specific hybrid automaton model using the different tools, (b) obstructs comparisons of reachability approaches, and (c) impedes the widespread application of research results that perform model modification and could benefit many of the tools. In this paper, we present Hyst, a Hybrid Source Transformer. Hyst is a source-to-source translation tool, currently taking input in the SpaceEx model format, and translating to the formats of HyCreate, Flow∗, or dReach. Internally, the tool supports generic model-to-model transformation passes that serve to both ease the translation and potentially improve reachability results for the supported tools. Although these model transformation passes could be implemented within each tool, the Hyst approach provides a single place for model modification, generating modified input sources for the unmodified target tools. Our evaluation demonstrates Hyst is capable of automatically translating benchmarks in several classes (including affine and nonlinear hybrid automata) to the input formats of several tools. Additionally, we illustrate a general model transformation pass based on pseudo-invariants implemented in Hyst that illustrates the reachability improvement.","lang":"eng"}],"page":"128 - 133","publication_status":"published","quality_controlled":"1","month":"04","year":"2015","publist_id":"5454","department":[{"_id":"ToHe"}],"status":"public","language":[{"iso":"eng"}],"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-04-14T00:00:00Z","conference":{"location":"Seattle, WA, United States","start_date":"2015-04-14","end_date":"2015-04-16","name":"HSCC: Hybrid Systems - Computation and Control"},"acknowledgement":"The material presented in this paper is based upon work sup-ported by the Air Force Research Laboratory’s Information Directorate (AFRL/RI) through the Visiting Faculty Research Program (VFRP) under contract number FA8750-13-2-0115 and the Air Force Office of Scientific Research (AFOSR). Any opinions,findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of the AFRL/RI or AFOSR. This work was also partly supported in part by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR14 AVACS, http://www.avacs.org/), by the European Research Council (ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award).","ec_funded":1,"citation":{"short":"S. Bak, S. Bogomolov, T. Johnson, in:, Springer, 2015, pp. 128–133.","ieee":"S. Bak, S. Bogomolov, and T. Johnson, “HYST: A source transformation and translation tool for hybrid automaton models,” presented at the HSCC: Hybrid Systems - Computation and Control, Seattle, WA, United States, 2015, pp. 128–133.","ama":"Bak S, Bogomolov S, Johnson T. HYST: A source transformation and translation tool for hybrid automaton models. In: Springer; 2015:128-133. doi:<a href=\"https://doi.org/10.1145/2728606.2728630\">10.1145/2728606.2728630</a>","mla":"Bak, Stanley, et al. <i>HYST: A Source Transformation and Translation Tool for Hybrid Automaton Models</i>. Springer, 2015, pp. 128–33, doi:<a href=\"https://doi.org/10.1145/2728606.2728630\">10.1145/2728606.2728630</a>.","apa":"Bak, S., Bogomolov, S., &#38; Johnson, T. (2015). HYST: A source transformation and translation tool for hybrid automaton models (pp. 128–133). Presented at the HSCC: Hybrid Systems - Computation and Control, Seattle, WA, United States: Springer. <a href=\"https://doi.org/10.1145/2728606.2728630\">https://doi.org/10.1145/2728606.2728630</a>","chicago":"Bak, Stanley, Sergiy Bogomolov, and Taylor Johnson. “HYST: A Source Transformation and Translation Tool for Hybrid Automaton Models,” 128–33. Springer, 2015. <a href=\"https://doi.org/10.1145/2728606.2728630\">https://doi.org/10.1145/2728606.2728630</a>.","ista":"Bak S, Bogomolov S, Johnson T. 2015. HYST: A source transformation and translation tool for hybrid automaton models. HSCC: Hybrid Systems - Computation and Control, 128–133."}}]