[{"author":[{"full_name":"Espinoza Martinez, Claudia ","last_name":"Espinoza Martinez","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4710-2082","first_name":"Claudia "}],"title":"Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits","date_updated":"2026-04-08T13:57:19Z","page":"140","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"21"}]},"status":"public","language":[{"iso":"eng"}],"file_date_updated":"2021-02-11T11:17:15Z","article_processing_charge":"No","has_accepted_license":"1","oa_version":"Published Version","supervisor":[{"first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","full_name":"Jonas, Peter M"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","ddc":["570"],"OA_place":"publisher","day":"30","doi":"10.15479/AT:ISTA:6363","oa":1,"file":[{"date_updated":"2021-02-11T11:17:15Z","file_id":"6389","content_type":"application/pdf","checksum":"77c6c05cfe8b58c8abcf1b854375d084","relation":"main_file","date_created":"2019-05-07T16:00:39Z","file_name":"Espinozathesis_all2.pdf","creator":"cespinoza","embargo":"2020-05-09","file_size":13966891,"access_level":"open_access"},{"creator":"cespinoza","file_size":11159900,"file_name":"Espinoza_Thesis.docx","date_created":"2019-05-07T16:00:48Z","access_level":"closed","embargo_to":"open_access","date_updated":"2020-07-14T12:47:28Z","file_id":"6390","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"f6aa819f127691a2b0fc21c76eb09746","relation":"source_file"}],"date_published":"2019-04-30T00:00:00Z","degree_awarded":"PhD","year":"2019","publication_identifier":{"isbn":["978-3-99078-000-8"],"issn":["2663-337X"]},"_id":"6363","month":"04","publication_status":"published","date_created":"2019-04-30T11:56:10Z","alternative_title":["ISTA Thesis"],"department":[{"_id":"PeJo"}],"corr_author":"1","publisher":"Institute of Science and Technology Austria","abstract":[{"lang":"eng","text":"Distinguishing  between  similar  experiences  is  achieved  by  the  brain  in  a  process called  pattern  separation.  In  the  hippocampus,  pattern  separation  reduces  the interference of memories and increases the storage capacity by decorrelating similar inputs  patterns  of  neuronal  activity  into  non-overlapping output  firing  patterns. Winners-take-all  (WTA)  mechanism  is  a  theoretical  model  for  pattern  separation  in which  a  \"winner\"  cell  suppresses  the  activity  of  the  neighboring  neurons  through feedback inhibition. However, if the network properties of the dentate gyrus support WTA as a biologically conceivable model remains unknown. Here, we showed that the connectivity rules of PV+interneurons and their synaptic properties are optimizedfor efficient pattern separation. We found using multiple whole-cell in vitrorecordings that PV+interneurons mainly connect to granule cells (GC) through lateral inhibition, a form of  feedback  inhibition  in  which  a  GC  inhibits  other  GCs  but  not  itself  through  the activation of PV+interneurons. Thus, lateral inhibition between GC–PV+interneurons was ~10 times more abundant than recurrent connections. Furthermore, the GC–PV+interneuron  connectivity  was  more  spatially  confined  but  less  abundant  than  PV+interneurons–GC  connectivity,  leading  to  an  asymmetrical  distribution  of  excitatory and inhibitory connectivity. Our network model of the dentate gyrus with incorporated real connectivity rules efficiently decorrelates neuronal activity patterns using WTA as the  primary  mechanism.  This  process  relied  on  lateral  inhibition,  fast-signaling properties  of  PV+interneurons  and  the  asymmetrical  distribution  of  excitatory  and inhibitory connectivity. Finally, we found that silencing the activity of PV+interneurons in  vivoleads  to  acute  deficits  in  discrimination  between  similar  environments, suggesting  that  PV+interneuron  networks  are  necessary  for  behavioral  relevant computations.  Our   results   demonstrate   that   PV+interneurons  possess  unique connectivity  and  fast  signaling  properties  that confer  to  the  dentate  gyrus  network properties that allow the emergence of pattern separation. Thus, our results contribute to the knowledge of how specific forms of network organization underlie sophisticated types of information processing. \r\n"}],"type":"dissertation","citation":{"chicago":"Espinoza Martinez, Claudia . “Parvalbumin+ Interneurons Enable Efficient Pattern Separation in Hippocampal Microcircuits.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:6363\">https://doi.org/10.15479/AT:ISTA:6363</a>.","ista":"Espinoza Martinez C. 2019. Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits. Institute of Science and Technology Austria.","mla":"Espinoza Martinez, Claudia. <i>Parvalbumin+ Interneurons Enable Efficient Pattern Separation in Hippocampal Microcircuits</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6363\">10.15479/AT:ISTA:6363</a>.","ieee":"C. Espinoza Martinez, “Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits,” Institute of Science and Technology Austria, 2019.","ama":"Espinoza Martinez C. Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6363\">10.15479/AT:ISTA:6363</a>","apa":"Espinoza Martinez, C. (2019). <i>Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:6363\">https://doi.org/10.15479/AT:ISTA:6363</a>","short":"C. Espinoza Martinez, Parvalbumin+ Interneurons Enable Efficient Pattern Separation in Hippocampal Microcircuits, Institute of Science and Technology Austria, 2019."}},{"corr_author":"1","publisher":"Institute of Science and Technology Austria","department":[{"_id":"HaJa"}],"abstract":[{"lang":"eng","text":"A major challenge in neuroscience research is to dissect the circuits that orchestrate behavior in health and disease. Proteins from a wide range of non-mammalian species, such as microbial opsins, have been successfully transplanted to specific neuronal targets to override their natural communication patterns. The goal of our work is to manipulate synaptic communication in a manner that closely incorporates the functional intricacies of synapses by preserving temporal encoding (i.e. the firing pattern of the presynaptic neuron) and connectivity (i.e. target specific synapses rather than specific neurons). Our strategy to achieve this goal builds on the use of non-mammalian transplants to create a synthetic synapse. The mode of modulation comes from pre-synaptic uptake of a synthetic neurotransmitter (SN) into synaptic vesicles by means of a genetically targeted transporter selective for the SN. Upon natural vesicular release, exposure of the SN to the synaptic cleft will modify the post-synaptic potential through an orthogonal ligand gated ion channel. To achieve this goal we have functionally characterized a mixed cationic methionine-gated ion channel from Arabidopsis thaliana, designed a method to functionally characterize a synthetic transporter in isolated synaptic vesicles without the need for transgenic animals, identified and extracted multiple prokaryotic uptake systems that are substrate specific for methionine (Met), and established a primary/cell line co-culture system that would allow future combinatorial testing of this orthogonal transmitter-transporter-channel trifecta.\r\nSynthetic synapses will provide a unique opportunity to manipulate synaptic communication while maintaining the electrophysiological integrity of the pre-synaptic cell. In this way, information may be preserved that was generated in upstream circuits and that could be essential for concerted function and information processing."}],"type":"dissertation","citation":{"ista":"Mckenzie C. 2019. Design and characterization of methods and biological components to realize synthetic neurotransmission. Institute of Science and Technology Austria.","chicago":"Mckenzie, Catherine. “Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/at:ista:7132\">https://doi.org/10.15479/at:ista:7132</a>.","mla":"Mckenzie, Catherine. <i>Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/at:ista:7132\">10.15479/at:ista:7132</a>.","apa":"Mckenzie, C. (2019). <i>Design and characterization of methods and biological components to realize synthetic neurotransmission</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:7132\">https://doi.org/10.15479/at:ista:7132</a>","ieee":"C. Mckenzie, “Design and characterization of methods and biological components to realize synthetic neurotransmission,” Institute of Science and Technology Austria, 2019.","ama":"Mckenzie C. Design and characterization of methods and biological components to realize synthetic neurotransmission. 2019. doi:<a href=\"https://doi.org/10.15479/at:ista:7132\">10.15479/at:ista:7132</a>","short":"C. Mckenzie, Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission, Institute of Science and Technology Austria, 2019."},"month":"06","_id":"7132","alternative_title":["ISTA Thesis"],"date_created":"2019-11-27T09:07:14Z","publication_status":"published","OA_place":"publisher","ddc":["571","573"],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","supervisor":[{"full_name":"Janovjak, Harald L","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","first_name":"Harald L"}],"degree_awarded":"PhD","year":"2019","publication_identifier":{"issn":["2663-337X"]},"date_published":"2019-06-27T00:00:00Z","day":"27","doi":"10.15479/at:ista:7132","oa":1,"file":[{"access_level":"closed","creator":"dernst","file_size":5054633,"file_name":"McKenzie PhD Thesis August 2018 - Corrected Final.docx","date_created":"2019-11-27T09:06:10Z","checksum":"34d0fe0f6e0af97b5937205a3e350423","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","date_updated":"2020-07-14T12:47:50Z","file_id":"7133"},{"relation":"main_file","checksum":"140dfb5e3df7edca34f4b6fcc55d876f","content_type":"application/pdf","file_id":"7134","date_updated":"2020-07-14T12:47:50Z","access_level":"open_access","file_size":3231837,"creator":"dernst","date_created":"2019-11-27T09:06:10Z","file_name":"McKenzie PhD Thesis August 2018 - Corrected Final.pdf"}],"file_date_updated":"2020-07-14T12:47:50Z","has_accepted_license":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","page":"95","related_material":{"record":[{"relation":"old_edition","id":"6266","status":"public"}]},"date_updated":"2026-05-14T22:31:07Z","author":[{"first_name":"Catherine","full_name":"Mckenzie, Catherine","last_name":"Mckenzie","id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87"}],"title":"Design and characterization of methods and biological components to realize synthetic neurotransmission","oa_version":"Published Version"},{"_id":"6189","month":"03","scopus_import":"1","issue":"11","publication_status":"published","date_created":"2019-03-31T21:59:12Z","external_id":{"isi":["000461922000006"],"arxiv":["1809.06358"],"pmid":["30951357"]},"volume":122,"department":[{"_id":"BjHo"}],"publisher":"American Physical Society","main_file_link":[{"url":"https://arxiv.org/abs/1809.06358","open_access":"1"}],"pmid":1,"abstract":[{"lang":"eng","text":"Suspended particles can alter the properties of fluids and in particular also affect the transition fromlaminar to turbulent flow. An earlier study [Mataset al.,Phys. Rev. Lett.90, 014501 (2003)] reported howthe subcritical (i.e., hysteretic) transition to turbulent puffs is affected by the addition of particles. Here weshow that in addition to this known transition, with increasing concentration a supercritical (i.e.,continuous) transition to a globally fluctuating state is found. At the same time the Newtonian-typetransition to puffs is delayed to larger Reynolds numbers. At even higher concentration only the globallyfluctuating state is found. The dynamics of particle laden flows are hence determined by two competinginstabilities that give rise to three flow regimes: Newtonian-type turbulence at low, a particle inducedglobally fluctuating state at high, and a coexistence state at intermediate concentrations."}],"type":"journal_article","citation":{"apa":"Agrawal, N., Choueiri, G. H., &#38; Hof, B. (2019). Transition to turbulence in particle laden flows. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.122.114502\">https://doi.org/10.1103/PhysRevLett.122.114502</a>","ieee":"N. Agrawal, G. H. Choueiri, and B. Hof, “Transition to turbulence in particle laden flows,” <i>Physical Review Letters</i>, vol. 122, no. 11. American Physical Society, 2019.","ama":"Agrawal N, Choueiri GH, Hof B. Transition to turbulence in particle laden flows. <i>Physical Review Letters</i>. 2019;122(11). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.122.114502\">10.1103/PhysRevLett.122.114502</a>","ista":"Agrawal N, Choueiri GH, Hof B. 2019. Transition to turbulence in particle laden flows. Physical Review Letters. 122(11), 114502.","chicago":"Agrawal, Nishchal, George H Choueiri, and Björn Hof. “Transition to Turbulence in Particle Laden Flows.” <i>Physical Review Letters</i>. American Physical Society, 2019. <a href=\"https://doi.org/10.1103/PhysRevLett.122.114502\">https://doi.org/10.1103/PhysRevLett.122.114502</a>.","mla":"Agrawal, Nishchal, et al. “Transition to Turbulence in Particle Laden Flows.” <i>Physical Review Letters</i>, vol. 122, no. 11, 114502, American Physical Society, 2019, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.122.114502\">10.1103/PhysRevLett.122.114502</a>.","short":"N. Agrawal, G.H. Choueiri, B. Hof, Physical Review Letters 122 (2019)."},"quality_controlled":"1","author":[{"first_name":"Nishchal","full_name":"Agrawal, Nishchal","last_name":"Agrawal","id":"469E6004-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Choueiri","full_name":"Choueiri, George H","id":"448BD5BC-F248-11E8-B48F-1D18A9856A87","first_name":"George H"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","first_name":"Björn"}],"title":"Transition to turbulence in particle laden flows","related_material":{"record":[{"id":"9728","relation":"dissertation_contains","status":"public"}]},"date_updated":"2026-05-14T22:31:11Z","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","oa_version":"Preprint","publication":"Physical Review Letters","arxiv":1,"isi":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"22","doi":"10.1103/PhysRevLett.122.114502","oa":1,"intvolume":"       122","date_published":"2019-03-22T00:00:00Z","article_number":"114502","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"year":"2019"},{"quality_controlled":"1","pmid":1,"type":"journal_article","citation":{"apa":"Contreras, X., &#38; Hippenmeyer, S. (2019). Memo1 tiles the radial glial cell grid. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2019.08.021\">https://doi.org/10.1016/j.neuron.2019.08.021</a>","ieee":"X. Contreras and S. Hippenmeyer, “Memo1 tiles the radial glial cell grid,” <i>Neuron</i>, vol. 103, no. 5. Elsevier, pp. 750–752, 2019.","ama":"Contreras X, Hippenmeyer S. Memo1 tiles the radial glial cell grid. <i>Neuron</i>. 2019;103(5):750-752. doi:<a href=\"https://doi.org/10.1016/j.neuron.2019.08.021\">10.1016/j.neuron.2019.08.021</a>","chicago":"Contreras, Ximena, and Simon Hippenmeyer. “Memo1 Tiles the Radial Glial Cell Grid.” <i>Neuron</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.neuron.2019.08.021\">https://doi.org/10.1016/j.neuron.2019.08.021</a>.","ista":"Contreras X, Hippenmeyer S. 2019. Memo1 tiles the radial glial cell grid. Neuron. 103(5), 750–752.","mla":"Contreras, Ximena, and Simon Hippenmeyer. “Memo1 Tiles the Radial Glial Cell Grid.” <i>Neuron</i>, vol. 103, no. 5, Elsevier, 2019, pp. 750–52, doi:<a href=\"https://doi.org/10.1016/j.neuron.2019.08.021\">10.1016/j.neuron.2019.08.021</a>.","short":"X. Contreras, S. Hippenmeyer, Neuron 103 (2019) 750–752."},"main_file_link":[{"url":"https://doi.org/10.1016/j.neuron.2019.08.021","open_access":"1"}],"publisher":"Elsevier","department":[{"_id":"SiHi"}],"volume":103,"external_id":{"pmid":["31487522"],"isi":["000484400200002"]},"date_created":"2019-08-25T22:00:50Z","publication_status":"published","scopus_import":"1","issue":"5","month":"09","_id":"6830","publication_identifier":{"eissn":["1097-4199"],"issn":["0896-6273"]},"year":"2019","article_type":"letter_note","intvolume":"       103","date_published":"2019-09-04T00:00:00Z","doi":"10.1016/j.neuron.2019.08.021","day":"04","oa":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication":"Neuron","isi":1,"oa_version":"Published Version","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"date_updated":"2026-05-14T22:31:13Z","related_material":{"record":[{"status":"public","id":"7902","relation":"part_of_dissertation"}]},"page":"750-752","author":[{"id":"475990FE-F248-11E8-B48F-1D18A9856A87","last_name":"Contreras","full_name":"Contreras, Ximena","first_name":"Ximena"},{"first_name":"Simon","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87"}],"title":"Memo1 tiles the radial glial cell grid"},{"_id":"6780","scopus_import":"1","month":"10","date_created":"2019-08-09T09:54:20Z","publication_status":"published","tmp":{"short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"external_id":{"arxiv":["1901.06087"]},"conference":{"end_date":"2019-10-25","name":"OOPSLA: Object-oriented Programming, Systems, Languages and Applications","location":"Athens, Greece","start_date":"2019-10-23"},"department":[{"_id":"KrCh"}],"volume":3,"publisher":"ACM","quality_controlled":"1","abstract":[{"lang":"eng","text":"In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a\r\ngiven probabilistic program terminates with probability 1. Scalable approaches for program analysis often\r\nrely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule)\r\nof Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure\r\ntermination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [16]. While the\r\nproposed probabilistic variant cautiously addresses the key issue of integrability, we show that the proposed\r\nmodular rule is still not sound for almost-sure termination of probabilistic programs.\r\nBesides establishing unsoundness of the previous rule, our contributions are as follows: First, we present a\r\nsound modular rule for almost-sure termination of probabilistic programs. Our approach is based on a novel\r\nnotion of descent supermartingales. Second, for algorithmic approaches, we consider descent supermartingales\r\nthat are linear and show that they can be synthesized in polynomial time. Finally, we present experimental\r\nresults on a variety of benchmarks and several natural examples that model various types of nested while\r\nloops in probabilistic programs and demonstrate that our approach is able to efficiently prove their almost-sure\r\ntermination property"}],"type":"conference","citation":{"ista":"Huang M, Fu H, Chatterjee K, Goharshady AK. 2019. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 129.","chicago":"Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>, Vol. 3. ACM, 2019. <a href=\"https://doi.org/10.1145/3360555\">https://doi.org/10.1145/3360555</a>.","mla":"Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>, vol. 3, 129, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3360555\">10.1145/3360555</a>.","apa":"Huang, M., Fu, H., Chatterjee, K., &#38; Goharshady, A. K. (2019). Modular verification for almost-sure termination of probabilistic programs. In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i> (Vol. 3). Athens, Greece: ACM. <a href=\"https://doi.org/10.1145/3360555\">https://doi.org/10.1145/3360555</a>","ieee":"M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification for almost-sure termination of probabilistic programs,” in <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>, Athens, Greece, 2019, vol. 3.","ama":"Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure termination of probabilistic programs. In: <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>. Vol 3. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3360555\">10.1145/3360555</a>","short":"M. Huang, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , ACM, 2019."},"related_material":{"record":[{"status":"public","id":"8934","relation":"dissertation_contains"}]},"date_updated":"2026-05-14T22:31:18Z","title":"Modular verification for almost-sure termination of probabilistic programs","author":[{"last_name":"Huang","full_name":"Huang, Mingzhang","first_name":"Mingzhang"},{"full_name":"Fu, Hongfei","last_name":"Fu","first_name":"Hongfei"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-14T12:47:40Z","has_accepted_license":"1","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"oa_version":"Published Version","publication":"Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications ","arxiv":1,"ddc":["000"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"intvolume":"         3","date_published":"2019-10-01T00:00:00Z","day":"01","doi":"10.1145/3360555","file":[{"file_name":"oopsla-2019.pdf","date_created":"2019-08-12T15:40:57Z","file_size":1024643,"creator":"akafshda","access_level":"open_access","file_id":"6807","date_updated":"2020-07-14T12:47:40Z","relation":"main_file","content_type":"application/pdf","checksum":"3482d8ace6fb4991eb7810e3b70f1b9f"},{"date_created":"2020-05-12T15:15:14Z","file_name":"2019_ACM_Huang.pdf","creator":"dernst","file_size":538579,"access_level":"open_access","date_updated":"2020-07-14T12:47:40Z","file_id":"7821","content_type":"application/pdf","checksum":"4e5a6fb2b59a75222a4e8335a5a60eac","relation":"main_file"}],"oa":1,"ec_funded":1,"year":"2019","article_number":"129"},{"corr_author":"1","publisher":"ACM","department":[{"_id":"KrCh"}],"volume":"Part F147772","quality_controlled":"1","citation":{"short":"K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 400–408.","apa":"Chatterjee, K., Goharshady, A. K., &#38; Goharshady, E. K. (2019). The treewidth of smart contracts. In <i>Proceedings of the 34th ACM Symposium on Applied Computing</i> (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. <a href=\"https://doi.org/10.1145/3297280.3297322\">https://doi.org/10.1145/3297280.3297322</a>","ieee":"K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, Limassol, Cyprus, 2019, vol. Part F147772, pp. 400–408.","ama":"Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. In: <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>. Vol Part F147772. ACM; 2019:400-408. doi:<a href=\"https://doi.org/10.1145/3297280.3297322\">10.1145/3297280.3297322</a>","mla":"Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.” <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, vol. Part F147772, ACM, 2019, pp. 400–08, doi:<a href=\"https://doi.org/10.1145/3297280.3297322\">10.1145/3297280.3297322</a>.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.” In <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, Part F147772:400–408. ACM, 2019. <a href=\"https://doi.org/10.1145/3297280.3297322\">https://doi.org/10.1145/3297280.3297322</a>.","ista":"Chatterjee K, Goharshady AK, Goharshady EK. 2019. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772, 400–408."},"type":"conference","abstract":[{"text":"Smart contracts are programs that are stored and executed on the Blockchain and can receive, manage and transfer money (cryptocurrency units). Two important problems regarding smart contracts are formal analysis and compiler optimization. Formal analysis is extremely important, because smart contracts hold funds worth billions of dollars and their code is immutable after deployment. Hence, an undetected bug can cause significant financial losses. Compiler optimization is also crucial, because every action of a smart contract has to be executed by every node in the Blockchain network. Therefore, optimizations in compiling smart contracts can lead to significant savings in computation, time and energy.\r\n\r\nTwo classical approaches in program analysis and compiler optimization are intraprocedural and interprocedural analysis. In intraprocedural analysis, each function is analyzed separately, while interprocedural analysis considers the entire program. In both cases, the analyses are usually reduced to graph problems over the control flow graph (CFG) of the program. These graph problems are often computationally expensive. Hence, there has been ample research on exploiting structural properties of CFGs for efficient algorithms. One such well-studied property is the treewidth, which is a measure of tree-likeness of graphs. It is known that intraprocedural CFGs of structured programs have treewidth at most 6, whereas the interprocedural treewidth cannot be bounded. This result has been used as a basis for many efficient intraprocedural analyses.\r\n\r\nIn this paper, we explore the idea of exploiting the treewidth of smart contracts for formal analysis and compiler optimization. First, similar to classical programs, we show that the intraprocedural treewidth of structured Solidity and Vyper smart contracts is at most 9. Second, for global analysis, we prove that the interprocedural treewidth of structured smart contracts is bounded by 10 and, in sharp contrast with classical programs, treewidth-based algorithms can be easily applied for interprocedural analysis. Finally, we supplement our theoretical results with experiments using a tool we implemented for computing treewidth of smart contracts and show that the treewidth is much lower in practice. We use 36,764 real-world Ethereum smart contracts as benchmarks and find that they have an average treewidth of at most 3.35 for the intraprocedural case and 3.65 for the interprocedural case.\r\n","lang":"eng"}],"scopus_import":"1","month":"04","_id":"6490","pubrep_id":"1070","external_id":{"isi":["000474685800052"]},"conference":{"end_date":"2019-04-12","start_date":"2019-04-08","location":"Limassol, Cyprus","name":"SAC: Symposium on Applied Computing"},"date_created":"2019-05-26T21:59:15Z","publication_status":"published","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"publication":"Proceedings of the 34th ACM Symposium on Applied Computing","year":"2019","publication_identifier":{"isbn":["9781450359337"]},"date_published":"2019-04-01T00:00:00Z","file":[{"date_created":"2020-05-14T09:50:11Z","file_name":"2019_ACM_Chatterjee.pdf","creator":"dernst","file_size":6937138,"access_level":"open_access","date_updated":"2020-07-14T12:47:32Z","file_id":"7827","content_type":"application/pdf","checksum":"dddc20f6d9881f23b8755eb720ec9d6f","relation":"main_file"}],"oa":1,"doi":"10.1145/3297280.3297322","day":"01","article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2020-07-14T12:47:32Z","language":[{"iso":"eng"}],"status":"public","page":"400-408","date_updated":"2026-05-14T22:31:18Z","related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"title":"The treewidth of smart contracts","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar"},{"first_name":"Ehsan Kafshdar","last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar"}],"oa_version":"Submitted Version"},{"scopus_import":"1","month":"04","_id":"6378","pubrep_id":"1069","external_id":{"isi":["000474685800049"]},"conference":{"end_date":"2019-04-12","start_date":"2019-04-08","location":"Limassol, Cyprus","name":"ACM Symposium on Applied Computing"},"date_created":"2019-05-06T12:11:36Z","publication_status":"published","publisher":"ACM","department":[{"_id":"KrCh"}],"volume":"Part F147772","quality_controlled":"1","citation":{"mla":"Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, vol. Part F147772, ACM, 2019, pp. 374–81, doi:<a href=\"https://doi.org/10.1145/3297280.3297319\">10.1145/3297280.3297319</a>.","ista":"Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772, 374–381.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” In <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, Part F147772:374–81. ACM, 2019. <a href=\"https://doi.org/10.1145/3297280.3297319\">https://doi.org/10.1145/3297280.3297319</a>.","apa":"Chatterjee, K., Goharshady, A. K., &#38; Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In <i>Proceedings of the 34th ACM Symposium on Applied Computing</i> (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. <a href=\"https://doi.org/10.1145/3297280.3297319\">https://doi.org/10.1145/3297280.3297319</a>","ieee":"K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, Limassol, Cyprus, 2019, vol. Part F147772, pp. 374–381.","ama":"Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In: <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>. Vol Part F147772. ACM; 2019:374-381. doi:<a href=\"https://doi.org/10.1145/3297280.3297319\">10.1145/3297280.3297319</a>","short":"K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381."},"type":"conference","abstract":[{"text":"In today's cryptocurrencies, Hashcash proof of work is the most commonly-adopted approach to mining. In Hashcash, when a miner decides to add a block to the chain, she has to solve the difficult computational puzzle of inverting a hash function. While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it has attracted significant and harsh criticism due to its massive waste of electricity, its carbon footprint and environmental effects, and the inherent lack of usefulness in inverting a hash function. Various other mining protocols have been suggested, including proof of stake, in which a miner's chance of adding the next block is proportional to her current balance. However, such protocols lead to a higher entry cost for new miners who might not still have any stake in the cryptocurrency, and can in the worst case lead to an oligopoly, where the rich have complete control over mining. In this paper, we propose Hybrid Mining: a new mining protocol that combines solving real-world useful problems with Hashcash. Our protocol allows new miners to join the network by taking part in Hashcash mining without having to own an initial stake. It also allows nodes of the network to submit hard computational problems whose solutions are of interest in the real world, e.g.~protein folding problems. Then, miners can choose to compete in solving these problems, in lieu of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners to solve useful problems, such as hard computational problems arising in biology, in a distributed manner. It also gives researchers in other areas an easy-to-use tool to outsource their hard computations to the blockchain network, which has enormous computational power, by paying a reward to the miner who solves the problem for them. Moreover, our protocol provides strong security guarantees and is at least as resilient to double spending as Bitcoin.","lang":"eng"}],"has_accepted_license":"1","article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:29Z","status":"public","language":[{"iso":"eng"}],"page":"374-381","date_updated":"2026-05-14T22:31:18Z","related_material":{"record":[{"status":"public","id":"8934","relation":"dissertation_contains"}]},"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","first_name":"Amir Kafshdar"},{"full_name":"Pourdamghani, Arash","last_name":"Pourdamghani","first_name":"Arash"}],"title":"Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving","oa_version":"Submitted Version","ddc":["004"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"isi":1,"publication":"Proceedings of the 34th ACM Symposium on Applied Computing","publication_identifier":{"isbn":["9781450359337"]},"year":"2019","ec_funded":1,"date_published":"2019-04-01T00:00:00Z","file":[{"date_updated":"2020-07-14T12:47:29Z","file_id":"6379","checksum":"fbfbcd5a0c7a743862bfc3045539a614","content_type":"application/pdf","relation":"main_file","creator":"dernst","file_size":1023934,"date_created":"2019-05-06T12:09:27Z","file_name":"2019_ACM_Chatterjee.pdf","access_level":"open_access"}],"oa":1,"doi":"10.1145/3297280.3297319","day":"01"},{"publisher":"Association for Computing Machinery","department":[{"_id":"KrCh"}],"citation":{"ama":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. In: <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2019:204-220. doi:<a href=\"https://doi.org/10.1145/3314221.3314581\">10.1145/3314221.3314581</a>","apa":"Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., &#38; Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i> (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3314221.3314581\">https://doi.org/10.1145/3314221.3314581</a>","ieee":"P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Phoenix, AZ, United States, 2019, pp. 204–220.","mla":"Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2019, pp. 204–20, doi:<a href=\"https://doi.org/10.1145/3314221.3314581\">10.1145/3314221.3314581</a>.","chicago":"Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, 204–20. Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3314221.3314581\">https://doi.org/10.1145/3314221.3314581</a>.","ista":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220.","short":"P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–220."},"abstract":[{"lang":"eng","text":"We consider the problem of expected cost analysis over nondeterministic probabilistic programs,\r\nwhich aims at automated methods for analyzing the resource-usage of such programs.\r\nPrevious approaches for this problem could only handle nonnegative bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols,\r\nboth positive and negative costs are necessary and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and efficient approach to obtain polynomial bounds on the\r\nexpected accumulated cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a) general positive and negative costs with bounded updates in\r\nvariables; and (b) nonnegative costs with general updates to variables.\r\nWe show that several natural examples which could not be\r\nhandled by previous approaches are captured in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds."}],"type":"conference","quality_controlled":"1","month":"06","scopus_import":"1","_id":"6175","conference":{"end_date":"2019-06-26","location":"Phoenix, AZ, United States","name":"PLDI: Conference on Programming Language Design and Implementation","start_date":"2019-06-22"},"external_id":{"arxiv":["1902.04659"],"isi":["000523190300014"]},"publication_status":"published","date_created":"2019-03-25T10:13:25Z","project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["000"],"isi":1,"arxiv":1,"publication":"PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","year":"2019","ec_funded":1,"oa":1,"file":[{"date_updated":"2020-07-14T12:47:20Z","file_id":"6176","content_type":"application/pdf","checksum":"703a5e9b8c8587f2a44085ffd9a4db64","relation":"main_file","creator":"akafshda","file_size":4051066,"date_created":"2019-03-25T10:11:22Z","file_name":"paper.pdf","access_level":"open_access"}],"doi":"10.1145/3314221.3314581","day":"08","date_published":"2019-06-08T00:00:00Z","language":[{"iso":"eng"}],"status":"public","has_accepted_license":"1","article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:20Z","title":"Cost analysis of nondeterministic probabilistic programs","author":[{"last_name":"Wang","full_name":"Wang, Peixin","first_name":"Peixin"},{"first_name":"Hongfei","full_name":"Fu, Hongfei","last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Xudong","full_name":"Qin, Xudong","last_name":"Qin"},{"full_name":"Shi, Wenjun","last_name":"Shi","first_name":"Wenjun"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5457"},{"status":"public","relation":"dissertation_contains","id":"8934"}]},"page":"204-220","date_updated":"2026-05-14T22:31:18Z","keyword":["Program Cost Analysis","Program Termination","Probabilistic Programs","Martingales"],"oa_version":"Submitted Version"},{"abstract":[{"lang":"eng","text":"Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, and so on. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in an important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect we consider is that the control flow graphs for most programs have constant treewidth.\r\n\r\nOur main contributions are simple and implementable algorithms that support multiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing but can answer subsequent queries significantly faster as compared to the current algorithmic solutions for interprocedural dataflow analysis. We have also implemented our algorithms and evaluated their performance for performing on-demand interprocedural dataflow analysis on various domains, such as for live variable analysis and reaching definitions, on a standard benchmark set. Our experimental results align with our theoretical statements and show that after a lightweight preprocessing, on-demand queries are answered much faster than the standard existing algorithmic approaches.\r\n"}],"type":"journal_article","citation":{"apa":"Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. <i>ACM Transactions on Programming Languages and Systems</i>. ACM. <a href=\"https://doi.org/10.1145/3363525\">https://doi.org/10.1145/3363525</a>","ieee":"K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4. ACM, 2019.","ama":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. <i>ACM Transactions on Programming Languages and Systems</i>. 2019;41(4). doi:<a href=\"https://doi.org/10.1145/3363525\">10.1145/3363525</a>","ista":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 41(4), 23.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” <i>ACM Transactions on Programming Languages and Systems</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3363525\">https://doi.org/10.1145/3363525</a>.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4, 23, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3363525\">10.1145/3363525</a>.","short":"K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019)."},"quality_controlled":"1","volume":41,"department":[{"_id":"KrCh"}],"publisher":"ACM","publication_status":"published","date_created":"2019-12-09T08:33:33Z","external_id":{"isi":["000564108400004"]},"_id":"7158","month":"11","issue":"4","scopus_import":"1","day":"01","doi":"10.1145/3363525","file":[{"access_level":"open_access","date_created":"2020-10-08T12:58:10Z","file_name":"2019_ACMTransactions_Chatterjee.pdf","success":1,"creator":"dernst","file_size":667357,"checksum":"291cc86a07bd010d4815e177dac57b70","content_type":"application/pdf","relation":"main_file","date_updated":"2020-10-08T12:58:10Z","file_id":"8632"}],"oa":1,"intvolume":"        41","date_published":"2019-11-01T00:00:00Z","article_number":"23","ec_funded":1,"publication_identifier":{"issn":["0164-0925"]},"article_type":"original","year":"2019","publication":"ACM Transactions on Programming Languages and Systems","isi":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"ddc":["000"],"oa_version":"Submitted Version","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Goyal, Prateesh","last_name":"Goyal","first_name":"Prateesh"},{"first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"first_name":"Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"}],"title":"Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth","related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"date_updated":"2026-05-14T22:31:18Z","status":"public","language":[{"iso":"eng"}],"file_date_updated":"2020-10-08T12:58:10Z","article_processing_charge":"No","has_accepted_license":"1"},{"_id":"7014","scopus_import":"1","issue":"4","month":"10","date_created":"2019-11-13T08:33:43Z","publication_status":"published","external_id":{"arxiv":["1705.00317"],"isi":["000564108400001"]},"department":[{"_id":"KrCh"}],"volume":41,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.00317"}],"publisher":"ACM","quality_controlled":"1","citation":{"short":"K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages and Systems 41 (2019).","ista":"Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 41(4), 20.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” <i>ACM Transactions on Programming Languages and Systems</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3339984\">https://doi.org/10.1145/3339984</a>.","mla":"Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4, 20, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3339984\">10.1145/3339984</a>.","ama":"Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive programs. <i>ACM Transactions on Programming Languages and Systems</i>. 2019;41(4). doi:<a href=\"https://doi.org/10.1145/3339984\">10.1145/3339984</a>","ieee":"K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4. ACM, 2019.","apa":"Chatterjee, K., Fu, H., &#38; Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. <i>ACM Transactions on Programming Languages and Systems</i>. ACM. <a href=\"https://doi.org/10.1145/3339984\">https://doi.org/10.1145/3339984</a>"},"type":"journal_article","abstract":[{"text":"We study the problem of developing efficient approaches for proving\r\nworst-case bounds of non-deterministic recursive programs. Ranking functions\r\nare sound and complete for proving termination and worst-case bounds of\r\nnonrecursive programs. First, we apply ranking functions to recursion,\r\nresulting in measure functions. We show that measure functions provide a sound\r\nand complete approach to prove worst-case bounds of non-deterministic recursive\r\nprograms. Our second contribution is the synthesis of measure functions in\r\nnonpolynomial forms. We show that non-polynomial measure functions with\r\nlogarithm and exponentiation can be synthesized through abstraction of\r\nlogarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem\r\nusing linear programming. While previous methods obtain worst-case polynomial\r\nbounds, our approach can synthesize bounds of the form $\\mathcal{O}(n\\log n)$\r\nas well as $\\mathcal{O}(n^r)$ where $r$ is not an integer. We present\r\nexperimental results to demonstrate that our approach can obtain efficiently\r\nworst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the\r\ndivide-and-conquer algorithm for the Closest-Pair problem, where we obtain\r\n$\\mathcal{O}(n \\log n)$ worst-case bound, and (ii) Karatsuba's algorithm for\r\npolynomial multiplication and Strassen's algorithm for matrix multiplication,\r\nwhere we obtain $\\mathcal{O}(n^r)$ bound such that $r$ is not an integer and\r\nclose to the best-known bounds for the respective algorithms.","lang":"eng"}],"date_updated":"2026-05-14T22:31:19Z","related_material":{"record":[{"status":"public","id":"639","relation":"earlier_version"},{"relation":"dissertation_contains","id":"8934","status":"public"}]},"title":"Non-polynomial worst-case analysis of recursive programs","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Hongfei","full_name":"Fu, Hongfei","last_name":"Fu"},{"last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar"}],"article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"oa_version":"Preprint","isi":1,"publication":"ACM Transactions on Programming Languages and Systems","arxiv":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"date_published":"2019-10-01T00:00:00Z","intvolume":"        41","oa":1,"day":"01","doi":"10.1145/3339984","article_type":"original","year":"2019","ec_funded":1,"article_number":"20"},{"file":[{"file_name":"2019_ACM_POPL_Chatterjee.pdf","date_created":"2019-05-06T12:23:11Z","creator":"dernst","file_size":1294962,"access_level":"open_access","date_updated":"2020-07-14T12:47:29Z","file_id":"6381","content_type":"application/pdf","checksum":"c157752f96877b36685ad7063ada4524","relation":"main_file"}],"oa":1,"day":"01","doi":"10.1145/3290366","date_published":"2019-01-01T00:00:00Z","intvolume":"         3","article_number":"53","year":"2019","article_type":"original","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), ERC\r\nStarting Grant (279307: Graph Games), and the IBM PhD Fellowship program.","publication_identifier":{"issn":["2475-1421"]},"ec_funded":1,"publication":"Proceedings of the ACM on Programming Languages","project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"OA_place":"publisher","oa_version":"Published Version","title":"Efficient parameterized algorithms for data packing","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nastaran","full_name":"Okati, Nastaran","last_name":"Okati"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"}]},"date_updated":"2026-05-14T22:31:19Z","status":"public","language":[{"iso":"eng"}],"has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","file_date_updated":"2020-07-14T12:47:29Z","citation":{"short":"K. Chatterjee, A.K. Goharshady, N. Okati, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 3 (2019).","ista":"Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.” <i>Proceedings of the ACM on Programming Languages</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3290366\">https://doi.org/10.1145/3290366</a>.","mla":"Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data Packing.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 3, no. POPL, 53, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3290366\">10.1145/3290366</a>.","ieee":"K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 3, no. POPL. ACM, 2019.","apa":"Chatterjee, K., Goharshady, A. K., Okati, N., &#38; Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. <i>Proceedings of the ACM on Programming Languages</i>. ACM. <a href=\"https://doi.org/10.1145/3290366\">https://doi.org/10.1145/3290366</a>","ama":"Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. Efficient parameterized algorithms for data packing. <i>Proceedings of the ACM on Programming Languages</i>. 2019;3(POPL). doi:<a href=\"https://doi.org/10.1145/3290366\">10.1145/3290366</a>"},"type":"journal_article","abstract":[{"text":"There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in programs. The predominant technique to address this issue has been Data Packing: data elements that are frequently accessed within time proximity are packed into the same cache block, thereby minimizing accesses to the main memory. We consider the algorithmic problem of Data Packing on a two-level memory system. Given a reference sequence R of accesses to data elements, the task is to partition the elements into cache blocks such that the number of cache misses on R is minimized. The problem is notoriously difficult: it is NP-hard even when the cache has size 1, and is hard to approximate for any cache size larger than 4. Therefore, all existing techniques for Data Packing are based on heuristics and lack theoretical guarantees. In this work, we present the first positive theoretical results for Data Packing, along with new and stronger negative results. We consider the problem under the lens of the underlying access hypergraphs, which are hypergraphs of affinities between the data elements, where the order of an access hypergraph corresponds to the size of the affinity group. We study the problem parameterized by the treewidth of access hypergraphs, which is a standard notion in graph theory to measure the closeness of a graph to a tree. Our main results are as follows: We show there is a number q* depending on the cache parameters such that (a) if the access hypergraph of order q* has constant treewidth, then there is a linear-time algorithm for Data Packing; (b)the Data Packing problem remains NP-hard even if the access hypergraph of order q*-1 has constant treewidth. Thus, we establish a fine-grained dichotomy depending on a single parameter, namely, the highest order among access hypegraphs that have constant treewidth; and establish the optimal value q* of this parameter. Finally, we present an experimental evaluation of a prototype implementation of our algorithm. Our results demonstrate that, in practice, access hypergraphs of many commonly-used algorithms have small treewidth. We compare our approach with several state-of-the-art heuristic-based algorithms and show that our algorithm leads to significantly fewer cache-misses. ","lang":"eng"}],"quality_controlled":"1","volume":3,"department":[{"_id":"KrCh"}],"OA_type":"hybrid","publisher":"ACM","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"published","date_created":"2019-05-06T12:18:17Z","pubrep_id":"1056","_id":"6380","month":"01","issue":"POPL","scopus_import":"1"},{"author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar"},{"last_name":"Pourdamghani","full_name":"Pourdamghani, Arash","first_name":"Arash"}],"title":"Probabilistic smart contracts: Secure randomness on the blockchain","related_material":{"record":[{"status":"public","id":"8934","relation":"dissertation_contains"}]},"date_updated":"2026-05-14T22:31:19Z","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","oa_version":"Preprint","isi":1,"publication":"IEEE International Conference on Blockchain and Cryptocurrency","arxiv":1,"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"day":"01","doi":"10.1109/BLOC.2019.8751326","date_published":"2019-05-01T00:00:00Z","article_number":"8751326","year":"2019","ec_funded":1,"_id":"6056","month":"05","scopus_import":"1","publication_status":"published","date_created":"2019-02-26T09:03:15Z","conference":{"name":"IEEE International Conference on Blockchain and Cryptocurrency","location":"Seoul, Korea","start_date":"2019-05-14","end_date":"2019-05-17"},"external_id":{"arxiv":["1902.07986"],"isi":["000491257000076"]},"department":[{"_id":"KrCh"}],"publisher":"IEEE","main_file_link":[{"url":"https://arxiv.org/abs/1902.07986","open_access":"1"}],"citation":{"short":"K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, IEEE International Conference on Blockchain and Cryptocurrency, IEEE, 2019.","mla":"Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” <i>IEEE International Conference on Blockchain and Cryptocurrency</i>, 8751326, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/BLOC.2019.8751326\">10.1109/BLOC.2019.8751326</a>.","ista":"Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency, 8751326.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In <i>IEEE International Conference on Blockchain and Cryptocurrency</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/BLOC.2019.8751326\">https://doi.org/10.1109/BLOC.2019.8751326</a>.","ieee":"K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in <i>IEEE International Conference on Blockchain and Cryptocurrency</i>, Seoul, Korea, 2019.","apa":"Chatterjee, K., Goharshady, A. K., &#38; Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In <i>IEEE International Conference on Blockchain and Cryptocurrency</i>. Seoul, Korea: IEEE. <a href=\"https://doi.org/10.1109/BLOC.2019.8751326\">https://doi.org/10.1109/BLOC.2019.8751326</a>","ama":"Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts: Secure randomness on the blockchain. In: <i>IEEE International Conference on Blockchain and Cryptocurrency</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/BLOC.2019.8751326\">10.1109/BLOC.2019.8751326</a>"},"type":"conference","abstract":[{"text":"In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a wide variety of real-world financial contracts, such as casino games and lotteries, depend entirely on randomness. As a result, several ad-hoc random number generation approaches have been developed to be used in smart contracts. These include ideas such as using an oracle or relying on the block hash. However, these approaches are manipulatable, i.e. their output can be tampered with by parties who might not be neutral, such as the owner of the oracle or the miners.We propose a novel game-theoretic approach for generating provably unmanipulatable pseudorandom numbers on the blockchain. Our approach allows smart contracts to access a trustworthy source of randomness that does not rely on potentially compromised miners or oracles, hence enabling the creation of a new generation of smart contracts that are not limited to being non-probabilistic and can be drawn from the much more general class of probabilistic programs.","lang":"eng"}],"quality_controlled":"1"},{"oa_version":"Published Version","status":"public","language":[{"iso":"eng"}],"has_accepted_license":"1","article_processing_charge":"Yes","file_date_updated":"2020-07-14T12:47:34Z","title":"Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling","author":[{"first_name":"Maciek","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","last_name":"Adamowski","full_name":"Adamowski, Maciek","orcid":"0000-0001-6463-5257"},{"first_name":"Lanxin","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","full_name":"Li, Lanxin","last_name":"Li","orcid":"0000-0002-5607-272X"},{"first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"10083"}]},"date_updated":"2026-05-14T22:31:21Z","article_number":"3337","publication_identifier":{"eissn":["1422-0067"]},"article_type":"original","year":"2019","ec_funded":1,"file":[{"date_created":"2019-07-17T06:17:15Z","file_name":"2019_JournalMolecularScience_Adamowski.pdf","creator":"dernst","file_size":3330291,"access_level":"open_access","date_updated":"2020-07-14T12:47:34Z","file_id":"6645","content_type":"application/pdf","checksum":"dd9d1cbb933a72ceb666c9667890ac51","relation":"main_file"}],"oa":1,"doi":"10.3390/ijms20133337","day":"07","date_published":"2019-07-07T00:00:00Z","intvolume":"        20","project":[{"name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","call_identifier":"FP7"},{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["580"],"isi":1,"publication":"International Journal of Molecular Sciences","external_id":{"isi":["000477041100221"],"pmid":["31284661"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"published","date_created":"2019-07-11T12:00:32Z","month":"07","scopus_import":"1","issue":"13","_id":"6627","citation":{"ama":"Adamowski M, Li L, Friml J. Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. <i>International Journal of Molecular Sciences</i>. 2019;20(13). doi:<a href=\"https://doi.org/10.3390/ijms20133337\">10.3390/ijms20133337</a>","apa":"Adamowski, M., Li, L., &#38; Friml, J. (2019). Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. <i>International Journal of Molecular Sciences</i>. MDPI. <a href=\"https://doi.org/10.3390/ijms20133337\">https://doi.org/10.3390/ijms20133337</a>","ieee":"M. Adamowski, L. Li, and J. Friml, “Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling,” <i>International Journal of Molecular Sciences</i>, vol. 20, no. 13. MDPI, 2019.","mla":"Adamowski, Maciek, et al. “Reorientation of Cortical Microtubule Arrays in the Hypocotyl of Arabidopsis Thaliana Is Induced by the Cell Growth Process and Independent of Auxin Signaling.” <i>International Journal of Molecular Sciences</i>, vol. 20, no. 13, 3337, MDPI, 2019, doi:<a href=\"https://doi.org/10.3390/ijms20133337\">10.3390/ijms20133337</a>.","chicago":"Adamowski, Maciek, Lanxin Li, and Jiří Friml. “Reorientation of Cortical Microtubule Arrays in the Hypocotyl of Arabidopsis Thaliana Is Induced by the Cell Growth Process and Independent of Auxin Signaling.” <i>International Journal of Molecular Sciences</i>. MDPI, 2019. <a href=\"https://doi.org/10.3390/ijms20133337\">https://doi.org/10.3390/ijms20133337</a>.","ista":"Adamowski M, Li L, Friml J. 2019. Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. International Journal of Molecular Sciences. 20(13), 3337.","short":"M. Adamowski, L. Li, J. Friml, International Journal of Molecular Sciences 20 (2019)."},"pmid":1,"abstract":[{"text":"Cortical microtubule arrays in elongating epidermal cells in both the root and stem of plants have the propensity of dynamic reorientations that are correlated with the activation or inhibition of growth. Factors regulating plant growth, among them the hormone auxin, have been recognized as regulators of microtubule array orientations. Some previous work in the field has aimed at elucidating the causal relationship between cell growth, the signaling of auxin or other growth-regulating factors, and microtubule array reorientations, with various conclusions. Here, we revisit this problem of causality with a comprehensive set of experiments in Arabidopsis thaliana, using the now available pharmacological and genetic tools. We use isolated, auxin-depleted hypocotyls, an experimental system allowing for full control of both growth and auxin signaling. We demonstrate that reorientation of microtubules is not directly triggered by an auxin signal during growth activation. Instead, reorientation is triggered by the activation of the growth process itself and is auxin-independent in its nature. We discuss these findings in the context of previous relevant work, including that on the mechanical regulation of microtubule array orientation.","lang":"eng"}],"type":"journal_article","quality_controlled":"1","publisher":"MDPI","corr_author":"1","volume":20,"department":[{"_id":"JiFr"}]},{"volume":570,"department":[{"_id":"JoFi"}],"publisher":"Nature Publishing Group","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.05865"}],"type":"journal_article","abstract":[{"text":"Mechanical systems facilitate the development of a hybrid quantum technology comprising electrical, optical, atomic and acoustic degrees of freedom1, and entanglement is essential to realize quantum-enabled devices. Continuous-variable entangled fields—known as Einstein–Podolsky–Rosen (EPR) states—are spatially separated two-mode squeezed states that can be used for quantum teleportation and quantum communication2. In the optical domain, EPR states are typically generated using nondegenerate optical amplifiers3, and at microwave frequencies Josephson circuits can serve as a nonlinear medium4,5,6. An outstanding goal is to deterministically generate and distribute entangled states with a mechanical oscillator, which requires a carefully arranged balance between excitation, cooling and dissipation in an ultralow noise environment. Here we observe stationary emission of path-entangled microwave radiation from a parametrically driven 30-micrometre-long silicon nanostring oscillator, squeezing the joint field operators of two thermal modes by 3.40 decibels below the vacuum level. The motion of this micromechanical system correlates up to 50 photons per second per hertz, giving rise to a quantum discord that is robust with respect to microwave noise7. Such generalized quantum correlations of separable states are important for quantum-enhanced detection8 and provide direct evidence of the non-classical nature of the mechanical oscillator without directly measuring its state9. This noninvasive measurement scheme allows to infer information about otherwise inaccessible objects, with potential implications for sensing, open-system dynamics and fundamental tests of quantum gravity. In the future, similar on-chip devices could be used to entangle subsystems on very different energy scales, such as microwave and optical photons.","lang":"eng"}],"citation":{"ama":"Barzanjeh S, Redchenko E, Peruzzo M, et al. Stationary entangled radiation from micromechanical motion. <i>Nature</i>. 2019;570:480-483. doi:<a href=\"https://doi.org/10.1038/s41586-019-1320-2\">10.1038/s41586-019-1320-2</a>","ieee":"S. Barzanjeh <i>et al.</i>, “Stationary entangled radiation from micromechanical motion,” <i>Nature</i>, vol. 570. Nature Publishing Group, pp. 480–483, 2019.","apa":"Barzanjeh, S., Redchenko, E., Peruzzo, M., Wulf, M., Lewis, D., Arnold, G. M., &#38; Fink, J. M. (2019). Stationary entangled radiation from micromechanical motion. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41586-019-1320-2\">https://doi.org/10.1038/s41586-019-1320-2</a>","ista":"Barzanjeh S, Redchenko E, Peruzzo M, Wulf M, Lewis D, Arnold GM, Fink JM. 2019. Stationary entangled radiation from micromechanical motion. Nature. 570, 480–483.","chicago":"Barzanjeh, Shabir, Elena Redchenko, Matilda Peruzzo, Matthias Wulf, Dylan Lewis, Georg M Arnold, and Johannes M Fink. “Stationary Entangled Radiation from Micromechanical Motion.” <i>Nature</i>. Nature Publishing Group, 2019. <a href=\"https://doi.org/10.1038/s41586-019-1320-2\">https://doi.org/10.1038/s41586-019-1320-2</a>.","mla":"Barzanjeh, Shabir, et al. “Stationary Entangled Radiation from Micromechanical Motion.” <i>Nature</i>, vol. 570, Nature Publishing Group, 2019, pp. 480–83, doi:<a href=\"https://doi.org/10.1038/s41586-019-1320-2\">10.1038/s41586-019-1320-2</a>.","short":"S. Barzanjeh, E. Redchenko, M. Peruzzo, M. Wulf, D. Lewis, G.M. Arnold, J.M. Fink, Nature 570 (2019) 480–483."},"quality_controlled":"1","_id":"6609","month":"06","scopus_import":"1","publication_status":"published","date_created":"2019-07-07T21:59:20Z","external_id":{"arxiv":["1809.05865"],"isi":["000472860000042"]},"publication":"Nature","arxiv":1,"isi":1,"project":[{"call_identifier":"H2020","grant_number":"732894","_id":"257EB838-B435-11E9-9278-68D0E5697425","name":"Hybrid Optomechanical Technologies"},{"call_identifier":"H2020","name":"A Fiber Optic Transceiver for Superconducting Qubits","_id":"26336814-B435-11E9-9278-68D0E5697425","grant_number":"758053"},{"_id":"258047B6-B435-11E9-9278-68D0E5697425","name":"Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination with cavity Optomechanics","grant_number":"707438","call_identifier":"H2020"},{"name":"Coherent on-chip conversion of superconducting qubit signals from microwaves to optical frequencies","_id":"2671EB66-B435-11E9-9278-68D0E5697425"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","doi":"10.1038/s41586-019-1320-2","day":"27","oa":1,"intvolume":"       570","date_published":"2019-06-27T00:00:00Z","acknowledged_ssus":[{"_id":"NanoFab"}],"ec_funded":1,"year":"2019","title":"Stationary entangled radiation from micromechanical motion","author":[{"first_name":"Shabir","id":"2D25E1F6-F248-11E8-B48F-1D18A9856A87","full_name":"Barzanjeh, Shabir","last_name":"Barzanjeh","orcid":"0000-0003-0415-1423"},{"id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","full_name":"Redchenko, Elena","last_name":"Redchenko","first_name":"Elena"},{"id":"3F920B30-F248-11E8-B48F-1D18A9856A87","last_name":"Peruzzo","full_name":"Peruzzo, Matilda","orcid":"0000-0002-3415-4628","first_name":"Matilda"},{"id":"45598606-F248-11E8-B48F-1D18A9856A87","full_name":"Wulf, Matthias","last_name":"Wulf","orcid":"0000-0001-6613-1378","first_name":"Matthias"},{"first_name":"Dylan","last_name":"Lewis","full_name":"Lewis, Dylan"},{"first_name":"Georg M","orcid":"0000-0003-1397-7876","last_name":"Arnold","full_name":"Arnold, Georg M","id":"3770C838-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fink, Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","first_name":"Johannes M"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"18871"}]},"page":"480-483","date_updated":"2026-05-14T22:31:25Z","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","oa_version":"Preprint"},{"acknowledgement":"JM acknowledges the award of a Huygens PhD fellowship from Leiden University. MG acknowledges support from NASA grant NNX17AK58G. APA, PhD::SPACE fellow, acknowledges support from the FCT through the fellowship PD/BD/52706/2014. Based on observations made with ESO Telescopes at the La Silla Paranal Observatory under programme IDs 294.A-5018, 098.A-0819, 099.A-0254 and 0100.A-0213. We are grateful for the excellent data-sets from the COSMOS and UltraVISTA survey teams. This research was supported by the Munich Institute for Astro- and Particle Physics (MIAPP) of the DFG cluster of excellence “Origin and Structure of the Universe”. We thank the referee for their comments that improved the paper. We also thank Christoph Behrens, Len Cowie, Koki Kakiichi, Peter Laursen, Charlotte Mason, Eros Vanzella, Lewis Weinberger and Johannes Zabl for discussions. We have benefited from the public available programming language Python, including the numpy, matplotlib, scipy and astropy packages (Hunter 2007; Astropy Collaboration 2013), the astronomical imaging tools Swarp (Bertin 2010) and ds9 and the Topcat analysis tool (Taylor 2013).","publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"year":"2018","article_type":"original","article_number":"A136","date_published":"2018-11-19T00:00:00Z","intvolume":"       619","oa":1,"doi":"10.1051/0004-6361/201833528","day":"19","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication":"Astronomy & Astrophysics","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: high-redshift / galaxies: formation / dark ages / reionization / first stars / techniques: spectroscopic / intergalactic medium"],"oa_version":"Published Version","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","date_updated":"2024-10-14T11:31:36Z","title":"Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe","author":[{"orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J"},{"last_name":"Sobral","full_name":"Sobral, David","first_name":"David"},{"first_name":"Max","full_name":"Gronke, Max","last_name":"Gronke"},{"first_name":"Ana","last_name":"Paulino-Afonso","full_name":"Paulino-Afonso, Ana"},{"last_name":"Stefanon","full_name":"Stefanon, Mauro","first_name":"Mauro"},{"first_name":"Huub","full_name":"Röttgering, Huub","last_name":"Röttgering"}],"quality_controlled":"1","citation":{"mla":"Matthee, Jorryt J., et al. “Confirmation of Double Peaked Lyα Emission at z = 6.593: Witnessing a Galaxy Directly Contributing to the Reionisation of the Universe.” <i>Astronomy &#38; Astrophysics</i>, vol. 619, A136, EDP Sciences, 2018, doi:<a href=\"https://doi.org/10.1051/0004-6361/201833528\">10.1051/0004-6361/201833528</a>.","chicago":"Matthee, Jorryt J, David Sobral, Max Gronke, Ana Paulino-Afonso, Mauro Stefanon, and Huub Röttgering. “Confirmation of Double Peaked Lyα Emission at z = 6.593: Witnessing a Galaxy Directly Contributing to the Reionisation of the Universe.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2018. <a href=\"https://doi.org/10.1051/0004-6361/201833528\">https://doi.org/10.1051/0004-6361/201833528</a>.","ista":"Matthee JJ, Sobral D, Gronke M, Paulino-Afonso A, Stefanon M, Röttgering H. 2018. Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe. Astronomy &#38; Astrophysics. 619, A136.","ama":"Matthee JJ, Sobral D, Gronke M, Paulino-Afonso A, Stefanon M, Röttgering H. Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe. <i>Astronomy &#38; Astrophysics</i>. 2018;619. doi:<a href=\"https://doi.org/10.1051/0004-6361/201833528\">10.1051/0004-6361/201833528</a>","ieee":"J. J. Matthee, D. Sobral, M. Gronke, A. Paulino-Afonso, M. Stefanon, and H. Röttgering, “Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe,” <i>Astronomy &#38; Astrophysics</i>, vol. 619. EDP Sciences, 2018.","apa":"Matthee, J. J., Sobral, D., Gronke, M., Paulino-Afonso, A., Stefanon, M., &#38; Röttgering, H. (2018). Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/201833528\">https://doi.org/10.1051/0004-6361/201833528</a>","short":"J.J. Matthee, D. Sobral, M. Gronke, A. Paulino-Afonso, M. Stefanon, H. Röttgering, Astronomy &#38; Astrophysics 619 (2018)."},"abstract":[{"lang":"eng","text":"Distant luminous Lyman-α emitters (LAEs) are excellent targets for spectroscopic observations of galaxies in the epoch of reionisation (EoR). We present deep high-resolution (R = 5000) VLT/X-shooter observations, along with an extensive collection of photometric data of COLA1, a proposed double peaked LAE at z = 6.6. We rule out the possibility that COLA1’s emission line is an [OII] doublet at z = 1.475 on the basis of i) the asymmetric red line-profile and flux ratio of the peaks (blue/red=0.31 ± 0.03) and ii) an unphysical [OII]/Hα ratio ([OII]/Hα >  22). We show that COLA1’s observed B-band flux is explained by a faint extended foreground LAE, for which we detect Lyα and [OIII] at z = 2.142. We thus conclude that COLA1 is a real double-peaked LAE at z = 6.593, the first discovered at z >  6. COLA1 is UV luminous (M1500 = −21.6 ± 0.3), has a high equivalent width (EW0,Lyα = 120−40+50 Å) and very compact Lyα emission (r50,Lyα = 0.33−0.04+0.07 kpc). Relatively weak inferred Hβ+[OIII] line-emission from Spitzer/IRAC indicates an extremely low metallicity of Z <  1/20 Z⊙ or reduced strength of nebular lines due to high escape of ionising photons. The small Lyα peak separation of 220 ± 20 km s−1 implies a low HI column density and an ionising photon escape fraction of ≈15 − 30%, providing the first direct evidence that such galaxies contribute actively to the reionisation of the Universe at z >  6. Based on simple estimates, we find that COLA1 could have provided just enough photons to reionise its own ≈0.3 pMpc (2.3 cMpc) bubble, allowing the blue Lyα line to be observed. However, we also discuss alternative scenarios explaining the detected double peaked nature of COLA1. Our results show that future high-resolution observations of statistical samples of double peaked LAEs at z >  5 are a promising probe of the occurrence of ionised regions around galaxies in the EoR."}],"type":"journal_article","extern":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1805.11621"}],"publisher":"EDP Sciences","volume":619,"external_id":{"arxiv":["1805.11621"]},"date_created":"2022-07-06T11:14:23Z","publication_status":"published","scopus_import":"1","month":"11","_id":"11508"},{"type":"journal_article","abstract":[{"lang":"eng","text":"We investigate the clustering properties of ∼7000 H β + [O III] and [O II] narrowband-selected emitters at z ∼ 0.8–4.7 from the High-z Emission Line Survey. We find clustering lengths, r0, of 1.5–4.0 h−1 Mpc and minimum dark matter halo masses of 1010.7–12.1 M⊙ for our z = 0.8–3.2 H β + [O III] emitters and r0 ∼ 2.0–8.3 h−1 Mpc and halo masses of 1011.5–12.6 M⊙ for our z = 1.5–4.7 [O II] emitters. We find r0 to strongly increase both with increasing line luminosity and redshift. By taking into account the evolution of the characteristic line luminosity, L⋆(z), and using our model predictions of halo mass given r0, we find a strong, redshift-independent increasing trend between L/L⋆(z) and minimum halo mass. The faintest H β + [O III] emitters are found to reside in 109.5 M⊙ haloes and the brightest emitters in 1013.0 M⊙ haloes. For [O II] emitters, the faintest emitters are found in 1010.5 M⊙ haloes and the brightest emitters in 1012.6 M⊙ haloes. A redshift-independent stellar mass dependency is also observed where the halo mass increases from 1011 to 1012.5 M⊙ for stellar masses of 108.5 to 1011.5 M⊙, respectively. We investigate the interdependencies of these trends by repeating our analysis in a Lline−Mstar grid space for our most populated samples (H β + [O III] z = 0.84 and [O II] z = 1.47) and find that the line luminosity dependency is stronger than the stellar mass dependency on halo mass. For L > L⋆ emitters at all epochs, we find a relatively flat trend with halo masses of 1012.5–13 M⊙, which may be due to quenching mechanisms in massive haloes that is consistent with a transitional halo mass predicted by models."}],"extern":"1","citation":{"apa":"Khostovan, A. A., Sobral, D., Mobasher, B., Best, P. N., Smail, I., Matthee, J. J., … Stott, J. P. (2018). The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar mass. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/sty925\">https://doi.org/10.1093/mnras/sty925</a>","ama":"Khostovan AA, Sobral D, Mobasher B, et al. The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar mass. <i>Monthly Notices of the Royal Astronomical Society</i>. 2018;478(3):2999-3015. doi:<a href=\"https://doi.org/10.1093/mnras/sty925\">10.1093/mnras/sty925</a>","ieee":"A. A. Khostovan <i>et al.</i>, “The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar mass,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 478, no. 3. Oxford University Press, pp. 2999–3015, 2018.","mla":"Khostovan, A. A., et al. “The Clustering of H β + [O III] and [O II] Emitters since z ∼ 5: Dependencies with Line Luminosity and Stellar Mass.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 478, no. 3, Oxford University Press, 2018, pp. 2999–3015, doi:<a href=\"https://doi.org/10.1093/mnras/sty925\">10.1093/mnras/sty925</a>.","chicago":"Khostovan, A A, D Sobral, B Mobasher, P N Best, I Smail, Jorryt J Matthee, B Darvish, H Nayyeri, S Hemmati, and J P Stott. “The Clustering of H β + [O III] and [O II] Emitters since z ∼ 5: Dependencies with Line Luminosity and Stellar Mass.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/mnras/sty925\">https://doi.org/10.1093/mnras/sty925</a>.","ista":"Khostovan AA, Sobral D, Mobasher B, Best PN, Smail I, Matthee JJ, Darvish B, Nayyeri H, Hemmati S, Stott JP. 2018. The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar mass. Monthly Notices of the Royal Astronomical Society. 478(3), 2999–3015.","short":"A.A. Khostovan, D. Sobral, B. Mobasher, P.N. Best, I. Smail, J.J. Matthee, B. Darvish, H. Nayyeri, S. Hemmati, J.P. Stott, Monthly Notices of the Royal Astronomical Society 478 (2018) 2999–3015."},"quality_controlled":"1","volume":478,"publisher":"Oxford University Press","main_file_link":[{"url":"https://arxiv.org/abs/1705.01101"}],"publication_status":"published","date_created":"2022-07-08T11:48:48Z","external_id":{"arxiv":["1705.01101"]},"_id":"11549","month":"08","issue":"3","scopus_import":"1","day":"01","doi":"10.1093/mnras/sty925","intvolume":"       478","date_published":"2018-08-01T00:00:00Z","acknowledgement":"We thank the anonymous referee for their useful comments and suggestions that improved this study. AAK thanks Anahita Alavi and Irene Shivaei for useful discussion in the making of this paper. AAK acknowledges that this work was supported by NASA Headquarters under the NASA Earth and Space Science Fellowship Program – Grant NNX16AO92H. DS acknowledges financial support from the Netherlands Organization for Scientific Research (NWO) through a Veni fellowship and from Lancaster University through an Early Career Internal Grant A100679. PNB is grateful for support from STFC via grant STM001229/1. IRS acknowledges support from STFC (ST/L00075X/1), the ERC Advanced Grant DUSTYGAL (321334), and a Royal Society/Wolfson Merit award. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. BD acknowledges financial support from NASA through the Astrophysics Data Analysis Program (ADAP), grant number NNX12AE20G.","article_type":"original","year":"2018","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"publication":"Monthly Notices of the Royal Astronomical Society","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: haloes","galaxies: high-redshift","galaxies: star formation","cosmology: observations","large-scale structure of Universe"],"author":[{"first_name":"A A","last_name":"Khostovan","full_name":"Khostovan, A A"},{"full_name":"Sobral, D","last_name":"Sobral","first_name":"D"},{"first_name":"B","full_name":"Mobasher, B","last_name":"Mobasher"},{"first_name":"P N","last_name":"Best","full_name":"Best, P N"},{"first_name":"I","last_name":"Smail","full_name":"Smail, I"},{"first_name":"Jorryt J","last_name":"Matthee","full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X"},{"first_name":"B","last_name":"Darvish","full_name":"Darvish, B"},{"last_name":"Nayyeri","full_name":"Nayyeri, H","first_name":"H"},{"first_name":"S","full_name":"Hemmati, S","last_name":"Hemmati"},{"first_name":"J P","last_name":"Stott","full_name":"Stott, J P"}],"title":"The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar mass","page":"2999-3015","date_updated":"2022-08-19T06:53:39Z","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No"},{"oa_version":"Preprint","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","galaxies: ISM","galaxies: formation"],"author":[{"first_name":"S","last_name":"Carniani","full_name":"Carniani, S"},{"last_name":"Maiolino","full_name":"Maiolino, R","first_name":"R"},{"first_name":"R","full_name":"Amorin, R","last_name":"Amorin"},{"full_name":"Pentericci, L","last_name":"Pentericci","first_name":"L"},{"first_name":"A","full_name":"Pallottini, A","last_name":"Pallottini"},{"first_name":"A","last_name":"Ferrara","full_name":"Ferrara, A"},{"full_name":"Willott, C J","last_name":"Willott","first_name":"C J"},{"last_name":"Smit","full_name":"Smit, R","first_name":"R"},{"id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J","last_name":"Matthee","orcid":"0000-0003-2871-127X","first_name":"Jorryt J"},{"last_name":"Sobral","full_name":"Sobral, D","first_name":"D"},{"full_name":"Santini, P","last_name":"Santini","first_name":"P"},{"first_name":"M","full_name":"Castellano, M","last_name":"Castellano"},{"first_name":"S","full_name":"De Barros, S","last_name":"De Barros"},{"first_name":"A","full_name":"Fontana, A","last_name":"Fontana"},{"first_name":"A","last_name":"Grazian","full_name":"Grazian, A"},{"full_name":"Guaita, L","last_name":"Guaita","first_name":"L"}],"title":"Kiloparsec-scale gaseous clumps and star formation at z = 5–7","page":"1170-1184","date_updated":"2022-08-19T06:58:06Z","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","oa":1,"doi":"10.1093/mnras/sty1088","day":"01","date_published":"2018-07-01T00:00:00Z","intvolume":"       478","acknowledgement":"This paper makes use of the following ALMA data:\r\nADS/JAO.ALMA#2012.1.00719.S, ADS/JAO.ALMA#2012.A.00040.S,\r\nADS/JAO.ALMA#2013.A.00433.S, ADS/JAO.ALMA#2011.0.00115.S,\r\nADS/JAO.ALMA#2012.1.00033.S, ADS/JAO.ALMA#2012.1.00523.S,\r\nADS/JAO.ALMA#2013.1.00815.S, ADS/JAO.ALMA#2015.1.00834.S.,\r\nADS/JAO.ALMA#2015.1.01105.S, AND ADS/JAO.ALMA#2016.1.01240.S\r\nwhich can be retrieved from the ALMA data archive:\r\nhttps://almascience.eso.org/ alma-data/archive. ALMA is a partnership of ESO (representing its member states), NSF (USA) and NINS (Japan), together with NRC (Canada) and NSC and ASIAA (Taiwan), in cooperation with the Republic of Chile. The Joint ALMA Observatory is operated by ESO, AUI/NRAO, and NAOJ. We are grateful to G. Jones to for providing his [C II] flux maps. RM and SC acknowledge support by the Science and Technology Facilities Council (STFC). RM acknowledges ERC Advanced Grant 695671 ‘QUENCH’. AF acknowledges support from the ERC Advanced Grant INTERSTELLAR H2020/740120.","year":"2018","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"article_type":"original","arxiv":1,"publication":"Monthly Notices of the Royal Astronomical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_created":"2022-07-11T08:05:42Z","external_id":{"arxiv":["1712.03985"]},"_id":"11555","month":"07","scopus_import":"1","issue":"1","citation":{"short":"S. Carniani, R. Maiolino, R. Amorin, L. Pentericci, A. Pallottini, A. Ferrara, C.J. Willott, R. Smit, J.J. Matthee, D. Sobral, P. Santini, M. Castellano, S. De Barros, A. Fontana, A. Grazian, L. Guaita, Monthly Notices of the Royal Astronomical Society 478 (2018) 1170–1184.","mla":"Carniani, S., et al. “Kiloparsec-Scale Gaseous Clumps and Star Formation at z = 5–7.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 478, no. 1, Oxford University Press, 2018, pp. 1170–84, doi:<a href=\"https://doi.org/10.1093/mnras/sty1088\">10.1093/mnras/sty1088</a>.","chicago":"Carniani, S, R Maiolino, R Amorin, L Pentericci, A Pallottini, A Ferrara, C J Willott, et al. “Kiloparsec-Scale Gaseous Clumps and Star Formation at z = 5–7.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/mnras/sty1088\">https://doi.org/10.1093/mnras/sty1088</a>.","ista":"Carniani S, Maiolino R, Amorin R, Pentericci L, Pallottini A, Ferrara A, Willott CJ, Smit R, Matthee JJ, Sobral D, Santini P, Castellano M, De Barros S, Fontana A, Grazian A, Guaita L. 2018. Kiloparsec-scale gaseous clumps and star formation at z = 5–7. Monthly Notices of the Royal Astronomical Society. 478(1), 1170–1184.","ieee":"S. Carniani <i>et al.</i>, “Kiloparsec-scale gaseous clumps and star formation at z = 5–7,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 478, no. 1. Oxford University Press, pp. 1170–1184, 2018.","apa":"Carniani, S., Maiolino, R., Amorin, R., Pentericci, L., Pallottini, A., Ferrara, A., … Guaita, L. (2018). Kiloparsec-scale gaseous clumps and star formation at z = 5–7. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/sty1088\">https://doi.org/10.1093/mnras/sty1088</a>","ama":"Carniani S, Maiolino R, Amorin R, et al. Kiloparsec-scale gaseous clumps and star formation at z = 5–7. <i>Monthly Notices of the Royal Astronomical Society</i>. 2018;478(1):1170-1184. doi:<a href=\"https://doi.org/10.1093/mnras/sty1088\">10.1093/mnras/sty1088</a>"},"abstract":[{"text":"We investigate the morphology of the [C II] emission in a sample of ‘normal’ star-forming galaxies at 5 < z < 7.2 in relation to their UV (rest-frame) counterpart. We use new Atacama Large Millimetre/submillimetre Array (ALMA) observations of galaxies at z ∼ 6–7, as well as a careful re-analysis of archival ALMA data. In total 29 galaxies were analysed, 21 of which are detected in [C II]. For several of the latter the [C II] emission breaks into multiple components. Only a fraction of these [C II] components, if any, is associated with the primary UV systems, while the bulk of the [C II] emission is associated either with fainter UV components, or not associated with any UV counterpart at the current limits. By taking into account the presence of all these components, we find that the L[CII]–SFR (star formation rate) relation at early epochs is fully consistent with the local relation, but it has a dispersion of 0.48 ± 0.07 dex, which is about two times larger than observed locally. We also find that the deviation from the local L[CII]–SFR relation has a weak anticorrelation with the EW(Ly α). The morphological analysis also reveals that [C II] emission is generally much more extended than the UV emission. As a consequence, these primordial galaxies are characterized by a [C II] surface brightness generally much lower than expected from the local Σ[CII]−ΣSFR relation. These properties are likely a consequence of a combination of different effects, namely gas metallicity, [C II] emission from obscured star-forming regions, strong variations of the ionization parameter, and circumgalactic gas in accretion or ejected by these primeval galaxies.","lang":"eng"}],"extern":"1","type":"journal_article","quality_controlled":"1","volume":478,"publisher":"Oxford University Press","main_file_link":[{"url":"https://arxiv.org/abs/1712.03985","open_access":"1"}]},{"day":"01","doi":"10.1093/mnras/sty782","oa":1,"intvolume":"       477","date_published":"2018-06-01T00:00:00Z","year":"2018","article_type":"original","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"acknowledgement":"We thank the anonymous reviewer for their timely and constructive comments that greatly helped us to improve the manuscript. DS acknowledges financial support from the Netherlands Organization for Scientific research (NWO) through a Veni fellowship and from Lancaster University through an Early Career Internal Grant A100679. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. BD acknowledges financial support from NASA through the Astrophysics Data Analysis Program (ADAP), grant number NNX12AE20G, and the National Science Foundation, grant number 1716907. IRS acknowledges support from the ERC Advanced Grant DUSTYGAL (321334), STFC (ST/P000541/1), and a Royal Society/Wolfson Merit Award. PNB is grateful for support from STFC via grant ST/M001229/1. We thank Anne Verhamme, Kimihiko Nakajima, Ryan Trainor, Sangeeta Malhotra, Max Gronke, James Rhoads, Fang Xia An, Matthew Hayes, Takashi Kojima, Mark Dijkstra, and Anne Jaskot for many helpful and engaging discussions, particularly during the SnowCLAW Ly α workshop. We thank Bruno Ribeiro, Stephane Charlot, and Joseph Caruana for comments on the manuscript. The authors would also like to thank Ingrid Tengs, Meg Singleton, Ali Khostovan, and Sara Perez for participating in part of the observations. We also thank Joao Calhau, Leah Morabito, Sergio Santos, and Aayush Saxena for their assistance with the narrow-band observations which allowed to select some of the sour ces. Based on observations obtained with the William Herschel Telescope, program: W16AN004; the Very Large Telescope, programs: 098.A-0819 & 099.A-0254; and the Keck II telescope, program: C267D. Based on data products from observations made with ESO Telescopes at the La Silla Paranal Observatory under ESO programme IDs 294.A-5018, 294.A-5039, 092.A-0786, 093.A-0561, 097.A-0943, 098.A-0819, 099.A-0254 and 179.A-2005. The authors acknowledge the award of service time (SW2014b20) on the WHT. WHT and its service programme are operated on the island of La Palma by the Isaac Newton Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrofisica de Canarias. The authors would also like to thank all the extremely helpful observatory staff that have greatly contributed towards our observations, particularly Fiona Riddick, Lilian Dominguez, Florencia Jimenez, and Ian Skillen. We have benefited greatly from the publicly available programming language PYTHON, including the NUMPY & SCIPY (Van Der Walt, Colbert & Varoquaux 2011; Jones et al. 2001), MATPLOTLIB (Hunter 2007), ASTROPY (Astropy Collaboration et al. 2013), and the TOPCAT analysis program (Taylor 2013). This research has made use of the VizieR catalogue access tool, CDS, Strasbourg, France.","publication":"Monthly Notices of the Royal Astronomical Society","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: active","galaxies: evolution","galaxies: high-redshift","galaxies: ISM","galaxies: starburst","cosmology: observations"],"author":[{"full_name":"Sobral, David","last_name":"Sobral","first_name":"David"},{"first_name":"Jorryt J","last_name":"Matthee","full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X"},{"first_name":"Behnam","full_name":"Darvish, Behnam","last_name":"Darvish"},{"first_name":"Ian","full_name":"Smail, Ian","last_name":"Smail"},{"last_name":"Best","full_name":"Best, Philip N","first_name":"Philip N"},{"full_name":"Alegre, Lara","last_name":"Alegre","first_name":"Lara"},{"first_name":"Huub","last_name":"Röttgering","full_name":"Röttgering, Huub"},{"full_name":"Mobasher, Bahram","last_name":"Mobasher","first_name":"Bahram"},{"first_name":"Ana","full_name":"Paulino-Afonso, Ana","last_name":"Paulino-Afonso"},{"first_name":"Andra","last_name":"Stroe","full_name":"Stroe, Andra"},{"first_name":"Iván","last_name":"Oteo","full_name":"Oteo, Iván"}],"title":"The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN","date_updated":"2022-08-19T07:01:08Z","page":"2817-2840","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","abstract":[{"text":"Deep narrow-band surveys have revealed a large population of faint Ly α emitters (LAEs) in the distant Universe, but relatively little is known about the most luminous sources (⁠LLyα≳1042.7 erg s−1; LLyα≳L∗Lyα⁠). Here we present the spectroscopic follow-up of 21 luminous LAEs at z ∼ 2–3 found with panoramic narrow-band surveys over five independent extragalactic fields (≈4 × 106 Mpc3 surveyed at z ∼ 2.2 and z ∼ 3.1). We use WHT/ISIS, Keck/DEIMOS, and VLT/X-SHOOTER to study these sources using high ionization UV lines. Luminous LAEs at z ∼ 2–3 have blue UV slopes (⁠β=−2.0+0.3−0.1⁠) and high Ly α escape fractions (⁠50+20−15 per cent) and span five orders of magnitude in UV luminosity (MUV ≈ −19 to −24). Many (70 per cent) show at least one high ionization rest-frame UV line such as C IV, N V, C III], He II or O III], typically blue-shifted by ≈100–200 km s−1 relative to Ly α. Their Ly α profiles reveal a wide variety of shapes, including significant blue-shifted components and widths from 200 to 4000 km s−1. Overall, 60 ± 11  per cent appear to be active galactic nucleus (AGN) dominated, and at LLyα > 1043.3 erg s−1 and/or MUV < −21.5 virtually all LAEs are AGNs with high ionization parameters (log U = 0.6 ± 0.5) and with metallicities of ≈0.5 − 1 Z⊙. Those lacking signatures of AGNs (40 ± 11  per cent) have lower ionization parameters (⁠logU=−3.0+1.6−0.9 and log ξion = 25.4 ± 0.2) and are apparently metal-poor sources likely powered by young, dust-poor ‘maximal’ starbursts. Our results show that luminous LAEs at z ∼ 2–3 are a diverse population and that 2×L∗Lyα and 2×M∗UV mark a sharp transition in the nature of LAEs, from star formation dominated to AGN dominated.","lang":"eng"}],"type":"journal_article","extern":"1","citation":{"mla":"Sobral, David, et al. “The Nature of Luminous Ly α Emitters at z ∼ 2–3: Maximal Dust-Poor Starbursts and Highly Ionizing AGN.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 477, no. 2, Oxford University Press, 2018, pp. 2817–40, doi:<a href=\"https://doi.org/10.1093/mnras/sty782\">10.1093/mnras/sty782</a>.","ista":"Sobral D, Matthee JJ, Darvish B, Smail I, Best PN, Alegre L, Röttgering H, Mobasher B, Paulino-Afonso A, Stroe A, Oteo I. 2018. The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN. Monthly Notices of the Royal Astronomical Society. 477(2), 2817–2840.","chicago":"Sobral, David, Jorryt J Matthee, Behnam Darvish, Ian Smail, Philip N Best, Lara Alegre, Huub Röttgering, et al. “The Nature of Luminous Ly α Emitters at z ∼ 2–3: Maximal Dust-Poor Starbursts and Highly Ionizing AGN.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/mnras/sty782\">https://doi.org/10.1093/mnras/sty782</a>.","ama":"Sobral D, Matthee JJ, Darvish B, et al. The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN. <i>Monthly Notices of the Royal Astronomical Society</i>. 2018;477(2):2817-2840. doi:<a href=\"https://doi.org/10.1093/mnras/sty782\">10.1093/mnras/sty782</a>","ieee":"D. Sobral <i>et al.</i>, “The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 477, no. 2. Oxford University Press, pp. 2817–2840, 2018.","apa":"Sobral, D., Matthee, J. J., Darvish, B., Smail, I., Best, P. N., Alegre, L., … Oteo, I. (2018). The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/sty782\">https://doi.org/10.1093/mnras/sty782</a>","short":"D. Sobral, J.J. Matthee, B. Darvish, I. Smail, P.N. Best, L. Alegre, H. Röttgering, B. Mobasher, A. Paulino-Afonso, A. Stroe, I. Oteo, Monthly Notices of the Royal Astronomical Society 477 (2018) 2817–2840."},"quality_controlled":"1","volume":477,"publisher":"Oxford University Press","main_file_link":[{"url":"https://arxiv.org/abs/1802.10102","open_access":"1"}],"publication_status":"published","date_created":"2022-07-12T07:18:02Z","external_id":{"arxiv":["1802.10102"]},"_id":"11557","month":"06","scopus_import":"1","issue":"2"},{"main_file_link":[{"url":"https://arxiv.org/abs/1712.04451","open_access":"1"}],"publisher":"Oxford University Press","volume":476,"quality_controlled":"1","citation":{"short":"D. Sobral, S. Santos, J.J. Matthee, A. Paulino-Afonso, B. Ribeiro, J. Calhau, A.A. Khostovan, Monthly Notices of the Royal Astronomical Society 476 (2018) 4725–4752.","apa":"Sobral, D., Santos, S., Matthee, J. J., Paulino-Afonso, A., Ribeiro, B., Calhau, J., &#38; Khostovan, A. A. (2018). Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/sty378\">https://doi.org/10.1093/mnras/sty378</a>","ieee":"D. Sobral <i>et al.</i>, “Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 476, no. 4. Oxford University Press, pp. 4725–4752, 2018.","ama":"Sobral D, Santos S, Matthee JJ, et al. Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6. <i>Monthly Notices of the Royal Astronomical Society</i>. 2018;476(4):4725-4752. doi:<a href=\"https://doi.org/10.1093/mnras/sty378\">10.1093/mnras/sty378</a>","mla":"Sobral, David, et al. “Slicing COSMOS with SC4K: The Evolution of Typical Ly α Emitters and the Ly α Escape Fraction from z ∼ 2 to 6.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 476, no. 4, Oxford University Press, 2018, pp. 4725–52, doi:<a href=\"https://doi.org/10.1093/mnras/sty378\">10.1093/mnras/sty378</a>.","chicago":"Sobral, David, Sérgio Santos, Jorryt J Matthee, Ana Paulino-Afonso, Bruno Ribeiro, João Calhau, and Ali A Khostovan. “Slicing COSMOS with SC4K: The Evolution of Typical Ly α Emitters and the Ly α Escape Fraction from z ∼ 2 to 6.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/mnras/sty378\">https://doi.org/10.1093/mnras/sty378</a>.","ista":"Sobral D, Santos S, Matthee JJ, Paulino-Afonso A, Ribeiro B, Calhau J, Khostovan AA. 2018. Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6. Monthly Notices of the Royal Astronomical Society. 476(4), 4725–4752."},"abstract":[{"lang":"eng","text":"We present and explore deep narrow- and medium-band data obtained with the Subaru and the Isaac Newton Telescopes in the ∼2 deg2 COSMOS field. We use these data as an extremely wide, low-resolution (R ∼ 20–80) Integral Field Unit survey to slice through the COSMOS field and obtain a large sample of ∼4000 Ly α emitters (LAEs) from z ∼ 2 to 6 in 16 redshift slices (SC4K). We present new Ly α luminosity functions (LFs) covering a comoving volume of ∼108 Mpc3. SC4K extensively complements ultradeep surveys, jointly covering over 4 dex in Ly α luminosity and revealing a global (2.5 < z < 6) synergy LF with α=−1.93+0.12−0.12⁠, log10Φ∗Lyα=−3.45+0.22−0.29 Mpc−3, and log10L∗Lyα=42.93+0.15−0.11 erg s−1. The Schechter component of the Ly α LF reveals a factor ∼5 rise in L∗Lyα and a ∼7 × decline in Φ∗Lyα from z ∼ 2 to 6. The data reveal an extra power-law (or Schechter) component above LLy α ≈ 1043.3 erg s−1 at z ∼ 2.2–3.5 and we show that it is partially driven by X-ray and radio active galactic nucleus (AGN), as their Ly α LF resembles the excess. The power-law component vanishes and/or is below our detection limits above z > 3.5, likely linked with the evolution of the AGN population. The Ly α luminosity density rises by a factor ∼2 from z ∼ 2 to 3 but is then found to be roughly constant (⁠1.1+0.2−0.2×1040 erg s−1 Mpc−3) to z ∼ 6, despite the ∼0.7 dex drop in ultraviolet (UV) luminosity density. The Ly α/UV luminosity density ratio rises from 4 ± 1 per cent to 30 ± 6 per cent from z ∼ 2.2 to 6. Our results imply a rise of a factor of ≈2 in the global ionization efficiency (ξion) and a factor ≈4 ± 1 in the Ly α escape fraction from z ∼ 2 to 6, hinting for evolution in both the typical burstiness/stellar populations and even more so in the typical interstellar medium conditions allowing Ly α photons to escape."}],"type":"journal_article","extern":"1","issue":"4","scopus_import":"1","month":"06","_id":"11558","external_id":{"arxiv":["1712.04451"]},"date_created":"2022-07-12T10:41:08Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"publication":"Monthly Notices of the Royal Astronomical Society","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"year":"2018","article_type":"original","acknowledgement":"We thank the anonymous referee for their constructive comments that helped us improve the manuscript. DS acknowledges the hospitality of the IAC and a Severo Ochoa visiting grant. SS and JC acknowledge studentships from the Lancaster University. JM acknowledges a Huygens PhD fellowship from Leiden University. APA acknowledges financial support from the Science and Technology Foundation (FCT, Portugal) through research grants UID/FIS/04434/2013 and fellowship PD/BD/52706/2014. The authors thank Alyssa Drake, Kimihiko Nakajima, Yuichi Harikane, Max Gronke, Irene Shivaei, Helmut Dannerbauer, Huub Rottgering, ¨ Marius Eide, and Masami Ouchi for many engaging and stimulating discussions. We also thank Sara Perez, Alex Bennett, and Tom Rose for their involvement in the early stages of this project. Based on data products from observations made with European Southern Observatory (ESO) Telescopes at the La Silla Paranal Observatory under ESO programme IDs 294.A-5018, 097.A 0943,\r\n098.A-0819, 099.A-0254, and 179.A-2005 and on data products produced by TERAPIX and the Cambridge Astronomy Survey Unit on behalf of the UltraVISTA consortium. Based on observations using the WFC on the 2.5 m INT, as part of programmes 2013AN002, 2013BN008, 2014AC88, 2014AN002, 2014BN006, 2014BC118, and 2016AN001. The INT is operated on the island of La Palma by the Isaac Newton Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrofisica de Canarias. This work is based in part on data products produced at TERAPIX available at the Canadian Astronomy Data Centre as part of the Canada–France– Hawaii Telescope Legacy Survey (CFHTLS), a collaborative project of NRC and CNRS.\r\nWe are grateful to the CFHTLS, COSMOS-UltraVISTA, and COSMOS survey teams. We are also unmeasurably thankful to the pioneering and continuous work from previous Ly α surveys’ teams. Without these previous Ly α and the wider reach legacy surveys, this research would have been impossible. We also thank the VUDS team for making available spectroscopic redshifts from data obtained with VIMOS at the European Southern Observatory Very Large Telescope, Paranal, Chile, under Large Programme 185.A-0791. Finally, the authors acknowledge the unique value of the publicly available programming language PYTHON, including the NUMPY and SCIPY (Van Der Walt, Colbert & Varoquaux 2011; Jones et al. 2001), MATPLOTLIB (Hunter 2007), ASTROPY (Astropy Collaboration et al. 2013), and the TOPCAT analysis program (Taylor 2005). We publicly release a catalogue with all LAEs used in this paper (SC4K), so it can be freely explored by the community (see five example entries in Table A1).","date_published":"2018-06-01T00:00:00Z","intvolume":"       476","oa":1,"doi":"10.1093/mnras/sty378","day":"01","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public","page":"4725-4752","date_updated":"2022-08-19T07:04:45Z","title":"Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6","author":[{"last_name":"Sobral","full_name":"Sobral, David","first_name":"David"},{"full_name":"Santos, Sérgio","last_name":"Santos","first_name":"Sérgio"},{"orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J","last_name":"Matthee","first_name":"Jorryt J"},{"first_name":"Ana","last_name":"Paulino-Afonso","full_name":"Paulino-Afonso, Ana"},{"last_name":"Ribeiro","full_name":"Ribeiro, Bruno","first_name":"Bruno"},{"last_name":"Calhau","full_name":"Calhau, João","first_name":"João"},{"first_name":"Ali A","full_name":"Khostovan, Ali A","last_name":"Khostovan"}],"keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: formation","galaxies: high-redshift","galaxies: luminosity function","mass function","galaxies: statistics"],"oa_version":"Preprint"},{"quality_controlled":"1","citation":{"short":"J.J. Matthee, J. Schaye, Monthly Notices of the Royal Astronomical Society: Letters 479 (2018) L34–L39.","ieee":"J. J. Matthee and J. Schaye, “Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement,” <i>Monthly Notices of the Royal Astronomical Society: Letters</i>, vol. 479, no. 1. Oxford University Press, pp. L34–L39, 2018.","ama":"Matthee JJ, Schaye J. Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement. <i>Monthly Notices of the Royal Astronomical Society: Letters</i>. 2018;479(1):L34-L39. doi:<a href=\"https://doi.org/10.1093/mnrasl/sly093\">10.1093/mnrasl/sly093</a>","apa":"Matthee, J. J., &#38; Schaye, J. (2018). Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement. <i>Monthly Notices of the Royal Astronomical Society: Letters</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnrasl/sly093\">https://doi.org/10.1093/mnrasl/sly093</a>","mla":"Matthee, Jorryt J., and Joop Schaye. “Star-Forming Galaxies Are Predicted to Lie on a Fundamental Plane of Mass, Star Formation Rate, and α-Enhancement.” <i>Monthly Notices of the Royal Astronomical Society: Letters</i>, vol. 479, no. 1, Oxford University Press, 2018, pp. L34–39, doi:<a href=\"https://doi.org/10.1093/mnrasl/sly093\">10.1093/mnrasl/sly093</a>.","chicago":"Matthee, Jorryt J, and Joop Schaye. “Star-Forming Galaxies Are Predicted to Lie on a Fundamental Plane of Mass, Star Formation Rate, and α-Enhancement.” <i>Monthly Notices of the Royal Astronomical Society: Letters</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/mnrasl/sly093\">https://doi.org/10.1093/mnrasl/sly093</a>.","ista":"Matthee JJ, Schaye J. 2018. Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement. Monthly Notices of the Royal Astronomical Society: Letters. 479(1), L34–L39."},"extern":"1","type":"journal_article","abstract":[{"lang":"eng","text":"Observations show that star-forming galaxies reside on a tight 3D plane between mass, gas-phase metallicity, and star formation rate (SFR), which can be explained by the interplay between metal-poor gas inflows, SFR and outflows. However, different metals are released on different time-scales, which may affect the slope of this relation. Here, we use central, star-forming galaxies with Mstar = 109.0–10.5 M⊙ from the EAGLE hydrodynamical simulation to examine 3D relations between mass, SFR, and chemical enrichment using absolute and relative C, N, O, and Fe abundances. We show that the scatter is smaller when gas-phase α-enhancement is used rather than metallicity. A similar plane also exists for stellar α-enhancement, implying that present-day specific SFRs are correlated with long time-scale star formation histories. Between z = 0 and 1, the α-enhancement plane is even more insensitive to redshift than the plane using metallicity. However, it evolves at z > 1 due to lagging iron yields. At fixed mass, galaxies with higher SFRs have star formation histories shifted towards late times, are more α-enhanced, and this α-enhancement increases with redshift as observed. These findings suggest that relations between physical properties inferred from observations may be affected by systematic variations in α-enhancements."}],"volume":479,"main_file_link":[{"url":"https://arxiv.org/abs/1802.06786","open_access":"1"}],"publisher":"Oxford University Press","date_created":"2022-07-14T12:49:47Z","publication_status":"published","external_id":{"arxiv":["1802.06786"]},"_id":"11584","scopus_import":"1","issue":"1","month":"09","date_published":"2018-09-01T00:00:00Z","intvolume":"       479","oa":1,"day":"01","doi":"10.1093/mnrasl/sly093","year":"2018","acknowledgement":"We thank the anonymous referee for their constructive comments. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. We thank Jarle Brinchmann, Rob Crain and David Sobral for discussions. We acknowledge the use of the TOPCAT software (Taylor 2013) for assisting in rapid exploration of multidimensional data sets and the use of PYTHON and its NUMPY, MATPLOTLIB, and PANDAS packages.","article_type":"original","publication_identifier":{"issn":["1745-3925"],"eissn":["1745-3933"]},"arxiv":1,"publication":"Monthly Notices of the Royal Astronomical Society: Letters","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: abundances","galaxies: evolution","galaxies: formation","galaxies: star formation"],"date_updated":"2024-10-14T11:37:53Z","page":"L34 - L39","author":[{"first_name":"Jorryt J","last_name":"Matthee","full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X"},{"full_name":"Schaye, Joop","last_name":"Schaye","first_name":"Joop"}],"title":"Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement","article_processing_charge":"No","language":[{"iso":"eng"}],"status":"public"}]