[{"publication_identifier":{"isbn":["978-331963687-0"]},"status":"public","day":"01","publication_status":"published","publisher":"Springer","volume":10401,"external_id":{"isi":["000438672600005"]},"quality_controlled":"1","project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/978-3-319-63688-7_5","month":"01","main_file_link":[{"url":"https://eprint.iacr.org/2017/515","open_access":"1"}],"ec_funded":1,"publist_id":"7151","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Be adaptive avoid overcommitting","conference":{"start_date":"2017-07-20","location":"Santa Barbara, CA, United States","name":"CRYPTO: Cryptology","end_date":"2017-07-24"},"alternative_title":["LNCS"],"editor":[{"last_name":"Katz","first_name":"Jonathan","full_name":"Katz, Jonathan"},{"first_name":"Hovav","last_name":"Shacham","full_name":"Shacham, Hovav"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10035"}]},"intvolume":"     10401","author":[{"last_name":"Jafargholi","first_name":"Zahra","full_name":"Jafargholi, Zahra"},{"last_name":"Kamath Hosdurg","orcid":"0009-0006-6812-7317","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan"},{"first_name":"Karen","last_name":"Klein","full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Komargodski","first_name":"Ilan","full_name":"Komargodski, Ilan"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z"},{"full_name":"Wichs, Daniel","first_name":"Daniel","last_name":"Wichs"}],"article_processing_charge":"No","year":"2017","language":[{"iso":"eng"}],"abstract":[{"text":"For many cryptographic primitives, it is relatively easy to achieve selective security (where the adversary commits a-priori to some of the choices to be made later in the attack) but appears difficult to achieve the more natural notion of adaptive security (where the adversary can make all choices on the go as the attack progresses). A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption (Panjwani, TCC ’07 and Fuchsbauer et al., CRYPTO ’15), constrained PRFs (Fuchsbauer et al., ASIACRYPT ’14), and Yao garbled circuits (Jafargholi and Wichs, TCC ’16b). Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework that connects all of these works and allows us to present them in a unified and simplified fashion. Moreover, we use the framework to derive a new result for adaptively secure secret sharing over access structures defined via monotone circuits. We envision that further applications will follow in the future. Underlying our framework is the following simple idea. It is well known that selective security, where the adversary commits to n-bits of information about his future choices, automatically implies adaptive security at the cost of amplifying the adversary’s advantage by a factor of up to 2n. However, in some cases the proof of selective security proceeds via a sequence of hybrids, where each pair of adjacent hybrids locally only requires some smaller partial information consisting of m ≪ n bits. The partial information needed might be completely different between different pairs of hybrids, and if we look across all the hybrids we might rely on the entire n-bit commitment. Nevertheless, the above is sufficient to prove adaptive security, at the cost of amplifying the adversary’s advantage by a factor of only 2m ≪ 2n. In all of our examples using the above framework, the different hybrids are captured by some sort of a graph pebbling game and the amount of information that the adversary needs to commit to in each pair of hybrids is bounded by the maximum number of pebbles in play at any point in time. Therefore, coming up with better strategies for proving adaptive security translates to various pebbling strategies for different types of graphs.","lang":"eng"}],"_id":"637","date_updated":"2026-04-08T07:01:44Z","department":[{"_id":"KrPi"}],"citation":{"ama":"Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. Be adaptive avoid overcommitting. In: Katz J, Shacham H, eds. Vol 10401. Springer; 2017:133-163. doi:<a href=\"https://doi.org/10.1007/978-3-319-63688-7_5\">10.1007/978-3-319-63688-7_5</a>","ieee":"Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K. Z. Pietrzak, and D. Wichs, “Be adaptive avoid overcommitting,” presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States, 2017, vol. 10401, pp. 133–163.","chicago":"Jafargholi, Zahra, Chethan Kamath Hosdurg, Karen Klein, Ilan Komargodski, Krzysztof Z Pietrzak, and Daniel Wichs. “Be Adaptive Avoid Overcommitting.” edited by Jonathan Katz and Hovav Shacham, 10401:133–63. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63688-7_5\">https://doi.org/10.1007/978-3-319-63688-7_5</a>.","ista":"Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. 2017. Be adaptive avoid overcommitting. CRYPTO: Cryptology, LNCS, vol. 10401, 133–163.","apa":"Jafargholi, Z., Kamath Hosdurg, C., Klein, K., Komargodski, I., Pietrzak, K. Z., &#38; Wichs, D. (2017). Be adaptive avoid overcommitting. In J. Katz &#38; H. Shacham (Eds.) (Vol. 10401, pp. 133–163). Presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63688-7_5\">https://doi.org/10.1007/978-3-319-63688-7_5</a>","short":"Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak, D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163.","mla":"Jafargholi, Zahra, et al. <i>Be Adaptive Avoid Overcommitting</i>. Edited by Jonathan Katz and Hovav Shacham, vol. 10401, Springer, 2017, pp. 133–63, doi:<a href=\"https://doi.org/10.1007/978-3-319-63688-7_5\">10.1007/978-3-319-63688-7_5</a>."},"date_published":"2017-01-01T00:00:00Z","page":"133 - 163","oa":1,"isi":1,"type":"conference","date_created":"2018-12-11T11:47:38Z","oa_version":"Submitted Version"},{"ec_funded":1,"publist_id":"6397","pubrep_id":"1053","file_date_updated":"2018-12-12T10:10:24Z","doi":"10.1145/3072959.3073709","project":[{"_id":"25082902-B435-11E9-9278-68D0E5697425","name":"Soft-bodied intelligence for Manipulation","grant_number":"645599","call_identifier":"H2020"},{"call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"month":"01","quality_controlled":"1","external_id":{"isi":["000406432100032"]},"ddc":["003","004"],"status":"public","day":"01","file":[{"access_level":"open_access","file_name":"IST-2018-1053-v1+1_CurveUp.pdf","file_size":36159696,"content_type":"application/pdf","creator":"system","date_updated":"2018-12-12T10:10:24Z","file_id":"4811","relation":"main_file","date_created":"2018-12-12T10:10:24Z"}],"volume":36,"publication_status":"published","publisher":"ACM","issue":"4","oa":1,"isi":1,"date_created":"2018-12-11T11:49:38Z","oa_version":"Submitted Version","article_number":"64","type":"conference","date_updated":"2026-04-08T07:25:22Z","_id":"1001","abstract":[{"text":"We present a computational approach for designing CurveUps, curvy shells that form from an initially flat state. They consist of small rigid tiles that are tightly held together by two pre-stretched elastic sheets attached to them. Our method allows the realization of smooth, doubly curved surfaces that can be fabricated as a flat piece. Once released, the restoring forces of the pre-stretched sheets support the object to take shape in 3D. CurveUps are structurally stable in their target configuration. The design process starts with a target surface. Our method generates a tile layout in 2D and optimizes the distribution, shape, and attachment areas of the tiles to obtain a configuration that is fabricable and in which the curved up state closely matches the target. Our approach is based on an efficient approximate model and a local optimization strategy for an otherwise intractable nonlinear optimization problem. We demonstrate the effectiveness of our approach for a wide range of shapes, all realized as physical prototypes.","lang":"eng"}],"department":[{"_id":"BeBi"}],"citation":{"ama":"Guseinov R, Miguel E, Bickel B. CurveUps: Shaping objects from flat plates with tension-actuated curvature. In: Vol 36. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3072959.3073709\">10.1145/3072959.3073709</a>","ieee":"R. Guseinov, E. Miguel, and B. Bickel, “CurveUps: Shaping objects from flat plates with tension-actuated curvature,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2017, vol. 36, no. 4.","ista":"Guseinov R, Miguel E, Bickel B. 2017. CurveUps: Shaping objects from flat plates with tension-actuated curvature. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 36, 64.","chicago":"Guseinov, Ruslan, Eder Miguel, and Bernd Bickel. “CurveUps: Shaping Objects from Flat Plates with Tension-Actuated Curvature,” Vol. 36. ACM, 2017. <a href=\"https://doi.org/10.1145/3072959.3073709\">https://doi.org/10.1145/3072959.3073709</a>.","short":"R. Guseinov, E. Miguel, B. Bickel, in:, ACM, 2017.","mla":"Guseinov, Ruslan, et al. <i>CurveUps: Shaping Objects from Flat Plates with Tension-Actuated Curvature</i>. Vol. 36, no. 4, 64, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3072959.3073709\">10.1145/3072959.3073709</a>.","apa":"Guseinov, R., Miguel, E., &#38; Bickel, B. (2017). CurveUps: Shaping objects from flat plates with tension-actuated curvature (Vol. 36). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/3072959.3073709\">https://doi.org/10.1145/3072959.3073709</a>"},"date_published":"2017-01-01T00:00:00Z","language":[{"iso":"eng"}],"has_accepted_license":"1","author":[{"id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","full_name":"Guseinov, Ruslan","orcid":"0000-0001-9819-5077","last_name":"Guseinov","first_name":"Ruslan"},{"full_name":"Miguel, Eder","first_name":"Eder","last_name":"Miguel"},{"last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"}],"intvolume":"        36","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8366"}]},"article_processing_charge":"No","year":"2017","title":"CurveUps: Shaping objects from flat plates with tension-actuated curvature","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","conference":{"start_date":"2017-08-19","location":"Los Angeles, CA, United States","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","end_date":"2017-08-25"},"scopus_import":"1","alternative_title":["ACM Transactions on Graphics"]},{"quality_controlled":"1","external_id":{"arxiv":["1610.04908"],"isi":["000395981900009"]},"day":"06","status":"public","arxiv":1,"publication_identifier":{"issn":["2469-9926"]},"publication":"Physical Review A","volume":95,"publisher":"American Physical Society","publication_status":"published","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1610.04908"}],"publist_id":"6242","doi":"10.1103/PhysRevA.95.033608","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"694227","name":"Analysis of quantum many-body systems"},{"_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems"},{"call_identifier":"FWF","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment","_id":"26031614-B435-11E9-9278-68D0E5697425"}],"month":"03","intvolume":"        95","author":[{"last_name":"Li","first_name":"Xiang","id":"4B7E523C-F248-11E8-B48F-1D18A9856A87","full_name":"Li, Xiang"},{"first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-6990-7802","last_name":"Lemeshko","first_name":"Mikhail","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"8958","status":"public"}]},"year":"2017","article_processing_charge":"No","title":"Angular self-localization of impurities rotating in a bosonic bath","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","issue":"3","isi":1,"oa":1,"date_created":"2018-12-11T11:50:15Z","oa_version":"Published Version","type":"journal_article","article_number":"033608","date_published":"2017-03-06T00:00:00Z","citation":{"ama":"Li X, Seiringer R, Lemeshko M. Angular self-localization of impurities rotating in a bosonic bath. <i>Physical Review A</i>. 2017;95(3). doi:<a href=\"https://doi.org/10.1103/PhysRevA.95.033608\">10.1103/PhysRevA.95.033608</a>","ieee":"X. Li, R. Seiringer, and M. Lemeshko, “Angular self-localization of impurities rotating in a bosonic bath,” <i>Physical Review A</i>, vol. 95, no. 3. American Physical Society, 2017.","chicago":"Li, Xiang, Robert Seiringer, and Mikhail Lemeshko. “Angular Self-Localization of Impurities Rotating in a Bosonic Bath.” <i>Physical Review A</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevA.95.033608\">https://doi.org/10.1103/PhysRevA.95.033608</a>.","ista":"Li X, Seiringer R, Lemeshko M. 2017. Angular self-localization of impurities rotating in a bosonic bath. Physical Review A. 95(3), 033608.","apa":"Li, X., Seiringer, R., &#38; Lemeshko, M. (2017). Angular self-localization of impurities rotating in a bosonic bath. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.95.033608\">https://doi.org/10.1103/PhysRevA.95.033608</a>","mla":"Li, Xiang, et al. “Angular Self-Localization of Impurities Rotating in a Bosonic Bath.” <i>Physical Review A</i>, vol. 95, no. 3, 033608, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevA.95.033608\">10.1103/PhysRevA.95.033608</a>.","short":"X. Li, R. Seiringer, M. Lemeshko, Physical Review A 95 (2017)."},"department":[{"_id":"MiLe"},{"_id":"RoSe"}],"abstract":[{"lang":"eng","text":"The existence of a self-localization transition in the polaron problem has been under an active debate ever since Landau suggested it 83 years ago. Here we reveal the self-localization transition for the rotational analogue of the polaron -- the angulon quasiparticle. We show that, unlike for the polarons, self-localization of angulons occurs at finite impurity-bath coupling already at the mean-field level. The transition is accompanied by the spherical-symmetry breaking of the angulon ground state and a discontinuity in the first derivative of the ground-state energy. Moreover, the type of the symmetry breaking is dictated by the symmetry of the microscopic impurity-bath interaction, which leads to a number of distinct self-localized states. The predicted effects can potentially be addressed in experiments on cold molecules trapped in superfluid helium droplets and ultracold quantum gases, as well as on electronic excitations in solids and Bose-Einstein condensates. "}],"_id":"1120","date_updated":"2026-04-08T07:26:09Z","language":[{"iso":"eng"}]},{"oa":1,"type":"conference","oa_version":"Published Version","date_created":"2018-12-11T11:49:09Z","language":[{"iso":"eng"}],"has_accepted_license":"1","abstract":[{"lang":"eng","text":"We develop a probabilistic technique for colorizing grayscale natural images. In light of the intrinsic uncertainty of this task, the proposed probabilistic framework has numerous desirable properties. In particular, our model is able to produce multiple plausible and vivid colorizations for a given grayscale image and is one of the first colorization models to provide a proper stochastic sampling scheme. Moreover, our training procedure is supported by a rigorous theoretical framework that does not require any ad hoc heuristics and allows for efficient modeling and learning of the joint pixel color distribution.We demonstrate strong quantitative and qualitative experimental results on the CIFAR-10 dataset and the challenging ILSVRC 2012 dataset."}],"_id":"911","date_updated":"2026-04-08T07:26:44Z","page":"85.1-85.12","department":[{"_id":"ChLa"}],"citation":{"mla":"Royer, Amélie, et al. <i>Probabilistic Image Colorization</i>. BMVA Press, 2017, p. 85.1-85.12, doi:<a href=\"https://doi.org/10.5244/c.31.85\">10.5244/c.31.85</a>.","short":"A. Royer, A. Kolesnikov, C. Lampert, in:, BMVA Press, 2017, p. 85.1-85.12.","apa":"Royer, A., Kolesnikov, A., &#38; Lampert, C. (2017). Probabilistic image colorization (p. 85.1-85.12). Presented at the BMVC: British Machine Vision Conference, London, United Kingdom: BMVA Press. <a href=\"https://doi.org/10.5244/c.31.85\">https://doi.org/10.5244/c.31.85</a>","ista":"Royer A, Kolesnikov A, Lampert C. 2017. Probabilistic image colorization. BMVC: British Machine Vision Conference, 85.1-85.12.","chicago":"Royer, Amélie, Alexander Kolesnikov, and Christoph Lampert. “Probabilistic Image Colorization,” 85.1-85.12. BMVA Press, 2017. <a href=\"https://doi.org/10.5244/c.31.85\">https://doi.org/10.5244/c.31.85</a>.","ieee":"A. Royer, A. Kolesnikov, and C. Lampert, “Probabilistic image colorization,” presented at the BMVC: British Machine Vision Conference, London, United Kingdom, 2017, p. 85.1-85.12.","ama":"Royer A, Kolesnikov A, Lampert C. Probabilistic image colorization. In: BMVA Press; 2017:85.1-85.12. doi:<a href=\"https://doi.org/10.5244/c.31.85\">10.5244/c.31.85</a>"},"date_published":"2017-09-01T00:00:00Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8390"}]},"author":[{"id":"3811D890-F248-11E8-B48F-1D18A9856A87","full_name":"Royer, Amélie","orcid":"0000-0002-8407-0705","last_name":"Royer","first_name":"Amélie"},{"last_name":"Kolesnikov","first_name":"Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","full_name":"Kolesnikov, Alexander"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887"}],"article_processing_charge":"No","year":"2017","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Probabilistic image colorization","conference":{"end_date":"2017-09-07","name":"BMVC: British Machine Vision Conference","start_date":"2017-09-04","location":"London, United Kingdom"},"ec_funded":1,"corr_author":"1","publist_id":"6532","project":[{"call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2020-08-10T07:14:33Z","doi":"10.5244/c.31.85","month":"09","ddc":["000"],"external_id":{"arxiv":["1705.04258"]},"quality_controlled":"1","publication_identifier":{"eisbn":["190172560X"]},"file":[{"file_id":"8224","date_created":"2020-08-10T07:14:33Z","relation":"main_file","file_size":1625363,"file_name":"2017_BMVC_Royer.pdf","access_level":"open_access","success":1,"creator":"dernst","date_updated":"2020-08-10T07:14:33Z","content_type":"application/pdf"}],"arxiv":1,"status":"public","day":"01","publication_status":"published","publisher":"BMVA Press"},{"month":"09","doi":"10.1007/978-3-319-65765-3_7","file_date_updated":"2020-07-14T12:47:31Z","pubrep_id":"831","project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publist_id":"7129","corr_author":"1","volume":"10419 ","publisher":"Springer","publication_status":"published","day":"01","status":"public","file":[{"relation":"main_file","date_created":"2018-12-12T10:12:38Z","file_id":"4956","creator":"system","date_updated":"2020-07-14T12:47:31Z","checksum":"faf546914ba29bcf9974ee36b6b16750","content_type":"application/pdf","file_size":3806864,"access_level":"open_access","file_name":"IST-2017-831-v1+1_main.pdf"}],"publication_identifier":{"isbn":["978-331965764-6"]},"quality_controlled":"1","ddc":["005"],"external_id":{"isi":["000611678300007"]},"date_published":"2017-09-01T00:00:00Z","page":"116 - 132","citation":{"ieee":"S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.","ama":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. Conic abstractions for hybrid systems. In: Vol 10419. Springer; 2017:116-132. doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">10.1007/978-3-319-65765-3_7</a>","chicago":"Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic Abstractions for Hybrid Systems,” 10419:116–32. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">https://doi.org/10.1007/978-3-319-65765-3_7</a>.","ista":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. 2017. Conic abstractions for hybrid systems. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 116–132.","apa":"Bogomolov, S., Giacobbe, M., Henzinger, T. A., &#38; Kong, H. (2017). Conic abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">https://doi.org/10.1007/978-3-319-65765-3_7</a>","mla":"Bogomolov, Sergiy, et al. <i>Conic Abstractions for Hybrid Systems</i>. Vol. 10419, Springer, 2017, pp. 116–32, doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">10.1007/978-3-319-65765-3_7</a>.","short":"S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017, pp. 116–132."},"department":[{"_id":"ToHe"}],"abstract":[{"text":"Despite researchers’ efforts in the last couple of decades, reachability analysis is still a challenging problem even for linear hybrid systems. Among the existing approaches, the most practical ones are mainly based on bounded-time reachable set over-approximations. For the purpose of unbounded-time analysis, one important strategy is to abstract the original system and find an invariant for the abstraction. In this paper, we propose an approach to constructing a new kind of abstraction called conic abstraction for affine hybrid systems, and to computing reachable sets based on this abstraction. The essential feature of a conic abstraction is that it partitions the state space of a system into a set of convex polyhedral cones which is derived from a uniform conic partition of the derivative space. Such a set of polyhedral cones is able to cut all trajectories of the system into almost straight segments so that every segment of a reach pipe in a polyhedral cone tends to be straight as well, and hence can be over-approximated tightly by polyhedra using similar techniques as HyTech or PHAVer. In particular, for diagonalizable affine systems, our approach can guarantee to find an invariant for unbounded reachable sets, which is beyond the capability of bounded-time reachability analysis tools. We implemented the approach in a tool and experiments on benchmarks show that our approach is more powerful than SpaceEx and PHAVer in dealing with diagonalizable systems.","lang":"eng"}],"_id":"647","date_updated":"2026-04-08T07:47:13Z","has_accepted_license":"1","language":[{"iso":"eng"}],"oa_version":"Submitted Version","date_created":"2018-12-11T11:47:41Z","type":"conference","oa":1,"isi":1,"alternative_title":["LNCS"],"conference":{"start_date":"2017-09-05","location":"Berlin, Germany","name":"FORMATS: Formal Modelling and Analysis of Timed Systems","end_date":"2017-09-07"},"title":"Conic abstractions for hybrid systems","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","year":"2017","article_processing_charge":"No","author":[{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","last_name":"Bogomolov","first_name":"Sergiy"},{"full_name":"Giacobbe, Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","last_name":"Giacobbe","orcid":"0000-0001-8180-0904","first_name":"Mirco"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Kong","orcid":"0000-0002-3066-6941","first_name":"Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","full_name":"Kong, Hui"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"6894","status":"public"}]}},{"publist_id":"7162","corr_author":"1","month":"03","doi":"10.1007/978-3-662-54577-5_34","file_date_updated":"2020-07-14T12:47:27Z","pubrep_id":"966","project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}],"quality_controlled":"1","external_id":{"isi":["000440734900034"]},"ddc":["000"],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), by the European Commission under grant 643921 (UnCoVerCPS), and by the ARC project DP140104219 (Robust AI Planning for Hybrid Systems).","volume":10205,"publisher":"Springer","publication_status":"published","day":"31","status":"public","file":[{"date_created":"2018-12-12T10:11:41Z","relation":"main_file","file_id":"4897","content_type":"application/pdf","checksum":"f395d0d20102b89aeaad8b4ef4f18f4f","creator":"system","date_updated":"2020-07-14T12:47:27Z","file_name":"IST-2017-741-v1+1_main.pdf","access_level":"open_access","file_size":569863},{"date_updated":"2020-07-14T12:47:27Z","creator":"system","content_type":"application/pdf","checksum":"f416ee1ae4497b23ecdf28b1f18bb8df","file_size":563276,"file_name":"IST-2018-741-v2+2_main.pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:11:42Z","file_id":"4898"}],"publication_identifier":{"isbn":["978-366254576-8"]},"date_created":"2018-12-11T11:47:36Z","oa_version":"Submitted Version","type":"conference","oa":1,"isi":1,"citation":{"ieee":"S. Bogomolov, G. Frehse, M. Giacobbe, and T. A. Henzinger, “Counterexample guided refinement of template polyhedra,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 589–606.","ama":"Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. Counterexample guided refinement of template polyhedra. In: Vol 10205. Springer; 2017:589-606. doi:<a href=\"https://doi.org/10.1007/978-3-662-54577-5_34\">10.1007/978-3-662-54577-5_34</a>","chicago":"Bogomolov, Sergiy, Goran Frehse, Mirco Giacobbe, and Thomas A Henzinger. “Counterexample Guided Refinement of Template Polyhedra,” 10205:589–606. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-662-54577-5_34\">https://doi.org/10.1007/978-3-662-54577-5_34</a>.","ista":"Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. 2017. Counterexample guided refinement of template polyhedra. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10205, 589–606.","apa":"Bogomolov, S., Frehse, G., Giacobbe, M., &#38; Henzinger, T. A. (2017). Counterexample guided refinement of template polyhedra (Vol. 10205, pp. 589–606). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-662-54577-5_34\">https://doi.org/10.1007/978-3-662-54577-5_34</a>","short":"S. Bogomolov, G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2017, pp. 589–606.","mla":"Bogomolov, Sergiy, et al. <i>Counterexample Guided Refinement of Template Polyhedra</i>. Vol. 10205, Springer, 2017, pp. 589–606, doi:<a href=\"https://doi.org/10.1007/978-3-662-54577-5_34\">10.1007/978-3-662-54577-5_34</a>."},"department":[{"_id":"ToHe"}],"date_published":"2017-03-31T00:00:00Z","page":"589 - 606","_id":"631","date_updated":"2026-04-08T07:47:13Z","abstract":[{"lang":"eng","text":"Template polyhedra generalize intervals and octagons to polyhedra whose facets are orthogonal to a given set of arbitrary directions. They have been employed in the abstract interpretation of programs and, with particular success, in the reachability analysis of hybrid automata. While previously, the choice of directions has been left to the user or a heuristic, we present a method for the automatic discovery of directions that generalize and eliminate spurious counterexamples. We show that for the class of convex hybrid automata, i.e., hybrid automata with (possibly nonlinear) convex constraints on derivatives, such directions always exist and can be found using convex optimization. We embed our method inside a CEGAR loop, thus enabling the time-unbounded reachability analysis of an important and richer class of hybrid automata than was previously possible. We evaluate our method on several benchmarks, demonstrating also its superior efficiency for the special case of linear hybrid automata."}],"has_accepted_license":"1","language":[{"iso":"eng"}],"year":"2017","article_processing_charge":"No","intvolume":"     10205","author":[{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","last_name":"Bogomolov","first_name":"Sergiy"},{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","full_name":"Giacobbe, Mirco","first_name":"Mirco","last_name":"Giacobbe","orcid":"0000-0001-8180-0904"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"related_material":{"record":[{"status":"public","id":"6894","relation":"dissertation_contains"}]},"alternative_title":["LNCS"],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2017-04-29","start_date":"2017-04-22","location":"Uppsala, Sweden"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Counterexample guided refinement of template polyhedra","scopus_import":"1"},{"language":[{"iso":"eng"}],"has_accepted_license":"1","_id":"955","abstract":[{"lang":"eng","text":"Gene expression is controlled by networks of regulatory proteins that interact specifically with external signals and DNA regulatory sequences. These interactions force the network components to co-evolve so as to continually maintain function. Yet, existing models of evolution mostly focus on isolated genetic elements. In contrast, we study the essential process by which regulatory networks grow: the duplication and subsequent specialization of network components. We synthesize a biophysical model of molecular interactions with the evolutionary framework to find the conditions and pathways by which new regulatory functions emerge. We show that specialization of new network components is usually slow, but can be drastically accelerated in the presence of regulatory crosstalk and mutations that promote promiscuous interactions between network components."}],"date_updated":"2026-04-08T13:54:24Z","date_published":"2017-08-09T00:00:00Z","citation":{"ieee":"T. Friedlander, R. Prizak, N. H. Barton, and G. Tkačik, “Evolution of new regulatory functions on biophysically realistic fitness landscapes,” <i>Nature Communications</i>, vol. 8, no. 1. Nature Publishing Group, 2017.","ama":"Friedlander T, Prizak R, Barton NH, Tkačik G. Evolution of new regulatory functions on biophysically realistic fitness landscapes. <i>Nature Communications</i>. 2017;8(1). doi:<a href=\"https://doi.org/10.1038/s41467-017-00238-8\">10.1038/s41467-017-00238-8</a>","chicago":"Friedlander, Tamar, Roshan Prizak, Nicholas H Barton, and Gašper Tkačik. “Evolution of New Regulatory Functions on Biophysically Realistic Fitness Landscapes.” <i>Nature Communications</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/s41467-017-00238-8\">https://doi.org/10.1038/s41467-017-00238-8</a>.","ista":"Friedlander T, Prizak R, Barton NH, Tkačik G. 2017. Evolution of new regulatory functions on biophysically realistic fitness landscapes. Nature Communications. 8(1), 216.","apa":"Friedlander, T., Prizak, R., Barton, N. H., &#38; Tkačik, G. (2017). Evolution of new regulatory functions on biophysically realistic fitness landscapes. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41467-017-00238-8\">https://doi.org/10.1038/s41467-017-00238-8</a>","mla":"Friedlander, Tamar, et al. “Evolution of New Regulatory Functions on Biophysically Realistic Fitness Landscapes.” <i>Nature Communications</i>, vol. 8, no. 1, 216, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/s41467-017-00238-8\">10.1038/s41467-017-00238-8</a>.","short":"T. Friedlander, R. Prizak, N.H. Barton, G. Tkačik, Nature Communications 8 (2017)."},"department":[{"_id":"GaTk"},{"_id":"NiBa"}],"oa":1,"isi":1,"issue":"1","article_number":"216","type":"journal_article","date_created":"2018-12-11T11:49:23Z","oa_version":"Published Version","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Evolution of new regulatory functions on biophysically realistic fitness landscapes","related_material":{"record":[{"status":"public","id":"6071","relation":"dissertation_contains"}]},"intvolume":"         8","author":[{"last_name":"Friedlander","first_name":"Tamar","full_name":"Friedlander, Tamar","id":"36A5845C-F248-11E8-B48F-1D18A9856A87"},{"id":"4456104E-F248-11E8-B48F-1D18A9856A87","full_name":"Prizak, Roshan","first_name":"Roshan","last_name":"Prizak"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"first_name":"Gasper","last_name":"Tkacik","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper"}],"article_processing_charge":"Yes (in subscription journal)","year":"2017","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7"},{"_id":"254E9036-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P28844-B27","name":"Biophysics of information processing in gene regulation"}],"pubrep_id":"864","file_date_updated":"2020-07-14T12:48:16Z","doi":"10.1038/s41467-017-00238-8","month":"08","ec_funded":1,"corr_author":"1","publist_id":"6459","publication_identifier":{"issn":["2041-1723"]},"file":[{"checksum":"29a1b5db458048d3bd5c67e0e2a56818","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:48:16Z","access_level":"open_access","file_name":"IST-2017-864-v1+1_s41467-017-00238-8.pdf","file_size":998157,"date_created":"2018-12-12T10:14:14Z","relation":"main_file","file_id":"5064"},{"access_level":"open_access","file_name":"IST-2017-864-v1+2_41467_2017_238_MOESM1_ESM.pdf","file_size":9715993,"checksum":"7b78401e52a576cf3e6bbf8d0abadc17","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:48:16Z","file_id":"5065","date_created":"2018-12-12T10:14:15Z","relation":"main_file"}],"status":"public","day":"09","publication_status":"published","publisher":"Nature Publishing Group","volume":8,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publication":"Nature Communications","external_id":{"isi":["000407198800005"]},"ddc":["539","576"],"quality_controlled":"1"},{"acknowledgement":"Partially supported by the IST Austria Excellence Scholarship.","external_id":{"isi":["000396604900037"]},"ddc":["510"],"quality_controlled":"1","file":[{"file_id":"5329","date_created":"2018-12-12T10:18:10Z","relation":"main_file","file_size":440770,"file_name":"IST-2017-747-v1+1_euclid.ecp.1483347665.pdf","access_level":"open_access","date_updated":"2018-12-12T10:18:10Z","creator":"system","content_type":"application/pdf"}],"status":"public","day":"02","publication_status":"published","publisher":"Institute of Mathematical Statistics","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"volume":21,"publication":"Electronic Communications in Probability","ec_funded":1,"publist_id":"6214","project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"pubrep_id":"747","file_date_updated":"2018-12-12T10:18:10Z","doi":"10.1214/16-ECP38","month":"01","related_material":{"record":[{"relation":"dissertation_contains","id":"6179","status":"public"}]},"intvolume":"        21","author":[{"first_name":"László","orcid":"0000-0001-5366-9603","last_name":"Erdös","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","last_name":"Schröder","orcid":"0000-0002-2904-1856","first_name":"Dominik J"}],"article_processing_charge":"No","year":"2017","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Fluctuations of functions of Wigner matrices","oa":1,"isi":1,"article_number":"86","type":"journal_article","date_created":"2018-12-11T11:50:23Z","oa_version":"Published Version","language":[{"iso":"eng"}],"has_accepted_license":"1","abstract":[{"lang":"eng","text":"We show that matrix elements of functions of N × N Wigner matrices fluctuate on a scale of order N−1/2 and we identify the limiting fluctuation. Our result holds for any function f of the matrix that has bounded variation thus considerably relaxing the regularity requirement imposed in [7, 11]."}],"_id":"1144","date_updated":"2026-04-08T13:55:03Z","department":[{"_id":"LaEr"}],"date_published":"2017-01-02T00:00:00Z","citation":{"ista":"Erdös L, Schröder DJ. 2017. Fluctuations of functions of Wigner matrices. Electronic Communications in Probability. 21, 86.","chicago":"Erdös, László, and Dominik J Schröder. “Fluctuations of Functions of Wigner Matrices.” <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics, 2017. <a href=\"https://doi.org/10.1214/16-ECP38\">https://doi.org/10.1214/16-ECP38</a>.","ieee":"L. Erdös and D. J. Schröder, “Fluctuations of functions of Wigner matrices,” <i>Electronic Communications in Probability</i>, vol. 21. Institute of Mathematical Statistics, 2017.","ama":"Erdös L, Schröder DJ. Fluctuations of functions of Wigner matrices. <i>Electronic Communications in Probability</i>. 2017;21. doi:<a href=\"https://doi.org/10.1214/16-ECP38\">10.1214/16-ECP38</a>","short":"L. Erdös, D.J. Schröder, Electronic Communications in Probability 21 (2017).","mla":"Erdös, László, and Dominik J. Schröder. “Fluctuations of Functions of Wigner Matrices.” <i>Electronic Communications in Probability</i>, vol. 21, 86, Institute of Mathematical Statistics, 2017, doi:<a href=\"https://doi.org/10.1214/16-ECP38\">10.1214/16-ECP38</a>.","apa":"Erdös, L., &#38; Schröder, D. J. (2017). Fluctuations of functions of Wigner matrices. <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/16-ECP38\">https://doi.org/10.1214/16-ECP38</a>"}},{"publication_status":"published","publisher":"Wiley-Blackwell","volume":44,"publication":"Scandinavian Journal of Statistics","publication_identifier":{"issn":["03036898"]},"arxiv":1,"status":"public","day":"01","external_id":{"isi":["000400985000001"],"arxiv":["1410.1242"]},"quality_controlled":"1","month":"06","doi":"10.1111/sjos.12251","publist_id":"5060","main_file_link":[{"url":"http://arxiv.org/abs/1410.1242","open_access":"1"}],"scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Exact goodness-of-fit testing for the Ising model","article_processing_charge":"No","year":"2017","related_material":{"record":[{"status":"public","id":"6473","relation":"part_of_dissertation"}]},"author":[{"last_name":"Martin Del Campo Sanchez","first_name":"Abraham","full_name":"Martin Del Campo Sanchez, Abraham"},{"last_name":"Cepeda Humerez","first_name":"Sarah A","full_name":"Cepeda Humerez, Sarah A","id":"3DEE19A4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Caroline","orcid":"0000-0002-7008-0216","last_name":"Uhler","full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"        44","language":[{"iso":"eng"}],"_id":"2016","date_updated":"2026-04-08T13:55:45Z","abstract":[{"lang":"eng","text":"The Ising model is one of the simplest and most famous models of interacting systems. It was originally proposed to model ferromagnetic interactions in statistical physics and is now widely used to model spatial processes in many areas such as ecology, sociology, and genetics, usually without testing its goodness-of-fit. Here, we propose an exact goodness-of-fit test for the finite-lattice Ising model. The theory of Markov bases has been developed in algebraic statistics for exact goodness-of-fit testing using a Monte Carlo approach. However, this beautiful theory has fallen short of its promise for applications, because finding a Markov basis is usually computationally intractable. We develop a Monte Carlo method for exact goodness-of-fit testing for the Ising model which avoids computing a Markov basis and also leads to a better connectivity of the Markov chain and hence to a faster convergence. We show how this method can be applied to analyze the spatial organization of receptors on the cell membrane."}],"date_published":"2017-06-01T00:00:00Z","page":"285 - 306","citation":{"short":"A. Martin Del Campo Sanchez, S.A. Cepeda Humerez, C. Uhler, Scandinavian Journal of Statistics 44 (2017) 285–306.","mla":"Martin Del Campo Sanchez, Abraham, et al. “Exact Goodness-of-Fit Testing for the Ising Model.” <i>Scandinavian Journal of Statistics</i>, vol. 44, no. 2, Wiley-Blackwell, 2017, pp. 285–306, doi:<a href=\"https://doi.org/10.1111/sjos.12251\">10.1111/sjos.12251</a>.","apa":"Martin Del Campo Sanchez, A., Cepeda Humerez, S. A., &#38; Uhler, C. (2017). Exact goodness-of-fit testing for the Ising model. <i>Scandinavian Journal of Statistics</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/sjos.12251\">https://doi.org/10.1111/sjos.12251</a>","ista":"Martin Del Campo Sanchez A, Cepeda Humerez SA, Uhler C. 2017. Exact goodness-of-fit testing for the Ising model. Scandinavian Journal of Statistics. 44(2), 285–306.","chicago":"Martin Del Campo Sanchez, Abraham, Sarah A Cepeda Humerez, and Caroline Uhler. “Exact Goodness-of-Fit Testing for the Ising Model.” <i>Scandinavian Journal of Statistics</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1111/sjos.12251\">https://doi.org/10.1111/sjos.12251</a>.","ieee":"A. Martin Del Campo Sanchez, S. A. Cepeda Humerez, and C. Uhler, “Exact goodness-of-fit testing for the Ising model,” <i>Scandinavian Journal of Statistics</i>, vol. 44, no. 2. Wiley-Blackwell, pp. 285–306, 2017.","ama":"Martin Del Campo Sanchez A, Cepeda Humerez SA, Uhler C. Exact goodness-of-fit testing for the Ising model. <i>Scandinavian Journal of Statistics</i>. 2017;44(2):285-306. doi:<a href=\"https://doi.org/10.1111/sjos.12251\">10.1111/sjos.12251</a>"},"department":[{"_id":"GaTk"}],"type":"journal_article","date_created":"2018-12-11T11:55:13Z","oa_version":"Preprint","oa":1,"isi":1,"issue":"2"},{"quality_controlled":"1","external_id":{"isi":["000396470600013"]},"ddc":["571"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"volume":18,"publication":"Cell Reports","publication_status":"published","publisher":"Cell Press","status":"public","day":"17","publication_identifier":{"issn":["2211-1247"]},"file":[{"file_size":4427591,"file_name":"IST-2017-751-v1+1_1-s2.0-S2211124716317740-main.pdf","access_level":"open_access","creator":"system","date_updated":"2018-12-12T10:16:09Z","content_type":"application/pdf","file_id":"5195","date_created":"2018-12-12T10:16:09Z","relation":"main_file"}],"publist_id":"6245","ec_funded":1,"month":"01","pubrep_id":"751","file_date_updated":"2018-12-12T10:16:09Z","doi":"10.1016/j.celrep.2016.12.067","project":[{"grant_number":"P24909-B24","name":"Mechanisms of transmitter release at GABAergic synapses","call_identifier":"FWF","_id":"25C26B1E-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","grant_number":"268548","_id":"25C0F108-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","year":"2017","intvolume":"        18","author":[{"first_name":"Chong","last_name":"Chen","id":"3DFD581A-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chong"},{"first_name":"Itaru","last_name":"Arai","full_name":"Arai, Itaru","id":"32A73F6C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Satterield","first_name":"Rachel","full_name":"Satterield, Rachel"},{"full_name":"Young, Samuel","last_name":"Young","first_name":"Samuel"},{"first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"324","status":"public","relation":"dissertation_contains"}]},"title":"Synaptotagmin 2 is the fast Ca2+ sensor at a central inhibitory synapse","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_created":"2018-12-11T11:50:14Z","oa_version":"Published Version","type":"journal_article","issue":"3","isi":1,"oa":1,"_id":"1117","date_updated":"2026-04-08T14:09:28Z","abstract":[{"text":"GABAergic synapses in brain circuits generate inhibitory output signals with submillisecond latency and temporal precision. Whether the molecular identity of the release sensor contributes to these signaling properties remains unclear. Here, we examined the Ca^2+ sensor of exocytosis at GABAergic basket cell (BC) to Purkinje cell (PC) synapses in cerebellum. Immunolabeling suggested that BC terminals selectively expressed synaptotagmin 2 (Syt2), whereas synaptotagmin 1 (Syt1) was enriched in excitatory terminals. Genetic elimination of Syt2 reduced action potential-evoked release to ∼10%, identifying Syt2 as the major Ca^2+ sensor at BC-PC synapses. Differential adenovirus-mediated rescue revealed that Syt2 triggered release with shorter latency and higher temporal precision and mediated faster vesicle pool replenishment than Syt1. Furthermore, deletion of Syt2 severely reduced and delayed disynaptic inhibition following parallel fiber stimulation. Thus, the selective use of Syt2 as release sensor at BC-PC synapses ensures fast and efficient feedforward inhibition in cerebellar microcircuits. #bioimagingfacility-author","lang":"eng"}],"page":"723 - 736","date_published":"2017-01-17T00:00:00Z","department":[{"_id":"PeJo"}],"citation":{"apa":"Chen, C., Arai,  itaru, Satterield, R., Young, S., &#38; Jonas, P. M. (2017). Synaptotagmin 2 is the fast Ca2+ sensor at a central inhibitory synapse. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2016.12.067\">https://doi.org/10.1016/j.celrep.2016.12.067</a>","mla":"Chen, Chong, et al. “Synaptotagmin 2 Is the Fast Ca2+ Sensor at a Central Inhibitory Synapse.” <i>Cell Reports</i>, vol. 18, no. 3, Cell Press, 2017, pp. 723–36, doi:<a href=\"https://doi.org/10.1016/j.celrep.2016.12.067\">10.1016/j.celrep.2016.12.067</a>.","short":"C. Chen,  itaru Arai, R. Satterield, S. Young, P.M. Jonas, Cell Reports 18 (2017) 723–736.","chicago":"Chen, Chong, itaru Arai, Rachel Satterield, Samuel Young, and Peter M Jonas. “Synaptotagmin 2 Is the Fast Ca2+ Sensor at a Central Inhibitory Synapse.” <i>Cell Reports</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.celrep.2016.12.067\">https://doi.org/10.1016/j.celrep.2016.12.067</a>.","ista":"Chen C, Arai  itaru, Satterield R, Young S, Jonas PM. 2017. Synaptotagmin 2 is the fast Ca2+ sensor at a central inhibitory synapse. Cell Reports. 18(3), 723–736.","ieee":"C. Chen,  itaru Arai, R. Satterield, S. Young, and P. M. Jonas, “Synaptotagmin 2 is the fast Ca2+ sensor at a central inhibitory synapse,” <i>Cell Reports</i>, vol. 18, no. 3. Cell Press, pp. 723–736, 2017.","ama":"Chen C, Arai  itaru, Satterield R, Young S, Jonas PM. Synaptotagmin 2 is the fast Ca2+ sensor at a central inhibitory synapse. <i>Cell Reports</i>. 2017;18(3):723-736. doi:<a href=\"https://doi.org/10.1016/j.celrep.2016.12.067\">10.1016/j.celrep.2016.12.067</a>"},"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"has_accepted_license":"1"},{"oa":1,"isi":1,"issue":"8","type":"journal_article","oa_version":"Published Version","date_created":"2018-12-11T11:48:18Z","has_accepted_license":"1","acknowledged_ssus":[{"_id":"PreCl"}],"language":[{"iso":"eng"}],"citation":{"ieee":"C. Chen, R. Satterfield, S. Young, and P. M. Jonas, “Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses,” <i>Cell Reports</i>, vol. 21, no. 8. Cell Press, pp. 2082–2089, 2017.","ama":"Chen C, Satterfield R, Young S, Jonas PM. Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses. <i>Cell Reports</i>. 2017;21(8):2082-2089. doi:<a href=\"https://doi.org/10.1016/j.celrep.2017.10.122\">10.1016/j.celrep.2017.10.122</a>","ista":"Chen C, Satterfield R, Young S, Jonas PM. 2017. Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses. Cell Reports. 21(8), 2082–2089.","chicago":"Chen, Chong, Rachel Satterfield, Samuel Young, and Peter M Jonas. “Triple Function of Synaptotagmin 7 Ensures Efficiency of High-Frequency Transmission at Central GABAergic Synapses.” <i>Cell Reports</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.celrep.2017.10.122\">https://doi.org/10.1016/j.celrep.2017.10.122</a>.","mla":"Chen, Chong, et al. “Triple Function of Synaptotagmin 7 Ensures Efficiency of High-Frequency Transmission at Central GABAergic Synapses.” <i>Cell Reports</i>, vol. 21, no. 8, Cell Press, 2017, pp. 2082–89, doi:<a href=\"https://doi.org/10.1016/j.celrep.2017.10.122\">10.1016/j.celrep.2017.10.122</a>.","short":"C. Chen, R. Satterfield, S. Young, P.M. Jonas, Cell Reports 21 (2017) 2082–2089.","apa":"Chen, C., Satterfield, R., Young, S., &#38; Jonas, P. M. (2017). Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2017.10.122\">https://doi.org/10.1016/j.celrep.2017.10.122</a>"},"date_published":"2017-11-21T00:00:00Z","page":"2082 - 2089","department":[{"_id":"PeJo"}],"date_updated":"2026-04-08T14:09:28Z","_id":"749","abstract":[{"lang":"eng","text":"Synaptotagmin 7 (Syt7) is thought to be a Ca2+ sensor that mediates asynchronous transmitter release and facilitation at synapses. However, Syt7 is strongly expressed in fast-spiking, parvalbumin-expressing GABAergic interneurons, and the output synapses of these neurons produce only minimal asynchronous release and show depression rather than facilitation. To resolve this apparent contradiction, we examined the effects of genetic elimination of Syt7 on synaptic transmission at the GABAergic basket cell (BC)-Purkinje cell (PC) synapse in cerebellum. Our results indicate that at the BC-PC synapse, Syt7 contributes to asynchronous release, pool replenishment, and facilitation. In combination, these three effects ensure efficient transmitter release during high-frequency activity and guarantee frequency independence of inhibition. Our results identify a distinct function of Syt7: ensuring the efficiency of high-frequency inhibitory synaptic transmission"}],"related_material":{"record":[{"id":"324","status":"public","relation":"dissertation_contains"}]},"author":[{"full_name":"Chen, Chong","id":"3DFD581A-F248-11E8-B48F-1D18A9856A87","first_name":"Chong","last_name":"Chen"},{"full_name":"Satterfield, Rachel","last_name":"Satterfield","first_name":"Rachel"},{"full_name":"Young, Samuel","first_name":"Samuel","last_name":"Young"},{"last_name":"Jonas","orcid":"0000-0001-5001-4804","first_name":"Peter M","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"        21","year":"2017","article_processing_charge":"No","scopus_import":"1","title":"Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"corr_author":"1","publist_id":"6907","project":[{"call_identifier":"FWF","grant_number":"P24909-B24","name":"Mechanisms of transmitter release at GABAergic synapses","_id":"25C26B1E-B435-11E9-9278-68D0E5697425"},{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","grant_number":"692692","call_identifier":"H2020"}],"doi":"10.1016/j.celrep.2017.10.122","pubrep_id":"874","file_date_updated":"2020-07-14T12:47:59Z","month":"11","external_id":{"isi":["000416216700007"]},"ddc":["570","571"],"quality_controlled":"1","file":[{"file_size":2759195,"file_name":"IST-2017-874-v1+1_PIIS2211124717316029.pdf","access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:47:59Z","content_type":"application/pdf","checksum":"a6afa3764909bf6edafa07982d8e1cee","file_id":"4737","date_created":"2018-12-12T10:09:14Z","relation":"main_file"}],"publication_identifier":{"issn":["2211-1247"]},"day":"21","status":"public","publisher":"Cell Press","publication_status":"published","publication":"Cell Reports","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"volume":21},{"isi":1,"oa":1,"issue":"3","type":"journal_article","date_created":"2018-12-11T11:50:00Z","oa_version":"Preprint","language":[{"iso":"eng"}],"date_published":"2017-03-01T00:00:00Z","page":"1335 - 1351","citation":{"chicago":"Ringbauer, Harald, Graham Coop, and Nicholas H Barton. “Inferring Recent Demography from Isolation by Distance of Long Shared Sequence Blocks.” <i>Genetics</i>. Genetics Society of America, 2017. <a href=\"https://doi.org/10.1534/genetics.116.196220\">https://doi.org/10.1534/genetics.116.196220</a>.","ista":"Ringbauer H, Coop G, Barton NH. 2017. Inferring recent demography from isolation by distance of long shared sequence blocks. Genetics. 205(3), 1335–1351.","ieee":"H. Ringbauer, G. Coop, and N. H. Barton, “Inferring recent demography from isolation by distance of long shared sequence blocks,” <i>Genetics</i>, vol. 205, no. 3. Genetics Society of America, pp. 1335–1351, 2017.","ama":"Ringbauer H, Coop G, Barton NH. Inferring recent demography from isolation by distance of long shared sequence blocks. <i>Genetics</i>. 2017;205(3):1335-1351. doi:<a href=\"https://doi.org/10.1534/genetics.116.196220\">10.1534/genetics.116.196220</a>","apa":"Ringbauer, H., Coop, G., &#38; Barton, N. H. (2017). Inferring recent demography from isolation by distance of long shared sequence blocks. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.116.196220\">https://doi.org/10.1534/genetics.116.196220</a>","short":"H. Ringbauer, G. Coop, N.H. Barton, Genetics 205 (2017) 1335–1351.","mla":"Ringbauer, Harald, et al. “Inferring Recent Demography from Isolation by Distance of Long Shared Sequence Blocks.” <i>Genetics</i>, vol. 205, no. 3, Genetics Society of America, 2017, pp. 1335–51, doi:<a href=\"https://doi.org/10.1534/genetics.116.196220\">10.1534/genetics.116.196220</a>."},"department":[{"_id":"NiBa"}],"_id":"1074","abstract":[{"lang":"eng","text":"Recently it has become feasible to detect long blocks of nearly identical sequence shared between pairs of genomes. These IBD blocks are direct traces of recent coalescence events and, as such, contain ample signal to infer recent demography. Here, we examine sharing of such blocks in two-dimensional populations with local migration. Using a diffusion approximation to trace genetic ancestry, we derive analytical formulae for patterns of isolation by distance of IBD blocks, which can also incorporate recent population density changes. We introduce an inference scheme that uses a composite likelihood approach to fit these formulae. We then extensively evaluate our theory and inference method on a range of scenarios using simulated data. We first validate the diffusion approximation by showing that the theoretical results closely match the simulated block sharing patterns. We then demonstrate that our inference scheme can accurately and robustly infer dispersal rate and effective density, as well as bounds on recent dynamics of population density. To demonstrate an application, we use our estimation scheme to explore the fit of a diffusion model to Eastern European samples in the POPRES data set. We show that ancestry diffusing with a rate of σ ≈ 50–100 km/√gen during the last centuries, combined with accelerating population growth, can explain the observed exponential decay of block sharing with increasing pairwise sample distance."}],"date_updated":"2026-04-08T14:06:35Z","related_material":{"record":[{"id":"200","status":"public","relation":"dissertation_contains"}]},"author":[{"full_name":"Ringbauer, Harald","id":"417FCFF4-F248-11E8-B48F-1D18A9856A87","last_name":"Ringbauer","orcid":"0000-0002-4884-9682","first_name":"Harald"},{"first_name":"Graham","last_name":"Coop","full_name":"Coop, Graham"},{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"}],"intvolume":"       205","year":"2017","article_processing_charge":"No","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Inferring recent demography from isolation by distance of long shared sequence blocks","ec_funded":1,"main_file_link":[{"url":"http://www.biorxiv.org/content/early/2016/09/23/076810","open_access":"1"}],"publist_id":"6307","project":[{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"doi":"10.1534/genetics.116.196220","month":"03","external_id":{"isi":["000395807200023"]},"quality_controlled":"1","publication_identifier":{"issn":["0016-6731"]},"day":"01","status":"public","publisher":"Genetics Society of America","publication_status":"published","publication":"Genetics","volume":205},{"quality_controlled":"1","day":"18","status":"public","publication_identifier":{"isbn":["978-331970696-2"]},"volume":10625,"publisher":"Springer","publication_status":"published","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/893.pdf"}],"publist_id":"7257","corr_author":"1","doi":"10.1007/978-3-319-70697-9_13","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"month":"11","author":[{"first_name":"Hamza M","last_name":"Abusalah","id":"40297222-F248-11E8-B48F-1D18A9856A87","full_name":"Abusalah, Hamza M"},{"full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F"},{"first_name":"Bram","last_name":"Cohen","full_name":"Cohen, Bram"},{"first_name":"Danylo","last_name":"Khilko","full_name":"Khilko, Danylo"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"},{"last_name":"Reyzin","first_name":"Leonid","full_name":"Reyzin, Leonid"}],"intvolume":"     10625","related_material":{"record":[{"relation":"dissertation_contains","id":"83","status":"public"}]},"year":"2017","conference":{"location":"Hong Kong, China","start_date":"2017-12-03","end_date":"2017-12-07","name":"ASIACRYPT: Theory and Applications of Cryptology and Information Security"},"title":"Beyond Hellman’s time-memory trade-offs with applications to proofs of space","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"alternative_title":["LNCS"],"oa":1,"date_created":"2018-12-11T11:47:10Z","oa_version":"Submitted Version","type":"conference","date_published":"2017-11-18T00:00:00Z","department":[{"_id":"KrPi"}],"citation":{"ista":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625, 357–379.","chicago":"Abusalah, Hamza M, Joel F Alwen, Bram Cohen, Danylo Khilko, Krzysztof Z Pietrzak, and Leonid Reyzin. “Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space,” 10625:357–79. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-70697-9_13\">https://doi.org/10.1007/978-3-319-70697-9_13</a>.","ama":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. In: Vol 10625. Springer; 2017:357-379. doi:<a href=\"https://doi.org/10.1007/978-3-319-70697-9_13\">10.1007/978-3-319-70697-9_13</a>","ieee":"H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.","short":"H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.","mla":"Abusalah, Hamza M., et al. <i>Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space</i>. Vol. 10625, Springer, 2017, pp. 357–79, doi:<a href=\"https://doi.org/10.1007/978-3-319-70697-9_13\">10.1007/978-3-319-70697-9_13</a>.","apa":"Abusalah, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., &#38; Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China: Springer. <a href=\"https://doi.org/10.1007/978-3-319-70697-9_13\">https://doi.org/10.1007/978-3-319-70697-9_13</a>"},"page":"357 - 379","_id":"559","date_updated":"2026-04-08T14:10:21Z","abstract":[{"lang":"eng","text":"Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather sophisticated graph pebbling lower bounds. Much simpler and in several aspects more efficient schemes based on inverting random functions have been suggested, but they don’t give meaningful security guarantees due to existing time-memory trade-offs. In particular, Hellman showed that any permutation over a domain of size N can be inverted in time T by an algorithm that is given S bits of auxiliary information whenever (Formula presented). For functions Hellman gives a weaker attack with S2· T≈ N2 (e.g., S= T≈ N2/3). To prove lower bounds, one considers an adversary who has access to an oracle f: [ N] → [N] and can make T oracle queries. The best known lower bound is S· T∈ Ω(N) and holds for random functions and permutations. We construct functions that provably require more time and/or space to invert. Specifically, for any constant k we construct a function [N] → [N] that cannot be inverted unless Sk· T∈ Ω(Nk) (in particular, S= T≈ (Formula presented). Our construction does not contradict Hellman’s time-memory trade-off, because it cannot be efficiently evaluated in forward direction. However, its entire function table can be computed in time quasilinear in N, which is sufficient for the PoS application. Our simplest construction is built from a random function oracle g: [N] × [N] → [ N] and a random permutation oracle f: [N] → N] and is defined as h(x) = g(x, x′) where f(x) = π(f(x′)) with π being any involution without a fixed point, e.g. flipping all the bits. For this function we prove that any adversary who gets S bits of auxiliary information, makes at most T oracle queries, and inverts h on an ϵ fraction of outputs must satisfy S2· T∈ Ω(ϵ2N2)."}],"language":[{"iso":"eng"}]},{"type":"journal_article","date_created":"2018-12-11T11:48:47Z","oa_version":"Published Version","oa":1,"isi":1,"issue":"9","has_accepted_license":"1","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"}],"page":"5706 - 5710","citation":{"ama":"Vukušić L, Kukucka J, Watzinger H, Katsaros G. Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry. <i>Nano Letters</i>. 2017;17(9):5706-5710. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.7b02627\">10.1021/acs.nanolett.7b02627</a>","ieee":"L. Vukušić, J. Kukucka, H. Watzinger, and G. Katsaros, “Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry,” <i>Nano Letters</i>, vol. 17, no. 9. American Chemical Society, pp. 5706–5710, 2017.","chicago":"Vukušić, Lada, Josip Kukucka, Hannes Watzinger, and Georgios Katsaros. “Fast Hole Tunneling Times in Germanium Hut Wires Probed by Single-Shot Reflectometry.” <i>Nano Letters</i>. American Chemical Society, 2017. <a href=\"https://doi.org/10.1021/acs.nanolett.7b02627\">https://doi.org/10.1021/acs.nanolett.7b02627</a>.","ista":"Vukušić L, Kukucka J, Watzinger H, Katsaros G. 2017. Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry. Nano Letters. 17(9), 5706–5710.","apa":"Vukušić, L., Kukucka, J., Watzinger, H., &#38; Katsaros, G. (2017). Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.7b02627\">https://doi.org/10.1021/acs.nanolett.7b02627</a>","mla":"Vukušić, Lada, et al. “Fast Hole Tunneling Times in Germanium Hut Wires Probed by Single-Shot Reflectometry.” <i>Nano Letters</i>, vol. 17, no. 9, American Chemical Society, 2017, pp. 5706–10, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.7b02627\">10.1021/acs.nanolett.7b02627</a>.","short":"L. Vukušić, J. Kukucka, H. Watzinger, G. Katsaros, Nano Letters 17 (2017) 5706–5710."},"department":[{"_id":"GeKa"}],"date_published":"2017-08-10T00:00:00Z","abstract":[{"text":"Heavy holes confined in quantum dots are predicted to be promising candidates for the realization of spin qubits with long coherence times. Here we focus on such heavy-hole states confined in germanium hut wires. By tuning the growth density of the latter we can realize a T-like structure between two neighboring wires. Such a structure allows the realization of a charge sensor, which is electrostatically and tunnel coupled to a quantum dot, with charge-transfer signals as high as 0.3 e. By integrating the T-like structure into a radiofrequency reflectometry setup, single-shot measurements allowing the extraction of hole tunneling times are performed. The extracted tunneling times of less than 10 μs are attributed to the small effective mass of Ge heavy-hole states and pave the way toward projective spin readout measurements.","lang":"eng"}],"_id":"840","date_updated":"2026-04-08T14:09:47Z","year":"2017","article_processing_charge":"No","related_material":{"record":[{"relation":"popular_science","id":"7977"},{"relation":"dissertation_contains","status":"public","id":"7996"},{"status":"public","id":"69","relation":"dissertation_contains"}]},"intvolume":"        17","author":[{"full_name":"Vukusic, Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","first_name":"Lada","orcid":"0000-0003-2424-8636","last_name":"Vukusic"},{"full_name":"Kukucka, Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","last_name":"Kukucka","first_name":"Josip"},{"first_name":"Hannes","last_name":"Watzinger","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","full_name":"Watzinger, Hannes"},{"full_name":"Katsaros, Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","last_name":"Katsaros","first_name":"Georgios"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry","corr_author":"1","publist_id":"6808","ec_funded":1,"month":"08","project":[{"name":"Towards Spin qubits and Majorana fermions in Germanium self assembled hut-wires","grant_number":"335497","call_identifier":"FP7","_id":"25517E86-B435-11E9-9278-68D0E5697425"}],"doi":"10.1021/acs.nanolett.7b02627","file_date_updated":"2020-07-14T12:48:13Z","pubrep_id":"865","external_id":{"isi":["000411043500078"]},"ddc":["539"],"quality_controlled":"1","publisher":"American Chemical Society","publication_status":"published","publication":"Nano Letters","volume":17,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"access_level":"open_access","file_name":"IST-2017-865-v1+1_acs.nanolett.7b02627.pdf","file_size":2449546,"content_type":"application/pdf","checksum":"761371a0129b2aa442424b9561450ece","creator":"system","date_updated":"2020-07-14T12:48:13Z","file_id":"4951","date_created":"2018-12-12T10:12:33Z","relation":"main_file"}],"publication_identifier":{"issn":["1530-6984"]},"day":"10","status":"public"},{"quality_controlled":"1","ddc":["510","539"],"external_id":{"arxiv":["1606.07353"],"isi":["000396611900025"]},"volume":22,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publication":"Electronic Journal of Probability","publication_status":"published","publisher":"Institute of Mathematical Statistics","status":"public","day":"08","publication_identifier":{"issn":["1083-6489"]},"arxiv":1,"file":[{"relation":"main_file","date_created":"2018-12-12T10:13:39Z","file_id":"5024","content_type":"application/pdf","date_updated":"2018-12-12T10:13:39Z","creator":"system","access_level":"open_access","file_name":"IST-2017-807-v1+1_euclid.ejp.1488942016.pdf","file_size":639384}],"publist_id":"6386","ec_funded":1,"month":"03","pubrep_id":"807","file_date_updated":"2018-12-12T10:13:39Z","doi":"10.1214/17-EJP42","project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","year":"2017","intvolume":"        22","author":[{"first_name":"Johannes","last_name":"Alt","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","full_name":"Alt, Johannes"},{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László"},{"first_name":"Torben H","orcid":"0000-0002-4821-3297","last_name":"Krüger","id":"3020C786-F248-11E8-B48F-1D18A9856A87","full_name":"Krüger, Torben H"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"149"}]},"title":"Local law for random Gram matrices","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"Published Version","date_created":"2018-12-11T11:49:40Z","article_number":"25","type":"journal_article","oa":1,"isi":1,"abstract":[{"lang":"eng","text":"We prove a local law in the bulk of the spectrum for random Gram matrices XX∗, a generalization of sample covariance matrices, where X is a large matrix with independent, centered entries with arbitrary variances. The limiting eigenvalue density that generalizes the Marchenko-Pastur law is determined by solving a system of nonlinear equations. Our entrywise and averaged local laws are on the optimal scale with the optimal error bounds. They hold both in the square case (hard edge) and in the properly rectangular case (soft edge). In the latter case we also establish a macroscopic gap away from zero in the spectrum of XX∗. "}],"_id":"1010","date_updated":"2026-04-08T14:11:36Z","citation":{"short":"J. Alt, L. Erdös, T.H. Krüger, Electronic Journal of Probability 22 (2017).","mla":"Alt, Johannes, et al. “Local Law for Random Gram Matrices.” <i>Electronic Journal of Probability</i>, vol. 22, 25, Institute of Mathematical Statistics, 2017, doi:<a href=\"https://doi.org/10.1214/17-EJP42\">10.1214/17-EJP42</a>.","apa":"Alt, J., Erdös, L., &#38; Krüger, T. H. (2017). Local law for random Gram matrices. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/17-EJP42\">https://doi.org/10.1214/17-EJP42</a>","ama":"Alt J, Erdös L, Krüger TH. Local law for random Gram matrices. <i>Electronic Journal of Probability</i>. 2017;22. doi:<a href=\"https://doi.org/10.1214/17-EJP42\">10.1214/17-EJP42</a>","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “Local law for random Gram matrices,” <i>Electronic Journal of Probability</i>, vol. 22. Institute of Mathematical Statistics, 2017.","ista":"Alt J, Erdös L, Krüger TH. 2017. Local law for random Gram matrices. Electronic Journal of Probability. 22, 25.","chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “Local Law for Random Gram Matrices.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2017. <a href=\"https://doi.org/10.1214/17-EJP42\">https://doi.org/10.1214/17-EJP42</a>."},"department":[{"_id":"LaEr"}],"date_published":"2017-03-08T00:00:00Z","language":[{"iso":"eng"}],"has_accepted_license":"1"},{"language":[{"iso":"eng"}],"has_accepted_license":"1","_id":"550","date_updated":"2026-04-08T14:11:36Z","abstract":[{"lang":"eng","text":"For large random matrices X with independent, centered entries but not necessarily identical variances, the eigenvalue density of XX* is well-approximated by a deterministic measure on ℝ. We show that the density of this measure has only square and cubic-root singularities away from zero. We also extend the bulk local law in [5] to the vicinity of these singularities."}],"date_published":"2017-11-21T00:00:00Z","citation":{"chicago":"Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics, 2017. <a href=\"https://doi.org/10.1214/17-ECP97\">https://doi.org/10.1214/17-ECP97</a>.","ista":"Alt J. 2017. Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. 22, 63.","ieee":"J. Alt, “Singularities of the density of states of random Gram matrices,” <i>Electronic Communications in Probability</i>, vol. 22. Institute of Mathematical Statistics, 2017.","ama":"Alt J. Singularities of the density of states of random Gram matrices. <i>Electronic Communications in Probability</i>. 2017;22. doi:<a href=\"https://doi.org/10.1214/17-ECP97\">10.1214/17-ECP97</a>","apa":"Alt, J. (2017). Singularities of the density of states of random Gram matrices. <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/17-ECP97\">https://doi.org/10.1214/17-ECP97</a>","mla":"Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” <i>Electronic Communications in Probability</i>, vol. 22, 63, Institute of Mathematical Statistics, 2017, doi:<a href=\"https://doi.org/10.1214/17-ECP97\">10.1214/17-ECP97</a>.","short":"J. Alt, Electronic Communications in Probability 22 (2017)."},"department":[{"_id":"LaEr"}],"article_number":"63","type":"journal_article","date_created":"2018-12-11T11:47:07Z","oa_version":"Published Version","oa":1,"isi":1,"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Singularities of the density of states of random Gram matrices","article_processing_charge":"No","year":"2017","related_material":{"record":[{"id":"149","status":"public","relation":"dissertation_contains"}]},"intvolume":"        22","author":[{"id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","full_name":"Alt, Johannes","first_name":"Johannes","last_name":"Alt"}],"month":"11","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"pubrep_id":"926","file_date_updated":"2020-07-14T12:47:00Z","doi":"10.1214/17-ECP97","corr_author":"1","publist_id":"7265","ec_funded":1,"publication_status":"published","publisher":"Institute of Mathematical Statistics","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"volume":22,"publication":"Electronic Communications in Probability","publication_identifier":{"issn":["1083-589X"]},"file":[{"access_level":"open_access","file_name":"IST-2018-926-v1+1_euclid.ecp.1511233247.pdf","file_size":470876,"checksum":"0ec05303a0de190de145654237984c79","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:47:00Z","file_id":"4663","date_created":"2018-12-12T10:08:04Z","relation":"main_file"}],"status":"public","day":"21","ddc":["539"],"external_id":{"isi":["000416389200001"]},"quality_controlled":"1"},{"publist_id":"6926","corr_author":"1","ec_funded":1,"month":"11","doi":"10.1007/s00220-017-2980-0","file_date_updated":"2020-07-14T12:47:57Z","pubrep_id":"880","project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"},{"grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","ddc":["539"],"external_id":{"isi":["000409821300010"]},"publication":"Communications in Mathematical Physics","volume":356,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publisher":"Springer","publication_status":"published","day":"01","status":"public","file":[{"creator":"system","date_updated":"2020-07-14T12:47:57Z","content_type":"application/pdf","checksum":"0fd9435400f91e9b3c5346319a2d24e3","file_size":952639,"access_level":"open_access","file_name":"IST-2017-880-v1+1_s00220-017-2980-0.pdf","date_created":"2018-12-12T10:10:50Z","relation":"main_file","file_id":"4841"}],"publication_identifier":{"issn":["0010-3616"]},"date_created":"2018-12-11T11:48:15Z","oa_version":"Published Version","type":"journal_article","issue":"1","isi":1,"oa":1,"department":[{"_id":"RoSe"}],"date_published":"2017-11-01T00:00:00Z","citation":{"short":"T. Moser, R. Seiringer, Communications in Mathematical Physics 356 (2017) 329–355.","mla":"Moser, Thomas, and Robert Seiringer. “Stability of a Fermionic N+1 Particle System with Point Interactions.” <i>Communications in Mathematical Physics</i>, vol. 356, no. 1, Springer, 2017, pp. 329–55, doi:<a href=\"https://doi.org/10.1007/s00220-017-2980-0\">10.1007/s00220-017-2980-0</a>.","apa":"Moser, T., &#38; Seiringer, R. (2017). Stability of a fermionic N+1 particle system with point interactions. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-017-2980-0\">https://doi.org/10.1007/s00220-017-2980-0</a>","ama":"Moser T, Seiringer R. Stability of a fermionic N+1 particle system with point interactions. <i>Communications in Mathematical Physics</i>. 2017;356(1):329-355. doi:<a href=\"https://doi.org/10.1007/s00220-017-2980-0\">10.1007/s00220-017-2980-0</a>","ieee":"T. Moser and R. Seiringer, “Stability of a fermionic N+1 particle system with point interactions,” <i>Communications in Mathematical Physics</i>, vol. 356, no. 1. Springer, pp. 329–355, 2017.","ista":"Moser T, Seiringer R. 2017. Stability of a fermionic N+1 particle system with point interactions. Communications in Mathematical Physics. 356(1), 329–355.","chicago":"Moser, Thomas, and Robert Seiringer. “Stability of a Fermionic N+1 Particle System with Point Interactions.” <i>Communications in Mathematical Physics</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00220-017-2980-0\">https://doi.org/10.1007/s00220-017-2980-0</a>."},"page":"329 - 355","_id":"741","date_updated":"2026-04-08T14:12:30Z","abstract":[{"text":"We prove that a system of N fermions interacting with an additional particle via point interactions is stable if the ratio of the mass of the additional particle to the one of the fermions is larger than some critical m*. The value of m* is independent of N and turns out to be less than 1. This fact has important implications for the stability of the unitary Fermi gas. We also characterize the domain of the Hamiltonian of this model, and establish the validity of the Tan relations for all wave functions in the domain.","lang":"eng"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"year":"2017","article_processing_charge":"No","intvolume":"       356","author":[{"first_name":"Thomas","last_name":"Moser","full_name":"Moser, Thomas","id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}],"related_material":{"record":[{"status":"public","id":"52","relation":"dissertation_contains"}]},"title":"Stability of a fermionic N+1 particle system with point interactions","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1"},{"oa_version":"Published Version","date_created":"2018-12-11T11:48:41Z","type":"dissertation","oa":1,"page":"87","citation":{"apa":"Jesse, F. (2017). <i>The lac operon in the wild</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_857\">https://doi.org/10.15479/AT:ISTA:th_857</a>","mla":"Jesse, Fabienne. <i>The Lac Operon in the Wild</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_857\">10.15479/AT:ISTA:th_857</a>.","short":"F. Jesse, The Lac Operon in the Wild, Institute of Science and Technology Austria, 2017.","ieee":"F. Jesse, “The lac operon in the wild,” Institute of Science and Technology Austria, 2017.","ama":"Jesse F. The lac operon in the wild. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_857\">10.15479/AT:ISTA:th_857</a>","chicago":"Jesse, Fabienne. “The Lac Operon in the Wild.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_857\">https://doi.org/10.15479/AT:ISTA:th_857</a>.","ista":"Jesse F. 2017. The lac operon in the wild. Institute of Science and Technology Austria."},"department":[{"_id":"JoBo"}],"date_published":"2017-08-25T00:00:00Z","abstract":[{"text":"The lac operon is a classic model system for bacterial gene regulation, and has been studied extensively in E. coli, a classic model organism. However, not much is known about E. coli’s ecology and life outside the laboratory, in particular in soil and water environments. The natural diversity of the lac operon outside the laboratory, its role in the ecology of E. coli and the selection pressures it is exposed to, are similarly unknown.\r\nIn Chapter Two of this thesis, I explore the genetic diversity, phylogenetic history and signatures of selection of the lac operon across 20 natural isolates of E. coli and divergent clades of Escherichia. I found that complete lac operons were present in all isolates examined, which in all but one case were functional. The lac operon phylogeny conformed to the whole-genome phylogeny of the divergent Escherichia clades, which excludes horizontal gene transfer as an explanation for the presence of functional lac operons in these clades. All lac operon genes showed a signature of purifying selection; this signature was strongest for the lacY gene. Lac operon genes of human and environmental isolates showed similar signatures of selection, except the lacZ gene, which showed a stronger signature of selection in environmental isolates.\r\nIn Chapter Three, I try to identify the natural genetic variation relevant for phenotype and fitness in the lac operon, comparing growth rate on lactose and LacZ activity of the lac operons of these wild isolates in a common genetic background. Sequence variation in the lac promoter region, upstream of the -10 and -35 RNA polymerase binding motif, predicted variation in LacZ activity at full induction, using a thermodynamic model of polymerase binding (Tugrul, 2016). However, neither variation in LacZ activity, nor RNA polymerase binding predicted by the model correlated with variation in growth rate. Lac operons of human and environmental isolates did not differ systematically in either growth rate on lactose or LacZ protein activity, suggesting that these lac operons have been exposed to similar selection pressures. We thus have no evidence that the phenotypic variation we measured is relevant for fitness.\r\nTo start assessing the effect of genomic background on the growth phenotype conferred by the lac operon, I compared growth on minimal medium with lactose between lac operon constructs and the corresponding original isolates, I found that maximal growth rate was determined by genomic background, with almost all backgrounds conferring higher growth rates than lab strain K12 MG1655. However, I found no evidence that the lactose concentration at which growth was half maximal depended on genomic background.","lang":"eng"}],"_id":"820","date_updated":"2026-04-08T14:18:16Z","has_accepted_license":"1","language":[{"iso":"eng"}],"year":"2017","article_processing_charge":"No","author":[{"last_name":"Jesse","first_name":"Fabienne","full_name":"Jesse, Fabienne","id":"4C8C26A4-F248-11E8-B48F-1D18A9856A87"}],"alternative_title":["ISTA Thesis"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","title":"The lac operon in the wild","publist_id":"6829","corr_author":"1","OA_place":"publisher","ec_funded":1,"month":"08","doi":"10.15479/AT:ISTA:th_857","file_date_updated":"2020-07-14T12:48:10Z","pubrep_id":"857","project":[{"grant_number":"648440","name":"Selective Barriers to Horizontal Gene Transfer","call_identifier":"H2020","_id":"2578D616-B435-11E9-9278-68D0E5697425"}],"ddc":["576","577","579"],"acknowledgement":"ERC H2020 programme (grant agreement no. 648440)\r\nThanks to Jon Bollback for giving me the chance to do this work, for sharing the ideas that lay at the basis of this work, for his honesty and openness, showing himself to me as a person and not just as a boss. Thanks to Nick Barton for his guidance at the last stage, reading and commenting extensively on several versions of this manuscript, and for his encouragement; thanks to both Jon and Nick for their kindness and patience. Thanks to Erik van Nimwegen and Calin Guet for their time and willingness to be in my thesis committee, and to Erik van Nimwegen especially for agreeing to enter my thesis committee at the last moment, and for his very sharp, helpful and relevant comments during and after the defense. Thanks to my collaborators and discussion partners: Anne Kupczok, for her guidance, ideas and discussions during the construction of the manuscript of Chapter Two, and her comments on the manuscript; Georg Rieckh for making me aware of the issue of parameter identifiability, suggesting how to solve it, and for his unfortunate idea to start the plasmid enterprise in the first place; Murat Tugrul for sharing his model, for his enthusiasm, and his comments on Chapter Three; Srdjan Sarikas for his collaboration on the Monod model fitting, fast forwarding the analysis to turbo speed and making beautiful figures, and making the discussion fun on top of it all; Vanessa Barone for her last minute comments, especially on Chapter Three, providing a sharp and very helpful experimentalist perspective at the last moment; Maros Pleska and Marjon de Vos for their comments on the manuscript of Chapter Two; Gasper Tkacik for his crucial input on the relation between growth rate and lactose concentration; Bor Kavcic for his input on growth rate modeling and error propagation. Thanks to the Bollback, Bollenbach, Barton, Guet and Tkacik group members for both pro- viding an inspiring and supportive scientific environment to work in, as well as a lot of warmth and colour to everyday life. And thanks to the friends I found here, to the people who were there for me and to the people who changed my life, making it stranger and more beautiful than I could have imagined, Maros, Vanessa, Tade, Suzi, Andrej, Peter, Tiago, Kristof, Karin, Irene, Misha, Mato, Guillaume and Zanin. ","supervisor":[{"full_name":"Bollback, Jonathan P","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P","orcid":"0000-0002-4624-4612","last_name":"Bollback"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","publication_status":"published","day":"25","status":"public","file":[{"date_updated":"2020-07-14T12:48:10Z","creator":"system","content_type":"application/pdf","checksum":"c62257a7bff0c5f39e1abffc6bfcca5c","file_size":3417773,"file_name":"IST-2017-857-v1+1_thesis_fabienne.pdf","access_level":"open_access","date_created":"2018-12-12T10:17:00Z","relation":"main_file","file_id":"5252"},{"creator":"dernst","date_updated":"2020-07-14T12:48:10Z","content_type":"application/x-tex","checksum":"fc87d7d72fce52824a3ae7dcad0413a8","file_size":215899,"access_level":"closed","file_name":"2017_thesis_Jesse_source.tex","date_created":"2019-04-05T08:51:59Z","relation":"source_file","file_id":"6212"}],"publication_identifier":{"issn":["2663-337X"]}},{"month":"01","file_date_updated":"2021-02-22T11:52:56Z","OA_place":"publisher","corr_author":"1","publist_id":"6233","degree_awarded":"PhD","publication_status":"published","publisher":"Institute of Science and Technology Austria","publication_identifier":{"issn":["2663-337X"]},"file":[{"file_name":"IST_Austria_Thesis_Tomáš_Prát.pdf","access_level":"closed","file_size":10285946,"content_type":"application/pdf","checksum":"d192c7c6c5ea32c8432437286dc4909e","date_updated":"2019-04-05T08:45:14Z","creator":"dernst","file_id":"6209","relation":"main_file","date_created":"2019-04-05T08:45:14Z"},{"content_type":"application/pdf","checksum":"bab18b52cf98145926042d8ed99fdb3b","date_updated":"2021-02-22T11:52:56Z","creator":"dernst","access_level":"open_access","file_name":"2017_Thesis_Prat.pdf","success":1,"file_size":9802991,"date_created":"2021-02-22T11:52:56Z","relation":"main_file","file_id":"9185"}],"status":"public","day":"12","supervisor":[{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","first_name":"Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml"}],"acknowledgement":"I would like to first acknowledge my supervisor Jiří Friml for support, kind advice and patience. It was a pleasure to be a part of your lab, Jiří. I will remember the atmosphere present in auxin lab at VIB in Ghent and at IST in Klosterneuburg forever. I would like to thank all past and present lab members for the friendship and friendly and scientific environment in the groups. It was so nice to cooperate with you, guys. There was always someone who helped me with experiments, troubleshoot issues coming from our work etc. At this place, I would like to thank especially to Gergo Molnár. I’m happy (and lucky) that I have met him; he naturally became my tutor and guide through my PhD. From no one else during my entire professional career, I’ve learned that much.","ddc":["580"],"language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2026-04-08T14:17:39Z","_id":"1127","abstract":[{"lang":"eng","text":"Plant hormone auxin and its transport between cells belong to the most important\r\nmechanisms controlling plant development. Auxin itself could change localization of PINs and\r\nthereby control direction of its own flow. We performed an expression profiling experiment\r\nin Arabidopsis roots to identify potential regulators of PIN polarity which are transcriptionally\r\nregulated by auxin signalling. We identified several novel regulators and performed a detailed\r\ncharacterization of the transcription factor WRKY23 (At2g47260) and its role in auxin\r\nfeedback on PIN polarity. Gain-of-function and dominant-negative mutants revealed that\r\nWRKY23 plays a crucial role in mediating the auxin effect on PIN polarity. In concordance,\r\ntypical polar auxin transport processes such as gravitropism and leaf vascular pattern\r\nformation were disturbed by interfering with WRKY23 function.\r\nIn order to identify direct targets of WRKY23, we performed consequential expression\r\nprofiling experiments using a WRKY23 inducible gain-of-function line and dominant-negative\r\nWRKY23 line that is defunct in PIN re-arrangement. Among several genes mostly related to\r\nthe groups of cell wall and defense process regulators, we identified LYSINE-HISTIDINE\r\nTRANSPORTER 1 (LHT1; At5g40780), a small amino acid permease gene from the amino\r\nacid/auxin permease family (AAAP), we present its detailed characterisation in auxin feedback\r\non PIN repolarization, identified its transcriptional regulation, we propose a potential\r\nmechanism of its action. Moreover, we identified also a member of receptor-like protein\r\nkinase LRR-RLK (LEUCINE-RICH REPEAT TRANSMEMBRANE PROTEIN KINASE PROTEIN 1;\r\nLRRK1; At1g05700), which also affects auxin-dependent PIN re-arrangement. We described\r\nits transcriptional behaviour, subcellular localization. Based on global expression data, we\r\ntried to identify ligand responsible for mechanism of signalling and suggest signalling partner\r\nand interactors. Additionally, we described role of novel phytohormone group, strigolactone,\r\nin auxin-dependent PIN re-arrangement, that could be a fundament for future studies in this\r\nfield.\r\nOur results provide first insights into an auxin transcriptional network targeting PIN\r\nlocalization and thus regulating plant development. We highlighted WRKY23 transcriptional\r\nnetwork and characterised its mediatory role in plant development. We identified direct\r\neffectors of this network, LHT1 and LRRK1, and describe their roles in PIN re-arrangement and\r\nPIN-dependent auxin transport processes."}],"page":"131","citation":{"apa":"Prat, T. (2017). <i>Identification of novel regulators of PIN polarity and development of novel auxin sensor</i>. Institute of Science and Technology Austria.","short":"T. Prat, Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor, Institute of Science and Technology Austria, 2017.","mla":"Prat, Tomas. <i>Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor</i>. Institute of Science and Technology Austria, 2017.","chicago":"Prat, Tomas. “Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor.” Institute of Science and Technology Austria, 2017.","ista":"Prat T. 2017. Identification of novel regulators of PIN polarity and development of novel auxin sensor. Institute of Science and Technology Austria.","ieee":"T. Prat, “Identification of novel regulators of PIN polarity and development of novel auxin sensor,” Institute of Science and Technology Austria, 2017.","ama":"Prat T. Identification of novel regulators of PIN polarity and development of novel auxin sensor. 2017."},"date_published":"2017-01-12T00:00:00Z","department":[{"_id":"JiFr"}],"type":"dissertation","oa_version":"Published Version","date_created":"2018-12-11T11:50:17Z","oa":1,"alternative_title":["ISTA Thesis"],"title":"Identification of novel regulators of PIN polarity and development of novel auxin sensor","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","article_processing_charge":"No","year":"2017","related_material":{"record":[{"relation":"part_of_dissertation","id":"449","status":"public"}]},"author":[{"full_name":"Prat, Tomas","id":"3DA3BFEE-F248-11E8-B48F-1D18A9856A87","last_name":"Prat","first_name":"Tomas"}]},{"file_date_updated":"2020-07-14T12:48:18Z","pubrep_id":"815","doi":"10.15479/AT:ISTA:th_815","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","call_identifier":"FP7"}],"month":"05","ec_funded":1,"publist_id":"6407","OA_place":"publisher","corr_author":"1","status":"public","day":"01","publication_identifier":{"issn":["2663-337X"]},"file":[{"date_created":"2018-12-12T10:07:55Z","relation":"main_file","file_id":"4654","creator":"system","date_updated":"2020-07-14T12:48:18Z","checksum":"81761fb939acb7585c36629f765b4373","content_type":"application/pdf","file_size":786145,"file_name":"IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf","access_level":"open_access"},{"file_id":"6208","relation":"source_file","date_created":"2019-04-05T08:43:24Z","access_level":"closed","file_name":"2017_Thesis_Rolinek_source.zip","file_size":5936337,"content_type":"application/zip","checksum":"2b2d7e1d6c1c79a9795a7aa0f860baf3","date_updated":"2020-07-14T12:48:18Z","creator":"dernst"}],"publication_status":"published","degree_awarded":"PhD","publisher":"Institute of Science and Technology Austria","acknowledgement":"FP7/2007-2013/ERC grant agreement no 616160","supervisor":[{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"ddc":["004"],"abstract":[{"text":"An instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of\r\nvariables, a finite domain of labels, and a set of constraints, each constraint acting on\r\na subset of the variables. The goal is to find an assignment of labels to its variables\r\nthat satisfies all constraints (or decide whether one exists). If we allow more general\r\n“soft” constraints, which come with (possibly infinite) costs of particular assignments,\r\nwe obtain instances from a richer class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal is to find an assignment with minimum total cost.\r\nIn this thesis, we focus (assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage, that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe complexity classification modulo (missing pieces of) complexity classification for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’ perfect\r\nmatching algorithm. This generalization contributes to complexity classfications in two\r\nways. First, it gives a new (largest known) polynomial-time solvable class of Boolean\r\nCSPs in which every variable may appear in at most two constraints and second, it\r\nsettles full classification of Boolean CSPs with planar drawing (again parametrized by a\r\nconstraint language).","lang":"eng"}],"_id":"992","date_updated":"2026-04-08T14:17:06Z","page":"97","department":[{"_id":"VlKo"}],"citation":{"ama":"Rolinek M. Complexity of constraint satisfaction. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">10.15479/AT:ISTA:th_815</a>","ieee":"M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science and Technology Austria, 2017.","chicago":"Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">https://doi.org/10.15479/AT:ISTA:th_815</a>.","ista":"Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria.","apa":"Rolinek, M. (2017). <i>Complexity of constraint satisfaction</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">https://doi.org/10.15479/AT:ISTA:th_815</a>","short":"M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017.","mla":"Rolinek, Michal. <i>Complexity of Constraint Satisfaction</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_815\">10.15479/AT:ISTA:th_815</a>."},"date_published":"2017-05-01T00:00:00Z","language":[{"iso":"eng"}],"has_accepted_license":"1","oa":1,"date_created":"2018-12-11T11:49:35Z","oa_version":"Published Version","type":"dissertation","title":"Complexity of constraint satisfaction","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","alternative_title":["ISTA Thesis"],"author":[{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Rolinek"}],"article_processing_charge":"No","year":"2017"}]