[{"title":"Persistent homology in image processing","page":"182-183","quality_controlled":"1","conference":{"location":"Vienna, Austria","end_date":"2013-05-17","name":"GbRPR: Graph-based Representations in Pattern Recognition","start_date":"2013-05-15"},"date_created":"2022-03-21T07:30:33Z","citation":{"apa":"Edelsbrunner, H. (2013). Persistent homology in image processing. In <i>Graph-Based Representations in Pattern Recognition</i> (Vol. 7877, pp. 182–183). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-38221-5_19\">https://doi.org/10.1007/978-3-642-38221-5_19</a>","chicago":"Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” In <i>Graph-Based Representations in Pattern Recognition</i>, 7877:182–83. LNCS. Berlin, Heidelberg: Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-38221-5_19\">https://doi.org/10.1007/978-3-642-38221-5_19</a>.","mla":"Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” <i>Graph-Based Representations in Pattern Recognition</i>, vol. 7877, Springer Nature, 2013, pp. 182–83, doi:<a href=\"https://doi.org/10.1007/978-3-642-38221-5_19\">10.1007/978-3-642-38221-5_19</a>.","ama":"Edelsbrunner H. Persistent homology in image processing. In: <i>Graph-Based Representations in Pattern Recognition</i>. Vol 7877. LNCS. Berlin, Heidelberg: Springer Nature; 2013:182-183. doi:<a href=\"https://doi.org/10.1007/978-3-642-38221-5_19\">10.1007/978-3-642-38221-5_19</a>","ista":"Edelsbrunner H. 2013. Persistent homology in image processing. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNCS vol. 7877, 182–183.","ieee":"H. Edelsbrunner, “Persistent homology in image processing,” in <i>Graph-Based Representations in Pattern Recognition</i>, Vienna, Austria, 2013, vol. 7877, pp. 182–183.","short":"H. Edelsbrunner, in:, Graph-Based Representations in Pattern Recognition, Springer Nature, Berlin, Heidelberg, 2013, pp. 182–183."},"article_processing_charge":"No","ec_funded":1,"doi":"10.1007/978-3-642-38221-5_19","date_published":"2013-06-01T00:00:00Z","intvolume":"      7877","place":"Berlin, Heidelberg","acknowledgement":"This research is partially supported by the European Science Foundation (ESF) under the Research Network Programme, the European Union under the Toposys Project FP7-ICT-318493-STREP, the Russian Government under the Mega Project 11.G34.31.0053.","publication":"Graph-Based Representations in Pattern Recognition","day":"01","volume":7877,"department":[{"_id":"HeEd"}],"project":[{"grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"month":"06","year":"2013","publication_identifier":{"isbn":["9783642382208"],"issn":["0302-9743"],"eisbn":["9783642382215"],"eissn":["1611-3349"]},"publication_status":"published","_id":"10897","type":"conference","oa_version":"None","publisher":"Springer Nature","status":"public","author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","abstract":[{"text":"Taking images is an efficient way to collect data about the physical world. It can be done fast and in exquisite detail. By definition, image processing is the field that concerns itself with the computation aimed at harnessing the information contained in images [10]. This talk is concerned with topological information. Our main thesis is that persistent homology [5] is a useful method to quantify and summarize topological information, building a bridge that connects algebraic topology with applications. We provide supporting evidence for this thesis by touching upon four technical developments in the overlap between persistent homology and image processing.","lang":"eng"}],"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-05T15:10:20Z","series_title":"LNCS"},{"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Proceedings of the ACM International Conference on Computing Frontiers - CF '13","day":"01","date_updated":"2022-06-21T08:01:19Z","date_published":"2013-05-01T00:00:00Z","scopus_import":"1","abstract":[{"lang":"eng","text":"A prominent remedy to multicore scalability issues in concurrent data structure implementations is to relax the sequential specification of the data structure. We present distributed queues (DQ), a new family of relaxed concurrent queue implementations. DQs implement relaxed queues with linearizable emptiness check and either configurable or bounded out-of-order behavior or pool behavior. Our experiments show that DQs outperform and outscale in micro- and macrobenchmarks all strict and relaxed queue as well as pool implementations that we considered."}],"doi":"10.1145/2482767.2482789","status":"public","article_processing_charge":"No","author":[{"first_name":"Andreas","last_name":"Haas","full_name":"Haas, Andreas"},{"full_name":"Lippautz, Michael","last_name":"Lippautz","first_name":"Michael"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Payer","full_name":"Payer, Hannes","first_name":"Hannes"},{"full_name":"Sokolova, Ana","last_name":"Sokolova","first_name":"Ana"},{"first_name":"Christoph M.","full_name":"Kirsch, Christoph M.","last_name":"Kirsch"},{"last_name":"Sezgin","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali"}],"article_number":"17","publisher":"ACM Press","publication_status":"published","quality_controlled":"1","_id":"10898","conference":{"name":"CF: Conference on Computing Frontiers","start_date":"2013-05-14","location":"Ischia, Italy","end_date":"2013-05-16"},"issue":"5","oa_version":"None","type":"conference","citation":{"mla":"Haas, Andreas, et al. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>, no. 5, 17, ACM Press, 2013, doi:<a href=\"https://doi.org/10.1145/2482767.2482789\">10.1145/2482767.2482789</a>.","chicago":"Haas, Andreas, Michael Lippautz, Thomas A Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, and Ali Sezgin. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” In <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. ACM Press, 2013. <a href=\"https://doi.org/10.1145/2482767.2482789\">https://doi.org/10.1145/2482767.2482789</a>.","apa":"Haas, A., Lippautz, M., Henzinger, T. A., Payer, H., Sokolova, A., Kirsch, C. M., &#38; Sezgin, A. (2013). Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. Ischia, Italy: ACM Press. <a href=\"https://doi.org/10.1145/2482767.2482789\">https://doi.org/10.1145/2482767.2482789</a>","short":"A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch, A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, ACM Press, 2013.","ista":"Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin A. 2013. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. CF: Conference on Computing Frontiers, 17.","ieee":"A. Haas <i>et al.</i>, “Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation,” in <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>, Ischia, Italy, 2013, no. 5.","ama":"Haas A, Lippautz M, Henzinger TA, et al. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In: <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. ACM Press; 2013. doi:<a href=\"https://doi.org/10.1145/2482767.2482789\">10.1145/2482767.2482789</a>"},"date_created":"2022-03-21T07:33:22Z","month":"05","year":"2013","publication_identifier":{"isbn":["978-145032053-5"]},"department":[{"_id":"ToHe"}],"title":"Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2022-06-20T09:18:06Z","day":"01","publication":"Encyclopedia of Biodiversity","scopus_import":"1","date_published":"2013-01-01T00:00:00Z","keyword":["Adaptive landscape","Cline","Coalescent process","Gene flow","Hybrid zone","Local adaptation","Natural selection","Neutral theory","Population structure","Speciation"],"doi":"10.1016/b978-0-12-384719-5.00031-9","author":[{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","status":"public","publisher":"Elsevier","_id":"10899","quality_controlled":"1","publication_status":"published","date_created":"2022-03-21T07:46:22Z","citation":{"chicago":"Barton, Nicholas H. “Differentiation.” In <i>Encyclopedia of Biodiversity</i>, 2nd ed., 508–15. Elsevier, 2013. <a href=\"https://doi.org/10.1016/b978-0-12-384719-5.00031-9\">https://doi.org/10.1016/b978-0-12-384719-5.00031-9</a>.","apa":"Barton, N. H. (2013). Differentiation. In <i>Encyclopedia of Biodiversity</i> (2nd ed., pp. 508–515). Elsevier. <a href=\"https://doi.org/10.1016/b978-0-12-384719-5.00031-9\">https://doi.org/10.1016/b978-0-12-384719-5.00031-9</a>","mla":"Barton, Nicholas H. “Differentiation.” <i>Encyclopedia of Biodiversity</i>, 2nd ed., Elsevier, 2013, pp. 508–15, doi:<a href=\"https://doi.org/10.1016/b978-0-12-384719-5.00031-9\">10.1016/b978-0-12-384719-5.00031-9</a>.","ieee":"N. H. Barton, “Differentiation,” in <i>Encyclopedia of Biodiversity</i>, 2nd ed., Elsevier, 2013, pp. 508–515.","ista":"Barton NH. 2013.Differentiation. In: Encyclopedia of Biodiversity. , 508–515.","short":"N.H. Barton, in:, Encyclopedia of Biodiversity, 2nd ed., Elsevier, 2013, pp. 508–515.","ama":"Barton NH. Differentiation. In: <i>Encyclopedia of Biodiversity</i>. 2nd ed. Elsevier; 2013:508-515. doi:<a href=\"https://doi.org/10.1016/b978-0-12-384719-5.00031-9\">10.1016/b978-0-12-384719-5.00031-9</a>"},"oa_version":"None","type":"book_chapter","year":"2013","month":"01","page":"508-515","publication_identifier":{"isbn":["978-0-12-384720-1"]},"edition":"2","title":"Differentiation","department":[{"_id":"NiBa"}]},{"year":"2013","month":"04","publication_identifier":{"eissn":["1940-6029"],"eisbn":["9781627034265"],"isbn":["9781627034258"],"issn":["1064-3745"]},"department":[{"_id":"MiSi"}],"publisher":"Humana Press","_id":"10900","external_id":{"pmid":["23625502"]},"alternative_title":["Methods in Molecular Biology"],"publication_status":"published","type":"book_chapter","oa_version":"None","author":[{"first_name":"Michele","id":"3A3FC708-F248-11E8-B48F-1D18A9856A87","last_name":"Weber","full_name":"Weber, Michele"},{"full_name":"Sixt, Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"status":"public","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-05T13:15:33Z","series_title":"MIMB","scopus_import":"1","abstract":[{"lang":"eng","text":"Leukocyte migration through the interstitial space is crucial for the maintenance of tolerance and immunity. The main cues for leukocyte trafficking are chemokines thought to directionally guide these cells towards their targets. However, model systems that facilitate quantification of chemokine-guided leukocyte migration in vivo are uncommon. Here we describe an ex vivo crawl-in assay using explanted mouse ears that allows the visualization of chemokine-dependent dendritic cell (DC) motility in the dermal interstitium in real time. We present methods for the preparation of mouse ear sheets and their use in multidimensional confocal imaging experiments to monitor and analyze the directional migration of fluorescently labelled DCs through the dermis and into afferent lymphatic vessels. The assay provides a more physiological approach to study leukocyte migration than in vitro three-dimensional (3D) or 2-dimensional (2D) migration assays such as collagen gels and transwell assays."}],"page":"215-226","title":"Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations","quality_controlled":"1","date_created":"2022-03-21T07:47:41Z","citation":{"short":"M. Weber, M.K. Sixt, in:, A. Cardona, E. Ubogu (Eds.), Chemokines, Humana Press, Totowa, NJ, 2013, pp. 215–226.","ieee":"M. Weber and M. K. Sixt, “Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations,” in <i>Chemokines</i>, vol. 1013, A. Cardona and E. Ubogu, Eds. Totowa, NJ: Humana Press, 2013, pp. 215–226.","ista":"Weber M, Sixt MK. 2013.Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations. In: Chemokines. Methods in Molecular Biology, vol. 1013, 215–226.","ama":"Weber M, Sixt MK. Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations. In: Cardona A, Ubogu E, eds. <i>Chemokines</i>. Vol 1013. MIMB. Totowa, NJ: Humana Press; 2013:215-226. doi:<a href=\"https://doi.org/10.1007/978-1-62703-426-5_14\">10.1007/978-1-62703-426-5_14</a>","mla":"Weber, Michele, and Michael K. Sixt. “Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations.” <i>Chemokines</i>, edited by Astrid Cardona and Eroboghene Ubogu, vol. 1013, Humana Press, 2013, pp. 215–26, doi:<a href=\"https://doi.org/10.1007/978-1-62703-426-5_14\">10.1007/978-1-62703-426-5_14</a>.","chicago":"Weber, Michele, and Michael K Sixt. “Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations.” In <i>Chemokines</i>, edited by Astrid Cardona and Eroboghene Ubogu, 1013:215–26. MIMB. Totowa, NJ: Humana Press, 2013. <a href=\"https://doi.org/10.1007/978-1-62703-426-5_14\">https://doi.org/10.1007/978-1-62703-426-5_14</a>.","apa":"Weber, M., &#38; Sixt, M. K. (2013). Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations. In A. Cardona &#38; E. Ubogu (Eds.), <i>Chemokines</i> (Vol. 1013, pp. 215–226). Totowa, NJ: Humana Press. <a href=\"https://doi.org/10.1007/978-1-62703-426-5_14\">https://doi.org/10.1007/978-1-62703-426-5_14</a>"},"doi":"10.1007/978-1-62703-426-5_14","article_processing_charge":"No","place":"Totowa, NJ","pmid":1,"volume":1013,"publication":"Chemokines","acknowledgement":"We would like to thank Alexander Eichner and Ingrid de Vries for discussion and critical reading of the manuscript, and Mary Frank for assistance with the recording of videos and images in Fig. 1. M.S. is supported through funding from the German Research Foundation (DFG). M.W. acknowledges the Alexander von Humboldt Foundation for funding.","day":"03","date_published":"2013-04-03T00:00:00Z","editor":[{"first_name":"Astrid","full_name":"Cardona, Astrid","last_name":"Cardona"},{"first_name":"Eroboghene","last_name":"Ubogu","full_name":"Ubogu, Eroboghene"}],"intvolume":"      1013"},{"title":"How to travel between languages","page":"214-225","conference":{"start_date":"2013-04-02","name":"LATA: Conference on Language and Automata Theory and Applications","location":"Bilbao, Spain","end_date":"2013-04-05"},"quality_controlled":"1","date_created":"2022-03-21T07:56:21Z","citation":{"short":"K. Chatterjee, S. Chaubal, S. Rubin, in:, 7th International Conference on Language and Automata Theory and Applications, Springer Nature, Berlin, Heidelberg, 2013, pp. 214–225.","ieee":"K. Chatterjee, S. Chaubal, and S. Rubin, “How to travel between languages,” in <i>7th International Conference on Language and Automata Theory and Applications</i>, Bilbao, Spain, 2013, vol. 7810, pp. 214–225.","ista":"Chatterjee K, Chaubal S, Rubin S. 2013. How to travel between languages. 7th International Conference on Language and Automata Theory and Applications. LATA: Conference on Language and Automata Theory and ApplicationsLNCS, LNCS, vol. 7810, 214–225.","ama":"Chatterjee K, Chaubal S, Rubin S. How to travel between languages. In: <i>7th International Conference on Language and Automata Theory and Applications</i>. Vol 7810. LNCS. Berlin, Heidelberg: Springer Nature; 2013:214-225. doi:<a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">10.1007/978-3-642-37064-9_20</a>","mla":"Chatterjee, Krishnendu, et al. “How to Travel between Languages.” <i>7th International Conference on Language and Automata Theory and Applications</i>, vol. 7810, Springer Nature, 2013, pp. 214–25, doi:<a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">10.1007/978-3-642-37064-9_20</a>.","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel between Languages.” In <i>7th International Conference on Language and Automata Theory and Applications</i>, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">https://doi.org/10.1007/978-3-642-37064-9_20</a>.","apa":"Chatterjee, K., Chaubal, S., &#38; Rubin, S. (2013). How to travel between languages. In <i>7th International Conference on Language and Automata Theory and Applications</i> (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">https://doi.org/10.1007/978-3-642-37064-9_20</a>"},"article_processing_charge":"No","ec_funded":1,"doi":"10.1007/978-3-642-37064-9_20","date_published":"2013-04-15T00:00:00Z","intvolume":"      7810","place":"Berlin, Heidelberg","volume":7810,"acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award. Thanks to Gabriele Puppis for suggesting the problem of identifying a deterministic transducer to compute the optimal cost, and to Martin Chmelik for his comments on the introduction.","publication":"7th International Conference on Language and Automata Theory and Applications","day":"15","department":[{"_id":"KrCh"}],"year":"2013","month":"04","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"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"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783642370632"],"eissn":["1611-3349"],"eisbn":["9783642370649"]},"_id":"10902","publication_status":"published","alternative_title":["LNCS"],"type":"conference","oa_version":"None","publisher":"Springer Nature","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Chaubal","full_name":"Chaubal, Siddhesh","first_name":"Siddhesh"},{"first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","last_name":"Rubin","full_name":"Rubin, Sasha"}],"status":"public","scopus_import":"1","abstract":[{"lang":"eng","text":"We consider how to edit strings from a source language so that the edited strings belong to a target language, where the languages are given as deterministic finite automata. Non-streaming (or offline) transducers perform edits given the whole source string. We show that the class of deterministic one-pass transducers with registers along with increment and min operation suffices for computing optimal edit distance, whereas the same class of transducers without the min operation is not sufficient. Streaming (or online) transducers perform edits as the letters of the source string are received. We present a polynomial time algorithm for the partial-repair problem that given a bound α asks for the construction of a deterministic streaming transducer (if one exists) that ensures that the ‘maximum fraction’ η of the strings of the source language are edited, within cost α, to the target language."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"date_updated":"2023-09-05T15:10:38Z","series_title":"LNCS"},{"ec_funded":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.3389/fpls.2013.00451","file_date_updated":"2020-07-14T12:48:11Z","intvolume":"         4","has_accepted_license":"1","date_published":"2013-11-19T00:00:00Z","volume":4,"day":"19","publication":"Frontiers in Plant Science","title":"Cytokinin cross talking during biotic and abiotic stress responses","publist_id":"6821","citation":{"mla":"O’Brien, José, and Eva Benková. “Cytokinin Cross Talking during Biotic and Abiotic Stress Responses.” <i>Frontiers in Plant Science</i>, vol. 4, 451, Frontiers Research Foundation, 2013, doi:<a href=\"https://doi.org/10.3389/fpls.2013.00451\">10.3389/fpls.2013.00451</a>.","chicago":"O’Brien, José, and Eva Benková. “Cytokinin Cross Talking during Biotic and Abiotic Stress Responses.” <i>Frontiers in Plant Science</i>. Frontiers Research Foundation, 2013. <a href=\"https://doi.org/10.3389/fpls.2013.00451\">https://doi.org/10.3389/fpls.2013.00451</a>.","apa":"O’Brien, J., &#38; Benková, E. (2013). Cytokinin cross talking during biotic and abiotic stress responses. <i>Frontiers in Plant Science</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fpls.2013.00451\">https://doi.org/10.3389/fpls.2013.00451</a>","ista":"O’Brien J, Benková E. 2013. Cytokinin cross talking during biotic and abiotic stress responses. Frontiers in Plant Science. 4, 451.","short":"J. O’Brien, E. Benková, Frontiers in Plant Science 4 (2013).","ieee":"J. O’Brien and E. Benková, “Cytokinin cross talking during biotic and abiotic stress responses,” <i>Frontiers in Plant Science</i>, vol. 4. Frontiers Research Foundation, 2013.","ama":"O’Brien J, Benková E. Cytokinin cross talking during biotic and abiotic stress responses. <i>Frontiers in Plant Science</i>. 2013;4. doi:<a href=\"https://doi.org/10.3389/fpls.2013.00451\">10.3389/fpls.2013.00451</a>"},"date_created":"2018-12-11T11:48:43Z","quality_controlled":"1","article_number":"451","oa":1,"author":[{"first_name":"José","full_name":"O'Brien, José","last_name":"O'Brien"},{"first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739"}],"status":"public","abstract":[{"text":"As sessile organisms, plants have to be able to adapt to a continuously changing environment. Plants that perceive some of these changes as stress signals activate signaling pathways to modulate their development and to enable them to survive. The complex responses to environmental cues are to a large extent mediated by plant hormones that together orchestrate the final plant response. The phytohormone cytokinin is involved in many plant developmental processes. Recently, it has been established that cytokinin plays an important role in stress responses, but does not act alone. Indeed, the hormonal control of plant development and stress adaptation is the outcome of a complex network of multiple synergistic and antagonistic interactions between various hormones. Here, we review the recent findings on the cytokinin function as part of this hormonal network. We focus on the importance of the crosstalk between cytokinin and other hormones, such as abscisic acid, jasmonate, salicylic acid, ethylene, and auxin in the modulation of plant development and stress adaptation. Finally, the impact of the current research in the biotechnological industry will be discussed.","lang":"eng"}],"scopus_import":1,"date_updated":"2021-01-12T08:17:50Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"EvBe"}],"month":"11","year":"2013","project":[{"_id":"253FCA6A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Hormonal cross-talk in plant organogenesis","grant_number":"207362"}],"oa_version":"Published Version","file":[{"checksum":"fdc25ddd1bf9a99b99f662cdbafeddd4","file_size":953299,"date_created":"2019-01-31T10:40:38Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:48:11Z","creator":"dernst","file_id":"5903","relation":"main_file","file_name":"2013_FrontiersPlant_OBrien.pdf"}],"type":"journal_article","ddc":["580"],"_id":"827","publication_status":"published","publisher":"Frontiers Research Foundation"},{"publist_id":"6820","title":"Systems approaches to study root architecture dynamics","article_number":"537","oa":1,"citation":{"ama":"Cuesta C, Wabnik KT, Benková E. Systems approaches to study root architecture dynamics. <i>Frontiers in Plant Science</i>. 2013;4. doi:<a href=\"https://doi.org/10.3389/fpls.2013.00537\">10.3389/fpls.2013.00537</a>","ieee":"C. Cuesta, K. T. Wabnik, and E. Benková, “Systems approaches to study root architecture dynamics,” <i>Frontiers in Plant Science</i>, vol. 4. Frontiers Research Foundation, 2013.","ista":"Cuesta C, Wabnik KT, Benková E. 2013. Systems approaches to study root architecture dynamics. Frontiers in Plant Science. 4, 537.","short":"C. Cuesta, K.T. Wabnik, E. Benková, Frontiers in Plant Science 4 (2013).","mla":"Cuesta, Candela, et al. “Systems Approaches to Study Root Architecture Dynamics.” <i>Frontiers in Plant Science</i>, vol. 4, 537, Frontiers Research Foundation, 2013, doi:<a href=\"https://doi.org/10.3389/fpls.2013.00537\">10.3389/fpls.2013.00537</a>.","apa":"Cuesta, C., Wabnik, K. T., &#38; Benková, E. (2013). Systems approaches to study root architecture dynamics. <i>Frontiers in Plant Science</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fpls.2013.00537\">https://doi.org/10.3389/fpls.2013.00537</a>","chicago":"Cuesta, Candela, Krzysztof T Wabnik, and Eva Benková. “Systems Approaches to Study Root Architecture Dynamics.” <i>Frontiers in Plant Science</i>. Frontiers Research Foundation, 2013. <a href=\"https://doi.org/10.3389/fpls.2013.00537\">https://doi.org/10.3389/fpls.2013.00537</a>."},"date_created":"2018-12-11T11:48:43Z","quality_controlled":"1","doi":"10.3389/fpls.2013.00537","file_date_updated":"2020-07-14T12:48:11Z","ec_funded":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":4,"publication":"Frontiers in Plant Science","day":"26","intvolume":"         4","has_accepted_license":"1","date_published":"2013-12-26T00:00:00Z","year":"2013","month":"12","project":[{"call_identifier":"FP7","name":"Hormonal cross-talk in plant organogenesis","_id":"253FCA6A-B435-11E9-9278-68D0E5697425","grant_number":"207362"}],"department":[{"_id":"EvBe"}],"publisher":"Frontiers Research Foundation","file":[{"date_updated":"2020-07-14T12:48:11Z","access_level":"open_access","content_type":"application/pdf","date_created":"2019-01-31T10:36:43Z","file_size":710835,"checksum":"0185b3c4d7df9a94bd3ce5a66d213506","file_name":"2013_FrontiersPlant_Cuesta.pdf","relation":"main_file","file_id":"5902","creator":"dernst"}],"type":"journal_article","ddc":["580"],"oa_version":"Published Version","_id":"828","publication_status":"published","author":[{"orcid":"0000-0003-1923-2410","full_name":"Cuesta, Candela","last_name":"Cuesta","id":"33A3C818-F248-11E8-B48F-1D18A9856A87","first_name":"Candela"},{"id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof T","full_name":"Wabnik, Krzysztof T","last_name":"Wabnik","orcid":"0000-0001-7263-0560"},{"full_name":"Benková, Eva","last_name":"Benková","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva"}],"status":"public","date_updated":"2021-01-12T08:17:52Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"The plant root system is essential for providing anchorage to the soil, supplying minerals and water, and synthesizing metabolites. It is a dynamic organ modulated by external cues such as environmental signals, water and nutrients availability, salinity and others. Lateral roots (LRs) are initiated from the primary root post-embryonically, after which they progress through discrete developmental stages which can be independently controlled, providing a high level of plasticity during root system formation. Within this review, main contributions are presented, from the classical forward genetic screens to the more recent high-throughput approaches, combined with computer model predictions, dissecting how LRs and thereby root system architecture is established and developed."}],"scopus_import":1},{"oa":1,"arxiv":1,"quality_controlled":"1","conference":{"start_date":"2013-07-13","name":"CAV: Computer Aided Verification","location":"St. Petersburg, Russia","end_date":"2013-07-19"},"date_created":"2018-12-11T11:55:08Z","citation":{"short":"J. Reiter, I. Božić, K. Chatterjee, M. Nowak, in:, Proceedings of 25th Int. Conf. on Computer Aided Verification, Springer, 2013, pp. 101–106.","ista":"Reiter J, Božić I, Chatterjee K, Nowak M. 2013. TTP: Tool for tumor progression. Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided VerificationLecture Notes in Computer Science, LNCS, vol. 8044, 101–106.","ieee":"J. Reiter, I. Božić, K. Chatterjee, and M. Nowak, “TTP: Tool for tumor progression,” in <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i>, St. Petersburg, Russia, 2013, vol. 8044, pp. 101–106.","ama":"Reiter J, Božić I, Chatterjee K, Nowak M. TTP: Tool for tumor progression. In: <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i>. Vol 8044. Lecture Notes in Computer Science. Springer; 2013:101-106. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_6\">10.1007/978-3-642-39799-8_6</a>","chicago":"Reiter, Johannes, Ivana Božić, Krishnendu Chatterjee, and Martin Nowak. “TTP: Tool for Tumor Progression.” In <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i>, 8044:101–6. Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_6\">https://doi.org/10.1007/978-3-642-39799-8_6</a>.","apa":"Reiter, J., Božić, I., Chatterjee, K., &#38; Nowak, M. (2013). TTP: Tool for tumor progression. In <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i> (Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_6\">https://doi.org/10.1007/978-3-642-39799-8_6</a>","mla":"Reiter, Johannes, et al. “TTP: Tool for Tumor Progression.” <i>Proceedings of 25th Int. Conf. on Computer Aided Verification</i>, vol. 8044, Springer, 2013, pp. 101–06, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_6\">10.1007/978-3-642-39799-8_6</a>."},"publist_id":"5077","page":"101 - 106","title":"TTP: Tool for tumor progression","publication":"Proceedings of 25th Int. Conf. on Computer Aided Verification","day":"01","volume":8044,"date_published":"2013-01-01T00:00:00Z","intvolume":"      8044","doi":"10.1007/978-3-642-39799-8_6","ec_funded":1,"publisher":"Springer","alternative_title":["LNCS"],"publication_status":"published","external_id":{"arxiv":["1303.5251"]},"_id":"2000","oa_version":"Preprint","type":"conference","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"year":"2013","month":"01","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","series_title":"Lecture Notes in Computer Science","date_updated":"2023-09-07T11:40:43Z","scopus_import":1,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5399"},{"id":"1400","relation":"dissertation_contains","status":"public"}]},"main_file_link":[{"url":"https://arxiv.org/abs/1303.5251","open_access":"1"}],"abstract":[{"lang":"eng","text":"In this work we present a flexible tool for tumor progression, which simulates the evolutionary dynamics of cancer. Tumor progression implements a multi-type branching process where the key parameters are the fitness landscape, the mutation rate, and the average time of cell division. The fitness of a cancer cell depends on the mutations it has accumulated. The input to our tool could be any fitness landscape, mutation rate, and cell division time, and the tool produces the growth dynamics and all relevant statistics."}],"status":"public","author":[{"last_name":"Reiter","full_name":"Reiter, Johannes","orcid":"0000-0002-0170-7353","first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ivana","full_name":"Božić, Ivana","last_name":"Božić"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}]},{"status":"public","author":[{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","orcid":"0000-0002-7008-0216","last_name":"Uhler","full_name":"Uhler, Caroline"},{"full_name":"Slavkovic, Aleksandra","last_name":"Slavkovic","first_name":"Aleksandra"},{"first_name":"Stephen","last_name":"Fienberg","full_name":"Fienberg, Stephen"}],"article_processing_charge":"No","doi":"10.29012/jpc.v5i1.629","date_published":"2013-08-01T00:00:00Z","intvolume":"         5","main_file_link":[{"open_access":"1","url":"http://repository.cmu.edu/jpc/vol5/iss1/6"}],"abstract":[{"text":"Traditional statistical methods for confidentiality protection of statistical databases do not scale well to deal with GWAS databases especially in terms of guarantees regarding protection from linkage to external information. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach which provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information, although the guarantees may come at a serious price in terms of data utility. Building on such notions, we propose new methods to release aggregate GWAS data without compromising an individual’s privacy. We present methods for releasing differentially private minor allele frequencies, chi-square statistics and p-values. We compare these approaches on simulated data and on a GWAS study of canine hair length involving 685 dogs. We also propose a privacy-preserving method for finding genome-wide associations based on a differentially-private approach to penalized logistic regression.","lang":"eng"}],"language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication":"Journal of Privacy and Confidentiality ","day":"01","date_updated":"2021-01-12T06:54:41Z","volume":5,"department":[{"_id":"CaUh"}],"title":"Privacy-preserving data sharing for genome-wide association studies","page":"137 - 166","publist_id":"5067","month":"08","year":"2013","publication_status":"published","quality_controlled":"1","issue":"1","_id":"2009","oa_version":"Published Version","type":"journal_article","citation":{"ieee":"C. Uhler, A. Slavkovic, and S. Fienberg, “Privacy-preserving data sharing for genome-wide association studies,” <i>Journal of Privacy and Confidentiality </i>, vol. 5, no. 1. Carnegie Mellon University, pp. 137–166, 2013.","short":"C. Uhler, A. Slavkovic, S. Fienberg, Journal of Privacy and Confidentiality  5 (2013) 137–166.","ista":"Uhler C, Slavkovic A, Fienberg S. 2013. Privacy-preserving data sharing for genome-wide association studies. Journal of Privacy and Confidentiality . 5(1), 137–166.","ama":"Uhler C, Slavkovic A, Fienberg S. Privacy-preserving data sharing for genome-wide association studies. <i>Journal of Privacy and Confidentiality </i>. 2013;5(1):137-166. doi:<a href=\"https://doi.org/10.29012/jpc.v5i1.629\">10.29012/jpc.v5i1.629</a>","chicago":"Uhler, Caroline, Aleksandra Slavkovic, and Stephen Fienberg. “Privacy-Preserving Data Sharing for Genome-Wide Association Studies.” <i>Journal of Privacy and Confidentiality </i>. Carnegie Mellon University, 2013. <a href=\"https://doi.org/10.29012/jpc.v5i1.629\">https://doi.org/10.29012/jpc.v5i1.629</a>.","apa":"Uhler, C., Slavkovic, A., &#38; Fienberg, S. (2013). Privacy-preserving data sharing for genome-wide association studies. <i>Journal of Privacy and Confidentiality </i>. Carnegie Mellon University. <a href=\"https://doi.org/10.29012/jpc.v5i1.629\">https://doi.org/10.29012/jpc.v5i1.629</a>","mla":"Uhler, Caroline, et al. “Privacy-Preserving Data Sharing for Genome-Wide Association Studies.” <i>Journal of Privacy and Confidentiality </i>, vol. 5, no. 1, Carnegie Mellon University, 2013, pp. 137–66, doi:<a href=\"https://doi.org/10.29012/jpc.v5i1.629\">10.29012/jpc.v5i1.629</a>."},"date_created":"2018-12-11T11:55:11Z","oa":1,"publisher":"Carnegie Mellon University"},{"department":[{"_id":"CaUh"}],"year":"2013","month":"04","type":"journal_article","oa_version":"Published Version","external_id":{"arxiv":["1207.0547"]},"publication_status":"published","issue":"2","_id":"2010","publisher":"Institute of Mathematical Statistics","status":"public","author":[{"first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline","last_name":"Uhler","orcid":"0000-0002-7008-0216"},{"full_name":"Raskutti, Garvesh","last_name":"Raskutti","first_name":"Garvesh"},{"first_name":"Peter","full_name":"Bühlmann, Peter","last_name":"Bühlmann"},{"first_name":"Bin","full_name":"Yu, Bin","last_name":"Yu"}],"main_file_link":[{"url":"www.doi.org/10.1214/12-AOS1080","open_access":"1"}],"abstract":[{"text":"Many algorithms for inferring causality rely heavily on the faithfulness assumption. The main justification for imposing this assumption is that the set of unfaithful distributions has Lebesgue measure zero, since it can be seen as a collection of hypersurfaces in a hypercube. However, due to sampling error the faithfulness condition alone is not sufficient for statistical estimation, and strong-faithfulness has been proposed and assumed to achieve uniform or high-dimensional consistency. In contrast to the plain faithfulness assumption, the set of distributions that is not strong-faithful has nonzero Lebesgue measure and in fact, can be surprisingly large as we show in this paper. We study the strong-faithfulness condition from a geometric and combinatorial point of view and give upper and lower bounds on the Lebesgue measure of strong-faithful distributions for various classes of directed acyclic graphs. Our results imply fundamental limitations for the PC-algorithm and potentially also for other algorithms based on partial correlation testing in the Gaussian case.","lang":"eng"}],"scopus_import":1,"date_updated":"2021-01-12T06:54:42Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Geometry of the faithfulness assumption in causal inference","page":"436 - 463","publist_id":"5066","citation":{"chicago":"Uhler, Caroline, Garvesh Raskutti, Peter Bühlmann, and Bin Yu. “Geometry of the Faithfulness Assumption in Causal Inference.” <i>The Annals of Statistics</i>. Institute of Mathematical Statistics, 2013. <a href=\"https://doi.org/10.1214/12-AOS1080\">https://doi.org/10.1214/12-AOS1080</a>.","apa":"Uhler, C., Raskutti, G., Bühlmann, P., &#38; Yu, B. (2013). Geometry of the faithfulness assumption in causal inference. <i>The Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/12-AOS1080\">https://doi.org/10.1214/12-AOS1080</a>","mla":"Uhler, Caroline, et al. “Geometry of the Faithfulness Assumption in Causal Inference.” <i>The Annals of Statistics</i>, vol. 41, no. 2, Institute of Mathematical Statistics, 2013, pp. 436–63, doi:<a href=\"https://doi.org/10.1214/12-AOS1080\">10.1214/12-AOS1080</a>.","short":"C. Uhler, G. Raskutti, P. Bühlmann, B. Yu, The Annals of Statistics 41 (2013) 436–463.","ieee":"C. Uhler, G. Raskutti, P. Bühlmann, and B. Yu, “Geometry of the faithfulness assumption in causal inference,” <i>The Annals of Statistics</i>, vol. 41, no. 2. Institute of Mathematical Statistics, pp. 436–463, 2013.","ista":"Uhler C, Raskutti G, Bühlmann P, Yu B. 2013. Geometry of the faithfulness assumption in causal inference. The Annals of Statistics. 41(2), 436–463.","ama":"Uhler C, Raskutti G, Bühlmann P, Yu B. Geometry of the faithfulness assumption in causal inference. <i>The Annals of Statistics</i>. 2013;41(2):436-463. doi:<a href=\"https://doi.org/10.1214/12-AOS1080\">10.1214/12-AOS1080</a>"},"date_created":"2018-12-11T11:55:11Z","quality_controlled":"1","arxiv":1,"oa":1,"doi":"10.1214/12-AOS1080","intvolume":"        41","date_published":"2013-04-01T00:00:00Z","day":"01","publication":"The Annals of Statistics","volume":41},{"scopus_import":1,"abstract":[{"lang":"eng","text":"There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be achieved at the expense of relaxing correctness, by redefining the semantics of data structures. We address such a redefinition of data structure semantics and present a systematic and formal framework for obtaining new data structures by quantitatively relaxing existing ones. We view a data structure as a sequential specification S containing all &quot;legal&quot; sequences over an alphabet of method calls. Relaxing the data structure corresponds to defining a distance from any sequence over the alphabet to the sequential specification: the k-relaxed sequential specification contains all sequences over the alphabet within distance k from the original specification. In contrast to other existing work, our relaxations are semantic (distance in terms of data structure states). As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances. We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic relaxation (distance in terms of sequence manipulation, e.g. edit distance). We give concurrent implementations of relaxed data structures and demonstrate that bounded relaxations provide the means for trading correctness for performance in a controlled way. The relaxations are monotonic which further highlights the trade-off: increasing k increases the number of permitted sequences, which as we demonstrate can lead to better performance. Finally, since a relaxed stack or queue also implements a pool, we actually have new concurrent pool implementations that outperform the state-of-the-art ones."}],"related_material":{"record":[{"id":"10901","status":"deleted","relation":"later_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2023-02-21T16:06:49Z","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Christoph","last_name":"Kirsch","full_name":"Kirsch, Christoph"},{"first_name":"Hannes","full_name":"Payer, Hannes","last_name":"Payer"},{"id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali","last_name":"Sezgin","full_name":"Sezgin, Ali"},{"first_name":"Ana","full_name":"Sokolova, Ana","last_name":"Sokolova"}],"status":"public","_id":"2181","publication_status":"published","oa_version":"Submitted Version","ddc":["000","004"],"type":"conference","file":[{"date_created":"2018-12-12T10:14:33Z","checksum":"adf465e70948f4e80e48057524516456","file_size":294689,"date_updated":"2020-07-14T12:45:31Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"5086","creator":"system","file_name":"IST-2014-198-v1+1_popl128-henzinger-clean.pdf"}],"pubrep_id":"198","publisher":"ACM","department":[{"_id":"ToHe"}],"month":"01","year":"2013","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"isbn":["978-1-4503-1832-7"]},"date_published":"2013-01-01T00:00:00Z","has_accepted_license":"1","acknowledgement":" and an Elise Richter Fellowship (Austrian Science Fund V00125). ","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","day":"01","ec_funded":1,"file_date_updated":"2020-07-14T12:45:31Z","doi":"10.1145/2429069.2429109","conference":{"name":"POPL: Principles of Programming Languages","start_date":"2013-01-23","location":"Rome, Italy","end_date":"2013-01-25"},"quality_controlled":"1","citation":{"apa":"Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., &#38; Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 317–328). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>","chicago":"Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 317–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>.","mla":"Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 317–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>.","ama":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:317-328. doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>","ieee":"T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 317–328.","short":"T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328.","ista":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328."},"date_created":"2018-12-11T11:56:11Z","oa":1,"title":"Quantitative relaxation of concurrent data structures","page":"317 - 328","publist_id":"4801"},{"publisher":"ACM","conference":{"location":"Rome, Italy","end_date":"2013-01-25","start_date":"2013-07-23","name":"POPL: Principles of Programming Languages"},"_id":"2182","publication_status":"published","quality_controlled":"1","citation":{"mla":"Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 115–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2013). Quantitative abstraction refinement. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 115–128). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 115–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:115-128. doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 115–128."},"date_created":"2018-12-11T11:56:11Z","oa_version":"None","type":"conference","year":"2013","month":"01","page":"115 - 128","publist_id":"4800","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"}],"title":"Quantitative abstraction refinement","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:55:50Z","day":"01","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","date_published":"2013-01-01T00:00:00Z","scopus_import":1,"abstract":[{"text":"We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time. We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed.","lang":"eng"}],"doi":"10.1145/2429069.2429085","ec_funded":1,"author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna"}],"status":"public"},{"scopus_import":1,"date_published":"2013-12-01T00:00:00Z","abstract":[{"text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon or planar straight-line graph. In this paper, we ask the reverse question: Given the straight skeleton (in form of a planar straight-line graph, with some rays to infinity), can we reconstruct a planar straight-line graph for which this was the straight skeleton? We show how to reduce this problem to the problem of finding a line that intersects a set of convex polygons. We can find these convex polygons and all such lines in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number of edges of the input graph. We also explain how our approach can be used for recognizing Voronoi diagrams of points, thereby completing a partial solution provided by Ash and Bolker in 1985.\r\n","lang":"eng"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","date_updated":"2021-01-12T06:56:00Z","status":"public","author":[{"first_name":"Therese","full_name":"Biedl, Therese","last_name":"Biedl"},{"last_name":"Held","full_name":"Held, Martin","first_name":"Martin"},{"orcid":"0000-0002-8871-5814","last_name":"Huber","full_name":"Huber, Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan"}],"doi":"10.1109/ISVD.2013.11","quality_controlled":"1","alternative_title":["2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) "],"publication_status":"published","conference":{"end_date":"2013-07-10","location":"St. Petersburg, Russia","start_date":"2013-07-08","name":"ISVD: Voronoi Diagrams in Science and Engineering"},"_id":"2209","type":"conference","oa_version":"None","citation":{"ista":"Biedl T, Held M, Huber S. 2013. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. ISVD: Voronoi Diagrams in Science and Engineering, 2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) , , 37–46.","ieee":"T. Biedl, M. Held, and S. Huber, “Recognizing straight skeletons and Voronoi diagrams and reconstructing their input,” presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia, 2013, pp. 37–46.","short":"T. Biedl, M. Held, S. Huber, in:, IEEE, 2013, pp. 37–46.","ama":"Biedl T, Held M, Huber S. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. In: IEEE; 2013:37-46. doi:<a href=\"https://doi.org/10.1109/ISVD.2013.11\">10.1109/ISVD.2013.11</a>","chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input,” 37–46. IEEE, 2013. <a href=\"https://doi.org/10.1109/ISVD.2013.11\">https://doi.org/10.1109/ISVD.2013.11</a>.","apa":"Biedl, T., Held, M., &#38; Huber, S. (2013). Recognizing straight skeletons and Voronoi diagrams and reconstructing their input (pp. 37–46). Presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia: IEEE. <a href=\"https://doi.org/10.1109/ISVD.2013.11\">https://doi.org/10.1109/ISVD.2013.11</a>","mla":"Biedl, Therese, et al. <i>Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input</i>. IEEE, 2013, pp. 37–46, doi:<a href=\"https://doi.org/10.1109/ISVD.2013.11\">10.1109/ISVD.2013.11</a>."},"date_created":"2018-12-11T11:56:20Z","publisher":"IEEE","department":[{"_id":"HeEd"}],"title":"Recognizing straight skeletons and Voronoi diagrams and reconstructing their input","page":"37 - 46","publist_id":"4763","month":"12","year":"2013","publication_identifier":{"eisbn":["978-0-7695-5037-4 "]}},{"author":[{"first_name":"Therese","full_name":"Biedl, Therese","last_name":"Biedl"},{"first_name":"Martin","full_name":"Held, Martin","last_name":"Held"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","last_name":"Huber","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814"}],"status":"public","abstract":[{"lang":"eng","text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon. In this paper, we ask the reverse question: Given the straight skeleton (in form of a tree with a drawing in the plane, but with the exact position of the leaves unspecified), can we reconstruct the polygon? We show that in most cases there exists at most one polygon; in the remaining case there is an infinite number of polygons determined by one angle that can range in an interval. We can find this (set of) polygon(s) in linear time in the Real RAM computer model."}],"main_file_link":[{"open_access":"1","url":"http://www.ibr.cs.tu-bs.de/alg/eurocg13/booklet_eurocg13.pdf"}],"date_published":"2013-03-01T00:00:00Z","date_updated":"2021-01-12T06:56:00Z","day":"01","publication":"29th European Workshop on Computational Geometry","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Reconstructing polygons from embedded straight skeletons","department":[{"_id":"HeEd"}],"year":"2013","month":"03","publist_id":"4762","page":"95 - 98","citation":{"chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Reconstructing Polygons from Embedded Straight Skeletons.” In <i>29th European Workshop on Computational Geometry</i>, 95–98. TU Braunschweig, 2013.","apa":"Biedl, T., Held, M., &#38; Huber, S. (2013). Reconstructing polygons from embedded straight skeletons. In <i>29th European Workshop on Computational Geometry</i> (pp. 95–98). Braunschweig, Germany: TU Braunschweig.","mla":"Biedl, Therese, et al. “Reconstructing Polygons from Embedded Straight Skeletons.” <i>29th European Workshop on Computational Geometry</i>, TU Braunschweig, 2013, pp. 95–98.","ieee":"T. Biedl, M. Held, and S. Huber, “Reconstructing polygons from embedded straight skeletons,” in <i>29th European Workshop on Computational Geometry</i>, Braunschweig, Germany, 2013, pp. 95–98.","ista":"Biedl T, Held M, Huber S. 2013. Reconstructing polygons from embedded straight skeletons. 29th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 95–98.","short":"T. Biedl, M. Held, S. Huber, in:, 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98.","ama":"Biedl T, Held M, Huber S. Reconstructing polygons from embedded straight skeletons. In: <i>29th European Workshop on Computational Geometry</i>. TU Braunschweig; 2013:95-98."},"date_created":"2018-12-11T11:56:21Z","oa_version":"Submitted Version","type":"conference","_id":"2210","conference":{"name":"EuroCG: European Workshop on Computational Geometry","start_date":"2013-03-17","end_date":"2013-03-20","location":"Braunschweig, Germany"},"publication_status":"published","publisher":"TU Braunschweig","oa":1},{"publication_status":"published","alternative_title":["LNCS"],"_id":"2237","oa_version":"Submitted Version","file":[{"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:34Z","checksum":"9cebaafca032e6769d273f393305c705","file_size":279206,"date_created":"2020-05-15T11:10:40Z","file_name":"2013_LPAR_Blanc.pdf","file_id":"7858","creator":"dernst","relation":"main_file"}],"type":"conference","ddc":["000"],"publisher":"Springer","department":[{"_id":"ToHe"}],"project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"year":"2013","month":"01","scopus_import":1,"abstract":[{"lang":"eng","text":"We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation."}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2020-08-11T10:09:42Z","series_title":"Lecture Notes in Computer Science","status":"public","author":[{"first_name":"Régis","full_name":"Blanc, Régis","last_name":"Blanc"},{"last_name":"Gupta","full_name":"Gupta, Ashutosh","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kovács","full_name":"Kovács, Laura","first_name":"Laura"},{"first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117","last_name":"Kragl","full_name":"Kragl, Bernhard"}],"quality_controlled":"1","conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","start_date":"2013-12-14","location":"Stellenbosch, South Africa","end_date":"2013-12-19"},"citation":{"short":"R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.","ista":"Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire. 8312, 173–181.","ieee":"R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,” vol. 8312. Springer, pp. 173–181, 2013.","ama":"Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">10.1007/978-3-642-45221-5_13</a>","chicago":"Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">https://doi.org/10.1007/978-3-642-45221-5_13</a>.","apa":"Blanc, R., Gupta, A., Kovács, L., &#38; Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">https://doi.org/10.1007/978-3-642-45221-5_13</a>","mla":"Blanc, Régis, et al. <i>Tree Interpolation in Vampire</i>. Vol. 8312, Springer, 2013, pp. 173–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">10.1007/978-3-642-45221-5_13</a>."},"date_created":"2018-12-11T11:56:29Z","oa":1,"title":"Tree interpolation in Vampire","page":"173 - 181","publist_id":"4724","date_published":"2013-01-14T00:00:00Z","intvolume":"      8312","has_accepted_license":"1","day":"14","volume":8312,"article_processing_charge":"No","file_date_updated":"2020-07-14T12:45:34Z","doi":"10.1007/978-3-642-45221-5_13"},{"intvolume":"      8312","date_published":"2013-12-01T00:00:00Z","day":"01","volume":8312,"ec_funded":1,"doi":"10.1007/978-3-642-45221-5_17","citation":{"chicago":"Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">https://doi.org/10.1007/978-3-642-45221-5_17</a>.","apa":"Chatterjee, K., Forejt, V., &#38; Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">https://doi.org/10.1007/978-3-642-45221-5_17</a>","mla":"Chatterjee, Krishnendu, et al. <i>Multi-Objective Discounted Reward Verification in Graphs and MDPs</i>. Vol. 8312, Springer, 2013, pp. 228–42, doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">10.1007/978-3-642-45221-5_17</a>.","ieee":"K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.","short":"K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.","ista":"Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.","ama":"Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification in graphs and MDPs. 2013;8312:228-242. doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">10.1007/978-3-642-45221-5_17</a>"},"date_created":"2018-12-11T11:56:30Z","quality_controlled":"1","conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","start_date":"2013-12-14","location":"Stellenbosch, South Africa","end_date":"2013-12-19"},"title":"Multi-objective discounted reward verification in graphs and MDPs","publist_id":"4723","page":"228 - 242","abstract":[{"text":"We study the problem of achieving a given value in Markov decision processes (MDPs) with several independent discounted reward objectives. We consider a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at different and variable rates.\r\n\r\nWe establish results for two prominent subclasses of the problem, namely state-discount models where the discount factors are only dependent on the state of the MDP (and independent of the objective), and reward-discount models where they are only dependent on the objective (but not on the state of the MDP). For the state-discount models we use a straightforward reduction to expected total reward and show that the problem whether a value is achievable can be solved in polynomial time. For the reward-discount model we show that memory and randomisation of the strategies are required, but nevertheless that the problem is decidable and it is sufficient to consider strategies which after a certain number of steps behave in a memoryless way.\r\n\r\nFor the general case, we show that when restricted to graphs (i.e. MDPs with no randomisation), pure strategies and discount factors of the form 1/n where n is an integer, the problem is in PSPACE and finite memory suffices for achieving a given value. We also show that when the discount factors are not of the form 1/n, the memory required by a strategy can be infinite.\r\n","lang":"eng"}],"scopus_import":1,"series_title":"Lecture Notes in Computer Science","date_updated":"2020-08-11T10:09:42Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Forejt, Vojtěch","last_name":"Forejt","first_name":"Vojtěch"},{"full_name":"Wojtczak, Dominik","last_name":"Wojtczak","first_name":"Dominik"}],"oa_version":"None","type":"conference","alternative_title":["LNCS"],"publication_status":"published","_id":"2238","publisher":"Springer","department":[{"_id":"KrCh"}],"project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"year":"2013","month":"12"},{"abstract":[{"text":"We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME.","lang":"eng"}],"scopus_import":1,"date_updated":"2020-08-11T10:09:42Z","series_title":"Leibniz International Proceedings in Informatics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"author":[{"first_name":"Jakub","full_name":"Michaliszyn, Jakub","last_name":"Michaliszyn"},{"last_name":"Otop","full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"status":"public","ddc":["000","004"],"type":"conference","oa_version":"Published Version","file":[{"file_name":"IST-2016-136-v1+2_39.pdf","file_id":"4929","creator":"system","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:34Z","checksum":"e0732e73a8b1e39483df7717d53e3e35","file_size":454915,"date_created":"2018-12-12T10:12:11Z"}],"_id":"2243","publication_status":"published","alternative_title":["LIPIcs"],"pubrep_id":"136","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"month":"09","year":"2013","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"intvolume":"        23","has_accepted_license":"1","date_published":"2013-09-01T00:00:00Z","volume":23,"day":"01","ec_funded":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPIcs.CSL.2013.563","file_date_updated":"2020-07-14T12:45:34Z","citation":{"ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.","short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577.","ieee":"J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.","ama":"Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>","chicago":"Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>.","apa":"Michaliszyn, J., &#38; Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>","mla":"Michaliszyn, Jakub, and Jan Otop. <i>Elementary Modal Logics over Transitive Structures</i>. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>."},"date_created":"2018-12-11T11:56:32Z","conference":{"location":"Torino, Italy","end_date":"2013-09-05","name":"CSL: Computer Science Logic","start_date":"2013-09-02"},"quality_controlled":"1","oa":1,"title":"Elementary modal logics over transitive structures","page":"563 - 577","publist_id":"4708"},{"oa":1,"date_created":"2018-12-11T11:56:32Z","citation":{"mla":"Matoušek, Jiří, et al. <i>Untangling Two Systems of Noncrossing Curves</i>. Vol. 8242, Springer, 2013, pp. 472–83, doi:<a href=\"https://doi.org/10.1007/978-3-319-03841-4_41\">10.1007/978-3-319-03841-4_41</a>.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2013). Untangling two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network Visualization, Bordeaux, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-03841-4_41\">https://doi.org/10.1007/978-3-319-03841-4_41</a>","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-319-03841-4_41\">https://doi.org/10.1007/978-3-319-03841-4_41</a>.","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing curves. 2013;8242:472-483. doi:<a href=\"https://doi.org/10.1007/978-3-319-03841-4_41\">10.1007/978-3-319-03841-4_41</a>","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” vol. 8242. Springer, pp. 472–483, 2013.","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of noncrossing curves. 8242, 472–483.","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, 8242 (2013) 472–483."},"quality_controlled":"1","arxiv":1,"conference":{"name":"GD: Graph Drawing and Network Visualization","start_date":"2013-09-23","location":"Bordeaux, France","end_date":"2013-09-25"},"publist_id":"4707","page":"472 - 483","title":"Untangling two systems of noncrossing curves","day":"01","acknowledgement":"We would like to thank the authors of [GHR13] for mak- ing a draft of their paper available to us, and, in particular, T. Huynh for an e-mail correspondence.","volume":8242,"intvolume":"      8242","date_published":"2013-09-01T00:00:00Z","doi":"10.1007/978-3-319-03841-4_41","publisher":"Springer","type":"conference","oa_version":"Preprint","alternative_title":["LNCS"],"publication_status":"published","external_id":{"arxiv":["1302.6475"]},"_id":"2244","project":[{"grant_number":"PP00P2_138948","_id":"25FA3206-B435-11E9-9278-68D0E5697425","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics"}],"year":"2013","month":"09","department":[{"_id":"UlWa"}],"date_updated":"2023-02-21T17:03:07Z","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1302.6475"}],"related_material":{"record":[{"id":"1411","status":"public","relation":"later_version"}]},"abstract":[{"text":"We consider two systems (α1,...,αm) and (β1,...,βn) of curves drawn on a compact two-dimensional surface ℳ with boundary. Each αi and each βj is either an arc meeting the boundary of ℳ at its two endpoints, or a closed curve. The αi are pairwise disjoint except for possibly sharing endpoints, and similarly for the βj. We want to &quot;untangle&quot; the βj from the αi by a self-homeomorphism of ℳ; more precisely, we seek an homeomorphism φ: ℳ → ℳ fixing the boundary of ℳ pointwise such that the total number of crossings of the αi with the φ(βj) is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if ℳ is planar, i.e., a sphere with h ≥ 0 boundary components (&quot;holes&quot;), then O(mn) crossings can be achieved (independently of h), which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary (orientable or nonorientable) surface ℳ with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an O((m + n)4) upper bound, again independent of h and g. ","lang":"eng"}],"scopus_import":1,"status":"public","author":[{"last_name":"Matoušek","full_name":"Matoušek, Jiří","first_name":"Jiří"},{"last_name":"Sedgwick","full_name":"Sedgwick, Eric","first_name":"Eric"},{"last_name":"Tancer","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","full_name":"Wagner, Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568"}]},{"status":"public","author":[{"last_name":"Zagorsky","full_name":"Zagorsky, Benjamin","first_name":"Benjamin"},{"first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","full_name":"Reiter, Johannes","last_name":"Reiter","orcid":"0000-0002-0170-7353"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-07T11:40:43Z","scopus_import":1,"related_material":{"record":[{"id":"9749","relation":"research_data","status":"public"},{"status":"public","relation":"dissertation_contains","id":"1400"}]},"abstract":[{"text":"Cooperative behavior, where one individual incurs a cost to help another, is a wide spread phenomenon. Here we study direct reciprocity in the context of the alternating Prisoner's Dilemma. We consider all strategies that can be implemented by one and two-state automata. We calculate the payoff matrix of all pairwise encounters in the presence of noise. We explore deterministic selection dynamics with and without mutation. Using different error rates and payoff values, we observe convergence to a small number of distinct equilibria. Two of them are uncooperative strict Nash equilibria representing always-defect (ALLD) and Grim. The third equilibrium is mixed and represents a cooperative alliance of several strategies, dominated by a strategy which we call Forgiver. Forgiver cooperates whenever the opponent has cooperated; it defects once when the opponent has defected, but subsequently Forgiver attempts to re-establish cooperation even if the opponent has defected again. Forgiver is not an evolutionarily stable strategy, but the alliance, which it rules, is asymptotically stable. For a wide range of parameter values the most commonly observed outcome is convergence to the mixed equilibrium, dominated by Forgiver. Our results show that although forgiving might incur a short-term loss it can lead to a long-term gain. Forgiveness facilitates stable cooperation in the presence of exploitation and noise.","lang":"eng"}],"project":[{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"month":"12","year":"2013","department":[{"_id":"KrCh"}],"publisher":"Public Library of Science","pubrep_id":"409","publication_status":"published","_id":"2247","issue":"12","type":"journal_article","file":[{"date_created":"2018-12-12T10:11:15Z","checksum":"808e8b9e6e89658bee4ffbbfac1bd19d","file_size":1050042,"date_updated":"2020-07-14T12:45:34Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"4868","creator":"system","file_name":"IST-2016-409-v1+1_journal.pone.0080814.pdf"}],"ddc":["000"],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:45:34Z","doi":"10.1371/journal.pone.0080814","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ec_funded":1,"publication":"PLoS One","day":"12","volume":8,"date_published":"2013-12-12T00:00:00Z","has_accepted_license":"1","intvolume":"         8","publist_id":"4702","title":"Forgiver triumphs in alternating prisoner's dilemma ","oa":1,"article_number":"e80814","quality_controlled":"1","citation":{"ama":"Zagorsky B, Reiter J, Chatterjee K, Nowak M. Forgiver triumphs in alternating prisoner’s dilemma . <i>PLoS One</i>. 2013;8(12). doi:<a href=\"https://doi.org/10.1371/journal.pone.0080814\">10.1371/journal.pone.0080814</a>","ieee":"B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in alternating prisoner’s dilemma ,” <i>PLoS One</i>, vol. 8, no. 12. Public Library of Science, 2013.","ista":"Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating prisoner’s dilemma . PLoS One. 8(12), e80814.","short":"B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, PLoS One 8 (2013).","mla":"Zagorsky, Benjamin, et al. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” <i>PLoS One</i>, vol. 8, no. 12, e80814, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pone.0080814\">10.1371/journal.pone.0080814</a>.","apa":"Zagorsky, B., Reiter, J., Chatterjee, K., &#38; Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0080814\">https://doi.org/10.1371/journal.pone.0080814</a>","chicago":"Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” <i>PLoS One</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pone.0080814\">https://doi.org/10.1371/journal.pone.0080814</a>."},"date_created":"2018-12-11T11:56:33Z"},{"file":[{"date_updated":"2020-07-14T12:45:35Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:09:20Z","file_size":493175,"checksum":"18a3f602cb41de184dc0e16a0e907633","file_name":"IST-2016-685-v1+1_658.pdf","relation":"main_file","file_id":"4744","creator":"system"}],"type":"conference","oa_version":"Submitted Version","ddc":["000","004"],"_id":"2258","publication_status":"published","alternative_title":["LNCS"],"pubrep_id":"685","publisher":"Springer","department":[{"_id":"KrPi"}],"year":"2013","month":"01","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"abstract":[{"lang":"eng","text":"In a digital signature scheme with message recovery, rather than transmitting the message m and its signature σ, a single enhanced signature τ is transmitted. The verifier is able to recover m from τ and at the same time verify its authenticity. The two most important parameters of such a scheme are its security and overhead |τ| − |m|. A simple argument shows that for any scheme with “n bits security” |τ| − |m| ≥ n, i.e., the overhead is lower bounded by the security parameter n. Currently, the best known constructions in the random oracle model are far from this lower bound requiring an overhead of n + logq h , where q h is the number of queries to the random oracle. In this paper we give a construction which basically matches the n bit lower bound. We propose a simple digital signature scheme with n + o(logq h ) bits overhead, where q h denotes the number of random oracle queries.\r\n\r\nOur construction works in two steps. First, we propose a signature scheme with message recovery having optimal overhead in a new ideal model, the random invertible function model. Second, we show that a four-round Feistel network with random oracles as round functions is tightly “public-indifferentiable” from a random invertible function. At the core of our indifferentiability proof is an almost tight upper bound for the expected number of edges of the densest “small” subgraph of a random Cayley graph, which may be of independent interest.\r\n"}],"scopus_import":1,"series_title":"Lecture Notes in Computer Science","date_updated":"2021-01-12T06:56:21Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Eike","full_name":"Kiltz, Eike","last_name":"Kiltz"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"},{"full_name":"Szegedy, Mario","last_name":"Szegedy","first_name":"Mario"}],"status":"public","date_created":"2018-12-11T11:56:37Z","citation":{"mla":"Kiltz, Eike, et al. <i>Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions</i>. Vol. 8042, Springer, 2013, pp. 571–88, doi:<a href=\"https://doi.org/10.1007/978-3-642-40041-4_31\">10.1007/978-3-642-40041-4_31</a>.","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, and Mario Szegedy. “Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40041-4_31\">https://doi.org/10.1007/978-3-642-40041-4_31</a>.","apa":"Kiltz, E., Pietrzak, K. Z., &#38; Szegedy, M. (2013). Digital signatures with minimal overhead from indifferentiable random invertible functions. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40041-4_31\">https://doi.org/10.1007/978-3-642-40041-4_31</a>","ieee":"E. Kiltz, K. Z. Pietrzak, and M. Szegedy, “Digital signatures with minimal overhead from indifferentiable random invertible functions,” vol. 8042. Springer, pp. 571–588, 2013.","ista":"Kiltz E, Pietrzak KZ, Szegedy M. 2013. Digital signatures with minimal overhead from indifferentiable random invertible functions. 8042, 571–588.","short":"E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588.","ama":"Kiltz E, Pietrzak KZ, Szegedy M. Digital signatures with minimal overhead from indifferentiable random invertible functions. 2013;8042:571-588. doi:<a href=\"https://doi.org/10.1007/978-3-642-40041-4_31\">10.1007/978-3-642-40041-4_31</a>"},"conference":{"name":"CRYPTO: International Cryptology Conference","start_date":"2013-08-18","location":"Santa Barbara, CA, United States","end_date":"2013-08-22"},"quality_controlled":"1","oa":1,"title":"Digital signatures with minimal overhead from indifferentiable random invertible functions","page":"571 - 588","publist_id":"4688","has_accepted_license":"1","intvolume":"      8042","date_published":"2013-01-01T00:00:00Z","volume":8042,"day":"01","ec_funded":1,"doi":"10.1007/978-3-642-40041-4_31","file_date_updated":"2020-07-14T12:45:35Z"}]