[{"page":"87 - 116","type":"conference","publication_status":"published","date_published":"2016-05-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"fulldoi":"https://doi.org/10.1007/978-3-662-49890-3_4","_id":"1366","year":"2016","month":"05","isi":1,"scopus_import":"1","project":[{"name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"259668"}],"status":"public","publist_id":"5872","main_file_link":[{"url":"https://eprint.iacr.org/2016/169/20160219:201940","open_access":"1"}],"publisher":"Springer","external_id":{"isi":["000389727400004"]},"doi":"10.1007/978-3-662-49890-3_4","quality_controlled":"1","department":[{"_id":"KrPi"}],"corr_author":"1","intvolume":"      9665","author":[{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter","last_name":"Gazi","first_name":"Peter"},{"last_name":"Tessaro","full_name":"Tessaro, Stefano","first_name":"Stefano"}],"date_updated":"2025-09-22T07:40:51Z","ec_funded":1,"date_created":"2018-12-11T11:51:36Z","alternative_title":["LNCS"],"conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","end_date":"2016-05-12","start_date":"2016-05-08","location":"Vienna, Austria"},"language":[{"iso":"eng"}],"volume":9665,"citation":{"ista":"Gazi P, Tessaro S. 2016. Provably robust sponge-based PRNGs and KDFs. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9665, 87–116.","ama":"Gazi P, Tessaro S. Provably robust sponge-based PRNGs and KDFs. In: Vol 9665. Springer; 2016:87-116. doi:<a href=\"https://doi.org/10.1007/978-3-662-49890-3_4\">10.1007/978-3-662-49890-3_4</a>","ieee":"P. Gazi and S. Tessaro, “Provably robust sponge-based PRNGs and KDFs,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9665, pp. 87–116.","chicago":"Gazi, Peter, and Stefano Tessaro. “Provably Robust Sponge-Based PRNGs and KDFs,” 9665:87–116. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49890-3_4\">https://doi.org/10.1007/978-3-662-49890-3_4</a>.","short":"P. Gazi, S. Tessaro, in:, Springer, 2016, pp. 87–116.","mla":"Gazi, Peter, and Stefano Tessaro. <i>Provably Robust Sponge-Based PRNGs and KDFs</i>. Vol. 9665, Springer, 2016, pp. 87–116, doi:<a href=\"https://doi.org/10.1007/978-3-662-49890-3_4\">10.1007/978-3-662-49890-3_4</a>.","apa":"Gazi, P., &#38; Tessaro, S. (2016). Provably robust sponge-based PRNGs and KDFs (Vol. 9665, pp. 87–116). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49890-3_4\">https://doi.org/10.1007/978-3-662-49890-3_4</a>"},"day":"01","oa_version":"Preprint","abstract":[{"text":"We study the problem of devising provably secure PRNGs with input based on the sponge paradigm. Such constructions are very appealing, as efficient software/hardware implementations of SHA-3 can easily be translated into a PRNG in a nearly black-box way. The only existing sponge-based construction, proposed by Bertoni et al. (CHES 2010), fails to achieve the security notion of robustness recently considered by Dodis et al. (CCS 2013), for two reasons: (1) The construction is deterministic, and thus there are high-entropy input distributions on which the construction fails to extract random bits, and (2) The construction is not forward secure, and presented solutions aiming at restoring forward security have not been rigorously analyzed. We propose a seeded variant of Bertoni et al.’s PRNG with input which we prove secure in the sense of robustness, delivering in particular concrete security bounds. On the way, we make what we believe to be an important conceptual contribution, developing a variant of the security framework of Dodis et al. tailored at the ideal permutation model that captures PRNG security in settings where the weakly random inputs are provided from a large class of possible adversarial samplers which are also allowed to query the random permutation. As a further application of our techniques, we also present an efficient sponge-based key-derivation function (which can be instantiated from SHA-3 in a black-box fashion), which we also prove secure when fed with samples from permutation-dependent distributions.","lang":"eng"}],"title":"Provably robust sponge-based PRNGs and KDFs","article_processing_charge":"No"},{"day":"15","oa_version":"Preprint","alternative_title":["LNCS"],"conference":{"name":"ECCV: European Conference on Computer Vision","end_date":"2016-10-14","start_date":"2016-10-11","location":"Amsterdam, The Netherlands"},"language":[{"iso":"eng"}],"volume":9908,"citation":{"ista":"Kolesnikov A, Lampert C. 2016. Seed, expand and constrain: Three principles for weakly-supervised image segmentation. ECCV: European Conference on Computer Vision, LNCS, vol. 9908, 695–711.","short":"A. Kolesnikov, C. Lampert, in:, Springer, 2016, pp. 695–711.","mla":"Kolesnikov, Alexander, and Christoph Lampert. <i>Seed, Expand and Constrain: Three Principles for Weakly-Supervised Image Segmentation</i>. Vol. 9908, Springer, 2016, pp. 695–711, doi:<a href=\"https://doi.org/10.1007/978-3-319-46493-0_42\">10.1007/978-3-319-46493-0_42</a>.","apa":"Kolesnikov, A., &#38; Lampert, C. (2016). Seed, expand and constrain: Three principles for weakly-supervised image segmentation (Vol. 9908, pp. 695–711). Presented at the ECCV: European Conference on Computer Vision, Amsterdam, The Netherlands: Springer. <a href=\"https://doi.org/10.1007/978-3-319-46493-0_42\">https://doi.org/10.1007/978-3-319-46493-0_42</a>","ama":"Kolesnikov A, Lampert C. Seed, expand and constrain: Three principles for weakly-supervised image segmentation. In: Vol 9908. Springer; 2016:695-711. doi:<a href=\"https://doi.org/10.1007/978-3-319-46493-0_42\">10.1007/978-3-319-46493-0_42</a>","ieee":"A. Kolesnikov and C. Lampert, “Seed, expand and constrain: Three principles for weakly-supervised image segmentation,” presented at the ECCV: European Conference on Computer Vision, Amsterdam, The Netherlands, 2016, vol. 9908, pp. 695–711.","chicago":"Kolesnikov, Alexander, and Christoph Lampert. “Seed, Expand and Constrain: Three Principles for Weakly-Supervised Image Segmentation,” 9908:695–711. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-46493-0_42\">https://doi.org/10.1007/978-3-319-46493-0_42</a>."},"article_processing_charge":"No","abstract":[{"text":"We introduce a new loss function for the weakly-supervised training of semantic image segmentation models based on three guiding principles: to seed with weak localization cues, to expand objects based on the information about which classes can occur in an image, and to constrain the segmentations to coincide with object boundaries. We show experimentally that training a deep convolutional neural network using the proposed loss function leads to substantially better segmentations than previous state-of-the-art methods on the challenging PASCAL VOC 2012 dataset. We furthermore give insight into the working mechanism of our method by a detailed experimental study that illustrates how the segmentation quality is affected by each term of the proposed loss function as well as their combinations.","lang":"eng"}],"title":"Seed, expand and constrain: Three principles for weakly-supervised image segmentation","publisher":"Springer","status":"public","publist_id":"5842","main_file_link":[{"url":"https://arxiv.org/abs/1603.06098","open_access":"1"}],"ec_funded":1,"date_created":"2018-12-11T11:51:37Z","date_updated":"2025-09-22T07:39:37Z","author":[{"id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","full_name":"Kolesnikov, Alexander","last_name":"Kolesnikov","first_name":"Alexander"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"external_id":{"isi":["000389385100042"],"arxiv":["1603.06098"]},"quality_controlled":"1","doi":"10.1007/978-3-319-46493-0_42","corr_author":"1","department":[{"_id":"ChLa"}],"intvolume":"      9908","year":"2016","_id":"1369","project":[{"call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036"}],"month":"09","isi":1,"scopus_import":"1","page":"695 - 711","type":"conference","publication_status":"published","date_published":"2016-09-15T00:00:00Z","arxiv":1,"fulldoi":"https://doi.org/10.1007/978-3-319-46493-0_42","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"year":"2016","_id":"1371","project":[{"grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"isi":1,"month":"07","scopus_import":"1","page":"124 - 158","type":"journal_article","publication_status":"published","date_published":"2016-07-01T00:00:00Z","publication":"Physics of Life Reviews","fulldoi":"https://doi.org/10.1016/j.plrev.2016.06.002","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","oa_version":"None","language":[{"iso":"eng"}],"volume":17,"citation":{"mla":"Martin, Olivier, et al. “Drivers of Structural Features in Gene Regulatory Networks: From Biophysical Constraints to Biological Function.” <i>Physics of Life Reviews</i>, vol. 17, Elsevier, 2016, pp. 124–58, doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.06.002\">10.1016/j.plrev.2016.06.002</a>.","short":"O. Martin, A. Krzywicki, M.P. Zagórski, Physics of Life Reviews 17 (2016) 124–158.","apa":"Martin, O., Krzywicki, A., &#38; Zagórski, M. P. (2016). Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function. <i>Physics of Life Reviews</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.plrev.2016.06.002\">https://doi.org/10.1016/j.plrev.2016.06.002</a>","ama":"Martin O, Krzywicki A, Zagórski MP. Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function. <i>Physics of Life Reviews</i>. 2016;17:124-158. doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.06.002\">10.1016/j.plrev.2016.06.002</a>","ieee":"O. Martin, A. Krzywicki, and M. P. Zagórski, “Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function,” <i>Physics of Life Reviews</i>, vol. 17. Elsevier, pp. 124–158, 2016.","chicago":"Martin, Olivier, André Krzywicki, and Marcin P Zagórski. “Drivers of Structural Features in Gene Regulatory Networks: From Biophysical Constraints to Biological Function.” <i>Physics of Life Reviews</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.plrev.2016.06.002\">https://doi.org/10.1016/j.plrev.2016.06.002</a>.","ista":"Martin O, Krzywicki A, Zagórski MP. 2016. Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function. Physics of Life Reviews. 17, 124–158."},"article_processing_charge":"No","acknowledgement":"MZ has been supported by Polish National Science Centre Grant No. DEC-2012/07/N/NZ2/00107 and by Foundation of Polish Science award START. ","abstract":[{"lang":"eng","text":"Living cells can maintain their internal states, react to changing environments, grow, differentiate, divide, etc. All these processes are tightly controlled by what can be called a regulatory program. The logic of the underlying control can sometimes be guessed at by examining the network of influences amongst genetic components. Some associated gene regulatory networks have been studied in prokaryotes and eukaryotes, unveiling various structural features ranging from broad distributions of out-degrees to recurrent &quot;motifs&quot;, that is small subgraphs having a specific pattern of interactions. To understand what factors may be driving such structuring, a number of groups have introduced frameworks to model the dynamics of gene regulatory networks. In that context, we review here such in silico approaches and show how selection for phenotypes, i.e., network function, can shape network structure."}],"title":"Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function","publisher":"Elsevier","status":"public","publist_id":"5840","author":[{"full_name":"Martin, Olivier","last_name":"Martin","first_name":"Olivier"},{"full_name":"Krzywicki, André","last_name":"Krzywicki","first_name":"André"},{"last_name":"Zagórski","full_name":"Zagórski, Marcin P","id":"343DA0DC-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin P","orcid":"0000-0001-7896-7762"}],"ec_funded":1,"date_created":"2018-12-11T11:51:38Z","date_updated":"2025-09-22T07:36:42Z","external_id":{"isi":["000381544100029"]},"quality_controlled":"1","doi":"10.1016/j.plrev.2016.06.002","corr_author":"1","department":[{"_id":"AnKi"}],"intvolume":"        17"},{"oa":1,"fulldoi":"https://doi.org/10.1111/nph.14049","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","date_published":"2016-10-01T00:00:00Z","page":"497 - 509","type":"journal_article","ddc":["581"],"publication":"New Phytologist","has_accepted_license":"1","scopus_import":"1","isi":1,"month":"10","year":"2016","issue":"2","_id":"1372","date_updated":"2025-09-22T07:36:11Z","author":[{"last_name":"Pernisová","full_name":"Pernisová, Markéta","first_name":"Markéta"},{"last_name":"Prat","id":"3DA3BFEE-F248-11E8-B48F-1D18A9856A87","full_name":"Prat, Tomas","first_name":"Tomas"},{"last_name":"Grones","id":"399876EC-F248-11E8-B48F-1D18A9856A87","full_name":"Grones, Peter","first_name":"Peter"},{"full_name":"Haruštiaková, Danka","last_name":"Haruštiaková","first_name":"Danka"},{"last_name":"Matonohova","full_name":"Matonohova, Martina","first_name":"Martina"},{"full_name":"Spíchal, Lukáš","last_name":"Spíchal","first_name":"Lukáš"},{"full_name":"Nodzyński, Tomasz","last_name":"Nodzyński","first_name":"Tomasz"},{"orcid":"0000-0002-8302-7596","first_name":"Jirí","full_name":"Friml, Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hejátko, Jan","last_name":"Hejátko","first_name":"Jan"}],"pubrep_id":"1006","date_created":"2018-12-11T11:51:38Z","department":[{"_id":"JiFr"}],"intvolume":"       212","external_id":{"isi":["000383595700023"]},"quality_controlled":"1","doi":"10.1111/nph.14049","publisher":"Wiley-Blackwell","status":"public","publist_id":"5839","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Redirection of intercellular auxin fluxes via relocalization of the PIN-FORMED 3 (PIN3) and PIN7 auxin efflux carriers has been suggested to be necessary for the root gravitropic response. Cytokinins have also been proposed to play a role in controlling root gravitropism, but conclusive evidence is lacking. We present a detailed study of the dynamics of root bending early after gravistimulation, which revealed a delayed gravitropic response in transgenic lines with depleted endogenous cytokinins (Pro35S:AtCKX) and cytokinin signaling mutants. Pro35S:AtCKX lines, as well as a cytokinin receptor mutant ahk3, showed aberrations in the auxin response distribution in columella cells consistent with defects in the auxin transport machinery. Using in vivo real-time imaging of PIN3-GFP and PIN7-GFP in AtCKX3 overexpression and ahk3 backgrounds, we observed wild-type-like relocalization of PIN proteins in the columella early after gravistimulation, with gravity-induced relocalization of PIN7 faster than that of PIN3. Nonetheless, the cellular distribution of PIN3 and PIN7 and expression of PIN7 and the auxin influx carrier AUX1 was affected in AtCKX overexpression lines. Based on the retained cytokinin sensitivity in pin3 pin4 pin7 mutant, we propose the AUX1-mediated auxin transport rather than columella-located PIN proteins as a target of endogenous cytokinins in the control of root gravitropism."}],"file":[{"relation":"main_file","file_size":972763,"access_level":"open_access","file_name":"IST-2018-1006-v1+1_Pernisova_NewPhytol_2016_peer_review.pdf","date_updated":"2020-07-14T12:44:47Z","creator":"system","date_created":"2018-12-12T10:14:53Z","file_id":"5108","checksum":"27fd841ceaf0403559d7048ef51500f9","content_type":"application/pdf"}],"title":"Cytokinins influence root gravitropism via differential regulation of auxin transporter expression and localization in Arabidopsis","acknowledgement":"Funded by Ministry of Education, Youth and Sports Czech Republic. Grant Numbers: CEITEC 2020, LQ1601, LO1204, LH14104 and The European Research Council. Grant Number: ERC-2011-StG-20101109-PSDP and The Czech Science Foundation. Grant Numbers: GAP501/11/1150, GA13-40637S, GP14-30004P","day":"01","oa_version":"Submitted Version","volume":212,"citation":{"short":"M. Pernisová, T. Prat, P. Grones, D. Haruštiaková, M. Matonohova, L. Spíchal, T. Nodzyński, J. Friml, J. Hejátko, New Phytologist 212 (2016) 497–509.","mla":"Pernisová, Markéta, et al. “Cytokinins Influence Root Gravitropism via Differential Regulation of Auxin Transporter Expression and Localization in Arabidopsis.” <i>New Phytologist</i>, vol. 212, no. 2, Wiley-Blackwell, 2016, pp. 497–509, doi:<a href=\"https://doi.org/10.1111/nph.14049\">10.1111/nph.14049</a>.","apa":"Pernisová, M., Prat, T., Grones, P., Haruštiaková, D., Matonohova, M., Spíchal, L., … Hejátko, J. (2016). Cytokinins influence root gravitropism via differential regulation of auxin transporter expression and localization in Arabidopsis. <i>New Phytologist</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/nph.14049\">https://doi.org/10.1111/nph.14049</a>","ama":"Pernisová M, Prat T, Grones P, et al. Cytokinins influence root gravitropism via differential regulation of auxin transporter expression and localization in Arabidopsis. <i>New Phytologist</i>. 2016;212(2):497-509. doi:<a href=\"https://doi.org/10.1111/nph.14049\">10.1111/nph.14049</a>","chicago":"Pernisová, Markéta, Tomas Prat, Peter Grones, Danka Haruštiaková, Martina Matonohova, Lukáš Spíchal, Tomasz Nodzyński, Jiří Friml, and Jan Hejátko. “Cytokinins Influence Root Gravitropism via Differential Regulation of Auxin Transporter Expression and Localization in Arabidopsis.” <i>New Phytologist</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/nph.14049\">https://doi.org/10.1111/nph.14049</a>.","ieee":"M. Pernisová <i>et al.</i>, “Cytokinins influence root gravitropism via differential regulation of auxin transporter expression and localization in Arabidopsis,” <i>New Phytologist</i>, vol. 212, no. 2. Wiley-Blackwell, pp. 497–509, 2016.","ista":"Pernisová M, Prat T, Grones P, Haruštiaková D, Matonohova M, Spíchal L, Nodzyński T, Friml J, Hejátko J. 2016. Cytokinins influence root gravitropism via differential regulation of auxin transporter expression and localization in Arabidopsis. New Phytologist. 212(2), 497–509."},"file_date_updated":"2020-07-14T12:44:47Z","language":[{"iso":"eng"}]},{"publication":"Physics of Life Reviews","date_published":"2016-07-01T00:00:00Z","publication_status":"published","type":"journal_article","page":"168 - 171","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"fulldoi":"https://doi.org/10.1016/j.plrev.2016.06.006","_id":"1373","year":"2016","scopus_import":"1","month":"07","isi":1,"main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01531698","open_access":"1"}],"publist_id":"5838","status":"public","publisher":"Elsevier","intvolume":"        17","department":[{"_id":"AnKi"}],"corr_author":"1","quality_controlled":"1","doi":"10.1016/j.plrev.2016.06.006","external_id":{"isi":["000381544100034"]},"author":[{"last_name":"Martin","full_name":"Martin, Olivier","first_name":"Olivier"},{"orcid":"0000-0001-7896-7762","first_name":"Marcin P","last_name":"Zagórski","id":"343DA0DC-F248-11E8-B48F-1D18A9856A87","full_name":"Zagórski, Marcin P"}],"date_created":"2018-12-11T11:51:39Z","date_updated":"2025-09-22T07:35:28Z","citation":{"ama":"Martin O, Zagórski MP. Network architectures and operating principles. Reply to comments on &#38;quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&#38;quot; <i>Physics of Life Reviews</i>. 2016;17:168-171. doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.06.006\">10.1016/j.plrev.2016.06.006</a>","chicago":"Martin, Olivier, and Marcin P Zagórski. “Network Architectures and Operating Principles. Reply to Comments on &#38;quot;Drivers of Structural Features in Gene Regulatory Networks: From Biophysical Constraints to Biological Function&#38;quot;” <i>Physics of Life Reviews</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.plrev.2016.06.006\">https://doi.org/10.1016/j.plrev.2016.06.006</a>.","ieee":"O. Martin and M. P. Zagórski, “Network architectures and operating principles. Reply to comments on &#38;quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&#38;quot;,” <i>Physics of Life Reviews</i>, vol. 17. Elsevier, pp. 168–171, 2016.","mla":"Martin, Olivier, and Marcin P. Zagórski. “Network Architectures and Operating Principles. Reply to Comments on &#38;quot;Drivers of Structural Features in Gene Regulatory Networks: From Biophysical Constraints to Biological Function&#38;quot;” <i>Physics of Life Reviews</i>, vol. 17, Elsevier, 2016, pp. 168–71, doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.06.006\">10.1016/j.plrev.2016.06.006</a>.","short":"O. Martin, M.P. Zagórski, Physics of Life Reviews 17 (2016) 168–171.","apa":"Martin, O., &#38; Zagórski, M. P. (2016). Network architectures and operating principles. Reply to comments on &#38;quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&#38;quot; <i>Physics of Life Reviews</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.plrev.2016.06.006\">https://doi.org/10.1016/j.plrev.2016.06.006</a>","ista":"Martin O, Zagórski MP. 2016. Network architectures and operating principles. Reply to comments on &#38;quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&#38;quot; Physics of Life Reviews. 17, 168–171."},"volume":17,"language":[{"iso":"eng"}],"oa_version":"Preprint","day":"01","title":"Network architectures and operating principles. Reply to comments on &quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&quot;","article_processing_charge":"No"},{"related_material":{"record":[{"relation":"later_version","status":"public","id":"742"}]},"title":"On expansion and topological overlap","abstract":[{"lang":"eng","text":"We give a detailed and easily accessible proof of Gromov's Topological Overlap Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension d. Informally, the theorem states that if X has sufficiently strong higher-dimensional expansion properties (which generalize edge expansion of graphs and are defined in terms of cellular cochains of X) then X has the following topological overlap property: for every continuous map X → ℝd there exists a point p ∈ ℝd whose preimage intersects a positive fraction μ &gt; 0 of the d-cells of X. More generally, the conclusion holds if ℝd is replaced by any d-dimensional piecewise-linear (PL) manifold M, with a constant μ that depends only on d and on the expansion properties of X, but not on M."}],"file":[{"content_type":"application/pdf","file_id":"4699","checksum":"cee65b0e722d50f9d1cc70c90ec1d59b","access_level":"open_access","file_name":"IST-2016-623-v1+1_LIPIcs-SoCG-2016-35.pdf","creator":"system","date_updated":"2020-07-14T12:44:47Z","date_created":"2018-12-12T10:08:38Z","file_size":536923,"relation":"main_file"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:44:47Z","conference":{"location":"Medford, MA, USA","start_date":"2016-06-14","end_date":"2016-06-17","name":"SoCG: Symposium on Computational Geometry"},"alternative_title":["LIPIcs"],"citation":{"ista":"Dotterrer D, Kaufman T, Wagner U. 2016. On expansion and topological overlap. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 35.1-35.10.","ieee":"D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 35.1-35.10.","chicago":"Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological Overlap,” 51:35.1-35.10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.35\">https://doi.org/10.4230/LIPIcs.SoCG.2016.35</a>.","ama":"Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. In: Vol 51. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016:35.1-35.10. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.35\">10.4230/LIPIcs.SoCG.2016.35</a>","apa":"Dotterrer, D., Kaufman, T., &#38; Wagner, U. (2016). On expansion and topological overlap (Vol. 51, p. 35.1-35.10). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.35\">https://doi.org/10.4230/LIPIcs.SoCG.2016.35</a>","mla":"Dotterrer, Dominic, et al. <i>On Expansion and Topological Overlap</i>. Vol. 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 35.1-35.10, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.35\">10.4230/LIPIcs.SoCG.2016.35</a>.","short":"D. Dotterrer, T. Kaufman, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 35.1-35.10."},"volume":51,"oa_version":"Published Version","day":"01","doi":"10.4230/LIPIcs.SoCG.2016.35","quality_controlled":"1","intvolume":"        51","department":[{"_id":"UlWa"}],"date_updated":"2025-06-03T11:41:00Z","date_created":"2018-12-11T11:51:41Z","author":[{"last_name":"Dotterrer","full_name":"Dotterrer, Dominic","first_name":"Dominic"},{"first_name":"Tali","full_name":"Kaufman, Tali","last_name":"Kaufman"},{"orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli"}],"pubrep_id":"623","publist_id":"5833","status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","month":"06","scopus_import":"1","project":[{"grant_number":"PP00P2_138948","_id":"25FA3206-B435-11E9-9278-68D0E5697425","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"1378","year":"2016","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"fulldoi":"https://doi.org/10.4230/LIPIcs.SoCG.2016.35","has_accepted_license":"1","type":"conference","ddc":["510"],"page":"35.1 - 35.10","date_published":"2016-06-01T00:00:00Z","publication_status":"published"},{"abstract":[{"lang":"eng","text":"We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case."}],"file":[{"content_type":"application/pdf","file_id":"4930","checksum":"f04248a61c24297cfabd30c5f8e0deb9","creator":"system","file_name":"IST-2016-622-v1+1_LIPIcs-SoCG-2016-24.pdf","date_updated":"2020-07-14T12:44:47Z","date_created":"2018-12-12T10:12:12Z","access_level":"open_access","file_size":574770,"relation":"main_file"}],"title":"Finding non-orientable surfaces in 3-manifolds","related_material":{"record":[{"status":"public","id":"534","relation":"later_version"}]},"article_processing_charge":"No","volume":51,"citation":{"apa":"Burton, B., de Mesmay, A. N., &#38; Wagner, U. (2016). Finding non-orientable surfaces in 3-manifolds (Vol. 51, p. 24.1-24.15). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.24\">https://doi.org/10.4230/LIPIcs.SoCG.2016.24</a>","short":"B. Burton, A.N. de Mesmay, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 24.1-24.15.","mla":"Burton, Benjamin, et al. <i>Finding Non-Orientable Surfaces in 3-Manifolds</i>. Vol. 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 24.1-24.15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.24\">10.4230/LIPIcs.SoCG.2016.24</a>.","chicago":"Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds,” 51:24.1-24.15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.24\">https://doi.org/10.4230/LIPIcs.SoCG.2016.24</a>.","ieee":"B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-manifolds,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 24.1-24.15.","ama":"Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-manifolds. In: Vol 51. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016:24.1-24.15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.24\">10.4230/LIPIcs.SoCG.2016.24</a>","ista":"Burton B, de Mesmay AN, Wagner U. 2016. Finding non-orientable surfaces in 3-manifolds. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 24.1-24.15."},"alternative_title":["LIPIcs"],"conference":{"location":"Medford, MA, USA","start_date":"2016-06-14","name":"SoCG: Symposium on Computational Geometry","end_date":"2016-06-17"},"file_date_updated":"2020-07-14T12:44:47Z","language":[{"iso":"eng"}],"day":"01","oa_version":"Published Version","department":[{"_id":"UlWa"}],"intvolume":"        51","quality_controlled":"1","doi":"10.4230/LIPIcs.SoCG.2016.24","pubrep_id":"622","date_created":"2018-12-11T11:51:41Z","author":[{"first_name":"Benjamin","full_name":"Burton, Benjamin","last_name":"Burton"},{"last_name":"De Mesmay","full_name":"De Mesmay, Arnaud N","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","first_name":"Arnaud N"},{"orcid":"0000-0002-1494-0568","first_name":"Uli","full_name":"Wagner, Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2025-09-18T09:45:01Z","status":"public","publist_id":"5832","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":"1","month":"06","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"1379","year":"2016","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"fulldoi":"https://doi.org/10.4230/LIPIcs.SoCG.2016.24","has_accepted_license":"1","publication_status":"published","date_published":"2016-06-01T00:00:00Z","page":"24.1 - 24.15","type":"conference","ddc":["510"]},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1145/2857050","oa":1,"publication":"Journal of the ACM","arxiv":1,"type":"journal_article","publication_status":"published","date_published":"2016-06-01T00:00:00Z","month":"06","isi":1,"scopus_import":"1","_id":"1380","issue":"3","year":"2016","article_number":"23","external_id":{"arxiv":["1303.2981"],"isi":["000382753300004"]},"doi":"10.1145/2857050","quality_controlled":"1","department":[{"_id":"KrCh"}],"intvolume":"        63","date_updated":"2025-09-22T07:33:47Z","author":[{"first_name":"Ventsislav K","last_name":"Chonev","full_name":"Chonev, Ventsislav K","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joël","last_name":"Ouaknine","full_name":"Ouaknine, Joël"},{"last_name":"Worrell","full_name":"Worrell, James","first_name":"James"}],"date_created":"2018-12-11T11:51:41Z","status":"public","publist_id":"5831","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1303.2981"}],"publisher":"ACM","abstract":[{"text":"We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem - determining whether a target vector space V may be reached from a starting point x under repeated applications of a linear transformation A. Answering two questions posed by Kannan and Lipton in the 1980s, we show that when V has dimension one, this problem is solvable in polynomial time, and when V has dimension two or three, the problem is in NPRP.","lang":"eng"}],"title":"On the complexity of the orbit problem","article_processing_charge":"No","language":[{"iso":"eng"}],"volume":63,"citation":{"ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On the complexity of the orbit problem. Journal of the ACM. 63(3), 23.","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On the complexity of the orbit problem,” <i>Journal of the ACM</i>, vol. 63, no. 3. ACM, 2016.","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Complexity of the Orbit Problem.” <i>Journal of the ACM</i>. ACM, 2016. <a href=\"https://doi.org/10.1145/2857050\">https://doi.org/10.1145/2857050</a>.","ama":"Chonev VK, Ouaknine J, Worrell J. On the complexity of the orbit problem. <i>Journal of the ACM</i>. 2016;63(3). doi:<a href=\"https://doi.org/10.1145/2857050\">10.1145/2857050</a>","apa":"Chonev, V. K., Ouaknine, J., &#38; Worrell, J. (2016). On the complexity of the orbit problem. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2857050\">https://doi.org/10.1145/2857050</a>","mla":"Chonev, Ventsislav K., et al. “On the Complexity of the Orbit Problem.” <i>Journal of the ACM</i>, vol. 63, no. 3, 23, ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2857050\">10.1145/2857050</a>.","short":"V.K. Chonev, J. Ouaknine, J. Worrell, Journal of the ACM 63 (2016)."},"day":"01","oa_version":"Preprint"},{"article_processing_charge":"No","abstract":[{"text":"Motivated by Tverberg-type problems in topological combinatorics and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into double-struck Rd without higher-multiplicity intersections. We focus on conditions for the existence of almost r-embeddings, i.e., maps f : K → double-struck Rd such that f(σ1) ∩ ⋯ ∩ f(σr) = ∅ whenever σ1, ..., σr are pairwise disjoint simplices of K. Generalizing the classical Haefliger-Weber embeddability criterion, we show that a well-known necessary deleted product condition for the existence of almost r-embeddings is sufficient in a suitable r-metastable range of dimensions: If rd ≥ (r + 1) dim K + 3, then there exists an almost r-embedding K → double-struck Rd if and only if there exists an equivariant map (K)Δ r → Sr Sd(r-1)-1, where (K)Δ r is the deleted r-fold product of K, the target Sd(r-1)-1 is the sphere of dimension d(r - 1) - 1, and Sr is the symmetric group. This significantly extends one of the main results of our previous paper (which treated the special case where d = rk and dim K = (r - 1)k for some k ≥ 3), and settles an open question raised there.","lang":"eng"}],"file":[{"checksum":"92c0c3735fe908f8ded6e484005cb3b1","file_id":"4791","content_type":"application/pdf","relation":"main_file","file_size":622969,"access_level":"open_access","file_name":"IST-2016-621-v1+1_LIPIcs-SoCG-2016-51.pdf","date_created":"2018-12-12T10:10:06Z","date_updated":"2020-07-14T12:44:47Z","creator":"system"}],"title":"Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range","day":"01","oa_version":"Published Version","alternative_title":["LIPIcs"],"conference":{"start_date":"2016-06-14","location":"Medford, MA, USA","end_date":"2016-06-17","name":"SoCG: Symposium on Computational Geometry"},"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:44:47Z","volume":51,"citation":{"ista":"Mabillard I, Wagner U. 2016. Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 51.1-51.12.","ama":"Mabillard I, Wagner U. Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range. In: Vol 51. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016:51.1-51.12. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.51\">10.4230/LIPIcs.SoCG.2016.51</a>","ieee":"I. Mabillard and U. Wagner, “Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 51.1-51.12.","chicago":"Mabillard, Isaac, and Uli Wagner. “Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range,” 51:51.1-51.12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.51\">https://doi.org/10.4230/LIPIcs.SoCG.2016.51</a>.","mla":"Mabillard, Isaac, and Uli Wagner. <i>Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range</i>. Vol. 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 51.1-51.12, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.51\">10.4230/LIPIcs.SoCG.2016.51</a>.","short":"I. Mabillard, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 51.1-51.12.","apa":"Mabillard, I., &#38; Wagner, U. (2016). Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range (Vol. 51, p. 51.1-51.12). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.51\">https://doi.org/10.4230/LIPIcs.SoCG.2016.51</a>"},"date_updated":"2025-06-03T11:41:20Z","date_created":"2018-12-11T11:51:41Z","pubrep_id":"621","author":[{"last_name":"Mabillard","full_name":"Mabillard, Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Isaac"},{"full_name":"Wagner, Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","orcid":"0000-0002-1494-0568"}],"doi":"10.4230/LIPIcs.SoCG.2016.51","quality_controlled":"1","department":[{"_id":"UlWa"}],"corr_author":"1","intvolume":"        51","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","publist_id":"5830","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"project":[{"grant_number":"PP00P2_138948","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","_id":"25FA3206-B435-11E9-9278-68D0E5697425"}],"month":"06","scopus_import":"1","year":"2016","_id":"1381","fulldoi":"https://doi.org/10.4230/LIPIcs.SoCG.2016.51","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"51.1 - 51.12","ddc":["510"],"type":"conference","publication_status":"published","date_published":"2016-06-01T00:00:00Z","has_accepted_license":"1"},{"scopus_import":"1","isi":1,"month":"06","issue":"7","_id":"1382","year":"2016","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1093/aob/mcw043","publication":"Annals of Botany","publication_status":"published","date_published":"2016-06-01T00:00:00Z","page":"1133 - 1140","type":"journal_article","abstract":[{"text":"Background and aims Angiosperms display remarkable diversity in flower colour, implying that transitions between pigmentation phenotypes must have been common. Despite progress in understanding transitions between anthocyanin (blue, purple, pink or red) and unpigmented (white) flowers, little is known about the evolutionary patterns of flower-colour transitions in lineages with both yellow and anthocyanin-pigmented flowers. This study investigates the relative rates of evolutionary transitions between different combinations of yellow- and anthocyanin-pigmentation phenotypes in the tribe Antirrhineae. Methods We surveyed taxonomic literature for data on anthocyanin and yellow floral pigmentation for 369 species across the tribe. We then reconstructed the phylogeny of 169 taxa and used phylogenetic comparative methods to estimate transition rates among pigmentation phenotypes across the phylogeny. Key Results In contrast to previous studies we found a bias towards transitions involving a gain in pigmentation, although transitions to phenotypes with both anthocyanin and yellow taxa are nevertheless extremely rare. Despite the dominance of yellow and anthocyanin-pigmented taxa, transitions between these phenotypes are constrained to move through a white intermediate stage, whereas transitions to double-pigmentation are very rare. The most abundant transitions are between anthocyanin-pigmented and unpigmented flowers, and similarly the most abundant polymorphic taxa were those with anthocyanin-pigmented and unpigmented flowers. Conclusions Our findings show that pigment evolution is limited by the presence of other floral pigments. This interaction between anthocyanin and yellow pigments constrains the breadth of potential floral diversity observed in nature. In particular, they suggest that selection has repeatedly acted to promote the spread of single-pigmented phenotypes across the Antirrhineae phylogeny. Furthermore, the correlation between transition rates and polymorphism suggests that the forces causing and maintaining variance in the short term reflect evolutionary processes on longer time scales.","lang":"eng"}],"title":"Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae","related_material":{"record":[{"relation":"popular_science","status":"public","id":"5550"}]},"acknowledgement":"We thank Melinda Pickup, Spencer Barrett, Nick Barton and four anonymous reviewers for helpful discussions on previous versions  of  this  manuscript.  We  also  thank  Jana  Porsche  for her efforts in tracking down the more obscure references.","article_processing_charge":"No","volume":117,"citation":{"ista":"Ellis T, Field D. 2016. Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae. Annals of Botany. 117(7), 1133–1140.","short":"T. Ellis, D. Field, Annals of Botany 117 (2016) 1133–1140.","mla":"Ellis, Thomas, and David Field. “Repeated Gains in Yellow and Anthocyanin Pigmentation in Flower Colour Transitions in the Antirrhineae.” <i>Annals of Botany</i>, vol. 117, no. 7, Oxford University Press, 2016, pp. 1133–40, doi:<a href=\"https://doi.org/10.1093/aob/mcw043\">10.1093/aob/mcw043</a>.","apa":"Ellis, T., &#38; Field, D. (2016). Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae. <i>Annals of Botany</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/aob/mcw043\">https://doi.org/10.1093/aob/mcw043</a>","ama":"Ellis T, Field D. Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae. <i>Annals of Botany</i>. 2016;117(7):1133-1140. doi:<a href=\"https://doi.org/10.1093/aob/mcw043\">10.1093/aob/mcw043</a>","chicago":"Ellis, Thomas, and David Field. “Repeated Gains in Yellow and Anthocyanin Pigmentation in Flower Colour Transitions in the Antirrhineae.” <i>Annals of Botany</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/aob/mcw043\">https://doi.org/10.1093/aob/mcw043</a>.","ieee":"T. Ellis and D. Field, “Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae,” <i>Annals of Botany</i>, vol. 117, no. 7. Oxford University Press, pp. 1133–1140, 2016."},"language":[{"iso":"eng"}],"day":"01","oa_version":"None","corr_author":"1","department":[{"_id":"NiBa"}],"intvolume":"       117","external_id":{"isi":["000379733800004"]},"doi":"10.1093/aob/mcw043","quality_controlled":"1","date_updated":"2025-09-22T07:32:44Z","date_created":"2018-12-11T11:51:42Z","author":[{"orcid":"0000-0002-8511-0254","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","last_name":"Ellis","full_name":"Ellis, Thomas","first_name":"Thomas"},{"full_name":"Field, David","last_name":"Field","id":"419049E2-F248-11E8-B48F-1D18A9856A87","first_name":"David","orcid":"0000-0002-4014-8478"}],"status":"public","publist_id":"5828","publisher":"Oxford University Press"},{"arxiv":1,"publication":"LICS '16","date_published":"2016-07-05T00:00:00Z","publication_status":"published","type":"conference","page":"515 - 524","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1145/2933575.2934548","oa":1,"_id":"1389","year":"2016","scopus_import":"1","month":"07","isi":1,"project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1507.03632"}],"publist_id":"5820","status":"public","publisher":"IEEE","department":[{"_id":"KrCh"}],"quality_controlled":"1","doi":"10.1145/2933575.2934548","external_id":{"arxiv":["1507.03632"],"isi":["000387609200052"]},"date_updated":"2025-09-22T07:31:08Z","date_created":"2018-12-11T11:51:44Z","ec_funded":1,"author":[{"first_name":"Ventsislav K","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","last_name":"Chonev","full_name":"Chonev, Ventsislav K"},{"first_name":"Joël","full_name":"Ouaknine, Joël","last_name":"Ouaknine"},{"first_name":"James","last_name":"Worrell","full_name":"Worrell, James"}],"citation":{"ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On recurrent reachability for continuous linear dynamical systems. LICS ’16. LICS: Logic in Computer Science, 515–524.","ama":"Chonev VK, Ouaknine J, Worrell J. On recurrent reachability for continuous linear dynamical systems. In: <i>LICS ’16</i>. IEEE; 2016:515-524. doi:<a href=\"https://doi.org/10.1145/2933575.2934548\">10.1145/2933575.2934548</a>","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On recurrent reachability for continuous linear dynamical systems,” in <i>LICS ’16</i>, New York, NY, USA, 2016, pp. 515–524.","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” In <i>LICS ’16</i>, 515–24. IEEE, 2016. <a href=\"https://doi.org/10.1145/2933575.2934548\">https://doi.org/10.1145/2933575.2934548</a>.","mla":"Chonev, Ventsislav K., et al. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” <i>LICS ’16</i>, IEEE, 2016, pp. 515–24, doi:<a href=\"https://doi.org/10.1145/2933575.2934548\">10.1145/2933575.2934548</a>.","short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, LICS ’16, IEEE, 2016, pp. 515–524.","apa":"Chonev, V. K., Ouaknine, J., &#38; Worrell, J. (2016). On recurrent reachability for continuous linear dynamical systems. In <i>LICS ’16</i> (pp. 515–524). New York, NY, USA: IEEE. <a href=\"https://doi.org/10.1145/2933575.2934548\">https://doi.org/10.1145/2933575.2934548</a>"},"language":[{"iso":"eng"}],"conference":{"location":"New York, NY, USA","start_date":"2018-07-05","end_date":"2018-07-08","name":"LICS: Logic in Computer Science"},"oa_version":"Preprint","day":"05","title":"On recurrent reachability for continuous linear dynamical systems","abstract":[{"lang":"eng","text":"The continuous evolution of a wide variety of systems, including continous-time Markov chains and linear hybrid automata, can be\r\ndescribed in terms of linear differential equations. In this paper we study the decision problem of whether the solution x(t) of a system of linear differential equations dx/dt = Ax reaches a target halfspace infinitely often. This recurrent reachability problem can\r\nequivalently be formulated as the following Infinite Zeros Problem: does a real-valued function f:R≥0 --&gt; R satisfying a given linear\r\ndifferential equation have infinitely many zeros? Our main decidability result is that if the differential equation has order at most 7, then the Infinite Zeros Problem is decidable. On the other hand, we show that a decision procedure for the Infinite Zeros Problem at order 9 (and above) would entail a major breakthrough in Diophantine Approximation, specifically an algorithm for computing the Lagrange constants of arbitrary real algebraic numbers to arbitrary precision."}],"article_processing_charge":"No"},{"publication_status":"published","date_published":"2016-07-13T00:00:00Z","page":"383 - 401","type":"conference","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1007/978-3-319-41540-6_21","_id":"1390","year":"2016","scopus_import":"1","isi":1,"month":"07","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"status":"public","publist_id":"5819","publisher":"Springer","department":[{"_id":"ToHe"}],"corr_author":"1","intvolume":"      9780","external_id":{"isi":["000387731400021"]},"doi":"10.1007/978-3-319-41540-6_21","quality_controlled":"1","date_created":"2018-12-11T11:51:45Z","date_updated":"2025-09-22T07:30:07Z","author":[{"full_name":"D'Antoni, Loris","last_name":"D'Antoni","first_name":"Loris"},{"id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","last_name":"Samanta","full_name":"Samanta, Roopsha","first_name":"Roopsha"},{"full_name":"Singh, Rishabh","last_name":"Singh","first_name":"Rishabh"}],"ec_funded":1,"volume":9780,"citation":{"ama":"D’Antoni L, Samanta R, Singh R. QLOSE: Program repair with quantitative objectives. In: Vol 9780. Springer; 2016:383-401. doi:<a href=\"https://doi.org/10.1007/978-3-319-41540-6_21\">10.1007/978-3-319-41540-6_21</a>","ieee":"L. D’Antoni, R. Samanta, and R. Singh, “QLOSE: Program repair with quantitative objectives,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9780, pp. 383–401.","chicago":"D’Antoni, Loris, Roopsha Samanta, and Rishabh Singh. “QLOSE: Program Repair with Quantitative Objectives,” 9780:383–401. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-41540-6_21\">https://doi.org/10.1007/978-3-319-41540-6_21</a>.","mla":"D’Antoni, Loris, et al. <i>QLOSE: Program Repair with Quantitative Objectives</i>. Vol. 9780, Springer, 2016, pp. 383–401, doi:<a href=\"https://doi.org/10.1007/978-3-319-41540-6_21\">10.1007/978-3-319-41540-6_21</a>.","short":"L. D’Antoni, R. Samanta, R. Singh, in:, Springer, 2016, pp. 383–401.","apa":"D’Antoni, L., Samanta, R., &#38; Singh, R. (2016). QLOSE: Program repair with quantitative objectives (Vol. 9780, pp. 383–401). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-41540-6_21\">https://doi.org/10.1007/978-3-319-41540-6_21</a>","ista":"D’Antoni L, Samanta R, Singh R. 2016. QLOSE: Program repair with quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 9780, 383–401."},"alternative_title":["LNCS"],"conference":{"name":"CAV: Computer Aided Verification","end_date":"2016-07-23","start_date":"2016-07-17","location":"Toronto, Canada"},"language":[{"iso":"eng"}],"day":"13","oa_version":"None","abstract":[{"text":"The goal of automatic program repair is to identify a set of syntactic changes that can turn a program that is incorrect with respect\r\nto a given specification into a correct one. Existing program repair techniques typically aim to find any program that meets the given specification. Such “best-effort” strategies can end up generating a program that is quite different from the original one. Novel techniques have been proposed to compute syntactically minimal program fixes, but the smallest syntactic fix to a program can still significantly alter the original program’s behaviour. We propose a new approach to program repair based on program distances, which can quantify changes not only to the program syntax but also to the program semantics. We call this the quantitative program repair problem where the “optimal” repair is derived using multiple distances. We implement a solution to the quantitative repair\r\nproblem in a prototype tool called Qlose\r\n(Quantitatively close), using the program synthesizer Sketch. We evaluate the effectiveness of different distances in obtaining desirable repairs by evaluating\r\nQlose on programs taken from educational tools such as CodeHunt and edX.","lang":"eng"}],"title":"QLOSE: Program repair with quantitative objectives","article_processing_charge":"No"},{"publisher":"Springer","publist_id":"5818","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1603.06850"}],"author":[{"first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","full_name":"Daca, Przemyslaw"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Andrey","id":"2C311BF8-F248-11E8-B48F-1D18A9856A87","full_name":"Kupriyanov, Andrey","last_name":"Kupriyanov"}],"ec_funded":1,"date_updated":"2026-04-15T10:02:12Z","date_created":"2018-12-11T11:51:45Z","doi":"10.1007/978-3-319-41540-6_13","quality_controlled":"1","external_id":{"isi":["000387731400013"],"arxiv":["1603.06850"]},"intvolume":"      9780","department":[{"_id":"ToHe"}],"corr_author":"1","oa_version":"Preprint","day":"13","language":[{"iso":"eng"}],"conference":{"start_date":"2016-07-17","location":"Toronto, Canada","name":"CAV: Computer Aided Verification","end_date":"2016-07-23"},"alternative_title":["LNCS"],"citation":{"ieee":"P. Daca, T. A. Henzinger, and A. Kupriyanov, “Array folds logic,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9780, pp. 230–248.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, and Andrey Kupriyanov. “Array Folds Logic,” 9780:230–48. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-41540-6_13\">https://doi.org/10.1007/978-3-319-41540-6_13</a>.","ama":"Daca P, Henzinger TA, Kupriyanov A. Array folds logic. In: Vol 9780. Springer; 2016:230-248. doi:<a href=\"https://doi.org/10.1007/978-3-319-41540-6_13\">10.1007/978-3-319-41540-6_13</a>","apa":"Daca, P., Henzinger, T. A., &#38; Kupriyanov, A. (2016). Array folds logic (Vol. 9780, pp. 230–248). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-41540-6_13\">https://doi.org/10.1007/978-3-319-41540-6_13</a>","mla":"Daca, Przemyslaw, et al. <i>Array Folds Logic</i>. Vol. 9780, Springer, 2016, pp. 230–48, doi:<a href=\"https://doi.org/10.1007/978-3-319-41540-6_13\">10.1007/978-3-319-41540-6_13</a>.","short":"P. Daca, T.A. Henzinger, A. Kupriyanov, in:, Springer, 2016, pp. 230–248.","ista":"Daca P, Henzinger TA, Kupriyanov A. 2016. Array folds logic. CAV: Computer Aided Verification, LNCS, vol. 9780, 230–248."},"volume":9780,"article_processing_charge":"No","related_material":{"record":[{"status":"public","id":"1155","relation":"dissertation_contains"}]},"title":"Array folds logic","abstract":[{"text":"We present an extension to the quantifier-free theory of integer arrays which allows us to express counting. The properties expressible in Array Folds Logic (AFL) include statements such as &quot;the first array cell contains the array length,&quot; and &quot;the array contains equally many minimal and maximal elements.&quot; These properties cannot be expressed in quantified fragments of the theory of arrays, nor in the theory of concatenation. Using reduction to counter machines, we show that the satisfiability problem of AFL is PSPACE-complete, and with a natural restriction the complexity decreases to NP. We also show that adding either universal quantifiers or concatenation leads to undecidability.\r\nAFL contains terms that fold a function over an array. We demonstrate that folding, a well-known concept from functional languages, allows us to concisely summarize loops that count over arrays, which occurs frequently in real-life programs. We provide a tool that can discharge proof obligations in AFL, and we demonstrate on practical examples that our decision procedure can solve a broad range of problems in symbolic testing and program verification.","lang":"eng"}],"type":"conference","page":"230 - 248","date_published":"2016-07-13T00:00:00Z","publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.1007/978-3-319-41540-6_13","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2016","_id":"1391","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"month":"07","isi":1,"scopus_import":"1"},{"article_processing_charge":"No","abstract":[{"text":"The solution space of genome-scale models of cellular metabolism provides a map between physically\r\nviable flux configurations and cellular metabolic phenotypes described, at the most basic level, by the\r\ncorresponding growth rates. By sampling the solution space of E. coliʼs metabolic network, we show\r\nthat empirical growth rate distributions recently obtained in experiments at single-cell resolution can\r\nbe explained in terms of a trade-off between the higher fitness of fast-growing phenotypes and the\r\nhigher entropy of slow-growing ones. Based on this, we propose a minimal model for the evolution of\r\na large bacterial population that captures this trade-off. The scaling relationships observed in\r\nexperiments encode, in such frameworks, for the same distance from the maximum achievable growth\r\nrate, the same degree of growth rate maximization, and/or the same rate of phenotypic change. Being\r\ngrounded on genome-scale metabolic network reconstructions, these results allow for multiple\r\nimplications and extensions in spite of the underlying conceptual simplicity.","lang":"eng"}],"title":"Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli","acknowledgement":"The research leading to these results has received funding from the from the Marie\r\nCurie Action ITN NETADIS, grant agreement no. 290038.","day":"27","oa_version":"Preprint","volume":13,"citation":{"ista":"De Martino D, Capuani F, De Martino A. 2016. Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli. Physical Biology. 13(3), 036005.","ama":"De Martino D, Capuani F, De Martino A. Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli. <i>Physical Biology</i>. 2016;13(3). doi:<a href=\"https://doi.org/10.1088/1478-3975/13/3/036005\">10.1088/1478-3975/13/3/036005</a>","chicago":"De Martino, Daniele, Fabrizio Capuani, and Andrea De Martino. “Growth against Entropy in Bacterial Metabolism: The Phenotypic Trade-off behind Empirical Growth Rate Distributions in E. Coli.” <i>Physical Biology</i>. IOP Publishing, 2016. <a href=\"https://doi.org/10.1088/1478-3975/13/3/036005\">https://doi.org/10.1088/1478-3975/13/3/036005</a>.","ieee":"D. De Martino, F. Capuani, and A. De Martino, “Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli,” <i>Physical Biology</i>, vol. 13, no. 3. IOP Publishing, 2016.","mla":"De Martino, Daniele, et al. “Growth against Entropy in Bacterial Metabolism: The Phenotypic Trade-off behind Empirical Growth Rate Distributions in E. Coli.” <i>Physical Biology</i>, vol. 13, no. 3, 036005, IOP Publishing, 2016, doi:<a href=\"https://doi.org/10.1088/1478-3975/13/3/036005\">10.1088/1478-3975/13/3/036005</a>.","short":"D. De Martino, F. Capuani, A. De Martino, Physical Biology 13 (2016).","apa":"De Martino, D., Capuani, F., &#38; De Martino, A. (2016). Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli. <i>Physical Biology</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1478-3975/13/3/036005\">https://doi.org/10.1088/1478-3975/13/3/036005</a>"},"language":[{"iso":"eng"}],"date_updated":"2025-09-18T14:31:33Z","author":[{"orcid":"0000-0002-5214-4706","first_name":"Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","last_name":"De Martino","full_name":"De Martino, Daniele"},{"full_name":"Capuani, Fabrizio","last_name":"Capuani","first_name":"Fabrizio"},{"last_name":"De Martino","full_name":"De Martino, Andrea","first_name":"Andrea"}],"date_created":"2018-12-11T11:51:46Z","ec_funded":1,"department":[{"_id":"GaTk"}],"intvolume":"        13","external_id":{"isi":["000380148200014"],"arxiv":["1601.03243"]},"doi":"10.1088/1478-3975/13/3/036005","quality_controlled":"1","publisher":"IOP Publishing","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1601.03243"}],"status":"public","publist_id":"5815","project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","month":"05","isi":1,"year":"2016","article_number":"036005","issue":"3","_id":"1394","oa":1,"fulldoi":"https://doi.org/10.1088/1478-3975/13/3/036005","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","date_published":"2016-05-27T00:00:00Z","type":"journal_article","publication":"Physical Biology","arxiv":1},{"_id":"14010","pmid":1,"issue":"9","year":"2016","article_number":"093001","month":"08","scopus_import":"1","article_type":"original","keyword":["General Physics and Astronomy"],"publication":"Physical Review Letters","arxiv":1,"type":"journal_article","publication_status":"published","date_published":"2016-08-26T00:00:00Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"fulldoi":"https://doi.org/10.1103/physrevlett.117.093001","language":[{"iso":"eng"}],"volume":117,"citation":{"ista":"Huppert M, Jordan I, Baykusheva DR, von Conta A, Wörner HJ. 2016. Attosecond delays in molecular photoionization. Physical Review Letters. 117(9), 093001.","apa":"Huppert, M., Jordan, I., Baykusheva, D. R., von Conta, A., &#38; Wörner, H. J. (2016). Attosecond delays in molecular photoionization. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.117.093001\">https://doi.org/10.1103/physrevlett.117.093001</a>","short":"M. Huppert, I. Jordan, D.R. Baykusheva, A. von Conta, H.J. Wörner, Physical Review Letters 117 (2016).","mla":"Huppert, Martin, et al. “Attosecond Delays in Molecular Photoionization.” <i>Physical Review Letters</i>, vol. 117, no. 9, 093001, American Physical Society, 2016, doi:<a href=\"https://doi.org/10.1103/physrevlett.117.093001\">10.1103/physrevlett.117.093001</a>.","chicago":"Huppert, Martin, Inga Jordan, Denitsa Rangelova Baykusheva, Aaron von Conta, and Hans Jakob Wörner. “Attosecond Delays in Molecular Photoionization.” <i>Physical Review Letters</i>. American Physical Society, 2016. <a href=\"https://doi.org/10.1103/physrevlett.117.093001\">https://doi.org/10.1103/physrevlett.117.093001</a>.","ieee":"M. Huppert, I. Jordan, D. R. Baykusheva, A. von Conta, and H. J. Wörner, “Attosecond delays in molecular photoionization,” <i>Physical Review Letters</i>, vol. 117, no. 9. American Physical Society, 2016.","ama":"Huppert M, Jordan I, Baykusheva DR, von Conta A, Wörner HJ. Attosecond delays in molecular photoionization. <i>Physical Review Letters</i>. 2016;117(9). doi:<a href=\"https://doi.org/10.1103/physrevlett.117.093001\">10.1103/physrevlett.117.093001</a>"},"day":"26","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"oa_version":"Preprint","abstract":[{"text":"We report measurements of energy-dependent attosecond photoionization delays between the two outer-most valence shells of N2O and H2O. The combination of single-shot signal referencing with the use of different metal foils to filter the attosecond pulse train enables us to extract delays from congested spectra. Remarkably large delays up to 160 as are observed in N2O, whereas the delays in H2O are all smaller than 50 as in the photon-energy range of 20-40 eV. These results are interpreted by developing a theory of molecular photoionization delays. The long delays measured in N2O are shown to reflect the population of molecular shape resonances that trap the photoelectron for a duration of up to ∼110 as. The unstructured continua of H2O result in much smaller delays at the same photon energies. Our experimental and theoretical methods make the study of molecular attosecond photoionization dynamics accessible.","lang":"eng"}],"title":"Attosecond delays in molecular photoionization","article_processing_charge":"No","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.07435"}],"publisher":"American Physical Society","external_id":{"pmid":["27610849"],"arxiv":["1607.07435"]},"quality_controlled":"1","doi":"10.1103/physrevlett.117.093001","intvolume":"       117","date_updated":"2023-08-22T08:42:50Z","author":[{"full_name":"Huppert, Martin","last_name":"Huppert","first_name":"Martin"},{"first_name":"Inga","full_name":"Jordan, Inga","last_name":"Jordan"},{"first_name":"Denitsa Rangelova","last_name":"Baykusheva","id":"71b4d059-2a03-11ee-914d-dfa3beed6530","full_name":"Baykusheva, Denitsa Rangelova"},{"first_name":"Aaron","full_name":"von Conta, Aaron","last_name":"von Conta"},{"first_name":"Hans Jakob","full_name":"Wörner, Hans Jakob","last_name":"Wörner"}],"date_created":"2023-08-10T06:37:07Z"},{"publication":"Physical Review Letters","type":"journal_article","date_published":"2016-03-25T00:00:00Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","fulldoi":"https://doi.org/10.1103/physrevlett.116.123001","_id":"14011","issue":"12","pmid":1,"article_number":"123001","year":"2016","month":"03","article_type":"original","scopus_import":"1","keyword":["General Physics and Astronomy"],"status":"public","publisher":"American Physical Society","quality_controlled":"1","doi":"10.1103/physrevlett.116.123001","external_id":{"pmid":["27058077"]},"intvolume":"       116","date_updated":"2023-08-22T08:44:10Z","date_created":"2023-08-10T06:37:16Z","author":[{"first_name":"Denitsa Rangelova","id":"71b4d059-2a03-11ee-914d-dfa3beed6530","last_name":"Baykusheva","full_name":"Baykusheva, Denitsa Rangelova"},{"last_name":"Ahsan","full_name":"Ahsan, Md Sabbir","first_name":"Md Sabbir"},{"first_name":"Nan","last_name":"Lin","full_name":"Lin, Nan"},{"last_name":"Wörner","full_name":"Wörner, Hans Jakob","first_name":"Hans Jakob"}],"language":[{"iso":"eng"}],"citation":{"ieee":"D. R. Baykusheva, M. S. Ahsan, N. Lin, and H. J. Wörner, “Bicircular high-harmonic spectroscopy reveals dynamical symmetries of atoms and molecules,” <i>Physical Review Letters</i>, vol. 116, no. 12. American Physical Society, 2016.","chicago":"Baykusheva, Denitsa Rangelova, Md Sabbir Ahsan, Nan Lin, and Hans Jakob Wörner. “Bicircular High-Harmonic Spectroscopy Reveals Dynamical Symmetries of Atoms and Molecules.” <i>Physical Review Letters</i>. American Physical Society, 2016. <a href=\"https://doi.org/10.1103/physrevlett.116.123001\">https://doi.org/10.1103/physrevlett.116.123001</a>.","ama":"Baykusheva DR, Ahsan MS, Lin N, Wörner HJ. Bicircular high-harmonic spectroscopy reveals dynamical symmetries of atoms and molecules. <i>Physical Review Letters</i>. 2016;116(12). doi:<a href=\"https://doi.org/10.1103/physrevlett.116.123001\">10.1103/physrevlett.116.123001</a>","apa":"Baykusheva, D. R., Ahsan, M. S., Lin, N., &#38; Wörner, H. J. (2016). Bicircular high-harmonic spectroscopy reveals dynamical symmetries of atoms and molecules. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.116.123001\">https://doi.org/10.1103/physrevlett.116.123001</a>","mla":"Baykusheva, Denitsa Rangelova, et al. “Bicircular High-Harmonic Spectroscopy Reveals Dynamical Symmetries of Atoms and Molecules.” <i>Physical Review Letters</i>, vol. 116, no. 12, 123001, American Physical Society, 2016, doi:<a href=\"https://doi.org/10.1103/physrevlett.116.123001\">10.1103/physrevlett.116.123001</a>.","short":"D.R. Baykusheva, M.S. Ahsan, N. Lin, H.J. Wörner, Physical Review Letters 116 (2016).","ista":"Baykusheva DR, Ahsan MS, Lin N, Wörner HJ. 2016. Bicircular high-harmonic spectroscopy reveals dynamical symmetries of atoms and molecules. Physical Review Letters. 116(12), 123001."},"volume":116,"publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"oa_version":"None","day":"25","title":"Bicircular high-harmonic spectroscopy reveals dynamical symmetries of atoms and molecules","abstract":[{"lang":"eng","text":"We introduce bicircular high-harmonic spectroscopy as a new method to probe dynamical symmetries of atoms and molecules and their evolution in time. Our approach is based on combining a circularly polarized femtosecond fundamental field of frequency ω with its counterrotating second harmonic 2ω. We demonstrate the ability of bicircular high-harmonic spectroscopy to characterize the orbital angular momentum symmetry of atomic orbitals. We further show that breaking the threefold rotational symmetry of the generating medium-at the level of either the ensemble or that of a single molecule-results in the emission of the otherwise parity-forbidden frequencies 3qω  (q∈N), which provide a background-free probe of dynamical molecular symmetries."}],"article_processing_charge":"No"},{"publisher":"Springer Nature","status":"public","main_file_link":[{"url":"https://doi.org/10.1038/lsa.2016.170","open_access":"1"}],"date_updated":"2023-08-22T08:46:05Z","date_created":"2023-08-10T06:37:25Z","author":[{"first_name":"Rajendran","last_name":"Rajeev","full_name":"Rajeev, Rajendran"},{"first_name":"Johannes","full_name":"Hellwagner, Johannes","last_name":"Hellwagner"},{"last_name":"Schumacher","full_name":"Schumacher, Anne","first_name":"Anne"},{"full_name":"Jordan, Inga","last_name":"Jordan","first_name":"Inga"},{"first_name":"Martin","full_name":"Huppert, Martin","last_name":"Huppert"},{"full_name":"Tehlar, Andres","last_name":"Tehlar","first_name":"Andres"},{"first_name":"Bhargava Ram","full_name":"Niraghatam, Bhargava Ram","last_name":"Niraghatam"},{"last_name":"Baykusheva","id":"71b4d059-2a03-11ee-914d-dfa3beed6530","full_name":"Baykusheva, Denitsa Rangelova","first_name":"Denitsa Rangelova"},{"first_name":"Nan","last_name":"Lin","full_name":"Lin, Nan"},{"last_name":"von Conta","full_name":"von Conta, Aaron","first_name":"Aaron"},{"first_name":"Hans Jakob","full_name":"Wörner, Hans Jakob","last_name":"Wörner"}],"external_id":{"pmid":["30167130"]},"quality_controlled":"1","doi":"10.1038/lsa.2016.170","intvolume":"         5","day":"01","oa_version":"Published Version","publication_identifier":{"eissn":["2047-7538"]},"language":[{"iso":"eng"}],"volume":5,"citation":{"ista":"Rajeev R, Hellwagner J, Schumacher A, Jordan I, Huppert M, Tehlar A, Niraghatam BR, Baykusheva DR, Lin N, von Conta A, Wörner HJ. 2016. In situ frequency gating and beam splitting of vacuum- and extreme-ultraviolet pulses. Light: Science &#38; Applications. 5(11), e16170–e16170.","short":"R. Rajeev, J. Hellwagner, A. Schumacher, I. Jordan, M. Huppert, A. Tehlar, B.R. Niraghatam, D.R. Baykusheva, N. Lin, A. von Conta, H.J. Wörner, Light: Science &#38; Applications 5 (2016) e16170–e16170.","mla":"Rajeev, Rajendran, et al. “In Situ Frequency Gating and Beam Splitting of Vacuum- and Extreme-Ultraviolet Pulses.” <i>Light: Science &#38; Applications</i>, vol. 5, no. 11, Springer Nature, 2016, pp. e16170–e16170, doi:<a href=\"https://doi.org/10.1038/lsa.2016.170\">10.1038/lsa.2016.170</a>.","apa":"Rajeev, R., Hellwagner, J., Schumacher, A., Jordan, I., Huppert, M., Tehlar, A., … Wörner, H. J. (2016). In situ frequency gating and beam splitting of vacuum- and extreme-ultraviolet pulses. <i>Light: Science &#38; Applications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/lsa.2016.170\">https://doi.org/10.1038/lsa.2016.170</a>","ama":"Rajeev R, Hellwagner J, Schumacher A, et al. In situ frequency gating and beam splitting of vacuum- and extreme-ultraviolet pulses. <i>Light: Science &#38; Applications</i>. 2016;5(11):e16170-e16170. doi:<a href=\"https://doi.org/10.1038/lsa.2016.170\">10.1038/lsa.2016.170</a>","chicago":"Rajeev, Rajendran, Johannes Hellwagner, Anne Schumacher, Inga Jordan, Martin Huppert, Andres Tehlar, Bhargava Ram Niraghatam, et al. “In Situ Frequency Gating and Beam Splitting of Vacuum- and Extreme-Ultraviolet Pulses.” <i>Light: Science &#38; Applications</i>. Springer Nature, 2016. <a href=\"https://doi.org/10.1038/lsa.2016.170\">https://doi.org/10.1038/lsa.2016.170</a>.","ieee":"R. Rajeev <i>et al.</i>, “In situ frequency gating and beam splitting of vacuum- and extreme-ultraviolet pulses,” <i>Light: Science &#38; Applications</i>, vol. 5, no. 11. Springer Nature, pp. e16170–e16170, 2016."},"article_processing_charge":"No","abstract":[{"text":"Monochromatization of high-harmonic sources has opened fascinating perspectives regarding time-resolved photoemission from all phases of matter. Such studies have invariably involved the use of spectral filters or spectrally dispersive optical components that are inherently lossy and technically complex. Here we present a new technique for the spectral selection of near-threshold harmonics and their spatial separation from the driving beams without any optical elements. We discover the existence of a narrow phase-matching gate resulting from the combination of the non-collinear generation geometry in an extended medium, atomic resonances and absorption. Our technique offers a filter contrast of up to 104 for the selected harmonics against the adjacent ones and offers multiple temporally synchronized beamlets in a single unified scheme. We demonstrate the selective generation of 133, 80 or 56 nm femtosecond pulses from a 400-nm driver, which is specific to the target gas. These results open new pathways towards phase-sensitive multi-pulse spectroscopy in the vacuum- and extreme-ultraviolet, and frequency-selective output coupling from enhancement cavities.","lang":"eng"}],"title":"In situ frequency gating and beam splitting of vacuum- and extreme-ultraviolet pulses","page":"e16170-e16170","type":"journal_article","publication_status":"published","date_published":"2016-11-01T00:00:00Z","publication":"Light: Science & Applications","fulldoi":"https://doi.org/10.1038/lsa.2016.170","oa":1,"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2016","_id":"14012","pmid":1,"issue":"11","keyword":["Atomic and Molecular Physics","and Optics","Electronic","Optical and Magnetic Materials"],"month":"11","scopus_import":"1","article_type":"original"},{"issue":"1","_id":"1408","year":"2016","scopus_import":"1","month":"07","isi":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"project":[{"grant_number":"M01980","call_identifier":"FWF","name":"Robust Invariants of Nonlinear Systems","_id":"25F8B9BC-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"publication":"Discrete & Computational Geometry","has_accepted_license":"1","publication_status":"published","date_published":"2016-07-01T00:00:00Z","page":"126 - 164","type":"journal_article","ddc":["510"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1007/s00454-016-9794-2","oa":1,"volume":56,"citation":{"apa":"Franek, P., &#38; Krcál, M. (2016). On computability and triviality of well groups. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-016-9794-2\">https://doi.org/10.1007/s00454-016-9794-2</a>","short":"P. Franek, M. Krcál, Discrete &#38; Computational Geometry 56 (2016) 126–164.","mla":"Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well Groups.” <i>Discrete &#38; Computational Geometry</i>, vol. 56, no. 1, Springer, 2016, pp. 126–64, doi:<a href=\"https://doi.org/10.1007/s00454-016-9794-2\">10.1007/s00454-016-9794-2</a>.","ieee":"P. Franek and M. Krcál, “On computability and triviality of well groups,” <i>Discrete &#38; Computational Geometry</i>, vol. 56, no. 1. Springer, pp. 126–164, 2016.","chicago":"Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well Groups.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00454-016-9794-2\">https://doi.org/10.1007/s00454-016-9794-2</a>.","ama":"Franek P, Krcál M. On computability and triviality of well groups. <i>Discrete &#38; Computational Geometry</i>. 2016;56(1):126-164. doi:<a href=\"https://doi.org/10.1007/s00454-016-9794-2\">10.1007/s00454-016-9794-2</a>","ista":"Franek P, Krcál M. 2016. On computability and triviality of well groups. Discrete &#38; Computational Geometry. 56(1), 126–164."},"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:44:53Z","day":"01","oa_version":"Published Version","file":[{"checksum":"e0da023abf6b72abd8c6a8c76740d53c","file_id":"4846","content_type":"application/pdf","file_size":905303,"relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:44:53Z","file_name":"IST-2016-614-v1+1_s00454-016-9794-2.pdf","creator":"system","date_created":"2018-12-12T10:10:55Z"}],"abstract":[{"lang":"eng","text":"The concept of well group in a special but important case captures homological properties of the zero set of a continuous map (Formula presented.) on a compact space K that are invariant with respect to perturbations of f. The perturbations are arbitrary continuous maps within (Formula presented.) distance r from f for a given (Formula presented.). The main drawback of the approach is that the computability of well groups was shown only when (Formula presented.) or (Formula presented.). Our contribution to the theory of well groups is twofold: on the one hand we improve on the computability issue, but on the other hand we present a range of examples where the well groups are incomplete invariants, that is, fail to capture certain important robust properties of the zero set. For the first part, we identify a computable subgroup of the well group that is obtained by cap product with the pullback of the orientation of (Formula presented.) by f. In other words, well groups can be algorithmically approximated from below. When f is smooth and (Formula presented.), our approximation of the (Formula presented.)th well group is exact. For the second part, we find examples of maps (Formula presented.) with all well groups isomorphic but whose perturbations have different zero sets. We discuss on a possible replacement of the well groups of vector valued maps by an invariant of a better descriptive power and computability status."}],"title":"On computability and triviality of well groups","related_material":{"record":[{"status":"public","id":"1510","relation":"earlier_version"}]},"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). ","article_processing_charge":"Yes (via OA deal)","status":"public","publist_id":"5799","publisher":"Springer","corr_author":"1","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"intvolume":"        56","external_id":{"isi":["000377722100005"]},"doi":"10.1007/s00454-016-9794-2","quality_controlled":"1","ec_funded":1,"author":[{"first_name":"Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","last_name":"Franek","full_name":"Franek, Peter","orcid":"0000-0001-8878-8397"},{"id":"33E21118-F248-11E8-B48F-1D18A9856A87","last_name":"Krcál","full_name":"Krcál, Marek","first_name":"Marek"}],"pubrep_id":"614","date_updated":"2025-09-18T14:30:52Z","date_created":"2018-12-11T11:51:51Z"},{"isi":1,"month":"06","scopus_import":"1","_id":"1409","issue":"11","year":"2016","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1111/mec.13685","oa":1,"has_accepted_license":"1","publication":"Molecular Ecology","page":"2325 - 2332","ddc":["576"],"type":"journal_article","publication_status":"published","date_published":"2016-06-08T00:00:00Z","file":[{"date_updated":"2020-07-14T12:44:53Z","file_name":"IST-2017-772-v1+1_AbbotEtAl2016-3.pdf","creator":"system","date_created":"2018-12-12T10:10:12Z","access_level":"open_access","relation":"main_file","file_size":226137,"content_type":"application/pdf","checksum":"ede7d0b8a471754f71f17e2b20f3135b","file_id":"4797"}],"title":"Genomics of hybridization and its evolutionary consequences","article_processing_charge":"No","file_date_updated":"2020-07-14T12:44:53Z","language":[{"iso":"eng"}],"volume":25,"citation":{"ista":"Abbott R, Barton NH, Good J. 2016. Genomics of hybridization and its evolutionary consequences. Molecular Ecology. 25(11), 2325–2332.","apa":"Abbott, R., Barton, N. H., &#38; Good, J. (2016). Genomics of hybridization and its evolutionary consequences. <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/mec.13685\">https://doi.org/10.1111/mec.13685</a>","short":"R. Abbott, N.H. Barton, J. Good, Molecular Ecology 25 (2016) 2325–2332.","mla":"Abbott, Richard, et al. “Genomics of Hybridization and Its Evolutionary Consequences.” <i>Molecular Ecology</i>, vol. 25, no. 11, Wiley-Blackwell, 2016, pp. 2325–32, doi:<a href=\"https://doi.org/10.1111/mec.13685\">10.1111/mec.13685</a>.","chicago":"Abbott, Richard, Nicholas H Barton, and Jeffrey Good. “Genomics of Hybridization and Its Evolutionary Consequences.” <i>Molecular Ecology</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/mec.13685\">https://doi.org/10.1111/mec.13685</a>.","ieee":"R. Abbott, N. H. Barton, and J. Good, “Genomics of hybridization and its evolutionary consequences,” <i>Molecular Ecology</i>, vol. 25, no. 11. Wiley-Blackwell, pp. 2325–2332, 2016.","ama":"Abbott R, Barton NH, Good J. Genomics of hybridization and its evolutionary consequences. <i>Molecular Ecology</i>. 2016;25(11):2325-2332. doi:<a href=\"https://doi.org/10.1111/mec.13685\">10.1111/mec.13685</a>"},"day":"08","oa_version":"Submitted Version","external_id":{"isi":["000378941100001"]},"quality_controlled":"1","doi":"10.1111/mec.13685","department":[{"_id":"NiBa"}],"intvolume":"        25","date_created":"2018-12-11T11:51:51Z","pubrep_id":"772","date_updated":"2025-09-18T14:30:06Z","author":[{"first_name":"Richard","last_name":"Abbott","full_name":"Abbott, Richard"},{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240"},{"first_name":"Jeffrey","full_name":"Good, Jeffrey","last_name":"Good"}],"status":"public","publist_id":"5798","publisher":"Wiley-Blackwell"},{"has_accepted_license":"1","publication":"Plant Science","page":"10 - 19","type":"journal_article","ddc":["581"],"publication_status":"published","date_published":"2016-09-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"fulldoi":"https://doi.org/10.1016/j.plantsci.2016.05.014","_id":"1410","pmid":1,"year":"2016","month":"09","isi":1,"scopus_import":"1","status":"public","publist_id":"5797","publisher":"Elsevier","external_id":{"pmid":["27457979"],"isi":["000381545000002"]},"doi":"10.1016/j.plantsci.2016.05.014","quality_controlled":"1","department":[{"_id":"JiFr"}],"intvolume":"       250","pubrep_id":"1005","author":[{"last_name":"Ugalde","full_name":"Ugalde, José","first_name":"José"},{"last_name":"Rodríguez Furlán","full_name":"Rodríguez Furlán, Cecilia","first_name":"Cecilia"},{"first_name":"Riet","last_name":"De Rycke","full_name":"De Rycke, Riet"},{"last_name":"Norambuena","full_name":"Norambuena, Lorena","first_name":"Lorena"},{"orcid":"0000-0002-8302-7596","first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"},{"first_name":"Gabriel","full_name":"León, Gabriel","last_name":"León"},{"full_name":"Tejos, Ricardo","last_name":"Tejos","first_name":"Ricardo"}],"date_updated":"2025-09-18T14:29:16Z","date_created":"2018-12-11T11:51:51Z","file_date_updated":"2020-07-14T12:44:53Z","language":[{"iso":"eng"}],"volume":250,"citation":{"ista":"Ugalde J, Rodríguez Furlán C, De Rycke R, Norambuena L, Friml J, León G, Tejos R. 2016. Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development. Plant Science. 250, 10–19.","ama":"Ugalde J, Rodríguez Furlán C, De Rycke R, et al. Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development. <i>Plant Science</i>. 2016;250:10-19. doi:<a href=\"https://doi.org/10.1016/j.plantsci.2016.05.014\">10.1016/j.plantsci.2016.05.014</a>","chicago":"Ugalde, José, Cecilia Rodríguez Furlán, Riet De Rycke, Lorena Norambuena, Jiří Friml, Gabriel León, and Ricardo Tejos. “Phosphatidylinositol 4-Phosphate 5-Kinases 1 and 2 Are Involved in the Regulation of Vacuole Morphology during Arabidopsis Thaliana Pollen Development.” <i>Plant Science</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.plantsci.2016.05.014\">https://doi.org/10.1016/j.plantsci.2016.05.014</a>.","ieee":"J. Ugalde <i>et al.</i>, “Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development,” <i>Plant Science</i>, vol. 250. Elsevier, pp. 10–19, 2016.","short":"J. Ugalde, C. Rodríguez Furlán, R. De Rycke, L. Norambuena, J. Friml, G. León, R. Tejos, Plant Science 250 (2016) 10–19.","mla":"Ugalde, José, et al. “Phosphatidylinositol 4-Phosphate 5-Kinases 1 and 2 Are Involved in the Regulation of Vacuole Morphology during Arabidopsis Thaliana Pollen Development.” <i>Plant Science</i>, vol. 250, Elsevier, 2016, pp. 10–19, doi:<a href=\"https://doi.org/10.1016/j.plantsci.2016.05.014\">10.1016/j.plantsci.2016.05.014</a>.","apa":"Ugalde, J., Rodríguez Furlán, C., De Rycke, R., Norambuena, L., Friml, J., León, G., &#38; Tejos, R. (2016). Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development. <i>Plant Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.plantsci.2016.05.014\">https://doi.org/10.1016/j.plantsci.2016.05.014</a>"},"day":"01","oa_version":"Submitted Version","acknowledgement":"the Odysseus Program of the Research Foundation-Flanders [G091608] to JF.","abstract":[{"text":"The pollen grains arise after meiosis of pollen mother cells within the anthers. A series of complex structural changes follows, generating mature pollen grains capable of performing the double fertilization of the female megasporophyte. Several signaling molecules, including hormones and lipids, have been involved in the regulation and appropriate control of pollen development. Phosphatidylinositol 4-phophate 5-kinases (PIP5K), which catalyze the biosynthesis of the phosphoinositide PtdIns(4,5)P2, are important for tip polar growth of root hairs and pollen tubes, embryo development, vegetative plant growth, and responses to the environment. Here, we report a role of PIP5Ks during microgametogenesis. PIP5K1 and PIP5K2 are expressed during early stages of pollen development and their transcriptional activity respond to auxin in pollen grains. Early male gametophytic lethality to certain grade was observed in both pip5k1-/- and pip5k2-/- single mutants. The number of pip5k mutant alleles is directly related to the frequency of aborted pollen grains suggesting the two genes are involved in the same function. Indeed PIP5K1 and PIP5K2 are functionally redundant since homozygous double mutants did not render viable pollen grains. The loss of function of PIP5K1 and PIP5K2results in defects in vacuole morphology in pollen at the later stages and epidermal root cells. Our results show that PIP5K1, PIP5K2 and phosphoinositide signaling are important cues for early developmental stages and vacuole formation during microgametogenesis.","lang":"eng"}],"file":[{"creator":"dernst","date_updated":"2020-07-14T12:44:53Z","file_name":"2016_PlantScience_Ugalde.pdf","date_created":"2019-04-17T07:41:57Z","access_level":"open_access","relation":"main_file","file_size":4338545,"content_type":"application/pdf","checksum":"ca08de036e6ddc81e6f760e0ccdebd3f","file_id":"6331"}],"title":"Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development","article_processing_charge":"No"}]