[{"scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ec_funded":1,"date_published":"2018-01-29T00:00:00Z","ddc":["581"],"file_date_updated":"2020-07-14T12:46:30Z","article_processing_charge":"Yes","date_created":"2018-12-11T11:46:32Z","quality_controlled":"1","oa":1,"external_id":{"isi":["000423718600034"]},"publisher":"Public Library of Science","file":[{"file_size":24709062,"date_created":"2018-12-12T10:10:52Z","date_updated":"2020-07-14T12:46:30Z","creator":"system","file_name":"IST-2018-967-v1+1_journal.pgen.1007177.pdf","access_level":"open_access","relation":"main_file","checksum":"0276d66788ec076f4924164a39e6a712","file_id":"4843","content_type":"application/pdf"}],"year":"2018","issue":"1","abstract":[{"lang":"eng","text":"Auxin is unique among plant hormones due to its directional transport that is mediated by the polarly distributed PIN auxin transporters at the plasma membrane. The canalization hypothesis proposes that the auxin feedback on its polar flow is a crucial, plant-specific mechanism mediating multiple self-organizing developmental processes. Here, we used the auxin effect on the PIN polar localization in Arabidopsis thaliana roots as a proxy for the auxin feedback on the PIN polarity during canalization. We performed microarray experiments to find regulators of this process that act downstream of auxin. We identified genes that were transcriptionally regulated by auxin in an AXR3/IAA17- and ARF7/ARF19-dependent manner. Besides the known components of the PIN polarity, such as PID and PIP5K kinases, a number of potential new regulators were detected, among which the WRKY23 transcription factor, which was characterized in more detail. Gain- and loss-of-function mutants confirmed a role for WRKY23 in mediating the auxin effect on the PIN polarity. Accordingly, processes requiring auxin-mediated PIN polarity rearrangements, such as vascular tissue development during leaf venation, showed a higher WRKY23 expression and required the WRKY23 activity. Our results provide initial insights into the auxin transcriptional network acting upstream of PIN polarization and, potentially, canalization-mediated plant development."}],"pubrep_id":"967","status":"public","project":[{"call_identifier":"FP7","grant_number":"282300","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"intvolume":"        14","corr_author":"1","title":"WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity","publist_id":"7373","citation":{"mla":"Prat, Tomas, et al. “WRKY23 Is a Component of the Transcriptional Network Mediating Auxin Feedback on PIN Polarity.” <i>PLoS Genetics</i>, vol. 14, no. 1, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007177\">10.1371/journal.pgen.1007177</a>.","ieee":"T. Prat <i>et al.</i>, “WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity,” <i>PLoS Genetics</i>, vol. 14, no. 1. Public Library of Science, 2018.","ista":"Prat T, Hajny J, Grunewald W, Vasileva MK, Molnar G, Tejos R, Schmid M, Sauer M, Friml J. 2018. WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity. PLoS Genetics. 14(1).","ama":"Prat T, Hajny J, Grunewald W, et al. WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity. <i>PLoS Genetics</i>. 2018;14(1). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007177\">10.1371/journal.pgen.1007177</a>","chicago":"Prat, Tomas, Jakub Hajny, Wim Grunewald, Mina K Vasileva, Gergely Molnar, Ricardo Tejos, Markus Schmid, Michael Sauer, and Jiří Friml. “WRKY23 Is a Component of the Transcriptional Network Mediating Auxin Feedback on PIN Polarity.” <i>PLoS Genetics</i>. Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pgen.1007177\">https://doi.org/10.1371/journal.pgen.1007177</a>.","apa":"Prat, T., Hajny, J., Grunewald, W., Vasileva, M. K., Molnar, G., Tejos, R., … Friml, J. (2018). WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity. <i>PLoS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1007177\">https://doi.org/10.1371/journal.pgen.1007177</a>","short":"T. Prat, J. Hajny, W. Grunewald, M.K. Vasileva, G. Molnar, R. Tejos, M. Schmid, M. Sauer, J. Friml, PLoS Genetics 14 (2018)."},"volume":14,"oa_version":"Published Version","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":"journal_article","isi":1,"license":"https://creativecommons.org/licenses/by/4.0/","doi":"10.1371/journal.pgen.1007177","author":[{"full_name":"Prat, Tomas","first_name":"Tomas","last_name":"Prat","id":"3DA3BFEE-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-2140-7195","last_name":"Hajny","first_name":"Jakub","full_name":"Hajny, Jakub","id":"4800CC20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Grunewald","first_name":"Wim","full_name":"Grunewald, Wim"},{"id":"3407EB18-F248-11E8-B48F-1D18A9856A87","last_name":"Vasileva","full_name":"Vasileva, Mina K","first_name":"Mina K"},{"last_name":"Molnar","full_name":"Molnar, Gergely","first_name":"Gergely","id":"34F1AF46-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tejos","full_name":"Tejos, Ricardo","first_name":"Ricardo"},{"first_name":"Markus","full_name":"Schmid, Markus","last_name":"Schmid"},{"first_name":"Michael","full_name":"Sauer, Michael","last_name":"Sauer"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Friml, Jirí","first_name":"Jirí"}],"month":"01","date_updated":"2026-08-04T22:30:59Z","publication":"PLoS Genetics","day":"29","department":[{"_id":"JiFr"}],"publication_status":"published","_id":"449","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"7172","relation":"dissertation_contains"},{"relation":"dissertation_contains","status":"public","id":"1127"},{"status":"public","id":"8822","relation":"dissertation_contains"}]},"has_accepted_license":"1"},{"intvolume":"         8","project":[{"name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"282300"},{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","_id":"261099A6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"742985"}],"status":"public","abstract":[{"lang":"eng","text":"Intercellular distribution of the plant hormone auxin largely depends on the polar subcellular distribution of the plasma membrane PIN-FORMED (PIN) auxin transporters. PIN polarity switches in response to different developmental and environmental signals have been shown to redirect auxin fluxes mediating certain developmental responses. PIN phosphorylation at different sites and by different kinases is crucial for PIN function. Here we investigate the role of PIN phosphorylation during gravitropic response. Loss- and gain-of-function mutants in PINOID and related kinases but not in D6PK kinase as well as mutations mimicking constitutive dephosphorylated or phosphorylated status of two clusters of predicted phosphorylation sites partially disrupted PIN3 phosphorylation and caused defects in gravitropic bending in roots and hypocotyls. In particular, they impacted PIN3 polarity rearrangements in response to gravity and during feed-back regulation by auxin itself. Thus PIN phosphorylation, besides regulating transport activity and apical-basal targeting, is also important for the rapid polarity switches in response to environmental and endogenous signals."}],"issue":"1","year":"2018","file":[{"file_name":"2018_ScientificReports_Grones.pdf","creator":"dernst","date_created":"2018-12-17T15:38:56Z","date_updated":"2020-07-14T12:45:20Z","file_size":2413876,"content_type":"application/pdf","file_id":"5714","checksum":"266b03f4fb8198e83141617aaa99dcab","relation":"main_file","access_level":"open_access"}],"publisher":"Springer","external_id":{"isi":["000437673200053"]},"oa":1,"quality_controlled":"1","date_created":"2018-12-11T11:45:06Z","article_processing_charge":"No","file_date_updated":"2020-07-14T12:45:20Z","ddc":["581"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ec_funded":1,"date_published":"2018-07-06T00:00:00Z","scopus_import":"1","has_accepted_license":"1","related_material":{"record":[{"status":"public","id":"8822","relation":"dissertation_contains"}]},"article_number":"10279","language":[{"iso":"eng"}],"publication_status":"published","_id":"191","day":"06","department":[{"_id":"JiFr"},{"_id":"EvBe"}],"publication":"Scientific Reports","date_updated":"2026-08-04T22:30:59Z","month":"07","author":[{"full_name":"Grones, Peter","first_name":"Peter","last_name":"Grones","id":"399876EC-F248-11E8-B48F-1D18A9856A87"},{"id":"3CFB3B1C-F248-11E8-B48F-1D18A9856A87","last_name":"Abas","first_name":"Melinda F","full_name":"Abas, Melinda F"},{"orcid":"0000-0003-2140-7195","id":"4800CC20-F248-11E8-B48F-1D18A9856A87","last_name":"Hajny","full_name":"Hajny, Jakub","first_name":"Jakub"},{"first_name":"Angharad","full_name":"Jones, Angharad","last_name":"Jones"},{"last_name":"Waidmann","full_name":"Waidmann, Sascha","first_name":"Sascha"},{"first_name":"Jürgen","full_name":"Kleine Vehn, Jürgen","last_name":"Kleine Vehn"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","first_name":"Jirí","last_name":"Friml"}],"doi":"10.1038/s41598-018-28188-1","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"},"oa_version":"Published Version","isi":1,"type":"journal_article","volume":8,"citation":{"apa":"Grones, P., Abas, M. F., Hajny, J., Jones, A., Waidmann, S., Kleine Vehn, J., &#38; Friml, J. (2018). PID/WAG-mediated phosphorylation of the Arabidopsis PIN3 auxin transporter mediates polarity switches during gravitropism. <i>Scientific Reports</i>. Springer. <a href=\"https://doi.org/10.1038/s41598-018-28188-1\">https://doi.org/10.1038/s41598-018-28188-1</a>","ama":"Grones P, Abas MF, Hajny J, et al. PID/WAG-mediated phosphorylation of the Arabidopsis PIN3 auxin transporter mediates polarity switches during gravitropism. <i>Scientific Reports</i>. 2018;8(1). doi:<a href=\"https://doi.org/10.1038/s41598-018-28188-1\">10.1038/s41598-018-28188-1</a>","chicago":"Grones, Peter, Melinda F Abas, Jakub Hajny, Angharad Jones, Sascha Waidmann, Jürgen Kleine Vehn, and Jiří Friml. “PID/WAG-Mediated Phosphorylation of the Arabidopsis PIN3 Auxin Transporter Mediates Polarity Switches during Gravitropism.” <i>Scientific Reports</i>. Springer, 2018. <a href=\"https://doi.org/10.1038/s41598-018-28188-1\">https://doi.org/10.1038/s41598-018-28188-1</a>.","short":"P. Grones, M.F. Abas, J. Hajny, A. Jones, S. Waidmann, J. Kleine Vehn, J. Friml, Scientific Reports 8 (2018).","ista":"Grones P, Abas MF, Hajny J, Jones A, Waidmann S, Kleine Vehn J, Friml J. 2018. PID/WAG-mediated phosphorylation of the Arabidopsis PIN3 auxin transporter mediates polarity switches during gravitropism. Scientific Reports. 8(1), 10279.","ieee":"P. Grones <i>et al.</i>, “PID/WAG-mediated phosphorylation of the Arabidopsis PIN3 auxin transporter mediates polarity switches during gravitropism,” <i>Scientific Reports</i>, vol. 8, no. 1. Springer, 2018.","mla":"Grones, Peter, et al. “PID/WAG-Mediated Phosphorylation of the Arabidopsis PIN3 Auxin Transporter Mediates Polarity Switches during Gravitropism.” <i>Scientific Reports</i>, vol. 8, no. 1, 10279, Springer, 2018, doi:<a href=\"https://doi.org/10.1038/s41598-018-28188-1\">10.1038/s41598-018-28188-1</a>."},"publist_id":"7729","title":"PID/WAG-mediated phosphorylation of the Arabidopsis PIN3 auxin transporter mediates polarity switches during gravitropism"},{"issue":"4","abstract":[{"lang":"eng","text":"With the advent of optogenetics, it became possible to change the activity of a targeted population of neurons in a temporally controlled manner. To combine the advantages of 60-channel in vivo tetrode recording and laser-based optogenetics, we have developed a closed-loop recording system that allows for the actual electrophysiological signal to be used as a trigger for the laser light mediating the optogenetic intervention. We have optimized the weight, size, and shape of the corresponding implant to make it compatible with the size, force, and movements of a behaving mouse, and we have shown that the system can efficiently block sharp wave ripple (SWR) events using those events themselves as a trigger. To demonstrate the full potential of the optogenetic recording system we present a pilot study addressing the contribution of SWR events to learning in a complex behavioral task."}],"year":"2018","intvolume":"         5","status":"public","project":[{"grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"},{"name":"Interneuron plasticity during spatial learning","_id":"257D4372-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I2072-B27"}],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:13Z","date_created":"2019-02-03T22:59:16Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2018-07-27T00:00:00Z","scopus_import":"1","ddc":["570"],"oa":1,"quality_controlled":"1","external_id":{"isi":["000443994700007"]},"publisher":"Society for Neuroscience","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5921","checksum":"f4915d45fc7ad4648b7b7a13fdecca01","date_created":"2019-02-05T12:48:36Z","date_updated":"2020-07-14T12:47:13Z","file_size":3746884,"file_name":"2018_ENeuro_Guerrero.pdf","creator":"dernst"}],"date_updated":"2026-08-04T22:31:00Z","publication":"eNeuro","month":"07","article_number":"e0087","related_material":{"record":[{"status":"public","id":"6849","relation":"dissertation_contains"}]},"has_accepted_license":"1","day":"27","department":[{"_id":"JoCs"}],"_id":"5914","publication_status":"published","language":[{"iso":"eng"}],"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"},"oa_version":"Published Version","isi":1,"type":"journal_article","title":"Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning","citation":{"ista":"Rangel Guerrero DK, Donnett JG, Csicsvari JL, Kovács K. 2018. Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning. eNeuro. 5(4), e0087.","mla":"Rangel Guerrero, Dámaris K., et al. “Tetrode Recording from the Hippocampus of Behaving Mice Coupled with Four-Point-Irradiation Closed-Loop Optogenetics: A Technique to Study the Contribution of Hippocampal SWR Events to Learning.” <i>ENeuro</i>, vol. 5, no. 4, e0087, Society for Neuroscience, 2018, doi:<a href=\"https://doi.org/10.1523/ENEURO.0087-18.2018\">10.1523/ENEURO.0087-18.2018</a>.","ieee":"D. K. Rangel Guerrero, J. G. Donnett, J. L. Csicsvari, and K. Kovács, “Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning,” <i>eNeuro</i>, vol. 5, no. 4. Society for Neuroscience, 2018.","short":"D.K. Rangel Guerrero, J.G. Donnett, J.L. Csicsvari, K. Kovács, ENeuro 5 (2018).","apa":"Rangel Guerrero, D. K., Donnett, J. G., Csicsvari, J. L., &#38; Kovács, K. (2018). Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning. <i>ENeuro</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/ENEURO.0087-18.2018\">https://doi.org/10.1523/ENEURO.0087-18.2018</a>","chicago":"Rangel Guerrero, Dámaris K, James G. Donnett, Jozsef L Csicsvari, and Krisztián Kovács. “Tetrode Recording from the Hippocampus of Behaving Mice Coupled with Four-Point-Irradiation Closed-Loop Optogenetics: A Technique to Study the Contribution of Hippocampal SWR Events to Learning.” <i>ENeuro</i>. Society for Neuroscience, 2018. <a href=\"https://doi.org/10.1523/ENEURO.0087-18.2018\">https://doi.org/10.1523/ENEURO.0087-18.2018</a>.","ama":"Rangel Guerrero DK, Donnett JG, Csicsvari JL, Kovács K. Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning. <i>eNeuro</i>. 2018;5(4). doi:<a href=\"https://doi.org/10.1523/ENEURO.0087-18.2018\">10.1523/ENEURO.0087-18.2018</a>"},"volume":5,"author":[{"id":"4871BCE6-F248-11E8-B48F-1D18A9856A87","full_name":"Rangel Guerrero, Dámaris K","first_name":"Dámaris K","last_name":"Rangel Guerrero","orcid":"0000-0002-8602-4374"},{"last_name":"Donnett","full_name":"Donnett, James G.","first_name":"James G."},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","full_name":"Csicsvari, Jozsef L","last_name":"Csicsvari","orcid":"0000-0002-5193-4036"},{"last_name":"Kovács","first_name":"Krisztián","full_name":"Kovács, Krisztián","id":"2AB5821E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6251-1007"}],"doi":"10.1523/ENEURO.0087-18.2018"},{"status":"public","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"intvolume":"       118","year":"2018","abstract":[{"text":"Crypto-currencies are digital assets designed to work as a medium of exchange, e.g., Bitcoin, but they are susceptible to attacks (dishonest behavior of participants). A framework for the analysis of attacks in crypto-currencies requires (a) modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior; (b) concurrent interactions between participants; and (c) analysis of long-term monetary gains. Traditional game-theoretic approaches for the analysis of security protocols consider either qualitative temporal properties such as safety and termination, or the very special class of one-shot (stateless) games. However, to analyze general attacks on protocols for crypto-currencies, both stateful analysis and quantitative objectives are necessary. In this work our main contributions are as follows: (a) we show how a class of concurrent mean-payo games, namely ergodic games, can model various attacks that arise naturally in crypto-currencies; (b) we present the first practical implementation of algorithms for ergodic games that scales to model realistic problems for crypto-currencies; and (c) we present experimental results showing that our framework can handle games with thousands of states and millions of transitions.","lang":"eng"}],"external_id":{"arxiv":["1806.03108"]},"quality_controlled":"1","oa":1,"file":[{"file_size":1078309,"date_created":"2018-12-17T12:08:00Z","date_updated":"2020-07-14T12:47:34Z","file_name":"2018_CONCUR_Chatterjee.pdf","creator":"dernst","relation":"main_file","access_level":"open_access","checksum":"68a055b1aaa241cc38375083cf832a7d","content_type":"application/pdf","file_id":"5696"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","arxiv":1,"ddc":["000"],"scopus_import":"1","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2018-09-01T00:00:00Z","date_created":"2018-12-11T11:44:27Z","file_date_updated":"2020-07-14T12:47:34Z","article_processing_charge":"No","department":[{"_id":"KrCh"}],"day":"01","publication_identifier":{"isbn":["978-3-95977-087-3"]},"language":[{"iso":"eng"}],"_id":"66","publication_status":"published","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"conference":{"end_date":"2018-09-07","location":"Beijing, China","start_date":"2018-09-04","name":"CONCUR: Conference on Concurrency Theory"},"article_number":"11","has_accepted_license":"1","month":"09","date_updated":"2026-08-04T22:31:02Z","alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.CONCUR.2018.11","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Amir","full_name":"Goharshady, Amir","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen"},{"first_name":"Yaron","full_name":"Velner, Yaron","last_name":"Velner"}],"publist_id":"7988","title":"Ergodic mean-payoff games for the analysis of attacks in crypto-currencies","volume":118,"citation":{"ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118, 11.","mla":"Chatterjee, Krishnendu, et al. <i>Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies</i>. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">10.4230/LIPIcs.CONCUR.2018.11</a>.","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.","apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &#38; Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.11</a>","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.11</a>.","ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.11\">10.4230/LIPIcs.CONCUR.2018.11</a>","short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018."},"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"},"oa_version":"Published Version","type":"conference"},{"publisher":"Springer","file":[{"relation":"main_file","access_level":"open_access","checksum":"9c8a8338c571903b599b6ca93abd2cce","content_type":"application/pdf","file_id":"5716","file_size":1394993,"date_updated":"2020-07-14T12:46:00Z","date_created":"2018-12-17T15:45:49Z","file_name":"2018_ESOP_Chatterjee.pdf","creator":"dernst"}],"quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"scopus_import":"1","date_published":"2018-04-01T00:00:00Z","ddc":["000"],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:00Z","date_created":"2018-12-11T11:45:45Z","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"}],"status":"public","page":"739 - 767","intvolume":"     10801","year":"2018","abstract":[{"lang":"eng","text":"Smart contracts are computer programs that are executed by a network of mutually distrusting agents, without the need of an external trusted authority. Smart contracts handle and transfer assets of considerable value (in the form of crypto-currency like Bitcoin). Hence, it is crucial that their implementation is bug-free. We identify the utility (or expected payoff) of interacting with such smart contracts as the basic and canonical quantitative property for such contracts. We present a framework for such quantitative analysis of smart contracts. Such a formal framework poses new and novel research challenges in programming languages, as it requires modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior and modeling utilities which are not specified as standard temporal properties such as safety and termination. While game-theoretic incentives have been analyzed in the security community, their analysis has been restricted to the very special case of stateless games. However, to analyze smart contracts, stateful analysis is required as it must account for the different program states of the protocol. Our main contributions are as follows: we present (i)~a simplified programming language for smart contracts; (ii)~an automatic translation of the programs to state-based games; (iii)~an abstraction-refinement approach to solve such games; and (iv)~experimental results on real-world-inspired smart contracts."}],"doi":"10.1007/978-3-319-89884-1_26","alternative_title":["LNCS"],"acknowledgement":"The research was partially supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games).","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir","full_name":"Goharshady, Amir"},{"first_name":"Yaron","full_name":"Velner, Yaron","last_name":"Velner"}],"volume":10801,"citation":{"apa":"Chatterjee, K., Goharshady, A. K., &#38; Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-319-89884-1_26\">https://doi.org/10.1007/978-3-319-89884-1_26</a>","ama":"Chatterjee K, Goharshady AK, Velner Y. Quantitative analysis of smart contracts. In: Vol 10801. Springer; 2018:739-767. doi:<a href=\"https://doi.org/10.1007/978-3-319-89884-1_26\">10.1007/978-3-319-89884-1_26</a>","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,” 10801:739–67. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-89884-1_26\">https://doi.org/10.1007/978-3-319-89884-1_26</a>.","short":"K. Chatterjee, A.K. Goharshady, Y. Velner, in:, Springer, 2018, pp. 739–767.","ista":"Chatterjee K, Goharshady AK, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS, vol. 10801, 739–767.","ieee":"K. Chatterjee, A. K. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Analysis of Smart Contracts</i>. Vol. 10801, Springer, 2018, pp. 739–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-89884-1_26\">10.1007/978-3-319-89884-1_26</a>."},"title":"Quantitative analysis of smart contracts","publist_id":"7554","oa_version":"Published Version","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","_id":"311","publication_status":"published","language":[{"iso":"eng"}],"day":"01","department":[{"_id":"KrCh"}],"has_accepted_license":"1","related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"conference":{"name":"ESOP: European Symposium on Programming","location":"Thessaloniki, Greece","end_date":"2018-04-19","start_date":"2018-04-16"},"month":"04","date_updated":"2026-08-04T22:31:02Z"},{"year":"2018","abstract":[{"lang":"eng","text":"We  present  a  secure  approach  for  maintaining  andreporting  credit  history  records  on  the  Blockchain.  Our  ap-proach  removes  third-parties  such  as  credit  reporting  agen-cies  from  the  lending  process  and  replaces  them  with  smartcontracts.  This  allows  customers  to  interact  directly  with  thelenders  or  banks  while  ensuring  the  integrity,  unmalleabilityand  privacy  of  their  credit  data.  Additionally,  each  customerhas  full  control  over  complete  or  selective  disclosure  of  hercredit records, eliminating the risk of privacy violations or databreaches. Moreover, our approach provides strong guaranteesfor the lenders as well. A lender can check both correctness andcompleteness of the credit data disclosed to her. This is the firstapproach  that  can  perform  all  credit  reporting  tasks  withouta  central  authority  or  changing  the  financial  mechanisms*."}],"status":"public","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"page":"1343-1348","ddc":["000"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ec_funded":1,"date_published":"2018-09-01T00:00:00Z","scopus_import":"1","date_created":"2019-04-18T10:37:35Z","file_date_updated":"2020-07-14T12:47:27Z","article_processing_charge":"No","external_id":{"arxiv":["1805.09104"],"isi":["000481634500196"]},"oa":1,"quality_controlled":"1","file":[{"date_updated":"2020-07-14T12:47:27Z","date_created":"2019-04-18T10:36:39Z","file_size":624338,"creator":"akafshda","file_name":"blockchain2018.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"6341","checksum":"b25c9bb7cf6e7e6634e692d26d41ead8"}],"publisher":"IEEE","arxiv":1,"month":"09","date_updated":"2026-08-04T22:31:03Z","publication":"Proceedings of the IEEE International Conference on Blockchain","department":[{"_id":"KrCh"}],"day":"01","publication_identifier":{"isbn":["978-1-5386-7975-3 "]},"language":[{"iso":"eng"}],"publication_status":"published","_id":"6340","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"conference":{"name":"IEEE International Conference on Blockchain","location":"Halifax, Canada","end_date":"2018-08-03","start_date":"2018-07-30"},"has_accepted_license":"1","title":"Secure Credit Reporting on the Blockchain","citation":{"apa":"Goharshady, A. K., Behrouz, A., &#38; Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In <i>Proceedings of the IEEE International Conference on Blockchain</i> (pp. 1343–1348). Halifax, Canada: IEEE. <a href=\"https://doi.org/10.1109/Cybermatics_2018.2018.00231\">https://doi.org/10.1109/Cybermatics_2018.2018.00231</a>","ama":"Goharshady AK, Behrouz A, Chatterjee K. Secure Credit Reporting on the Blockchain. In: <i>Proceedings of the IEEE International Conference on Blockchain</i>. IEEE; 2018:1343-1348. doi:<a href=\"https://doi.org/10.1109/Cybermatics_2018.2018.00231\">10.1109/Cybermatics_2018.2018.00231</a>","chicago":"Goharshady, Amir Kafshdar, Ali Behrouz, and Krishnendu Chatterjee. “Secure Credit Reporting on the Blockchain.” In <i>Proceedings of the IEEE International Conference on Blockchain</i>, 1343–48. IEEE, 2018. <a href=\"https://doi.org/10.1109/Cybermatics_2018.2018.00231\">https://doi.org/10.1109/Cybermatics_2018.2018.00231</a>.","short":"A.K. Goharshady, A. Behrouz, K. Chatterjee, in:, Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–1348.","ista":"Goharshady AK, Behrouz A, Chatterjee K. 2018. Secure Credit Reporting on the Blockchain. Proceedings of the IEEE International Conference on Blockchain. IEEE International Conference on Blockchain, 1343–1348.","ieee":"A. K. Goharshady, A. Behrouz, and K. Chatterjee, “Secure Credit Reporting on the Blockchain,” in <i>Proceedings of the IEEE International Conference on Blockchain</i>, Halifax, Canada, 2018, pp. 1343–1348.","mla":"Goharshady, Amir Kafshdar, et al. “Secure Credit Reporting on the Blockchain.” <i>Proceedings of the IEEE International Conference on Blockchain</i>, IEEE, 2018, pp. 1343–48, doi:<a href=\"https://doi.org/10.1109/Cybermatics_2018.2018.00231\">10.1109/Cybermatics_2018.2018.00231</a>."},"tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"isi":1,"oa_version":"Submitted Version","type":"conference","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","doi":"10.1109/Cybermatics_2018.2018.00231","author":[{"orcid":"0000-0003-1702-6584","last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Behrouz, Ali","first_name":"Ali","last_name":"Behrouz"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"}]},{"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","citation":{"short":"K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).","apa":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., &#38; Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. <i>ACM Transactions on Programming Languages and Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3210257\">https://doi.org/10.1145/3210257</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” <i>ACM Transactions on Programming Languages and Systems</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3210257\">https://doi.org/10.1145/3210257</a>.","ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. <i>ACM Transactions on Programming Languages and Systems</i>. 2018;40(3). doi:<a href=\"https://doi.org/10.1145/3210257\">10.1145/3210257</a>","ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2018. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 40(3), 9.","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 40, no. 3. Association for Computing Machinery, 2018.","mla":"Chatterjee, Krishnendu, et al. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 40, no. 3, 9, Association for Computing Machinery, 2018, doi:<a href=\"https://doi.org/10.1145/3210257\">10.1145/3210257</a>."},"volume":40,"type":"journal_article","oa_version":"Preprint","isi":1,"doi":"10.1145/3210257","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar"},{"last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"}],"month":"08","date_updated":"2026-08-04T22:31:03Z","publication":"ACM Transactions on Programming Languages and Systems","publication_identifier":{"issn":["0164-0925"]},"department":[{"_id":"KrCh"}],"day":"01","publication_status":"published","_id":"6009","language":[{"iso":"eng"}],"article_number":"9","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5441"},{"status":"public","id":"5442","relation":"earlier_version"},{"status":"public","id":"1437","relation":"earlier_version"},{"id":"8934","status":"public","relation":"dissertation_contains"}]},"date_published":"2018-08-01T00:00:00Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","article_processing_charge":"No","date_created":"2019-02-14T14:31:52Z","oa":1,"quality_controlled":"1","external_id":{"isi":["000444694800001"],"arxiv":["1510.07565"]},"arxiv":1,"publisher":"Association for Computing Machinery","year":"2018","issue":"3","abstract":[{"lang":"eng","text":"We study algorithmic questions wrt algebraic path properties in concurrent systems, where the transitions of the system are labeled from a complete, closed semiring. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.\r\nOur main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.\r\n"}],"main_file_link":[{"url":"https://arxiv.org/abs/1510.07565","open_access":"1"}],"status":"public","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"}],"intvolume":"        40","corr_author":"1"},{"date_created":"2019-02-13T13:26:27Z","article_processing_charge":"No","date_published":"2018-07-17T00:00:00Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","external_id":{"arxiv":["1804.08984"],"isi":["000764175404118"]},"oa":1,"quality_controlled":"1","arxiv":1,"publisher":"IJCAI","abstract":[{"lang":"eng","text":"We consider the stochastic shortest path (SSP)problem for succinct Markov decision processes(MDPs), where the MDP consists of a set of vari-ables, and a set of nondeterministic rules that up-date the variables. First, we show that several ex-amples from the AI literature can be modeled assuccinct MDPs.  Then we present computationalapproaches for upper and lower bounds for theSSP problem: (a) for computing upper bounds, ourmethod is polynomial-time in the implicit descrip-tion of the MDP; (b) for lower bounds, we present apolynomial-time (in the size of the implicit descrip-tion) reduction to quadratic programming. Our ap-proach is applicable even to infinite-state MDPs.Finally, we present experimental results to demon-strate the effectiveness of our approach on severalclassical examples from the AI literature."}],"main_file_link":[{"url":"https://arxiv.org/abs/1804.08984","open_access":"1"}],"year":"2018","intvolume":"      2018","page":"4700-4707","status":"public","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"}],"type":"conference","oa_version":"Preprint","isi":1,"title":"Computational approaches for stochastic shortest path on succinct MDPs","volume":2018,"citation":{"chicago":"Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” In <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>, 2018:4700–4707. IJCAI, 2018. <a href=\"https://doi.org/10.24963/ijcai.2018/653\">https://doi.org/10.24963/ijcai.2018/653</a>.","ama":"Chatterjee K, Fu H, Goharshady AK, Okati N. Computational approaches for stochastic shortest path on succinct MDPs. In: <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>. Vol 2018. IJCAI; 2018:4700-4707. doi:<a href=\"https://doi.org/10.24963/ijcai.2018/653\">10.24963/ijcai.2018/653</a>","apa":"Chatterjee, K., Fu, H., Goharshady, A. K., &#38; Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i> (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. <a href=\"https://doi.org/10.24963/ijcai.2018/653\">https://doi.org/10.24963/ijcai.2018/653</a>","short":"K. Chatterjee, H. Fu, A.K. Goharshady, N. Okati, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4700–4707.","mla":"Chatterjee, Krishnendu, et al. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>, vol. 2018, IJCAI, 2018, pp. 4700–07, doi:<a href=\"https://doi.org/10.24963/ijcai.2018/653\">10.24963/ijcai.2018/653</a>.","ieee":"K. Chatterjee, H. Fu, A. K. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.","ista":"Chatterjee K, Fu H, Goharshady AK, Okati N. 2018. Computational approaches for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4700–4707."},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Fu, Hongfei","first_name":"Hongfei","last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goharshady","full_name":"Goharshady, Amir","first_name":"Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584"},{"first_name":"Nastaran","full_name":"Okati, Nastaran","last_name":"Okati"}],"doi":"10.24963/ijcai.2018/653","date_updated":"2026-08-04T22:31:03Z","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","month":"07","conference":{"end_date":"2018-07-19","location":"Stockholm, Sweden","start_date":"2018-07-13","name":"IJCAI: International Joint Conference on Artificial Intelligence"},"related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"day":"17","department":[{"_id":"KrCh"}],"publication_identifier":{"isbn":["9780999241127"],"issn":["1045-0823"]},"language":[{"iso":"eng"}],"_id":"5977","publication_status":"published"},{"article_type":"original","month":"03","acknowledged_ssus":[{"_id":"Bio"}],"date_updated":"2026-08-04T22:31:04Z","publication":"Science","day":"23","department":[{"_id":"MiSi"}],"_id":"402","publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"6947","status":"public","relation":"dissertation_contains"}]},"title":"Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice","publist_id":"7428","citation":{"short":"M. Brown, F.P. Assen, A.F. Leithner, J. Abe, H. Schachner, G. Asfour, Z. Bagó Horváth, J. Stein, P. Uhrin, M.K. Sixt, D. Kerjaschki, Science 359 (2018) 1408–1411.","apa":"Brown, M., Assen, F. P., Leithner, A. F., Abe, J., Schachner, H., Asfour, G., … Kerjaschki, D. (2018). Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aal3662\">https://doi.org/10.1126/science.aal3662</a>","chicago":"Brown, Markus, Frank P Assen, Alexander F Leithner, Jun Abe, Helga Schachner, Gabriele Asfour, Zsuzsanna Bagó Horváth, et al. “Lymph Node Blood Vessels Provide Exit Routes for Metastatic Tumor Cell Dissemination in Mice.” <i>Science</i>. American Association for the Advancement of Science, 2018. <a href=\"https://doi.org/10.1126/science.aal3662\">https://doi.org/10.1126/science.aal3662</a>.","ama":"Brown M, Assen FP, Leithner AF, et al. Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice. <i>Science</i>. 2018;359(6382):1408-1411. doi:<a href=\"https://doi.org/10.1126/science.aal3662\">10.1126/science.aal3662</a>","ista":"Brown M, Assen FP, Leithner AF, Abe J, Schachner H, Asfour G, Bagó Horváth Z, Stein J, Uhrin P, Sixt MK, Kerjaschki D. 2018. Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice. Science. 359(6382), 1408–1411.","ieee":"M. Brown <i>et al.</i>, “Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice,” <i>Science</i>, vol. 359, no. 6382. American Association for the Advancement of Science, pp. 1408–1411, 2018.","mla":"Brown, Markus, et al. “Lymph Node Blood Vessels Provide Exit Routes for Metastatic Tumor Cell Dissemination in Mice.” <i>Science</i>, vol. 359, no. 6382, American Association for the Advancement of Science, 2018, pp. 1408–11, doi:<a href=\"https://doi.org/10.1126/science.aal3662\">10.1126/science.aal3662</a>."},"volume":359,"type":"journal_article","oa_version":"Published Version","isi":1,"acknowledgement":"M.B. was supported by the Cell Communication in Health and Disease graduate study program of the Austrian Science Fund (FWF) and the Medical University of Vienna. M.S. was supported by the European Research Council (grant ERC GA 281556) and an FWF START award.\r\nWe thank C. Moussion for establishing the intralymphatic injection at IST Austria and for providing anti-PNAd hybridoma supernatant, R. Förster and A. Braun for sharing the intralymphatic injection technology, K. Vaahtomeri for the lentiviral constructs, M. Hons for establishing in vivo multiphoton imaging, the Sixt lab for intellectual input, M. Schunn for help with the design of the in vivo experiments, F. Langer for technical assistance with the in vivo experiments, the bioimaging facility of IST Austria for support, and R. Efferl for providing the CT26 cell line.","doi":"10.1126/science.aal3662","author":[{"id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","first_name":"Markus","full_name":"Brown, Markus","last_name":"Brown"},{"orcid":"0000-0003-3470-6119","id":"3A8E7F24-F248-11E8-B48F-1D18A9856A87","full_name":"Assen, Frank P","first_name":"Frank P","last_name":"Assen"},{"orcid":"0000-0002-1073-744X","last_name":"Leithner","full_name":"Leithner, Alexander F","first_name":"Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Abe","full_name":"Abe, Jun","first_name":"Jun"},{"last_name":"Schachner","first_name":"Helga","full_name":"Schachner, Helga"},{"last_name":"Asfour","first_name":"Gabriele","full_name":"Asfour, Gabriele"},{"last_name":"Bagó Horváth","full_name":"Bagó Horváth, Zsuzsanna","first_name":"Zsuzsanna"},{"first_name":"Jens","full_name":"Stein, Jens","last_name":"Stein"},{"last_name":"Uhrin","first_name":"Pavel","full_name":"Uhrin, Pavel"},{"first_name":"Michael K","full_name":"Sixt, Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179"},{"last_name":"Kerjaschki","full_name":"Kerjaschki, Dontscho","first_name":"Dontscho"}],"year":"2018","issue":"6382","abstract":[{"text":"During metastasis, malignant cells escape the primary tumor, intravasate lymphatic vessels, and reach draining sentinel lymph nodes before they colonize distant organs via the blood circulation. Although lymph node metastasis in cancer patients correlates with poor prognosis, evidence is lacking as to whether and how tumor cells enter the bloodstream via lymph nodes. To investigate this question, we delivered carcinoma cells into the lymph nodes of mice by microinfusing the cells into afferent lymphatic vessels. We found that tumor cells rapidly infiltrated the lymph node parenchyma, invaded blood vessels, and seeded lung metastases without involvement of the thoracic duct. These results suggest that the lymph node blood vessels can serve as an exit route for systemic dissemination of cancer cells in experimental mouse models. Whether this form of tumor cell spreading occurs in cancer patients remains to be determined.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1126/science.aal3662"}],"status":"public","project":[{"grant_number":"Y 564-B12","call_identifier":"FWF","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","name":"Cytoskeletal force generation and force transduction of migrating leukocytes"},{"_id":"25A603A2-B435-11E9-9278-68D0E5697425","name":"Cytoskeletal force generation and force transduction of migrating leukocytes","call_identifier":"FP7","grant_number":"281556"}],"intvolume":"       359","page":"1408 - 1411","corr_author":"1","scopus_import":"1","date_published":"2018-03-23T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"ddc":["570"],"pmid":1,"article_processing_charge":"No","date_created":"2018-12-11T11:46:16Z","quality_controlled":"1","oa":1,"external_id":{"isi":["000428043600047"],"pmid":["29567714"]},"publisher":"American Association for the Advancement of Science"},{"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"},"isi":1,"type":"journal_article","oa_version":"Published Version","citation":{"apa":"Luján, R., Aguado, C., Ciruela, F., Cózar, J., Kleindienst, D., De La Ossa, L., … Fukazawa, Y. (2018). Differential association of GABAB receptors with their effector ion channels in Purkinje cells. <i>Brain Structure and Function</i>. Springer. <a href=\"https://doi.org/10.1007/s00429-017-1568-y\">https://doi.org/10.1007/s00429-017-1568-y</a>","ama":"Luján R, Aguado C, Ciruela F, et al. Differential association of GABAB receptors with their effector ion channels in Purkinje cells. <i>Brain Structure and Function</i>. 2018;223(3):1565-1587. doi:<a href=\"https://doi.org/10.1007/s00429-017-1568-y\">10.1007/s00429-017-1568-y</a>","chicago":"Luján, Rafael, Carolina Aguado, Francisco Ciruela, Javier Cózar, David Kleindienst, Luis De La Ossa, Bernhard Bettler, et al. “Differential Association of GABAB Receptors with Their Effector Ion Channels in Purkinje Cells.” <i>Brain Structure and Function</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00429-017-1568-y\">https://doi.org/10.1007/s00429-017-1568-y</a>.","short":"R. Luján, C. Aguado, F. Ciruela, J. Cózar, D. Kleindienst, L. De La Ossa, B. Bettler, K. Wickman, M. Watanabe, R. Shigemoto, Y. Fukazawa, Brain Structure and Function 223 (2018) 1565–1587.","ista":"Luján R, Aguado C, Ciruela F, Cózar J, Kleindienst D, De La Ossa L, Bettler B, Wickman K, Watanabe M, Shigemoto R, Fukazawa Y. 2018. Differential association of GABAB receptors with their effector ion channels in Purkinje cells. Brain Structure and Function. 223(3), 1565–1587.","mla":"Luján, Rafael, et al. “Differential Association of GABAB Receptors with Their Effector Ion Channels in Purkinje Cells.” <i>Brain Structure and Function</i>, vol. 223, no. 3, Springer, 2018, pp. 1565–87, doi:<a href=\"https://doi.org/10.1007/s00429-017-1568-y\">10.1007/s00429-017-1568-y</a>.","ieee":"R. Luján <i>et al.</i>, “Differential association of GABAB receptors with their effector ion channels in Purkinje cells,” <i>Brain Structure and Function</i>, vol. 223, no. 3. Springer, pp. 1565–1587, 2018."},"volume":223,"publist_id":"7192","title":"Differential association of GABAB receptors with their effector ion channels in Purkinje cells","author":[{"first_name":"Rafael","full_name":"Luján, Rafael","last_name":"Luján"},{"first_name":"Carolina","full_name":"Aguado, Carolina","last_name":"Aguado"},{"first_name":"Francisco","full_name":"Ciruela, Francisco","last_name":"Ciruela"},{"full_name":"Cózar, Javier","first_name":"Javier","last_name":"Cózar"},{"id":"42E121A4-F248-11E8-B48F-1D18A9856A87","full_name":"Kleindienst, David","first_name":"David","last_name":"Kleindienst"},{"last_name":"De La Ossa","first_name":"Luis","full_name":"De La Ossa, Luis"},{"last_name":"Bettler","full_name":"Bettler, Bernhard","first_name":"Bernhard"},{"last_name":"Wickman","first_name":"Kevin","full_name":"Wickman, Kevin"},{"first_name":"Masahiko","full_name":"Watanabe, Masahiko","last_name":"Watanabe"},{"first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444"},{"first_name":"Yugo","full_name":"Fukazawa, Yugo","last_name":"Fukazawa"}],"doi":"10.1007/s00429-017-1568-y","publication":"Brain Structure and Function","date_updated":"2026-08-04T22:31:09Z","month":"04","article_type":"original","has_accepted_license":"1","related_material":{"record":[{"id":"9562","status":"public","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"publication_status":"published","_id":"612","day":"01","department":[{"_id":"RySh"}],"date_created":"2018-12-11T11:47:29Z","article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:20Z","ddc":["571"],"ec_funded":1,"date_published":"2018-04-01T00:00:00Z","scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"relation":"main_file","access_level":"open_access","file_id":"5157","content_type":"application/pdf","checksum":"a55b3103476ecb5f4f983d8801807e8b","date_created":"2018-12-12T10:15:36Z","date_updated":"2020-07-14T12:47:20Z","file_size":5542926,"creator":"system","file_name":"IST-2018-1013-v1+1_2018_Kleindienst_Differential.pdf"}],"publisher":"Springer","external_id":{"isi":["000428419500030"]},"quality_controlled":"1","oa":1,"pubrep_id":"1013","issue":"3","abstract":[{"text":"Metabotropic GABAB receptors mediate slow inhibitory effects presynaptically and postsynaptically through the modulation of different effector signalling pathways. Here, we analysed the distribution of GABAB receptors using highly sensitive SDS-digested freeze-fracture replica labelling in mouse cerebellar Purkinje cells. Immunoreactivity for GABAB1 was observed on presynaptic and, more abundantly, on postsynaptic compartments, showing both scattered and clustered distribution patterns. Quantitative analysis of immunoparticles revealed a somato-dendritic gradient, with the density of immunoparticles increasing 26-fold from somata to dendritic spines. To understand the spatial relationship of GABAB receptors with two key effector ion channels, the G protein-gated inwardly rectifying K+ (GIRK/Kir3) channel and the voltage-dependent Ca2+ channel, biochemical and immunohistochemical approaches were performed. Co-immunoprecipitation analysis demonstrated that GABAB receptors co-assembled with GIRK and CaV2.1 channels in the cerebellum. Using double-labelling immunoelectron microscopic techniques, co-clustering between GABAB1 and GIRK2 was detected in dendritic spines, whereas they were mainly segregated in the dendritic shafts. In contrast, co-clustering of GABAB1 and CaV2.1 was detected in dendritic shafts but not spines. Presynaptically, although no significant co-clustering of GABAB1 and GIRK2 or CaV2.1 channels was detected, inter-cluster distance for GABAB1 and GIRK2 was significantly smaller in the active zone than in the dendritic shafts, and that for GABAB1 and CaV2.1 was significantly smaller in the active zone than in the dendritic shafts and spines. Thus, GABAB receptors are associated with GIRK and CaV2.1 channels in different subcellular compartments. These data provide a better framework for understanding the different roles played by GABAB receptors and their effector ion channels in the cerebellar network.","lang":"eng"}],"year":"2018","page":"1565 - 1587","intvolume":"       223","project":[{"call_identifier":"H2020","grant_number":"720270","name":"Human Brain Project Specific Grant Agreement 1","_id":"25CBA828-B435-11E9-9278-68D0E5697425"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"status":"public"},{"related_material":{"record":[{"id":"1027","status":"public","relation":"part_of_dissertation"},{"id":"696","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"1619"}]},"has_accepted_license":"1","department":[{"_id":"ToBo"},{"_id":"GradSch"}],"day":"28","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"_id":"6263","publication_status":"published","date_updated":"2026-07-30T14:47:59Z","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"LifeSc"}],"month":"12","author":[{"last_name":"Lukacisinova","full_name":"Lukacisinova, Marta","first_name":"Marta","id":"4342E402-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2519-8004"}],"OA_place":"publisher","alternative_title":["ISTA Thesis"],"doi":"10.15479/AT:ISTA:th1072","oa_version":"Published Version","type":"dissertation","title":"Genetic determinants of antibiotic resistance evolution","citation":{"ista":"Lukacisinova M. 2018. Genetic determinants of antibiotic resistance evolution. Institute of Science and Technology Austria.","ieee":"M. Lukacisinova, “Genetic determinants of antibiotic resistance evolution,” Institute of Science and Technology Austria, 2018.","mla":"Lukacisinova, Marta. <i>Genetic Determinants of Antibiotic Resistance Evolution</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1072\">10.15479/AT:ISTA:th1072</a>.","short":"M. Lukacisinova, Genetic Determinants of Antibiotic Resistance Evolution, Institute of Science and Technology Austria, 2018.","apa":"Lukacisinova, M. (2018). <i>Genetic determinants of antibiotic resistance evolution</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th1072\">https://doi.org/10.15479/AT:ISTA:th1072</a>","chicago":"Lukacisinova, Marta. “Genetic Determinants of Antibiotic Resistance Evolution.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th1072\">https://doi.org/10.15479/AT:ISTA:th1072</a>.","ama":"Lukacisinova M. Genetic determinants of antibiotic resistance evolution. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1072\">10.15479/AT:ISTA:th1072</a>"},"corr_author":"1","page":"91","status":"public","supervisor":[{"full_name":"Bollenbach, Tobias","first_name":"Tobias","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X"}],"abstract":[{"lang":"eng","text":"Antibiotic  resistance  can  emerge  spontaneously  through  genomic  mutation  and  render treatment   ineffective.   To   counteract   this process, in   addition   to   the   discovery   and description of resistance mechanisms,a deeper understanding of resistanceevolvabilityand its  determinantsis  needed. To address  this challenge,  this  thesisuncoversnew  genetic determinants   of   resistance   evolvability   using   a   customized   robotic   setup, exploressystematic   ways   in   which   resistance   evolution   is   perturbed   due   to dose-responsecharacteristics  of  drugs and  mutation  rate  differences,and  mathematically  investigates the evolutionary fate of one specific type of evolvability modifier -a stress-induced mutagenesis allele.We  find  severalgenes  which  strongly  inhibit  or  potentiate  resistance  evolution.  In  order to identify   them,   we   first developedan   automated   high-throughput   feedback-controlled protocol whichkeeps the population size and selection pressure approximately constant for hundreds  of  cultures  by  dynamically  re-diluting  the  cultures  and  adjusting  the  antibiotic concentration.  We  implementedthis  protocol  on  a  customized  liquid  handling  robot  and propagated  100  different  gene  deletion  strains  of Escherichia  coliin  triplicate  for  over  100 generations  in  tetracycline  and  in  chloramphenicol,  and  comparedtheir  adaptation  rates.We  find  a  diminishing  returns  pattern,  where  initially  sensitive  strains  adapted  more compared to less sensitive ones.  Our data uncover that deletions of certain genes which do not  affect  mutation  rate,including  efflux  pump  components,  a  chaperone  and severalstructural  and regulatory  genes  can strongly  and  reproducibly  alterresistance  evolution. Sequencing   analysis of   evolved   populations   indicates   that   epistasis   with   resistance mutations  is  the  most  likelyexplanation. This  work  could  inspire  treatment  strategies  in which  targeted  inhibitors  of  evolvability  mechanisms  will  be  given  alongside  antibiotics  to slow down resistance evolution and extend theefficacy of antibiotics.We implemented  astochasticpopulation  genetics  model, toverifyways  in  which  general properties,  namely,  dose-response  characteristics  of  drugs  and  mutation  rates,  influence evolutionary  dynamics.  In  particular,  under  the  exposure  to  antibiotics  with  shallow  dose-response  curves,bacteria  have  narrower  distributions  of  fitness  effects  of  new  mutations. We  show  that in  silicothis  also  leads  to  slower  resistance  evolution.  We see and  confirm with experiments that increased mutation rates, apart from speeding up evolution, also leadto high reproducibility of phenotypic adaptation in a context of continually strong selection pressure.Knowledge  of  these  patterns  can  aid  in  predicting  the  dynamics  of  antibiotic resistance evolutionand adapting treatment schemes accordingly.Focusing on   a   previously   described   type   of   evolvability   modifier –a   stress-induced mutagenesis  allele –we  find  conditions  under  which  it  can  persist  in  a  population  under periodic  selectionakin  to  clinical  treatment. We  set  up  a  deterministic infinite  populationcontinuous  time  model  tracking  the  frequencies  of  a  mutator  and  resistance  allele  and evaluate  various  treatment  schemes  in  how  well  they  maintain  a stress-induced mutator allele. In particular,a high diversity  of stresses  is  crucial  for  the  persistence of the  mutator allele. This leads to a general trade-off where exactly those diversifying treatment schemes which  are  likely  to  decrease  levels  of  resistance  could  lead  to  stronger  selection  of  highly evolvable genotypes.In  the  long  run,  this  work  will  lead  to  a  deeper  understanding  of  the  genetic  and  cellular mechanisms involved in antibiotic resistance evolution and could inspire new strategies for slowing down its rate. "}],"degree_awarded":"PhD","year":"2018","doi_confirm":"1","oa":1,"file":[{"file_size":5656866,"date_created":"2019-04-09T13:49:24Z","date_updated":"2021-02-11T11:17:17Z","embargo":"2020-01-25","creator":"dernst","file_name":"2018_Thesis_Lukacisinova.pdf","relation":"main_file","access_level":"open_access","checksum":"fc60585c9eaad868ac007004ef130908","file_id":"6264","content_type":"application/pdf"},{"file_name":"2018_Thesis_Lukacisinova_source.docx","embargo_to":"open_access","creator":"dernst","date_updated":"2020-07-14T12:47:25Z","date_created":"2019-04-09T13:49:23Z","file_size":5168054,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"6265","checksum":"264057ec0a92ab348cc83b41f021ba92","relation":"source_file","access_level":"closed"}],"publisher":"Institute of Science and Technology Austria","date_created":"2019-04-09T13:57:15Z","article_processing_charge":"No","file_date_updated":"2021-02-11T11:17:17Z","ddc":["570","576","579"],"date_published":"2018-12-28T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"month":"06","date_updated":"2026-07-31T09:40:17Z","language":[{"iso":"eng"}],"publication_status":"published","_id":"51","day":"27","department":[{"_id":"RySh"},{"_id":"GradSch"}],"publication_identifier":{"issn":["2663-337X"]},"has_accepted_license":"1","related_material":{"record":[{"relation":"part_of_dissertation","id":"682","status":"public"}]},"citation":{"ista":"Case MJ. 2018. From the left to the right: A tale of asymmetries, environments, and hippocampal development. Institute of Science and Technology Austria.","ieee":"M. J. Case, “From the left to the right: A tale of asymmetries, environments, and hippocampal development,” Institute of Science and Technology Austria, 2018.","mla":"Case, Matthew J. <i>From the Left to the Right: A Tale of Asymmetries, Environments, and Hippocampal Development</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_1032\">10.15479/AT:ISTA:th_1032</a>.","apa":"Case, M. J. (2018). <i>From the left to the right: A tale of asymmetries, environments, and hippocampal development</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_1032\">https://doi.org/10.15479/AT:ISTA:th_1032</a>","chicago":"Case, Matthew J. “From the Left to the Right: A Tale of Asymmetries, Environments, and Hippocampal Development.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th_1032\">https://doi.org/10.15479/AT:ISTA:th_1032</a>.","ama":"Case MJ. From the left to the right: A tale of asymmetries, environments, and hippocampal development. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_1032\">10.15479/AT:ISTA:th_1032</a>","short":"M.J. Case, From the Left to the Right: A Tale of Asymmetries, Environments, and Hippocampal Development, Institute of Science and Technology Austria, 2018."},"publist_id":"8003","title":"From the left to the right: A tale of asymmetries, environments, and hippocampal development","oa_version":"Published Version","type":"dissertation","doi":"10.15479/AT:ISTA:th_1032","alternative_title":["ISTA Thesis"],"author":[{"id":"44B7CA5A-F248-11E8-B48F-1D18A9856A87","last_name":"Case","full_name":"Case, Matthew J","first_name":"Matthew J"}],"OA_place":"publisher","doi_confirm":"1","degree_awarded":"PhD","year":"2018","pubrep_id":"1032","abstract":[{"text":"Asymmetries have long been known about in the central nervous system. From gross anatomical differences, such as the presence of the parapineal organ in only one hemisphere of the developing zebrafish, to more subtle differences in activity between both hemispheres, as seen in freely roaming animals or human participants under PET and fMRI imaging analysis. The presence of asymmetries has been demonstrated to have huge behavioural implications, with their disruption often leading to the generation of neurological disorders, memory problems, changes in personality, and in an organism's health and well-being. For my Ph.D. work I aimed to tackle two important avenues of research. The first being the process of input-side dependency in the hippocampus, with the goal of finding a key gene responsible for its development (Gene X). The second project was to do with experience-induced laterality formation in the hippocampus. Specifically, how laterality in the synapse density of the CA1 stratum radiatum (s.r.) could be induced purely through environmental enrichment. Through unilateral tracer injections into the CA3, I was able to selectively measure the properties of synapses within the CA1 and investigate how they differed based upon which hemisphere the presynaptic neurone originated. Having found the existence of a previously unreported reversed (left-isomerism) i.v. mutant, through morpholocal examination of labelled terminals in the CA1 s.r., I aimed to elucidate a key gene responsible for the process of left or right determination of inputs to the CA1 s.r.. This work relates to the previous finding of input-side dependent asymmetry in the wild-type rodent, where the origin of the projecting neurone to the CA1 will determine the morphology of a synapse, to a greater degree than the hemisphere in which the projection terminates. Using left- and right-isomerism i.v. mice, in combination with whole genome sequence analysis, I highlight Ena/VASP-like (Evl) as a potential target for Gene X. In relation to this topic, I also highlight my work in the recently published paper of how knockout of PirB can lead to a lack of input-side dependency in the murine hippocampus. For the second question, I show that the environmental enrichment paradigm will lead to an asymmetry in the synapse densities in the hippocampus of mice. I also highlight that the nature of the enrichment is of less consequence than the process of enrichment itself. I demonstrate that the CA3 region will dramatically alter its projection targets, in relation to environmental stimulation, with the asymmetry in synaptic density, caused by enrichment, relying heavily on commissural fibres. I also highlight the vital importance of input-side dependent asymmetry, as a necessary component of experience-dependent laterality formation in the CA1 s.r.. However, my results suggest that it isn't the only cause, as there appears to be a CA1 dependent mechanism also at play. Upon further investigation, I highlight the significant, and highly important, finding that the changes seen in the CA1 s.r. were predominantly caused through projections from the left-CA3, with the right-CA3 having less involvement in this mechanism.","lang":"eng"}],"supervisor":[{"full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444"}],"status":"public","page":"186","corr_author":"1","ddc":["571","576"],"date_published":"2018-06-27T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2018-12-11T11:44:22Z","file_date_updated":"2021-02-11T23:30:13Z","article_processing_charge":"No","file":[{"creator":"dernst","file_name":"2018_Thesis_Case_Source.doc","embargo_to":"open_access","file_size":141270528,"date_created":"2019-04-09T07:16:26Z","date_updated":"2021-02-11T23:30:13Z","checksum":"dcc7b55619d8509dd62b8e99d6cdee44","content_type":"application/msword","file_id":"6251","relation":"source_file","access_level":"closed"},{"file_size":15193621,"date_created":"2019-04-09T07:16:23Z","date_updated":"2021-02-11T11:17:14Z","embargo":"2019-07-05","file_name":"2018_Thesis_Case.pdf","creator":"dernst","access_level":"open_access","relation":"main_file","checksum":"f69fdd5c8709c4e618aa8c1a1221153d","content_type":"application/pdf","file_id":"6252"}],"publisher":"Institute of Science and Technology Austria","oa":1},{"date_created":"2018-12-11T11:44:08Z","article_processing_charge":"No","file_date_updated":"2021-02-11T11:17:16Z","ddc":["570"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2018-11-21T00:00:00Z","oa":1,"file":[{"relation":"source_file","access_level":"closed","checksum":"41fdbf5fdce312802935d88a8ad9932c","file_id":"6396","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":17949175,"date_updated":"2019-11-23T23:30:03Z","date_created":"2019-05-10T07:47:04Z","file_name":"Thesis_LaukoterSusanne_FINAL.docx","embargo_to":"open_access","creator":"dernst"},{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"6397","checksum":"53001a9a0c9e570e598d861bb0af28aa","date_created":"2019-05-10T07:47:04Z","date_updated":"2021-02-11T11:17:16Z","file_size":21187245,"file_name":"Thesis_LaukoterSusanne_FINAL.pdf","creator":"dernst","embargo":"2019-11-21"}],"publisher":"Institute of Science and Technology Austria","abstract":[{"text":"Genomic imprinting is an epigenetic process that leads to parent of origin-specific gene expression in a subset of genes. Imprinted genes are essential for brain development, and deregulation of imprinting is associated with neurodevelopmental diseases and the pathogenesis of psychiatric disorders. However, the cell-type specificity of imprinting at single cell resolution, and how imprinting and thus gene dosage regulates neuronal circuit assembly is still largely unknown. Here, MADM (Mosaic Analysis with Double Markers) technology was employed to assess genomic imprinting at single cell level. By visualizing MADM-induced uniparental disomies (UPDs) in distinct colors at single cell level in genetic mosaic animals, this experimental paradigm provides a unique quantitative platform to systematically assay the UPD-mediated imbalances in imprinted gene expression at unprecedented resolution. An experimental pipeline based on FACS, RNA-seq and bioinformatics analysis was established and applied to systematically map cell-type-specific ‘imprintomes’ in the mouse brain. The results revealed that parental-specific expression of imprinted genes per se is rarely cell-type-specific even at the individual cell level. Conversely, when we extended the comparison to downstream responses resulting from imbalanced imprinted gene expression, we discovered an unexpectedly high degree of cell-type specificity. Furthermore, we determined a novel function of genomic imprinting in cortical astrocyte production and in olfactory bulb (OB) granule cell generation. These results suggest important functional implication of genomic imprinting for generating cell-type diversity in the brain. In addition, MADM provides a powerful tool to study candidate genes by concomitant genetic manipulation and fluorescent labelling of single cells. MADM-based candidate gene approach was utilized to identify potential imprinted genes involved in the generation of cortical astrocytes and OB granule cells. We investigated p57Kip2, a maternally expressed gene and known cell cycle regulator. Although we found that p57Kip2 does not play a role in these processes, we detected an unexpected function of the paternal allele previously thought to be silent. Finally, we took advantage of a key property of MADM which is to allow unambiguous investigation of environmental impact on single cells. The experimental pipeline based on FACS and RNA-seq analysis of MADM-labeled cells was established to probe the functional differences of single cell loss of gene function compared to global loss of function on a transcriptional level. With this method, both common and distinct responses were isolated due to cell-autonomous and non-autonomous effects acting on genotypically identical cells. As a result, transcriptional changes were identified which result solely from the surrounding environment. Using the MADM technology to study genomic imprinting at single cell resolution, we have identified cell-type-specific gene expression, novel gene function and the impact of environment on single cell transcriptomes. Together, these provide important insights to the understanding of mechanisms regulating cell-type specificity and thus diversity in the brain.","lang":"eng"}],"pubrep_id":"1057","degree_awarded":"PhD","year":"2018","doi_confirm":"1","page":"1 - 139","corr_author":"1","status":"public","supervisor":[{"last_name":"Vicoso","full_name":"Vicoso, Beatriz","first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306"}],"oa_version":"Published Version","type":"dissertation","publist_id":"8046","title":"Role of genomic imprinting in cerebral cortex development","citation":{"apa":"Laukoter, S. (2018). <i>Role of genomic imprinting in cerebral cortex development</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th1057\">https://doi.org/10.15479/AT:ISTA:th1057</a>","ama":"Laukoter S. Role of genomic imprinting in cerebral cortex development. 2018:1-139. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1057\">10.15479/AT:ISTA:th1057</a>","chicago":"Laukoter, Susanne. “Role of Genomic Imprinting in Cerebral Cortex Development.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th1057\">https://doi.org/10.15479/AT:ISTA:th1057</a>.","short":"S. Laukoter, Role of Genomic Imprinting in Cerebral Cortex Development, Institute of Science and Technology Austria, 2018.","ista":"Laukoter S. 2018. Role of genomic imprinting in cerebral cortex development. Institute of Science and Technology Austria.","ieee":"S. Laukoter, “Role of genomic imprinting in cerebral cortex development,” Institute of Science and Technology Austria, 2018.","mla":"Laukoter, Susanne. <i>Role of Genomic Imprinting in Cerebral Cortex Development</i>. Institute of Science and Technology Austria, 2018, pp. 1–139, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1057\">10.15479/AT:ISTA:th1057</a>."},"author":[{"first_name":"Susanne","full_name":"Laukoter, Susanne","last_name":"Laukoter","id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7903-3010"}],"OA_place":"publisher","alternative_title":["ISTA Thesis"],"doi":"10.15479/AT:ISTA:th1057","date_updated":"2026-07-29T13:40:27Z","month":"11","has_accepted_license":"1","day":"21","department":[{"_id":"SiHi"},{"_id":"GradSch"}],"publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"_id":"10","publication_status":"published"},{"_id":"539","publication_status":"published","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"department":[{"_id":"EvBe"},{"_id":"GradSch"}],"day":"01","has_accepted_license":"1","related_material":{"record":[{"status":"public","id":"1024","relation":"part_of_dissertation"}]},"month":"01","date_updated":"2026-07-29T13:30:01Z","doi":"10.15479/AT:ISTA:th_930","alternative_title":["ISTA Thesis"],"OA_place":"publisher","author":[{"orcid":"0000-0003-3638-1426","id":"4DC4AF46-F248-11E8-B48F-1D18A9856A87","last_name":"Hurny","full_name":"Hurny, Andrej","first_name":"Andrej"}],"citation":{"ista":"Hurny A. 2018. Identification and characterization of novel auxin-cytokinin cross-talk components. Institute of Science and Technology Austria.","mla":"Hurny, Andrej. <i>Identification and Characterization of Novel Auxin-Cytokinin Cross-Talk Components</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_930\">10.15479/AT:ISTA:th_930</a>.","ieee":"A. Hurny, “Identification and characterization of novel auxin-cytokinin cross-talk components,” Institute of Science and Technology Austria, 2018.","short":"A. Hurny, Identification and Characterization of Novel Auxin-Cytokinin Cross-Talk Components, Institute of Science and Technology Austria, 2018.","apa":"Hurny, A. (2018). <i>Identification and characterization of novel auxin-cytokinin cross-talk components</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_930\">https://doi.org/10.15479/AT:ISTA:th_930</a>","chicago":"Hurny, Andrej. “Identification and Characterization of Novel Auxin-Cytokinin Cross-Talk Components.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th_930\">https://doi.org/10.15479/AT:ISTA:th_930</a>.","ama":"Hurny A. Identification and characterization of novel auxin-cytokinin cross-talk components. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_930\">10.15479/AT:ISTA:th_930</a>"},"title":"Identification and characterization of novel auxin-cytokinin cross-talk components","publist_id":"7277","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"},"oa_version":"Published Version","type":"dissertation","supervisor":[{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","full_name":"Benková, Eva","first_name":"Eva","orcid":"0000-0002-8510-9739"}],"status":"public","corr_author":"1","page":"147","doi_confirm":"1","year":"2018","degree_awarded":"PhD","pubrep_id":"930","abstract":[{"lang":"eng","text":"The whole life cycle of plants as well as their responses to environmental stimuli is governed by a complex network of hormonal regulations. A number of studies have demonstrated an essential role of both auxin and cytokinin in the regulation of many aspects of plant growth and development including embryogenesis, postembryonic organogenic processes such as root, and shoot branching, root and shoot apical meristem activity and phyllotaxis. Over the last decades essential knowledge on the key molecular factors and pathways that spatio-temporally define auxin and cytokinin activities in the plant body has accumulated. However, how both hormonal pathways are interconnected by a complex network of interactions and feedback circuits that determines the final outcome of the individual hormone actions is still largely unknown. Root system architecture establishment and in particular formation of lateral organs is prime example of developmental process at whose regulation both auxin and cytokinin pathways converge. To dissect convergence points and pathways that tightly balance auxin - cytokinin antagonistic activities that determine the root branching pattern transcriptome profiling was applied. Genome wide expression analyses of the xylem pole pericycle, a tissue giving rise to lateral roots, led to identification of genes that are highly responsive to combinatorial auxin and cytokinin treatments and play an essential function in the auxin-cytokinin regulated root branching. SYNERGISTIC AUXIN CYTOKININ 1 (SYAC1) gene, which encodes for a protein of unknown function, was detected among the top candidate genes of which expression was synergistically up-regulated by simultaneous hormonal treatment. Plants with modulated SYAC1 activity exhibit severe defects in the root system establishment and attenuate developmental responses to both auxin and cytokinin. To explore the biological function of the SYAC1, we employed different strategies including expression pattern analysis, subcellular localization and phenotypic analyses of the syac1 loss-of-function and gain-of-function transgenic lines along with the identification of the SYAC1 interaction partners. Detailed functional characterization revealed that SYAC1 acts as a developmentally specific regulator of the secretory pathway to control deposition of cell wall components and thereby rapidly fine tune elongation growth."}],"publisher":"Institute of Science and Technology Austria","file":[{"access_level":"closed","relation":"source_file","file_id":"6226","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"0c9d6d1c80d9857e6e545213467bbcb2","date_updated":"2020-12-02T23:30:08Z","date_created":"2019-04-05T09:37:56Z","file_size":28112114,"creator":"dernst","embargo_to":"open_access","file_name":"2018_Hurny_thesis_source.docx"},{"file_id":"6227","content_type":"application/pdf","checksum":"ecbe481a1413d270bd501b872c7ed54f","access_level":"open_access","relation":"main_file","file_name":"2018_Hurny_thesis.pdf","creator":"dernst","embargo":"2019-07-10","date_updated":"2020-12-02T09:52:16Z","date_created":"2019-04-05T09:37:55Z","file_size":12524427}],"oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2018-01-01T00:00:00Z","ddc":["570"],"article_processing_charge":"No","file_date_updated":"2020-12-02T23:30:08Z","date_created":"2018-12-11T11:47:03Z"},{"abstract":[{"lang":"eng","text":"The eigenvalue density of many large random matrices is well approximated by a deterministic measure, the self-consistent density of states. In the present work, we show this behaviour for several classes of random matrices. In fact, we establish that, in each of these classes, the self-consistent density of states approximates the eigenvalue density of the random matrix on all scales slightly above the typical eigenvalue spacing. For large classes of random matrices, the self-consistent density of states exhibits several universal features. We prove that, under suitable assumptions, random Gram matrices and Hermitian random matrices with decaying correlations have a 1/3-Hölder continuous self-consistent density of states ρ on R, which is analytic, where it is positive, and has either a square root edge or a cubic root cusp, where it vanishes. We, thus, extend the validity of the corresponding result for Wigner-type matrices from [4, 5, 7]. We show that ρ is determined as the inverse Stieltjes transform of the normalized trace of the unique solution m(z) to the Dyson equation −m(z) −1 = z − a + S[m(z)] on C N×N with the constraint Im m(z) ≥ 0. Here, z lies in the complex upper half-plane, a is a self-adjoint element of C N×N and S is a positivity-preserving operator on C N×N encoding the first two moments of the random matrix. In order to analyze a possible limit of ρ for N → ∞ and address some applications in free probability theory, we also consider the Dyson equation on infinite dimensional von Neumann algebras. We present two applications to random matrices. We first establish that, under certain assumptions, large random matrices with independent entries have a rotationally symmetric self-consistent density of states which is supported on a centered disk in C. Moreover, it is infinitely often differentiable apart from a jump on the boundary of this disk. Second, we show edge universality at all regular (not necessarily extreme) spectral edges for Hermitian random matrices with decaying correlations."}],"pubrep_id":"1040","degree_awarded":"PhD","year":"2018","corr_author":"1","page":"456","status":"public","project":[{"name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","call_identifier":"FP7"}],"supervisor":[{"last_name":"Erdös","first_name":"László","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603"}],"date_created":"2018-12-11T11:44:53Z","article_processing_charge":"No","file_date_updated":"2020-07-14T12:44:57Z","ddc":["515","519"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_published":"2018-07-12T00:00:00Z","ec_funded":1,"oa":1,"file":[{"date_updated":"2020-07-14T12:44:57Z","date_created":"2019-04-08T13:55:20Z","file_size":5801709,"file_name":"2018_thesis_Alt.pdf","creator":"dernst","access_level":"open_access","relation":"main_file","file_id":"6241","content_type":"application/pdf","checksum":"d4dad55a7513f345706aaaba90cb1bb8"},{"relation":"source_file","access_level":"closed","checksum":"d73fcf46300dce74c403f2b491148ab4","file_id":"6242","content_type":"application/zip","file_size":3802059,"date_updated":"2020-07-14T12:44:57Z","date_created":"2019-04-08T13:55:20Z","file_name":"2018_thesis_Alt_source.zip","creator":"dernst"}],"publisher":"Institute of Science and Technology Austria","date_updated":"2026-08-05T08:14:16Z","month":"07","related_material":{"record":[{"relation":"part_of_dissertation","id":"6184","status":"public"},{"relation":"part_of_dissertation","id":"6183","status":"public"},{"id":"1010","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"550","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"1677","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"6240"},{"relation":"part_of_dissertation","status":"public","id":"566"}]},"has_accepted_license":"1","day":"12","department":[{"_id":"LaEr"}],"publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"_id":"149","publication_status":"published","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":"dissertation","oa_version":"Published Version","publist_id":"7772","title":"Dyson equation and eigenvalue statistics of random matrices","citation":{"short":"J. Alt, Dyson Equation and Eigenvalue Statistics of Random Matrices, Institute of Science and Technology Austria, 2018.","chicago":"Alt, Johannes. “Dyson Equation and Eigenvalue Statistics of Random Matrices.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1040\">https://doi.org/10.15479/AT:ISTA:TH_1040</a>.","ama":"Alt J. Dyson equation and eigenvalue statistics of random matrices. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1040\">10.15479/AT:ISTA:TH_1040</a>","apa":"Alt, J. (2018). <i>Dyson equation and eigenvalue statistics of random matrices</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1040\">https://doi.org/10.15479/AT:ISTA:TH_1040</a>","ieee":"J. Alt, “Dyson equation and eigenvalue statistics of random matrices,” Institute of Science and Technology Austria, 2018.","mla":"Alt, Johannes. <i>Dyson Equation and Eigenvalue Statistics of Random Matrices</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1040\">10.15479/AT:ISTA:TH_1040</a>.","ista":"Alt J. 2018. Dyson equation and eigenvalue statistics of random matrices. Institute of Science and Technology Austria."},"author":[{"id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","last_name":"Alt","first_name":"Johannes","full_name":"Alt, Johannes"}],"OA_place":"publisher","alternative_title":["ISTA Thesis"],"doi":"10.15479/AT:ISTA:TH_1040"},{"volume":28,"citation":{"chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “Local Inhomogeneous Circular Law.” <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2018. <a href=\"https://doi.org/10.1214/17-AAP1302\">https://doi.org/10.1214/17-AAP1302</a>.","ama":"Alt J, Erdös L, Krüger TH. Local inhomogeneous circular law. <i>Annals of Applied Probability</i>. 2018;28(1):148-203. doi:<a href=\"https://doi.org/10.1214/17-AAP1302\">10.1214/17-AAP1302</a>","apa":"Alt, J., Erdös, L., &#38; Krüger, T. H. (2018). Local inhomogeneous circular law. <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/17-AAP1302\">https://doi.org/10.1214/17-AAP1302</a>","short":"J. Alt, L. Erdös, T.H. Krüger, Annals of Applied Probability 28 (2018) 148–203.","mla":"Alt, Johannes, et al. “Local Inhomogeneous Circular Law.” <i>Annals of Applied Probability</i>, vol. 28, no. 1, Institute of Mathematical Statistics, 2018, pp. 148–203, doi:<a href=\"https://doi.org/10.1214/17-AAP1302\">10.1214/17-AAP1302</a>.","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “Local inhomogeneous circular law,” <i>Annals of Applied Probability</i>, vol. 28, no. 1. Institute of Mathematical Statistics, pp. 148–203, 2018.","ista":"Alt J, Erdös L, Krüger TH. 2018. Local inhomogeneous circular law. Annals of Applied Probability. 28(1), 148–203."},"title":"Local inhomogeneous circular law","type":"journal_article","oa_version":"Preprint","isi":1,"doi":"10.1214/17-AAP1302","author":[{"full_name":"Alt, Johannes","first_name":"Johannes","last_name":"Alt","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87","first_name":"Torben H","full_name":"Krüger, Torben H","last_name":"Krüger"}],"month":"03","article_type":"original","publication":"Annals of Applied Probability","date_updated":"2026-08-05T08:14:17Z","_id":"566","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}],"day":"03","related_material":{"record":[{"relation":"dissertation_contains","id":"149","status":"public"}]},"user_id":"9947682f-b9fa-11ee-9c4a-b3ffaafe6614","date_published":"2018-03-03T00:00:00Z","ec_funded":1,"scopus_import":"1","article_processing_charge":"No","das_tickbox":"1","date_created":"2018-12-11T11:47:13Z","arxiv":1,"publisher":"Institute of Mathematical Statistics","oa":1,"quality_controlled":"1","external_id":{"arxiv":["1612.07776 "],"isi":["000431721800005"]},"year":"2018","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.07776 "}],"issue":"1","abstract":[{"lang":"eng","text":"We consider large random matrices X with centered, independent entries which have comparable but not necessarily identical variances. Girko's circular law asserts that the spectrum is supported in a disk and in case of identical variances, the limiting density is uniform. In this special case, the local circular law by Bourgade et. al. [11,12] shows that the empirical density converges even locally on scales slightly above the typical eigenvalue spacing. In the general case, the limiting density is typically inhomogeneous and it is obtained via solving a system of deterministic equations. Our main result is the local inhomogeneous circular law in the bulk spectrum on the optimal scale for a general variance profile of the entries of X. \r\n\r\n"}],"project":[{"grant_number":"338804","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"}],"status":"public","page":"148-203","corr_author":"1","intvolume":"        28"}]