[{"intvolume":"     10426","abstract":[{"text":"We consider the problem of developing automated techniques for solving recurrence relations to aid the expected-runtime analysis of programs. The motivation is that several classical textbook algorithms have quite efficient expected-runtime complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., Quick-Sort), or completely ineffective (e.g., Coupon-Collector). Since the main focus of expected-runtime analysis is to obtain efficient bounds, we consider bounds that are either logarithmic, linear or almost-linear (O(log n), O(n), O(n · log n), respectively, where n represents the input size). Our main contribution is an efficient (simple linear-time algorithm) sound approach for deriving such expected-runtime bounds for the analysis of recurrence relations induced by randomized algorithms. The experimental results show that our approach can efficiently derive asymptotically optimal expected-runtime bounds for recurrences of classical randomized algorithms, including Randomized-Search, Quick-Sort, Quick-Select, Coupon-Collector, where the worst-case bounds are either inefficient (such as linear as compared to logarithmic expected-runtime complexity, or quadratic as compared to linear or almost-linear expected-runtime complexity), or ineffective.","lang":"eng"}],"publication_status":"published","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"first_name":"Aniket","last_name":"Murhekar","full_name":"Murhekar, Aniket"}],"oa_version":"Submitted Version","fulldoi":"https://doi.org/10.1007/978-3-319-63387-9_6","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"date_published":"2017-01-01T00:00:00Z","isi":1,"quality_controlled":"1","doi":"10.1007/978-3-319-63387-9_6","conference":{"start_date":"2017-07-24","name":"CAV: Computer Aided Verification","location":"Heidelberg, Germany","end_date":"2017-07-28"},"_id":"628","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","year":"2017","publist_id":"7166","article_processing_charge":"No","external_id":{"isi":["000432196400006"],"arxiv":["1705.00314"]},"citation":{"ama":"Chatterjee K, Fu H, Murhekar A. Automated recurrence analysis for almost linear expected runtime bounds. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:118-139. doi:<a href=\"https://doi.org/10.1007/978-3-319-63387-9_6\">10.1007/978-3-319-63387-9_6</a>","short":"K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 118–139.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.” edited by Rupak Majumdar and Viktor Kunčak, 10426:118–39. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63387-9_6\">https://doi.org/10.1007/978-3-319-63387-9_6</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds</i>. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 118–39, doi:<a href=\"https://doi.org/10.1007/978-3-319-63387-9_6\">10.1007/978-3-319-63387-9_6</a>.","ista":"Chatterjee K, Fu H, Murhekar A. 2017. Automated recurrence analysis for almost linear expected runtime bounds. CAV: Computer Aided Verification, LNCS, vol. 10426, 118–139.","apa":"Chatterjee, K., Fu, H., &#38; Murhekar, A. (2017). Automated recurrence analysis for almost linear expected runtime bounds. In R. Majumdar &#38; V. Kunčak (Eds.) (Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63387-9_6\">https://doi.org/10.1007/978-3-319-63387-9_6</a>","ieee":"K. Chatterjee, H. Fu, and A. Murhekar, “Automated recurrence analysis for almost linear expected runtime bounds,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 118–139."},"main_file_link":[{"url":"https://arxiv.org/abs/1705.00314","open_access":"1"}],"department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"arxiv":1,"date_created":"2018-12-11T11:47:35Z","page":"118 - 139","volume":10426,"month":"01","type":"conference","ec_funded":1,"publication_identifier":{"isbn":["978-331963386-2"]},"publisher":"Springer","alternative_title":["LNCS"],"scopus_import":"1","title":"Automated recurrence analysis for almost linear expected runtime bounds","date_updated":"2025-09-11T07:28:26Z","editor":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"first_name":"Viktor","full_name":"Kunčak, Viktor","last_name":"Kunčak"}],"day":"01","oa":1},{"publication":"Prokaryotic Cytoskeletons","publist_id":"7165","citation":{"ama":"Loose M, Zieske K, Schwille P. Reconstitution of protein dynamics involved in bacterial cell division. In: <i>Prokaryotic Cytoskeletons</i>. Vol 84. Sub-Cellular Biochemistry. Springer; 2017:419-444. doi:<a href=\"https://doi.org/10.1007/978-3-319-53047-5_15\">10.1007/978-3-319-53047-5_15</a>","chicago":"Loose, Martin, Katja Zieske, and Petra Schwille. “Reconstitution of Protein Dynamics Involved in Bacterial Cell Division.” In <i>Prokaryotic Cytoskeletons</i>, 84:419–44. Sub-Cellular Biochemistry. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-53047-5_15\">https://doi.org/10.1007/978-3-319-53047-5_15</a>.","mla":"Loose, Martin, et al. “Reconstitution of Protein Dynamics Involved in Bacterial Cell Division.” <i>Prokaryotic Cytoskeletons</i>, vol. 84, Springer, 2017, pp. 419–44, doi:<a href=\"https://doi.org/10.1007/978-3-319-53047-5_15\">10.1007/978-3-319-53047-5_15</a>.","short":"M. Loose, K. Zieske, P. Schwille, in:, Prokaryotic Cytoskeletons, Springer, 2017, pp. 419–444.","apa":"Loose, M., Zieske, K., &#38; Schwille, P. (2017). Reconstitution of protein dynamics involved in bacterial cell division. In <i>Prokaryotic Cytoskeletons</i> (Vol. 84, pp. 419–444). Springer. <a href=\"https://doi.org/10.1007/978-3-319-53047-5_15\">https://doi.org/10.1007/978-3-319-53047-5_15</a>","ista":"Loose M, Zieske K, Schwille P. 2017.Reconstitution of protein dynamics involved in bacterial cell division. In: Prokaryotic Cytoskeletons. vol. 84, 419–444.","ieee":"M. Loose, K. Zieske, and P. Schwille, “Reconstitution of protein dynamics involved in bacterial cell division,” in <i>Prokaryotic Cytoskeletons</i>, vol. 84, Springer, 2017, pp. 419–444."},"series_title":"Sub-Cellular Biochemistry","external_id":{"pmid":["28500535"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"629","year":"2017","doi":"10.1007/978-3-319-53047-5_15","quality_controlled":"1","publication_status":"published","author":[{"last_name":"Loose","full_name":"Loose, Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","orcid":"0000-0001-7309-9724"},{"full_name":"Zieske, Katja","last_name":"Zieske","first_name":"Katja"},{"first_name":"Petra","last_name":"Schwille","full_name":"Schwille, Petra"}],"intvolume":"        84","abstract":[{"text":"Even simple cells like bacteria have precisely regulated cellular anatomies, which allow them to grow, divide and to respond to internal or external cues with high fidelity. How spatial and temporal intracellular organization in prokaryotic cells is achieved and maintained on the basis of locally interacting proteins still remains largely a mystery. Bulk biochemical assays with purified components and in vivo experiments help us to approach key cellular processes from two opposite ends, in terms of minimal and maximal complexity. However, to understand how cellular phenomena emerge, that are more than the sum of their parts, we have to assemble cellular subsystems step by step from the bottom up. Here, we review recent in vitro reconstitution experiments with proteins of the bacterial cell division machinery and illustrate how they help to shed light on fundamental cellular mechanisms that constitute spatiotemporal order and regulate cell division.","lang":"eng"}],"oa_version":"None","fulldoi":"https://doi.org/10.1007/978-3-319-53047-5_15","date_published":"2017-05-13T00:00:00Z","day":"13","title":"Reconstitution of protein dynamics involved in bacterial cell division","date_updated":"2024-10-09T20:58:00Z","publisher":"Springer","publication_identifier":{"eisbn":["978-3-319-53047-5"]},"scopus_import":1,"corr_author":"1","language":[{"iso":"eng"}],"department":[{"_id":"MaLo"}],"type":"book_chapter","month":"05","volume":84,"page":"419 - 444","pmid":1,"date_created":"2018-12-11T11:47:35Z"},{"oa_version":"Published Version","date_published":"2017-02-01T00:00:00Z","abstract":[{"lang":"eng","text":"Bacteria and their pathogens – phages – are the most abundant living entities on Earth. Throughout their coevolution, bacteria have evolved multiple immune systems to overcome the ubiquitous threat from the phages. Although the molecu- lar details of these immune systems’ functions are relatively well understood, their epidemiological consequences for the phage-bacterial communities have been largely neglected. In this thesis we employed both experimental and theoretical methods to explore whether herd and social immunity may arise in bacterial popu- lations. Using our experimental system consisting of Escherichia coli strains with a CRISPR based immunity to the T7 phage we show that herd immunity arises in phage-bacterial communities and that it is accentuated when the populations are spatially structured. By fitting a mathematical model, we inferred expressions for the herd immunity threshold and the velocity of spread of a phage epidemic in partially resistant bacterial populations, which both depend on the bacterial growth rate, phage burst size and phage latent period. We also investigated the poten- tial for social immunity in Streptococcus thermophilus and its phage 2972 using a bioinformatic analysis of potentially coding short open reading frames with a signalling signature, encoded within the CRISPR associated genes. Subsequently, we tested one identified potentially signalling peptide and found that its addition to a phage-challenged culture increases probability of survival of bacteria two fold, although the results were only marginally significant. Together, these results demonstrate that the ubiquitous arms races between bacteria and phages have further consequences at the level of the population."}],"publication_status":"published","author":[{"full_name":"Payne, Pavel","id":"35F78294-F248-11E8-B48F-1D18A9856A87","last_name":"Payne","orcid":"0000-0002-2711-9453","first_name":"Pavel"}],"year":"2017","_id":"6291","degree_awarded":"PhD","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","status":"public","article_processing_charge":"No","citation":{"ama":"Payne P. Bacterial herd and social immunity to phages. 2017.","mla":"Payne, Pavel. <i>Bacterial Herd and Social Immunity to Phages</i>. Institute of Science and Technology Austria, 2017.","chicago":"Payne, Pavel. “Bacterial Herd and Social Immunity to Phages.” Institute of Science and Technology Austria, 2017.","short":"P. Payne, Bacterial Herd and Social Immunity to Phages, Institute of Science and Technology Austria, 2017.","ieee":"P. Payne, “Bacterial herd and social immunity to phages,” Institute of Science and Technology Austria, 2017.","ista":"Payne P. 2017. Bacterial herd and social immunity to phages. Institute of Science and Technology Austria.","apa":"Payne, P. (2017). <i>Bacterial herd and social immunity to phages</i>. Institute of Science and Technology Austria."},"page":"83","date_created":"2019-04-09T15:16:45Z","ddc":["570"],"month":"02","type":"dissertation","file":[{"content_type":"application/pdf","relation":"main_file","file_size":3025175,"file_id":"6292","checksum":"a0fc5c26a89c0ea759947ffba87d0d8f","date_updated":"2020-07-14T12:47:27Z","access_level":"closed","date_created":"2019-04-09T15:15:32Z","file_name":"thesis_pavel_payne_final_w_signature_page.pdf","creator":"dernst"},{"date_updated":"2021-02-22T13:45:59Z","success":1,"date_created":"2021-02-22T13:45:59Z","access_level":"open_access","file_name":"2017_Payne_Thesis.pdf","creator":"dernst","content_type":"application/pdf","relation":"main_file","file_size":3111536,"file_id":"9187","checksum":"af531e921a7f64a9e0af4cd8783b2226"}],"department":[{"_id":"NiBa"},{"_id":"JoBo"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","alternative_title":["ISTA Thesis"],"corr_author":"1","file_date_updated":"2021-02-22T13:45:59Z","OA_place":"publisher","supervisor":[{"last_name":"Bollback","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","full_name":"Bollback, Jonathan P","first_name":"Jonathan P","orcid":"0000-0002-4624-4612"},{"first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"]},"publisher":"Institute of Science and Technology Austria","date_updated":"2026-04-08T14:16:28Z","title":"Bacterial herd and social immunity to phages","oa":1,"day":"01"},{"_id":"630","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","year":"2017","publist_id":"7164","article_processing_charge":"No","external_id":{"isi":["000426828000047"]},"citation":{"mla":"Sauermann, Stefan, et al. <i>Biosignals Standards and FHIR: The Way to Go</i>. Vol. 236, IOS Press, 2017, pp. 356–62, doi:<a href=\"https://doi.org/10.3233/978-1-61499-759-7-356\">10.3233/978-1-61499-759-7-356</a>.","chicago":"Sauermann, Stefan, Veronika David, Alois Schlögl, Reinhard Egelkraut, Matthias Frohner, Birgit Pohn, Philipp Urbauer, and Alexander Mense. “Biosignals Standards and FHIR: The Way to Go,” 236:356–62. IOS Press, 2017. <a href=\"https://doi.org/10.3233/978-1-61499-759-7-356\">https://doi.org/10.3233/978-1-61499-759-7-356</a>.","short":"S. Sauermann, V. David, A. Schlögl, R. Egelkraut, M. Frohner, B. Pohn, P. Urbauer, A. Mense, in:, IOS Press, 2017, pp. 356–362.","ista":"Sauermann S, David V, Schlögl A, Egelkraut R, Frohner M, Pohn B, Urbauer P, Mense A. 2017. Biosignals standards and FHIR: The way to go. eHealth: Health Informatics Meets eHealth, Studies in Health Technology and Informatics, vol. 236, 356–362.","ieee":"S. Sauermann <i>et al.</i>, “Biosignals standards and FHIR: The way to go,” presented at the eHealth: Health Informatics Meets eHealth, Vienna, Austria, 2017, vol. 236, pp. 356–362.","apa":"Sauermann, S., David, V., Schlögl, A., Egelkraut, R., Frohner, M., Pohn, B., … Mense, A. (2017). Biosignals standards and FHIR: The way to go (Vol. 236, pp. 356–362). Presented at the eHealth: Health Informatics Meets eHealth, Vienna, Austria: IOS Press. <a href=\"https://doi.org/10.3233/978-1-61499-759-7-356\">https://doi.org/10.3233/978-1-61499-759-7-356</a>","ama":"Sauermann S, David V, Schlögl A, et al. Biosignals standards and FHIR: The way to go. In: Vol 236. IOS Press; 2017:356-362. doi:<a href=\"https://doi.org/10.3233/978-1-61499-759-7-356\">10.3233/978-1-61499-759-7-356</a>"},"abstract":[{"lang":"eng","text":"Background: Standards have become available to share semantically encoded vital parameters from medical devices, as required for example by personal healthcare records. Standardised sharing of biosignal data largely remains open. Objectives: The goal of this work is to explore available biosignal file format and data exchange standards and profiles, and to conceptualise end-To-end solutions. Methods: The authors reviewed and discussed available biosignal file format standards with other members of international standards development organisations (SDOs). Results: A raw concept for standards based acquisition, storage, archiving and sharing of biosignals was developed. The GDF format may serve for storing biosignals. Signals can then be shared using FHIR resources and may be stored on FHIR servers or in DICOM archives, with DICOM waveforms as one possible format. Conclusion: Currently a group of international SDOs (e.g. HL7, IHE, DICOM, IEEE) is engaged in intensive discussions. This discussion extends existing work that already was adopted by large implementer communities. The concept presented here only reports the current status of the discussion in Austria. The discussion will continue internationally, with results to be expected over the coming years."}],"intvolume":"       236","author":[{"full_name":"Sauermann, Stefan","last_name":"Sauermann","first_name":"Stefan"},{"first_name":"Veronika","last_name":"David","full_name":"David, Veronika"},{"full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","orcid":"0000-0002-5621-8100","first_name":"Alois"},{"first_name":"Reinhard","full_name":"Egelkraut, Reinhard","last_name":"Egelkraut"},{"full_name":"Frohner, Matthias","last_name":"Frohner","first_name":"Matthias"},{"last_name":"Pohn","full_name":"Pohn, Birgit","first_name":"Birgit"},{"first_name":"Philipp","full_name":"Urbauer, Philipp","last_name":"Urbauer"},{"first_name":"Alexander","full_name":"Mense, Alexander","last_name":"Mense"}],"publication_status":"published","fulldoi":"https://doi.org/10.3233/978-1-61499-759-7-356","date_published":"2017-01-01T00:00:00Z","isi":1,"oa_version":"Published Version","quality_controlled":"1","doi":"10.3233/978-1-61499-759-7-356","conference":{"end_date":"2017-05-24","start_date":"2017-05-23","name":"eHealth: Health Informatics Meets eHealth","location":"Vienna, Austria"},"title":"Biosignals standards and FHIR: The way to go","tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png"},"date_updated":"2025-09-11T07:27:53Z","day":"01","oa":1,"file":[{"file_name":"IST-2017-906-v1+1_SHTI236-0356.pdf","creator":"system","date_updated":"2020-07-14T12:47:27Z","access_level":"open_access","date_created":"2018-12-12T10:11:56Z","file_id":"4913","file_size":443635,"checksum":"1254dcc5b04a996d97fad9a726b42727","content_type":"application/pdf","relation":"main_file"}],"department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","date_created":"2018-12-11T11:47:36Z","page":"356 - 362","volume":236,"pubrep_id":"906","type":"conference","month":"01","ddc":["005"],"publication_identifier":{"isbn":["978-161499758-0"]},"publisher":"IOS Press","has_accepted_license":"1","alternative_title":["Studies in Health Technology and Informatics"],"scopus_import":"1","file_date_updated":"2020-07-14T12:47:27Z"},{"quality_controlled":"1","doi":"10.1007/978-3-662-54577-5_34","conference":{"end_date":"2017-04-29","location":"Uppsala, Sweden","start_date":"2017-04-22","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"date_published":"2017-03-31T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-662-54577-5_34","isi":1,"oa_version":"Submitted Version","project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"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."}],"intvolume":"     10205","publication_status":"published","author":[{"orcid":"0000-0002-0686-0365","first_name":"Sergiy","full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov"},{"last_name":"Frehse","full_name":"Frehse, Goran","first_name":"Goran"},{"id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","full_name":"Giacobbe, Mirco","last_name":"Giacobbe","orcid":"0000-0001-8180-0904","first_name":"Mirco"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"article_processing_charge":"No","external_id":{"isi":["000440734900034"]},"citation":{"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>.","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.","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.","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>","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>"},"publist_id":"7162","year":"2017","_id":"631","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","alternative_title":["LNCS"],"corr_author":"1","scopus_import":"1","file_date_updated":"2020-07-14T12:47:27Z","publication_identifier":{"isbn":["978-366254576-8"]},"publisher":"Springer","date_created":"2018-12-11T11:47:36Z","page":"589 - 606","pubrep_id":"966","volume":10205,"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).","month":"03","ddc":["000"],"type":"conference","file":[{"relation":"main_file","content_type":"application/pdf","checksum":"f395d0d20102b89aeaad8b4ef4f18f4f","file_size":569863,"file_id":"4897","access_level":"open_access","date_created":"2018-12-12T10:11:41Z","date_updated":"2020-07-14T12:47:27Z","creator":"system","file_name":"IST-2017-741-v1+1_main.pdf"},{"file_size":563276,"file_id":"4898","checksum":"f416ee1ae4497b23ecdf28b1f18bb8df","content_type":"application/pdf","relation":"main_file","file_name":"IST-2018-741-v2+2_main.pdf","creator":"system","date_updated":"2020-07-14T12:47:27Z","date_created":"2018-12-12T10:11:42Z","access_level":"open_access"}],"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"oa":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"6894","status":"public"}]},"day":"31","date_updated":"2026-04-08T07:47:13Z","title":"Counterexample guided refinement of template polyhedra"},{"date_updated":"2025-09-11T07:26:38Z","title":"A note on 2D focusing many boson systems","oa":1,"day":"01","type":"journal_article","month":"01","date_created":"2018-12-11T11:47:36Z","page":"2441 - 2454","volume":145,"department":[{"_id":"RoSe"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.09045"}],"arxiv":1,"language":[{"iso":"eng"}],"corr_author":"1","scopus_import":"1","publisher":"American Mathematical Society","ec_funded":1,"year":"2017","_id":"632","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"ama":"Lewin M, Nam P, Rougerie N. A note on 2D focusing many boson systems. <i>Proceedings of the American Mathematical Society</i>. 2017;145(6):2441-2454. doi:<a href=\"https://doi.org/10.1090/proc/13468\">10.1090/proc/13468</a>","apa":"Lewin, M., Nam, P., &#38; Rougerie, N. (2017). A note on 2D focusing many boson systems. <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/proc/13468\">https://doi.org/10.1090/proc/13468</a>","ista":"Lewin M, Nam P, Rougerie N. 2017. A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. 145(6), 2441–2454.","ieee":"M. Lewin, P. Nam, and N. Rougerie, “A note on 2D focusing many boson systems,” <i>Proceedings of the American Mathematical Society</i>, vol. 145, no. 6. American Mathematical Society, pp. 2441–2454, 2017.","chicago":"Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “A Note on 2D Focusing Many Boson Systems.” <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society, 2017. <a href=\"https://doi.org/10.1090/proc/13468\">https://doi.org/10.1090/proc/13468</a>.","mla":"Lewin, Mathieu, et al. “A Note on 2D Focusing Many Boson Systems.” <i>Proceedings of the American Mathematical Society</i>, vol. 145, no. 6, American Mathematical Society, 2017, pp. 2441–54, doi:<a href=\"https://doi.org/10.1090/proc/13468\">10.1090/proc/13468</a>.","short":"M. Lewin, P. Nam, N. Rougerie, Proceedings of the American Mathematical Society 145 (2017) 2441–2454."},"article_processing_charge":"No","external_id":{"isi":["000398833500014"],"arxiv":["1509.09045"]},"publication":"Proceedings of the American Mathematical Society","publist_id":"7160","isi":1,"fulldoi":"https://doi.org/10.1090/proc/13468","oa_version":"Submitted Version","date_published":"2017-01-01T00:00:00Z","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Lewin","full_name":"Lewin, Mathieu","first_name":"Mathieu"},{"first_name":"Phan","last_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87","full_name":"Nam, Phan"},{"full_name":"Rougerie, Nicolas","last_name":"Rougerie","first_name":"Nicolas"}],"publication_status":"published","issue":"6","intvolume":"       145","abstract":[{"lang":"eng","text":"We consider a 2D quantum system of N bosons in a trapping potential |x|s, interacting via a pair potential of the form N2β−1 w(Nβ x). We show that for all 0 &lt; β &lt; (s + 1)/(s + 2), the leading order behavior of ground states of the many-body system is described in the large N limit by the corresponding cubic nonlinear Schrödinger energy functional. Our result covers the focusing case (w &lt; 0) where even the stability of the many-body system is not obvious. This answers an open question mentioned by X. Chen and J. Holmer for harmonic traps (s = 2). Together with the BBGKY hierarchy approach used by these authors, our result implies the convergence of the many-body quantum dynamics to the focusing NLS equation with harmonic trap for all 0 &lt; β &lt; 3/4. "}],"quality_controlled":"1","doi":"10.1090/proc/13468"},{"doi":"10.1007/978-3-319-63501-9_6","conference":{"location":"Heidelberg, Germany","name":"NSV: Numerical Software Verification","start_date":"2017-07-22","end_date":"2017-07-23"},"quality_controlled":"1","author":[{"full_name":"Bak, Stanley","last_name":"Bak","first_name":"Stanley"},{"last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","full_name":"Bogomolov, Sergiy","first_name":"Sergiy","orcid":"0000-0002-0686-0365"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Aviral","full_name":"Kumar, Aviral","last_name":"Kumar"}],"publication_status":"published","abstract":[{"text":"A Rapidly-exploring Random Tree (RRT) is an algorithm which can search a non-convex region of space by incrementally building a space-filling tree. The tree is constructed from random points drawn from system’s state space and is biased to grow towards large unexplored areas in the system. RRT can provide better coverage of a system’s possible behaviors compared with random simulations, but is more lightweight than full reachability analysis. In this paper, we explore some of the design decisions encountered while implementing a hybrid extension of the RRT algorithm, which have not been elaborated on before. In particular, we focus on handling non-determinism, which arises due to discrete transitions. We introduce the notion of important points to account for this phenomena. We showcase our ideas using heater and navigation benchmarks.","lang":"eng"}],"intvolume":"     10381","isi":1,"fulldoi":"https://doi.org/10.1007/978-3-319-63501-9_6","project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}],"oa_version":"None","date_published":"2017-01-01T00:00:00Z","publist_id":"7159","citation":{"apa":"Bak, S., Bogomolov, S., Henzinger, T. A., &#38; Kumar, A. (2017). Challenges and tool implementation of hybrid rapidly exploring random trees. In A. Abate &#38; S. Bodo (Eds.) (Vol. 10381, pp. 83–89). Presented at the NSV: Numerical Software Verification, Heidelberg, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63501-9_6\">https://doi.org/10.1007/978-3-319-63501-9_6</a>","ista":"Bak S, Bogomolov S, Henzinger TA, Kumar A. 2017. Challenges and tool implementation of hybrid rapidly exploring random trees. NSV: Numerical Software Verification, LNCS, vol. 10381, 83–89.","ieee":"S. Bak, S. Bogomolov, T. A. Henzinger, and A. Kumar, “Challenges and tool implementation of hybrid rapidly exploring random trees,” presented at the NSV: Numerical Software Verification, Heidelberg, Germany, 2017, vol. 10381, pp. 83–89.","mla":"Bak, Stanley, et al. <i>Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees</i>. Edited by Alessandro Abate and Sylvie Bodo, vol. 10381, Springer, 2017, pp. 83–89, doi:<a href=\"https://doi.org/10.1007/978-3-319-63501-9_6\">10.1007/978-3-319-63501-9_6</a>.","chicago":"Bak, Stanley, Sergiy Bogomolov, Thomas A Henzinger, and Aviral Kumar. “Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees.” edited by Alessandro Abate and Sylvie Bodo, 10381:83–89. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63501-9_6\">https://doi.org/10.1007/978-3-319-63501-9_6</a>.","short":"S. Bak, S. Bogomolov, T.A. Henzinger, A. Kumar, in:, A. Abate, S. Bodo (Eds.), Springer, 2017, pp. 83–89.","ama":"Bak S, Bogomolov S, Henzinger TA, Kumar A. Challenges and tool implementation of hybrid rapidly exploring random trees. In: Abate A, Bodo S, eds. Vol 10381. Springer; 2017:83-89. doi:<a href=\"https://doi.org/10.1007/978-3-319-63501-9_6\">10.1007/978-3-319-63501-9_6</a>"},"external_id":{"isi":["000440724800006"]},"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","_id":"633","year":"2017","publisher":"Springer","publication_identifier":{"isbn":["978-331963500-2"]},"scopus_import":"1","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"type":"conference","month":"01","volume":10381,"page":"83 - 89","date_created":"2018-12-11T11:47:37Z","day":"01","editor":[{"last_name":"Abate","full_name":"Abate, Alessandro","first_name":"Alessandro"},{"last_name":"Bodo","full_name":"Bodo, Sylvie","first_name":"Sylvie"}],"title":"Challenges and tool implementation of hybrid rapidly exploring random trees","date_updated":"2025-09-11T07:25:57Z"},{"publisher":"Springer","publication_identifier":{"eisbn":["978-3-319-52498-6"]},"scopus_import":"1","corr_author":"1","alternative_title":["ADVSANAT"],"language":[{"iso":"eng"}],"department":[{"_id":"GaNo"}],"type":"book_chapter","month":"05","volume":224,"page":"189 - 211","date_created":"2018-12-11T11:47:37Z","day":"28","editor":[{"full_name":"Schmeisser, Michael","last_name":"Schmeisser","first_name":"Michael"},{"full_name":"Boekers, Tobias","last_name":"Boekers","first_name":"Tobias"}],"title":"Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder","date_updated":"2025-09-11T07:25:25Z","doi":"10.1007/978-3-319-52498-6_10","quality_controlled":"1","publication_status":"published","author":[{"first_name":"Jan","full_name":"Schroeder, Jan","last_name":"Schroeder"},{"first_name":"Elena","orcid":"0000-0002-7370-5293","last_name":"Deliu","full_name":"Deliu, Elena","id":"37A40D7E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Gaia","orcid":"0000-0002-7673-7178","last_name":"Novarino","full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michael","last_name":"Schmeisser","full_name":"Schmeisser, Michael"}],"abstract":[{"lang":"eng","text":"As autism spectrum disorder (ASD) is largely regarded as a neurodevelopmental condition, long-time consensus was that its hallmark features are irreversible. However, several studies from recent years using defined mouse models of ASD have provided clear evidence that in mice neurobiological and behavioural alterations can be ameliorated or even reversed by genetic restoration or pharmacological treatment either before or after symptom onset. Here, we review findings on genetic and pharmacological reversibility of phenotypes in mouse models of ASD. Our review should give a comprehensive overview on both aspects and encourage future studies to better understand the underlying molecular mechanisms that might be translatable from animals to humans."}],"intvolume":"       224","isi":1,"fulldoi":"https://doi.org/10.1007/978-3-319-52498-6_10","oa_version":"None","date_published":"2017-05-28T00:00:00Z","project":[{"name":"Transmembrane Transporters in Health and Disease","grant_number":"F03523","_id":"25473368-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publication":"Translational Anatomy and Cell Biology of Autism Spectrum Disorder","publist_id":"7156","citation":{"apa":"Schroeder, J., Deliu, E., Novarino, G., &#38; Schmeisser, M. (2017). Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder. In M. Schmeisser &#38; T. Boekers (Eds.), <i>Translational Anatomy and Cell Biology of Autism Spectrum Disorder</i> (Vol. 224, pp. 189–211). Springer. <a href=\"https://doi.org/10.1007/978-3-319-52498-6_10\">https://doi.org/10.1007/978-3-319-52498-6_10</a>","ieee":"J. Schroeder, E. Deliu, G. Novarino, and M. Schmeisser, “Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder,” in <i>Translational Anatomy and Cell Biology of Autism Spectrum Disorder</i>, vol. 224, M. Schmeisser and T. Boekers, Eds. Springer, 2017, pp. 189–211.","ista":"Schroeder J, Deliu E, Novarino G, Schmeisser M. 2017.Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder. In: Translational Anatomy and Cell Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 189–211.","short":"J. Schroeder, E. Deliu, G. Novarino, M. Schmeisser, in:, M. Schmeisser, T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder, Springer, 2017, pp. 189–211.","chicago":"Schroeder, Jan, Elena Deliu, Gaia Novarino, and Michael Schmeisser. “Genetic and Pharmacological Reversibility of Phenotypes in Mouse Models of Autism Spectrum Disorder.” In <i>Translational Anatomy and Cell Biology of Autism Spectrum Disorder</i>, edited by Michael Schmeisser and Tobias Boekers, 224:189–211. Advances in Anatomy Embryology and Cell Biology. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-52498-6_10\">https://doi.org/10.1007/978-3-319-52498-6_10</a>.","mla":"Schroeder, Jan, et al. “Genetic and Pharmacological Reversibility of Phenotypes in Mouse Models of Autism Spectrum Disorder.” <i>Translational Anatomy and Cell Biology of Autism Spectrum Disorder</i>, edited by Michael Schmeisser and Tobias Boekers, vol. 224, Springer, 2017, pp. 189–211, doi:<a href=\"https://doi.org/10.1007/978-3-319-52498-6_10\">10.1007/978-3-319-52498-6_10</a>.","ama":"Schroeder J, Deliu E, Novarino G, Schmeisser M. Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder. In: Schmeisser M, Boekers T, eds. <i>Translational Anatomy and Cell Biology of Autism Spectrum Disorder</i>. Vol 224. Advances in Anatomy Embryology and Cell Biology. Springer; 2017:189-211. doi:<a href=\"https://doi.org/10.1007/978-3-319-52498-6_10\">10.1007/978-3-319-52498-6_10</a>"},"series_title":"Advances in Anatomy Embryology and Cell Biology","external_id":{"isi":["000443802500011"]},"article_processing_charge":"No","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"634","year":"2017"},{"editor":[{"first_name":"Jean-Sébastien","last_name":"Coron","full_name":"Coron, Jean-Sébastien"},{"last_name":"Buus Nielsen","full_name":"Buus Nielsen, Jesper","first_name":"Jesper"}],"day":"01","oa":1,"title":"Scrypt is maximally memory hard","date_updated":"2025-09-11T07:24:51Z","publisher":"Springer","ec_funded":1,"publication_identifier":{"isbn":["978-331956616-0"]},"scopus_import":"1","alternative_title":["LNCS"],"main_file_link":[{"url":"https://eprint.iacr.org/2016/989","open_access":"1"}],"department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"month":"01","type":"conference","page":"33 - 62","date_created":"2018-12-11T11:47:37Z","volume":10212,"publist_id":"7154","citation":{"ista":"Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 33–62.","apa":"Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., &#38; Tessaro, S. (2017). Scrypt is maximally memory hard. In J.-S. Coron &#38; J. Buus Nielsen (Eds.) (Vol. 10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-56617-7_2\">https://doi.org/10.1007/978-3-319-56617-7_2</a>","ieee":"J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62.","mla":"Alwen, Joel F., et al. <i>Scrypt Is Maximally Memory Hard</i>. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:<a href=\"https://doi.org/10.1007/978-3-319-56617-7_2\">10.1007/978-3-319-56617-7_2</a>.","chicago":"Alwen, Joel F, Binchi Chen, Krzysztof Z Pietrzak, Leonid Reyzin, and Stefano Tessaro. “Scrypt Is Maximally Memory Hard.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:33–62. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-56617-7_2\">https://doi.org/10.1007/978-3-319-56617-7_2</a>.","short":"J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.","ama":"Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. Scrypt is maximally memory hard. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:33-62. doi:<a href=\"https://doi.org/10.1007/978-3-319-56617-7_2\">10.1007/978-3-319-56617-7_2</a>"},"article_processing_charge":"No","external_id":{"isi":["000419175900002"]},"_id":"635","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","year":"2017","quality_controlled":"1","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","start_date":"2017-04-30","location":"Paris, France","end_date":"2017-05-04"},"doi":"10.1007/978-3-319-56617-7_2","author":[{"last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","first_name":"Joel F"},{"full_name":"Chen, Binchi","last_name":"Chen","first_name":"Binchi"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Leonid","last_name":"Reyzin","full_name":"Reyzin, Leonid"},{"full_name":"Tessaro, Stefano","last_name":"Tessaro","first_name":"Stefano"}],"publication_status":"published","abstract":[{"text":"Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is dominated by memory cost. As memory, unlike computation, costs about the same across different platforms, MHFs cannot be evaluated at significantly lower cost on dedicated hardware like ASICs. MHFs have found widespread applications including password hashing, key derivation, and proofs-of-work. This paper focuses on scrypt, a simple candidate MHF designed by Percival, and described in RFC 7914. It has been used within a number of cryptocurrencies (e.g., Litecoin and Dogecoin) and has been an inspiration for Argon2d, one of the winners of the recent password-hashing competition. Despite its popularity, no rigorous lower bounds on its memory complexity are known. We prove that scrypt is optimally memory-hard, i.e., its cumulative memory complexity (cmc) in the parallel random oracle model is Ω(n2w), where w and n are the output length and number of invocations of the underlying hash function, respectively. High cmc is a strong security target for MHFs introduced by Alwen and Serbinenko (STOC’15) which implies high memory cost even for adversaries who can amortize the cost over many evaluations and evaluate the underlying hash functions many times in parallel. Our proof is the first showing optimal memory-hardness for any MHF. Our result improves both quantitatively and qualitatively upon the recent work by Alwen et al. (EUROCRYPT’16) who proved a weaker lower bound of Ω(n2w/ log2 n) for a restricted class of adversaries.","lang":"eng"}],"intvolume":"     10212","date_published":"2017-01-01T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-319-56617-7_2","oa_version":"Submitted Version","isi":1,"project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}]},{"publication_identifier":{"isbn":["978-331965764-6"]},"publisher":"Springer","alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-01552132"}],"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:47:38Z","page":"189 - 206","volume":10419,"month":"08","type":"conference","editor":[{"full_name":"Abate, Alessandro","last_name":"Abate","first_name":"Alessandro"},{"full_name":"Geeraerts, Gilles","last_name":"Geeraerts","first_name":"Gilles"}],"day":"03","oa":1,"title":"On the quantitative semantics of regular expressions over real-valued signals","date_updated":"2025-09-11T07:24:11Z","quality_controlled":"1","conference":{"start_date":"2017-09-05","name":"FORMATS: Formal Modelling and Analysis of Timed Systems","location":"Berlin, Germany","end_date":"2017-09-07"},"doi":"10.1007/978-3-319-65765-3_11","intvolume":"     10419","abstract":[{"lang":"eng","text":"Signal regular expressions can specify sequential properties of real-valued signals based on threshold conditions, regular operations, and duration constraints. In this paper we endow them with a quantitative semantics which indicates how robustly a signal matches or does not match a given expression. First, we show that this semantics is a safe approximation of a distance between the signal and the language defined by the expression. Then, we consider the robust matching problem, that is, computing the quantitative semantics of every segment of a given signal relative to an expression. We present an algorithm that solves this problem for piecewise-constant and piecewise-linear signals and show that for such signals the robustness map is a piecewise-linear function. The availability of an indicator describing how robustly a signal segment matches some regular pattern provides a general framework for quantitative monitoring of cyber-physical systems."}],"publication_status":"published","author":[{"last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey","first_name":"Alexey"},{"last_name":"Ferrere","full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0001-5199-3143"},{"full_name":"Maler, Oded","last_name":"Maler","first_name":"Oded"},{"full_name":"Ulus, Dogan","last_name":"Ulus","first_name":"Dogan"}],"fulldoi":"https://doi.org/10.1007/978-3-319-65765-3_11","date_published":"2017-08-03T00:00:00Z","project":[{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems"}],"isi":1,"oa_version":"Submitted Version","publist_id":"7152","article_processing_charge":"No","external_id":{"isi":["000611678300011"]},"citation":{"ama":"Bakhirkin A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol 10419. Springer; 2017:189-206. doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_11\">10.1007/978-3-319-65765-3_11</a>","ieee":"A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics of regular expressions over real-valued signals,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 189–206.","apa":"Bakhirkin, A., Ferrere, T., Maler, O., &#38; Ulus, D. (2017). On the quantitative semantics of regular expressions over real-valued signals. In A. Abate &#38; G. Geeraerts (Eds.) (Vol. 10419, pp. 189–206). 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_11\">https://doi.org/10.1007/978-3-319-65765-3_11</a>","ista":"Bakhirkin A, Ferrere T, Maler O, Ulus D. 2017. On the quantitative semantics of regular expressions over real-valued signals. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 189–206.","short":"A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts (Eds.), Springer, 2017, pp. 189–206.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the Quantitative Semantics of Regular Expressions over Real-Valued Signals.” edited by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_11\">https://doi.org/10.1007/978-3-319-65765-3_11</a>.","mla":"Bakhirkin, Alexey, et al. <i>On the Quantitative Semantics of Regular Expressions over Real-Valued Signals</i>. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_11\">10.1007/978-3-319-65765-3_11</a>."},"_id":"636","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","year":"2017"},{"citation":{"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.","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.","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.","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>.","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>.","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>"},"article_processing_charge":"No","external_id":{"isi":["000438672600005"]},"publist_id":"7151","year":"2017","_id":"637","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","quality_controlled":"1","conference":{"location":"Santa Barbara, CA, United States","start_date":"2017-07-20","name":"CRYPTO: Cryptology","end_date":"2017-07-24"},"doi":"10.1007/978-3-319-63688-7_5","fulldoi":"https://doi.org/10.1007/978-3-319-63688-7_5","oa_version":"Submitted Version","project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"isi":1,"date_published":"2017-01-01T00:00:00Z","author":[{"last_name":"Jafargholi","full_name":"Jafargholi, Zahra","first_name":"Zahra"},{"first_name":"Chethan","orcid":"0009-0006-6812-7317","last_name":"Kamath Hosdurg","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen","last_name":"Klein","first_name":"Karen"},{"first_name":"Ilan","full_name":"Komargodski, Ilan","last_name":"Komargodski"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"},{"first_name":"Daniel","last_name":"Wichs","full_name":"Wichs, Daniel"}],"publication_status":"published","abstract":[{"lang":"eng","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."}],"intvolume":"     10401","oa":1,"editor":[{"last_name":"Katz","full_name":"Katz, Jonathan","first_name":"Jonathan"},{"full_name":"Shacham, Hovav","last_name":"Shacham","first_name":"Hovav"}],"day":"01","related_material":{"record":[{"relation":"dissertation_contains","id":"10035","status":"public"}]},"date_updated":"2026-04-08T07:01:44Z","title":"Be adaptive avoid overcommitting","scopus_import":"1","alternative_title":["LNCS"],"publisher":"Springer","ec_funded":1,"publication_identifier":{"isbn":["978-331963687-0"]},"month":"01","type":"conference","date_created":"2018-12-11T11:47:38Z","page":"133 - 163","volume":10401,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/515"}],"department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}]},{"title":"Numerical Software Verification","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"638","date_updated":"2026-03-31T12:28:01Z","year":"2017","day":"01","editor":[{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","full_name":"Bogomolov, Sergiy","last_name":"Bogomolov","orcid":"0000-0002-0686-0365","first_name":"Sergiy"},{"first_name":"Matthieu","last_name":"Martel","full_name":"Martel, Matthieu"},{"first_name":"Pavithra","last_name":"Prabhakar","full_name":"Prabhakar, Pavithra"}],"publist_id":"7150","citation":{"ama":"Bogomolov S, Martel M, Prabhakar P, eds. <i>Numerical Software Verification</i>. Vol 10152. Springer; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-54292-8\">10.1007/978-3-319-54292-8</a>","short":"S. Bogomolov, M. Martel, P. Prabhakar, eds., Numerical Software Verification, Springer, 2017.","chicago":"Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. <i>Numerical Software Verification</i>. Vol. 10152. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-54292-8\">https://doi.org/10.1007/978-3-319-54292-8</a>.","mla":"Bogomolov, Sergiy, et al., editors. <i>Numerical Software Verification</i>. Vol. 10152, Springer, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-54292-8\">10.1007/978-3-319-54292-8</a>.","ista":"Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification, Springer,p.","apa":"Bogomolov, S., Martel, M., &#38; Prabhakar, P. (Eds.). (2017). <i>Numerical Software Verification</i> (Vol. 10152). Presented at the NSV: Numerical Software Verification, Toronto, ON, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-54292-8\">https://doi.org/10.1007/978-3-319-54292-8</a>","ieee":"S. Bogomolov, M. Martel, and P. Prabhakar, Eds., <i>Numerical Software Verification</i>, vol. 10152. Springer, 2017."},"article_processing_charge":"No","language":[{"iso":"eng"}],"publication_status":"published","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"This book constitutes the refereed proceedings of the 9th InternationalWorkshop on Numerical Software Verification, NSV 2016, held in Toronto, ON, Canada in July 2011 - colocated with CAV 2016, the 28th International Conference on Computer Aided Verification.\r\nThe NSV workshop is dedicated to the development of logical and mathematical techniques for the reasoning about programmability and reliability."}],"intvolume":"     10152","oa_version":"None","fulldoi":"https://doi.org/10.1007/978-3-319-54292-8","date_published":"2017-01-01T00:00:00Z","type":"conference_editor","month":"01","volume":10152,"date_created":"2018-12-11T11:47:38Z","publisher":"Springer","doi":"10.1007/978-3-319-54292-8","conference":{"end_date":"2016-07-18","start_date":"2016-07-17","name":"NSV: Numerical Software Verification","location":"Toronto, ON, Canada"},"publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-319-54292-8"]},"quality_controlled":"1","alternative_title":["LNCS"]},{"department":[{"_id":"KrPi"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/875"}],"language":[{"iso":"eng"}],"page":"3 - 32","date_created":"2018-12-11T11:47:39Z","volume":10212,"type":"conference","month":"04","ec_funded":1,"publication_identifier":{"isbn":["978-331956616-0"]},"publisher":"Springer","alternative_title":["LNCS"],"corr_author":"1","scopus_import":"1","title":"Depth-robust graphs and their cumulative memory complexity","date_updated":"2025-09-11T07:21:36Z","editor":[{"first_name":"Jean-Sébastien","last_name":"Coron","full_name":"Coron, Jean-Sébastien"},{"first_name":"Jesper","full_name":"Buus Nielsen, Jesper","last_name":"Buus Nielsen"}],"day":"01","oa":1,"intvolume":"     10212","abstract":[{"text":"Data-independent Memory Hard Functions (iMHFS) are finding a growing number of applications in security; especially in the domain of password hashing. An important property of a concrete iMHF is specified by fixing a directed acyclic graph (DAG) Gn on n nodes. The quality of that iMHF is then captured by the following two pebbling complexities of Gn: – The parallel cumulative pebbling complexity Π∥cc(Gn) must be as high as possible (to ensure that the amortized cost of computing the function on dedicated hardware is dominated by the cost of memory). – The sequential space-time pebbling complexity Πst(Gn) should be as close as possible to Π∥cc(Gn) (to ensure that using many cores in parallel and amortizing over many instances does not give much of an advantage). In this paper we construct a family of DAGs with best possible parameters in an asymptotic sense, i.e., where Π∥cc(Gn) = Ω(n2/ log(n)) (which matches a known upper bound) and Πst(Gn) is within a constant factor of Π∥cc(Gn). Our analysis relies on a new connection between the pebbling complexity of a DAG and its depth-robustness (DR) – a well studied combinatorial property. We show that high DR is sufficient for high Π∥cc. Alwen and Blocki (CRYPTO’16) showed that high DR is necessary and so, together, these results fully characterize DAGs with high Π∥cc in terms of DR. Complementing these results, we provide new upper and lower bounds on the Π∥cc of several important candidate iMHFs from the literature. We give the first lower bounds on the memory hardness of the Catena and Balloon Hashing functions in a parallel model of computation and we give the first lower bounds of any kind for (a version) of Argon2i. Finally we describe a new class of pebbling attacks improving on those of Alwen and Blocki (CRYPTO’16). By instantiating these attacks we upperbound the Π∥cc of the Password Hashing Competition winner Argon2i and one of the Balloon Hashing functions by O (n1.71). We also show an upper bound of O(n1.625) for the Catena functions and the two remaining Balloon Hashing functions.","lang":"eng"}],"author":[{"first_name":"Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"last_name":"Blocki","full_name":"Blocki, Jeremiah","first_name":"Jeremiah"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"}],"publication_status":"published","oa_version":"Submitted Version","fulldoi":"https://doi.org/10.1007/978-3-319-56617-7_1","project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"isi":1,"date_published":"2017-04-01T00:00:00Z","quality_controlled":"1","conference":{"end_date":"2017-05-04","location":"Paris, France","start_date":"2017-04-30","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"doi":"10.1007/978-3-319-56617-7_1","_id":"640","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2017","publist_id":"7148","article_processing_charge":"No","external_id":{"isi":["000419175900001"]},"citation":{"ama":"Alwen JF, Blocki J, Pietrzak KZ. Depth-robust graphs and their cumulative memory complexity. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:3-32. doi:<a href=\"https://doi.org/10.1007/978-3-319-56617-7_1\">10.1007/978-3-319-56617-7_1</a>","apa":"Alwen, J. F., Blocki, J., &#38; Pietrzak, K. Z. (2017). Depth-robust graphs and their cumulative memory complexity. In J.-S. Coron &#38; J. Buus Nielsen (Eds.) (Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-56617-7_1\">https://doi.org/10.1007/978-3-319-56617-7_1</a>","ieee":"J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.","ista":"Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 3–32.","short":"J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.","chicago":"Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Depth-Robust Graphs and Their Cumulative Memory Complexity.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:3–32. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-56617-7_1\">https://doi.org/10.1007/978-3-319-56617-7_1</a>.","mla":"Alwen, Joel F., et al. <i>Depth-Robust Graphs and Their Cumulative Memory Complexity</i>. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 3–32, doi:<a href=\"https://doi.org/10.1007/978-3-319-56617-7_1\">10.1007/978-3-319-56617-7_1</a>."}},{"citation":{"ista":"Trajkovska V, Swoboda P, Åström F, Petra S. 2017. Graphical model parameter learning by inverse linear programming. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 323–334.","apa":"Trajkovska, V., Swoboda, P., Åström, F., &#38; Petra, S. (2017). Graphical model parameter learning by inverse linear programming. In F. Lauze, Y. Dong, &#38; A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_26\">https://doi.org/10.1007/978-3-319-58771-4_26</a>","ieee":"V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter learning by inverse linear programming,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 323–334.","mla":"Trajkovska, Vera, et al. <i>Graphical Model Parameter Learning by Inverse Linear Programming</i>. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_26\">10.1007/978-3-319-58771-4_26</a>.","chicago":"Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_26\">https://doi.org/10.1007/978-3-319-58771-4_26</a>.","short":"V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.","ama":"Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_26\">10.1007/978-3-319-58771-4_26</a>"},"external_id":{"isi":["000432210900026"]},"article_processing_charge":"No","publist_id":"7147","year":"2017","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","_id":"641","doi":"10.1007/978-3-319-58771-4_26","conference":{"end_date":"2017-06-08","location":"Kolding, Denmark","name":"SSVM: Scale Space and Variational Methods in Computer Vision","start_date":"2017-06-04"},"quality_controlled":"1","isi":1,"fulldoi":"https://doi.org/10.1007/978-3-319-58771-4_26","date_published":"2017-01-01T00:00:00Z","oa_version":"None","publication_status":"published","author":[{"first_name":"Vera","last_name":"Trajkovska","full_name":"Trajkovska, Vera"},{"first_name":"Paul","full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda"},{"first_name":"Freddie","full_name":"Åström, Freddie","last_name":"Åström"},{"first_name":"Stefanie","full_name":"Petra, Stefanie","last_name":"Petra"}],"intvolume":"     10302","abstract":[{"lang":"eng","text":"We introduce two novel methods for learning parameters of graphical models for image labelling. The following two tasks underline both methods: (i) perturb model parameters based on given features and ground truth labelings, so as to exactly reproduce these labelings as optima of the local polytope relaxation of the labelling problem; (ii) train a predictor for the perturbed model parameters so that improved model parameters can be applied to the labelling of novel data. Our first method implements task (i) by inverse linear programming and task (ii) using a regressor e.g. a Gaussian process. Our second approach simultaneously solves tasks (i) and (ii) in a joint manner, while being restricted to linearly parameterised predictors. Experiments demonstrate the merits of both approaches."}],"day":"01","editor":[{"first_name":"François","last_name":"Lauze","full_name":"Lauze, François"},{"last_name":"Dong","full_name":"Dong, Yiqiu","first_name":"Yiqiu"},{"first_name":"Anders","full_name":"Bjorholm Dahl, Anders","last_name":"Bjorholm Dahl"}],"date_updated":"2025-09-11T07:20:56Z","title":"Graphical model parameter learning by inverse linear programming","scopus_import":"1","alternative_title":["LNCS"],"publisher":"Springer","publication_identifier":{"isbn":["978-331958770-7"]},"month":"01","type":"conference","volume":10302,"page":"323 - 334","date_created":"2018-12-11T11:47:39Z","language":[{"iso":"eng"}],"department":[{"_id":"VlKo"}]},{"abstract":[{"text":"Engineering and enhancing the breaking of inversion symmetry in solids—that is, allowing electrons to differentiate between ‘up’ and ‘down’—is a key goal in condensed-matter physics and materials science because it can be used to stabilize states that are of fundamental interest and also have potential practical applications. Examples include improved ferroelectrics for memory devices and materials that host Majorana zero modes for quantum computing1,2. Although inversion symmetry is naturally broken in several crystalline environments, such as at surfaces and interfaces, maximizing the influence of this effect on the electronic states of interest remains a challenge. Here we present a mechanism for realizing a much larger coupling of inversion-symmetry breaking to itinerant surface electrons than is typically achieved. The key element is a pronounced asymmetry of surface hopping energies—that is, a kinetic-energy-coupled inversion-symmetry breaking, the energy scale of which is a substantial fraction of the bandwidth. Using spin- and angle-resolved photoemission spectroscopy, we demonstrate that such a strong inversion-symmetry breaking, when combined with spin–orbit interactions, can mediate Rashba-like3,4 spin splittings that are much larger than would typically be expected. The energy scale of the inversion-symmetry breaking that we achieve is so large that the spin splitting in the CoO2- and RhO2-derived surface states of delafossite oxides becomes controlled by the full atomic spin–orbit coupling of the 3d and 4d transition metals, resulting in some of the largest known Rashba-like3,4 spin splittings. The core structural building blocks that facilitate the bandwidth-scaled inversion-symmetry breaking are common to numerous materials. Our findings therefore provide opportunities for creating spin-textured states and suggest routes to interfacial control of inversion-symmetry breaking in designer heterostructures of oxides and other material classes.","lang":"eng"}],"intvolume":"       549","publication_status":"published","author":[{"id":"23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3","full_name":"Sunko, Veronika","last_name":"Sunko","orcid":"0000-0003-2724-3523","first_name":"Veronika"},{"last_name":"Rosner","full_name":"Rosner, H.","first_name":"H."},{"last_name":"Kushwaha","full_name":"Kushwaha, P.","first_name":"P."},{"first_name":"S.","full_name":"Khim, S.","last_name":"Khim"},{"first_name":"F.","last_name":"Mazzola","full_name":"Mazzola, F."},{"full_name":"Bawden, L.","last_name":"Bawden","first_name":"L."},{"first_name":"O. J.","full_name":"Clark, O. J.","last_name":"Clark"},{"first_name":"J. M.","full_name":"Riley, J. M.","last_name":"Riley"},{"last_name":"Kasinathan","full_name":"Kasinathan, D.","first_name":"D."},{"first_name":"M. W.","full_name":"Haverkort, M. W.","last_name":"Haverkort"},{"last_name":"Kim","full_name":"Kim, T. K.","first_name":"T. K."},{"first_name":"M.","last_name":"Hoesch","full_name":"Hoesch, M."},{"full_name":"Fujii, J.","last_name":"Fujii","first_name":"J."},{"full_name":"Vobornik, I.","last_name":"Vobornik","first_name":"I."},{"first_name":"A. P.","last_name":"Mackenzie","full_name":"Mackenzie, A. P."},{"first_name":"P. D. C.","last_name":"King","full_name":"King, P. D. C."}],"issue":"7673","fulldoi":"https://doi.org/10.1038/nature23898","oa_version":"Preprint","date_published":"2017-09-28T00:00:00Z","quality_controlled":"1","doi":"10.1038/nature23898","OA_type":"green","_id":"19810","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","publication":"Nature","article_processing_charge":"No","external_id":{"arxiv":["1708.03887"],"pmid":["28959958"]},"citation":{"ama":"Sunko V, Rosner H, Kushwaha P, et al. Maximal Rashba-like spin splitting via kinetic-energy-coupled inversion-symmetry breaking. <i>Nature</i>. 2017;549(7673):492-496. doi:<a href=\"https://doi.org/10.1038/nature23898\">10.1038/nature23898</a>","ista":"Sunko V, Rosner H, Kushwaha P, Khim S, Mazzola F, Bawden L, Clark OJ, Riley JM, Kasinathan D, Haverkort MW, Kim TK, Hoesch M, Fujii J, Vobornik I, Mackenzie AP, King PDC. 2017. Maximal Rashba-like spin splitting via kinetic-energy-coupled inversion-symmetry breaking. Nature. 549(7673), 492–496.","apa":"Sunko, V., Rosner, H., Kushwaha, P., Khim, S., Mazzola, F., Bawden, L., … King, P. D. C. (2017). Maximal Rashba-like spin splitting via kinetic-energy-coupled inversion-symmetry breaking. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/nature23898\">https://doi.org/10.1038/nature23898</a>","ieee":"V. Sunko <i>et al.</i>, “Maximal Rashba-like spin splitting via kinetic-energy-coupled inversion-symmetry breaking,” <i>Nature</i>, vol. 549, no. 7673. Springer Nature, pp. 492–496, 2017.","short":"V. Sunko, H. Rosner, P. Kushwaha, S. Khim, F. Mazzola, L. Bawden, O.J. Clark, J.M. Riley, D. Kasinathan, M.W. Haverkort, T.K. Kim, M. Hoesch, J. Fujii, I. Vobornik, A.P. Mackenzie, P.D.C. King, Nature 549 (2017) 492–496.","chicago":"Sunko, Veronika, H. Rosner, P. Kushwaha, S. Khim, F. Mazzola, L. Bawden, O. J. Clark, et al. “Maximal Rashba-like Spin Splitting via Kinetic-Energy-Coupled Inversion-Symmetry Breaking.” <i>Nature</i>. Springer Nature, 2017. <a href=\"https://doi.org/10.1038/nature23898\">https://doi.org/10.1038/nature23898</a>.","mla":"Sunko, Veronika, et al. “Maximal Rashba-like Spin Splitting via Kinetic-Energy-Coupled Inversion-Symmetry Breaking.” <i>Nature</i>, vol. 549, no. 7673, Springer Nature, 2017, pp. 492–96, doi:<a href=\"https://doi.org/10.1038/nature23898\">10.1038/nature23898</a>."},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1708.03887","open_access":"1"}],"arxiv":1,"language":[{"iso":"eng"}],"pmid":1,"page":"492-496","date_created":"2025-06-10T09:13:08Z","extern":"1","article_type":"letter_note","volume":549,"month":"09","type":"journal_article","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"publisher":"Springer Nature","scopus_import":"1","OA_place":"repository","title":"Maximal Rashba-like spin splitting via kinetic-energy-coupled inversion-symmetry breaking","date_updated":"2025-06-10T11:55:09Z","day":"28","oa":1},{"OA_place":"repository","scopus_import":"1","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"publisher":"American Physical Society","date_created":"2025-06-10T09:13:38Z","extern":"1","article_type":"original","volume":96,"month":"08","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1706.08865"}],"language":[{"iso":"eng"}],"arxiv":1,"oa":1,"day":"31","date_updated":"2025-06-10T11:59:05Z","title":"Quasi-two-dimensional Fermi surface topography of the delafossite PdRhO2","quality_controlled":"1","doi":"10.1103/physrevb.96.075163","oa_version":"Preprint","fulldoi":"https://doi.org/10.1103/physrevb.96.075163","date_published":"2017-08-31T00:00:00Z","abstract":[{"text":"We report on a combined study of the de Haas-van Alphen effect and angle-resolved photoemission spectroscopy on single crystals of the metallic delafossite rounded off by ab initio band structure calculations. A high-sensitivity torque magnetometry setup with superconducting quantum interference device readout and synchrotron-based photoemission with a light spot size of enabled high-resolution data to be obtained from samples as small as . The Fermi surface shape is nearly cylindrical with a rounded hexagonal cross section enclosing a Luttinger volume of 1.00(1) electrons per formula unit.","lang":"eng"}],"intvolume":"        96","issue":"7","author":[{"full_name":"Arnold, F.","last_name":"Arnold","first_name":"F."},{"full_name":"Naumann, M.","last_name":"Naumann","first_name":"M."},{"last_name":"Khim","full_name":"Khim, S.","first_name":"S."},{"last_name":"Rosner","full_name":"Rosner, H.","first_name":"H."},{"orcid":"0000-0003-2724-3523","first_name":"Veronika","full_name":"Sunko, Veronika","id":"23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3","last_name":"Sunko"},{"first_name":"F.","full_name":"Mazzola, F.","last_name":"Mazzola"},{"full_name":"King, P. D. C.","last_name":"King","first_name":"P. D. C."},{"first_name":"A. P.","full_name":"Mackenzie, A. P.","last_name":"Mackenzie"},{"full_name":"Hassinger, E.","last_name":"Hassinger","first_name":"E."}],"publication_status":"published","article_processing_charge":"No","external_id":{"arxiv":["1706.08865"]},"citation":{"ama":"Arnold F, Naumann M, Khim S, et al. Quasi-two-dimensional Fermi surface topography of the delafossite PdRhO2. <i>Physical Review B</i>. 2017;96(7). doi:<a href=\"https://doi.org/10.1103/physrevb.96.075163\">10.1103/physrevb.96.075163</a>","ista":"Arnold F, Naumann M, Khim S, Rosner H, Sunko V, Mazzola F, King PDC, Mackenzie AP, Hassinger E. 2017. Quasi-two-dimensional Fermi surface topography of the delafossite PdRhO2. Physical Review B. 96(7), 075163.","apa":"Arnold, F., Naumann, M., Khim, S., Rosner, H., Sunko, V., Mazzola, F., … Hassinger, E. (2017). Quasi-two-dimensional Fermi surface topography of the delafossite PdRhO2. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.96.075163\">https://doi.org/10.1103/physrevb.96.075163</a>","ieee":"F. Arnold <i>et al.</i>, “Quasi-two-dimensional Fermi surface topography of the delafossite PdRhO2,” <i>Physical Review B</i>, vol. 96, no. 7. American Physical Society, 2017.","short":"F. Arnold, M. Naumann, S. Khim, H. Rosner, V. Sunko, F. Mazzola, P.D.C. King, A.P. Mackenzie, E. Hassinger, Physical Review B 96 (2017).","chicago":"Arnold, F., M. Naumann, S. Khim, H. Rosner, Veronika Sunko, F. Mazzola, P. D. C. King, A. P. Mackenzie, and E. Hassinger. “Quasi-Two-Dimensional Fermi Surface Topography of the Delafossite PdRhO2.” <i>Physical Review B</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/physrevb.96.075163\">https://doi.org/10.1103/physrevb.96.075163</a>.","mla":"Arnold, F., et al. “Quasi-Two-Dimensional Fermi Surface Topography of the Delafossite PdRhO2.” <i>Physical Review B</i>, vol. 96, no. 7, 075163, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/physrevb.96.075163\">10.1103/physrevb.96.075163</a>."},"article_number":"075163","publication":"Physical Review B","year":"2017","OA_type":"green","_id":"19811","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"fulldoi":"https://doi.org/10.1021/acs.cgd.7b00418","date_published":"2017-06-30T00:00:00Z","oa_version":"Preprint","intvolume":"        17","abstract":[{"text":"We report growth of single crystals of the nonmagnetic metallic delafossite PdRhO2, comparing the results from three different methods. Complete crystallographic data were obtained from single crystal X-ray diffraction, and electronic structure calculations were made using the refined structural parameters. Focused-ion beam microstructuring was used to prepare a sample for measurements of the in- and out-of-plane electrical resistivity, and the large observed anisotropy is qualitatively consistent with the cylindrical Fermi surface predicted by the calculations.","lang":"eng"}],"author":[{"first_name":"P.","last_name":"Kushwaha","full_name":"Kushwaha, P."},{"last_name":"Borrmann","full_name":"Borrmann, H.","first_name":"H."},{"full_name":"Khim, S.","last_name":"Khim","first_name":"S."},{"first_name":"H.","full_name":"Rosner, H.","last_name":"Rosner"},{"last_name":"Moll","full_name":"Moll, P. J. W.","first_name":"P. J. W."},{"first_name":"D. A.","full_name":"Sokolov, D. A.","last_name":"Sokolov"},{"first_name":"Veronika","orcid":"0000-0003-2724-3523","last_name":"Sunko","id":"23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3","full_name":"Sunko, Veronika"},{"first_name":"Yu.","full_name":"Grin, Yu.","last_name":"Grin"},{"first_name":"A. P.","full_name":"Mackenzie, A. P.","last_name":"Mackenzie"}],"issue":"8","publication_status":"published","doi":"10.1021/acs.cgd.7b00418","quality_controlled":"1","year":"2017","OA_type":"green","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"19815","external_id":{"arxiv":["1706.07614"]},"article_processing_charge":"No","citation":{"ista":"Kushwaha P, Borrmann H, Khim S, Rosner H, Moll PJW, Sokolov DA, Sunko V, Grin Y, Mackenzie AP. 2017. Single crystal growth, structure, and electronic properties of metallic delafossite PdRhO2. Crystal Growth &#38; Design. 17(8), 4144–4150.","apa":"Kushwaha, P., Borrmann, H., Khim, S., Rosner, H., Moll, P. J. W., Sokolov, D. A., … Mackenzie, A. P. (2017). Single crystal growth, structure, and electronic properties of metallic delafossite PdRhO2. <i>Crystal Growth &#38; Design</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.cgd.7b00418\">https://doi.org/10.1021/acs.cgd.7b00418</a>","ieee":"P. Kushwaha <i>et al.</i>, “Single crystal growth, structure, and electronic properties of metallic delafossite PdRhO2,” <i>Crystal Growth &#38; Design</i>, vol. 17, no. 8. American Chemical Society, pp. 4144–4150, 2017.","short":"P. Kushwaha, H. Borrmann, S. Khim, H. Rosner, P.J.W. Moll, D.A. Sokolov, V. Sunko, Y. Grin, A.P. Mackenzie, Crystal Growth &#38; Design 17 (2017) 4144–4150.","chicago":"Kushwaha, P., H. Borrmann, S. Khim, H. Rosner, P. J. W. Moll, D. A. Sokolov, Veronika Sunko, Yu. Grin, and A. P. Mackenzie. “Single Crystal Growth, Structure, and Electronic Properties of Metallic Delafossite PdRhO2.” <i>Crystal Growth &#38; Design</i>. American Chemical Society, 2017. <a href=\"https://doi.org/10.1021/acs.cgd.7b00418\">https://doi.org/10.1021/acs.cgd.7b00418</a>.","mla":"Kushwaha, P., et al. “Single Crystal Growth, Structure, and Electronic Properties of Metallic Delafossite PdRhO2.” <i>Crystal Growth &#38; Design</i>, vol. 17, no. 8, American Chemical Society, 2017, pp. 4144–50, doi:<a href=\"https://doi.org/10.1021/acs.cgd.7b00418\">10.1021/acs.cgd.7b00418</a>.","ama":"Kushwaha P, Borrmann H, Khim S, et al. Single crystal growth, structure, and electronic properties of metallic delafossite PdRhO2. <i>Crystal Growth &#38; Design</i>. 2017;17(8):4144-4150. doi:<a href=\"https://doi.org/10.1021/acs.cgd.7b00418\">10.1021/acs.cgd.7b00418</a>"},"publication":"Crystal Growth & Design","volume":17,"article_type":"original","extern":"1","date_created":"2025-06-10T09:16:10Z","page":"4144-4150","type":"journal_article","month":"06","language":[{"iso":"eng"}],"arxiv":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1706.07614","open_access":"1"}],"OA_place":"repository","scopus_import":"1","publication_identifier":{"eissn":["1528-7505"],"issn":["1528-7483"]},"publisher":"American Chemical Society","date_updated":"2025-06-10T12:24:49Z","title":"Single crystal growth, structure, and electronic properties of metallic delafossite PdRhO2","oa":1,"day":"30"},{"oa":1,"day":"01","related_material":{"record":[{"status":"public","id":"6473","relation":"part_of_dissertation"}]},"date_updated":"2026-04-08T13:55:45Z","title":"Exact goodness-of-fit testing for the Ising model","scopus_import":"1","publisher":"Wiley-Blackwell","publication_identifier":{"issn":["03036898"]},"month":"06","type":"journal_article","page":"285 - 306","date_created":"2018-12-11T11:55:13Z","volume":44,"department":[{"_id":"GaTk"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.1242"}],"arxiv":1,"language":[{"iso":"eng"}],"citation":{"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.","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.","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>.","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>.","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>"},"article_processing_charge":"No","external_id":{"isi":["000400985000001"],"arxiv":["1410.1242"]},"publication":"Scandinavian Journal of Statistics","publist_id":"5060","year":"2017","_id":"2016","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","doi":"10.1111/sjos.12251","fulldoi":"https://doi.org/10.1111/sjos.12251","date_published":"2017-06-01T00:00:00Z","isi":1,"oa_version":"Preprint","author":[{"full_name":"Martin Del Campo Sanchez, Abraham","last_name":"Martin Del Campo Sanchez","first_name":"Abraham"},{"full_name":"Cepeda Humerez, Sarah A","id":"3DEE19A4-F248-11E8-B48F-1D18A9856A87","last_name":"Cepeda Humerez","first_name":"Sarah A"},{"last_name":"Uhler","full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","orcid":"0000-0002-7008-0216"}],"issue":"2","publication_status":"published","intvolume":"        44","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."}]},{"project":[{"name":"Effects of Stochasticity on the Function of Restriction-Modi cation Systems at the Single-Cell Level","grant_number":"24210","_id":"251D65D8-B435-11E9-9278-68D0E5697425"}],"fulldoi":"https://doi.org/10.15479/AT:ISTA:th_916","date_published":"2017-10-01T00:00:00Z","oa_version":"Published Version","publication_status":"published","author":[{"id":"4569785E-F248-11E8-B48F-1D18A9856A87","full_name":"Pleska, Maros","last_name":"Pleska","orcid":"0000-0001-7460-7479","first_name":"Maros"}],"abstract":[{"text":"Restriction-modification (RM) represents the simplest and possibly the most widespread mechanism of self/non-self discrimination in nature. In order to provide bacteria with immunity against bacteriophages and other parasitic genetic elements, RM systems rely on a balance between two enzymes: the restriction enzyme, which cleaves non-self DNA at specific restriction sites, and the modification enzyme, which tags the host’s DNA as self and thus protects it from cleavage. In this thesis, I use population and single-cell level experiments in combination with mathematical modeling to study different aspects of the interplay between RM systems, bacteria and bacteriophages. First, I analyze how mutations in phage restriction sites affect the probability of phage escape – an inherently stochastic process, during which phages accidently get modified instead of restricted. Next, I use single-cell experiments to show that RM systems can, with a low probability, attack the genome of their bacterial host and that this primitive form of autoimmunity leads to a tradeoff between the evolutionary cost and benefit of RM systems. Finally, I investigate the nature of interactions between bacteria, RM systems and temperate bacteriophages to find that, as a consequence of phage escape and its impact on population dynamics, RM systems can promote acquisition of symbiotic bacteriophages, rather than limit it. The results presented here uncover new fundamental biological properties of RM systems and highlight their importance in the ecology and evolution of bacteria, bacteriophages and their interactions.","lang":"eng"}],"doi":"10.15479/AT:ISTA:th_916","year":"2017","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","degree_awarded":"PhD","_id":"202","citation":{"chicago":"Pleska, Maros. “Biology of Restriction-Modification Systems at the Single-Cell and Population Level.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_916\">https://doi.org/10.15479/AT:ISTA:th_916</a>.","mla":"Pleska, Maros. <i>Biology of Restriction-Modification Systems at the Single-Cell and Population Level</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_916\">10.15479/AT:ISTA:th_916</a>.","short":"M. Pleska, Biology of Restriction-Modification Systems at the Single-Cell and Population Level, Institute of Science and Technology Austria, 2017.","ista":"Pleska M. 2017. Biology of restriction-modification systems at the single-cell and population level. Institute of Science and Technology Austria.","apa":"Pleska, M. (2017). <i>Biology of restriction-modification systems at the single-cell and population level</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_916\">https://doi.org/10.15479/AT:ISTA:th_916</a>","ieee":"M. Pleska, “Biology of restriction-modification systems at the single-cell and population level,” Institute of Science and Technology Austria, 2017.","ama":"Pleska M. Biology of restriction-modification systems at the single-cell and population level. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_916\">10.15479/AT:ISTA:th_916</a>"},"article_processing_charge":"No","publist_id":"7711","month":"10","ddc":["576","579"],"type":"dissertation","acknowledgement":"During my PhD studies, I received help from many people, all of which unfortunately cannot be listed here. I thank them deeply and hope that I never made them regret their kindness.\r\nI would like to express my deepest gratitude to Călin Guet, who went far beyond his responsibilities as an advisor and was to me also a great mentor and a friend. Călin never questioned my potential or lacked compassion and I cannot thank him enough for cultivating in me an independent scientist. I was amazed by his ability to recognize the most fascinating scientific problems in objects of study that others would find mundane. I hope I adopted at least a fraction of this ability.\r\nI will be forever grateful to Bruce Levin for all his support and especially for giving me the best possible example of how one can practice excellent science with humor and style. Working with Bruce was a true privilege.\r\nI thank Jonathan Bollback and Gašper Tkačik for serving in my PhD committee and the Austrian Academy of Science for funding my PhD research via the DOC fellowship.\r\nI thank all our lab members: Tobias Bergmiller for his guidance, especially in the first years of my research, and for being a good friend throughout; Remy Chait for staying in the lab at unreasonable hours and for the good laughs at bad jokes we shared; Anna Staron for supportively listening to my whines whenever I had to run a gel; Magdalena Steinrück for her pioneering work in the lab; Kathrin Tomasek for keeping the entropic forces in check and for her FACS virtuosity; Isabella Tomanek for always being nice to me, no matter how much bench space I took from her.\r\nI thank all my collaborators: Reiko Okura and Yuichi Wakamoto for performing and analyzing the microfluidic experiments; Long Qian and Edo Kussell for their bioinformatics analysis; Dominik Refardt for the λ kan phage; Moritz for his help with the mathematical modeling. I thank Fabienne Jesse for her tireless editorial work on all our manuscripts.\r\nFinally, I would like to thank my family and especially my wife Edita, who sacrificed a lot so that I can pursue my goals and dreams.\r\n","pubrep_id":"916","date_created":"2018-12-11T11:45:10Z","page":"126","language":[{"iso":"eng"}],"department":[{"_id":"CaGu"}],"file":[{"relation":"main_file","content_type":"application/pdf","checksum":"33cfb59674e91f82e3738396d3fb3776","file_size":18569590,"file_id":"4710","access_level":"open_access","date_created":"2018-12-12T10:08:48Z","date_updated":"2020-07-14T12:45:24Z","creator":"system","file_name":"IST-2018-916-v1+3_2017_Pleska_Maros_Thesis.pdf"},{"date_created":"2019-04-05T08:33:14Z","access_level":"closed","date_updated":"2020-07-14T12:45:24Z","creator":"dernst","file_name":"2017_Pleska_Maros_Thesis.docx","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"dcc239968decb233e7f98cf1083d8c26","file_size":2801649,"file_id":"6204"}],"file_date_updated":"2020-07-14T12:45:24Z","OA_place":"publisher","corr_author":"1","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","orcid":"0000-0001-6220-2052","first_name":"Calin C"}],"date_updated":"2026-06-18T18:54:19Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Biology of restriction-modification systems at the single-cell and population level","oa":1,"day":"01","related_material":{"record":[{"id":"457","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"1243","relation":"part_of_dissertation"},{"status":"public","id":"561","relation":"part_of_dissertation"}]}},{"pubrep_id":"1053","volume":36,"date_created":"2018-12-11T11:49:38Z","type":"conference","month":"01","ddc":["003","004"],"file":[{"date_updated":"2018-12-12T10:10:24Z","date_created":"2018-12-12T10:10:24Z","access_level":"open_access","file_name":"IST-2018-1053-v1+1_CurveUp.pdf","creator":"system","content_type":"application/pdf","relation":"main_file","file_size":36159696,"file_id":"4811"}],"language":[{"iso":"eng"}],"department":[{"_id":"BeBi"}],"has_accepted_license":"1","alternative_title":["ACM Transactions on Graphics"],"scopus_import":"1","file_date_updated":"2018-12-12T10:10:24Z","ec_funded":1,"publisher":"ACM","date_updated":"2026-04-08T07:25:22Z","title":"CurveUps: Shaping objects from flat plates with tension-actuated curvature","oa":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"8366","status":"public"}]},"day":"01","fulldoi":"https://doi.org/10.1145/3072959.3073709","project":[{"name":"Soft-bodied intelligence for Manipulation","grant_number":"645599","_id":"25082902-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"isi":1,"date_published":"2017-01-01T00:00:00Z","oa_version":"Submitted Version","abstract":[{"lang":"eng","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."}],"intvolume":"        36","publication_status":"published","issue":"4","author":[{"last_name":"Guseinov","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","full_name":"Guseinov, Ruslan","first_name":"Ruslan","orcid":"0000-0001-9819-5077"},{"first_name":"Eder","full_name":"Miguel, Eder","last_name":"Miguel"},{"first_name":"Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1145/3072959.3073709","conference":{"start_date":"2017-08-19","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","location":"Los Angeles, CA, United States","end_date":"2017-08-25"},"quality_controlled":"1","year":"2017","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","_id":"1001","external_id":{"isi":["000406432100032"]},"article_processing_charge":"No","citation":{"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>.","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>.","short":"R. Guseinov, E. Miguel, B. Bickel, in:, ACM, 2017.","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>","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.","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>"},"article_number":"64","publist_id":"6397"}]