[{"day":"13","citation":{"apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2017). Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>.","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, International Federation for Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>.","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation for Computational Logic, 2017."},"license":"https://creativecommons.org/licenses/by-nd/4.0/","doi":"10.23638/LMCS-13(3:23)2017","project":[{"call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa":1,"intvolume":"        13","quality_controlled":"1","date_updated":"2026-07-06T13:27:53Z","das_tickbox":"1","oa_version":"Published Version","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5438"},{"status":"public","relation":"earlier_version","id":"1610"}]},"file_date_updated":"2020-07-14T12:46:33Z","article_processing_charge":"No","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Edit distance for pushdown automata","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"}],"publication":"Logical Methods in Computer Science","volume":13,"ddc":["004"],"publist_id":"7356","language":[{"iso":"eng"}],"status":"public","date_published":"2017-09-13T00:00:00Z","scopus_import":"1","corr_author":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ec_funded":1,"issue":"3","isi":1,"tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"fulldoi":"https://doi.org/10.23638/LMCS-13(3:23)2017","has_accepted_license":"1","publication_status":"published","external_id":{"isi":["000419163000005"]},"file":[{"relation":"main_file","file_size":279071,"checksum":"08041379ba408d40664f449eb5907a8f","content_type":"application/pdf","date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-12T10:14:37Z","creator":"system","file_id":"5090","access_level":"open_access","file_name":"IST-2015-321-v1+1_main.pdf"},{"relation":"main_file","checksum":"08041379ba408d40664f449eb5907a8f","file_size":279071,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-12T10:14:38Z","creator":"system","access_level":"open_access","file_id":"5091","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf"}],"publisher":"International Federation for Computational Logic","_id":"465","month":"09","publication_identifier":{"issn":["1860-5974"]},"date_created":"2018-12-11T11:46:37Z","abstract":[{"text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. ","lang":"eng"}],"pubrep_id":"955","year":"2017"},{"ddc":["004"],"volume":13,"publication":"Logical Methods in Computer Science","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}],"title":"Improved algorithms for parity and Streett objectives","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:32Z","related_material":{"record":[{"status":"public","id":"1661","relation":"earlier_version"}]},"date_updated":"2026-07-06T13:28:05Z","oa_version":"Published Version","das_tickbox":"1","quality_controlled":"1","intvolume":"        13","oa":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"doi":"10.23638/LMCS-13(3:26)2017","citation":{"ama":"Chatterjee K, Henzinger M, Loitzenbauer V. Improved algorithms for parity and Streett objectives. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">10.23638/LMCS-13(3:26)2017</a>","apa":"Chatterjee, K., Henzinger, M., &#38; Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">https://doi.org/10.23638/LMCS-13(3:26)2017</a>","ista":"Chatterjee K, Henzinger M, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, 26, International Federation for Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">10.23638/LMCS-13(3:26)2017</a>.","chicago":"Chatterjee, Krishnendu, Monika Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">https://doi.org/10.23638/LMCS-13(3:26)2017</a>.","short":"K. Chatterjee, M. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation for Computational Logic, 2017."},"day":"26","pubrep_id":"956","year":"2017","abstract":[{"text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"date_created":"2018-12-11T11:46:37Z","publication_identifier":{"issn":["1860-5974"]},"_id":"464","month":"09","publisher":"International Federation for Computational Logic","file":[{"creator":"system","date_created":"2018-12-12T10:13:27Z","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","access_level":"open_access","file_id":"5010","file_size":582940,"checksum":"12d469ae69b80361333d7dead965cf5d","relation":"main_file","date_updated":"2020-07-14T12:46:32Z","content_type":"application/pdf"}],"external_id":{"isi":["000419163000001"],"arxiv":["1410.0833"]},"publication_status":"published","has_accepted_license":"1","fulldoi":"https://doi.org/10.23638/LMCS-13(3:26)2017","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"isi":1,"ec_funded":1,"issue":"3","arxiv":1,"scopus_import":"1","corr_author":"1","department":[{"_id":"KrCh"}],"date_published":"2017-09-26T00:00:00Z","article_number":"26","status":"public","language":[{"iso":"eng"}],"publist_id":"7357"},{"publication_status":"published","external_id":{"arxiv":["1509.04631"],"isi":["000409382300004"]},"publisher":"International Press of Boston","month":"01","_id":"484","publication_identifier":{"issn":["1095-0761"]},"date_created":"2018-12-11T11:46:43Z","abstract":[{"text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β &lt; 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory.","lang":"eng"}],"year":"2017","publist_id":"7336","language":[{"iso":"eng"}],"status":"public","date_published":"2017-01-01T00:00:00Z","scopus_import":"1","department":[{"_id":"RoSe"}],"arxiv":1,"ec_funded":1,"issue":"3","isi":1,"fulldoi":"https://doi.org/10.4310/ATMP.2017.v21.n3.a4","oa_version":"Submitted Version","date_updated":"2026-07-06T13:34:16Z","das_tickbox":"1","article_processing_charge":"No","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","author":[{"last_name":"Nam","first_name":"Phan","full_name":"Nam, Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Napiórkowski","first_name":"Marcin M","full_name":"Napiórkowski, Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87"}],"publication":"Advances in Theoretical and Mathematical Physics","volume":21,"day":"01","page":"683 - 738","citation":{"mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3, International Press of Boston, 2017, pp. 683–738, doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">10.4310/ATMP.2017.v21.n3.a4</a>.","chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press of Boston, 2017. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">https://doi.org/10.4310/ATMP.2017.v21.n3.a4</a>.","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3. International Press of Boston, pp. 683–738, 2017.","ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. <i>Advances in Theoretical and Mathematical Physics</i>. 2017;21(3):683-738. doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">10.4310/ATMP.2017.v21.n3.a4</a>","apa":"Nam, P., &#38; Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. <i>Advances in Theoretical and Mathematical Physics</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">https://doi.org/10.4310/ATMP.2017.v21.n3.a4</a>","ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738."},"doi":"10.4310/ATMP.2017.v21.n3.a4","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"main_file_link":[{"url":"https://arxiv.org/abs/1509.04631","open_access":"1"}],"oa":1,"intvolume":"        21","quality_controlled":"1"},{"_id":"483","month":"08","publication_status":"published","publisher":"International Press of Boston","external_id":{"arxiv":["1602.02312"],"isi":["000409382300005"]},"abstract":[{"lang":"eng","text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices."}],"date_created":"2018-12-11T11:46:43Z","year":"2017","publication_identifier":{"issn":["1095-0761"]},"date_published":"2017-08-25T00:00:00Z","department":[{"_id":"LaEr"}],"scopus_import":"1","language":[{"iso":"eng"}],"publist_id":"7337","status":"public","isi":1,"issue":"3","ec_funded":1,"fulldoi":"https://doi.org/10.4310/ATMP.2017.v21.n3.a5","arxiv":1,"oa_version":"Submitted Version","das_tickbox":"1","date_updated":"2026-07-06T13:35:08Z","volume":21,"publication":"Advances in Theoretical and Mathematical Physics","article_processing_charge":"No","title":"Universality for a class of random band matrices","author":[{"full_name":"Bourgade, Paul","first_name":"Paul","last_name":"Bourgade"},{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603"},{"full_name":"Yau, Horng","last_name":"Yau","first_name":"Horng"},{"last_name":"Yin","first_name":"Jun","full_name":"Yin, Jun"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","citation":{"ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. <i>Advances in Theoretical and Mathematical Physics</i>. 2017;21(3):739-800. doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">10.4310/ATMP.2017.v21.n3.a5</a>","apa":"Bourgade, P., Erdös, L., Yau, H., &#38; Yin, J. (2017). Universality for a class of random band matrices. <i>Advances in Theoretical and Mathematical Physics</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">https://doi.org/10.4310/ATMP.2017.v21.n3.a5</a>","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.","mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3, International Press of Boston, 2017, pp. 739–800, doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">10.4310/ATMP.2017.v21.n3.a5</a>.","chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press of Boston, 2017. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">https://doi.org/10.4310/ATMP.2017.v21.n3.a5</a>.","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800.","ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3. International Press of Boston, pp. 739–800, 2017."},"day":"25","page":"739 - 800","intvolume":"        21","oa":1,"quality_controlled":"1","doi":"10.4310/ATMP.2017.v21.n3.a5","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.02312"}],"project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}]},{"status":"public","language":[{"iso":"eng"}],"publist_id":"6398","department":[{"_id":"ChLa"}],"scopus_import":"1","date_published":"2017-08-01T00:00:00Z","acknowledgement":"We thank Tim Salimans for spotting a mistake in our preliminary arXiv manuscript. This work was funded by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 308036.","arxiv":1,"isi":1,"ec_funded":1,"publisher":"Journal of Machine Learning Research","external_id":{"arxiv":["1612.08185"],"isi":["000683309501102"]},"publication_status":"published","has_accepted_license":"1","_id":"1000","month":"08","publication_identifier":{"isbn":["978-151085514-4"]},"year":"2017","abstract":[{"lang":"eng","text":"We study probabilistic models of natural images and extend the autoregressive family of PixelCNN models by incorporating latent variables. Subsequently, we describe two new generative image models that exploit different image transformations as latent variables: a quantized grayscale view of the image or a multi-resolution image pyramid. The proposed models tackle two known shortcomings of existing PixelCNN models: 1) their tendency to focus on low-level image details, while largely ignoring high-level image information, such as object shapes, and 2) their computationally costly procedure for image sampling. We experimentally demonstrate benefits of our LatentPixelCNN models, in particular showing that they produce much more realistically looking image samples than previous state-of-the-art probabilistic models. "}],"date_created":"2018-12-11T11:49:37Z","page":"1905 - 1914","day":"01","citation":{"ama":"Kolesnikov A, Lampert C. PixelCNN models with auxiliary variables for natural image modeling. In: <i>34th International Conference on Machine Learning</i>. Vol 70. Journal of Machine Learning Research; 2017:1905-1914.","apa":"Kolesnikov, A., &#38; Lampert, C. (2017). PixelCNN models with auxiliary variables for natural image modeling. In <i>34th International Conference on Machine Learning</i> (Vol. 70, pp. 1905–1914). Sydney, Australia: Journal of Machine Learning Research.","ista":"Kolesnikov A, Lampert C. 2017. PixelCNN models with auxiliary variables for natural image modeling. 34th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 70, 1905–1914.","mla":"Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary Variables for Natural Image Modeling.” <i>34th International Conference on Machine Learning</i>, vol. 70, Journal of Machine Learning Research, 2017, pp. 1905–14.","short":"A. Kolesnikov, C. Lampert, in:, 34th International Conference on Machine Learning, Journal of Machine Learning Research, 2017, pp. 1905–1914.","chicago":"Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary Variables for Natural Image Modeling.” In <i>34th International Conference on Machine Learning</i>, 70:1905–14. Journal of Machine Learning Research, 2017.","ieee":"A. Kolesnikov and C. Lampert, “PixelCNN models with auxiliary variables for natural image modeling,” in <i>34th International Conference on Machine Learning</i>, Sydney, Australia, 2017, vol. 70, pp. 1905–1914."},"project":[{"name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://arxiv.org/abs/1612.08185","open_access":"1"}],"quality_controlled":"1","intvolume":"        70","oa":1,"date_updated":"2026-07-06T13:41:23Z","das_tickbox":"1","oa_version":"Submitted Version","author":[{"first_name":"Alexander","last_name":"Kolesnikov","full_name":"Kolesnikov, Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887"}],"title":"PixelCNN models with auxiliary variables for natural image modeling","conference":{"name":"ICML: International Conference on Machine Learning","start_date":"2017-08-06","end_date":"2017-08-11","location":"Sydney, Australia"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","article_processing_charge":"No","volume":70,"publication":"34th International Conference on Machine Learning"},{"publication_identifier":{"issn":["1532-0073"]},"year":"2017","abstract":[{"lang":"eng","text":"We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the family Z&lt; r(f) := (g-1(0): ||g - f|| &lt; r) of all zero sets of all continuous maps g closer to f than r in the max-norm. All of these sets are outside A := (x: |f(x)| ≥ r) and we claim that Z&lt; r(f) is fully determined by A and an element of a certain cohomotopy group which (by a recent result) is computable whenever the dimension of X is at most 2n - 3. By considering all r &gt; 0 simultaneously, the pointed cohomotopy groups form a persistence module-a structure leading to persistence diagrams as in the case of persistent homology or well groups. Eventually, we get a descriptor of persistent robust properties of zero sets that has better descriptive power (Theorem A) and better computability status (Theorem B) than the established well diagrams. Moreover, if we endow every point of each zero set with gradients of the perturbation, the robust description of the zero sets by elements of cohomotopy groups is in some sense the best possible (Theorem C)."}],"date_created":"2018-12-11T11:47:14Z","publisher":"International Press of Boston","external_id":{"arxiv":["1507.04310"],"isi":["000440749400010"]},"publication_status":"published","_id":"568","month":"01","arxiv":1,"fulldoi":"https://doi.org/10.4310/HHA.2017.v19.n2.a16","isi":1,"ec_funded":1,"issue":"2","status":"public","language":[{"iso":"eng"}],"publist_id":"7246","scopus_import":"1","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"corr_author":"1","date_published":"2017-01-01T00:00:00Z","title":"Persistence of zero sets","author":[{"orcid":"0000-0001-8878-8397","first_name":"Peter","last_name":"Franek","id":"473294AE-F248-11E8-B48F-1D18A9856A87","full_name":"Franek, Peter"},{"last_name":"Krcál","first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","article_processing_charge":"No","volume":19,"publication":"Homology, Homotopy and Applications","das_tickbox":"1","oa_version":"Submitted Version","date_updated":"2026-07-06T13:38:28Z","main_file_link":[{"url":"https://arxiv.org/abs/1507.04310","open_access":"1"}],"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"call_identifier":"H2020","_id":"2590DB08-B435-11E9-9278-68D0E5697425","grant_number":"701309","name":"Atomic Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes"}],"doi":"10.4310/HHA.2017.v19.n2.a16","quality_controlled":"1","intvolume":"        19","oa":1,"page":"313 - 342","day":"01","citation":{"ista":"Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.","ama":"Franek P, Krcál M. Persistence of zero sets. <i>Homology, Homotopy and Applications</i>. 2017;19(2):313-342. doi:<a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">10.4310/HHA.2017.v19.n2.a16</a>","apa":"Franek, P., &#38; Krcál, M. (2017). Persistence of zero sets. <i>Homology, Homotopy and Applications</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">https://doi.org/10.4310/HHA.2017.v19.n2.a16</a>","ieee":"P. Franek and M. Krcál, “Persistence of zero sets,” <i>Homology, Homotopy and Applications</i>, vol. 19, no. 2. International Press of Boston, pp. 313–342, 2017.","mla":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” <i>Homology, Homotopy and Applications</i>, vol. 19, no. 2, International Press of Boston, 2017, pp. 313–42, doi:<a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">10.4310/HHA.2017.v19.n2.a16</a>.","chicago":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” <i>Homology, Homotopy and Applications</i>. International Press of Boston, 2017. <a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">https://doi.org/10.4310/HHA.2017.v19.n2.a16</a>.","short":"P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342."}},{"date_updated":"2026-07-06T13:38:44Z","das_tickbox":"1","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:47:47Z","article_processing_charge":"No","author":[{"full_name":"Kynčl, Jan","first_name":"Jan","last_name":"Kynčl"},{"orcid":"0000-0002-3975-1683","first_name":"Zuzana","last_name":"Patakova","full_name":"Patakova, Zuzana","id":"48B57058-F248-11E8-B48F-1D18A9856A87"}],"title":"On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":24,"publication":"The Electronic Journal of Combinatorics","ddc":["500"],"day":"14","page":"1-44","citation":{"chicago":"Kynčl, Jan, and Zuzana Patakova. “On the Nonexistence of k Reptile Simplices in ℝ^3 and ℝ^4.” <i>The Electronic Journal of Combinatorics</i>. International Press of Boston, 2017.","short":"J. Kynčl, Z. Patakova, The Electronic Journal of Combinatorics 24 (2017) 1–44.","mla":"Kynčl, Jan, and Zuzana Patakova. “On the Nonexistence of k Reptile Simplices in ℝ^3 and ℝ^4.” <i>The Electronic Journal of Combinatorics</i>, vol. 24, no. 3, International Press of Boston, 2017, pp. 1–44.","ieee":"J. Kynčl and Z. Patakova, “On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4,” <i>The Electronic Journal of Combinatorics</i>, vol. 24, no. 3. International Press of Boston, pp. 1–44, 2017.","apa":"Kynčl, J., &#38; Patakova, Z. (2017). On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4. <i>The Electronic Journal of Combinatorics</i>. International Press of Boston.","ama":"Kynčl J, Patakova Z. On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4. <i>The Electronic Journal of Combinatorics</i>. 2017;24(3):1-44.","ista":"Kynčl J, Patakova Z. 2017. On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4. The Electronic Journal of Combinatorics. 24(3), 1–44."},"intvolume":"        24","oa":1,"quality_controlled":"1","publication_status":"published","has_accepted_license":"1","publisher":"International Press of Boston","file":[{"date_updated":"2020-07-14T12:47:47Z","content_type":"application/pdf","file_size":544042,"checksum":"a431e573e31df13bc0f66de3061006ec","relation":"main_file","file_name":"IST-2018-984-v1+1_Patakova_on_the_nonexistence_of_k-reptile_simplices_in_R_3_and_R_4_2017.pdf","access_level":"open_access","file_id":"5077","creator":"system","date_created":"2018-12-12T10:14:25Z"}],"month":"07","_id":"701","publication_identifier":{"issn":["1077-8926"]},"abstract":[{"lang":"eng","text":"A d-dimensional simplex S is called a k-reptile (or a k-reptile simplex) if it can be tiled by k simplices with disjoint interiors that are all mutually congruent and similar to S. For d = 2, triangular k-reptiles exist for all k of the form a^2, 3a^2 or a^2+b^2 and they have been completely characterized by Snover, Waiveris, and Williams. On the other hand, the only k-reptile simplices that are known for d ≥ 3, have k = m^d, where m is a positive integer. We substantially simplify the proof by Matoušek and the second author that for d = 3, k-reptile tetrahedra can exist only for k = m^3. We then prove a weaker analogue of this result for d = 4 by showing that four-dimensional k-reptile simplices can exist only for k = m^2."}],"date_created":"2018-12-11T11:48:00Z","pubrep_id":"984","year":"2017","language":[{"iso":"eng"}],"publist_id":"6996","status":"public","date_published":"2017-07-14T00:00:00Z","department":[{"_id":"UlWa"}],"corr_author":"1","issue":"3"},{"publication_identifier":{"issn":["1544-9173"]},"abstract":[{"lang":"eng","text":"Dengue-suppressing Wolbachia strains are promising tools for arbovirus control, particularly as they have the potential to self-spread following local introductions. To test this, we followed the frequency of the transinfected Wolbachia strain wMel through Ae. aegypti in Cairns, Australia, following releases at 3 nonisolated locations within the city in early 2013. Spatial spread was analysed graphically using interpolation and by fitting a statistical model describing the position and width of the wave. For the larger 2 of the 3 releases (covering 0.97 km2 and 0.52 km2), we observed slow but steady spatial spread, at about 100–200 m per year, roughly consistent with theoretical predictions. In contrast, the smallest release (0.11 km2) produced erratic temporal and spatial dynamics, with little evidence of spread after 2 years. This is consistent with the prediction concerning fitness-decreasing Wolbachia transinfections that a minimum release area is needed to achieve stable local establishment and spread in continuous habitats. Our graphical and likelihood analyses produced broadly consistent estimates of wave speed and wave width. Spread at all sites was spatially heterogeneous, suggesting that environmental heterogeneity will affect large-scale Wolbachia transformations of urban mosquito populations. The persistence and spread of Wolbachia in release areas meeting minimum area requirements indicates the promise of successful large-scale population transfo"}],"date_created":"2018-12-11T11:49:22Z","year":"2017","pubrep_id":"843","publication_status":"published","has_accepted_license":"1","file":[{"checksum":"107d290bd1159ec77b734eb2824b01c8","file_size":5541206,"relation":"main_file","date_updated":"2020-07-14T12:48:16Z","content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:08:30Z","file_name":"IST-2017-843-v1+1_journal.pbio.2001894.pdf","access_level":"open_access","file_id":"4691"}],"publisher":"Public Library of Science","external_id":{"isi":["000402520000012"]},"_id":"951","month":"05","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"issue":"5","fulldoi":"https://doi.org/10.1371/journal.pbio.2001894","language":[{"iso":"eng"}],"publist_id":"6464","status":"public","date_published":"2017-05-30T00:00:00Z","article_number":"e2001894","scopus_import":"1","department":[{"_id":"NiBa"}],"article_processing_charge":"No","author":[{"last_name":"Schmidt","first_name":"Tom","full_name":"Schmidt, Tom"},{"orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"full_name":"Rasic, Gordana","last_name":"Rasic","first_name":"Gordana"},{"full_name":"Turley, Andrew","last_name":"Turley","first_name":"Andrew"},{"first_name":"Brian","last_name":"Montgomery","full_name":"Montgomery, Brian"},{"first_name":"Inaki","last_name":"Iturbe Ormaetxe","full_name":"Iturbe Ormaetxe, Inaki"},{"full_name":"Cook, Peter","first_name":"Peter","last_name":"Cook"},{"full_name":"Ryan, Peter","last_name":"Ryan","first_name":"Peter"},{"first_name":"Scott","last_name":"Ritchie","full_name":"Ritchie, Scott"},{"full_name":"Hoffmann, Ary","last_name":"Hoffmann","first_name":"Ary"},{"full_name":"O’Neill, Scott","last_name":"O’Neill","first_name":"Scott"},{"full_name":"Turelli, Michael","first_name":"Michael","last_name":"Turelli"}],"title":"Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":15,"publication":"PLoS Biology","ddc":["576"],"oa_version":"Published Version","date_updated":"2026-07-06T13:53:54Z","related_material":{"record":[{"id":"9856","relation":"research_data","status":"public"},{"status":"public","id":"9858","relation":"research_data"},{"relation":"research_data","id":"9857","status":"public"}]},"file_date_updated":"2020-07-14T12:48:16Z","doi":"10.1371/journal.pbio.2001894","intvolume":"        15","oa":1,"quality_controlled":"1","day":"30","citation":{"ieee":"T. Schmidt <i>et al.</i>, “Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti,” <i>PLoS Biology</i>, vol. 15, no. 5. Public Library of Science, 2017.","mla":"Schmidt, Tom, et al. “Local Introduction and Heterogeneous Spatial Spread of Dengue-Suppressing Wolbachia through an Urban Population of Aedes Aegypti.” <i>PLoS Biology</i>, vol. 15, no. 5, e2001894, Public Library of Science, 2017, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2001894\">10.1371/journal.pbio.2001894</a>.","chicago":"Schmidt, Tom, Nicholas H Barton, Gordana Rasic, Andrew Turley, Brian Montgomery, Inaki Iturbe Ormaetxe, Peter Cook, et al. “Local Introduction and Heterogeneous Spatial Spread of Dengue-Suppressing Wolbachia through an Urban Population of Aedes Aegypti.” <i>PLoS Biology</i>. Public Library of Science, 2017. <a href=\"https://doi.org/10.1371/journal.pbio.2001894\">https://doi.org/10.1371/journal.pbio.2001894</a>.","short":"T. Schmidt, N.H. Barton, G. Rasic, A. Turley, B. Montgomery, I. Iturbe Ormaetxe, P. Cook, P. Ryan, S. Ritchie, A. Hoffmann, S. O’Neill, M. Turelli, PLoS Biology 15 (2017).","ista":"Schmidt T, Barton NH, Rasic G, Turley A, Montgomery B, Iturbe Ormaetxe I, Cook P, Ryan P, Ritchie S, Hoffmann A, O’Neill S, Turelli M. 2017. Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti. PLoS Biology. 15(5), e2001894.","ama":"Schmidt T, Barton NH, Rasic G, et al. Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti. <i>PLoS Biology</i>. 2017;15(5). doi:<a href=\"https://doi.org/10.1371/journal.pbio.2001894\">10.1371/journal.pbio.2001894</a>","apa":"Schmidt, T., Barton, N. H., Rasic, G., Turley, A., Montgomery, B., Iturbe Ormaetxe, I., … Turelli, M. (2017). Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2001894\">https://doi.org/10.1371/journal.pbio.2001894</a>"}},{"month":"05","_id":"9857","related_material":{"record":[{"relation":"used_in_publication","id":"951","status":"public"}]},"publisher":"Public Library of Science","date_updated":"2026-07-06T13:53:55Z","oa_version":"Published Version","date_created":"2021-08-10T07:41:52Z","year":"2017","article_processing_charge":"No","author":[{"first_name":"Tom","last_name":"Schmidt","full_name":"Schmidt, Tom"},{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240"},{"full_name":"Rasic, Gordana","first_name":"Gordana","last_name":"Rasic"},{"first_name":"Andrew","last_name":"Turley","full_name":"Turley, Andrew"},{"first_name":"Brian","last_name":"Montgomery","full_name":"Montgomery, Brian"},{"full_name":"Iturbe Ormaetxe, Inaki","last_name":"Iturbe Ormaetxe","first_name":"Inaki"},{"full_name":"Cook, Peter","last_name":"Cook","first_name":"Peter"},{"full_name":"Ryan, Peter","last_name":"Ryan","first_name":"Peter"},{"last_name":"Ritchie","first_name":"Scott","full_name":"Ritchie, Scott"},{"last_name":"Hoffmann","first_name":"Ary","full_name":"Hoffmann, Ary"},{"full_name":"O’Neill, Scott","first_name":"Scott","last_name":"O’Neill"},{"full_name":"Turelli, Michael","first_name":"Michael","last_name":"Turelli"}],"title":"Supporting information concerning observed wMel frequencies and analyses of habitat variables","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"research_data_reference","date_published":"2017-05-30T00:00:00Z","citation":{"ieee":"T. Schmidt <i>et al.</i>, “Supporting information concerning observed wMel frequencies and analyses of habitat variables.” Public Library of Science, 2017.","mla":"Schmidt, Tom, et al. <i>Supporting Information Concerning Observed WMel Frequencies and Analyses of Habitat Variables</i>. Public Library of Science, 2017, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2001894.s015\">10.1371/journal.pbio.2001894.s015</a>.","short":"T. Schmidt, N.H. Barton, G. Rasic, A. Turley, B. Montgomery, I. Iturbe Ormaetxe, P. Cook, P. Ryan, S. Ritchie, A. Hoffmann, S. O’Neill, M. Turelli, (2017).","chicago":"Schmidt, Tom, Nicholas H Barton, Gordana Rasic, Andrew Turley, Brian Montgomery, Inaki Iturbe Ormaetxe, Peter Cook, et al. “Supporting Information Concerning Observed WMel Frequencies and Analyses of Habitat Variables.” Public Library of Science, 2017. <a href=\"https://doi.org/10.1371/journal.pbio.2001894.s015\">https://doi.org/10.1371/journal.pbio.2001894.s015</a>.","ista":"Schmidt T, Barton NH, Rasic G, Turley A, Montgomery B, Iturbe Ormaetxe I, Cook P, Ryan P, Ritchie S, Hoffmann A, O’Neill S, Turelli M. 2017. Supporting information concerning observed wMel frequencies and analyses of habitat variables, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pbio.2001894.s015\">10.1371/journal.pbio.2001894.s015</a>.","ama":"Schmidt T, Barton NH, Rasic G, et al. Supporting information concerning observed wMel frequencies and analyses of habitat variables. 2017. doi:<a href=\"https://doi.org/10.1371/journal.pbio.2001894.s015\">10.1371/journal.pbio.2001894.s015</a>","apa":"Schmidt, T., Barton, N. H., Rasic, G., Turley, A., Montgomery, B., Iturbe Ormaetxe, I., … Turelli, M. (2017). Supporting information concerning observed wMel frequencies and analyses of habitat variables. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2001894.s015\">https://doi.org/10.1371/journal.pbio.2001894.s015</a>"},"department":[{"_id":"NiBa"}],"day":"30","status":"public","fulldoi":"https://doi.org/10.1371/journal.pbio.2001894.s015","doi":"10.1371/journal.pbio.2001894.s015"},{"publication_identifier":{"issn":["2041-3181"]},"year":"2017","date_created":"2018-12-11T11:47:27Z","abstract":[{"text":"In several settings of physics and chemistry one has to deal with molecules interacting with some kind of an external environment, be it a gas, a solution, or a crystal surface. Understanding molecular processes in the presence of such a many-particle bath is inherently challenging, and usually requires large-scale numerical computations. Here, we present an alternative approach to the problem, based on the notion of the angulon quasiparticle. We show that molecules rotating inside superfluid helium nanodroplets and Bose–Einstein condensates form angulons, and therefore can be described by straightforward solutions of a simple microscopic Hamiltonian. Casting the problem in the language of angulons allows us not only to greatly simplify it, but also to gain insights into the origins of the observed phenomena and to make predictions for future experimental studies.","lang":"eng"}],"external_id":{"arxiv":["1703.06753"]},"publisher":"Royal Society of Chemistry","publication_status":"published","month":"12","_id":"604","arxiv":1,"fulldoi":"https://doi.org/10.1039/9781782626800-00444","status":"public","publist_id":"7201","language":[{"iso":"eng"}],"scopus_import":"1","department":[{"_id":"MiLe"}],"date_published":"2017-12-14T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","title":"Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets","author":[{"orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","last_name":"Lemeshko"},{"last_name":"Schmidt","first_name":"Richard","full_name":"Schmidt, Richard"}],"article_processing_charge":"No","editor":[{"full_name":"Dulieu, Oliver","last_name":"Dulieu","first_name":"Oliver"},{"last_name":"Osterwalder","first_name":"Andreas","full_name":"Osterwalder, Andreas"}],"publication":"Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero ","volume":11,"das_tickbox":"1","alternative_title":["Theoretical and Computational Chemistry Series"],"oa_version":"Submitted Version","date_updated":"2026-07-07T05:50:51Z","series_title":"Theoretical and Computational Chemistry Series","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.06753"}],"doi":"10.1039/9781782626800-00444","quality_controlled":"1","oa":1,"intvolume":"        11","page":"444 - 495","day":"14","citation":{"ista":"Lemeshko M, Schmidt R. 2017.Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Theoretical and Computational Chemistry Series, vol. 11, 444–495.","ama":"Lemeshko M, Schmidt R. Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Dulieu O, Osterwalder A, eds. <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i>. Vol 11. Theoretical and Computational Chemistry Series. Royal Society of Chemistry; 2017:444-495. doi:<a href=\"https://doi.org/10.1039/9781782626800-00444\">10.1039/9781782626800-00444</a>","apa":"Lemeshko, M., &#38; Schmidt, R. (2017). Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In O. Dulieu &#38; A. Osterwalder (Eds.), <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i> (Vol. 11, pp. 444–495). Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/9781782626800-00444\">https://doi.org/10.1039/9781782626800-00444</a>","ieee":"M. Lemeshko and R. Schmidt, “Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets,” in <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i>, vol. 11, O. Dulieu and A. Osterwalder, Eds. Royal Society of Chemistry, 2017, pp. 444–495.","mla":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i>, edited by Oliver Dulieu and Andreas Osterwalder, vol. 11, Royal Society of Chemistry, 2017, pp. 444–95, doi:<a href=\"https://doi.org/10.1039/9781782626800-00444\">10.1039/9781782626800-00444</a>.","short":"M. Lemeshko, R. Schmidt, in:, O. Dulieu, A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , Royal Society of Chemistry, 2017, pp. 444–495.","chicago":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” In <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i>, edited by Oliver Dulieu and Andreas Osterwalder, 11:444–95. Theoretical and Computational Chemistry Series. Royal Society of Chemistry, 2017. <a href=\"https://doi.org/10.1039/9781782626800-00444\">https://doi.org/10.1039/9781782626800-00444</a>."}},{"publication_status":"published","has_accepted_license":"1","publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","file":[{"file_size":125065,"checksum":"558c18bcf5580d87dd371ec626d52075","relation":"main_file","date_updated":"2020-07-14T12:48:09Z","content_type":"application/pdf","creator":"dernst","date_created":"2019-01-18T13:39:26Z","file_name":"2017_VOEB_Andrae.pdf","access_level":"open_access","file_id":"5851"}],"_id":"807","month":"08","publication_identifier":{"issn":["1022-2588"]},"popular_science":"1","abstract":[{"lang":"eng","text":"On January the 1st, 2016 a new agreement between 32 Austrian scientific libraries and the publisher Springer took its effect: this deal covers accessing the licensed content on the one hand, and publishing open access on the other hand. More than 1000 papers by Austrian authors were published open access at Springer in the first year alone. The working group &quot;Springer Compact Evaluierung&quot; made the data for these articles available via the platform OpenAPC and would like to use this opportunity to give a short account of what this publishing agreement actually entails and the working group intends to do."}],"date_created":"2018-12-11T11:48:36Z","year":"2017","language":[{"iso":"eng"}],"publist_id":"6843","status":"public","date_published":"2017-08-01T00:00:00Z","department":[{"_id":"E-Lib"}],"scopus_import":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"issue":"2","fulldoi":"https://doi.org/10.31263/voebm.v70i2.1898","das_tickbox":"1","oa_version":"Published Version","date_updated":"2026-07-07T06:08:32Z","file_date_updated":"2020-07-14T12:48:09Z","article_processing_charge":"No","author":[{"full_name":"Andrae, Magdalena","last_name":"Andrae","first_name":"Magdalena"},{"orcid":"0000-0001-8126-0426","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","full_name":"Villányi, Márton","first_name":"Márton","last_name":"Villányi"}],"title":"Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":70,"publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","ddc":["020"],"day":"01","page":"274 - 280","citation":{"ama":"Andrae M, Villányi M. Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. 2017;70(2):274-280. doi:<a href=\"https://doi.org/10.31263/voebm.v70i2.1898\">10.31263/voebm.v70i2.1898</a>","apa":"Andrae, M., &#38; Villányi, M. (2017). Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung. <i>Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. <a href=\"https://doi.org/10.31263/voebm.v70i2.1898\">https://doi.org/10.31263/voebm.v70i2.1898</a>","ista":"Andrae M, Villányi M. 2017. Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 70(2), 274–280.","mla":"Andrae, Magdalena, and Márton Villányi. “Der Springer Compact-Deal – Ein Erster Einblick in Die Evaluierung Einer Offsetting-Vereinbarung.” <i>Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare</i>, vol. 70, no. 2, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2017, pp. 274–80, doi:<a href=\"https://doi.org/10.31263/voebm.v70i2.1898\">10.31263/voebm.v70i2.1898</a>.","chicago":"Andrae, Magdalena, and Márton Villányi. “Der Springer Compact-Deal – Ein Erster Einblick in Die Evaluierung Einer Offsetting-Vereinbarung.” <i>Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2017. <a href=\"https://doi.org/10.31263/voebm.v70i2.1898\">https://doi.org/10.31263/voebm.v70i2.1898</a>.","short":"M. Andrae, M. Villányi, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare 70 (2017) 274–280.","ieee":"M. Andrae and M. Villányi, “Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung,” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>, vol. 70, no. 2. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 274–280, 2017."},"doi":"10.31263/voebm.v70i2.1898","intvolume":"        70","oa":1},{"_id":"823","month":"09","publisher":"IOP Publishing","external_id":{"arxiv":["1705.06303"],"isi":["000411842900001"]},"publication_status":"published","year":"2017","abstract":[{"text":"The resolution of a linear system with positive integer variables is a basic yet difficult computational problem with many applications. We consider sparse uncorrelated random systems parametrised by the density c and the ratio α=N/M between number of variables N and number of constraints M. By means of ensemble calculations we show that the space of feasible solutions endows a Van-Der-Waals phase diagram in the plane (c, α). We give numerical evidence that the associated computational problems become more difficult across the critical point and in particular in the coexistence region.","lang":"eng"}],"date_created":"2018-12-11T11:48:41Z","publication_identifier":{"issn":["1742-5468"]},"scopus_import":"1","department":[{"_id":"GaTk"}],"date_published":"2017-09-26T00:00:00Z","article_number":"093404","status":"public","language":[{"iso":"eng"}],"publist_id":"6826","fulldoi":"https://doi.org/10.1088/1742-5468/aa85c3","isi":1,"issue":"9","ec_funded":1,"arxiv":1,"das_tickbox":"1","oa_version":"Submitted Version","date_updated":"2026-07-07T13:11:04Z","volume":2017,"publication":"Journal of Statistical Mechanics: Theory and Experiment","author":[{"first_name":"Simona","last_name":"Colabrese","full_name":"Colabrese, Simona"},{"first_name":"Daniele","last_name":"De Martino","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","full_name":"De Martino, Daniele","orcid":"0000-0002-5214-4706"},{"full_name":"Leuzzi, Luca","first_name":"Luca","last_name":"Leuzzi"},{"first_name":"Enzo","last_name":"Marinari","full_name":"Marinari, Enzo"}],"title":"Phase transitions in integer linear problems","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","article_processing_charge":"No","citation":{"ieee":"S. Colabrese, D. De Martino, L. Leuzzi, and E. Marinari, “Phase transitions in integer linear problems,” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2017, no. 9. IOP Publishing, 2017.","chicago":"Colabrese, Simona, Daniele De Martino, Luca Leuzzi, and Enzo Marinari. “Phase Transitions in Integer Linear Problems.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing, 2017. <a href=\"https://doi.org/10.1088/1742-5468/aa85c3\">https://doi.org/10.1088/1742-5468/aa85c3</a>.","short":"S. Colabrese, D. De Martino, L. Leuzzi, E. Marinari, Journal of Statistical Mechanics: Theory and Experiment 2017 (2017).","mla":"Colabrese, Simona, et al. “Phase Transitions in Integer Linear Problems.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2017, no. 9, 093404, IOP Publishing, 2017, doi:<a href=\"https://doi.org/10.1088/1742-5468/aa85c3\">10.1088/1742-5468/aa85c3</a>.","ista":"Colabrese S, De Martino D, Leuzzi L, Marinari E. 2017. Phase transitions in integer linear problems. Journal of Statistical Mechanics: Theory and Experiment. 2017(9), 093404.","apa":"Colabrese, S., De Martino, D., Leuzzi, L., &#38; Marinari, E. (2017). Phase transitions in integer linear problems. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-5468/aa85c3\">https://doi.org/10.1088/1742-5468/aa85c3</a>","ama":"Colabrese S, De Martino D, Leuzzi L, Marinari E. Phase transitions in integer linear problems. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. 2017;2017(9). doi:<a href=\"https://doi.org/10.1088/1742-5468/aa85c3\">10.1088/1742-5468/aa85c3</a>"},"day":"26","quality_controlled":"1","intvolume":"      2017","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.06303"}],"project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"doi":"10.1088/1742-5468/aa85c3"},{"publication_identifier":{"issn":["0022-2488"]},"year":"2017","date_created":"2018-12-11T11:49:10Z","abstract":[{"lang":"eng","text":"We consider a many-body system of fermionic atoms interacting via a local pair potential and subject to an external potential within the framework of Bardeen-Cooper-Schrieffer (BCS) theory. We measure the free energy of the whole sample with respect to the free energy of a reference state which allows us to define a BCS functional with boundary conditions at infinity. Our main result is a lower bound for this energy functional in terms of expressions that typically appear in Ginzburg-Landau functionals.\r\n"}],"external_id":{"isi":["000409197200015"],"arxiv":["1703.04616"]},"publisher":"AIP Publishing","publication_status":"published","month":"08","_id":"912","arxiv":1,"fulldoi":"https://doi.org/10.1063/1.4996580","ec_funded":1,"issue":"8","isi":1,"status":"public","publist_id":"6531","language":[{"iso":"eng"}],"corr_author":"1","scopus_import":"1","department":[{"_id":"RoSe"}],"article_number":"081901","date_published":"2017-08-01T00:00:00Z","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0003-3146-6746","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","full_name":"Deuchert, Andreas","last_name":"Deuchert","first_name":"Andreas"}],"title":"A lower bound for the BCS functional with boundary conditions at infinity","article_processing_charge":"No","publication":"Journal of Mathematical Physics","volume":58,"das_tickbox":"1","oa_version":"Submitted Version","date_updated":"2026-07-07T13:10:46Z","main_file_link":[{"url":"https://arxiv.org/abs/1703.04616","open_access":"1"}],"project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"doi":"10.1063/1.4996580","quality_controlled":"1","oa":1,"intvolume":"        58","day":"01","citation":{"ieee":"A. Deuchert, “A lower bound for the BCS functional with boundary conditions at infinity,” <i>Journal of Mathematical Physics</i>, vol. 58, no. 8. AIP Publishing, 2017.","mla":"Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary Conditions at Infinity.” <i>Journal of Mathematical Physics</i>, vol. 58, no. 8, 081901, AIP Publishing, 2017, doi:<a href=\"https://doi.org/10.1063/1.4996580\">10.1063/1.4996580</a>.","short":"A. Deuchert, Journal of Mathematical Physics 58 (2017).","chicago":"Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary Conditions at Infinity.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2017. <a href=\"https://doi.org/10.1063/1.4996580\">https://doi.org/10.1063/1.4996580</a>.","ista":"Deuchert A. 2017. A lower bound for the BCS functional with boundary conditions at infinity. Journal of Mathematical Physics. 58(8), 081901.","ama":"Deuchert A. A lower bound for the BCS functional with boundary conditions at infinity. <i>Journal of Mathematical Physics</i>. 2017;58(8). doi:<a href=\"https://doi.org/10.1063/1.4996580\">10.1063/1.4996580</a>","apa":"Deuchert, A. (2017). A lower bound for the BCS functional with boundary conditions at infinity. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.4996580\">https://doi.org/10.1063/1.4996580</a>"}},{"citation":{"ieee":"T. Priklopil, K. Chatterjee, and M. Nowak, “Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma,” <i>Journal of Theoretical Biology</i>, vol. 433. Elsevier, pp. 64–72, 2017.","chicago":"Priklopil, Tadeas, Krishnendu Chatterjee, and Martin Nowak. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” <i>Journal of Theoretical Biology</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.jtbi.2017.08.025\">https://doi.org/10.1016/j.jtbi.2017.08.025</a>.","short":"T. Priklopil, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 433 (2017) 64–72.","mla":"Priklopil, Tadeas, et al. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” <i>Journal of Theoretical Biology</i>, vol. 433, Elsevier, 2017, pp. 64–72, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2017.08.025\">10.1016/j.jtbi.2017.08.025</a>.","ista":"Priklopil T, Chatterjee K, Nowak M. 2017. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. 433, 64–72.","apa":"Priklopil, T., Chatterjee, K., &#38; Nowak, M. (2017). Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2017.08.025\">https://doi.org/10.1016/j.jtbi.2017.08.025</a>","ama":"Priklopil T, Chatterjee K, Nowak M. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. <i>Journal of Theoretical Biology</i>. 2017;433:64-72. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2017.08.025\">10.1016/j.jtbi.2017.08.025</a>"},"day":"21","article_type":"original","page":"64 - 72","intvolume":"       433","oa":1,"quality_controlled":"1","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","doi":"10.1016/j.jtbi.2017.08.025","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"file_date_updated":"2020-07-14T12:47:58Z","oa_version":"Submitted Version","date_updated":"2026-07-07T13:11:54Z","das_tickbox":"1","volume":433,"publication":"Journal of Theoretical Biology","ddc":["000","570"],"article_processing_charge":"No","title":"Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma","author":[{"full_name":"Priklopil, Tadeas","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","first_name":"Tadeas","last_name":"Priklopil"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-11-21T00:00:00Z","corr_author":"1","department":[{"_id":"KrCh"}],"scopus_import":"1","language":[{"iso":"eng"}],"publist_id":"6923","status":"public","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"isi":1,"ec_funded":1,"pmid":1,"fulldoi":"https://doi.org/10.1016/j.jtbi.2017.08.025","month":"11","_id":"744","publication_status":"published","has_accepted_license":"1","publisher":"Elsevier","file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:47:58Z","relation":"main_file","file_size":537323,"checksum":"4b43af1615ebf1a861840cb03d8a320c","access_level":"open_access","file_id":"7047","file_name":"2017_JournTheoretBio_Priklopil.pdf","date_created":"2019-11-19T07:57:39Z","creator":"dernst"}],"external_id":{"isi":["000412039800007"],"pmid":["28867224"]},"abstract":[{"text":"In evolutionary game theory interactions between individuals are often assumed obligatory. However, in many real-life situations, individuals can decide to opt out of an interaction depending on the information they have about the opponent. We consider a simple evolutionary game theoretic model to study such a scenario, where at each encounter between two individuals the type of the opponent (cooperator/defector) is known with some probability, and where each individual either accepts or opts out of the interaction. If the type of the opponent is unknown, a trustful individual accepts the interaction, whereas a suspicious individual opts out of the interaction. If either of the two individuals opt out both individuals remain without an interaction. We show that in the prisoners dilemma optional interactions along with suspicious behaviour facilitates the emergence of trustful cooperation.","lang":"eng"}],"date_created":"2018-12-11T11:48:16Z","year":"2017","publication_identifier":{"issn":["0022-5193"]}},{"department":[{"_id":"MiLe"}],"scopus_import":"1","article_number":"023403","date_published":"2017-02-01T00:00:00Z","status":"public","publist_id":"6305","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1103/PhysRevA.95.023403","ec_funded":1,"issue":"2","isi":1,"arxiv":1,"month":"02","_id":"1076","external_id":{"arxiv":["1609.07018"],"isi":["000400571700011"]},"publisher":"American Physical Society","publication_status":"published","year":"2017","date_created":"2018-12-11T11:50:01Z","abstract":[{"lang":"eng","text":"Signatures of the Coulomb corrections in the photoelectron momentum distribution during laser-induced ionization of atoms or ions in tunneling and multiphoton regimes are investigated analytically in the case of a one-dimensional problem. A high-order Coulomb-corrected strong-field approximation is applied, where the exact continuum state in the S matrix is approximated by the eikonal Coulomb-Volkov state including the second-order corrections to the eikonal. Although without high-order corrections our theory coincides with the known analytical R-matrix (ARM) theory, we propose a simplified procedure for the matrix element derivation. Rather than matching the eikonal Coulomb-Volkov wave function with the bound state as in the ARM theory to remove the Coulomb singularity, we calculate the matrix element via the saddle-point integration method by time as well as by coordinate, and in this way avoiding the Coulomb singularity. The momentum shift in the photoelectron momentum distribution with respect to the ARM theory due to high-order corrections is analyzed for tunneling and multiphoton regimes. The relation of the quantum corrections to the tunneling delay time is discussed."}],"publication_identifier":{"issn":["2469-9926"]},"citation":{"mla":"Klaiber, Michael, et al. “Strong-Field Ionization via a High-Order Coulomb-Corrected Strong-Field Approximation.” <i>Physical Review A</i>, vol. 95, no. 2, 023403, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevA.95.023403\">10.1103/PhysRevA.95.023403</a>.","short":"M. Klaiber, J. Daněk, E. Yakaboylu, K. Hatsagortsyan, C. Keitel, Physical Review A 95 (2017).","chicago":"Klaiber, Michael, Jiří Daněk, Enderalp Yakaboylu, Karen Hatsagortsyan, and Christoph Keitel. “Strong-Field Ionization via a High-Order Coulomb-Corrected Strong-Field Approximation.” <i>Physical Review A</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevA.95.023403\">https://doi.org/10.1103/PhysRevA.95.023403</a>.","ieee":"M. Klaiber, J. Daněk, E. Yakaboylu, K. Hatsagortsyan, and C. Keitel, “Strong-field ionization via a high-order Coulomb-corrected strong-field approximation,” <i>Physical Review A</i>, vol. 95, no. 2. American Physical Society, 2017.","ama":"Klaiber M, Daněk J, Yakaboylu E, Hatsagortsyan K, Keitel C. Strong-field ionization via a high-order Coulomb-corrected strong-field approximation. <i>Physical Review A</i>. 2017;95(2). doi:<a href=\"https://doi.org/10.1103/PhysRevA.95.023403\">10.1103/PhysRevA.95.023403</a>","apa":"Klaiber, M., Daněk, J., Yakaboylu, E., Hatsagortsyan, K., &#38; Keitel, C. (2017). Strong-field ionization via a high-order Coulomb-corrected strong-field approximation. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.95.023403\">https://doi.org/10.1103/PhysRevA.95.023403</a>","ista":"Klaiber M, Daněk J, Yakaboylu E, Hatsagortsyan K, Keitel C. 2017. Strong-field ionization via a high-order Coulomb-corrected strong-field approximation. Physical Review A. 95(2), 023403."},"day":"01","quality_controlled":"1","oa":1,"intvolume":"        95","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1609.07018"}],"doi":"10.1103/PhysRevA.95.023403","das_tickbox":"1","date_updated":"2026-07-07T13:17:34Z","oa_version":"Submitted Version","publication":"Physical Review A","volume":95,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","author":[{"full_name":"Klaiber, Michael","last_name":"Klaiber","first_name":"Michael"},{"last_name":"Daněk","first_name":"Jiří","full_name":"Daněk, Jiří"},{"orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","full_name":"Yakaboylu, Enderalp","last_name":"Yakaboylu","first_name":"Enderalp"},{"last_name":"Hatsagortsyan","first_name":"Karen","full_name":"Hatsagortsyan, Karen"},{"full_name":"Keitel, Christoph","first_name":"Christoph","last_name":"Keitel"}],"title":"Strong-field ionization via a high-order Coulomb-corrected strong-field approximation","article_processing_charge":"No"},{"quality_controlled":"1","oa":1,"project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://arxiv.org/abs/1702.01666","open_access":"1"}],"doi":"10.1109/isit.2017.8006529","citation":{"ama":"Skórski M. On the complexity of estimating Rènyi divergences. In: <i>2017 IEEE International Symposium on Information Theory</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/isit.2017.8006529\">10.1109/isit.2017.8006529</a>","apa":"Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In <i>2017 IEEE International Symposium on Information Theory</i>. Aachen, Germany: IEEE. <a href=\"https://doi.org/10.1109/isit.2017.8006529\">https://doi.org/10.1109/isit.2017.8006529</a>","ista":"Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 8006529.","mla":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” <i>2017 IEEE International Symposium on Information Theory</i>, 8006529, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/isit.2017.8006529\">10.1109/isit.2017.8006529</a>.","chicago":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” In <i>2017 IEEE International Symposium on Information Theory</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/isit.2017.8006529\">https://doi.org/10.1109/isit.2017.8006529</a>.","short":"M. Skórski, in:, 2017 IEEE International Symposium on Information Theory, IEEE, 2017.","ieee":"M. Skórski, “On the complexity of estimating Rènyi divergences,” in <i>2017 IEEE International Symposium on Information Theory</i>, Aachen, Germany, 2017."},"day":"09","publication":"2017 IEEE International Symposium on Information Theory","title":"On the complexity of estimating Rènyi divergences","author":[{"full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski","first_name":"Maciej"}],"type":"conference","conference":{"location":"Aachen, Germany","end_date":"2017-06-30","start_date":"2017-06-25","name":"ISIT: International Symposium on Information Theory"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","date_updated":"2026-07-07T13:32:59Z","oa_version":"Preprint","das_tickbox":"1","fulldoi":"https://doi.org/10.1109/isit.2017.8006529","ec_funded":1,"arxiv":1,"scopus_import":"1","department":[{"_id":"KrPi"}],"date_published":"2017-08-09T00:00:00Z","article_number":"8006529","status":"public","language":[{"iso":"eng"}],"year":"2017","abstract":[{"text":"This paper studies the complexity of estimating Rényi divergences of discrete distributions: p observed from samples and the baseline distribution q known a priori. Extending the results of Acharya et al. (SODA'15) on estimating Rényi entropy, we present improved estimation techniques together with upper and lower bounds on the sample complexity. We show that, contrarily to estimating Rényi entropy where a sublinear (in the alphabet size) number of samples suffices, the sample complexity is heavily dependent on events occurring unlikely in q, and is unbounded in general (no matter what an estimation technique is used). For any divergence of integer order bigger than 1, we provide upper and lower bounds on the number of samples dependent on probabilities of p and q (the lower bounds hold for non-integer orders as well). We conclude that the worst-case sample complexity is polynomial in the alphabet size if and only if the probabilities of q are non-negligible. This gives theoretical insights into heuristics used in the applied literature to handle numerical instability, which occurs for small probabilities of q. Our result shows that they should be handled with care not only because of numerical issues, but also because of a blow up in the sample complexity.","lang":"eng"}],"date_created":"2019-06-06T12:53:09Z","publication_identifier":{"isbn":["9781509040964"]},"month":"08","_id":"6526","publisher":"IEEE","external_id":{"arxiv":["1702.01666"]},"publication_status":"published"},{"day":"01","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” <i>ACM Transactions on Computational Logic</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3152769\">https://doi.org/10.1145/3152769</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic 18 (2017).","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” <i>ACM Transactions on Computational Logic</i>, vol. 18, no. 4, 31, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3152769\">10.1145/3152769</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” <i>ACM Transactions on Computational Logic</i>, vol. 18, no. 4. ACM, 2017.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2017). Nested weighted automata. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/3152769\">https://doi.org/10.1145/3152769</a>","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. <i>ACM Transactions on Computational Logic</i>. 2017;18(4). doi:<a href=\"https://doi.org/10.1145/3152769\">10.1145/3152769</a>","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic. 18(4), 31."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.03598"}],"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1145/3152769","quality_controlled":"1","intvolume":"        18","oa":1,"das_tickbox":"1","oa_version":"Preprint","date_updated":"2026-07-07T14:01:10Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5415"},{"status":"public","relation":"earlier_version","id":"5436"},{"id":"1656","relation":"earlier_version","status":"public"}]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop"}],"title":"Nested weighted automata","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","article_processing_charge":"No","volume":18,"publication":"ACM Transactions on Computational Logic","status":"public","language":[{"iso":"eng"}],"publist_id":"7354","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"scopus_import":"1","corr_author":"1","date_published":"2017-12-01T00:00:00Z","article_number":"31","arxiv":1,"fulldoi":"https://doi.org/10.1145/3152769","isi":1,"ec_funded":1,"issue":"4","publisher":"ACM","external_id":{"isi":["000419237100006"],"arxiv":["1606.03598"]},"publication_status":"published","month":"12","_id":"467","publication_identifier":{"issn":["1529-3785"]},"year":"2017","abstract":[{"text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.","lang":"eng"}],"date_created":"2018-12-11T11:46:38Z"},{"article_type":"original","extern":"1","page":"614-642","day":"09","citation":{"ista":"Connelly R, Funkhouser M, Kuperberg VZ, Solomonides E. 2017. Packings of equal disks in a square torus. Discrete &#38; Computational Geometry. 58(3), 614–642.","apa":"Connelly, R., Funkhouser, M., Kuperberg, V. Z., &#38; Solomonides, E. (2017). Packings of equal disks in a square torus. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-016-9843-x\">https://doi.org/10.1007/s00454-016-9843-x</a>","ama":"Connelly R, Funkhouser M, Kuperberg VZ, Solomonides E. Packings of equal disks in a square torus. <i>Discrete &#38; Computational Geometry</i>. 2017;58(3):614-642. doi:<a href=\"https://doi.org/10.1007/s00454-016-9843-x\">10.1007/s00454-016-9843-x</a>","ieee":"R. Connelly, M. Funkhouser, V. Z. Kuperberg, and E. Solomonides, “Packings of equal disks in a square torus,” <i>Discrete &#38; Computational Geometry</i>, vol. 58, no. 3. Springer Nature, pp. 614–642, 2017.","chicago":"Connelly, Robert, Matthew Funkhouser, Vivian Zieve Kuperberg, and Evan Solomonides. “Packings of Equal Disks in a Square Torus.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/s00454-016-9843-x\">https://doi.org/10.1007/s00454-016-9843-x</a>.","short":"R. Connelly, M. Funkhouser, V.Z. Kuperberg, E. Solomonides, Discrete &#38; Computational Geometry 58 (2017) 614–642.","mla":"Connelly, Robert, et al. “Packings of Equal Disks in a Square Torus.” <i>Discrete &#38; Computational Geometry</i>, vol. 58, no. 3, Springer Nature, 2017, pp. 614–42, doi:<a href=\"https://doi.org/10.1007/s00454-016-9843-x\">10.1007/s00454-016-9843-x</a>."},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1512.08762"}],"doi":"10.1007/s00454-016-9843-x","quality_controlled":"1","intvolume":"        58","oa_version":"Preprint","date_updated":"2026-07-14T11:14:51Z","OA_place":"repository","author":[{"full_name":"Connelly, Robert","first_name":"Robert","last_name":"Connelly"},{"full_name":"Funkhouser, Matthew","last_name":"Funkhouser","first_name":"Matthew"},{"first_name":"Vivian Zieve","last_name":"Kuperberg","full_name":"Kuperberg, Vivian Zieve","id":"c3bac823-112d-11f0-a3f5-c264f852e697"},{"first_name":"Evan","last_name":"Solomonides","full_name":"Solomonides, Evan"}],"title":"Packings of equal disks in a square torus","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","volume":58,"publication":"Discrete & Computational Geometry","status":"public","language":[{"iso":"eng"}],"scopus_import":"1","date_published":"2017-01-09T00:00:00Z","arxiv":1,"fulldoi":"https://doi.org/10.1007/s00454-016-9843-x","issue":"3","publisher":"Springer Nature","external_id":{"arxiv":["1512.08762"]},"publication_status":"published","_id":"22198","month":"01","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"year":"2017","abstract":[{"lang":"eng","text":"Packings of equal disks in the plane are known to have density at most\r\nπ/\r\n√\r\n12, although this density is never achieved in the square torus, which is what we\r\ncall the plane modulo the square lattice. We find packings of disks in a square torus\r\nthat we conjecture to be the most dense for certain numbers of packing disks, using\r\ncontinued fractions to approximate 1/\r\n√\r\n3 and 2 −\r\n√\r\n3. We also define a constant to\r\nmeasure the efficiency of a packing motived by a related constant due to Markov for\r\ncontinued fractions. One idea is to use the unique factorization property of Gaussian\r\nintegers to prove that there is an upper bound for the Markov constant for grid-like\r\npackings. By way of contrast, we show that an upper bound by Gruber [In many cases\r\noptimal configurations are almost regular hexagonal, vol. 65, pp. 121–145, 1999;Geom\r\nDedicata 84(1–3):271–320, 2001] for the error for the limiting density of a packing\r\nof equal disks in a planar square, which is on the order of 1/\r\n√\r\nN, is the best possible,\r\nwhereas for our examples for the square torus, the error for the limiting density is on\r\nthe order of 1/N, where N is the number of packing disks."}],"OA_type":"green","date_created":"2026-06-29T12:58:50Z"},{"date_created":"2019-04-09T15:04:32Z","abstract":[{"lang":"eng","text":"The main objects considered in the present work are simplicial and CW-complexes with vertices forming a random point cloud. In particular, we consider a Poisson point process in R^n and study Delaunay and Voronoi complexes of the first and higher orders and weighted Delaunay complexes obtained as sections of Delaunay complexes, as well as the Čech complex. Further, we examine theDelaunay complex of a Poisson point process on the sphere S^n, as well as of a uniform point cloud, which is equivalent to the convex hull, providing a connection to the theory of random polytopes. Each of the complexes in question can be endowed with a radius function, which maps its cells to the radii of appropriately chosen circumspheres, called the radius of the cell. Applying and developing discrete Morse theory for these functions, joining it together with probabilistic and sometimes analytic machinery, and developing several integral geometric tools, we aim at getting the distributions of circumradii of typical cells. For all considered complexes, we are able to generalize and obtain up to constants the distribution of radii of typical intervals of all types. In low dimensions the constants can be computed explicitly, thus providing the explicit expressions for the expected numbers of cells. In particular, it allows to find the expected density of simplices of every dimension for a Poisson point process in R^4, whereas the result for R^3 was known already in 1970's."}],"pubrep_id":"873","year":"2017","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"_id":"6287","month":"10","has_accepted_license":"1","publication_status":"published","publisher":"Institute of Science and Technology Austria","file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:47:26Z","relation":"main_file","file_size":2324870,"checksum":"ece7e598a2f060b263c2febf7f3fe7f9","file_id":"6289","access_level":"open_access","file_name":"2017_Thesis_Nikitenko.pdf","date_created":"2019-04-09T14:54:51Z","creator":"dernst"},{"content_type":"application/zip","date_updated":"2020-07-14T12:47:26Z","relation":"source_file","file_size":2863219,"checksum":"99b7ad76e317efd447af60f91e29b49b","access_level":"closed","file_id":"6290","file_name":"2017_Thesis_Nikitenko_source.zip","date_created":"2019-04-09T14:54:51Z","creator":"dernst"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"fulldoi":"https://doi.org/10.15479/AT:ISTA:th_873","date_published":"2017-10-27T00:00:00Z","department":[{"_id":"HeEd"}],"corr_author":"1","language":[{"iso":"eng"}],"status":"public","degree_awarded":"PhD","ddc":["514","516","519"],"article_processing_charge":"No","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","type":"dissertation","title":"Discrete Morse theory for random complexes ","author":[{"first_name":"Anton","last_name":"Nikitenko","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","full_name":"Nikitenko, Anton","orcid":"0000-0002-0659-3201"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"87","status":"public"},{"id":"718","relation":"part_of_dissertation","status":"public"},{"id":"5678","relation":"part_of_dissertation","status":"public"}]},"OA_place":"publisher","file_date_updated":"2020-07-14T12:47:26Z","oa_version":"Published Version","date_updated":"2026-07-28T13:38:07Z","alternative_title":["ISTA Thesis"],"oa":1,"doi":"10.15479/AT:ISTA:th_873","citation":{"ista":"Nikitenko A. 2017. Discrete Morse theory for random complexes . Institute of Science and Technology Austria.","ama":"Nikitenko A. Discrete Morse theory for random complexes . 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">10.15479/AT:ISTA:th_873</a>","apa":"Nikitenko, A. (2017). <i>Discrete Morse theory for random complexes </i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">https://doi.org/10.15479/AT:ISTA:th_873</a>","ieee":"A. Nikitenko, “Discrete Morse theory for random complexes ,” Institute of Science and Technology Austria, 2017.","mla":"Nikitenko, Anton. <i>Discrete Morse Theory for Random Complexes </i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">10.15479/AT:ISTA:th_873</a>.","chicago":"Nikitenko, Anton. “Discrete Morse Theory for Random Complexes .” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">https://doi.org/10.15479/AT:ISTA:th_873</a>.","short":"A. Nikitenko, Discrete Morse Theory for Random Complexes , Institute of Science and Technology Austria, 2017."},"day":"27","page":"86"},{"status":"public","publist_id":"6233","language":[{"iso":"eng"}],"corr_author":"1","department":[{"_id":"JiFr"},{"_id":"GradSch"}],"acknowledgement":"I would like to first acknowledge my supervisor Jiří Friml for support, kind advice and patience. It was a pleasure to be a part of your lab, Jiří. I will remember the atmosphere present in auxin lab at VIB in Ghent and at IST in Klosterneuburg forever. I would like to thank all past and present lab members for the friendship and friendly and scientific environment in the groups. It was so nice to cooperate with you, guys. There was always someone who helped me with experiments, troubleshoot issues coming from our work etc. At this place, I would like to thank especially to Gergo Molnár. I’m happy (and lucky) that I have met him; he naturally became my tutor and guide through my PhD. From no one else during my entire professional career, I’ve learned that much.","date_published":"2017-01-12T00:00:00Z","doi_confirm":"1","publisher":"Institute of Science and Technology Austria","file":[{"relation":"main_file","file_size":10285946,"checksum":"d192c7c6c5ea32c8432437286dc4909e","content_type":"application/pdf","date_updated":"2019-04-05T08:45:14Z","date_created":"2019-04-05T08:45:14Z","creator":"dernst","file_id":"6209","access_level":"closed","file_name":"IST_Austria_Thesis_Tomáš_Prát.pdf"},{"file_name":"2017_Thesis_Prat.pdf","access_level":"open_access","file_id":"9185","creator":"dernst","success":1,"date_created":"2021-02-22T11:52:56Z","date_updated":"2021-02-22T11:52:56Z","content_type":"application/pdf","file_size":9802991,"checksum":"bab18b52cf98145926042d8ed99fdb3b","relation":"main_file"}],"has_accepted_license":"1","publication_status":"published","supervisor":[{"first_name":"Jiří","last_name":"Friml","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"}],"_id":"1127","month":"01","publication_identifier":{"issn":["2663-337X"]},"year":"2017","date_created":"2018-12-11T11:50:17Z","abstract":[{"text":"Plant hormone auxin and its transport between cells belong to the most important\r\nmechanisms controlling plant development. Auxin itself could change localization of PINs and\r\nthereby control direction of its own flow. We performed an expression profiling experiment\r\nin Arabidopsis roots to identify potential regulators of PIN polarity which are transcriptionally\r\nregulated by auxin signalling. We identified several novel regulators and performed a detailed\r\ncharacterization of the transcription factor WRKY23 (At2g47260) and its role in auxin\r\nfeedback on PIN polarity. Gain-of-function and dominant-negative mutants revealed that\r\nWRKY23 plays a crucial role in mediating the auxin effect on PIN polarity. In concordance,\r\ntypical polar auxin transport processes such as gravitropism and leaf vascular pattern\r\nformation were disturbed by interfering with WRKY23 function.\r\nIn order to identify direct targets of WRKY23, we performed consequential expression\r\nprofiling experiments using a WRKY23 inducible gain-of-function line and dominant-negative\r\nWRKY23 line that is defunct in PIN re-arrangement. Among several genes mostly related to\r\nthe groups of cell wall and defense process regulators, we identified LYSINE-HISTIDINE\r\nTRANSPORTER 1 (LHT1; At5g40780), a small amino acid permease gene from the amino\r\nacid/auxin permease family (AAAP), we present its detailed characterisation in auxin feedback\r\non PIN repolarization, identified its transcriptional regulation, we propose a potential\r\nmechanism of its action. Moreover, we identified also a member of receptor-like protein\r\nkinase LRR-RLK (LEUCINE-RICH REPEAT TRANSMEMBRANE PROTEIN KINASE PROTEIN 1;\r\nLRRK1; At1g05700), which also affects auxin-dependent PIN re-arrangement. We described\r\nits transcriptional behaviour, subcellular localization. Based on global expression data, we\r\ntried to identify ligand responsible for mechanism of signalling and suggest signalling partner\r\nand interactors. Additionally, we described role of novel phytohormone group, strigolactone,\r\nin auxin-dependent PIN re-arrangement, that could be a fundament for future studies in this\r\nfield.\r\nOur results provide first insights into an auxin transcriptional network targeting PIN\r\nlocalization and thus regulating plant development. We highlighted WRKY23 transcriptional\r\nnetwork and characterised its mediatory role in plant development. We identified direct\r\neffectors of this network, LHT1 and LRRK1, and describe their roles in PIN re-arrangement and\r\nPIN-dependent auxin transport processes.","lang":"eng"}],"page":"131","day":"12","citation":{"ista":"Prat T. 2017. Identification of novel regulators of PIN polarity and development of novel auxin sensor. Institute of Science and Technology Austria.","apa":"Prat, T. (2017). <i>Identification of novel regulators of PIN polarity and development of novel auxin sensor</i>. Institute of Science and Technology Austria.","ama":"Prat T. Identification of novel regulators of PIN polarity and development of novel auxin sensor. 2017.","ieee":"T. Prat, “Identification of novel regulators of PIN polarity and development of novel auxin sensor,” Institute of Science and Technology Austria, 2017.","short":"T. Prat, Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor, Institute of Science and Technology Austria, 2017.","chicago":"Prat, Tomas. “Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor.” Institute of Science and Technology Austria, 2017.","mla":"Prat, Tomas. <i>Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor</i>. Institute of Science and Technology Austria, 2017."},"oa":1,"alternative_title":["ISTA Thesis"],"date_updated":"2026-07-29T12:01:27Z","oa_version":"Published Version","OA_place":"publisher","file_date_updated":"2021-02-22T11:52:56Z","related_material":{"record":[{"id":"449","relation":"part_of_dissertation","status":"public"}]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"dissertation","author":[{"first_name":"Tomas","last_name":"Prat","id":"3DA3BFEE-F248-11E8-B48F-1D18A9856A87","full_name":"Prat, Tomas"}],"title":"Identification of novel regulators of PIN polarity and development of novel auxin sensor","article_processing_charge":"No","ddc":["580"],"degree_awarded":"PhD"}]