[{"alternative_title":["ISTA Thesis"],"year":"2017","oa":1,"related_material":{"record":[{"id":"718","relation":"part_of_dissertation","status":"public"},{"id":"5678","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"87"}]},"page":"86","date_updated":"2023-09-15T12:10:34Z","date_published":"2017-10-27T00:00:00Z","date_created":"2019-04-09T15:04:32Z","department":[{"_id":"HeEd"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"dissertation","language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","abstract":[{"text":"The main objects considered in the present work are simplicial and CW-complexes with vertices forming a random point cloud. In particular, we consider a Poisson point process in R^n and study Delaunay and Voronoi complexes of the first and higher orders and weighted Delaunay complexes obtained as sections of Delaunay complexes, as well as the Čech complex. Further, we examine theDelaunay complex of a Poisson point process on the sphere S^n, as well as of a uniform point cloud, which is equivalent to the convex hull, providing a connection to the theory of random polytopes. Each of the complexes in question can be endowed with a radius function, which maps its cells to the radii of appropriately chosen circumspheres, called the radius of the cell. Applying and developing discrete Morse theory for these functions, joining it together with probabilistic and sometimes analytic machinery, and developing several integral geometric tools, we aim at getting the distributions of circumradii of typical cells. For all considered complexes, we are able to generalize and obtain up to constants the distribution of radii of typical intervals of all types. In low dimensions the constants can be computed explicitly, thus providing the explicit expressions for the expected numbers of cells. In particular, it allows to find the expected density of simplices of every dimension for a Poisson point process in R^4, whereas the result for R^3 was known already in 1970's.","lang":"eng"}],"doi":"10.15479/AT:ISTA:th_873","author":[{"orcid":"0000-0002-0659-3201","full_name":"Nikitenko, Anton","last_name":"Nikitenko","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","first_name":"Anton"}],"title":"Discrete Morse theory for random complexes ","supervisor":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833"}],"_id":"6287","publication_status":"published","status":"public","publication_identifier":{"issn":["2663-337X"]},"oa_version":"Published Version","day":"27","citation":{"chicago":"Nikitenko, Anton. “Discrete Morse Theory for Random Complexes .” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">https://doi.org/10.15479/AT:ISTA:th_873</a>.","mla":"Nikitenko, Anton. <i>Discrete Morse Theory for Random Complexes </i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">10.15479/AT:ISTA:th_873</a>.","ama":"Nikitenko A. Discrete Morse theory for random complexes . 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">10.15479/AT:ISTA:th_873</a>","ista":"Nikitenko A. 2017. Discrete Morse theory for random complexes . Institute of Science and Technology Austria.","short":"A. Nikitenko, Discrete Morse Theory for Random Complexes , Institute of Science and Technology Austria, 2017.","apa":"Nikitenko, A. (2017). <i>Discrete Morse theory for random complexes </i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">https://doi.org/10.15479/AT:ISTA:th_873</a>","ieee":"A. Nikitenko, “Discrete Morse theory for random complexes ,” Institute of Science and Technology Austria, 2017."},"pubrep_id":"873","file_date_updated":"2020-07-14T12:47:26Z","month":"10","ddc":["514","516","519"],"has_accepted_license":"1","article_processing_charge":"No","degree_awarded":"PhD","file":[{"checksum":"ece7e598a2f060b263c2febf7f3fe7f9","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:26Z","file_size":2324870,"relation":"main_file","creator":"dernst","file_name":"2017_Thesis_Nikitenko.pdf","date_created":"2019-04-09T14:54:51Z","file_id":"6289"},{"file_name":"2017_Thesis_Nikitenko_source.zip","relation":"source_file","file_size":2863219,"creator":"dernst","date_updated":"2020-07-14T12:47:26Z","access_level":"closed","content_type":"application/zip","checksum":"99b7ad76e317efd447af60f91e29b49b","file_id":"6290","date_created":"2019-04-09T14:54:51Z"}],"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"}},{"oa_version":"None","day":"13","citation":{"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>.","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>","short":"M. Loose, K. Zieske, P. Schwille, in:, Prokaryotic Cytoskeletons, Springer, 2017, pp. 419–444.","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.","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>"},"pmid":1,"month":"05","volume":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"}],"doi":"10.1007/978-3-319-53047-5_15","author":[{"orcid":"0000-0001-7309-9724","id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Loose, Martin","last_name":"Loose"},{"first_name":"Katja","full_name":"Zieske, Katja","last_name":"Zieske"},{"last_name":"Schwille","full_name":"Schwille, Petra","first_name":"Petra"}],"title":"Reconstitution of protein dynamics involved in bacterial cell division","_id":"629","status":"public","publication_status":"published","publication_identifier":{"eisbn":["978-3-319-53047-5"]},"date_published":"2017-05-13T00:00:00Z","external_id":{"pmid":["28500535"]},"scopus_import":1,"date_created":"2018-12-11T11:47:35Z","department":[{"_id":"MaLo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7165","type":"book_chapter","quality_controlled":"1","language":[{"iso":"eng"}],"series_title":"Sub-Cellular Biochemistry","intvolume":"        84","publisher":"Springer","year":"2017","page":"419 - 444","publication":"Prokaryotic Cytoskeletons","date_updated":"2021-01-12T08:06:57Z"},{"degree_awarded":"PhD","file":[{"access_level":"closed","checksum":"a0fc5c26a89c0ea759947ffba87d0d8f","content_type":"application/pdf","date_updated":"2020-07-14T12:47:27Z","file_name":"thesis_pavel_payne_final_w_signature_page.pdf","file_size":3025175,"creator":"dernst","relation":"main_file","file_id":"6292","date_created":"2019-04-09T15:15:32Z"},{"date_created":"2021-02-22T13:45:59Z","file_id":"9187","creator":"dernst","file_size":3111536,"relation":"main_file","file_name":"2017_Payne_Thesis.pdf","checksum":"af531e921a7f64a9e0af4cd8783b2226","content_type":"application/pdf","access_level":"open_access","date_updated":"2021-02-22T13:45:59Z","success":1}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","type":"dissertation","language":[{"iso":"eng"}],"article_processing_charge":"No","day":"01","department":[{"_id":"NiBa"},{"_id":"JoBo"}],"citation":{"ieee":"P. Payne, “Bacterial herd and social immunity to phages,” Institute of Science and Technology Austria, 2017.","apa":"Payne, P. (2017). <i>Bacterial herd and social immunity to phages</i>. Institute of Science and Technology Austria.","ista":"Payne P. 2017. Bacterial herd and social immunity to phages. Institute of Science and Technology Austria.","ama":"Payne P. Bacterial herd and social immunity to phages. 2017.","short":"P. Payne, Bacterial Herd and Social Immunity to Phages, Institute of Science and Technology Austria, 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."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"02","file_date_updated":"2021-02-22T13:45:59Z","ddc":["570"],"date_published":"2017-02-01T00:00:00Z","date_created":"2019-04-09T15:16:45Z","oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"]},"date_updated":"2023-09-07T12:00:00Z","publication_status":"published","status":"public","page":"83","author":[{"orcid":"0000-0002-2711-9453","id":"35F78294-F248-11E8-B48F-1D18A9856A87","first_name":"Pavel","full_name":"Payne, Pavel","last_name":"Payne"}],"title":"Bacterial herd and social immunity to phages","oa":1,"supervisor":[{"first_name":"Jonathan P","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","last_name":"Bollback","full_name":"Bollback, Jonathan P","orcid":"0000-0002-4624-4612"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","full_name":"Barton, Nicholas H","last_name":"Barton"}],"_id":"6291","year":"2017","alternative_title":["ISTA Thesis"],"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."}]},{"date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:47:36Z","scopus_import":1,"department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7164","type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","publisher":"IOS Press","intvolume":"       236","alternative_title":["Studies in Health Technology and Informatics"],"year":"2017","oa":1,"page":"356 - 362","date_updated":"2021-01-12T08:06:59Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","oa_version":"Published Version","conference":{"name":"eHealth: Health Informatics Meets eHealth","end_date":"2017-05-24","start_date":"2017-05-23","location":"Vienna, Austria"},"citation":{"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>","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>","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>.","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>."},"pubrep_id":"906","day":"01","ddc":["005"],"file_date_updated":"2020-07-14T12:47:27Z","month":"01","has_accepted_license":"1","volume":236,"tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"file":[{"date_updated":"2020-07-14T12:47:27Z","checksum":"1254dcc5b04a996d97fad9a726b42727","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":443635,"creator":"system","file_name":"IST-2017-906-v1+1_SHTI236-0356.pdf","date_created":"2018-12-12T10:11:56Z","file_id":"4913"}],"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."}],"doi":"10.3233/978-1-61499-759-7-356","title":"Biosignals standards and FHIR: The way to go","author":[{"full_name":"Sauermann, Stefan","last_name":"Sauermann","first_name":"Stefan"},{"first_name":"Veronika","last_name":"David","full_name":"David, Veronika"},{"orcid":"0000-0002-5621-8100","first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","full_name":"Schlögl, Alois"},{"full_name":"Egelkraut, Reinhard","last_name":"Egelkraut","first_name":"Reinhard"},{"last_name":"Frohner","full_name":"Frohner, Matthias","first_name":"Matthias"},{"first_name":"Birgit","last_name":"Pohn","full_name":"Pohn, Birgit"},{"first_name":"Philipp","last_name":"Urbauer","full_name":"Urbauer, Philipp"},{"full_name":"Mense, Alexander","last_name":"Mense","first_name":"Alexander"}],"_id":"630","publication_status":"published","status":"public","publication_identifier":{"isbn":["978-161499758-0"]}},{"pubrep_id":"966","citation":{"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>.","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>.","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>","short":"S. Bogomolov, G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2017, pp. 589–606.","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."},"day":"31","ddc":["000"],"month":"03","file_date_updated":"2020-07-14T12:47:27Z","oa_version":"Submitted Version","conference":{"location":"Uppsala, Sweden","start_date":"2017-04-22","end_date":"2017-04-29","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"file":[{"date_created":"2018-12-12T10:11:41Z","file_id":"4897","relation":"main_file","creator":"system","file_size":569863,"file_name":"IST-2017-741-v1+1_main.pdf","checksum":"f395d0d20102b89aeaad8b4ef4f18f4f","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:27Z"},{"date_updated":"2020-07-14T12:47:27Z","checksum":"f416ee1ae4497b23ecdf28b1f18bb8df","content_type":"application/pdf","access_level":"open_access","file_size":563276,"creator":"system","relation":"main_file","file_name":"IST-2018-741-v2+2_main.pdf","date_created":"2018-12-12T10:11:42Z","file_id":"4898"}],"has_accepted_license":"1","volume":10205,"title":"Counterexample guided refinement of template polyhedra","author":[{"full_name":"Bogomolov, Sergiy","last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy","orcid":"0000-0002-0686-0365"},{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"last_name":"Giacobbe","full_name":"Giacobbe, Mirco","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"_id":"631","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."}],"doi":"10.1007/978-3-662-54577-5_34","publication_identifier":{"isbn":["978-366254576-8"]},"project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"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).","status":"public","publication_status":"published","department":[{"_id":"ToHe"}],"publist_id":"7162","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-03-31T00:00:00Z","date_created":"2018-12-11T11:47:36Z","scopus_import":1,"publisher":"Springer","intvolume":"     10205","quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","oa":1,"year":"2017","alternative_title":["LNCS"],"date_updated":"2023-09-07T12:53:00Z","related_material":{"record":[{"id":"6894","relation":"dissertation_contains","status":"public"}]},"page":"589 - 606"},{"ec_funded":1,"status":"public","publication_status":"published","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"doi":"10.1090/proc/13468","abstract":[{"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. ","lang":"eng"}],"issue":"6","_id":"632","title":"A note on 2D focusing many boson systems","author":[{"last_name":"Lewin","full_name":"Lewin, Mathieu","first_name":"Mathieu"},{"full_name":"Nam, Phan","last_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87","first_name":"Phan"},{"full_name":"Rougerie, Nicolas","last_name":"Rougerie","first_name":"Nicolas"}],"volume":145,"oa_version":"Submitted Version","month":"01","citation":{"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>.","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>.","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>","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.","short":"M. Lewin, P. Nam, N. Rougerie, Proceedings of the American Mathematical Society 145 (2017) 2441–2454.","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>","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."},"day":"01","page":"2441 - 2454","date_updated":"2021-01-12T08:07:03Z","publication":"Proceedings of the American Mathematical Society","year":"2017","oa":1,"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"publisher":"American Mathematical Society","intvolume":"       145","main_file_link":[{"url":"https://arxiv.org/abs/1509.09045","open_access":"1"}],"date_created":"2018-12-11T11:47:36Z","scopus_import":1,"date_published":"2017-01-01T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7160","department":[{"_id":"RoSe"}]},{"scopus_import":1,"date_created":"2018-12-11T11:47:37Z","date_published":"2017-01-01T00:00:00Z","publist_id":"7159","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"     10381","publisher":"Springer","year":"2017","alternative_title":["LNCS"],"page":"83 - 89","date_updated":"2021-01-12T08:07:06Z","conference":{"name":"NSV: Numerical Software Verification","location":"Heidelberg, Germany","start_date":"2017-07-22","end_date":"2017-07-23"},"oa_version":"None","month":"01","day":"01","citation":{"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.","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>","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>","short":"S. Bak, S. Bogomolov, T.A. Henzinger, A. Kumar, in:, A. Abate, S. Bodo (Eds.), Springer, 2017, pp. 83–89.","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.","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>."},"volume":10381,"doi":"10.1007/978-3-319-63501-9_6","abstract":[{"lang":"eng","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."}],"_id":"633","editor":[{"first_name":"Alessandro","full_name":"Abate, Alessandro","last_name":"Abate"},{"first_name":"Sylvie","full_name":"Bodo, Sylvie","last_name":"Bodo"}],"author":[{"last_name":"Bak","full_name":"Bak, Stanley","first_name":"Stanley"},{"orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy","last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Aviral","last_name":"Kumar","full_name":"Kumar, Aviral"}],"title":"Challenges and tool implementation of hybrid rapidly exploring random trees","publication_status":"published","status":"public","project":[{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"isbn":["978-331963500-2"]}},{"publication_status":"published","status":"public","publication_identifier":{"eisbn":["978-3-319-52498-6"]},"project":[{"_id":"25473368-B435-11E9-9278-68D0E5697425","grant_number":"F03523","name":"Transmembrane Transporters in Health and Disease","call_identifier":"FWF"}],"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."}],"doi":"10.1007/978-3-319-52498-6_10","author":[{"full_name":"Schroeder, Jan","last_name":"Schroeder","first_name":"Jan"},{"last_name":"Deliu","full_name":"Deliu, Elena","first_name":"Elena","id":"37A40D7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7370-5293"},{"orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia"},{"first_name":"Michael","full_name":"Schmeisser, Michael","last_name":"Schmeisser"}],"title":"Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder","editor":[{"first_name":"Michael","full_name":"Schmeisser, Michael","last_name":"Schmeisser"},{"first_name":"Tobias","full_name":"Boekers, Tobias","last_name":"Boekers"}],"_id":"634","volume":224,"oa_version":"None","day":"28","citation":{"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.","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>","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.","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.","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>","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>.","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>."},"month":"05","page":"189 - 211","publication":"Translational Anatomy and Cell Biology of Autism Spectrum Disorder","date_updated":"2021-01-12T08:07:08Z","year":"2017","alternative_title":["ADVSANAT"],"language":[{"iso":"eng"}],"quality_controlled":"1","type":"book_chapter","series_title":"Advances in Anatomy Embryology and Cell Biology","intvolume":"       224","publisher":"Springer","date_published":"2017-05-28T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:47:37Z","department":[{"_id":"GaNo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7156"},{"ec_funded":1,"status":"public","publication_status":"published","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"isbn":["978-331956616-0"]},"doi":"10.1007/978-3-319-56617-7_2","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"}],"editor":[{"first_name":"Jean-Sébastien","full_name":"Coron, Jean-Sébastien","last_name":"Coron"},{"first_name":"Jesper","last_name":"Buus Nielsen","full_name":"Buus Nielsen, Jesper"}],"_id":"635","title":"Scrypt is maximally memory hard","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","full_name":"Alwen, Joel F","last_name":"Alwen"},{"last_name":"Chen","full_name":"Chen, Binchi","first_name":"Binchi"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"},{"first_name":"Leonid","full_name":"Reyzin, Leonid","last_name":"Reyzin"},{"full_name":"Tessaro, Stefano","last_name":"Tessaro","first_name":"Stefano"}],"volume":10212,"oa_version":"Submitted Version","conference":{"end_date":"2017-05-04","location":"Paris, France","start_date":"2017-04-30","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"month":"01","citation":{"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>.","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>.","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>","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.","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."},"day":"01","page":"33 - 62","date_updated":"2021-01-12T08:07:10Z","year":"2017","alternative_title":["LNCS"],"oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","publisher":"Springer","intvolume":"     10212","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/989"}],"date_created":"2018-12-11T11:47:37Z","scopus_import":1,"date_published":"2017-01-01T00:00:00Z","publist_id":"7154","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"}]},{"month":"08","day":"03","citation":{"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>","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.","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.","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>","short":"A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts (Eds.), Springer, 2017, pp. 189–206.","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>.","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>."},"conference":{"start_date":"2017-09-05","location":"Berlin, Germany","end_date":"2017-09-07","name":"FORMATS: Formal Modelling and Analysis of Timed Systems"},"oa_version":"Submitted Version","volume":10419,"_id":"636","editor":[{"first_name":"Alessandro","last_name":"Abate","full_name":"Abate, Alessandro"},{"first_name":"Gilles","full_name":"Geeraerts, Gilles","last_name":"Geeraerts"}],"author":[{"last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey","first_name":"Alexey"},{"orcid":"0000-0001-5199-3143","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere","full_name":"Ferrere, Thomas"},{"last_name":"Maler","full_name":"Maler, Oded","first_name":"Oded"},{"last_name":"Ulus","full_name":"Ulus, Dogan","first_name":"Dogan"}],"title":"On the quantitative semantics of regular expressions over real-valued signals","doi":"10.1007/978-3-319-65765-3_11","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."}],"project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"publication_identifier":{"isbn":["978-331965764-6"]},"publication_status":"published","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7152","department":[{"_id":"ToHe"}],"scopus_import":1,"date_created":"2018-12-11T11:47:38Z","date_published":"2017-08-03T00:00:00Z","intvolume":"     10419","main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01552132","open_access":"1"}],"publisher":"Springer","language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","oa":1,"year":"2017","alternative_title":["LNCS"],"date_updated":"2021-01-12T08:07:14Z","page":"189 - 206"},{"publication_status":"published","status":"public","ec_funded":1,"publication_identifier":{"isbn":["978-331963687-0"]},"project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"abstract":[{"text":"For many cryptographic primitives, it is relatively easy to achieve selective security (where the adversary commits a-priori to some of the choices to be made later in the attack) but appears difficult to achieve the more natural notion of adaptive security (where the adversary can make all choices on the go as the attack progresses). A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption (Panjwani, TCC ’07 and Fuchsbauer et al., CRYPTO ’15), constrained PRFs (Fuchsbauer et al., ASIACRYPT ’14), and Yao garbled circuits (Jafargholi and Wichs, TCC ’16b). Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework that connects all of these works and allows us to present them in a unified and simplified fashion. Moreover, we use the framework to derive a new result for adaptively secure secret sharing over access structures defined via monotone circuits. We envision that further applications will follow in the future. Underlying our framework is the following simple idea. It is well known that selective security, where the adversary commits to n-bits of information about his future choices, automatically implies adaptive security at the cost of amplifying the adversary’s advantage by a factor of up to 2n. However, in some cases the proof of selective security proceeds via a sequence of hybrids, where each pair of adjacent hybrids locally only requires some smaller partial information consisting of m ≪ n bits. The partial information needed might be completely different between different pairs of hybrids, and if we look across all the hybrids we might rely on the entire n-bit commitment. Nevertheless, the above is sufficient to prove adaptive security, at the cost of amplifying the adversary’s advantage by a factor of only 2m ≪ 2n. In all of our examples using the above framework, the different hybrids are captured by some sort of a graph pebbling game and the amount of information that the adversary needs to commit to in each pair of hybrids is bounded by the maximum number of pebbles in play at any point in time. Therefore, coming up with better strategies for proving adaptive security translates to various pebbling strategies for different types of graphs.","lang":"eng"}],"doi":"10.1007/978-3-319-63688-7_5","author":[{"last_name":"Jafargholi","full_name":"Jafargholi, Zahra","first_name":"Zahra"},{"last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","full_name":"Klein, Karen"},{"first_name":"Ilan","full_name":"Komargodski, Ilan","last_name":"Komargodski"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"},{"first_name":"Daniel","full_name":"Wichs, Daniel","last_name":"Wichs"}],"title":"Be adaptive avoid overcommitting","editor":[{"first_name":"Jonathan","last_name":"Katz","full_name":"Katz, Jonathan"},{"full_name":"Shacham, Hovav","last_name":"Shacham","first_name":"Hovav"}],"_id":"637","volume":10401,"conference":{"name":"CRYPTO: Cryptology","end_date":"2017-07-24","location":"Santa Barbara, CA, United States","start_date":"2017-07-20"},"oa_version":"Submitted Version","day":"01","citation":{"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.","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.","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>","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>.","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>."},"month":"01","related_material":{"record":[{"id":"10035","relation":"dissertation_contains","status":"public"}]},"page":"133 - 163","date_updated":"2023-09-07T13:32:11Z","year":"2017","alternative_title":["LNCS"],"oa":1,"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"     10401","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/515"}],"publisher":"Springer","date_published":"2017-01-01T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:47:38Z","department":[{"_id":"KrPi"}],"publist_id":"7151","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"date_updated":"2022-05-24T07:09:52Z","publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-319-54292-8"]},"status":"public","publication_status":"published","editor":[{"last_name":"Bogomolov","full_name":"Bogomolov, Sergiy","first_name":"Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365"},{"first_name":"Matthieu","last_name":"Martel","full_name":"Martel, Matthieu"},{"last_name":"Prabhakar","full_name":"Prabhakar, Pavithra","first_name":"Pavithra"}],"_id":"638","title":"Numerical Software Verification","doi":"10.1007/978-3-319-54292-8","year":"2017","abstract":[{"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.","lang":"eng"}],"intvolume":"     10152","publisher":"Springer","series_title":"LNCS","quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference_editor","volume":10152,"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7150","month":"01","day":"01","department":[{"_id":"ToHe"}],"citation":{"chicago":"Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. <i>Numerical Software Verification</i>. Vol. 10152. LNCS. 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>.","ieee":"S. Bogomolov, M. Martel, and P. Prabhakar, Eds., <i>Numerical Software Verification</i>, vol. 10152. Springer, 2017.","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>","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.","ista":"Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification, Springer,p."},"conference":{"name":"NSV: Numerical Software Verification","location":"Toronto, ON, Canada","start_date":"2016-07-17","end_date":"2016-07-18"},"date_created":"2018-12-11T11:47:38Z","oa_version":"None","date_published":"2017-01-01T00:00:00Z"},{"alternative_title":["LNCS"],"year":"2017","oa":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"},{"id":"7014","relation":"later_version","status":"public"}]},"page":"41 - 63","date_updated":"2025-06-02T08:53:47Z","external_id":{"arxiv":["1705.00317"]},"date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:47:39Z","scopus_import":1,"department":[{"_id":"KrCh"}],"publist_id":"7149","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","publisher":"Springer","intvolume":"     10427","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.00317"}],"abstract":[{"text":"We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of non-recursive programs. First, we apply ranking functions to recursion, resulting in measure functions, and show that they provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in non-polynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas’ Lemma, and Handelman’s Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form O(n log n) as well as O(nr) where r is not an integer. We present experimental results to demonstrate that our approach can efficiently obtain worst-case bounds of classical recursive algorithms such as Merge-Sort, Closest-Pair, Karatsuba’s algorithm and Strassen’s algorithm.","lang":"eng"}],"doi":"10.1007/978-3-319-63390-9_3","title":"Non-polynomial worst case analysis of recursive programs","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Fu","full_name":"Fu, Hongfei","first_name":"Hongfei"},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir","full_name":"Goharshady, Amir","last_name":"Goharshady"}],"editor":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"first_name":"Viktor","last_name":"Kunčak","full_name":"Kunčak, Viktor"}],"_id":"639","publication_status":"published","status":"public","ec_funded":1,"publication_identifier":{"isbn":["978-331963389-3"]},"project":[{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"oa_version":"Submitted Version","conference":{"name":"CAV: Computer Aided Verification","start_date":"2017-07-24","location":"Heidelberg, Germany","end_date":"2017-07-28"},"citation":{"short":"K. Chatterjee, H. Fu, A.K. Goharshady, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 41–63.","ama":"Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst case analysis of recursive programs. In: Majumdar R, Kunčak V, eds. Vol 10427. Springer; 2017:41-63. doi:<a href=\"https://doi.org/10.1007/978-3-319-63390-9_3\">10.1007/978-3-319-63390-9_3</a>","ista":"Chatterjee K, Fu H, Goharshady AK. 2017. Non-polynomial worst case analysis of recursive programs. CAV: Computer Aided Verification, LNCS, vol. 10427, 41–63.","apa":"Chatterjee, K., Fu, H., &#38; Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar &#38; V. Kunčak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63390-9_3\">https://doi.org/10.1007/978-3-319-63390-9_3</a>","ieee":"K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst case analysis of recursive programs,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 41–63.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst Case Analysis of Recursive Programs.” edited by Rupak Majumdar and Viktor Kunčak, 10427:41–63. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63390-9_3\">https://doi.org/10.1007/978-3-319-63390-9_3</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Non-Polynomial Worst Case Analysis of Recursive Programs</i>. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10427, Springer, 2017, pp. 41–63, doi:<a href=\"https://doi.org/10.1007/978-3-319-63390-9_3\">10.1007/978-3-319-63390-9_3</a>."},"day":"01","month":"01","volume":10427,"article_processing_charge":"No","arxiv":1},{"abstract":[{"lang":"eng","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."}],"doi":"10.1007/978-3-319-56617-7_1","title":"Depth-robust graphs and their cumulative memory complexity","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","full_name":"Alwen, Joel F","last_name":"Alwen"},{"first_name":"Jeremiah","full_name":"Blocki, Jeremiah","last_name":"Blocki"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"}],"_id":"640","editor":[{"full_name":"Coron, Jean-Sébastien","last_name":"Coron","first_name":"Jean-Sébastien"},{"first_name":"Jesper","last_name":"Buus Nielsen","full_name":"Buus Nielsen, Jesper"}],"status":"public","publication_status":"published","ec_funded":1,"publication_identifier":{"isbn":["978-331956616-0"]},"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"oa_version":"Submitted Version","conference":{"location":"Paris, France","start_date":"2017-04-30","end_date":"2017-05-04","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"citation":{"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>.","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>.","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.","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>","short":"J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32."},"day":"01","month":"04","volume":10212,"alternative_title":["LNCS"],"year":"2017","oa":1,"page":"3 - 32","date_updated":"2021-01-12T08:07:22Z","date_published":"2017-04-01T00:00:00Z","date_created":"2018-12-11T11:47:39Z","scopus_import":1,"department":[{"_id":"KrPi"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7148","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"publisher":"Springer","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/875"}],"intvolume":"     10212"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7147","month":"01","day":"01","department":[{"_id":"VlKo"}],"citation":{"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.","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>","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>","short":"V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.","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.","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>.","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>."},"conference":{"end_date":"2017-06-08","location":"Kolding, Denmark","start_date":"2017-06-04","name":"SSVM: Scale Space and Variational Methods in Computer Vision"},"scopus_import":1,"date_created":"2018-12-11T11:47:39Z","oa_version":"None","date_published":"2017-01-01T00:00:00Z","intvolume":"     10302","publisher":"Springer","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","volume":10302,"editor":[{"first_name":"François","last_name":"Lauze","full_name":"Lauze, François"},{"last_name":"Dong","full_name":"Dong, Yiqiu","first_name":"Yiqiu"},{"last_name":"Bjorholm Dahl","full_name":"Bjorholm Dahl, Anders","first_name":"Anders"}],"_id":"641","author":[{"first_name":"Vera","last_name":"Trajkovska","full_name":"Trajkovska, Vera"},{"full_name":"Swoboda, Paul","last_name":"Swoboda","id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul"},{"full_name":"Åström, Freddie","last_name":"Åström","first_name":"Freddie"},{"last_name":"Petra","full_name":"Petra, Stefanie","first_name":"Stefanie"}],"title":"Graphical model parameter learning by inverse linear programming","doi":"10.1007/978-3-319-58771-4_26","alternative_title":["LNCS"],"year":"2017","abstract":[{"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.","lang":"eng"}],"date_updated":"2021-01-12T08:07:23Z","publication_identifier":{"isbn":["978-331958770-7"]},"page":"323 - 334","status":"public","publication_status":"published"},{"month":"01","citation":{"chicago":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” <i>Mathematics of Computation</i>. American Mathematical Society, 2017. <a href=\"https://doi.org/10.1090/mcom/3201\">https://doi.org/10.1090/mcom/3201</a>.","mla":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” <i>Mathematics of Computation</i>, vol. 86, no. 307, American Mathematical Society, 2017, pp. 2373–97, doi:<a href=\"https://doi.org/10.1090/mcom/3201\">10.1090/mcom/3201</a>.","apa":"Gerencser, M., &#38; Gyöngy, I. (2017). Localization errors in solving stochastic partial differential equations in the whole space. <i>Mathematics of Computation</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/mcom/3201\">https://doi.org/10.1090/mcom/3201</a>","ieee":"M. Gerencser and I. Gyöngy, “Localization errors in solving stochastic partial differential equations in the whole space,” <i>Mathematics of Computation</i>, vol. 86, no. 307. American Mathematical Society, pp. 2373–2397, 2017.","short":"M. Gerencser, I. Gyöngy, Mathematics of Computation 86 (2017) 2373–2397.","ista":"Gerencser M, Gyöngy I. 2017. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 86(307), 2373–2397.","ama":"Gerencser M, Gyöngy I. Localization errors in solving stochastic partial differential equations in the whole space. <i>Mathematics of Computation</i>. 2017;86(307):2373-2397. doi:<a href=\"https://doi.org/10.1090/mcom/3201\">10.1090/mcom/3201</a>"},"day":"01","oa_version":"Submitted Version","volume":86,"_id":"642","title":"Localization errors in solving stochastic partial differential equations in the whole space","author":[{"full_name":"Gerencser, Mate","last_name":"Gerencser","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate"},{"last_name":"Gyöngy","full_name":"Gyöngy, István","first_name":"István"}],"doi":"10.1090/mcom/3201","abstract":[{"text":"Cauchy problems with SPDEs on the whole space are localized to Cauchy problems on a ball of radius R. This localization reduces various kinds of spatial approximation schemes to finite dimensional problems. The error is shown to be exponentially small. As an application, a numerical scheme is presented which combines the localization and the space and time discretization, and thus is fully implementable.","lang":"eng"}],"issue":"307","publication_identifier":{"issn":["00255718"]},"status":"public","publication_status":"published","publist_id":"7144","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JaMa"}],"date_created":"2018-12-11T11:47:40Z","scopus_import":1,"date_published":"2017-01-01T00:00:00Z","publisher":"American Mathematical Society","main_file_link":[{"url":"https://arxiv.org/abs/1508.05535","open_access":"1"}],"intvolume":"        86","type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","oa":1,"year":"2017","date_updated":"2021-01-12T08:07:26Z","publication":"Mathematics of Computation","page":"2373 - 2397"},{"oa":1,"title":"Synchronizing the asynchronous","author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"orcid":"0000-0001-7745-9117","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","full_name":"Kragl, Bernhard"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"}],"_id":"6426","abstract":[{"text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent asynchronous computation threads. We show that specifications and correctness proofs for asynchronous programs can be structured by introducing the fiction, for proof purposes, that intermediate, non-quiescent states of asynchronous operations can be ignored. Then, the task of specification becomes relatively simple and the task of verification can be naturally decomposed into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure of an asynchronous program, the atomic effect of non-atomic operations and the synchronous effect of asynchronous operations. This structuring of specifications and proofs corresponds to the introduction of multiple layers of stepwise refinement for asynchronous programs. We present the first proof rule, called synchronization, to reduce asynchronous invocations on a lower layer to synchronous invocations on a higher layer. We implemented our proof method in CIVL and evaluated it on a collection of benchmark programs.","lang":"eng"}],"alternative_title":["IST Austria Technical Report"],"year":"2017","doi":"10.15479/AT:IST-2018-853-v2-2","publication_identifier":{"issn":["2664-1690"]},"date_updated":"2023-02-21T16:59:21Z","related_material":{"record":[{"id":"133","status":"public","relation":"later_version"}]},"status":"public","publication_status":"published","page":"28","citation":{"apa":"Henzinger, T. A., Kragl, B., &#38; Qadeer, S. (2017). <i>Synchronizing the asynchronous</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">https://doi.org/10.15479/AT:IST-2018-853-v2-2</a>","ieee":"T. A. Henzinger, B. Kragl, and S. Qadeer, <i>Synchronizing the asynchronous</i>. IST Austria, 2017.","short":"T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017.","ama":"Henzinger TA, Kragl B, Qadeer S. <i>Synchronizing the Asynchronous</i>. IST Austria; 2017. doi:<a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">10.15479/AT:IST-2018-853-v2-2</a>","ista":"Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p.","mla":"Henzinger, Thomas A., et al. <i>Synchronizing the Asynchronous</i>. IST Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">10.15479/AT:IST-2018-853-v2-2</a>.","chicago":"Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. <i>Synchronizing the Asynchronous</i>. IST Austria, 2017. <a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">https://doi.org/10.15479/AT:IST-2018-853-v2-2</a>."},"day":"04","department":[{"_id":"ToHe"}],"month":"08","file_date_updated":"2020-07-14T12:47:30Z","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-08-04T00:00:00Z","oa_version":"Published Version","date_created":"2019-05-13T08:15:55Z","publisher":"IST Austria","file":[{"creator":"dernst","file_size":971347,"relation":"main_file","file_name":"main(1).pdf","date_updated":"2020-07-14T12:47:30Z","checksum":"b48d42725182d7ca10107a118815f4cf","content_type":"application/pdf","access_level":"open_access","date_created":"2019-05-13T08:14:44Z","file_id":"6431"}],"has_accepted_license":"1","type":"technical_report","language":[{"iso":"eng"}]},{"article_type":"original","page":"207 - 214","date_updated":"2021-01-12T08:07:28Z","publication":"Chinese Journal of Physiology","year":"2017","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"        60","publisher":"Chinese Physiological Society","scopus_import":1,"date_created":"2018-12-11T11:47:40Z","external_id":{"pmid":["28847140"]},"date_published":"2017-08-31T00:00:00Z","publist_id":"7142","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RySh"}],"status":"public","publication_status":"published","publication_identifier":{"issn":["03044920"]},"doi":"10.4077/CJP.2017.BAF469","issue":"4","abstract":[{"text":"It has been reported that nicotinamide-overload induces oxidative stress associated with insulin resistance, the key feature of type 2 diabetes mellitus (T2DM). This study aimed to investigate the effects of B vitamins in T2DM. Glucose tolerance tests (GTT) were carried out in adult Sprague-Dawley rats treated with or without cumulative doses of B vitamins. More specifically, insulin tolerance tests (ITT) were also carried out in adult Sprague-Dawley rats treated with or without cumulative doses of Vitamin B3. We found that cumulative Vitamin B1 and Vitamin B3 administration significantly increased the plasma H2O2 levels associated with high insulin levels. Only Vitamin B3 reduced muscular and hepatic glycogen contents. Cumulative administration of nicotinic acid, another form of Vitamin B3, also significantly increased plasma insulin level and H2O2 generation. Moreover, cumulative administration of nicotinic acid or nicotinamide impaired glucose metabolism. This study suggested that excess Vitamin B1 and Vitamin B3 caused oxidative stress and insulin resistance.","lang":"eng"}],"_id":"643","author":[{"last_name":"Sun","full_name":"Sun, Wuping","first_name":"Wuping"},{"full_name":"Zhai, Ming-Zhu","last_name":"Zhai","id":"34009CFA-F248-11E8-B48F-1D18A9856A87","first_name":"Ming-Zhu"},{"last_name":"Zhou","full_name":"Zhou, Qian","first_name":"Qian"},{"first_name":"Chengrui","last_name":"Qian","full_name":"Qian, Chengrui"},{"last_name":"Jiang","full_name":"Jiang, Changyu","first_name":"Changyu"}],"title":"Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats","article_processing_charge":"No","volume":60,"oa_version":"Published Version","month":"08","pmid":1,"ddc":["570"],"day":"31","citation":{"apa":"Sun, W., Zhai, M.-Z., Zhou, Q., Qian, C., &#38; Jiang, C. (2017). Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. <i>Chinese Journal of Physiology</i>. Chinese Physiological Society. <a href=\"https://doi.org/10.4077/CJP.2017.BAF469\">https://doi.org/10.4077/CJP.2017.BAF469</a>","ieee":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, and C. Jiang, “Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats,” <i>Chinese Journal of Physiology</i>, vol. 60, no. 4. Chinese Physiological Society, pp. 207–214, 2017.","ama":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. <i>Chinese Journal of Physiology</i>. 2017;60(4):207-214. doi:<a href=\"https://doi.org/10.4077/CJP.2017.BAF469\">10.4077/CJP.2017.BAF469</a>","ista":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. 2017. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 60(4), 207–214.","short":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, C. Jiang, Chinese Journal of Physiology 60 (2017) 207–214.","mla":"Sun, Wuping, et al. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” <i>Chinese Journal of Physiology</i>, vol. 60, no. 4, Chinese Physiological Society, 2017, pp. 207–14, doi:<a href=\"https://doi.org/10.4077/CJP.2017.BAF469\">10.4077/CJP.2017.BAF469</a>.","chicago":"Sun, Wuping, Ming-Zhu Zhai, Qian Zhou, Chengrui Qian, and Changyu Jiang. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” <i>Chinese Journal of Physiology</i>. Chinese Physiological Society, 2017. <a href=\"https://doi.org/10.4077/CJP.2017.BAF469\">https://doi.org/10.4077/CJP.2017.BAF469</a>."}},{"date_published":"2017-06-29T00:00:00Z","date_created":"2018-12-11T11:47:40Z","scopus_import":1,"department":[{"_id":"VlKo"}],"publist_id":"7138","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","publisher":"SIAM","intvolume":"        46","main_file_link":[{"url":"https://arxiv.org/abs/1502.07327","open_access":"1"}],"year":"2017","oa":1,"related_material":{"record":[{"id":"1637","relation":"other","status":"public"}]},"page":"1087 - 1110","publication":"SIAM Journal on Computing","date_updated":"2023-02-23T10:07:49Z","oa_version":"Preprint","citation":{"ieee":"V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” <i>SIAM Journal on Computing</i>, vol. 46, no. 3. SIAM, pp. 1087–1110, 2017.","apa":"Kolmogorov, V., Krokhin, A., &#38; Rolinek, M. (2017). The complexity of general-valued CSPs. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/16M1091836\">https://doi.org/10.1137/16M1091836</a>","ama":"Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. <i>SIAM Journal on Computing</i>. 2017;46(3):1087-1110. doi:<a href=\"https://doi.org/10.1137/16M1091836\">10.1137/16M1091836</a>","short":"V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.","ista":"Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.","chicago":"Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” <i>SIAM Journal on Computing</i>. SIAM, 2017. <a href=\"https://doi.org/10.1137/16M1091836\">https://doi.org/10.1137/16M1091836</a>.","mla":"Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” <i>SIAM Journal on Computing</i>, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:<a href=\"https://doi.org/10.1137/16M1091836\">10.1137/16M1091836</a>."},"day":"29","month":"06","volume":46,"abstract":[{"text":"An instance of the valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates an infeasible assignment. The goal is to find an assignment of labels to the variables that minimizes the sum. We study, assuming that P 6= NP, how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in f0;1g corresponds to ordinary CSPs, where one deals only with the feasibility issue, and there is no optimization. This case is the subject of the algebraic CSP dichotomy conjecture predicting for which constraint languages CSPs are tractable (i.e., solvable in polynomial time) and for which they are NP-hard. The case when all allowed functions take only finite values corresponds to a finitevalued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Živný. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP (i.e., the problem of deciding whether a given instance has a feasible solution) corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs.","lang":"eng"}],"issue":"3","doi":"10.1137/16M1091836","title":"The complexity of general-valued CSPs","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"},{"full_name":"Krokhin, Andrei","last_name":"Krokhin","first_name":"Andrei"},{"full_name":"Rolinek, Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal"}],"_id":"644","status":"public","publication_status":"published","ec_funded":1,"project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}]},{"author":[{"full_name":"Ashok, Pranav","last_name":"Ashok","first_name":"Pranav"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Daca","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Kretinsky, Jan","last_name":"Kretinsky"},{"first_name":"Tobias","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias"}],"title":"Value iteration for long run average reward in markov decision processes","editor":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"first_name":"Viktor","full_name":"Kunčak, Viktor","last_name":"Kunčak"}],"_id":"645","abstract":[{"lang":"eng","text":"Markov decision processes (MDPs) are standard models for probabilistic systems with non-deterministic behaviours. Long-run average rewards provide a mathematically elegant formalism for expressing long term performance. Value iteration (VI) is one of the simplest and most efficient algorithmic approaches to MDPs with other properties, such as reachability objectives. Unfortunately, a naive extension of VI does not work for MDPs with long-run average rewards, as there is no known stopping criterion. In this work our contributions are threefold. (1) We refute a conjecture related to stopping criteria for MDPs with long-run average rewards. (2) We present two practical algorithms for MDPs with long-run average rewards based on VI. First, we show that a combination of applying VI locally for each maximal end-component (MEC) and VI for reachability objectives can provide approximation guarantees. Second, extending the above approach with a simulation-guided on-demand variant of VI, we present an anytime algorithm that is able to deal with very large models. (3) Finally, we present experimental results showing that our methods significantly outperform the standard approaches on several benchmarks."}],"doi":"10.1007/978-3-319-63387-9_10","publication_identifier":{"isbn":["978-331963386-2"]},"project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"status":"public","publication_status":"published","ec_funded":1,"day":"13","citation":{"mla":"Ashok, Pranav, et al. <i>Value Iteration for Long Run Average Reward in Markov Decision Processes</i>. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:<a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">10.1007/978-3-319-63387-9_10</a>.","chicago":"Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">https://doi.org/10.1007/978-3-319-63387-9_10</a>.","apa":"Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., &#38; Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar &#38; V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">https://doi.org/10.1007/978-3-319-63387-9_10</a>","ieee":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.","ama":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration for long run average reward in markov decision processes. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:201-221. doi:<a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">10.1007/978-3-319-63387-9_10</a>","ista":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.","short":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221."},"month":"07","conference":{"name":"CAV: Computer Aided Verification","start_date":"2017-07-24","location":"Heidelberg, Germany","end_date":"2017-07-28"},"oa_version":"Submitted Version","volume":10426,"oa":1,"year":"2017","alternative_title":["LNCS"],"date_updated":"2021-01-12T08:07:32Z","page":"201 - 221","department":[{"_id":"KrCh"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7135","date_published":"2017-07-13T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:47:41Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02326"}],"intvolume":"     10426","publisher":"Springer","quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference"}]