[{"file":[{"creator":"dernst","file_size":397363,"content_type":"application/pdf","file_name":"2015_CRYPTO_Alwen.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:11Z","date_created":"2020-05-15T08:55:29Z","checksum":"5b6649e80d1f781a8910f7cce6427f78","file_id":"7853","relation":"main_file"}],"oa_version":"Submitted Version","_id":"1672","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 9216","ddc":["000"],"status":"public","title":"Incoercible multi-party computation and universally composable receipt-free voting","abstract":[{"lang":"eng","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."}],"type":"conference","alternative_title":["LNCS"],"date_published":"2015-08-01T00:00:00Z","citation":{"ama":"Alwen JF, Ostrovsky R, Zhou H, Zikas V. Incoercible multi-party computation and universally composable receipt-free voting. In: Advances in Cryptology - CRYPTO 2015. Vol 9216. Lecture Notes in Computer Science. Springer; 2015:763-780. doi:10.1007/978-3-662-48000-7_37","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.","apa":"Alwen, J. F., Ostrovsky, R., Zhou, H., & Zikas, V. (2015). Incoercible multi-party computation and universally composable receipt-free voting. In Advances in Cryptology - CRYPTO 2015 (Vol. 9216, pp. 763–780). Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-48000-7_37","ieee":"J. F. Alwen, R. Ostrovsky, H. Zhou, and V. Zikas, “Incoercible multi-party computation and universally composable receipt-free voting,” in Advances in Cryptology - CRYPTO 2015, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 763–780.","mla":"Alwen, Joel F., et al. “Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting.” Advances in Cryptology - CRYPTO 2015, vol. 9216, Springer, 2015, pp. 763–80, doi:10.1007/978-3-662-48000-7_37.","short":"J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, in:, Advances in Cryptology - CRYPTO 2015, Springer, 2015, pp. 763–780.","chicago":"Alwen, Joel F, Rafail Ostrovsky, Hongsheng Zhou, and Vassilis Zikas. “Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting.” In Advances in Cryptology - CRYPTO 2015, 9216:763–80. Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-48000-7_37."},"publication":"Advances in Cryptology - CRYPTO 2015","page":"763 - 780","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","series_title":"Lecture Notes in Computer Science","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F"},{"full_name":"Ostrovsky, Rafail","first_name":"Rafail","last_name":"Ostrovsky"},{"full_name":"Zhou, Hongsheng","first_name":"Hongsheng","last_name":"Zhou"},{"last_name":"Zikas","first_name":"Vassilis","full_name":"Zikas, Vassilis"}],"volume":9216,"date_updated":"2022-06-07T09:51:55Z","date_created":"2018-12-11T11:53:23Z","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.","year":"2015","publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published","publist_id":"5476","ec_funded":1,"file_date_updated":"2020-07-14T12:45:11Z","doi":"10.1007/978-3-662-48000-7_37","conference":{"name":"CRYPTO: International Cryptology Conference","location":"Santa Barbara, CA, United States","start_date":"2015-08-16","end_date":"2015-08-20"},"language":[{"iso":"eng"}],"oa":1,"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"quality_controlled":"1","publication_identifier":{"isbn":["978-3-662-47999-5"],"eisbn":["978-3-662-48000-7"]},"month":"08"},{"scopus_import":1,"series_title":"Lecture Notes in Computer Science","day":"15","has_accepted_license":"1","citation":{"short":"K.Z. Pietrzak, M. Skórski, 9230 (2015) 81–98.","mla":"Pietrzak, Krzysztof Z., and Maciej Skórski. The Chain Rule for HILL Pseudoentropy, Revisited. Vol. 9230, Springer, 2015, pp. 81–98, doi:10.1007/978-3-319-22174-8_5.","chicago":"Pietrzak, Krzysztof Z, and Maciej Skórski. “The Chain Rule for HILL Pseudoentropy, Revisited.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-22174-8_5.","ama":"Pietrzak KZ, Skórski M. The chain rule for HILL pseudoentropy, revisited. 2015;9230:81-98. doi:10.1007/978-3-319-22174-8_5","apa":"Pietrzak, K. Z., & Skórski, M. (2015). The chain rule for HILL pseudoentropy, revisited. Presented at the LATINCRYPT: Cryptology and Information Security in Latin America, Guadalajara, Mexico: Springer. https://doi.org/10.1007/978-3-319-22174-8_5","ieee":"K. Z. Pietrzak and M. Skórski, “The chain rule for HILL pseudoentropy, revisited,” vol. 9230. Springer, pp. 81–98, 2015.","ista":"Pietrzak KZ, Skórski M. 2015. The chain rule for HILL pseudoentropy, revisited. 9230, 81–98."},"page":"81 - 98","date_published":"2015-08-15T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Computational notions of entropy (a.k.a. pseudoentropy) have found many applications, including leakage-resilient cryptography, deterministic encryption or memory delegation. The most important tools to argue about pseudoentropy are chain rules, which quantify by how much (in terms of quantity and quality) the pseudoentropy of a given random variable X decreases when conditioned on some other variable Z (think for example of X as a secret key and Z as information leaked by a side-channel). In this paper we give a very simple and modular proof of the chain rule for HILL pseudoentropy, improving best known parameters. Our version allows for increasing the acceptable length of leakage in applications up to a constant factor compared to the best previous bounds. As a contribution of independent interest, we provide a comprehensive study of all known versions of the chain rule, comparing their worst-case strength and limitations."}],"_id":"1669","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["005"],"title":"The chain rule for HILL pseudoentropy, revisited","intvolume":" 9230","pubrep_id":"669","oa_version":"Submitted Version","file":[{"file_name":"IST-2016-669-v1+1_599.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":443340,"file_id":"5351","relation":"main_file","date_updated":"2020-07-14T12:45:11Z","date_created":"2018-12-12T10:18:29Z","checksum":"8cd4215b83efba720e8cf27c23ff4781"}],"month":"08","oa":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"conference":{"end_date":"2015-08-26","start_date":"2015-08-23","location":"Guadalajara, Mexico","name":"LATINCRYPT: Cryptology and Information Security in Latin America"},"doi":"10.1007/978-3-319-22174-8_5","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:11Z","ec_funded":1,"publist_id":"5480","year":"2015","publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"author":[{"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":"Maciej","last_name":"Skórski","full_name":"Skórski, Maciej"}],"date_created":"2018-12-11T11:53:22Z","date_updated":"2021-01-12T06:52:24Z","volume":9230},{"intvolume":" 9215","title":"The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC","status":"public","ddc":["004","005"],"_id":"1671","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"17d854227b3b753fd34f5d29e5b5a32e","date_created":"2018-12-12T10:10:38Z","date_updated":"2020-07-14T12:45:11Z","file_id":"4827","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":592296,"access_level":"open_access","file_name":"IST-2016-673-v1+1_053.pdf"}],"oa_version":"Submitted Version","pubrep_id":"673","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","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."}],"page":"368 - 387","citation":{"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. https://doi.org/10.1007/978-3-662-47989-6_18.","mla":"Gazi, Peter, et al. The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC. Vol. 9215, Springer, 2015, pp. 368–87, doi:10.1007/978-3-662-47989-6_18.","short":"P. Gazi, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2015, pp. 368–387.","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.","apa":"Gazi, P., Pietrzak, K. Z., & 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. https://doi.org/10.1007/978-3-662-47989-6_18","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.","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:10.1007/978-3-662-47989-6_18"},"date_published":"2015-08-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","department":[{"_id":"KrPi"}],"publisher":"Springer","publication_status":"published","year":"2015","volume":9215,"date_created":"2018-12-11T11:53:23Z","date_updated":"2021-01-12T06:52:25Z","author":[{"last_name":"Gazi","first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter"},{"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":"Stefano","last_name":"Tessaro","full_name":"Tessaro, Stefano"}],"ec_funded":1,"publist_id":"5478","file_date_updated":"2020-07-14T12:45:11Z","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-47989-6_18","conference":{"name":"CRYPTO: International Cryptology Conference","end_date":"2015-08-20","start_date":"2015-08-16","location":"Santa Barbara, CA, United States"},"month":"08"},{"volume":471,"date_created":"2018-12-11T11:53:24Z","date_updated":"2021-01-12T06:52:26Z","author":[{"first_name":"Ben","last_name":"Adlam","full_name":"Adlam, Ben"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"department":[{"_id":"KrCh"}],"publisher":"Royal Society of London","publication_status":"published","year":"2015","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). ","ec_funded":1,"publist_id":"5477","file_date_updated":"2020-07-14T12:45:11Z","article_number":"20150114","language":[{"iso":"eng"}],"doi":"10.1098/rspa.2015.0114","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"quality_controlled":"1","oa":1,"month":"09","file":[{"file_name":"2015_rspa_Adlam.pdf","access_level":"open_access","creator":"kschuh","content_type":"application/pdf","file_size":391466,"file_id":"6342","relation":"main_file","date_updated":"2020-07-14T12:45:11Z","date_created":"2019-04-18T12:39:56Z","checksum":"e613d94d283c776322403a28aad11bdd"}],"oa_version":"Published Version","intvolume":" 471","ddc":["000"],"title":"Amplifiers of selection","status":"public","_id":"1673","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","issue":"2181","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"}],"type":"journal_article","date_published":"2015-09-08T00:00:00Z","citation":{"chicago":"Adlam, Ben, Krishnendu Chatterjee, and Martin Nowak. “Amplifiers of Selection.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2015. https://doi.org/10.1098/rspa.2015.0114.","short":"B. Adlam, K. Chatterjee, M. Nowak, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471 (2015).","mla":"Adlam, Ben, et al. “Amplifiers of Selection.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no. 2181, 20150114, Royal Society of London, 2015, doi:10.1098/rspa.2015.0114.","apa":"Adlam, B., Chatterjee, K., & Nowak, M. (2015). Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London. https://doi.org/10.1098/rspa.2015.0114","ieee":"B. Adlam, K. Chatterjee, and M. Nowak, “Amplifiers of selection,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no. 2181. Royal Society of London, 2015.","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.","ama":"Adlam B, Chatterjee K, Nowak M. Amplifiers of selection. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2015;471(2181). doi:10.1098/rspa.2015.0114"},"publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","has_accepted_license":"1","day":"08","scopus_import":1},{"type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"We revisit the security (as a pseudorandom permutation) of cascading-based constructions for block-cipher key-length extension. Previous works typically considered the extreme case where the adversary is given the entire codebook of the construction, the only complexity measure being the number qe of queries to the underlying ideal block cipher, representing adversary’s secret-key-independent computation. Here, we initiate a systematic study of the more natural case of an adversary restricted to adaptively learning a number qc of plaintext/ciphertext pairs that is less than the entire codebook. For any such qc, we aim to determine the highest number of block-cipher queries qe the adversary can issue without being able to successfully distinguish the construction (under a secret key) from a random permutation.\r\nMore concretely, we show the following results for key-length extension schemes using a block cipher with n-bit blocks and κ-bit keys:\r\nPlain cascades of length ℓ=2r+1 are secure whenever qcqre≪2r(κ+n), qc≪2κ and qe≪22κ. The bound for r=1 also applies to two-key triple encryption (as used within Triple DES).\r\nThe r-round XOR-cascade is secure as long as qcqre≪2r(κ+n), matching an attack by Gaži (CRYPTO 2013).\r\nWe fully characterize the security of Gaži and Tessaro’s two-call ","lang":"eng"}],"_id":"1668","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Relaxing full-codebook security: A refined analysis of key-length extension schemes","status":"public","intvolume":" 9054","oa_version":"Submitted Version","scopus_import":1,"series_title":"Lecture Notes in Computer Science","day":"12","citation":{"chicago":"Gazi, Peter, Jooyoung Lee, Yannick Seurin, John Steinberger, and Stefano Tessaro. “Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-48116-5_16.","short":"P. Gazi, J. Lee, Y. Seurin, J. Steinberger, S. Tessaro, 9054 (2015) 319–341.","mla":"Gazi, Peter, et al. Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes. Vol. 9054, Springer, 2015, pp. 319–41, doi:10.1007/978-3-662-48116-5_16.","apa":"Gazi, P., Lee, J., Seurin, Y., Steinberger, J., & Tessaro, S. (2015). Relaxing full-codebook security: A refined analysis of key-length extension schemes. Presented at the FSE: Fast Software Encryption, Istanbul, Turkey: Springer. https://doi.org/10.1007/978-3-662-48116-5_16","ieee":"P. Gazi, J. Lee, Y. Seurin, J. Steinberger, and S. Tessaro, “Relaxing full-codebook security: A refined analysis of key-length extension schemes,” vol. 9054. Springer, pp. 319–341, 2015.","ista":"Gazi P, Lee J, Seurin Y, Steinberger J, Tessaro S. 2015. Relaxing full-codebook security: A refined analysis of key-length extension schemes. 9054, 319–341.","ama":"Gazi P, Lee J, Seurin Y, Steinberger J, Tessaro S. Relaxing full-codebook security: A refined analysis of key-length extension schemes. 2015;9054:319-341. doi:10.1007/978-3-662-48116-5_16"},"page":"319 - 341","date_published":"2015-08-12T00:00:00Z","ec_funded":1,"publist_id":"5481","year":"2015","publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"author":[{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Gazi","full_name":"Gazi, Peter"},{"last_name":"Lee","first_name":"Jooyoung","full_name":"Lee, Jooyoung"},{"last_name":"Seurin","first_name":"Yannick","full_name":"Seurin, Yannick"},{"last_name":"Steinberger","first_name":"John","full_name":"Steinberger, John"},{"full_name":"Tessaro, Stefano","last_name":"Tessaro","first_name":"Stefano"}],"date_created":"2018-12-11T11:53:22Z","date_updated":"2020-08-11T10:09:26Z","volume":9054,"month":"08","oa":1,"main_file_link":[{"url":"http://eprint.iacr.org/2015/397","open_access":"1"}],"quality_controlled":"1","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"conference":{"end_date":"2015-03-11","location":"Istanbul, Turkey","start_date":"2015-03-08","name":"FSE: Fast Software Encryption"},"doi":"10.1007/978-3-662-48116-5_16","language":[{"iso":"eng"}]},{"author":[{"last_name":"Bogomolov","first_name":"Sergiy","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","full_name":"Bogomolov, Sergiy"},{"full_name":"Magazzeni, Daniele","last_name":"Magazzeni","first_name":"Daniele"},{"full_name":"Minopoli, Stefano","last_name":"Minopoli","first_name":"Stefano"},{"full_name":"Wehrle, Martin","last_name":"Wehrle","first_name":"Martin"}],"date_created":"2018-12-11T11:53:23Z","date_updated":"2021-01-12T06:52:25Z","oa_version":"None","_id":"1670","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)”.","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","title":"PDDL+ planning with hybrid automata: Foundations of translating must behavior","department":[{"_id":"ToHe"}],"publisher":"AAAI Press","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."}],"ec_funded":1,"publist_id":"5479","type":"conference","conference":{"name":"ICAPS: International Conference on Automated Planning and Scheduling","end_date":"2015-06-11","location":"Jerusalem, Israel","start_date":"2015-06-07"},"date_published":"2015-06-01T00:00:00Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.aaai.org/ocs/index.php/ICAPS/ICAPS15/paper/view/10606/10394"}],"citation":{"apa":"Bogomolov, S., Magazzeni, D., Minopoli, S., & 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.","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.","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.","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.","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.","short":"S. Bogomolov, D. Magazzeni, S. Minopoli, M. Wehrle, in:, AAAI Press, 2015, pp. 42–46.","mla":"Bogomolov, Sergiy, et al. PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior. AAAI Press, 2015, pp. 42–46."},"quality_controlled":"1","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","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"}],"page":"42 - 46","day":"01","month":"06","scopus_import":1},{"scopus_import":1,"month":"09","day":"01","quality_controlled":"1","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1407.8015","open_access":"1"}],"citation":{"mla":"Lee, Jioon, and Kevin Schnelli. “Edge Universality for Deformed Wigner Matrices.” Reviews in Mathematical Physics, vol. 27, no. 8, 1550018, World Scientific Publishing, 2015, doi:10.1142/S0129055X1550018X.","short":"J. Lee, K. Schnelli, Reviews in Mathematical Physics 27 (2015).","chicago":"Lee, Jioon, and Kevin Schnelli. “Edge Universality for Deformed Wigner Matrices.” Reviews in Mathematical Physics. World Scientific Publishing, 2015. https://doi.org/10.1142/S0129055X1550018X.","ama":"Lee J, Schnelli K. Edge universality for deformed Wigner matrices. Reviews in Mathematical Physics. 2015;27(8). doi:10.1142/S0129055X1550018X","ista":"Lee J, Schnelli K. 2015. Edge universality for deformed Wigner matrices. Reviews in Mathematical Physics. 27(8), 1550018.","ieee":"J. Lee and K. Schnelli, “Edge universality for deformed Wigner matrices,” Reviews in Mathematical Physics, vol. 27, no. 8. World Scientific Publishing, 2015.","apa":"Lee, J., & Schnelli, K. (2015). Edge universality for deformed Wigner matrices. Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/S0129055X1550018X"},"publication":"Reviews in Mathematical Physics","language":[{"iso":"eng"}],"doi":"10.1142/S0129055X1550018X","date_published":"2015-09-01T00:00:00Z","type":"journal_article","article_number":"1550018","issue":"8","publist_id":"5475","abstract":[{"lang":"eng","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."}],"publisher":"World Scientific Publishing","intvolume":" 27","department":[{"_id":"LaEr"}],"status":"public","title":"Edge universality for deformed Wigner matrices","publication_status":"published","year":"2015","_id":"1674","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","volume":27,"date_updated":"2021-01-12T06:52:26Z","date_created":"2018-12-11T11:53:24Z","author":[{"first_name":"Jioon","last_name":"Lee","full_name":"Lee, Jioon"},{"full_name":"Schnelli, Kevin","orcid":"0000-0003-0954-3231","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","last_name":"Schnelli","first_name":"Kevin"}]},{"type":"journal_article","issue":"9","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1679","intvolume":" 27","title":"Taylor's Forest","ddc":["532"],"status":"public","pubrep_id":"748","file":[{"date_updated":"2020-07-14T12:45:12Z","date_created":"2018-12-12T10:13:35Z","checksum":"604bba3c2496aadb3efcff77de01ce6c","file_id":"5019","relation":"main_file","creator":"system","file_size":872366,"content_type":"application/pdf","file_name":"IST-2017-748-v1+1_1.4930850.pdf","access_level":"open_access"}],"oa_version":"Published Version","scopus_import":1,"has_accepted_license":"1","day":"24","citation":{"chicago":"Lemoult, Grégoire M, Philipp Maier, and Björn Hof. “Taylor’s Forest.” Physics of Fluids. American Institute of Physics, 2015. https://doi.org/10.1063/1.4930850.","short":"G.M. Lemoult, P. Maier, B. Hof, Physics of Fluids 27 (2015).","mla":"Lemoult, Grégoire M., et al. “Taylor’s Forest.” Physics of Fluids, vol. 27, no. 9, 091102, American Institute of Physics, 2015, doi:10.1063/1.4930850.","ieee":"G. M. Lemoult, P. Maier, and B. Hof, “Taylor’s Forest,” Physics of Fluids, vol. 27, no. 9. American Institute of Physics, 2015.","apa":"Lemoult, G. M., Maier, P., & Hof, B. (2015). Taylor’s Forest. Physics of Fluids. American Institute of Physics. https://doi.org/10.1063/1.4930850","ista":"Lemoult GM, Maier P, Hof B. 2015. Taylor’s Forest. Physics of Fluids. 27(9), 091102.","ama":"Lemoult GM, Maier P, Hof B. Taylor’s Forest. Physics of Fluids. 2015;27(9). doi:10.1063/1.4930850"},"publication":"Physics of Fluids","date_published":"2015-09-24T00:00:00Z","article_number":"091102","publist_id":"5469","file_date_updated":"2020-07-14T12:45:12Z","license":"https://creativecommons.org/licenses/by/4.0/","year":"2015","department":[{"_id":"BjHo"}],"publisher":"American Institute of Physics","publication_status":"published","author":[{"full_name":"Lemoult, Grégoire M","id":"4787FE80-F248-11E8-B48F-1D18A9856A87","last_name":"Lemoult","first_name":"Grégoire M"},{"full_name":"Maier, Philipp","id":"384F7C04-F248-11E8-B48F-1D18A9856A87","last_name":"Maier","first_name":"Philipp"},{"full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","first_name":"Björn","last_name":"Hof"}],"volume":27,"date_created":"2018-12-11T11:53:26Z","date_updated":"2021-01-12T06:52:28Z","month":"09","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,"quality_controlled":"1","doi":"10.1063/1.4930850","language":[{"iso":"eng"}]},{"type":"journal_article","issue":"10","publist_id":"5473","year":"2015","_id":"1676","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Editorial overview: Cell adhesion and migration","publication_status":"published","status":"public","department":[{"_id":"MiSi"}],"publisher":"Elsevier","intvolume":" 36","author":[{"last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"},{"full_name":"Raz, Erez","first_name":"Erez","last_name":"Raz"}],"date_updated":"2021-01-12T06:52:27Z","date_created":"2018-12-11T11:53:25Z","oa_version":"None","volume":36,"scopus_import":1,"month":"10","day":"01","publication":"Current Opinion in Cell Biology","citation":{"apa":"Sixt, M. K., & Raz, E. (2015). Editorial overview: Cell adhesion and migration. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2015.09.004","ieee":"M. K. Sixt and E. Raz, “Editorial overview: Cell adhesion and migration,” Current Opinion in Cell Biology, vol. 36, no. 10. Elsevier, pp. 4–6, 2015.","ista":"Sixt MK, Raz E. 2015. Editorial overview: Cell adhesion and migration. Current Opinion in Cell Biology. 36(10), 4–6.","ama":"Sixt MK, Raz E. Editorial overview: Cell adhesion and migration. Current Opinion in Cell Biology. 2015;36(10):4-6. doi:10.1016/j.ceb.2015.09.004","chicago":"Sixt, Michael K, and Erez Raz. “Editorial Overview: Cell Adhesion and Migration.” Current Opinion in Cell Biology. Elsevier, 2015. https://doi.org/10.1016/j.ceb.2015.09.004.","short":"M.K. Sixt, E. Raz, Current Opinion in Cell Biology 36 (2015) 4–6.","mla":"Sixt, Michael K., and Erez Raz. “Editorial Overview: Cell Adhesion and Migration.” Current Opinion in Cell Biology, vol. 36, no. 10, Elsevier, 2015, pp. 4–6, doi:10.1016/j.ceb.2015.09.004."},"page":"4 - 6","date_published":"2015-10-01T00:00:00Z","doi":"10.1016/j.ceb.2015.09.004","language":[{"iso":"eng"}]},{"intvolume":" 13","ddc":["570"],"title":"Numerous transitions of sex chromosomes in Diptera","status":"public","_id":"1684","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"checksum":"92a300d7b97eafb477885303f7632fe1","date_created":"2018-12-12T10:11:05Z","date_updated":"2020-07-14T12:45:12Z","file_id":"4858","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":1104701,"access_level":"open_access","file_name":"IST-2016-492-v1+1_journal.pbio.1002078.pdf"}],"pubrep_id":"492","type":"journal_article","issue":"4","abstract":[{"text":"Many species groups, including mammals and many insects, determine sex using heteromorphic sex chromosomes. Diptera flies, which include the model Drosophila melanogaster, generally have XY sex chromosomes and a conserved karyotype consisting of six chromosomal arms (five large rods and a small dot), but superficially similar karyotypes may conceal the true extent of sex chromosome variation. Here, we use whole-genome analysis in 37 fly species belonging to 22 different families of Diptera and uncover tremendous hidden diversity in sex chromosome karyotypes among flies. We identify over a dozen different sex chromosome configurations, and the small dot chromosome is repeatedly used as the sex chromosome, which presumably reflects the ancestral karyotype of higher Diptera. However, we identify species with undifferentiated sex chromosomes, others in which a different chromosome replaced the dot as a sex chromosome or in which up to three chromosomal elements became incorporated into the sex chromosomes, and others yet with female heterogamety (ZW sex chromosomes). Transcriptome analysis shows that dosage compensation has evolved multiple times in flies, consistently through up-regulation of the single X in males. However, X chromosomes generally show a deficiency of genes with male-biased expression, possibly reflecting sex-specific selective pressures. These species thus provide a rich resource to study sex chromosome biology in a comparative manner and show that similar selective forces have shaped the unique evolution of sex chromosomes in diverse fly taxa.","lang":"eng"}],"citation":{"ista":"Vicoso B, Bachtrog D. 2015. Numerous transitions of sex chromosomes in Diptera. PLoS Biology. 13(4), e1002078.","apa":"Vicoso, B., & Bachtrog, D. (2015). Numerous transitions of sex chromosomes in Diptera. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.1002078","ieee":"B. Vicoso and D. Bachtrog, “Numerous transitions of sex chromosomes in Diptera,” PLoS Biology, vol. 13, no. 4. Public Library of Science, 2015.","ama":"Vicoso B, Bachtrog D. Numerous transitions of sex chromosomes in Diptera. PLoS Biology. 2015;13(4). doi:10.1371/journal.pbio.1002078","chicago":"Vicoso, Beatriz, and Doris Bachtrog. “Numerous Transitions of Sex Chromosomes in Diptera.” PLoS Biology. Public Library of Science, 2015. https://doi.org/10.1371/journal.pbio.1002078.","mla":"Vicoso, Beatriz, and Doris Bachtrog. “Numerous Transitions of Sex Chromosomes in Diptera.” PLoS Biology, vol. 13, no. 4, e1002078, Public Library of Science, 2015, doi:10.1371/journal.pbio.1002078.","short":"B. Vicoso, D. Bachtrog, PLoS Biology 13 (2015)."},"publication":"PLoS Biology","date_published":"2015-04-16T00:00:00Z","has_accepted_license":"1","day":"16","publisher":"Public Library of Science","publication_status":"published","year":"2015","acknowledgement":"This research was funded by NIH grants (R01GM076007 and R01GM093182) to DB. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.\r\nWe thank the people listed in S2 Table for samples, Jere Schweikert for identifying Tephritid species, and Zaak Walton for technical assistance.","volume":13,"date_updated":"2021-01-12T06:52:30Z","date_created":"2018-12-11T11:53:27Z","author":[{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306","first_name":"Beatriz","last_name":"Vicoso","full_name":"Vicoso, Beatriz"},{"last_name":"Bachtrog","first_name":"Doris","full_name":"Bachtrog, Doris"}],"article_number":"e1002078","extern":"1","publist_id":"5463","file_date_updated":"2020-07-14T12:45:12Z","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.1371/journal.pbio.1002078","month":"04"},{"day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2015-10-01T00:00:00Z","page":"93 - 102","publication":"Current Opinion in Cell Biology","citation":{"ama":"Sarris M, Sixt MK. Navigating in tissue mazes: Chemoattractant interpretation in complex environments. Current Opinion in Cell Biology. 2015;36(10):93-102. doi:10.1016/j.ceb.2015.08.001","apa":"Sarris, M., & Sixt, M. K. (2015). Navigating in tissue mazes: Chemoattractant interpretation in complex environments. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2015.08.001","ieee":"M. Sarris and M. K. Sixt, “Navigating in tissue mazes: Chemoattractant interpretation in complex environments,” Current Opinion in Cell Biology, vol. 36, no. 10. Elsevier, pp. 93–102, 2015.","ista":"Sarris M, Sixt MK. 2015. Navigating in tissue mazes: Chemoattractant interpretation in complex environments. Current Opinion in Cell Biology. 36(10), 93–102.","short":"M. Sarris, M.K. Sixt, Current Opinion in Cell Biology 36 (2015) 93–102.","mla":"Sarris, Milka, and Michael K. Sixt. “Navigating in Tissue Mazes: Chemoattractant Interpretation in Complex Environments.” Current Opinion in Cell Biology, vol. 36, no. 10, Elsevier, 2015, pp. 93–102, doi:10.1016/j.ceb.2015.08.001.","chicago":"Sarris, Milka, and Michael K Sixt. “Navigating in Tissue Mazes: Chemoattractant Interpretation in Complex Environments.” Current Opinion in Cell Biology. Elsevier, 2015. https://doi.org/10.1016/j.ceb.2015.08.001."},"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."}],"issue":"10","type":"journal_article","file":[{"checksum":"c29973924b790aab02fdd91857759cfb","date_created":"2018-12-12T10:11:21Z","date_updated":"2020-07-14T12:45:12Z","file_id":"4875","relation":"main_file","creator":"system","file_size":797964,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2016-445-v1+1_1-s2.0-S0955067415001064-main.pdf"}],"oa_version":"Published Version","pubrep_id":"445","title":"Navigating in tissue mazes: Chemoattractant interpretation in complex environments","ddc":["570"],"status":"public","intvolume":" 36","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1687","month":"10","language":[{"iso":"eng"}],"doi":"10.1016/j.ceb.2015.08.001","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","grant_number":"281556","_id":"25A603A2-B435-11E9-9278-68D0E5697425"}],"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,"file_date_updated":"2020-07-14T12:45:12Z","publist_id":"5458","ec_funded":1,"date_updated":"2021-01-12T06:52:31Z","date_created":"2018-12-11T11:53:28Z","volume":36,"author":[{"last_name":"Sarris","first_name":"Milka","full_name":"Sarris, Milka"},{"full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K"}],"publication_status":"published","publisher":"Elsevier","department":[{"_id":"MiSi"}],"year":"2015"},{"month":"09","language":[{"iso":"eng"}],"conference":{"end_date":"2015-09-16","location":"Patras, Greece","start_date":"2015-09-14","name":"ESA: European Symposium on Algorithms"},"doi":"10.1007/978-3-662-48350-3_33","quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1507.01688"}],"oa":1,"publist_id":"5462","ec_funded":1,"date_created":"2018-12-11T11:53:27Z","date_updated":"2021-01-12T06:52:31Z","volume":9294,"author":[{"first_name":"Vincent","last_name":"Cohen Addad","full_name":"Cohen Addad, Vincent"},{"id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","last_name":"De Mesmay","first_name":"Arnaud N","full_name":"De Mesmay, Arnaud N"}],"publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Springer","year":"2015","day":"01","scopus_import":1,"date_published":"2015-09-01T00:00:00Z","page":"386 - 398","citation":{"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. https://doi.org/10.1007/978-3-662-48350-3_33.","short":"V. Cohen Addad, A.N. de Mesmay, in:, Springer, 2015, pp. 386–398.","mla":"Cohen Addad, Vincent, and Arnaud N. de Mesmay. A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface. Vol. 9294, Springer, 2015, pp. 386–98, doi:10.1007/978-3-662-48350-3_33.","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.","apa":"Cohen Addad, V., & 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. https://doi.org/10.1007/978-3-662-48350-3_33","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.","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:10.1007/978-3-662-48350-3_33"},"abstract":[{"lang":"eng","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 ε > 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."}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Preprint","status":"public","title":"A fixed parameter tractable approximation scheme for the optimal cut graph of a surface","intvolume":" 9294","_id":"1685","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"scopus_import":1,"day":"01","page":"610 - 636","citation":{"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,” Discrete & Computational Geometry, vol. 54, no. 3. Springer, pp. 610–636, 2015.","apa":"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 & Computational Geometry. Springer. https://doi.org/10.1007/s00454-015-9720-z","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 & Computational Geometry. 54(3), 610–636.","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. Discrete & Computational Geometry. 2015;54(3):610-636. doi:10.1007/s00454-015-9720-z","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.” Discrete & Computational Geometry. Springer, 2015. https://doi.org/10.1007/s00454-015-9720-z.","short":"R. Karasev, J. Kynčl, P. Paták, Z. Patakova, M. Tancer, Discrete & Computational Geometry 54 (2015) 610–636.","mla":"Karasev, Roman, et al. “Bounds for Pach’s Selection Theorem and for the Minimum Solid Angle in a Simplex.” Discrete & Computational Geometry, vol. 54, no. 3, Springer, 2015, pp. 610–36, doi:10.1007/s00454-015-9720-z."},"publication":"Discrete & Computational Geometry","date_published":"2015-10-01T00:00:00Z","type":"journal_article","issue":"3","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."}],"intvolume":" 54","status":"public","title":"Bounds for Pach's selection theorem and for the minimum solid angle in a simplex","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1688","oa_version":"Preprint","month":"10","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1403.8147"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00454-015-9720-z","publist_id":"5457","publisher":"Springer","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2015","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.","volume":54,"date_created":"2018-12-11T11:53:28Z","date_updated":"2021-01-12T06:52:32Z","author":[{"full_name":"Karasev, Roman","first_name":"Roman","last_name":"Karasev"},{"full_name":"Kynčl, Jan","last_name":"Kynčl","first_name":"Jan"},{"first_name":"Pavel","last_name":"Paták","full_name":"Paták, Pavel"},{"last_name":"Patakova","first_name":"Zuzana","orcid":"0000-0002-3975-1683","full_name":"Patakova, Zuzana"},{"full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","last_name":"Tancer","first_name":"Martin"}]},{"month":"09","day":"01","doi":"10.1145/2817825","date_published":"2015-09-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"ama":"Michaliszyn J, Otop J, Kieroňski E. On the decidability of elementary modal logics. ACM Transactions on Computational Logic. 2015;17(1). doi:10.1145/2817825","ieee":"J. Michaliszyn, J. Otop, and E. Kieroňski, “On the decidability of elementary modal logics,” ACM Transactions on Computational Logic, vol. 17, no. 1. ACM, 2015.","apa":"Michaliszyn, J., Otop, J., & Kieroňski, E. (2015). On the decidability of elementary modal logics. ACM Transactions on Computational Logic. ACM. https://doi.org/10.1145/2817825","ista":"Michaliszyn J, Otop J, Kieroňski E. 2015. On the decidability of elementary modal logics. ACM Transactions on Computational Logic. 17(1), 2.","short":"J. Michaliszyn, J. Otop, E. Kieroňski, ACM Transactions on Computational Logic 17 (2015).","mla":"Michaliszyn, Jakub, et al. “On the Decidability of Elementary Modal Logics.” ACM Transactions on Computational Logic, vol. 17, no. 1, 2, ACM, 2015, doi:10.1145/2817825.","chicago":"Michaliszyn, Jakub, Jan Otop, and Emanuel Kieroňski. “On the Decidability of Elementary Modal Logics.” ACM Transactions on Computational Logic. ACM, 2015. https://doi.org/10.1145/2817825."},"publication":"ACM Transactions on Computational Logic","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"quality_controlled":"1","ec_funded":1,"publist_id":"5468","issue":"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"}],"type":"journal_article","article_number":"2","author":[{"last_name":"Michaliszyn","first_name":"Jakub","full_name":"Michaliszyn, Jakub"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kieroňski","first_name":"Emanuel","full_name":"Kieroňski, Emanuel"}],"oa_version":"None","volume":17,"date_updated":"2021-01-12T06:52:29Z","date_created":"2018-12-11T11:53:26Z","_id":"1680","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 17","publisher":"ACM","department":[{"_id":"ToHe"}],"publication_status":"published","status":"public","title":"On the decidability of elementary modal logics"},{"date_created":"2018-12-11T11:53:27Z","date_updated":"2021-01-12T06:52:30Z","volume":62,"oa_version":"Preprint","author":[{"full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter"},{"last_name":"Krcál","first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek"}],"status":"public","publication_status":"published","title":"Robust satisfiability of systems of equations","intvolume":" 62","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"publisher":"ACM","year":"2015","_id":"1682","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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 α > 0, it holds that each function g: K → ℝn such that ||g - f || ∞ < α, 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 > 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."}],"publist_id":"5466","issue":"4","article_number":"26","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1145/2751524","date_published":"2015-08-01T00:00:00Z","quality_controlled":"1","publication":"Journal of the ACM","citation":{"chicago":"Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” Journal of the ACM. ACM, 2015. https://doi.org/10.1145/2751524.","mla":"Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” Journal of the ACM, vol. 62, no. 4, 26, ACM, 2015, doi:10.1145/2751524.","short":"P. Franek, M. Krcál, Journal of the ACM 62 (2015).","ista":"Franek P, Krcál M. 2015. Robust satisfiability of systems of equations. Journal of the ACM. 62(4), 26.","apa":"Franek, P., & Krcál, M. (2015). Robust satisfiability of systems of equations. Journal of the ACM. ACM. https://doi.org/10.1145/2751524","ieee":"P. Franek and M. Krcál, “Robust satisfiability of systems of equations,” Journal of the ACM, vol. 62, no. 4. ACM, 2015.","ama":"Franek P, Krcál M. Robust satisfiability of systems of equations. Journal of the ACM. 2015;62(4). doi:10.1145/2751524"},"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.0858"}],"month":"08","day":"01","scopus_import":1},{"type":"journal_article","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."}],"issue":"8","publist_id":"5465","_id":"1683","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions","status":"public","publication_status":"published","intvolume":" 33","department":[{"_id":"LeSa"}],"publisher":"Elsevier","author":[{"full_name":"Letts, Jame A","id":"322DA418-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9864-3586","first_name":"Jame A","last_name":"Letts"},{"full_name":"Sazanov, Leonid A","first_name":"Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989"}],"date_updated":"2021-01-12T06:52:30Z","date_created":"2018-12-11T11:53:27Z","volume":33,"oa_version":"None","scopus_import":1,"day":"01","month":"08","publication":"Current Opinion in Structural Biology","citation":{"chicago":"Letts, James A, and Leonid A Sazanov. “Gaining Mass: The Structure of Respiratory Complex I-from Bacterial towards Mitochondrial Versions.” Current Opinion in Structural Biology. Elsevier, 2015. https://doi.org/10.1016/j.sbi.2015.08.008.","short":"J.A. Letts, L.A. Sazanov, Current Opinion in Structural Biology 33 (2015) 135–145.","mla":"Letts, James A., and Leonid A. Sazanov. “Gaining Mass: The Structure of Respiratory Complex I-from Bacterial towards Mitochondrial Versions.” Current Opinion in Structural Biology, vol. 33, no. 8, Elsevier, 2015, pp. 135–45, doi:10.1016/j.sbi.2015.08.008.","apa":"Letts, J. A., & Sazanov, L. A. (2015). Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions. Current Opinion in Structural Biology. Elsevier. https://doi.org/10.1016/j.sbi.2015.08.008","ieee":"J. A. Letts and L. A. Sazanov, “Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions,” Current Opinion in Structural Biology, vol. 33, no. 8. Elsevier, pp. 135–145, 2015.","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.","ama":"Letts JA, Sazanov LA. Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions. Current Opinion in Structural Biology. 2015;33(8):135-145. doi:10.1016/j.sbi.2015.08.008"},"quality_controlled":"1","page":"135 - 145","date_published":"2015-08-01T00:00:00Z","doi":"10.1016/j.sbi.2015.08.008","language":[{"iso":"eng"}]},{"publist_id":"5459","issue":"6252","type":"journal_article","author":[{"last_name":"Kiermaier","first_name":"Eva","orcid":"0000-0001-6165-5738","id":"3EB04B78-F248-11E8-B48F-1D18A9856A87","full_name":"Kiermaier, Eva"},{"full_name":"Sixt, Michael K","first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179"}],"oa_version":"None","volume":349,"date_updated":"2021-01-12T06:52:31Z","date_created":"2018-12-11T11:53:28Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1686","year":"2015","department":[{"_id":"MiSi"}],"intvolume":" 349","publisher":"American Association for the Advancement of Science","status":"public","title":"Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection","publication_status":"published","month":"09","day":"04","scopus_import":1,"doi":"10.1126/science.aad0867","date_published":"2015-09-04T00:00:00Z","language":[{"iso":"eng"}],"citation":{"apa":"Kiermaier, E., & 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. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aad0867","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,” Science, vol. 349, no. 6252. American Association for the Advancement of Science, pp. 1055–1056, 2015.","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.","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. Science. 2015;349(6252):1055-1056. doi:10.1126/science.aad0867","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.” Science. American Association for the Advancement of Science, 2015. https://doi.org/10.1126/science.aad0867.","short":"E. Kiermaier, M.K. Sixt, Science 349 (2015) 1055–1056.","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.” Science, vol. 349, no. 6252, American Association for the Advancement of Science, 2015, pp. 1055–56, doi:10.1126/science.aad0867."},"publication":"Science","page":"1055 - 1056","quality_controlled":"1"},{"oa_version":"None","date_created":"2018-12-11T11:53:30Z","date_updated":"2021-01-12T06:52:33Z","author":[{"last_name":"Frehse","first_name":"Goran","full_name":"Frehse, Goran"},{"full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov","first_name":"Sergiy"},{"first_name":"Marius","last_name":"Greitschus","full_name":"Greitschus, Marius"},{"last_name":"Strump","first_name":"Thomas","full_name":"Strump, Thomas"},{"full_name":"Podelski, Andreas","first_name":"Andreas","last_name":"Podelski"}],"publisher":"ACM","department":[{"_id":"ToHe"}],"status":"public","publication_status":"published","title":"Eliminating spurious transitions in reachability with support functions","_id":"1692","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","ec_funded":1,"publist_id":"5452","abstract":[{"lang":"eng","text":"Computing an approximation of the reachable states of a hybrid system is a challenge, mainly because overapproximating the solutions of ODEs with a finite number of sets does not scale well. Using template polyhedra can greatly reduce the computational complexity, since it replaces complex operations on sets with a small number of optimization problems. However, the use of templates may make the over-approximation too conservative. Spurious transitions, which are falsely considered reachable, are particularly detrimental to performance and accuracy, and may exacerbate the state explosion problem. In this paper, we examine how spurious transitions can be avoided with minimal computational effort. To this end, detecting spurious transitions is reduced to the well-known problem of showing that two convex sets are disjoint by finding a hyperplane that separates them. We generalize this to owpipes by considering hyperplanes that evolve with time in correspondence to the dynamics of the system. The approach is implemented in the model checker SpaceEx and demonstrated on examples."}],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1145/2728606.2728622","date_published":"2015-04-14T00:00:00Z","conference":{"name":"HSCC: Hybrid Systems - Computation and Control","location":"Seattle, WA, United States","start_date":"2015-04-14","end_date":"2015-04-16"},"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"page":"149 - 158","quality_controlled":"1","citation":{"short":"G. Frehse, S. Bogomolov, M. Greitschus, T. Strump, A. Podelski, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 149–158.","mla":"Frehse, Goran, et al. “Eliminating Spurious Transitions in Reachability with Support Functions.” Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 149–58, doi:10.1145/2728606.2728622.","chicago":"Frehse, Goran, Sergiy Bogomolov, Marius Greitschus, Thomas Strump, and Andreas Podelski. “Eliminating Spurious Transitions in Reachability with Support Functions.” In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 149–58. ACM, 2015. https://doi.org/10.1145/2728606.2728622.","ama":"Frehse G, Bogomolov S, Greitschus M, Strump T, Podelski A. Eliminating spurious transitions in reachability with support functions. In: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. ACM; 2015:149-158. doi:10.1145/2728606.2728622","apa":"Frehse, G., Bogomolov, S., Greitschus, M., Strump, T., & Podelski, A. (2015). Eliminating spurious transitions in reachability with support functions. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 149–158). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728622","ieee":"G. Frehse, S. Bogomolov, M. Greitschus, T. Strump, and A. Podelski, “Eliminating spurious transitions in reachability with support functions,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 149–158.","ista":"Frehse G, Bogomolov S, Greitschus M, Strump T, Podelski A. 2015. Eliminating spurious transitions in reachability with support functions. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 149–158."},"publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","publication_identifier":{"isbn":["978-1-4503-3433-4"]},"day":"14","month":"04","scopus_import":1},{"month":"08","language":[{"iso":"eng"}],"doi":"10.1103/PhysRevA.92.022514","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1506.02734","open_access":"1"}],"ec_funded":1,"publist_id":"5451","article_number":"022514","date_created":"2018-12-11T11:53:30Z","date_updated":"2021-01-12T06:52:34Z","volume":92,"author":[{"first_name":"Pedro","last_name":"Amaro","full_name":"Amaro, Pedro"},{"first_name":"Beatrice","last_name":"Franke","full_name":"Franke, Beatrice"},{"last_name":"Krauth","first_name":"Julian","full_name":"Krauth, Julian"},{"full_name":"Diepold, Marc","first_name":"Marc","last_name":"Diepold"},{"first_name":"Filippo","last_name":"Fratini","full_name":"Fratini, Filippo"},{"full_name":"Safari, Laleh","id":"3C325E5E-F248-11E8-B48F-1D18A9856A87","last_name":"Safari","first_name":"Laleh"},{"full_name":"Machado, Jorge","last_name":"Machado","first_name":"Jorge"},{"first_name":"Aldo","last_name":"Antognini","full_name":"Antognini, Aldo"},{"last_name":"Kottmann","first_name":"Franz","full_name":"Kottmann, Franz"},{"first_name":"Paul","last_name":"Indelicato","full_name":"Indelicato, Paul"},{"full_name":"Pohl, Randolf","first_name":"Randolf","last_name":"Pohl"},{"first_name":"José","last_name":"Santos","full_name":"Santos, José"}],"publication_status":"published","publisher":"American Physical Society","department":[{"_id":"MiLe"}],"year":"2015","day":"28","scopus_import":1,"date_published":"2015-08-28T00:00:00Z","publication":"Physical Review A","citation":{"mla":"Amaro, Pedro, et al. “Quantum Interference Effects in Laser Spectroscopy of Muonic Hydrogen, Deuterium, and Helium-3.” Physical Review A, vol. 92, no. 2, 022514, American Physical Society, 2015, doi:10.1103/PhysRevA.92.022514.","short":"P. Amaro, B. Franke, J. Krauth, M. Diepold, F. Fratini, L. Safari, J. Machado, A. Antognini, F. Kottmann, P. Indelicato, R. Pohl, J. Santos, Physical Review A 92 (2015).","chicago":"Amaro, Pedro, Beatrice Franke, Julian Krauth, Marc Diepold, Filippo Fratini, Laleh Safari, Jorge Machado, et al. “Quantum Interference Effects in Laser Spectroscopy of Muonic Hydrogen, Deuterium, and Helium-3.” Physical Review A. American Physical Society, 2015. https://doi.org/10.1103/PhysRevA.92.022514.","ama":"Amaro P, Franke B, Krauth J, et al. Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. Physical Review A. 2015;92(2). doi:10.1103/PhysRevA.92.022514","ista":"Amaro P, Franke B, Krauth J, Diepold M, Fratini F, Safari L, Machado J, Antognini A, Kottmann F, Indelicato P, Pohl R, Santos J. 2015. Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. Physical Review A. 92(2), 022514.","ieee":"P. Amaro et al., “Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3,” Physical Review A, vol. 92, no. 2. American Physical Society, 2015.","apa":"Amaro, P., Franke, B., Krauth, J., Diepold, M., Fratini, F., Safari, L., … Santos, J. (2015). Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.92.022514"},"abstract":[{"lang":"eng","text":"Quantum interference between energetically close states is theoretically investigated, with the state structure being observed via laser spectroscopy. In this work, we focus on hyperfine states of selected hydrogenic muonic isotopes, and on how quantum interference affects the measured Lamb shift. The process of photon excitation and subsequent photon decay is implemented within the framework of nonrelativistic second-order perturbation theory. Due to its experimental interest, calculations are performed for muonic hydrogen, deuterium, and helium-3. We restrict our analysis to the case of photon scattering by incident linear polarized photons and the polarization of the scattered photons not being observed. We conclude that while quantum interference effects can be safely neglected in muonic hydrogen and helium-3, in the case of muonic deuterium there are resonances with close proximity, where quantum interference effects can induce shifts up to a few percent of the linewidth, assuming a pointlike detector. However, by taking into account the geometry of the setup used by the CREMA collaboration, this effect is reduced to less than 0.2% of the linewidth in all possible cases, which makes it irrelevant at the present level of accuracy. © 2015 American Physical Society."}],"issue":"2","type":"journal_article","oa_version":"Preprint","title":"Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3","status":"public","intvolume":" 92","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1693"},{"day":"14","month":"04","language":[{"iso":"eng"}],"doi":"10.1145/2728606.2728630","date_published":"2015-04-14T00:00:00Z","conference":{"start_date":"2015-04-14","location":"Seattle, WA, United States","end_date":"2015-04-16","name":"HSCC: Hybrid Systems - Computation and Control"},"page":"128 - 133","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"quality_controlled":"1","citation":{"chicago":"Bak, Stanley, Sergiy Bogomolov, and Taylor Johnson. “HYST: A Source Transformation and Translation Tool for Hybrid Automaton Models,” 128–33. Springer, 2015. https://doi.org/10.1145/2728606.2728630.","mla":"Bak, Stanley, et al. HYST: A Source Transformation and Translation Tool for Hybrid Automaton Models. Springer, 2015, pp. 128–33, doi:10.1145/2728606.2728630.","short":"S. Bak, S. Bogomolov, T. Johnson, in:, Springer, 2015, pp. 128–133.","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.","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.","apa":"Bak, S., Bogomolov, S., & 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. https://doi.org/10.1145/2728606.2728630","ama":"Bak S, Bogomolov S, Johnson T. HYST: A source transformation and translation tool for hybrid automaton models. In: Springer; 2015:128-133. doi:10.1145/2728606.2728630"},"publist_id":"5454","ec_funded":1,"abstract":[{"lang":"eng","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."}],"type":"conference","oa_version":"None","date_created":"2018-12-11T11:53:29Z","date_updated":"2021-01-12T06:52:33Z","author":[{"last_name":"Bak","first_name":"Stanley","full_name":"Bak, Stanley"},{"full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","first_name":"Sergiy","last_name":"Bogomolov"},{"full_name":"Johnson, Taylor","first_name":"Taylor","last_name":"Johnson"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","title":"HYST: A source transformation and translation tool for hybrid automaton models","status":"public","_id":"1690","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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)."}]