[{"date_updated":"2025-07-10T11:51:09Z","publist_id":"7768","intvolume":"       147","citation":{"ama":"Renkawitz J, Reversat A, Leithner AF, Merrin J, Sixt MK. Micro-engineered “pillar forests” to study cell migration in complex but controlled 3D environments. In: <i>Methods in Cell Biology</i>. Vol 147. Academic Press; 2018:79-91. doi:<a href=\"https://doi.org/10.1016/bs.mcb.2018.07.004\">10.1016/bs.mcb.2018.07.004</a>","chicago":"Renkawitz, Jörg, Anne Reversat, Alexander F Leithner, Jack Merrin, and Michael K Sixt. “Micro-Engineered ‘Pillar Forests’ to Study Cell Migration in Complex but Controlled 3D Environments.” In <i>Methods in Cell Biology</i>, 147:79–91. Academic Press, 2018. <a href=\"https://doi.org/10.1016/bs.mcb.2018.07.004\">https://doi.org/10.1016/bs.mcb.2018.07.004</a>.","ieee":"J. Renkawitz, A. Reversat, A. F. Leithner, J. Merrin, and M. K. Sixt, “Micro-engineered ‘pillar forests’ to study cell migration in complex but controlled 3D environments,” in <i>Methods in Cell Biology</i>, vol. 147, Academic Press, 2018, pp. 79–91.","short":"J. Renkawitz, A. Reversat, A.F. Leithner, J. Merrin, M.K. Sixt, in:, Methods in Cell Biology, Academic Press, 2018, pp. 79–91.","mla":"Renkawitz, Jörg, et al. “Micro-Engineered ‘Pillar Forests’ to Study Cell Migration in Complex but Controlled 3D Environments.” <i>Methods in Cell Biology</i>, vol. 147, Academic Press, 2018, pp. 79–91, doi:<a href=\"https://doi.org/10.1016/bs.mcb.2018.07.004\">10.1016/bs.mcb.2018.07.004</a>.","apa":"Renkawitz, J., Reversat, A., Leithner, A. F., Merrin, J., &#38; Sixt, M. K. (2018). Micro-engineered “pillar forests” to study cell migration in complex but controlled 3D environments. In <i>Methods in Cell Biology</i> (Vol. 147, pp. 79–91). Academic Press. <a href=\"https://doi.org/10.1016/bs.mcb.2018.07.004\">https://doi.org/10.1016/bs.mcb.2018.07.004</a>","ista":"Renkawitz J, Reversat A, Leithner AF, Merrin J, Sixt MK. 2018.Micro-engineered “pillar forests” to study cell migration in complex but controlled 3D environments. In: Methods in Cell Biology. vol. 147, 79–91."},"abstract":[{"lang":"eng","text":"Cells migrating in multicellular organisms steadily traverse complex three-dimensional (3D) environments. To decipher the underlying cell biology, current experimental setups either use simplified 2D, tissue-mimetic 3D (e.g., collagen matrices) or in vivo environments. While only in vivo experiments are truly physiological, they do not allow for precise manipulation of environmental parameters. 2D in vitro experiments do allow mechanical and chemical manipulations, but increasing evidence demonstrates substantial differences of migratory mechanisms in 2D and 3D. Here, we describe simple, robust, and versatile “pillar forests” to investigate cell migration in complex but fully controllable 3D environments. Pillar forests are polydimethylsiloxane-based setups, in which two closely adjacent surfaces are interconnected by arrays of micrometer-sized pillars. Changing the pillar shape, size, height and the inter-pillar distance precisely manipulates microenvironmental parameters (e.g., pore sizes, micro-geometry, micro-topology), while being easily combined with chemotactic cues, surface coatings, diverse cell types and advanced imaging techniques. Thus, pillar forests combine the advantages of 2D cell migration assays with the precise definition of 3D environmental parameters."}],"date_published":"2018-07-27T00:00:00Z","page":"79 - 91","month":"07","volume":147,"publication":"Methods in Cell Biology","status":"public","author":[{"id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","full_name":"Renkawitz, Jörg","orcid":"0000-0003-2856-3369","last_name":"Renkawitz","first_name":"Jörg"},{"id":"35B76592-F248-11E8-B48F-1D18A9856A87","full_name":"Reversat, Anne","last_name":"Reversat","orcid":"0000-0003-0666-8928","first_name":"Anne"},{"first_name":"Alexander F","last_name":"Leithner","orcid":"0000-0002-1073-744X","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","full_name":"Leithner, Alexander F"},{"last_name":"Merrin","orcid":"0000-0001-5145-4609","first_name":"Jack","id":"4515C308-F248-11E8-B48F-1D18A9856A87","full_name":"Merrin, Jack"},{"orcid":"0000-0002-6620-9179","last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"}],"isi":1,"date_created":"2018-12-11T11:44:54Z","quality_controlled":"1","_id":"153","oa_version":"None","scopus_import":"1","doi":"10.1016/bs.mcb.2018.07.004","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0091-679X"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","title":"Micro-engineered “pillar forests” to study cell migration in complex but controlled 3D environments","external_id":{"pmid":["30165964"],"isi":["000452412300006"]},"day":"27","pmid":1,"type":"book_chapter","department":[{"_id":"MiSi"},{"_id":"NanoFab"}],"publication_status":"published","year":"2018","publisher":"Academic Press"},{"doi":"10.1007/s00283-018-9795-5","scopus_import":"1","oa_version":"Preprint","_id":"106","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:44:40Z","isi":1,"quality_controlled":"1","type":"journal_article","oa":1,"external_id":{"arxiv":["1702.05172"],"isi":["000444141200005"]},"day":"01","publisher":"Springer","publication_status":"published","year":"2018","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1702.05172"}],"department":[{"_id":"HeEd"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","arxiv":1,"title":"Long geodesics on convex surfaces","article_processing_charge":"No","abstract":[{"text":"The goal of this article is to introduce the reader to the theory of intrinsic geometry of convex surfaces. We illustrate the power of the tools by proving a theorem on convex surfaces containing an arbitrarily long closed simple geodesic. Let us remind ourselves that a curve in a surface is called geodesic if every sufficiently short arc of the curve is length minimizing; if, in addition, it has no self-intersections, we call it simple geodesic. A tetrahedron with equal opposite edges is called isosceles. The axiomatic method of Alexandrov geometry allows us to work with the metrics of convex surfaces directly, without approximating it first by a smooth or polyhedral metric. Such approximations destroy the closed geodesics on the surface; therefore it is difficult (if at all possible) to apply approximations in the proof of our theorem. On the other hand, a proof in the smooth or polyhedral case usually admits a translation into Alexandrov’s language; such translation makes the result more general. In fact, our proof resembles a translation of the proof given by Protasov. Note that the main theorem implies in particular that a smooth convex surface does not have arbitrarily long simple closed geodesics. However we do not know a proof of this corollary that is essentially simpler than the one presented below.","lang":"eng"}],"citation":{"ista":"Akopyan A, Petrunin A. 2018. Long geodesics on convex surfaces. Mathematical Intelligencer. 40(3), 26–31.","apa":"Akopyan, A., &#38; Petrunin, A. (2018). Long geodesics on convex surfaces. <i>Mathematical Intelligencer</i>. Springer. <a href=\"https://doi.org/10.1007/s00283-018-9795-5\">https://doi.org/10.1007/s00283-018-9795-5</a>","ieee":"A. Akopyan and A. Petrunin, “Long geodesics on convex surfaces,” <i>Mathematical Intelligencer</i>, vol. 40, no. 3. Springer, pp. 26–31, 2018.","short":"A. Akopyan, A. Petrunin, Mathematical Intelligencer 40 (2018) 26–31.","mla":"Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.” <i>Mathematical Intelligencer</i>, vol. 40, no. 3, Springer, 2018, pp. 26–31, doi:<a href=\"https://doi.org/10.1007/s00283-018-9795-5\">10.1007/s00283-018-9795-5</a>.","chicago":"Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.” <i>Mathematical Intelligencer</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00283-018-9795-5\">https://doi.org/10.1007/s00283-018-9795-5</a>.","ama":"Akopyan A, Petrunin A. Long geodesics on convex surfaces. <i>Mathematical Intelligencer</i>. 2018;40(3):26-31. doi:<a href=\"https://doi.org/10.1007/s00283-018-9795-5\">10.1007/s00283-018-9795-5</a>"},"date_published":"2018-09-01T00:00:00Z","publist_id":"7948","date_updated":"2023-09-13T08:49:16Z","intvolume":"        40","publication":"Mathematical Intelligencer","issue":"3","author":[{"first_name":"Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy"},{"full_name":"Petrunin, Anton","first_name":"Anton","last_name":"Petrunin"}],"status":"public","page":"26 - 31","volume":40,"month":"09"},{"title":"On the circle covering theorem by A.W. Goodman and R.E. Goodman","article_processing_charge":"Yes (via OA deal)","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["01795376"],"eissn":["14320444"]},"publisher":"Springer","year":"2018","publication_status":"published","department":[{"_id":"HeEd"}],"type":"journal_article","oa":1,"day":"01","external_id":{"isi":["000432205500011"]},"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"}],"quality_controlled":"1","date_created":"2018-12-11T11:49:57Z","isi":1,"article_type":"original","file_date_updated":"2019-01-18T09:27:36Z","language":[{"iso":"eng"}],"doi":"10.1007/s00454-017-9883-x","oa_version":"Published Version","scopus_import":"1","_id":"1064","ddc":["516","000"],"volume":59,"ec_funded":1,"month":"06","page":"1001-1009","file":[{"file_size":482518,"content_type":"application/pdf","success":1,"file_name":"2018_DiscreteComp_Akopyan.pdf","file_id":"5844","relation":"main_file","creator":"dernst","date_updated":"2019-01-18T09:27:36Z","access_level":"open_access","date_created":"2019-01-18T09:27:36Z"}],"author":[{"full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy","orcid":"0000-0002-2548-617X","last_name":"Akopyan"},{"full_name":"Balitskiy, Alexey","last_name":"Balitskiy","first_name":"Alexey"},{"first_name":"Mikhail","last_name":"Grigorev","full_name":"Grigorev, Mikhail"}],"status":"public","issue":"4","publication":"Discrete & Computational Geometry","intvolume":"        59","publist_id":"6324","date_updated":"2025-04-15T06:50:01Z","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"},"date_published":"2018-06-01T00:00:00Z","has_accepted_license":"1","corr_author":"1","abstract":[{"lang":"eng","text":"In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets."}],"citation":{"ista":"Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete &#38; Computational Geometry. 59(4), 1001–1009.","ama":"Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. 2018;59(4):1001-1009. doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>","chicago":"Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>.","ieee":"A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem by A.W. Goodman and R.E. Goodman,” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4. Springer, pp. 1001–1009, 2018.","mla":"Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4, Springer, 2018, pp. 1001–09, doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>.","short":"A. Akopyan, A. Balitskiy, M. Grigorev, Discrete &#38; Computational Geometry 59 (2018) 1001–1009.","apa":"Akopyan, A., Balitskiy, A., &#38; Grigorev, M. (2018). On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>"}},{"article_number":"20","volume":65,"ec_funded":1,"month":"08","author":[{"full_name":"Dziembowski, Stefan","last_name":"Dziembowski","first_name":"Stefan"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Wichs, Daniel","last_name":"Wichs","first_name":"Daniel"}],"status":"public","issue":"4","publication":"Journal of the ACM","intvolume":"        65","publist_id":"7947","date_updated":"2025-04-14T07:22:06Z","date_published":"2018-08-01T00:00:00Z","citation":{"apa":"Dziembowski, S., Pietrzak, K. Z., &#38; Wichs, D. (2018). Non-malleable codes. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3178432\">https://doi.org/10.1145/3178432</a>","mla":"Dziembowski, Stefan, et al. “Non-Malleable Codes.” <i>Journal of the ACM</i>, vol. 65, no. 4, 20, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3178432\">10.1145/3178432</a>.","short":"S. Dziembowski, K.Z. Pietrzak, D. Wichs, Journal of the ACM 65 (2018).","ieee":"S. Dziembowski, K. Z. Pietrzak, and D. Wichs, “Non-malleable codes,” <i>Journal of the ACM</i>, vol. 65, no. 4. ACM, 2018.","chicago":"Dziembowski, Stefan, Krzysztof Z Pietrzak, and Daniel Wichs. “Non-Malleable Codes.” <i>Journal of the ACM</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3178432\">https://doi.org/10.1145/3178432</a>.","ama":"Dziembowski S, Pietrzak KZ, Wichs D. Non-malleable codes. <i>Journal of the ACM</i>. 2018;65(4). doi:<a href=\"https://doi.org/10.1145/3178432\">10.1145/3178432</a>","ista":"Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4), 20."},"abstract":[{"text":"We introduce the notion of “non-malleable codes” which relaxes the notion of error correction and error detection. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In contrast to error correction and error detection, non-malleability can be achieved for very rich classes of modifications. We construct an efficient code that is non-malleable with respect to modifications that affect each bit of the codeword arbitrarily (i.e., leave it untouched, flip it, or set it to either 0 or 1), but independently of the value of the other bits of the codeword. Using the probabilistic method, we also show a very strong and general statement: there exists a non-malleable code for every “small enough” family F of functions via which codewords can be modified. Although this probabilistic method argument does not directly yield efficient constructions, it gives us efficient non-malleable codes in the random-oracle model for very general classes of tampering functions—e.g., functions where every bit in the tampered codeword can depend arbitrarily on any 99% of the bits in the original codeword. As an application of non-malleable codes, we show that they provide an elegant algorithmic solution to the task of protecting functionalities implemented in hardware (e.g., signature cards) against “tampering attacks.” In such attacks, the secret state of a physical system is tampered, in the hopes that future interaction with the modified system will reveal some secret information. This problem was previously studied in the work of Gennaro et al. in 2004 under the name “algorithmic tamper proof security” (ATP). We show that non-malleable codes can be used to achieve important improvements over the prior work. In particular, we show that any functionality can be made secure against a large class of tampering attacks, simply by encoding the secret state with a non-malleable code while it is stored in memory.","lang":"eng"}],"title":"Non-malleable codes","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"ACM","year":"2018","publication_status":"published","department":[{"_id":"KrPi"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2009/608"}],"type":"journal_article","oa":1,"external_id":{"isi":["000442938200004"]},"day":"01","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"},{"grant_number":"259668","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography"}],"quality_controlled":"1","date_created":"2018-12-11T11:44:40Z","isi":1,"article_type":"original","language":[{"iso":"eng"}],"doi":"10.1145/3178432","scopus_import":"1","oa_version":"Preprint","_id":"107"},{"month":"08","volume":2018,"alternative_title":["ISIT Proceedings"],"author":[{"full_name":"Obremski, Marciej","first_name":"Marciej","last_name":"Obremski"},{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skorski, Maciej","first_name":"Maciej","last_name":"Skorski"}],"status":"public","date_updated":"2023-09-13T08:23:18Z","publist_id":"7946","intvolume":"      2018","conference":{"start_date":"2018-06-17 ","end_date":"2018-06-22","name":"ISIT: International Symposium on Information Theory","location":"Vail, CO, USA"},"citation":{"ista":"Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International Symposium on Information Theory, ISIT Proceedings, vol. 2018.","short":"M. Obremski, M. Skórski, in:, IEEE, 2018.","ieee":"M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018, vol. 2018.","mla":"Obremski, Marciej, and Maciej Skórski. <i>Inverted Leftover Hash Lemma</i>. Vol. 2018, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>.","apa":"Obremski, M., &#38; Skórski, M. (2018). Inverted leftover hash lemma (Vol. 2018). Presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA: IEEE. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>","ama":"Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>","chicago":"Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,” Vol. 2018. IEEE, 2018. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>."},"abstract":[{"text":"Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universal families is the so called Leftover Hash Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography it states that almost universal families are good extractors. In this work we provide a somewhat surprising characterization in the opposite direction. Namely, every extractor with sufficiently good parameters yields a universal family on a noticeable fraction of its inputs. Our proof technique is based on tools from extremal graph theory applied to the \\'collision graph\\' induced by the extractor, and may be of independent interest. We discuss possible applications to the theory of randomness extractors and non-malleable codes.","lang":"eng"}],"date_published":"2018-08-16T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Inverted leftover hash lemma","article_processing_charge":"No","oa":1,"day":"16","external_id":{"isi":["000448139300368"]},"type":"conference","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/507"}],"department":[{"_id":"KrPi"}],"publisher":"IEEE","year":"2018","publication_status":"published","isi":1,"date_created":"2018-12-11T11:44:40Z","quality_controlled":"1","oa_version":"Submitted Version","scopus_import":"1","_id":"108","doi":"10.1109/ISIT.2018.8437654","language":[{"iso":"eng"}]},{"date_updated":"2024-10-09T21:01:50Z","intvolume":"        16","corr_author":"1","citation":{"chicago":"Kazda, Alexandr, Marcin Kozik, Ralph McKenzie, and Matthew Moore. “Absorption and Directed Jónsson Terms.” In <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i>, edited by J Czelakowski, 16:203–20. OCTR. Cham: Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-319-74772-9_7\">https://doi.org/10.1007/978-3-319-74772-9_7</a>.","ama":"Kazda A, Kozik M, McKenzie R, Moore M. Absorption and directed Jónsson terms. In: Czelakowski J, ed. <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i>. Vol 16. OCTR. Cham: Springer Nature; 2018:203-220. doi:<a href=\"https://doi.org/10.1007/978-3-319-74772-9_7\">10.1007/978-3-319-74772-9_7</a>","apa":"Kazda, A., Kozik, M., McKenzie, R., &#38; Moore, M. (2018). Absorption and directed Jónsson terms. In J. Czelakowski (Ed.), <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i> (Vol. 16, pp. 203–220). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-74772-9_7\">https://doi.org/10.1007/978-3-319-74772-9_7</a>","short":"A. Kazda, M. Kozik, R. McKenzie, M. Moore, in:, J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, Springer Nature, Cham, 2018, pp. 203–220.","mla":"Kazda, Alexandr, et al. “Absorption and Directed Jónsson Terms.” <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i>, edited by J Czelakowski, vol. 16, Springer Nature, 2018, pp. 203–20, doi:<a href=\"https://doi.org/10.1007/978-3-319-74772-9_7\">10.1007/978-3-319-74772-9_7</a>.","ieee":"A. Kazda, M. Kozik, R. McKenzie, and M. Moore, “Absorption and directed Jónsson terms,” in <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i>, vol. 16, J. Czelakowski, Ed. Cham: Springer Nature, 2018, pp. 203–220.","ista":"Kazda A, Kozik M, McKenzie R, Moore M. 2018.Absorption and directed Jónsson terms. In: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science. vol. 16, 203–220."},"abstract":[{"lang":"eng","text":"We prove that every congruence distributive variety has directed Jónsson terms, and every congruence modular variety has directed Gumm terms. The directed terms we construct witness every case of absorption witnessed by the original Jónsson or Gumm terms. This result is equivalent to a pair of claims about absorption for admissible preorders in congruence distributive and congruence modular varieties, respectively. For finite algebras, these absorption theorems have already seen significant applications, but until now, it was not clear if the theorems hold for general algebras as well. Our method also yields a novel proof of a result by P. Lipparini about the existence of a chain of terms (which we call Pixley terms) in varieties that are at the same time congruence distributive and k-permutable for some k."}],"date_published":"2018-03-21T00:00:00Z","editor":[{"full_name":"Czelakowski, J","first_name":"J","last_name":"Czelakowski"}],"page":"203-220","volume":16,"acknowledgement":"The second author was supported by National Science Center grant DEC-2011-/01/B/ST6/01006.","month":"03","publication":"Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science","author":[{"id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","full_name":"Kazda, Alexandr","last_name":"Kazda","first_name":"Alexandr"},{"full_name":"Kozik, Marcin","first_name":"Marcin","last_name":"Kozik"},{"first_name":"Ralph","last_name":"McKenzie","full_name":"McKenzie, Ralph"},{"full_name":"Moore, Matthew","first_name":"Matthew","last_name":"Moore"}],"status":"public","date_created":"2022-03-18T10:30:32Z","place":"Cham","quality_controlled":"1","series_title":"OCTR","doi":"10.1007/978-3-319-74772-9_7","scopus_import":"1","oa_version":"Preprint","_id":"10864","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"isbn":["9783319747712"],"eissn":["2211-2766"],"issn":["2211-2758"],"eisbn":["9783319747729"]},"arxiv":1,"title":"Absorption and directed Jónsson terms","article_processing_charge":"No","type":"book_chapter","oa":1,"external_id":{"arxiv":["1502.01072"]},"day":"21","publisher":"Springer Nature","publication_status":"published","year":"2018","department":[{"_id":"VlKo"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1502.01072"}]},{"isi":1,"date_created":"2022-03-18T12:40:35Z","quality_controlled":"1","_id":"10880","scopus_import":"1","oa_version":"Published Version","doi":"10.1093/bfgp/ely007","language":[{"iso":"eng"}],"article_type":"original","publication_identifier":{"eissn":["2041-2657"],"issn":["2041-2649"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","title":"Significance of whole-genome duplications on the emergence of evolutionary novelties","day":"01","external_id":{"pmid":["29579140"],"isi":["000456054400004"]},"pmid":1,"oa":1,"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/bfgp/ely007"}],"department":[{"_id":"CaHe"}],"publication_status":"published","year":"2018","publisher":"Oxford University Press","date_updated":"2024-10-09T21:01:52Z","intvolume":"        17","keyword":["Genetics","Molecular Biology","Biochemistry","General Medicine"],"abstract":[{"lang":"eng","text":"Acquisition of evolutionary novelties is a fundamental process for adapting to the external environment and invading new niches and results in the diversification of life, which we can see in the world today. How such novel phenotypic traits are acquired in the course of evolution and are built up in developing embryos has been a central question in biology. Whole-genome duplication (WGD) is a process of genome doubling that supplies raw genetic materials and increases genome complexity. Recently, it has been gradually revealed that WGD and subsequent fate changes of duplicated genes can facilitate phenotypic evolution. Here, we review the current understanding of the relationship between WGD and the acquisition of evolutionary novelties. We show some examples of this link and discuss how WGD and subsequent duplicated genes can facilitate phenotypic evolution as well as when such genomic doubling can be advantageous for adaptation."}],"citation":{"mla":"Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome Duplications on the Emergence of Evolutionary Novelties.” <i>Briefings in Functional Genomics</i>, vol. 17, no. 5, Oxford University Press, 2018, pp. 329–38, doi:<a href=\"https://doi.org/10.1093/bfgp/ely007\">10.1093/bfgp/ely007</a>.","short":"M. Yuuta, K. Koshiba-Takeuchi, Briefings in Functional Genomics 17 (2018) 329–338.","ieee":"M. Yuuta and K. Koshiba-Takeuchi, “Significance of whole-genome duplications on the emergence of evolutionary novelties,” <i>Briefings in Functional Genomics</i>, vol. 17, no. 5. Oxford University Press, pp. 329–338, 2018.","apa":"Yuuta, M., &#38; Koshiba-Takeuchi, K. (2018). Significance of whole-genome duplications on the emergence of evolutionary novelties. <i>Briefings in Functional Genomics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/bfgp/ely007\">https://doi.org/10.1093/bfgp/ely007</a>","ama":"Yuuta M, Koshiba-Takeuchi K. Significance of whole-genome duplications on the emergence of evolutionary novelties. <i>Briefings in Functional Genomics</i>. 2018;17(5):329-338. doi:<a href=\"https://doi.org/10.1093/bfgp/ely007\">10.1093/bfgp/ely007</a>","chicago":"Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome Duplications on the Emergence of Evolutionary Novelties.” <i>Briefings in Functional Genomics</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/bfgp/ely007\">https://doi.org/10.1093/bfgp/ely007</a>.","ista":"Yuuta M, Koshiba-Takeuchi K. 2018. Significance of whole-genome duplications on the emergence of evolutionary novelties. Briefings in Functional Genomics. 17(5), 329–338."},"corr_author":"1","date_published":"2018-09-01T00:00:00Z","page":"329-338","month":"09","acknowledgement":"This work was supported by JSPS overseas research fellowships (Y.M.) and SENSHIN Medical Research Foundation (K.K.T.).","volume":17,"issue":"5","publication":"Briefings in Functional Genomics","status":"public","author":[{"full_name":"Yuuta, Moriyama","id":"4968E7C8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2853-8051","last_name":"Yuuta","first_name":"Moriyama"},{"first_name":"Kazuko","last_name":"Koshiba-Takeuchi","full_name":"Koshiba-Takeuchi, Kazuko"}]},{"project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300"}],"quality_controlled":"1","date_created":"2022-03-18T12:43:22Z","isi":1,"article_type":"original","language":[{"iso":"eng"}],"doi":"10.1093/jxb/ery097","scopus_import":"1","oa_version":"None","_id":"10881","title":"Molecular evolution and diversification of the SMXL gene family","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["0022-0957"],"eissn":["1460-2431"]},"publisher":"Oxford University Press","year":"2018","publication_status":"published","department":[{"_id":"JiFr"}],"type":"journal_article","external_id":{"isi":["000430727000016"],"pmid":["29538714"]},"day":"13","pmid":1,"keyword":["Plant Science","Physiology"],"intvolume":"        69","date_updated":"2025-04-15T07:48:01Z","date_published":"2018-04-13T00:00:00Z","citation":{"ama":"Moturu TR, Thula S, Singh RK, et al. Molecular evolution and diversification of the SMXL gene family. <i>Journal of Experimental Botany</i>. 2018;69(9):2367-2378. doi:<a href=\"https://doi.org/10.1093/jxb/ery097\">10.1093/jxb/ery097</a>","chicago":"Moturu, Taraka Ramji, Sravankumar Thula, Ravi Kumar Singh, Tomasz Nodzyński, Radka Svobodová Vařeková, Jiří Friml, and Sibu Simon. “Molecular Evolution and Diversification of the SMXL Gene Family.” <i>Journal of Experimental Botany</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/jxb/ery097\">https://doi.org/10.1093/jxb/ery097</a>.","ieee":"T. R. Moturu <i>et al.</i>, “Molecular evolution and diversification of the SMXL gene family,” <i>Journal of Experimental Botany</i>, vol. 69, no. 9. Oxford University Press, pp. 2367–2378, 2018.","short":"T.R. Moturu, S. Thula, R.K. Singh, T. Nodzyński, R.S. Vařeková, J. Friml, S. Simon, Journal of Experimental Botany 69 (2018) 2367–2378.","mla":"Moturu, Taraka Ramji, et al. “Molecular Evolution and Diversification of the SMXL Gene Family.” <i>Journal of Experimental Botany</i>, vol. 69, no. 9, Oxford University Press, 2018, pp. 2367–78, doi:<a href=\"https://doi.org/10.1093/jxb/ery097\">10.1093/jxb/ery097</a>.","apa":"Moturu, T. R., Thula, S., Singh, R. K., Nodzyński, T., Vařeková, R. S., Friml, J., &#38; Simon, S. (2018). Molecular evolution and diversification of the SMXL gene family. <i>Journal of Experimental Botany</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/jxb/ery097\">https://doi.org/10.1093/jxb/ery097</a>","ista":"Moturu TR, Thula S, Singh RK, Nodzyński T, Vařeková RS, Friml J, Simon S. 2018. Molecular evolution and diversification of the SMXL gene family. Journal of Experimental Botany. 69(9), 2367–2378."},"abstract":[{"text":"Strigolactones (SLs) are a relatively recent addition to the list of plant hormones that control different aspects of plant development. SL signalling is perceived by an α/β hydrolase, DWARF 14 (D14). A close homolog of D14, KARRIKIN INSENSTIVE2 (KAI2), is involved in perception of an uncharacterized molecule called karrikin (KAR). Recent studies in Arabidopsis identified the SUPPRESSOR OF MAX2 1 (SMAX1) and SMAX1-LIKE 7 (SMXL7) to be potential SCF–MAX2 complex-mediated proteasome targets of KAI2 and D14, respectively. Genetic studies on SMXL7 and SMAX1 demonstrated distinct developmental roles for each, but very little is known about these repressors in terms of their sequence features. In this study, we performed an extensive comparative analysis of SMXLs and determined their phylogenetic and evolutionary history in the plant lineage. Our results show that SMXL family members can be sub-divided into four distinct phylogenetic clades/classes, with an ancient SMAX1. Further, we identified the clade-specific motifs that have evolved and that might act as determinants of SL-KAR signalling specificity. These specificities resulted from functional diversities among the clades. Our results suggest that a gradual co-evolution of SMXL members with their upstream receptors D14/KAI2 provided an increased specificity to both the SL perception and response in land plants.","lang":"eng"}],"ec_funded":1,"acknowledgement":"This project received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Actions and it is co-financed by the South Moravian Region under grant agreement No. 665860 (SS). Access to computing and storage facilities owned by parties and projects contributing to the national grid infrastructure, MetaCentrum, provided under the program ‘Projects of Large Infrastructure for Research, Development, and Innovations’ (LM2010005) was greatly appreciated (RSV). The project was funded by The Ministry of Education, Youth and Sports/MES of the Czech Republic under the project CEITEC 2020 (LQ1601) (TN, TRM). JF was supported by the European Research Council (project ERC-2011-StG 20101109-PSDP) and the Czech Science Foundation GAČR (GA13-40637S). We thank Dr Kamel Chibani for active discussions on the evolutionary analysis and Nandan Mysore Vardarajan for his critical comments on the manuscript. This article reflects\r\nonly the authors’ views, and the EU is not responsible for any use that may be made of the information it contains. ","volume":69,"month":"04","page":"2367-2378","author":[{"full_name":"Moturu, Taraka Ramji","last_name":"Moturu","first_name":"Taraka Ramji"},{"first_name":"Sravankumar","last_name":"Thula","full_name":"Thula, Sravankumar"},{"last_name":"Singh","first_name":"Ravi Kumar","full_name":"Singh, Ravi Kumar"},{"full_name":"Nodzyński, Tomasz","first_name":"Tomasz","last_name":"Nodzyński"},{"first_name":"Radka Svobodová","last_name":"Vařeková","full_name":"Vařeková, Radka Svobodová"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jiří","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sibu","last_name":"Simon","full_name":"Simon, Sibu"}],"status":"public","issue":"9","publication":"Journal of Experimental Botany"},{"date_created":"2022-03-18T12:45:09Z","isi":1,"quality_controlled":"1","doi":"10.1109/cvpr.2018.00956","_id":"10882","scopus_import":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781538664209"],"eissn":["2575-7075"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","arxiv":1,"article_processing_charge":"No","title":"Learning intelligent dialogs for bounding box annotation","type":"conference","day":"17","external_id":{"arxiv":["1712.08087"],"isi":["000457843609036"]},"oa":1,"year":"2018","publication_status":"published","publisher":"IEEE","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1712.08087"}],"department":[{"_id":"ChLa"}],"date_updated":"2024-10-09T21:02:26Z","corr_author":"1","abstract":[{"lang":"eng","text":"We introduce Intelligent Annotation Dialogs for bounding box annotation. We train an agent to automatically choose a sequence of actions for a human annotator to produce a bounding box in a minimal amount of time. Specifically, we consider two actions: box verification [34], where the annotator verifies a box generated by an object detector, and manual box drawing. We explore two kinds of agents, one based on predicting the probability that a box will be positively verified, and the other based on reinforcement learning. We demonstrate that (1) our agents are able to learn efficient annotation strategies in several scenarios, automatically adapting to the image difficulty, the desired quality of the boxes, and the detector strength; (2) in all scenarios the resulting annotation dialogs speed up annotation compared to manual box drawing alone and box verification alone, while also outperforming any fixed combination of verification and drawing in most scenarios; (3) in a realistic scenario where the detector is iteratively re-trained, our agents evolve a series of strategies that reflect the shifting trade-off between verification and drawing as the detector grows stronger."}],"citation":{"apa":"Uijlings, J., Konyushkova, K., Lampert, C., &#38; Ferrari, V. (2018). Learning intelligent dialogs for bounding box annotation. In <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i> (pp. 9175–9184). Salt Lake City, UT, United States: IEEE. <a href=\"https://doi.org/10.1109/cvpr.2018.00956\">https://doi.org/10.1109/cvpr.2018.00956</a>","short":"J. Uijlings, K. Konyushkova, C. Lampert, V. Ferrari, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–9184.","mla":"Uijlings, Jasper, et al. “Learning Intelligent Dialogs for Bounding Box Annotation.” <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, IEEE, 2018, pp. 9175–84, doi:<a href=\"https://doi.org/10.1109/cvpr.2018.00956\">10.1109/cvpr.2018.00956</a>.","ieee":"J. Uijlings, K. Konyushkova, C. Lampert, and V. Ferrari, “Learning intelligent dialogs for bounding box annotation,” in <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Salt Lake City, UT, United States, 2018, pp. 9175–9184.","chicago":"Uijlings, Jasper, Ksenia Konyushkova, Christoph Lampert, and Vittorio Ferrari. “Learning Intelligent Dialogs for Bounding Box Annotation.” In <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, 9175–84. IEEE, 2018. <a href=\"https://doi.org/10.1109/cvpr.2018.00956\">https://doi.org/10.1109/cvpr.2018.00956</a>.","ama":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. Learning intelligent dialogs for bounding box annotation. In: <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>. IEEE; 2018:9175-9184. doi:<a href=\"https://doi.org/10.1109/cvpr.2018.00956\">10.1109/cvpr.2018.00956</a>","ista":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. 2018. Learning intelligent dialogs for bounding box annotation. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVF: Conference on Computer Vision and Pattern Recognition, 9175–9184."},"conference":{"location":"Salt Lake City, UT, United States","name":"CVF: Conference on Computer Vision and Pattern Recognition","end_date":"2018-06-23","start_date":"2018-06-18"},"date_published":"2018-12-17T00:00:00Z","page":"9175-9184","month":"12","publication":"2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition","status":"public","author":[{"last_name":"Uijlings","first_name":"Jasper","full_name":"Uijlings, Jasper"},{"first_name":"Ksenia","last_name":"Konyushkova","full_name":"Konyushkova, Ksenia"},{"orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vittorio","last_name":"Ferrari","full_name":"Ferrari, Vittorio"}]},{"quality_controlled":"1","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"}],"date_created":"2022-03-18T12:46:32Z","language":[{"iso":"eng"}],"file_date_updated":"2022-05-17T07:51:08Z","_id":"10883","oa_version":"Published Version","scopus_import":"1","doi":"10.29007/5z5k","article_processing_charge":"No","title":"Quasipolynomial set-based symbolic algorithms for parity games","arxiv":1,"publication_identifier":{"issn":["2398-7340"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"year":"2018","publication_status":"published","publisher":"EasyChair","external_id":{"arxiv":["1909.04983"]},"day":"23","oa":1,"type":"conference","intvolume":"        57","date_updated":"2025-07-10T11:50:02Z","date_published":"2018-10-23T00:00:00Z","citation":{"ista":"Chatterjee K, Dvořák W, Henzinger M, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.","ama":"Chatterjee K, Dvořák W, Henzinger M, Svozil A. Quasipolynomial set-based symbolic algorithms for parity games. In: <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>. Vol 57. EasyChair; 2018:233-253. doi:<a href=\"https://doi.org/10.29007/5z5k\">10.29007/5z5k</a>","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>, 57:233–53. EasyChair, 2018. <a href=\"https://doi.org/10.29007/5z5k\">https://doi.org/10.29007/5z5k</a>.","ieee":"K. Chatterjee, W. Dvořák, M. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253.","short":"K. Chatterjee, W. Dvořák, M. Henzinger, A. Svozil, in:, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair, 2018, pp. 233–253.","mla":"Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>, vol. 57, EasyChair, 2018, pp. 233–53, doi:<a href=\"https://doi.org/10.29007/5z5k\">10.29007/5z5k</a>.","apa":"Chatterjee, K., Dvořák, W., Henzinger, M., &#38; Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i> (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. <a href=\"https://doi.org/10.29007/5z5k\">https://doi.org/10.29007/5z5k</a>"},"abstract":[{"text":"Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space.","lang":"eng"}],"conference":{"start_date":"2018-11-17","end_date":"2018-11-21","location":"Awassa, Ethiopia","name":"LPAR: Logic for Programming, Artificial Intelligence and Reasoning"},"has_accepted_license":"1","month":"10","volume":57,"acknowledgement":"A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph Games). For M.H the research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) /ERC Grant Agreement no. 340506.","ec_funded":1,"ddc":["000"],"file":[{"file_size":720893,"content_type":"application/pdf","success":1,"file_name":"2018_EPiCs_Chatterjee.pdf","file_id":"11392","relation":"main_file","checksum":"1229aa8640bd6db610c85decf2265480","creator":"dernst","date_updated":"2022-05-17T07:51:08Z","access_level":"open_access","date_created":"2022-05-17T07:51:08Z"}],"page":"233-253","status":"public","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Wolfgang","last_name":"Dvořák","full_name":"Dvořák, Wolfgang"},{"first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"publication":"22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning","alternative_title":["EPiC Series in Computing"]},{"_id":"11","oa_version":"Preprint","scopus_import":1,"doi":"10.1007/978-3-030-01602-9_9","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:44:08Z","quality_controlled":"1","project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"day":"27","external_id":{"arxiv":["1806.10843"]},"oa":1,"type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.10843"}],"department":[{"_id":"RoSe"}],"publication_status":"published","year":"2018","publisher":"Springer","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Mean-field limits of particles in interaction with quantised radiation fields","citation":{"ieee":"N. K. Leopold and P. Pickl, “Mean-field limits of particles in interaction with quantised radiation fields,” presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany, 2018, vol. 270, pp. 185–214.","mla":"Leopold, Nikolai K., and Peter Pickl. <i>Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields</i>. Vol. 270, Springer, 2018, pp. 185–214, doi:<a href=\"https://doi.org/10.1007/978-3-030-01602-9_9\">10.1007/978-3-030-01602-9_9</a>.","short":"N.K. Leopold, P. Pickl, in:, Springer, 2018, pp. 185–214.","apa":"Leopold, N. K., &#38; Pickl, P. (2018). Mean-field limits of particles in interaction with quantised radiation fields (Vol. 270, pp. 185–214). Presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-030-01602-9_9\">https://doi.org/10.1007/978-3-030-01602-9_9</a>","ama":"Leopold NK, Pickl P. Mean-field limits of particles in interaction with quantised radiation fields. In: Vol 270. Springer; 2018:185-214. doi:<a href=\"https://doi.org/10.1007/978-3-030-01602-9_9\">10.1007/978-3-030-01602-9_9</a>","chicago":"Leopold, Nikolai K, and Peter Pickl. “Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields,” 270:185–214. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-01602-9_9\">https://doi.org/10.1007/978-3-030-01602-9_9</a>.","ista":"Leopold NK, Pickl P. 2018. Mean-field limits of particles in interaction with quantised radiation fields. MaLiQS: Macroscopic Limits of Quantum Systems vol. 270, 185–214."},"abstract":[{"lang":"eng","text":"We report on a novel strategy to derive mean-field limits of quantum mechanical systems in which a large number of particles weakly couple to a second-quantized radiation field. The technique combines the method of counting and the coherent state approach to study the growth of the correlations among the particles and in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon system of equations from the Nelson model with ultraviolet cutoff and possibly massless scalar field. In particular, we prove the convergence of the reduced density matrices (of the nonrelativistic particles and the field bosons) associated with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon equations in trace norm. Furthermore, we derive explicit bounds on the rate of convergence of the one-particle reduced density matrix of the nonrelativistic particles in Sobolev norm."}],"conference":{"location":"Munich, Germany","name":"MaLiQS: Macroscopic Limits of Quantum Systems","start_date":"2017-03-30","end_date":"2017-04-01"},"date_published":"2018-10-27T00:00:00Z","date_updated":"2021-01-12T06:48:16Z","publist_id":"8045","intvolume":"       270","status":"public","author":[{"orcid":"0000-0002-0495-6822","last_name":"Leopold","first_name":"Nikolai K","full_name":"Leopold, Nikolai K","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pickl, Peter","last_name":"Pickl","first_name":"Peter"}],"page":"185 - 214","month":"10","volume":270,"ec_funded":1},{"citation":{"chicago":"Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. International Association for Cryptologic Research, 2018. <a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">https://doi.org/10.13154/tches.v2018.i3.214-242</a>.","ama":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and monitoring of free running oscillators serving as source of randomness. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. 2018;2018(3):214-242. doi:<a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">10.13154/tches.v2018.i3.214-242</a>","apa":"Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., &#38; Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. International Association for Cryptologic Research. <a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">https://doi.org/10.13154/tches.v2018.i3.214-242</a>","ieee":"E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer, “Evaluation and monitoring of free running oscillators serving as source of randomness,” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2018, no. 3. International Association for Cryptologic Research, pp. 214–242, 2018.","mla":"Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2018, no. 3, International Association for Cryptologic Research, 2018, pp. 214–42, doi:<a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">10.13154/tches.v2018.i3.214-242</a>.","short":"E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242.","ista":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242."},"abstract":[{"lang":"eng","text":"In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied."}],"corr_author":"1","has_accepted_license":"1","date_published":"2018-01-01T00:00:00Z","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"},"date_updated":"2025-05-20T09:40:25Z","intvolume":"      2018","publication":"IACR Transactions on Cryptographic Hardware and Embedded Systems","issue":"3","author":[{"full_name":"Allini, Elie Noumon","first_name":"Elie Noumon","last_name":"Allini"},{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej","first_name":"Maciej","last_name":"Skórski"},{"full_name":"Petura, Oto","first_name":"Oto","last_name":"Petura"},{"last_name":"Bernard","first_name":"Florent","full_name":"Bernard, Florent"},{"full_name":"Laban, Marek","last_name":"Laban","first_name":"Marek"},{"last_name":"Fischer","first_name":"Viktor","full_name":"Fischer, Viktor"}],"status":"public","file":[{"creator":"cchlebak","date_updated":"2021-11-15T10:27:29Z","date_created":"2021-11-15T10:27:29Z","access_level":"open_access","relation":"main_file","checksum":"b816b848f046c48a8357700d9305dce5","success":1,"file_name":"2018_IACR_Allini.pdf","file_id":"10289","file_size":955755,"content_type":"application/pdf"}],"page":"214-242","month":"01","ddc":["000"],"volume":2018,"oa_version":"Published Version","scopus_import":"1","_id":"10286","doi":"10.13154/tches.v2018.i3.214-242","file_date_updated":"2021-11-15T10:27:29Z","OA_place":"publisher","language":[{"iso":"eng"}],"article_type":"original","date_created":"2021-11-14T23:01:25Z","quality_controlled":"1","oa":1,"day":"01","type":"journal_article","department":[{"_id":"KrPi"}],"publisher":"International Association for Cryptologic Research","year":"2018","publication_status":"published","OA_type":"diamond","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2569-2925"]},"title":"Evaluation and monitoring of free running oscillators serving as source of randomness","article_processing_charge":"No"},{"OA_place":"publisher","file_date_updated":"2025-05-20T09:44:47Z","language":[{"iso":"eng"}],"article_type":"original","oa_version":"Published Version","scopus_import":"1","_id":"10417","doi":"10.1145/3158119","quality_controlled":"1","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"date_created":"2021-12-05T23:01:49Z","department":[{"_id":"KrCh"}],"publisher":"Association for Computing Machinery","year":"2018","publication_status":"published","OA_type":"hybrid","oa":1,"external_id":{"arxiv":["1610.01188"]},"day":"01","type":"journal_article","title":"Data-centric dynamic partial order reduction","article_processing_charge":"No","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["2475-1421"]},"date_published":"2018-01-01T00:00:00Z","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"},"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5448"},{"relation":"earlier_version","status":"public","id":"5456"}]},"conference":{"start_date":"2018-01-07","end_date":"2018-01-13","location":"Los Angeles, CA, United States","name":"POPL: Programming Languages"},"abstract":[{"text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\n\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.","lang":"eng"}],"citation":{"ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2018. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2(POPL), 31.","ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. <i>Proceedings of the ACM on Programming Languages</i>. 2018;2(POPL). doi:<a href=\"https://doi.org/10.1145/3158119\">10.1145/3158119</a>","chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3158119\">https://doi.org/10.1145/3158119</a>.","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL. Association for Computing Machinery, 2018.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2018).","mla":"Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL, 31, Association for Computing Machinery, 2018, doi:<a href=\"https://doi.org/10.1145/3158119\">10.1145/3158119</a>.","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., &#38; Vaidya, K. (2018). Data-centric dynamic partial order reduction. <i>Proceedings of the ACM on Programming Languages</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3158119\">https://doi.org/10.1145/3158119</a>"},"has_accepted_license":"1","intvolume":"         2","date_updated":"2025-05-20T09:45:10Z","author":[{"first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sinha, Nishant","last_name":"Sinha","first_name":"Nishant"},{"full_name":"Vaidya, Kapil","first_name":"Kapil","last_name":"Vaidya"}],"status":"public","issue":"POPL","publication":"Proceedings of the ACM on Programming Languages","month":"01","ddc":["000"],"article_number":"31","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF\r\nNFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Czech\r\nScience Foundation grant GBP202/12/G061.","volume":2,"ec_funded":1,"file":[{"creator":"dernst","date_updated":"2025-05-20T09:44:47Z","date_created":"2025-05-20T09:44:47Z","access_level":"open_access","relation":"main_file","checksum":"b27ab1745f6dba2387deb785798a657c","success":1,"file_name":"2018_ACM_Chalupa.pdf","file_id":"19716","file_size":388891,"content_type":"application/pdf"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2334-2536"]},"title":"Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters","article_processing_charge":"No","type":"journal_article","oa":1,"external_id":{"isi":["000447853100007"]},"day":"20","year":"2018","publication_status":"published","main_file_link":[{"url":"www.doi.org/10.1364/OPTICA.5.001210 ","open_access":"1"}],"department":[{"_id":"JoFi"}],"date_created":"2018-12-11T11:44:12Z","isi":1,"quality_controlled":"1","doi":"10.1364/OPTICA.5.001210","oa_version":"Published Version","scopus_import":"1","_id":"22","article_type":"original","language":[{"iso":"eng"}],"page":"1210-1219","volume":5,"month":"10","issue":"10","publication":"Optica","author":[{"full_name":"Botello, Gabriel","last_name":"Botello","first_name":"Gabriel"},{"first_name":"Florian","last_name":"Sedlmeir","full_name":"Sedlmeir, Florian"},{"last_name":"Rueda Sanchez","orcid":"0000-0001-6249-5860","first_name":"Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","full_name":"Rueda Sanchez, Alfredo R"},{"first_name":"Kerlos","last_name":"Abdalmalak","full_name":"Abdalmalak, Kerlos"},{"full_name":"Brown, Elliott","first_name":"Elliott","last_name":"Brown"},{"last_name":"Leuchs","first_name":"Gerd","full_name":"Leuchs, Gerd"},{"full_name":"Preu, Sascha","last_name":"Preu","first_name":"Sascha"},{"first_name":"Daniel","last_name":"Segovia Vargas","full_name":"Segovia Vargas, Daniel"},{"full_name":"Strekalov, Dmitry","first_name":"Dmitry","last_name":"Strekalov"},{"last_name":"Munoz","first_name":"Luis","full_name":"Munoz, Luis"},{"full_name":"Schwefel, Harald","first_name":"Harald","last_name":"Schwefel"}],"status":"public","publist_id":"8033","date_updated":"2025-07-10T11:52:06Z","intvolume":"         5","abstract":[{"lang":"eng","text":"Conventional ultra-high sensitivity detectors in the millimeter-wave range are usually cooled as their own thermal noise at room temperature would mask the weak received radiation. The need for cryogenic systems increases the cost and complexity of the instruments, hindering the development of, among others, airborne and space applications. In this work, the nonlinear parametric upconversion of millimeter-wave radiation to the optical domain inside high-quality (Q) lithium niobate whispering-gallery mode (WGM) resonators is proposed for ultra-low noise detection. We experimentally demonstrate coherent upconversion of millimeter-wave signals to a 1550 nm telecom carrier, with a photon conversion efficiency surpassing the state-of-the-art by 2 orders of magnitude. Moreover, a theoretical model shows that the thermal equilibrium of counterpropagating WGMs is broken by overcoupling the millimeter-wave WGM, effectively cooling the upconverted mode and allowing ultra-low noise detection. By theoretically estimating the sensitivity of a correlation radiometer based on the presented scheme, it is found that room-temperature radiometers with better sensitivity than state-of-the-art high-electron-mobility transistor (HEMT)-based radiometers can be designed. This detection paradigm can be used to develop room-temperature instrumentation for radio astronomy, earth observation, planetary missions, and imaging systems."}],"citation":{"ista":"Botello G, Sedlmeir F, Rueda Sanchez AR, Abdalmalak K, Brown E, Leuchs G, Preu S, Segovia Vargas D, Strekalov D, Munoz L, Schwefel H. 2018. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 5(10), 1210–1219.","chicago":"Botello, Gabriel, Florian Sedlmeir, Alfredo R Rueda Sanchez, Kerlos Abdalmalak, Elliott Brown, Gerd Leuchs, Sascha Preu, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” <i>Optica</i>, 2018. <a href=\"https://doi.org/10.1364/OPTICA.5.001210\">https://doi.org/10.1364/OPTICA.5.001210</a>.","ama":"Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. <i>Optica</i>. 2018;5(10):1210-1219. doi:<a href=\"https://doi.org/10.1364/OPTICA.5.001210\">10.1364/OPTICA.5.001210</a>","apa":"Botello, G., Sedlmeir, F., Rueda Sanchez, A. R., Abdalmalak, K., Brown, E., Leuchs, G., … Schwefel, H. (2018). Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. <i>Optica</i>. <a href=\"https://doi.org/10.1364/OPTICA.5.001210\">https://doi.org/10.1364/OPTICA.5.001210</a>","ieee":"G. Botello <i>et al.</i>, “Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters,” <i>Optica</i>, vol. 5, no. 10. pp. 1210–1219, 2018.","short":"G. Botello, F. Sedlmeir, A.R. Rueda Sanchez, K. Abdalmalak, E. Brown, G. Leuchs, S. Preu, D. Segovia Vargas, D. Strekalov, L. Munoz, H. Schwefel, Optica 5 (2018) 1210–1219.","mla":"Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” <i>Optica</i>, vol. 5, no. 10, 2018, pp. 1210–19, doi:<a href=\"https://doi.org/10.1364/OPTICA.5.001210\">10.1364/OPTICA.5.001210</a>."},"date_published":"2018-10-20T00:00:00Z"},{"oa_version":"Preprint","scopus_import":"1","_id":"24","doi":"10.24963/ijcai.2018/652","language":[{"iso":"eng"}],"isi":1,"date_created":"2018-12-11T11:44:13Z","quality_controlled":"1","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"}],"oa":1,"external_id":{"arxiv":["1804.10601"],"isi":["000764175404117"]},"day":"01","type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10601"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"IJCAI","publication_status":"published","year":"2018","arxiv":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","article_processing_charge":"No","conference":{"start_date":"2018-07-13","end_date":"2018-07-19","name":"IJCAI: International Joint Conference on Artificial Intelligence","location":"Stockholm, Sweden"},"abstract":[{"text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it.","lang":"eng"}],"citation":{"chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. <a href=\"https://doi.org/10.24963/ijcai.2018/652\">https://doi.org/10.24963/ijcai.2018/652</a>.","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:<a href=\"https://doi.org/10.24963/ijcai.2018/652\">10.24963/ijcai.2018/652</a>","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., &#38; Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. <a href=\"https://doi.org/10.24963/ijcai.2018/652\">https://doi.org/10.24963/ijcai.2018/652</a>","mla":"Chatterjee, Krishnendu, et al. <i>Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives</i>. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:<a href=\"https://doi.org/10.24963/ijcai.2018/652\">10.24963/ijcai.2018/652</a>.","ieee":"K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.","ista":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699."},"date_published":"2018-07-01T00:00:00Z","date_updated":"2025-04-14T13:51:04Z","publist_id":"8031","intvolume":"      2018","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","full_name":"Elgyütt, Adrian","last_name":"Elgyütt","first_name":"Adrian"},{"last_name":"Novotny","first_name":"Petr","full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Owen","last_name":"Rouillé","full_name":"Rouillé, Owen"}],"status":"public","page":"4692 - 4699","month":"07","acknowledgement":"This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n","volume":2018,"ec_funded":1},{"title":"Goal-HSVI: Heuristic search value iteration for goal-POMDPs","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"IJCAI","publication_status":"published","year":"2018","department":[{"_id":"KrCh"}],"main_file_link":[{"url":"https://doi.org/10.24963/ijcai.2018/662","open_access":"1"}],"type":"conference","oa":1,"day":"01","external_id":{"isi":["000764175404127"]},"project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","date_created":"2018-12-11T11:44:13Z","isi":1,"language":[{"iso":"eng"}],"doi":"10.24963/ijcai.2018/662","scopus_import":"1","oa_version":"Published Version","_id":"25","acknowledgement":"∗This work has been supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games). This research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). ","volume":"2018-July","ec_funded":1,"month":"07","page":"4764 - 4770","author":[{"full_name":"Horák, Karel","last_name":"Horák","first_name":"Karel"},{"last_name":"Bošanský","first_name":"Branislav","full_name":"Bošanský, Branislav"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"}],"status":"public","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","publist_id":"8030","date_updated":"2025-04-14T13:51:04Z","date_published":"2018-07-01T00:00:00Z","conference":{"start_date":"2018-07-13","end_date":"2018-07-19","location":"Stockholm, Sweden","name":"IJCAI: International Joint Conference on Artificial Intelligence"},"citation":{"ista":"Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770.","chicago":"Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>, 2018–July:4764–70. IJCAI, 2018. <a href=\"https://doi.org/10.24963/ijcai.2018/662\">https://doi.org/10.24963/ijcai.2018/662</a>.","ama":"Horák K, Bošanský B, Chatterjee K. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In: <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>. Vol 2018-July. IJCAI; 2018:4764-4770. doi:<a href=\"https://doi.org/10.24963/ijcai.2018/662\">10.24963/ijcai.2018/662</a>","apa":"Horák, K., Bošanský, B., &#38; Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i> (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. <a href=\"https://doi.org/10.24963/ijcai.2018/662\">https://doi.org/10.24963/ijcai.2018/662</a>","mla":"Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:<a href=\"https://doi.org/10.24963/ijcai.2018/662\">10.24963/ijcai.2018/662</a>.","ieee":"K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.","short":"K. Horák, B. Bošanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770."},"abstract":[{"lang":"eng","text":"Partially observable Markov decision processes (POMDPs) are the standard models for planning under uncertainty with both finite and infinite horizon. Besides the well-known discounted-sum objective, indefinite-horizon objective (aka Goal-POMDPs) is another classical objective for POMDPs. In this case, given a set of target states and a positive cost for each transition, the optimization objective is to minimize the expected total cost until a target state is reached. In the literature, RTDP-Bel or heuristic search value iteration (HSVI) have been used for solving Goal-POMDPs. Neither of these algorithms has theoretical convergence guarantees, and HSVI may even fail to terminate its trials. We give the following contributions: (1) We discuss the challenges introduced in Goal-POMDPs and illustrate how they prevent the original HSVI from converging. (2) We present a novel algorithm inspired by HSVI, termed Goal-HSVI, and show that our algorithm has convergence guarantees. (3) We show that Goal-HSVI outperforms RTDP-Bel on a set of well-known examples."}]},{"alternative_title":["Proceedings of SPIE"],"status":"public","author":[{"full_name":"Xuereb, André","last_name":"Xuereb","first_name":"André"},{"full_name":"Aquilina, Matteo","first_name":"Matteo","last_name":"Aquilina"},{"first_name":"Shabir","last_name":"Barzanjeh","orcid":"0000-0003-0415-1423","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","full_name":"Barzanjeh, Shabir"}],"editor":[{"last_name":"Andrews","first_name":"D L","full_name":"Andrews, D L"},{"full_name":"Ostendorf, A","first_name":"A","last_name":"Ostendorf"},{"last_name":"Bain","first_name":"A J","full_name":"Bain, A J"},{"first_name":"J M","last_name":"Nunzi","full_name":"Nunzi, J M"}],"month":"05","volume":10672,"article_number":"106721N","abstract":[{"text":"There is currently significant interest in operating devices in the quantum regime, where their behaviour cannot be explained through classical mechanics. Quantum states, including entangled states, are fragile and easily disturbed by excessive thermal noise. Here we address the question of whether it is possible to create non-reciprocal devices that encourage the flow of thermal noise towards or away from a particular quantum device in a network. Our work makes use of the cascaded systems formalism to answer this question in the affirmative, showing how a three-port device can be used as an effective thermal transistor, and illustrates how this formalism maps onto an experimentally-realisable optomechanical system. Our results pave the way to more resilient quantum devices and to the use of thermal noise as a resource.","lang":"eng"}],"citation":{"ista":"Xuereb A, Aquilina M, Barzanjeh S. 2018. Routing thermal noise through quantum networks. SPIE: The international society for optical engineering, Proceedings of SPIE, vol. 10672, 106721N.","chicago":"Xuereb, André, Matteo Aquilina, and Shabir Barzanjeh. “Routing Thermal Noise through Quantum Networks.” edited by D L Andrews, A Ostendorf, A J Bain, and J M Nunzi, Vol. 10672. SPIE, 2018. <a href=\"https://doi.org/10.1117/12.2309928\">https://doi.org/10.1117/12.2309928</a>.","ama":"Xuereb A, Aquilina M, Barzanjeh S. Routing thermal noise through quantum networks. In: Andrews DL, Ostendorf A, Bain AJ, Nunzi JM, eds. Vol 10672. SPIE; 2018. doi:<a href=\"https://doi.org/10.1117/12.2309928\">10.1117/12.2309928</a>","apa":"Xuereb, A., Aquilina, M., &#38; Barzanjeh, S. (2018). Routing thermal noise through quantum networks. In D. L. Andrews, A. Ostendorf, A. J. Bain, &#38; J. M. Nunzi (Eds.) (Vol. 10672). Presented at the SPIE: The international society for optical engineering, Strasbourg, France: SPIE. <a href=\"https://doi.org/10.1117/12.2309928\">https://doi.org/10.1117/12.2309928</a>","short":"A. Xuereb, M. Aquilina, S. Barzanjeh, in:, D.L. Andrews, A. Ostendorf, A.J. Bain, J.M. Nunzi (Eds.), SPIE, 2018.","ieee":"A. Xuereb, M. Aquilina, and S. Barzanjeh, “Routing thermal noise through quantum networks,” presented at the SPIE: The international society for optical engineering, Strasbourg, France, 2018, vol. 10672.","mla":"Xuereb, André, et al. <i>Routing Thermal Noise through Quantum Networks</i>. Edited by D L Andrews et al., vol. 10672, 106721N, SPIE, 2018, doi:<a href=\"https://doi.org/10.1117/12.2309928\">10.1117/12.2309928</a>."},"conference":{"start_date":"2018-04-22","end_date":"2018-04-26","name":"SPIE: The international society for optical engineering","location":"Strasbourg, France"},"date_published":"2018-05-04T00:00:00Z","date_updated":"2023-09-18T08:12:24Z","publist_id":"7766","intvolume":"     10672","day":"04","external_id":{"arxiv":["1806.01000"],"isi":["000453298500019"]},"oa":1,"type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.01000"}],"department":[{"_id":"JoFi"}],"publication_status":"published","year":"2018","publisher":"SPIE","arxiv":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","title":"Routing thermal noise through quantum networks","_id":"155","oa_version":"Preprint","scopus_import":"1","doi":"10.1117/12.2309928","language":[{"iso":"eng"}],"isi":1,"date_created":"2018-12-11T11:44:55Z","quality_controlled":"1"},{"date_published":"2018-07-12T00:00:00Z","has_accepted_license":"1","conference":{"end_date":"2018-07-17","start_date":"2018-07-15","name":"FM: Formal Methods","location":"Oxford, UK"},"abstract":[{"text":"Imprecision in timing can sometimes be beneficial: Metric interval temporal logic (MITL), disabling the expression of punctuality constraints, was shown to translate to timed automata, yielding an elementary decision procedure. We show how this principle extends to other forms of dense-time specification using regular expressions. By providing a clean, automaton-based formal framework for non-punctual languages, we are able to recover and extend several results in timed systems. Metric interval regular expressions (MIRE) are introduced, providing regular expressions with non-singular duration constraints. We obtain that MIRE are expressively complete relative to a class of one-clock timed automata, which can be determinized using additional clocks. Metric interval dynamic logic (MIDL) is then defined using MIRE as temporal modalities. We show that MIDL generalizes known extensions of MITL, while translating to timed automata at comparable cost.","lang":"eng"}],"citation":{"ama":"Ferrere T. The compound interest in relaxing punctuality. In: Vol 10951. Springer; 2018:147-164. doi:<a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">10.1007/978-3-319-95582-7_9</a>","chicago":"Ferrere, Thomas. “The Compound Interest in Relaxing Punctuality,” 10951:147–64. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">https://doi.org/10.1007/978-3-319-95582-7_9</a>.","mla":"Ferrere, Thomas. <i>The Compound Interest in Relaxing Punctuality</i>. Vol. 10951, Springer, 2018, pp. 147–64, doi:<a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">10.1007/978-3-319-95582-7_9</a>.","short":"T. Ferrere, in:, Springer, 2018, pp. 147–164.","ieee":"T. Ferrere, “The compound interest in relaxing punctuality,” presented at the FM: Formal Methods, Oxford, UK, 2018, vol. 10951, pp. 147–164.","apa":"Ferrere, T. (2018). The compound interest in relaxing punctuality (Vol. 10951, pp. 147–164). Presented at the FM: Formal Methods, Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">https://doi.org/10.1007/978-3-319-95582-7_9</a>","ista":"Ferrere T. 2018. The compound interest in relaxing punctuality. FM: Formal Methods, LNCS, vol. 10951, 147–164."},"intvolume":"     10951","publist_id":"7765","date_updated":"2025-07-10T11:51:10Z","author":[{"full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","last_name":"Ferrere","first_name":"Thomas"}],"status":"public","alternative_title":["LNCS"],"ddc":["000"],"volume":10951,"month":"07","page":"147 - 164","file":[{"access_level":"open_access","date_created":"2020-10-09T06:22:41Z","creator":"dernst","date_updated":"2020-10-09T06:22:41Z","checksum":"a045c213c42c445f1889326f8db82a0a","relation":"main_file","file_id":"8637","success":1,"file_name":"2018_LNCS_Ferrere.pdf","content_type":"application/pdf","file_size":485576}],"language":[{"iso":"eng"}],"file_date_updated":"2020-10-09T06:22:41Z","doi":"10.1007/978-3-319-95582-7_9","oa_version":"Submitted Version","scopus_import":"1","_id":"156","project":[{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"quality_controlled":"1","date_created":"2018-12-11T11:44:55Z","isi":1,"publisher":"Springer","year":"2018","publication_status":"published","department":[{"_id":"ToHe"}],"type":"conference","oa":1,"day":"12","external_id":{"isi":["000489765800009"]},"title":"The compound interest in relaxing punctuality","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"month":"07","ddc":["000"],"acknowledgement":"European Research Council Start Grant 279307, Austrian Science Fund (FWF) grant P23499-N23, \r\nC.H. acknowledges support from the ISTFELLOW programme.","volume":559,"ec_funded":1,"file":[{"file_size":2834442,"content_type":"application/pdf","file_name":"2018_Nature_Hilbe.pdf","file_id":"7049","relation":"main_file","checksum":"011ab905cf9a410bc2b96f15174d654d","date_updated":"2020-07-14T12:45:02Z","creator":"dernst","access_level":"open_access","date_created":"2019-11-19T08:09:57Z"}],"page":"246 - 249","author":[{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","full_name":"Hilbe, Christian","first_name":"Christian","last_name":"Hilbe","orcid":"0000-0001-5116-955X"},{"full_name":"Šimsa, Štepán","first_name":"Štepán","last_name":"Šimsa"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"status":"public","issue":"7713","publication":"Nature","intvolume":"       559","date_updated":"2025-04-15T06:30:08Z","publist_id":"7764","date_published":"2018-07-04T00:00:00Z","related_material":{"link":[{"url":"https://ist.ac.at/en/news/engineering-cooperation/","relation":"press_release","description":"News on IST Homepage"}]},"abstract":[{"lang":"eng","text":"Social dilemmas occur when incentives for individuals are misaligned with group interests 1-7 . According to the 'tragedy of the commons', these misalignments can lead to overexploitation and collapse of public resources. The resulting behaviours can be analysed with the tools of game theory 8 . The theory of direct reciprocity 9-15 suggests that repeated interactions can alleviate such dilemmas, but previous work has assumed that the public resource remains constant over time. Here we introduce the idea that the public resource is instead changeable and depends on the strategic choices of individuals. An intuitive scenario is that cooperation increases the public resource, whereas defection decreases it. Thus, cooperation allows the possibility of playing a more valuable game with higher payoffs, whereas defection leads to a less valuable game. We analyse this idea using the theory of stochastic games 16-19 and evolutionary game theory. We find that the dependence of the public resource on previous interactions can greatly enhance the propensity for cooperation. For these results, the interaction between reciprocity and payoff feedback is crucial: neither repeated interactions in a constant environment nor single interactions in a changing environment yield similar cooperation rates. Our framework shows which feedbacks between exploitation and environment - either naturally occurring or designed - help to overcome social dilemmas."}],"citation":{"ista":"Hilbe C, Šimsa Š, Chatterjee K, Nowak M. 2018. Evolution of cooperation in stochastic games. Nature. 559(7713), 246–249.","ama":"Hilbe C, Šimsa Š, Chatterjee K, Nowak M. Evolution of cooperation in stochastic games. <i>Nature</i>. 2018;559(7713):246-249. doi:<a href=\"https://doi.org/10.1038/s41586-018-0277-x\">10.1038/s41586-018-0277-x</a>","chicago":"Hilbe, Christian, Štepán Šimsa, Krishnendu Chatterjee, and Martin Nowak. “Evolution of Cooperation in Stochastic Games.” <i>Nature</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41586-018-0277-x\">https://doi.org/10.1038/s41586-018-0277-x</a>.","mla":"Hilbe, Christian, et al. “Evolution of Cooperation in Stochastic Games.” <i>Nature</i>, vol. 559, no. 7713, Nature Publishing Group, 2018, pp. 246–49, doi:<a href=\"https://doi.org/10.1038/s41586-018-0277-x\">10.1038/s41586-018-0277-x</a>.","ieee":"C. Hilbe, Š. Šimsa, K. Chatterjee, and M. Nowak, “Evolution of cooperation in stochastic games,” <i>Nature</i>, vol. 559, no. 7713. Nature Publishing Group, pp. 246–249, 2018.","short":"C. Hilbe, Š. Šimsa, K. Chatterjee, M. Nowak, Nature 559 (2018) 246–249.","apa":"Hilbe, C., Šimsa, Š., Chatterjee, K., &#38; Nowak, M. (2018). Evolution of cooperation in stochastic games. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41586-018-0277-x\">https://doi.org/10.1038/s41586-018-0277-x</a>"},"has_accepted_license":"1","title":"Evolution of cooperation in stochastic games","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"KrCh"}],"publisher":"Nature Publishing Group","year":"2018","publication_status":"published","oa":1,"day":"04","external_id":{"isi":["000438240900054"]},"type":"journal_article","quality_controlled":"1","project":[{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"isi":1,"date_created":"2018-12-11T11:44:56Z","file_date_updated":"2020-07-14T12:45:02Z","language":[{"iso":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","_id":"157","doi":"10.1038/s41586-018-0277-x"},{"title":"Maternal auxin supply contributes to early embryo patterning in Arabidopsis","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Nature Publishing Group","year":"2018","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30013211"}],"department":[{"_id":"JiFr"}],"type":"journal_article","oa":1,"pmid":1,"external_id":{"isi":["000443861300011"],"pmid":["30013211"]},"day":"16","project":[{"grant_number":"282300","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"quality_controlled":"1","date_created":"2018-12-11T11:44:56Z","isi":1,"language":[{"iso":"eng"}],"doi":"10.1038/s41477-018-0204-z","scopus_import":"1","oa_version":"Submitted Version","_id":"158","acknowledgement":"This work was further supported by the Czech Science Foundation GACR (GA13-40637S) to J.F.;","ec_funded":1,"volume":4,"month":"07","page":"548 - 553","author":[{"last_name":"Robert","first_name":"Hélène","full_name":"Robert, Hélène"},{"full_name":"Park, Chulmin","first_name":"Chulmin","last_name":"Park"},{"last_name":"Gutièrrez","first_name":"Carla","full_name":"Gutièrrez, Carla"},{"last_name":"Wójcikowska","first_name":"Barbara","full_name":"Wójcikowska, Barbara"},{"full_name":"Pěnčík, Aleš","last_name":"Pěnčík","first_name":"Aleš"},{"full_name":"Novák, Ondřej","last_name":"Novák","first_name":"Ondřej"},{"last_name":"Chen","first_name":"Junyi","full_name":"Chen, Junyi"},{"first_name":"Wim","last_name":"Grunewald","full_name":"Grunewald, Wim"},{"full_name":"Dresselhaus, Thomas","last_name":"Dresselhaus","first_name":"Thomas"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","first_name":"Jirí","last_name":"Friml","orcid":"0000-0002-8302-7596"},{"full_name":"Laux, Thomas","first_name":"Thomas","last_name":"Laux"}],"status":"public","issue":"8","publication":"Nature Plants","intvolume":"         4","publist_id":"7763","date_updated":"2025-04-15T07:48:03Z","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/plant-mothers-talk-to-their-embryos-via-the-hormone-auxin/"}]},"date_published":"2018-07-16T00:00:00Z","abstract":[{"lang":"eng","text":"The angiosperm seed is composed of three genetically distinct tissues: the diploid embryo that originates from the fertilized egg cell, the triploid endosperm that is produced from the fertilized central cell, and the maternal sporophytic integuments that develop into the seed coat1. At the onset of embryo development in Arabidopsis thaliana, the zygote divides asymmetrically, producing a small apical embryonic cell and a larger basal cell that connects the embryo to the maternal tissue2. The coordinated and synchronous development of the embryo and the surrounding integuments, and the alignment of their growth axes, suggest communication between maternal tissues and the embryo. In contrast to animals, however, where a network of maternal factors that direct embryo patterning have been identified3,4, only a few maternal mutations have been described to affect embryo development in plants5–7. Early embryo patterning in Arabidopsis requires accumulation of the phytohormone auxin in the apical cell by directed transport from the suspensor8–10. However, the origin of this auxin has remained obscure. Here we investigate the source of auxin for early embryogenesis and provide evidence that the mother plant coordinates seed development by supplying auxin to the early embryo from the integuments of the ovule. We show that auxin response increases in ovules after fertilization, due to upregulated auxin biosynthesis in the integuments, and this maternally produced auxin is required for correct embryo development."}],"citation":{"ista":"Robert H, Park C, Gutièrrez C, Wójcikowska B, Pěnčík A, Novák O, Chen J, Grunewald W, Dresselhaus T, Friml J, Laux T. 2018. Maternal auxin supply contributes to early embryo patterning in Arabidopsis. Nature Plants. 4(8), 548–553.","ama":"Robert H, Park C, Gutièrrez C, et al. Maternal auxin supply contributes to early embryo patterning in Arabidopsis. <i>Nature Plants</i>. 2018;4(8):548-553. doi:<a href=\"https://doi.org/10.1038/s41477-018-0204-z\">10.1038/s41477-018-0204-z</a>","chicago":"Robert, Hélène, Chulmin Park, Carla Gutièrrez, Barbara Wójcikowska, Aleš Pěnčík, Ondřej Novák, Junyi Chen, et al. “Maternal Auxin Supply Contributes to Early Embryo Patterning in Arabidopsis.” <i>Nature Plants</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41477-018-0204-z\">https://doi.org/10.1038/s41477-018-0204-z</a>.","short":"H. Robert, C. Park, C. Gutièrrez, B. Wójcikowska, A. Pěnčík, O. Novák, J. Chen, W. Grunewald, T. Dresselhaus, J. Friml, T. Laux, Nature Plants 4 (2018) 548–553.","ieee":"H. Robert <i>et al.</i>, “Maternal auxin supply contributes to early embryo patterning in Arabidopsis,” <i>Nature Plants</i>, vol. 4, no. 8. Nature Publishing Group, pp. 548–553, 2018.","mla":"Robert, Hélène, et al. “Maternal Auxin Supply Contributes to Early Embryo Patterning in Arabidopsis.” <i>Nature Plants</i>, vol. 4, no. 8, Nature Publishing Group, 2018, pp. 548–53, doi:<a href=\"https://doi.org/10.1038/s41477-018-0204-z\">10.1038/s41477-018-0204-z</a>.","apa":"Robert, H., Park, C., Gutièrrez, C., Wójcikowska, B., Pěnčík, A., Novák, O., … Laux, T. (2018). Maternal auxin supply contributes to early embryo patterning in Arabidopsis. <i>Nature Plants</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41477-018-0204-z\">https://doi.org/10.1038/s41477-018-0204-z</a>"}}]