[{"issue":"8","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3784592/","open_access":"1"}],"author":[{"last_name":"Kim","first_name":"Soo","full_name":"Kim, Soo"},{"full_name":"Xu, Zheng","first_name":"Zheng","last_name":"Xu"},{"last_name":"Song","first_name":"Kyungyoung","full_name":"Song, Kyungyoung"},{"last_name":"Kim","first_name":"Dae","full_name":"Kim, Dae"},{"last_name":"Kang","full_name":"Kang, Hyangju","first_name":"Hyangju"},{"full_name":"Reichardt, Ilka","first_name":"Ilka","last_name":"Reichardt"},{"full_name":"Sohn, Eun","first_name":"Eun","last_name":"Sohn"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","first_name":"Jirí"},{"last_name":"Juergens","first_name":"Gerd","full_name":"Juergens, Gerd"},{"first_name":"Inhwan","full_name":"Hwang, Inhwan","last_name":"Hwang"}],"date_updated":"2021-01-12T08:01:12Z","page":"2970 - 2985","abstract":[{"text":"Fertilization in flowering plants requires the temporal and spatial coordination of many developmental processes, including pollen production, anther dehiscence, ovule production, and pollen tube elongation. However, it remains elusive as to how this coordination occurs during reproduction. Here, we present evidence that endocytosis, involving heterotetrameric adaptor protein complex 2 (AP-2), plays a crucial role in fertilization. An Arabidopsis thaliana mutant ap2m displays multiple defects in pollen production and viability, as well as elongation of staminal filaments and pollen tubes, all of which are pivotal processes needed for fertilization. Of these abnormalities, the defects in elongation of staminal filaments and pollen tubes were partially rescued by exogenous auxin. Moreover, DR5rev:GFP (for green fluorescent protein) expression was greatly reduced in filaments and anthers in ap2m mutant plants. At the cellular level, ap2m mutants displayed defects in both endocytosis of N-(3-triethylammonium-propyl)-4- (4-diethylaminophenylhexatrienyl) pyridinium dibromide, a lypophilic dye used as an endocytosis marker, and polar localization of auxin-efflux carrier PIN FORMED2 (PIN2) in the stamen filaments. Moreover, these defects were phenocopied by treatment with Tyrphostin A23, an inhibitor of endocytosis. Based on these results, we propose that AP-2-dependent endocytosis plays a crucial role in coordinating the multiple developmental aspects of male reproductive organs by modulating cellular auxin level through the regulation of the amount and polarity of PINs.","lang":"eng"}],"type":"journal_article","intvolume":"        25","department":[{"_id":"JiFr"}],"publisher":"American Society of Plant Biologists","date_published":"2013-08-01T00:00:00Z","_id":"507","title":"Adaptor protein complex 2-mediated endocytosis is crucial for male reproductive organ development in arabidopsis","date_created":"2018-12-11T11:46:52Z","citation":{"chicago":"Kim, Soo, Zheng Xu, Kyungyoung Song, Dae Kim, Hyangju Kang, Ilka Reichardt, Eun Sohn, Jiří Friml, Gerd Juergens, and Inhwan Hwang. “Adaptor Protein Complex 2-Mediated Endocytosis Is Crucial for Male Reproductive Organ Development in Arabidopsis.” <i>Plant Cell</i>. American Society of Plant Biologists, 2013. <a href=\"https://doi.org/10.1105/tpc.113.114264\">https://doi.org/10.1105/tpc.113.114264</a>.","mla":"Kim, Soo, et al. “Adaptor Protein Complex 2-Mediated Endocytosis Is Crucial for Male Reproductive Organ Development in Arabidopsis.” <i>Plant Cell</i>, vol. 25, no. 8, American Society of Plant Biologists, 2013, pp. 2970–85, doi:<a href=\"https://doi.org/10.1105/tpc.113.114264\">10.1105/tpc.113.114264</a>.","short":"S. Kim, Z. Xu, K. Song, D. Kim, H. Kang, I. Reichardt, E. Sohn, J. Friml, G. Juergens, I. Hwang, Plant Cell 25 (2013) 2970–2985.","ama":"Kim S, Xu Z, Song K, et al. Adaptor protein complex 2-mediated endocytosis is crucial for male reproductive organ development in arabidopsis. <i>Plant Cell</i>. 2013;25(8):2970-2985. doi:<a href=\"https://doi.org/10.1105/tpc.113.114264\">10.1105/tpc.113.114264</a>","ieee":"S. Kim <i>et al.</i>, “Adaptor protein complex 2-mediated endocytosis is crucial for male reproductive organ development in arabidopsis,” <i>Plant Cell</i>, vol. 25, no. 8. American Society of Plant Biologists, pp. 2970–2985, 2013.","apa":"Kim, S., Xu, Z., Song, K., Kim, D., Kang, H., Reichardt, I., … Hwang, I. (2013). Adaptor protein complex 2-mediated endocytosis is crucial for male reproductive organ development in arabidopsis. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.113.114264\">https://doi.org/10.1105/tpc.113.114264</a>","ista":"Kim S, Xu Z, Song K, Kim D, Kang H, Reichardt I, Sohn E, Friml J, Juergens G, Hwang I. 2013. Adaptor protein complex 2-mediated endocytosis is crucial for male reproductive organ development in arabidopsis. Plant Cell. 25(8), 2970–2985."},"publication_status":"published","scopus_import":1,"oa_version":"Submitted Version","external_id":{"pmid":["23975898"]},"quality_controlled":"1","language":[{"iso":"eng"}],"year":"2013","status":"public","month":"08","publist_id":"7312","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"day":"01","doi":"10.1105/tpc.113.114264","publication":"Plant Cell","volume":25,"oa":1},{"oa_version":"Submitted Version","scopus_import":1,"quality_controlled":"1","external_id":{"pmid":["23821607"]},"month":"09","year":"2013","language":[{"iso":"eng"}],"status":"public","day":"01","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7310","doi":"10.1093/molbev/mst119","publication":"Molecular Biology and Evolution","oa":1,"volume":30,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3748357/"}],"author":[{"last_name":"Tarazona Santos","first_name":"Eduardo","full_name":"Tarazona Santos, Eduardo"},{"full_name":"Machado, Moara","first_name":"Moara","last_name":"Machado"},{"full_name":"Magalhães, Wagner","first_name":"Wagner","last_name":"Magalhães"},{"first_name":"Renee","full_name":"Chen, Renee","last_name":"Chen"},{"last_name":"Lyon","full_name":"Lyon, Fernanda","first_name":"Fernanda"},{"full_name":"Burdett, Laurie","first_name":"Laurie","last_name":"Burdett"},{"last_name":"Crenshaw","first_name":"Andrew","full_name":"Crenshaw, Andrew"},{"last_name":"Fabbri","full_name":"Fabbri, Cristina","first_name":"Cristina"},{"first_name":"Latife","full_name":"Pereira, Latife","last_name":"Pereira"},{"full_name":"Pinto, Laelia","first_name":"Laelia","last_name":"Pinto"},{"id":"409D5C96-F248-11E8-B48F-1D18A9856A87","last_name":"Fernandes Redondo","orcid":"0000-0002-5837-2793","first_name":"Rodrigo A","full_name":"Fernandes Redondo, Rodrigo A"},{"full_name":"Sestanovich, Ben","first_name":"Ben","last_name":"Sestanovich"},{"first_name":"Meredith","full_name":"Yeager, Meredith","last_name":"Yeager"},{"first_name":"Stephen","full_name":"Chanock, Stephen","last_name":"Chanock"}],"issue":"9","page":"2157 - 2167","abstract":[{"lang":"eng","text":"The phagocyte NADPH oxidase catalyzes the reduction of O2 to reactive oxygen species with microbicidal activity. It is composed of two membrane-spanning subunits, gp91-phox and p22-phox (encoded by CYBB and CYBA, respectively), and three cytoplasmic subunits, p40-phox, p47-phox, and p67-phox (encoded by NCF4, NCF1, and NCF2, respectively). Mutations in any of these genes can result in chronic granulomatous disease, a primary immunodeficiency characterized by recurrent infections. Using evolutionary mapping, we determined that episodes of adaptive natural selection have shaped the extracellular portion of gp91-phox during the evolution of mammals, which suggests that this region may have a function in host-pathogen interactions. On the basis of a resequencing analysis of approximately 35 kb of CYBB, CYBA, NCF2, and NCF4 in 102 ethnically diverse individuals (24 of African ancestry, 31 of European ancestry, 24 of Asian/Oceanians, and 23 US Hispanics), we show that the pattern of CYBA diversity is compatible with balancing natural selection, perhaps mediated by catalase-positive pathogens. NCF2 in Asian populations shows a pattern of diversity characterized by a differentiated haplotype structure. Our study provides insight into the role of pathogen-driven natural selection in an innate immune pathway and sheds light on the role of CYBA in endothelial, nonphagocytic NADPH oxidases, which are relevant in the pathogenesis of cardiovascular and other complex diseases."}],"date_updated":"2021-01-12T08:01:12Z","intvolume":"        30","type":"journal_article","publisher":"Oxford University Press","department":[{"_id":"JoBo"}],"title":"Evolutionary dynamics of the human NADPH oxidase genes CYBB, CYBA, NCF2, and NCF4: Functional implications","date_published":"2013-09-01T00:00:00Z","_id":"508","publication_status":"published","citation":{"short":"E. Tarazona Santos, M. Machado, W. Magalhães, R. Chen, F. Lyon, L. Burdett, A. Crenshaw, C. Fabbri, L. Pereira, L. Pinto, R.A. Fernandes Redondo, B. Sestanovich, M. Yeager, S. Chanock, Molecular Biology and Evolution 30 (2013) 2157–2167.","mla":"Tarazona Santos, Eduardo, et al. “Evolutionary Dynamics of the Human NADPH Oxidase Genes CYBB, CYBA, NCF2, and NCF4: Functional Implications.” <i>Molecular Biology and Evolution</i>, vol. 30, no. 9, Oxford University Press, 2013, pp. 2157–67, doi:<a href=\"https://doi.org/10.1093/molbev/mst119\">10.1093/molbev/mst119</a>.","chicago":"Tarazona Santos, Eduardo, Moara Machado, Wagner Magalhães, Renee Chen, Fernanda Lyon, Laurie Burdett, Andrew Crenshaw, et al. “Evolutionary Dynamics of the Human NADPH Oxidase Genes CYBB, CYBA, NCF2, and NCF4: Functional Implications.” <i>Molecular Biology and Evolution</i>. Oxford University Press, 2013. <a href=\"https://doi.org/10.1093/molbev/mst119\">https://doi.org/10.1093/molbev/mst119</a>.","apa":"Tarazona Santos, E., Machado, M., Magalhães, W., Chen, R., Lyon, F., Burdett, L., … Chanock, S. (2013). Evolutionary dynamics of the human NADPH oxidase genes CYBB, CYBA, NCF2, and NCF4: Functional implications. <i>Molecular Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/molbev/mst119\">https://doi.org/10.1093/molbev/mst119</a>","ama":"Tarazona Santos E, Machado M, Magalhães W, et al. Evolutionary dynamics of the human NADPH oxidase genes CYBB, CYBA, NCF2, and NCF4: Functional implications. <i>Molecular Biology and Evolution</i>. 2013;30(9):2157-2167. doi:<a href=\"https://doi.org/10.1093/molbev/mst119\">10.1093/molbev/mst119</a>","ieee":"E. Tarazona Santos <i>et al.</i>, “Evolutionary dynamics of the human NADPH oxidase genes CYBB, CYBA, NCF2, and NCF4: Functional implications,” <i>Molecular Biology and Evolution</i>, vol. 30, no. 9. Oxford University Press, pp. 2157–2167, 2013.","ista":"Tarazona Santos E, Machado M, Magalhães W, Chen R, Lyon F, Burdett L, Crenshaw A, Fabbri C, Pereira L, Pinto L, Fernandes Redondo RA, Sestanovich B, Yeager M, Chanock S. 2013. Evolutionary dynamics of the human NADPH oxidase genes CYBB, CYBA, NCF2, and NCF4: Functional implications. Molecular Biology and Evolution. 30(9), 2157–2167."},"date_created":"2018-12-11T11:46:52Z"},{"scopus_import":1,"oa_version":"Submitted Version","external_id":{"pmid":["23975899"]},"quality_controlled":"1","year":"2013","language":[{"iso":"eng"}],"status":"public","month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7311","day":"01","pmid":1,"doi":"10.1105/tpc.113.114058","publication":"Plant Cell","oa":1,"volume":25,"issue":"8","author":[{"last_name":"Di Rubbo","full_name":"Di Rubbo, Simone","first_name":"Simone"},{"full_name":"Irani, Niloufer","first_name":"Niloufer","last_name":"Irani"},{"full_name":"Kim, Soo","first_name":"Soo","last_name":"Kim"},{"last_name":"Xu","full_name":"Xu, Zheng","first_name":"Zheng"},{"last_name":"Gadeyne","first_name":"Astrid","full_name":"Gadeyne, Astrid"},{"last_name":"Dejonghe","full_name":"Dejonghe, Wim","first_name":"Wim"},{"last_name":"Vanhoutte","full_name":"Vanhoutte, Isabelle","first_name":"Isabelle"},{"first_name":"Geert","full_name":"Persiau, Geert","last_name":"Persiau"},{"full_name":"Eeckhout, Dominique","first_name":"Dominique","last_name":"Eeckhout"},{"last_name":"Simon","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","full_name":"Simon, Sibu","first_name":"Sibu","orcid":"0000-0002-1998-6741"},{"first_name":"Kyungyoung","full_name":"Song, Kyungyoung","last_name":"Song"},{"last_name":"Kleine Vehn","full_name":"Kleine Vehn, Jürgen","first_name":"Jürgen"},{"full_name":"Friml, Jirí","first_name":"Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"De Jaeger","full_name":"De Jaeger, Geert","first_name":"Geert"},{"full_name":"Van Damme, Daniël","first_name":"Daniël","last_name":"Van Damme"},{"last_name":"Hwang","first_name":"Inhwan","full_name":"Hwang, Inhwan"},{"full_name":"Russinova, Eugenia","first_name":"Eugenia","last_name":"Russinova"}],"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3784593/","open_access":"1"}],"date_updated":"2021-01-12T08:01:13Z","page":"2986 - 2997","abstract":[{"lang":"eng","text":"Clathrin-mediated endocytosis (CME) regulates many aspects of plant development, including hormone signaling and responses to environmental stresses. Despite the importance of this process, the machinery that regulates CME in plants is largely unknown. In mammals, the heterotetrameric ADAPTOR PROTEIN COMPLEX-2 (AP-2) is required for the formation of clathrin-coated vesicles at the plasma membrane (PM). Although the existence of AP-2 has been predicted in Arabidopsis thaliana, the biochemistry and functionality of the complex is still uncharacterized. Here, we identified all the subunits of the Arabidopsis AP-2 by tandem affinity purification and found that one of the large AP-2 subunits, AP2A1, localized at the PM and interacted with clathrin. Furthermore, endocytosis of the leucine-rich repeat receptor kinase, BRASSINOSTEROID INSENSITIVE1 (BRI1), was shown to depend on AP-2. Knockdown of the two Arabidopsis AP2A genes or overexpression of a dominant-negative version of the medium AP-2 subunit, AP2M, impaired BRI1 endocytosis and enhanced the brassinosteroid signaling. Our data reveal that the CME machinery in Arabidopsis is evolutionarily conserved and that AP-2 functions in receptormediated endocytosis. "}],"type":"journal_article","intvolume":"        25","publisher":"American Society of Plant Biologists","department":[{"_id":"JiFr"}],"date_published":"2013-08-01T00:00:00Z","_id":"509","title":"The clathrin adaptor complex AP-2 mediates endocytosis of brassinosteroid INSENSITIVE1 in arabidopsis","citation":{"short":"S. Di Rubbo, N. Irani, S. Kim, Z. Xu, A. Gadeyne, W. Dejonghe, I. Vanhoutte, G. Persiau, D. Eeckhout, S. Simon, K. Song, J. Kleine Vehn, J. Friml, G. De Jaeger, D. Van Damme, I. Hwang, E. Russinova, Plant Cell 25 (2013) 2986–2997.","mla":"Di Rubbo, Simone, et al. “The Clathrin Adaptor Complex AP-2 Mediates Endocytosis of Brassinosteroid INSENSITIVE1 in Arabidopsis.” <i>Plant Cell</i>, vol. 25, no. 8, American Society of Plant Biologists, 2013, pp. 2986–97, doi:<a href=\"https://doi.org/10.1105/tpc.113.114058\">10.1105/tpc.113.114058</a>.","chicago":"Di Rubbo, Simone, Niloufer Irani, Soo Kim, Zheng Xu, Astrid Gadeyne, Wim Dejonghe, Isabelle Vanhoutte, et al. “The Clathrin Adaptor Complex AP-2 Mediates Endocytosis of Brassinosteroid INSENSITIVE1 in Arabidopsis.” <i>Plant Cell</i>. American Society of Plant Biologists, 2013. <a href=\"https://doi.org/10.1105/tpc.113.114058\">https://doi.org/10.1105/tpc.113.114058</a>.","apa":"Di Rubbo, S., Irani, N., Kim, S., Xu, Z., Gadeyne, A., Dejonghe, W., … Russinova, E. (2013). The clathrin adaptor complex AP-2 mediates endocytosis of brassinosteroid INSENSITIVE1 in arabidopsis. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.113.114058\">https://doi.org/10.1105/tpc.113.114058</a>","ieee":"S. Di Rubbo <i>et al.</i>, “The clathrin adaptor complex AP-2 mediates endocytosis of brassinosteroid INSENSITIVE1 in arabidopsis,” <i>Plant Cell</i>, vol. 25, no. 8. American Society of Plant Biologists, pp. 2986–2997, 2013.","ama":"Di Rubbo S, Irani N, Kim S, et al. The clathrin adaptor complex AP-2 mediates endocytosis of brassinosteroid INSENSITIVE1 in arabidopsis. <i>Plant Cell</i>. 2013;25(8):2986-2997. doi:<a href=\"https://doi.org/10.1105/tpc.113.114058\">10.1105/tpc.113.114058</a>","ista":"Di Rubbo S, Irani N, Kim S, Xu Z, Gadeyne A, Dejonghe W, Vanhoutte I, Persiau G, Eeckhout D, Simon S, Song K, Kleine Vehn J, Friml J, De Jaeger G, Van Damme D, Hwang I, Russinova E. 2013. The clathrin adaptor complex AP-2 mediates endocytosis of brassinosteroid INSENSITIVE1 in arabidopsis. Plant Cell. 25(8), 2986–2997."},"publication_status":"published","date_created":"2018-12-11T11:46:52Z"},{"department":[{"_id":"JiFr"}],"publisher":"American Society of Plant Biologists","date_created":"2018-12-11T11:46:53Z","citation":{"chicago":"Pěnčík, Aleš, Biljana Simonovik, Sara Petersson, Eva Henyková, Sibu Simon, Kathleen Greenham, Yi Zhang, et al. “Regulation of Auxin Homeostasis and Gradients in Arabidopsis Roots through the Formation of the Indole-3-Acetic Acid Catabolite 2-Oxindole-3-Acetic Acid.” <i>Plant Cell</i>. American Society of Plant Biologists, 2013. <a href=\"https://doi.org/10.1105/tpc.113.114421\">https://doi.org/10.1105/tpc.113.114421</a>.","mla":"Pěnčík, Aleš, et al. “Regulation of Auxin Homeostasis and Gradients in Arabidopsis Roots through the Formation of the Indole-3-Acetic Acid Catabolite 2-Oxindole-3-Acetic Acid.” <i>Plant Cell</i>, vol. 25, no. 10, American Society of Plant Biologists, 2013, pp. 3858–70, doi:<a href=\"https://doi.org/10.1105/tpc.113.114421\">10.1105/tpc.113.114421</a>.","short":"A. Pěnčík, B. Simonovik, S. Petersson, E. Henyková, S. Simon, K. Greenham, Y. Zhang, M. Kowalczyk, M. Estelle, E. Zažímalová, O. Novák, G. Sandberg, K. Ljung, Plant Cell 25 (2013) 3858–3870.","ama":"Pěnčík A, Simonovik B, Petersson S, et al. Regulation of auxin homeostasis and gradients in Arabidopsis roots through the formation of the indole-3-acetic acid catabolite 2-oxindole-3-acetic acid. <i>Plant Cell</i>. 2013;25(10):3858-3870. doi:<a href=\"https://doi.org/10.1105/tpc.113.114421\">10.1105/tpc.113.114421</a>","ieee":"A. Pěnčík <i>et al.</i>, “Regulation of auxin homeostasis and gradients in Arabidopsis roots through the formation of the indole-3-acetic acid catabolite 2-oxindole-3-acetic acid,” <i>Plant Cell</i>, vol. 25, no. 10. American Society of Plant Biologists, pp. 3858–3870, 2013.","apa":"Pěnčík, A., Simonovik, B., Petersson, S., Henyková, E., Simon, S., Greenham, K., … Ljung, K. (2013). Regulation of auxin homeostasis and gradients in Arabidopsis roots through the formation of the indole-3-acetic acid catabolite 2-oxindole-3-acetic acid. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.113.114421\">https://doi.org/10.1105/tpc.113.114421</a>","ista":"Pěnčík A, Simonovik B, Petersson S, Henyková E, Simon S, Greenham K, Zhang Y, Kowalczyk M, Estelle M, Zažímalová E, Novák O, Sandberg G, Ljung K. 2013. Regulation of auxin homeostasis and gradients in Arabidopsis roots through the formation of the indole-3-acetic acid catabolite 2-oxindole-3-acetic acid. Plant Cell. 25(10), 3858–3870."},"publication_status":"published","title":"Regulation of auxin homeostasis and gradients in Arabidopsis roots through the formation of the indole-3-acetic acid catabolite 2-oxindole-3-acetic acid","date_published":"2013-10-01T00:00:00Z","_id":"511","abstract":[{"text":"The native auxin, indole-3-acetic acid (IAA), is a major regulator of plant growth and development. Its nonuniform distribution between cells and tissues underlies the spatiotemporal coordination of many developmental events and responses to environmental stimuli. The regulation of auxin gradients and the formation of auxin maxima/minima most likely involve the regulation of both metabolic and transport processes. In this article, we have demonstrated that 2-oxindole-3-acetic acid (oxIAA) is a major primary IAA catabolite formed in Arabidopsis thaliana root tissues. OxIAA had little biological activity and was formed rapidly and irreversibly in response to increases in auxin levels. We further showed that there is cell type-specific regulation of oxIAA levels in the Arabidopsis root apex. We propose that oxIAA is an important element in the regulation of output from auxin gradients and, therefore, in the regulation of auxin homeostasis and response mechanisms.","lang":"eng"}],"page":"3858 - 3870","date_updated":"2021-01-12T08:01:15Z","author":[{"full_name":"Pěnčík, Aleš","first_name":"Aleš","last_name":"Pěnčík"},{"first_name":"Biljana","full_name":"Simonovik, Biljana","last_name":"Simonovik"},{"last_name":"Petersson","full_name":"Petersson, Sara","first_name":"Sara"},{"full_name":"Henyková, Eva","first_name":"Eva","last_name":"Henyková"},{"orcid":"0000-0002-1998-6741","first_name":"Sibu","full_name":"Simon, Sibu","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","last_name":"Simon"},{"full_name":"Greenham, Kathleen","first_name":"Kathleen","last_name":"Greenham"},{"first_name":"Yi","full_name":"Zhang, Yi","last_name":"Zhang"},{"full_name":"Kowalczyk, Mariusz","first_name":"Mariusz","last_name":"Kowalczyk"},{"last_name":"Estelle","first_name":"Mark","full_name":"Estelle, Mark"},{"last_name":"Zažímalová","full_name":"Zažímalová, Eva","first_name":"Eva"},{"first_name":"Ondřej","full_name":"Novák, Ondřej","last_name":"Novák"},{"full_name":"Sandberg, Göran","first_name":"Göran","last_name":"Sandberg"},{"last_name":"Ljung","full_name":"Ljung, Karin","first_name":"Karin"}],"main_file_link":[{"open_access":"1","url":"www.doi.org/10.1105/tpc.113.114421"}],"issue":"10","type":"journal_article","intvolume":"        25","publication":"Plant Cell","doi":"10.1105/tpc.113.114421","volume":25,"oa":1,"quality_controlled":"1","external_id":{"pmid":["24163311"]},"oa_version":"Published Version","scopus_import":1,"pmid":1,"day":"01","publist_id":"7309","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","language":[{"iso":"eng"}],"year":"2013","status":"public"},{"publication":"Molecular Systems Biology","doi":"10.1038/msb.2013.40","volume":9,"oa":1,"quality_controlled":"1","has_accepted_license":"1","oa_version":"Published Version","scopus_import":1,"day":"10","pubrep_id":"936","publist_id":"7303","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"09","year":"2013","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","tmp":{"short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"file":[{"date_updated":"2020-07-14T12:46:36Z","checksum":"9c4fbe793af4bb22b3fe50cc677a39bf","relation":"main_file","access_level":"open_access","creator":"system","file_id":"4644","file_size":3257692,"file_name":"IST-2018-936-v1+1_2008_Barton_A_map.pdf","date_created":"2018-12-12T10:07:46Z","content_type":"application/pdf"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","department":[{"_id":"JiFr"}],"publisher":"Nature Publishing Group","date_created":"2018-12-11T11:46:55Z","publication_status":"published","citation":{"ista":"Bargmann B, Vanneste S, Krouk G, Nawy T, Efroni I, Shani E, Choe G, Friml J, Bergmann D, Estelle M, Birnbaum K. 2013. A map of cell type‐specific auxin responses. Molecular Systems Biology. 9(1), 688.","ieee":"B. Bargmann <i>et al.</i>, “A map of cell type‐specific auxin responses,” <i>Molecular Systems Biology</i>, vol. 9, no. 1. Nature Publishing Group, 2013.","ama":"Bargmann B, Vanneste S, Krouk G, et al. A map of cell type‐specific auxin responses. <i>Molecular Systems Biology</i>. 2013;9(1). doi:<a href=\"https://doi.org/10.1038/msb.2013.40\">10.1038/msb.2013.40</a>","apa":"Bargmann, B., Vanneste, S., Krouk, G., Nawy, T., Efroni, I., Shani, E., … Birnbaum, K. (2013). A map of cell type‐specific auxin responses. <i>Molecular Systems Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/msb.2013.40\">https://doi.org/10.1038/msb.2013.40</a>","mla":"Bargmann, Bastiaan, et al. “A Map of Cell Type‐specific Auxin Responses.” <i>Molecular Systems Biology</i>, vol. 9, no. 1, 688, Nature Publishing Group, 2013, doi:<a href=\"https://doi.org/10.1038/msb.2013.40\">10.1038/msb.2013.40</a>.","chicago":"Bargmann, Bastiaan, Steffen Vanneste, Gabriel Krouk, Tal Nawy, Idan Efroni, Eilon Shani, Goh Choe, et al. “A Map of Cell Type‐specific Auxin Responses.” <i>Molecular Systems Biology</i>. Nature Publishing Group, 2013. <a href=\"https://doi.org/10.1038/msb.2013.40\">https://doi.org/10.1038/msb.2013.40</a>.","short":"B. Bargmann, S. Vanneste, G. Krouk, T. Nawy, I. Efroni, E. Shani, G. Choe, J. Friml, D. Bergmann, M. Estelle, K. Birnbaum, Molecular Systems Biology 9 (2013)."},"title":"A map of cell type‐specific auxin responses","_id":"516","date_published":"2013-09-10T00:00:00Z","article_number":"688","abstract":[{"text":"In plants, changes in local auxin concentrations can trigger a range of developmental processes as distinct tissues respond differently to the same auxin stimulus. However, little is known about how auxin is interpreted by individual cell types. We performed a transcriptomic analysis of responses to auxin within four distinct tissues of the Arabidopsis thaliana root and demonstrate that different cell types show competence for discrete responses. The majority of auxin‐responsive genes displayed a spatial bias in their induction or repression. The novel data set was used to examine how auxin influences tissue‐specific transcriptional regulation of cell‐identity markers. Additionally, the data were used in combination with spatial expression maps of the root to plot a transcriptomic auxin‐response gradient across the apical and basal meristem. The readout revealed a strong correlation for thousands of genes between the relative response to auxin and expression along the longitudinal axis of the root. This data set and comparative analysis provide a transcriptome‐level spatial breakdown of the response to auxin within an organ where this hormone mediates many aspects of development.","lang":"eng"}],"date_updated":"2021-01-12T08:01:17Z","author":[{"first_name":"Bastiaan","full_name":"Bargmann, Bastiaan","last_name":"Bargmann"},{"first_name":"Steffen","full_name":"Vanneste, Steffen","last_name":"Vanneste"},{"last_name":"Krouk","full_name":"Krouk, Gabriel","first_name":"Gabriel"},{"last_name":"Nawy","full_name":"Nawy, Tal","first_name":"Tal"},{"full_name":"Efroni, Idan","first_name":"Idan","last_name":"Efroni"},{"first_name":"Eilon","full_name":"Shani, Eilon","last_name":"Shani"},{"full_name":"Choe, Goh","first_name":"Goh","last_name":"Choe"},{"first_name":"Jirí","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml"},{"full_name":"Bergmann, Dominique","first_name":"Dominique","last_name":"Bergmann"},{"first_name":"Mark","full_name":"Estelle, Mark","last_name":"Estelle"},{"first_name":"Kenneth","full_name":"Birnbaum, Kenneth","last_name":"Birnbaum"}],"file_date_updated":"2020-07-14T12:46:36Z","issue":"1","ddc":["581"],"type":"journal_article","intvolume":"         9"},{"date_created":"2018-12-11T11:46:57Z","citation":{"short":"E. Fuertbauer, J. Zaujec, P. Uhrin, I. Raab, M. Weber, H. Schachner, M. Bauer, G. Schütz, B. Binder, M.K. Sixt, D. Kerjaschki, H. Stockinger, Immunology Letters 154 (2013) 31–41.","chicago":"Fuertbauer, Elke, Jan Zaujec, Pavel Uhrin, Ingrid Raab, Michele Weber, Helga Schachner, Miroslav Bauer, et al. “Thymic Medullar Conduits-Associated Podoplanin Promotes Natural Regulatory T Cells.” <i>Immunology Letters</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.imlet.2013.07.007\">https://doi.org/10.1016/j.imlet.2013.07.007</a>.","mla":"Fuertbauer, Elke, et al. “Thymic Medullar Conduits-Associated Podoplanin Promotes Natural Regulatory T Cells.” <i>Immunology Letters</i>, vol. 154, no. 1–2, Elsevier, 2013, pp. 31–41, doi:<a href=\"https://doi.org/10.1016/j.imlet.2013.07.007\">10.1016/j.imlet.2013.07.007</a>.","apa":"Fuertbauer, E., Zaujec, J., Uhrin, P., Raab, I., Weber, M., Schachner, H., … Stockinger, H. (2013). Thymic medullar conduits-associated podoplanin promotes natural regulatory T cells. <i>Immunology Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.imlet.2013.07.007\">https://doi.org/10.1016/j.imlet.2013.07.007</a>","ama":"Fuertbauer E, Zaujec J, Uhrin P, et al. Thymic medullar conduits-associated podoplanin promotes natural regulatory T cells. <i>Immunology Letters</i>. 2013;154(1-2):31-41. doi:<a href=\"https://doi.org/10.1016/j.imlet.2013.07.007\">10.1016/j.imlet.2013.07.007</a>","ieee":"E. Fuertbauer <i>et al.</i>, “Thymic medullar conduits-associated podoplanin promotes natural regulatory T cells,” <i>Immunology Letters</i>, vol. 154, no. 1–2. Elsevier, pp. 31–41, 2013.","ista":"Fuertbauer E, Zaujec J, Uhrin P, Raab I, Weber M, Schachner H, Bauer M, Schütz G, Binder B, Sixt MK, Kerjaschki D, Stockinger H. 2013. Thymic medullar conduits-associated podoplanin promotes natural regulatory T cells. Immunology Letters. 154(1–2), 31–41."},"publication_status":"published","date_published":"2013-07-01T00:00:00Z","_id":"522","title":"Thymic medullar conduits-associated podoplanin promotes natural regulatory T cells","volume":154,"publication":"Immunology Letters","department":[{"_id":"MiSi"}],"doi":"10.1016/j.imlet.2013.07.007","publisher":"Elsevier","publist_id":"7300","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","type":"journal_article","year":"2013","intvolume":"       154","status":"public","language":[{"iso":"eng"}],"month":"07","date_updated":"2021-01-12T08:01:22Z","abstract":[{"text":"Podoplanin, a mucin-like plasma membrane protein, is expressed by lymphatic endothelial cells and responsible for separation of blood and lymphatic circulation through activation of platelets. Here we show that podoplanin is also expressed by thymic fibroblastic reticular cells (tFRC), a novel thymic medulla stroma cell type associated with thymic conduits, and involved in development of natural regulatory T cells (nTreg). Young mice deficient in podoplanin lack nTreg owing to retardation of CD4+CD25+ thymocytes in the cortex and missing differentiation of Foxp3+ thymocytes in the medulla. This might be due to CCL21 that delocalizes upon deletion of the CCL21-binding podoplanin from medullar tFRC to cortex areas. The animals do not remain devoid of nTreg but generate them delayed within the first month resulting in Th2-biased hypergammaglobulinemia but not in the death-causing autoimmune phenotype of Foxp3-deficient Scurfy mice.","lang":"eng"}],"quality_controlled":"1","page":"31 - 41","scopus_import":1,"issue":"1-2","author":[{"first_name":"Elke","full_name":"Fuertbauer, Elke","last_name":"Fuertbauer"},{"first_name":"Jan","full_name":"Zaujec, Jan","last_name":"Zaujec"},{"last_name":"Uhrin","full_name":"Uhrin, Pavel","first_name":"Pavel"},{"last_name":"Raab","first_name":"Ingrid","full_name":"Raab, Ingrid"},{"id":"3A3FC708-F248-11E8-B48F-1D18A9856A87","last_name":"Weber","full_name":"Weber, Michele","first_name":"Michele"},{"last_name":"Schachner","first_name":"Helga","full_name":"Schachner, Helga"},{"last_name":"Bauer","full_name":"Bauer, Miroslav","first_name":"Miroslav"},{"last_name":"Schütz","first_name":"Gerhard","full_name":"Schütz, Gerhard"},{"full_name":"Binder, Bernd","first_name":"Bernd","last_name":"Binder"},{"last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","first_name":"Michael K"},{"first_name":"Dontscho","full_name":"Kerjaschki, Dontscho","last_name":"Kerjaschki"},{"first_name":"Hannes","full_name":"Stockinger, Hannes","last_name":"Stockinger"}],"oa_version":"None"},{"title":"Modeling framework for the establishment of the apical-basal embryonic axis in plants","ec_funded":1,"volume":23,"_id":"527","date_published":"2013-12-16T00:00:00Z","date_created":"2018-12-11T11:46:58Z","publication_status":"published","citation":{"ista":"Wabnik KT, Robert H, Smith R, Friml J. 2013. Modeling framework for the establishment of the apical-basal embryonic axis in plants. Current Biology. 23(24), 2513–2518.","short":"K.T. Wabnik, H. Robert, R. Smith, J. Friml, Current Biology 23 (2013) 2513–2518.","chicago":"Wabnik, Krzysztof T, Hélène Robert, Richard Smith, and Jiří Friml. “Modeling Framework for the Establishment of the Apical-Basal Embryonic Axis in Plants.” <i>Current Biology</i>. Cell Press, 2013. <a href=\"https://doi.org/10.1016/j.cub.2013.10.038\">https://doi.org/10.1016/j.cub.2013.10.038</a>.","mla":"Wabnik, Krzysztof T., et al. “Modeling Framework for the Establishment of the Apical-Basal Embryonic Axis in Plants.” <i>Current Biology</i>, vol. 23, no. 24, Cell Press, 2013, pp. 2513–18, doi:<a href=\"https://doi.org/10.1016/j.cub.2013.10.038\">10.1016/j.cub.2013.10.038</a>.","apa":"Wabnik, K. T., Robert, H., Smith, R., &#38; Friml, J. (2013). Modeling framework for the establishment of the apical-basal embryonic axis in plants. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2013.10.038\">https://doi.org/10.1016/j.cub.2013.10.038</a>","ieee":"K. T. Wabnik, H. Robert, R. Smith, and J. Friml, “Modeling framework for the establishment of the apical-basal embryonic axis in plants,” <i>Current Biology</i>, vol. 23, no. 24. Cell Press, pp. 2513–2518, 2013.","ama":"Wabnik KT, Robert H, Smith R, Friml J. Modeling framework for the establishment of the apical-basal embryonic axis in plants. <i>Current Biology</i>. 2013;23(24):2513-2518. doi:<a href=\"https://doi.org/10.1016/j.cub.2013.10.038\">10.1016/j.cub.2013.10.038</a>"},"department":[{"_id":"EvBe"},{"_id":"JiFr"}],"project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300"}],"publisher":"Cell Press","doi":"10.1016/j.cub.2013.10.038","publication":"Current Biology","month":"12","intvolume":"        23","year":"2013","status":"public","type":"journal_article","language":[{"iso":"eng"}],"day":"16","publist_id":"7292","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","author":[{"last_name":"Wabnik","id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","full_name":"Wabnik, Krzysztof T","first_name":"Krzysztof T","orcid":"0000-0001-7263-0560"},{"full_name":"Robert, Hélène","first_name":"Hélène","last_name":"Robert"},{"full_name":"Smith, Richard","first_name":"Richard","last_name":"Smith"},{"orcid":"0000-0002-8302-7596","first_name":"Jirí","full_name":"Friml, Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"issue":"24","quality_controlled":"1","abstract":[{"text":"The apical-basal axis of the early plant embryo determines the body plan of the adult organism. To establish a polarized embryonic axis, plants evolved a unique mechanism that involves directional, cell-to-cell transport of the growth regulator auxin. Auxin transport relies on PIN auxin transporters [1], whose polar subcellular localization determines the flow directionality. PIN-mediated auxin transport mediates the spatial and temporal activity of the auxin response machinery [2-7] that contributes to embryo patterning processes, including establishment of the apical (shoot) and basal (root) embryo poles [8]. However, little is known of upstream mechanisms guiding the (re)polarization of auxin fluxes during embryogenesis [9]. Here, we developed a model of plant embryogenesis that correctly generates emergent cell polarities and auxin-mediated sequential initiation of apical-basal axis of plant embryo. The model relies on two precisely localized auxin sources and a feedback between auxin and the polar, subcellular PIN transporter localization. Simulations reproduced PIN polarity and auxin distribution, as well as previously unknown polarization events during early embryogenesis. The spectrum of validated model predictions suggests that our model corresponds to a minimal mechanistic framework for initiation and orientation of the apical-basal axis to guide both embryonic and postembryonic plant development.","lang":"eng"}],"page":"2513 - 2518","date_updated":"2021-01-12T08:01:24Z"},{"day":"16","publist_id":"7291","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","year":"2013","intvolume":"        23","type":"journal_article","status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","abstract":[{"text":"Establishment of the embryonic axis foreshadows the main body axis of adults both in plants and in animals, but underlying mechanisms are considered distinct. Plants utilize directional, cell-to-cell transport of the growth hormone auxin [1, 2] to generate an asymmetric auxin response that specifies the embryonic apical-basal axis [3-6]. The auxin flow directionality depends on the polarized subcellular localization of PIN-FORMED (PIN) auxin transporters [7, 8]. It remains unknown which mechanisms and spatial cues guide cell polarization and axis orientation in early embryos. Herein, we provide conceptually novel insights into the formation of embryonic axis in Arabidopsis by identifying a crucial role of localized tryptophan-dependent auxin biosynthesis [9-12]. Local auxin production at the base of young embryos and the accompanying PIN7-mediated auxin flow toward the proembryo are required for the apical auxin response maximum and the specification of apical embryonic structures. Later in embryogenesis, the precisely timed onset of localized apical auxin biosynthesis mediates PIN1 polarization, basal auxin response maximum, and specification of the root pole. Thus, the tight spatiotemporal control of distinct local auxin sources provides a necessary, non-cell-autonomous trigger for the coordinated cell polarization and subsequent apical-basal axis orientation during embryogenesis and, presumably, also for other polarization events during postembryonic plant life [13, 14].","lang":"eng"}],"page":"2506 - 2512","date_updated":"2021-01-12T08:01:25Z","oa_version":"None","author":[{"last_name":"Robert","first_name":"Hélène","full_name":"Robert, Hélène"},{"id":"399876EC-F248-11E8-B48F-1D18A9856A87","last_name":"Grones","full_name":"Grones, Peter","first_name":"Peter"},{"last_name":"Stepanova","full_name":"Stepanova, Anna","first_name":"Anna"},{"last_name":"Robles","full_name":"Robles, Linda","first_name":"Linda"},{"first_name":"Annemarie","full_name":"Lokerse, Annemarie","last_name":"Lokerse"},{"last_name":"Alonso","first_name":"Jose","full_name":"Alonso, Jose"},{"last_name":"Weijers","first_name":"Dolf","full_name":"Weijers, Dolf"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","first_name":"Jirí","orcid":"0000-0002-8302-7596"}],"scopus_import":1,"issue":"24","date_created":"2018-12-11T11:46:59Z","citation":{"chicago":"Robert, Hélène, Peter Grones, Anna Stepanova, Linda Robles, Annemarie Lokerse, Jose Alonso, Dolf Weijers, and Jiří Friml. “Local Auxin Sources Orient the Apical Basal Axis in Arabidopsis Embryos.” <i>Current Biology</i>. Cell Press, 2013. <a href=\"https://doi.org/10.1016/j.cub.2013.09.039\">https://doi.org/10.1016/j.cub.2013.09.039</a>.","mla":"Robert, Hélène, et al. “Local Auxin Sources Orient the Apical Basal Axis in Arabidopsis Embryos.” <i>Current Biology</i>, vol. 23, no. 24, Cell Press, 2013, pp. 2506–12, doi:<a href=\"https://doi.org/10.1016/j.cub.2013.09.039\">10.1016/j.cub.2013.09.039</a>.","short":"H. Robert, P. Grones, A. Stepanova, L. Robles, A. Lokerse, J. Alonso, D. Weijers, J. Friml, Current Biology 23 (2013) 2506–2512.","ieee":"H. Robert <i>et al.</i>, “Local auxin sources orient the apical basal axis in arabidopsis embryos,” <i>Current Biology</i>, vol. 23, no. 24. Cell Press, pp. 2506–2512, 2013.","ama":"Robert H, Grones P, Stepanova A, et al. Local auxin sources orient the apical basal axis in arabidopsis embryos. <i>Current Biology</i>. 2013;23(24):2506-2512. doi:<a href=\"https://doi.org/10.1016/j.cub.2013.09.039\">10.1016/j.cub.2013.09.039</a>","apa":"Robert, H., Grones, P., Stepanova, A., Robles, L., Lokerse, A., Alonso, J., … Friml, J. (2013). Local auxin sources orient the apical basal axis in arabidopsis embryos. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2013.09.039\">https://doi.org/10.1016/j.cub.2013.09.039</a>","ista":"Robert H, Grones P, Stepanova A, Robles L, Lokerse A, Alonso J, Weijers D, Friml J. 2013. Local auxin sources orient the apical basal axis in arabidopsis embryos. Current Biology. 23(24), 2506–2512."},"publication_status":"published","ec_funded":1,"volume":23,"title":"Local auxin sources orient the apical basal axis in arabidopsis embryos","date_published":"2013-12-16T00:00:00Z","_id":"528","publication":"Current Biology","department":[{"_id":"JiFr"}],"project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300"}],"doi":"10.1016/j.cub.2013.09.039","publisher":"Cell Press"},{"month":"01","status":"public","year":"2013","language":[{"iso":"eng"}],"day":"01","publist_id":"4801","pubrep_id":"198","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","related_material":{"record":[{"relation":"later_version","id":"10901","status":"deleted"}]},"scopus_import":1,"quality_controlled":"1","has_accepted_license":"1","oa":1,"project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23"}],"doi":"10.1145/2429069.2429109","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","type":"conference","ddc":["000","004"],"publication_identifier":{"isbn":["978-1-4503-1832-7"]},"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Kirsch","full_name":"Kirsch, Christoph","first_name":"Christoph"},{"first_name":"Hannes","full_name":"Payer, Hannes","last_name":"Payer"},{"first_name":"Ali","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","last_name":"Sezgin"},{"last_name":"Sokolova","first_name":"Ana","full_name":"Sokolova, Ana"}],"acknowledgement":" and an Elise Richter Fellowship (Austrian Science Fund V00125). ","file_date_updated":"2020-07-14T12:45:31Z","page":"317 - 328","abstract":[{"text":"There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be achieved at the expense of relaxing correctness, by redefining the semantics of data structures. We address such a redefinition of data structure semantics and present a systematic and formal framework for obtaining new data structures by quantitatively relaxing existing ones. We view a data structure as a sequential specification S containing all &quot;legal&quot; sequences over an alphabet of method calls. Relaxing the data structure corresponds to defining a distance from any sequence over the alphabet to the sequential specification: the k-relaxed sequential specification contains all sequences over the alphabet within distance k from the original specification. In contrast to other existing work, our relaxations are semantic (distance in terms of data structure states). As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances. We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic relaxation (distance in terms of sequence manipulation, e.g. edit distance). We give concurrent implementations of relaxed data structures and demonstrate that bounded relaxations provide the means for trading correctness for performance in a controlled way. The relaxations are monotonic which further highlights the trade-off: increasing k increases the number of permitted sequences, which as we demonstrate can lead to better performance. Finally, since a relaxed stack or queue also implements a pool, we actually have new concurrent pool implementations that outperform the state-of-the-art ones.","lang":"eng"}],"conference":{"start_date":"2013-01-23","end_date":"2013-01-25","location":"Rome, Italy","name":"POPL: Principles of Programming Languages"},"date_updated":"2023-02-21T16:06:49Z","title":"Quantitative relaxation of concurrent data structures","ec_funded":1,"date_published":"2013-01-01T00:00:00Z","_id":"2181","date_created":"2018-12-11T11:56:11Z","publication_status":"published","citation":{"ista":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328.","mla":"Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 317–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>.","chicago":"Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 317–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>.","short":"T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328.","ieee":"T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 317–328.","ama":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:317-328. doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>","apa":"Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., &#38; Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 317–328). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>"},"department":[{"_id":"ToHe"}],"publisher":"ACM","file":[{"relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:45:31Z","checksum":"adf465e70948f4e80e48057524516456","creator":"system","file_size":294689,"file_id":"5086","date_created":"2018-12-12T10:14:33Z","file_name":"IST-2014-198-v1+1_popl128-henzinger-clean.pdf","content_type":"application/pdf"}]},{"scopus_import":1,"oa_version":"None","author":[{"full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"first_name":"Arjun","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2021-01-12T06:55:50Z","page":"115 - 128","quality_controlled":"1","abstract":[{"text":"We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time. We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed.","lang":"eng"}],"conference":{"location":"Rome, Italy","name":"POPL: Principles of Programming Languages","end_date":"2013-01-25","start_date":"2013-07-23"},"status":"public","language":[{"iso":"eng"}],"type":"conference","year":"2013","month":"01","publist_id":"4800","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"}],"department":[{"_id":"ToHe"}],"publisher":"ACM","doi":"10.1145/2429069.2429085","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","date_published":"2013-01-01T00:00:00Z","_id":"2182","ec_funded":1,"title":"Quantitative abstraction refinement","date_created":"2018-12-11T11:56:11Z","citation":{"mla":"Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 115–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 115–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 115–128.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:115-128. doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2013). Quantitative abstraction refinement. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 115–128). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128."},"publication_status":"published"},{"author":[{"last_name":"Biedl","full_name":"Biedl, Therese","first_name":"Therese"},{"full_name":"Held, Martin","first_name":"Martin","last_name":"Held"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber","orcid":"0000-0002-8871-5814","first_name":"Stefan","full_name":"Huber, Stefan"}],"oa_version":"None","scopus_import":1,"abstract":[{"text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon or planar straight-line graph. In this paper, we ask the reverse question: Given the straight skeleton (in form of a planar straight-line graph, with some rays to infinity), can we reconstruct a planar straight-line graph for which this was the straight skeleton? We show how to reduce this problem to the problem of finding a line that intersects a set of convex polygons. We can find these convex polygons and all such lines in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number of edges of the input graph. We also explain how our approach can be used for recognizing Voronoi diagrams of points, thereby completing a partial solution provided by Ash and Bolker in 1985.\r\n","lang":"eng"}],"page":"37 - 46","quality_controlled":"1","conference":{"location":"St. Petersburg, Russia","name":"ISVD: Voronoi Diagrams in Science and Engineering","start_date":"2013-07-08","end_date":"2013-07-10"},"date_updated":"2021-01-12T06:56:00Z","month":"12","language":[{"iso":"eng"}],"year":"2013","type":"conference","status":"public","day":"01","publist_id":"4763","alternative_title":["2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) "],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eisbn":["978-0-7695-5037-4 "]},"department":[{"_id":"HeEd"}],"publisher":"IEEE","doi":"10.1109/ISVD.2013.11","title":"Recognizing straight skeletons and Voronoi diagrams and reconstructing their input","_id":"2209","date_published":"2013-12-01T00:00:00Z","date_created":"2018-12-11T11:56:20Z","citation":{"apa":"Biedl, T., Held, M., &#38; Huber, S. (2013). Recognizing straight skeletons and Voronoi diagrams and reconstructing their input (pp. 37–46). Presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia: IEEE. <a href=\"https://doi.org/10.1109/ISVD.2013.11\">https://doi.org/10.1109/ISVD.2013.11</a>","ama":"Biedl T, Held M, Huber S. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. In: IEEE; 2013:37-46. doi:<a href=\"https://doi.org/10.1109/ISVD.2013.11\">10.1109/ISVD.2013.11</a>","ieee":"T. Biedl, M. Held, and S. Huber, “Recognizing straight skeletons and Voronoi diagrams and reconstructing their input,” presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia, 2013, pp. 37–46.","short":"T. Biedl, M. Held, S. Huber, in:, IEEE, 2013, pp. 37–46.","chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input,” 37–46. IEEE, 2013. <a href=\"https://doi.org/10.1109/ISVD.2013.11\">https://doi.org/10.1109/ISVD.2013.11</a>.","mla":"Biedl, Therese, et al. <i>Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input</i>. IEEE, 2013, pp. 37–46, doi:<a href=\"https://doi.org/10.1109/ISVD.2013.11\">10.1109/ISVD.2013.11</a>.","ista":"Biedl T, Held M, Huber S. 2013. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. ISVD: Voronoi Diagrams in Science and Engineering, 2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) , , 37–46."},"publication_status":"published"},{"month":"03","language":[{"iso":"eng"}],"year":"2013","type":"conference","status":"public","day":"01","publist_id":"4762","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","author":[{"full_name":"Biedl, Therese","first_name":"Therese","last_name":"Biedl"},{"last_name":"Held","full_name":"Held, Martin","first_name":"Martin"},{"orcid":"0000-0002-8871-5814","first_name":"Stefan","full_name":"Huber, Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber"}],"main_file_link":[{"open_access":"1","url":"http://www.ibr.cs.tu-bs.de/alg/eurocg13/booklet_eurocg13.pdf"}],"abstract":[{"text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon. In this paper, we ask the reverse question: Given the straight skeleton (in form of a tree with a drawing in the plane, but with the exact position of the leaves unspecified), can we reconstruct the polygon? We show that in most cases there exists at most one polygon; in the remaining case there is an infinite number of polygons determined by one angle that can range in an interval. We can find this (set of) polygon(s) in linear time in the Real RAM computer model.","lang":"eng"}],"page":"95 - 98","conference":{"name":"EuroCG: European Workshop on Computational Geometry","location":"Braunschweig, Germany","end_date":"2013-03-20","start_date":"2013-03-17"},"date_updated":"2021-01-12T06:56:00Z","title":"Reconstructing polygons from embedded straight skeletons","oa":1,"_id":"2210","date_published":"2013-03-01T00:00:00Z","date_created":"2018-12-11T11:56:21Z","citation":{"ista":"Biedl T, Held M, Huber S. 2013. Reconstructing polygons from embedded straight skeletons. 29th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 95–98.","short":"T. Biedl, M. Held, S. Huber, in:, 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98.","mla":"Biedl, Therese, et al. “Reconstructing Polygons from Embedded Straight Skeletons.” <i>29th European Workshop on Computational Geometry</i>, TU Braunschweig, 2013, pp. 95–98.","chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Reconstructing Polygons from Embedded Straight Skeletons.” In <i>29th European Workshop on Computational Geometry</i>, 95–98. TU Braunschweig, 2013.","apa":"Biedl, T., Held, M., &#38; Huber, S. (2013). Reconstructing polygons from embedded straight skeletons. In <i>29th European Workshop on Computational Geometry</i> (pp. 95–98). Braunschweig, Germany: TU Braunschweig.","ieee":"T. Biedl, M. Held, and S. Huber, “Reconstructing polygons from embedded straight skeletons,” in <i>29th European Workshop on Computational Geometry</i>, Braunschweig, Germany, 2013, pp. 95–98.","ama":"Biedl T, Held M, Huber S. Reconstructing polygons from embedded straight skeletons. In: <i>29th European Workshop on Computational Geometry</i>. TU Braunschweig; 2013:95-98."},"publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"TU Braunschweig","publication":"29th European Workshop on Computational Geometry"},{"article_processing_charge":"No","year":"2013","language":[{"iso":"eng"}],"status":"public","month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4724","alternative_title":["LNCS"],"day":"14","scopus_import":1,"oa_version":"Submitted Version","has_accepted_license":"1","series_title":"Lecture Notes in Computer Science","quality_controlled":"1","oa":1,"volume":8312,"doi":"10.1007/978-3-642-45221-5_13","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"type":"conference","intvolume":"      8312","ddc":["000"],"file_date_updated":"2020-07-14T12:45:34Z","author":[{"last_name":"Blanc","full_name":"Blanc, Régis","first_name":"Régis"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","full_name":"Gupta, Ashutosh","first_name":"Ashutosh"},{"first_name":"Laura","full_name":"Kovács, Laura","last_name":"Kovács"},{"orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","first_name":"Bernhard","last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2020-08-11T10:09:42Z","conference":{"end_date":"2013-12-19","start_date":"2013-12-14","location":"Stellenbosch, South Africa","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"abstract":[{"lang":"eng","text":"We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation."}],"page":"173 - 181","date_published":"2013-01-14T00:00:00Z","_id":"2237","title":"Tree interpolation in Vampire","publication_status":"published","citation":{"apa":"Blanc, R., Gupta, A., Kovács, L., &#38; Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">https://doi.org/10.1007/978-3-642-45221-5_13</a>","ieee":"R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,” vol. 8312. Springer, pp. 173–181, 2013.","ama":"Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">10.1007/978-3-642-45221-5_13</a>","short":"R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.","mla":"Blanc, Régis, et al. <i>Tree Interpolation in Vampire</i>. Vol. 8312, Springer, 2013, pp. 173–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">10.1007/978-3-642-45221-5_13</a>.","chicago":"Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">https://doi.org/10.1007/978-3-642-45221-5_13</a>.","ista":"Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire. 8312, 173–181."},"date_created":"2018-12-11T11:56:29Z","publisher":"Springer","department":[{"_id":"ToHe"}],"file":[{"creator":"dernst","file_size":279206,"file_id":"7858","date_updated":"2020-07-14T12:45:34Z","checksum":"9cebaafca032e6769d273f393305c705","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2013_LPAR_Blanc.pdf","date_created":"2020-05-15T11:10:40Z"}]},{"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"publist_id":"4723","month":"12","status":"public","year":"2013","language":[{"iso":"eng"}],"quality_controlled":"1","series_title":"Lecture Notes in Computer Science","oa_version":"None","scopus_import":1,"volume":8312,"doi":"10.1007/978-3-642-45221-5_17","project":[{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"}],"type":"conference","intvolume":"      8312","conference":{"start_date":"2013-12-14","end_date":"2013-12-19","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","location":"Stellenbosch, South Africa"},"abstract":[{"lang":"eng","text":"We study the problem of achieving a given value in Markov decision processes (MDPs) with several independent discounted reward objectives. We consider a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at different and variable rates.\r\n\r\nWe establish results for two prominent subclasses of the problem, namely state-discount models where the discount factors are only dependent on the state of the MDP (and independent of the objective), and reward-discount models where they are only dependent on the objective (but not on the state of the MDP). For the state-discount models we use a straightforward reduction to expected total reward and show that the problem whether a value is achievable can be solved in polynomial time. For the reward-discount model we show that memory and randomisation of the strategies are required, but nevertheless that the problem is decidable and it is sufficient to consider strategies which after a certain number of steps behave in a memoryless way.\r\n\r\nFor the general case, we show that when restricted to graphs (i.e. MDPs with no randomisation), pure strategies and discount factors of the form 1/n where n is an integer, the problem is in PSPACE and finite memory suffices for achieving a given value. We also show that when the discount factors are not of the form 1/n, the memory required by a strategy can be infinite.\r\n"}],"page":"228 - 242","date_updated":"2020-08-11T10:09:42Z","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Vojtěch","full_name":"Forejt, Vojtěch","last_name":"Forejt"},{"first_name":"Dominik","full_name":"Wojtczak, Dominik","last_name":"Wojtczak"}],"publication_status":"published","citation":{"ista":"Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.","mla":"Chatterjee, Krishnendu, et al. <i>Multi-Objective Discounted Reward Verification in Graphs and MDPs</i>. Vol. 8312, Springer, 2013, pp. 228–42, doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">10.1007/978-3-642-45221-5_17</a>.","chicago":"Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">https://doi.org/10.1007/978-3-642-45221-5_17</a>.","short":"K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.","ama":"Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification in graphs and MDPs. 2013;8312:228-242. doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">10.1007/978-3-642-45221-5_17</a>","ieee":"K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.","apa":"Chatterjee, K., Forejt, V., &#38; Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">https://doi.org/10.1007/978-3-642-45221-5_17</a>"},"date_created":"2018-12-11T11:56:30Z","title":"Multi-objective discounted reward verification in graphs and MDPs","ec_funded":1,"_id":"2238","date_published":"2013-12-01T00:00:00Z","publisher":"Springer","department":[{"_id":"KrCh"}]},{"date_published":"2013-09-01T00:00:00Z","_id":"2243","ec_funded":1,"title":"Elementary modal logics over transitive structures","publication_status":"published","citation":{"apa":"Michaliszyn, J., &#38; Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>","ieee":"J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.","ama":"Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>","short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577.","chicago":"Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>.","mla":"Michaliszyn, Jakub, and Jan Otop. <i>Elementary Modal Logics over Transitive Structures</i>. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>.","ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577."},"date_created":"2018-12-11T11:56:32Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"}],"file":[{"date_updated":"2020-07-14T12:45:34Z","checksum":"e0732e73a8b1e39483df7717d53e3e35","access_level":"open_access","relation":"main_file","file_id":"4929","file_size":454915,"creator":"system","file_name":"IST-2016-136-v1+2_39.pdf","date_created":"2018-12-12T10:12:11Z","content_type":"application/pdf"}],"tmp":{"image":"/images/cc_by.png","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"},"type":"conference","intvolume":"        23","ddc":["000","004"],"file_date_updated":"2020-07-14T12:45:34Z","author":[{"full_name":"Michaliszyn, Jakub","first_name":"Jakub","last_name":"Michaliszyn"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","first_name":"Jan"}],"date_updated":"2020-08-11T10:09:42Z","conference":{"location":"Torino, Italy","name":"CSL: Computer Science Logic","end_date":"2013-09-05","start_date":"2013-09-02"},"page":"563 - 577","abstract":[{"text":"We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME.","lang":"eng"}],"oa":1,"volume":23,"doi":"10.4230/LIPIcs.CSL.2013.563","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"}],"language":[{"iso":"eng"}],"year":"2013","status":"public","month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4708","alternative_title":["LIPIcs"],"pubrep_id":"136","day":"01","scopus_import":1,"oa_version":"Published Version","has_accepted_license":"1","series_title":"Leibniz International Proceedings in Informatics","quality_controlled":"1"},{"intvolume":"      8242","type":"conference","date_updated":"2023-02-21T17:03:07Z","conference":{"end_date":"2013-09-25","start_date":"2013-09-23","name":"GD: Graph Drawing and Network Visualization","location":"Bordeaux, France"},"abstract":[{"lang":"eng","text":"We consider two systems (α1,...,αm) and (β1,...,βn) of curves drawn on a compact two-dimensional surface ℳ with boundary. Each αi and each βj is either an arc meeting the boundary of ℳ at its two endpoints, or a closed curve. The αi are pairwise disjoint except for possibly sharing endpoints, and similarly for the βj. We want to &quot;untangle&quot; the βj from the αi by a self-homeomorphism of ℳ; more precisely, we seek an homeomorphism φ: ℳ → ℳ fixing the boundary of ℳ pointwise such that the total number of crossings of the αi with the φ(βj) is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if ℳ is planar, i.e., a sphere with h ≥ 0 boundary components (&quot;holes&quot;), then O(mn) crossings can be achieved (independently of h), which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary (orientable or nonorientable) surface ℳ with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an O((m + n)4) upper bound, again independent of h and g. "}],"page":"472 - 483","author":[{"last_name":"Matoušek","first_name":"Jiří","full_name":"Matoušek, Jiří"},{"full_name":"Sedgwick, Eric","first_name":"Eric","last_name":"Sedgwick"},{"last_name":"Tancer","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","full_name":"Tancer, Martin","first_name":"Martin","orcid":"0000-0002-1191-6714"},{"full_name":"Wagner, Uli","first_name":"Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1302.6475"}],"acknowledgement":"We would like to thank the authors of [GHR13] for mak- ing a draft of their paper available to us, and, in particular, T. Huynh for an e-mail correspondence.","publication_status":"published","citation":{"ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of noncrossing curves. 8242, 472–483.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2013). Untangling two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network Visualization, Bordeaux, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-03841-4_41\">https://doi.org/10.1007/978-3-319-03841-4_41</a>","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” vol. 8242. Springer, pp. 472–483, 2013.","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing curves. 2013;8242:472-483. doi:<a href=\"https://doi.org/10.1007/978-3-319-03841-4_41\">10.1007/978-3-319-03841-4_41</a>","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, 8242 (2013) 472–483.","mla":"Matoušek, Jiří, et al. <i>Untangling Two Systems of Noncrossing Curves</i>. Vol. 8242, Springer, 2013, pp. 472–83, doi:<a href=\"https://doi.org/10.1007/978-3-319-03841-4_41\">10.1007/978-3-319-03841-4_41</a>.","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-319-03841-4_41\">https://doi.org/10.1007/978-3-319-03841-4_41</a>."},"date_created":"2018-12-11T11:56:32Z","date_published":"2013-09-01T00:00:00Z","_id":"2244","title":"Untangling two systems of noncrossing curves","publisher":"Springer","department":[{"_id":"UlWa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"publist_id":"4707","day":"01","status":"public","language":[{"iso":"eng"}],"year":"2013","month":"09","external_id":{"arxiv":["1302.6475"]},"series_title":"Lecture Notes in Computer Science","quality_controlled":"1","related_material":{"record":[{"relation":"later_version","id":"1411","status":"public"}]},"scopus_import":1,"oa_version":"Preprint","oa":1,"volume":8242,"arxiv":1,"doi":"10.1007/978-3-319-03841-4_41","project":[{"grant_number":"PP00P2_138948","_id":"25FA3206-B435-11E9-9278-68D0E5697425","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics"}]},{"ddc":["000"],"intvolume":"         8","type":"journal_article","abstract":[{"text":"Cooperative behavior, where one individual incurs a cost to help another, is a wide spread phenomenon. Here we study direct reciprocity in the context of the alternating Prisoner's Dilemma. We consider all strategies that can be implemented by one and two-state automata. We calculate the payoff matrix of all pairwise encounters in the presence of noise. We explore deterministic selection dynamics with and without mutation. Using different error rates and payoff values, we observe convergence to a small number of distinct equilibria. Two of them are uncooperative strict Nash equilibria representing always-defect (ALLD) and Grim. The third equilibrium is mixed and represents a cooperative alliance of several strategies, dominated by a strategy which we call Forgiver. Forgiver cooperates whenever the opponent has cooperated; it defects once when the opponent has defected, but subsequently Forgiver attempts to re-establish cooperation even if the opponent has defected again. Forgiver is not an evolutionarily stable strategy, but the alliance, which it rules, is asymptotically stable. For a wide range of parameter values the most commonly observed outcome is convergence to the mixed equilibrium, dominated by Forgiver. Our results show that although forgiving might incur a short-term loss it can lead to a long-term gain. Forgiveness facilitates stable cooperation in the presence of exploitation and noise.","lang":"eng"}],"article_number":"e80814","date_updated":"2023-09-07T11:40:43Z","author":[{"last_name":"Zagorsky","first_name":"Benjamin","full_name":"Zagorsky, Benjamin"},{"id":"4A918E98-F248-11E8-B48F-1D18A9856A87","last_name":"Reiter","full_name":"Reiter, Johannes","first_name":"Johannes","orcid":"0000-0002-0170-7353"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"file_date_updated":"2020-07-14T12:45:34Z","issue":"12","date_created":"2018-12-11T11:56:33Z","citation":{"short":"B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, PLoS One 8 (2013).","chicago":"Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” <i>PLoS One</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pone.0080814\">https://doi.org/10.1371/journal.pone.0080814</a>.","mla":"Zagorsky, Benjamin, et al. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” <i>PLoS One</i>, vol. 8, no. 12, e80814, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pone.0080814\">10.1371/journal.pone.0080814</a>.","apa":"Zagorsky, B., Reiter, J., Chatterjee, K., &#38; Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0080814\">https://doi.org/10.1371/journal.pone.0080814</a>","ieee":"B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in alternating prisoner’s dilemma ,” <i>PLoS One</i>, vol. 8, no. 12. Public Library of Science, 2013.","ama":"Zagorsky B, Reiter J, Chatterjee K, Nowak M. Forgiver triumphs in alternating prisoner’s dilemma . <i>PLoS One</i>. 2013;8(12). doi:<a href=\"https://doi.org/10.1371/journal.pone.0080814\">10.1371/journal.pone.0080814</a>","ista":"Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating prisoner’s dilemma . PLoS One. 8(12), e80814."},"publication_status":"published","ec_funded":1,"title":"Forgiver triumphs in alternating prisoner's dilemma ","_id":"2247","date_published":"2013-12-12T00:00:00Z","tmp":{"image":"/images/cc_by.png","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"},"file":[{"content_type":"application/pdf","file_name":"IST-2016-409-v1+1_journal.pone.0080814.pdf","date_created":"2018-12-12T10:11:15Z","file_id":"4868","file_size":1050042,"creator":"system","date_updated":"2020-07-14T12:45:34Z","checksum":"808e8b9e6e89658bee4ffbbfac1bd19d","access_level":"open_access","relation":"main_file"}],"department":[{"_id":"KrCh"}],"publisher":"Public Library of Science","day":"12","publist_id":"4702","pubrep_id":"409","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","year":"2013","language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","has_accepted_license":"1","oa_version":"Published Version","scopus_import":1,"related_material":{"record":[{"relation":"research_data","id":"9749","status":"public"},{"relation":"dissertation_contains","status":"public","id":"1400"}]},"volume":8,"oa":1,"publication":"PLoS One","project":[{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1371/journal.pone.0080814"},{"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"719","publist_id":"4690","month":"12","status":"public","language":[{"iso":"eng"}],"year":"2013","has_accepted_license":"1","oa_version":"Published Version","oa":1,"volume":66,"publication":"VÖB Mitteilungen","ddc":["020"],"intvolume":"        66","type":"journal_article","page":"559 - 587","abstract":[{"lang":"eng","text":"Linked (Open) Data - bibliographic data on the Semantic Web. Report of the Working Group on Linked Data to the plenary assembly of the Austrian Library Network (translation of the title). Linked Data stands for a certain approach to publishing data on the Web. The underlying idea is to harmonise heterogeneous data sources of different origin in order to improve their accessibility and interoperability, effectively making them queryable as a big distributed database. This report summarises relevant developments in Europe as well as the Linked Data Working Group‘s strategic and technical considerations regarding the publishing of the Austrian Library Network’s (OBV’s) bibliographic datasets. It concludes with the mutual agreement that the implementation of Linked Data principles within the OBV can only be taken into consideration accompanied by a discussion about the provision of the datasets under a free license."},{"lang":"ger","text":"Linked Data steht für eine bestimmte Form der Veröffentlichung von Daten via Internet. Die zu Grunde liegende Idee ist es, Daten verschiedenster Provenienz, die derzeit teilweise gar nicht oder nur schwer zugänglich sind, in möglichst \r\neinheitlicher Form miteinander zu verknüpfen und dadurch in ihrer Gesamtheit abfragbar zu machen.\r\nDieser Bericht fasst die Entwicklungen im europäischen Raum, sowie strategische und technische Überlegungen der AG Linked Data hinsichtlich der Veröffentlichung von bibliothekarischen Daten des Österreichischen Bibliothekenverbundes (OBV) zusammen und schließt mit der gemeinsamen Übereinkunft, dass die Umsetzung von Linked Data-Prinzipien im OBV nur in Zusammenhang mit einer Diskussion über die damit einhergehende Veröffentlichung der Daten unter einer freien Lizenz angedacht werden sollte."}],"date_updated":"2021-01-12T06:56:20Z","author":[{"last_name":"Danowski","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","first_name":"Patrick","full_name":"Danowski, Patrick"},{"full_name":"Goldfarb, Doron","first_name":"Doron","last_name":"Goldfarb"},{"full_name":"Schaffner, Verena","first_name":"Verena","last_name":"Schaffner"},{"last_name":"Seidler","first_name":"Wolfram","full_name":"Seidler, Wolfram"}],"issue":"3/4","file_date_updated":"2020-07-14T12:45:35Z","citation":{"ista":"Danowski P, Goldfarb D, Schaffner V, Seidler W. 2013. Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 66(3/4), 559–587.","short":"P. Danowski, D. Goldfarb, V. Schaffner, W. Seidler, VÖB Mitteilungen 66 (2013) 559–587.","chicago":"Danowski, Patrick, Doron Goldfarb, Verena Schaffner, and Wolfram Seidler. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” <i>VÖB Mitteilungen</i>. Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013.","mla":"Danowski, Patrick, et al. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” <i>VÖB Mitteilungen</i>, vol. 66, no. 3/4, Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013, pp. 559–87.","apa":"Danowski, P., Goldfarb, D., Schaffner, V., &#38; Seidler, W. (2013). Linked (Open) Data - Bibliographische Daten im Semantic Web. <i>VÖB Mitteilungen</i>. Verein Österreichischer Bibliothekarinnen und Bibliothekare.","ama":"Danowski P, Goldfarb D, Schaffner V, Seidler W. Linked (Open) Data - Bibliographische Daten im Semantic Web. <i>VÖB Mitteilungen</i>. 2013;66(3/4):559-587.","ieee":"P. Danowski, D. Goldfarb, V. Schaffner, and W. Seidler, “Linked (Open) Data - Bibliographische Daten im Semantic Web,” <i>VÖB Mitteilungen</i>, vol. 66, no. 3/4. Verein Österreichischer Bibliothekarinnen und Bibliothekare, pp. 559–587, 2013."},"publication_status":"published","date_created":"2018-12-11T11:56:36Z","title":"Linked (Open) Data - Bibliographische Daten im Semantic Web","date_published":"2013-12-01T00:00:00Z","_id":"2256","tmp":{"image":"/images/cc_by.png","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"},"file":[{"checksum":"ae57ffcee3720adcc27b0f2767a1e04b","date_updated":"2020-07-14T12:45:35Z","access_level":"open_access","relation":"main_file","file_id":"4669","file_size":881545,"creator":"system","file_name":"IST-2016-719-v1+1_Patrick_Danowski__Doron_Goldfarb__Verena_Schaffner__Wolfram_Seidler_Linked__Open__Data_Bibliographische_Daten_im_Semantic_Web.pdf","date_created":"2018-12-12T10:08:09Z","content_type":"application/pdf"}],"publisher":"Verein Österreichischer Bibliothekarinnen und Bibliothekare","popular_science":"1","department":[{"_id":"E-Lib"}]},{"file":[{"file_size":493175,"file_id":"4744","creator":"system","checksum":"18a3f602cb41de184dc0e16a0e907633","date_updated":"2020-07-14T12:45:35Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"IST-2016-685-v1+1_658.pdf","date_created":"2018-12-12T10:09:20Z"}],"department":[{"_id":"KrPi"}],"publisher":"Springer","date_created":"2018-12-11T11:56:37Z","citation":{"ista":"Kiltz E, Pietrzak KZ, Szegedy M. 2013. Digital signatures with minimal overhead from indifferentiable random invertible functions. 8042, 571–588.","short":"E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588.","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, and Mario Szegedy. “Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40041-4_31\">https://doi.org/10.1007/978-3-642-40041-4_31</a>.","mla":"Kiltz, Eike, et al. <i>Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions</i>. Vol. 8042, Springer, 2013, pp. 571–88, doi:<a href=\"https://doi.org/10.1007/978-3-642-40041-4_31\">10.1007/978-3-642-40041-4_31</a>.","apa":"Kiltz, E., Pietrzak, K. Z., &#38; Szegedy, M. (2013). Digital signatures with minimal overhead from indifferentiable random invertible functions. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40041-4_31\">https://doi.org/10.1007/978-3-642-40041-4_31</a>","ama":"Kiltz E, Pietrzak KZ, Szegedy M. Digital signatures with minimal overhead from indifferentiable random invertible functions. 2013;8042:571-588. doi:<a href=\"https://doi.org/10.1007/978-3-642-40041-4_31\">10.1007/978-3-642-40041-4_31</a>","ieee":"E. Kiltz, K. Z. Pietrzak, and M. Szegedy, “Digital signatures with minimal overhead from indifferentiable random invertible functions,” vol. 8042. Springer, pp. 571–588, 2013."},"publication_status":"published","date_published":"2013-01-01T00:00:00Z","_id":"2258","ec_funded":1,"title":"Digital signatures with minimal overhead from indifferentiable random invertible functions","date_updated":"2021-01-12T06:56:21Z","page":"571 - 588","abstract":[{"lang":"eng","text":"In a digital signature scheme with message recovery, rather than transmitting the message m and its signature σ, a single enhanced signature τ is transmitted. The verifier is able to recover m from τ and at the same time verify its authenticity. The two most important parameters of such a scheme are its security and overhead |τ| − |m|. A simple argument shows that for any scheme with “n bits security” |τ| − |m| ≥ n, i.e., the overhead is lower bounded by the security parameter n. Currently, the best known constructions in the random oracle model are far from this lower bound requiring an overhead of n + logq h , where q h is the number of queries to the random oracle. In this paper we give a construction which basically matches the n bit lower bound. We propose a simple digital signature scheme with n + o(logq h ) bits overhead, where q h denotes the number of random oracle queries.\r\n\r\nOur construction works in two steps. First, we propose a signature scheme with message recovery having optimal overhead in a new ideal model, the random invertible function model. Second, we show that a four-round Feistel network with random oracles as round functions is tightly “public-indifferentiable” from a random invertible function. At the core of our indifferentiability proof is an almost tight upper bound for the expected number of edges of the densest “small” subgraph of a random Cayley graph, which may be of independent interest.\r\n"}],"conference":{"name":"CRYPTO: International Cryptology Conference","location":"Santa Barbara, CA, United States","end_date":"2013-08-22","start_date":"2013-08-18"},"file_date_updated":"2020-07-14T12:45:35Z","author":[{"last_name":"Kiltz","full_name":"Kiltz, Eike","first_name":"Eike"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654"},{"first_name":"Mario","full_name":"Szegedy, Mario","last_name":"Szegedy"}],"ddc":["000","004"],"type":"conference","intvolume":"      8042","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7","grant_number":"259668"}],"doi":"10.1007/978-3-642-40041-4_31","volume":8042,"oa":1,"series_title":"Lecture Notes in Computer Science","has_accepted_license":"1","quality_controlled":"1","scopus_import":1,"oa_version":"Submitted Version","publist_id":"4688","alternative_title":["LNCS"],"pubrep_id":"685","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","language":[{"iso":"eng"}],"status":"public","year":"2013","month":"01"},{"has_accepted_license":"1","series_title":"Lecture Notes in Computer Science","quality_controlled":"1","scopus_import":1,"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"684","alternative_title":["LNCS"],"publist_id":"4687","day":"01","status":"public","language":[{"iso":"eng"}],"year":"2013","month":"01","doi":"10.1007/978-3-642-40041-4_4","project":[{"name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7"}],"oa":1,"volume":8042,"date_updated":"2021-01-12T06:56:21Z","conference":{"name":"CRYPTO: International Cryptology Conference","location":"Santa Barbara, CA, United States","start_date":"2013-08-18","end_date":"2013-08-22"},"page":"57 - 74","abstract":[{"text":"The learning with rounding (LWR) problem, introduced by Banerjee, Peikert and Rosen at EUROCRYPT ’12, is a variant of learning with errors (LWE), where one replaces random errors with deterministic rounding. The LWR problem was shown to be as hard as LWE for a setting of parameters where the modulus and modulus-to-error ratio are super-polynomial. In this work we resolve the main open problem and give a new reduction that works for a larger range of parameters, allowing for a polynomial modulus and modulus-to-error ratio. In particular, a smaller modulus gives us greater efficiency, and a smaller modulus-to-error ratio gives us greater security, which now follows from the worst-case hardness of GapSVP with polynomial (rather than super-polynomial) approximation factors.\r\n\r\nAs a tool in the reduction, we show that there is a “lossy mode” for the LWR problem, in which LWR samples only reveal partial information about the secret. This property gives us several interesting new applications, including a proof that LWR remains secure with weakly random secrets of sufficient min-entropy, and very simple constructions of deterministic encryption, lossy trapdoor functions and reusable extractors.\r\n\r\nOur approach is inspired by a technique of Goldwasser et al. from ICS ’10, which implicitly showed the existence of a “lossy mode” for LWE. By refining this technique, we also improve on the parameters of that work to only requiring a polynomial (instead of super-polynomial) modulus and modulus-to-error ratio.\r\n","lang":"eng"}],"issue":"1","file_date_updated":"2020-07-14T12:45:35Z","author":[{"last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","full_name":"Alwen, Joel F"},{"first_name":"Stephan","full_name":"Krenn, Stephan","orcid":"0000-0003-2835-9093","last_name":"Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"},{"last_name":"Wichs","full_name":"Wichs, Daniel","first_name":"Daniel"}],"ddc":["000","004"],"intvolume":"      8042","type":"conference","file":[{"content_type":"application/pdf","file_name":"IST-2016-684-v1+1_098.pdf","date_created":"2018-12-12T10:11:55Z","creator":"system","file_size":587898,"file_id":"4912","date_updated":"2020-07-14T12:45:35Z","checksum":"16d428408a806b8e49eecc607deab115","relation":"main_file","access_level":"open_access"}],"publisher":"Springer","department":[{"_id":"KrPi"}],"citation":{"ista":"Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74.","apa":"Alwen, J. F., Krenn, S., Pietrzak, K. Z., &#38; Wichs, D. (2013). Learning with rounding, revisited: New reduction properties and applications. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40041-4_4\">https://doi.org/10.1007/978-3-642-40041-4_4</a>","ieee":"J. F. Alwen, S. Krenn, K. Z. Pietrzak, and D. Wichs, “Learning with rounding, revisited: New reduction properties and applications,” vol. 8042, no. 1. Springer, pp. 57–74, 2013.","ama":"Alwen JF, Krenn S, Pietrzak KZ, Wichs D. Learning with rounding, revisited: New reduction properties and applications. 2013;8042(1):57-74. doi:<a href=\"https://doi.org/10.1007/978-3-642-40041-4_4\">10.1007/978-3-642-40041-4_4</a>","short":"J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.","mla":"Alwen, Joel F., et al. <i>Learning with Rounding, Revisited: New Reduction Properties and Applications</i>. Vol. 8042, no. 1, Springer, 2013, pp. 57–74, doi:<a href=\"https://doi.org/10.1007/978-3-642-40041-4_4\">10.1007/978-3-642-40041-4_4</a>.","chicago":"Alwen, Joel F, Stephan Krenn, Krzysztof Z Pietrzak, and Daniel Wichs. “Learning with Rounding, Revisited: New Reduction Properties and Applications.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40041-4_4\">https://doi.org/10.1007/978-3-642-40041-4_4</a>."},"publication_status":"published","date_created":"2018-12-11T11:56:37Z","_id":"2259","date_published":"2013-01-01T00:00:00Z","ec_funded":1,"title":"Learning with rounding, revisited: New reduction properties and applications"}]