[{"language":[{"iso":"eng"}],"oa_version":"Preprint","citation":{"short":"Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B.K. Malia, O. Hosten, M.A. Kasevich, Physical Review A 102 (2020).","ama":"Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA. Retrieval of cavity-generated atomic spin squeezing after free-space release. <i>Physical Review A</i>. 2020;102(1). doi:<a href=\"https://doi.org/10.1103/PhysRevA.102.012224\">10.1103/PhysRevA.102.012224</a>","apa":"Wu, Y., Krishnakumar, R., Martínez-Rincón, J., Malia, B. K., Hosten, O., &#38; Kasevich, M. A. (2020). Retrieval of cavity-generated atomic spin squeezing after free-space release. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.102.012224\">https://doi.org/10.1103/PhysRevA.102.012224</a>","mla":"Wu, Yunfan, et al. “Retrieval of Cavity-Generated Atomic Spin Squeezing after Free-Space Release.” <i>Physical Review A</i>, vol. 102, no. 1, 012224, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/PhysRevA.102.012224\">10.1103/PhysRevA.102.012224</a>.","ista":"Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA. 2020. Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. 102(1), 012224.","ieee":"Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B. K. Malia, O. Hosten, and M. A. Kasevich, “Retrieval of cavity-generated atomic spin squeezing after free-space release,” <i>Physical Review A</i>, vol. 102, no. 1. American Physical Society, 2020.","chicago":"Wu, Yunfan, Rajiv Krishnakumar, Julián Martínez-Rincón, Benjamin K. Malia, Onur Hosten, and Mark A. Kasevich. “Retrieval of Cavity-Generated Atomic Spin Squeezing after Free-Space Release.” <i>Physical Review A</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/PhysRevA.102.012224\">https://doi.org/10.1103/PhysRevA.102.012224</a>."},"researchdata_availability":"no","author":[{"full_name":"Wu, Yunfan","last_name":"Wu","first_name":"Yunfan"},{"last_name":"Krishnakumar","first_name":"Rajiv","full_name":"Krishnakumar, Rajiv"},{"full_name":"Martínez-Rincón, Julián","last_name":"Martínez-Rincón","first_name":"Julián"},{"full_name":"Malia, Benjamin K.","first_name":"Benjamin K.","last_name":"Malia"},{"id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","first_name":"Onur","last_name":"Hosten","full_name":"Hosten, Onur","orcid":"0000-0002-2031-204X"},{"first_name":"Mark A.","last_name":"Kasevich","full_name":"Kasevich, Mark A."}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","isi":1,"external_id":{"arxiv":["1912.08334"],"isi":["000555104200011"]},"abstract":[{"lang":"eng","text":"We demonstrate that releasing atoms into free space from an optical lattice does not deteriorate cavity-generated spin squeezing for metrological purposes. In this work, an ensemble of 500000 spin-squeezed atoms in a high-finesse optical cavity with near-uniform atom-cavity coupling is prepared, released into free space, recaptured in the cavity, and probed. Up to ∼10 dB of metrologically relevant squeezing is retrieved for 700μs free-fall times, and decaying levels of squeezing are realized for up to 3 ms free-fall times. The degradation of squeezing results from loss of atom-cavity coupling homogeneity between the initial squeezed state generation and final collective state readout. A theoretical model is developed to quantify this degradation and this model is experimentally validated."}],"date_updated":"2026-07-08T08:59:02Z","department":[{"_id":"OnHo"}],"arxiv":1,"date_published":"2020-07-30T00:00:00Z","publisher":"American Physical Society","issue":"1","title":"Retrieval of cavity-generated atomic spin squeezing after free-space release","intvolume":"       102","volume":102,"article_processing_charge":"No","month":"07","day":"30","scopus_import":"1","date_created":"2020-08-30T22:01:10Z","acknowledgement":"We thank N. Engelsen for comments on the manuscript. This work was supported by the Office of Naval Research, Vannevar Bush Faculty Fellowship, Department of Energy, and Defense Threat Reduction Agency. R.K. was partly supported by the AQT/INQNET program at Caltech.","publication":"Physical Review A","article_number":"012224","main_file_link":[{"url":"https://arxiv.org/abs/1912.08334","open_access":"1"}],"_id":"8319","doi":"10.1103/PhysRevA.102.012224","publication_identifier":{"issn":["2469-9926"],"eissn":["2469-9934"]},"article_type":"original","oa":1,"year":"2020","publication_status":"published","type":"journal_article","status":"public","quality_controlled":"1","supplementarymaterial":"no","das_tickbox":"0"},{"author":[{"full_name":"Gonçalves, Pedro J.","orcid":"0000-0002-6987-4836","first_name":"Pedro J.","last_name":"Gonçalves"},{"full_name":"Lueckmann, Jan-Matthis","orcid":"0000-0003-4320-4663","first_name":"Jan-Matthis","last_name":"Lueckmann"},{"orcid":"0000-0002-3573-0404","full_name":"Deistler, Michael","first_name":"Michael","last_name":"Deistler"},{"full_name":"Nonnenmacher, Marcel","orcid":"0000-0001-6044-6627","last_name":"Nonnenmacher","first_name":"Marcel"},{"last_name":"Öcal","first_name":"Kaan","orcid":"0000-0002-8528-6858","full_name":"Öcal, Kaan"},{"first_name":"Giacomo","last_name":"Bassetto","full_name":"Bassetto, Giacomo"},{"full_name":"Chintaluri, Chaitanya","orcid":"0000-0003-4252-1608","id":"BA06AFEE-A4BA-11EA-AE5C-14673DDC885E","first_name":"Chaitanya","last_name":"Chintaluri"},{"orcid":"0000-0001-6619-7502","full_name":"Podlaski, William F.","first_name":"William F.","last_name":"Podlaski"},{"last_name":"Haddad","first_name":"Sara A.","full_name":"Haddad, Sara A.","orcid":"0000-0003-0807-0823"},{"first_name":"Tim P","last_name":"Vogels","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","full_name":"Vogels, Tim P","orcid":"0000-0003-3295-6181"},{"last_name":"Greenberg","first_name":"David S.","full_name":"Greenberg, David S."},{"full_name":"Macke, Jakob H.","orcid":"0000-0001-5154-8912","last_name":"Macke","first_name":"Jakob H."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Gonçalves, P. J., Lueckmann, J.-M., Deistler, M., Nonnenmacher, M., Öcal, K., Bassetto, G., … Macke, J. H. (2020). Training deep neural density estimators to identify mechanistic models of neural dynamics. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.56261\">https://doi.org/10.7554/eLife.56261</a>","ama":"Gonçalves PJ, Lueckmann J-M, Deistler M, et al. Training deep neural density estimators to identify mechanistic models of neural dynamics. <i>eLife</i>. 2020;9. doi:<a href=\"https://doi.org/10.7554/eLife.56261\">10.7554/eLife.56261</a>","short":"P.J. Gonçalves, J.-M. Lueckmann, M. Deistler, M. Nonnenmacher, K. Öcal, G. Bassetto, C. Chintaluri, W.F. Podlaski, S.A. Haddad, T.P. Vogels, D.S. Greenberg, J.H. Macke, ELife 9 (2020).","ista":"Gonçalves PJ, Lueckmann J-M, Deistler M, Nonnenmacher M, Öcal K, Bassetto G, Chintaluri C, Podlaski WF, Haddad SA, Vogels TP, Greenberg DS, Macke JH. 2020. Training deep neural density estimators to identify mechanistic models of neural dynamics. eLife. 9, e56261.","mla":"Gonçalves, Pedro J., et al. “Training Deep Neural Density Estimators to Identify Mechanistic Models of Neural Dynamics.” <i>ELife</i>, vol. 9, e56261, eLife Sciences Publications, 2020, doi:<a href=\"https://doi.org/10.7554/eLife.56261\">10.7554/eLife.56261</a>.","chicago":"Gonçalves, Pedro J., Jan-Matthis Lueckmann, Michael Deistler, Marcel Nonnenmacher, Kaan Öcal, Giacomo Bassetto, Chaitanya Chintaluri, et al. “Training Deep Neural Density Estimators to Identify Mechanistic Models of Neural Dynamics.” <i>ELife</i>. eLife Sciences Publications, 2020. <a href=\"https://doi.org/10.7554/eLife.56261\">https://doi.org/10.7554/eLife.56261</a>.","ieee":"P. J. Gonçalves <i>et al.</i>, “Training deep neural density estimators to identify mechanistic models of neural dynamics,” <i>eLife</i>, vol. 9. eLife Sciences Publications, 2020."},"oa_version":"Published Version","language":[{"iso":"eng"}],"publisher":"eLife Sciences Publications","date_published":"2020-09-17T00:00:00Z","abstract":[{"text":"Mechanistic modeling in neuroscience aims to explain observed phenomena in terms of underlying causes. However, determining which model parameters agree with complex and stochastic neural data presents a significant challenge. We address this challenge with a machine learning tool which uses deep neural density estimators—trained using model simulations—to carry out Bayesian inference and retrieve the full space of parameters compatible with raw data or selected data features. Our method is scalable in parameters and data features and can rapidly analyze new data after initial training. We demonstrate the power and flexibility of our approach on receptive fields, ion channels, and Hodgkin–Huxley models. We also characterize the space of circuit configurations giving rise to rhythmic activity in the crustacean stomatogastric ganglion, and use these results to derive hypotheses for underlying compensation mechanisms. Our approach will help close the gap between data-driven and theory-driven models of neural dynamics.","lang":"eng"}],"department":[{"_id":"TiVo"}],"date_updated":"2026-07-13T12:31:21Z","external_id":{"isi":["000584989400001"],"pmid":["32940606"]},"isi":1,"ddc":["570"],"publication":"eLife","day":"17","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"pmid":1,"ec_funded":1,"date_created":"2020-07-16T12:26:04Z","acknowledgement":"We thank Mahmood S Hoseini and Michael Stryker for sharing their data for Figure 2, and Philipp Berens, Sean Bittner, Jan Boelts, John Cunningham, Richard Gao, Scott Linderman, Eve Marder, Iain Murray, George Papamakarios, Astrid Prinz, Auguste Schulz and Srinivas Turaga for discussions and/or comments on the manuscript. This work was supported by the German Research Foundation (DFG) through SFB 1233 ‘Robust Vision’, (276693517), SFB 1089 ‘Synaptic Microcircuits’, SPP 2041 ‘Computational Connectomics’ and Germany's Excellence Strategy – EXC-Number 2064/1 – Project number 390727645 and the German Federal Ministry of Education and Research (BMBF, project ‘ADIMEM’, FKZ 01IS18052 A-D) to JHM, a Sir Henry Dale Fellowship by the Wellcome Trust and the Royal Society (WT100000; WFP and TPV), a Wellcome Trust Senior Research Fellowship (214316/Z/18/Z; TPV), a ERC Consolidator Grant (SYNAPSEEK; WPF and CC), and a UK Research and Innovation, Biotechnology and Biological Sciences Research Council (CC, UKRI-BBSRC BB/N019512/1). We gratefully acknowledge the Leibniz Supercomputing Centre for funding this project by providing computing time on its Linux-Cluster.","scopus_import":"1","file":[{"date_updated":"2020-10-27T11:37:32Z","content_type":"application/pdf","file_size":17355867,"file_name":"2020_eLife_Gonçalves.pdf","success":1,"access_level":"open_access","date_created":"2020-10-27T11:37:32Z","checksum":"c4300ddcd93ed03fc9c6cdf1f77890be","relation":"main_file","file_id":"8709","creator":"cziletti"}],"volume":9,"month":"09","article_processing_charge":"No","title":"Training deep neural density estimators to identify mechanistic models of neural dynamics","project":[{"_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","grant_number":"819603","name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","call_identifier":"H2020"}],"intvolume":"         9","das_tickbox":"1","status":"public","type":"journal_article","year":"2020","publication_status":"published","file_date_updated":"2020-10-27T11:37:32Z","quality_controlled":"1","oa":1,"article_type":"original","has_accepted_license":"1","article_number":"e56261","publication_identifier":{"eissn":["2050-084X"]},"doi":"10.7554/eLife.56261","_id":"8127"},{"author":[{"full_name":"Cadavid, Doris","last_name":"Cadavid","first_name":"Doris"},{"full_name":"Ortega, Silvia","last_name":"Ortega","first_name":"Silvia"},{"last_name":"Illera","first_name":"Sergio","full_name":"Illera, Sergio"},{"id":"2A70014E-F248-11E8-B48F-1D18A9856A87","last_name":"Liu","first_name":"Yu","orcid":"0000-0001-7313-6740","full_name":"Liu, Yu"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Shavel, Alexey","last_name":"Shavel","first_name":"Alexey"},{"first_name":"Yu","last_name":"Zhang","full_name":"Zhang, Yu"},{"full_name":"Li, Mengyao","last_name":"Li","first_name":"Mengyao"},{"full_name":"López, Antonio M.","last_name":"López","first_name":"Antonio M."},{"last_name":"Noriega","first_name":"Germán","full_name":"Noriega, Germán"},{"first_name":"Oscar Juan","last_name":"Durá","full_name":"Durá, Oscar Juan"},{"full_name":"López De La Torre, M. A.","first_name":"M. A.","last_name":"López De La Torre"},{"full_name":"Prades, Joan Daniel","first_name":"Joan Daniel","last_name":"Prades"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Cadavid, Doris, Silvia Ortega, Sergio Illera, Yu Liu, Maria Ibáñez, Alexey Shavel, Yu Zhang, et al. “Influence of the Ligand Stripping on the Transport Properties of Nanoparticle-Based PbSe Nanomaterials.” <i>ACS Applied Energy Materials</i>. American Chemical Society, 2020. <a href=\"https://doi.org/10.1021/acsaem.9b02137\">https://doi.org/10.1021/acsaem.9b02137</a>.","ieee":"D. Cadavid <i>et al.</i>, “Influence of the ligand stripping on the transport properties of nanoparticle-based PbSe nanomaterials,” <i>ACS Applied Energy Materials</i>, vol. 3, no. 3. American Chemical Society, pp. 2120–2129, 2020.","mla":"Cadavid, Doris, et al. “Influence of the Ligand Stripping on the Transport Properties of Nanoparticle-Based PbSe Nanomaterials.” <i>ACS Applied Energy Materials</i>, vol. 3, no. 3, American Chemical Society, 2020, pp. 2120–29, doi:<a href=\"https://doi.org/10.1021/acsaem.9b02137\">10.1021/acsaem.9b02137</a>.","ista":"Cadavid D, Ortega S, Illera S, Liu Y, Ibáñez M, Shavel A, Zhang Y, Li M, López AM, Noriega G, Durá OJ, López De La Torre MA, Prades JD, Cabot A. 2020. Influence of the ligand stripping on the transport properties of nanoparticle-based PbSe nanomaterials. ACS Applied Energy Materials. 3(3), 2120–2129.","apa":"Cadavid, D., Ortega, S., Illera, S., Liu, Y., Ibáñez, M., Shavel, A., … Cabot, A. (2020). Influence of the ligand stripping on the transport properties of nanoparticle-based PbSe nanomaterials. <i>ACS Applied Energy Materials</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsaem.9b02137\">https://doi.org/10.1021/acsaem.9b02137</a>","ama":"Cadavid D, Ortega S, Illera S, et al. Influence of the ligand stripping on the transport properties of nanoparticle-based PbSe nanomaterials. <i>ACS Applied Energy Materials</i>. 2020;3(3):2120-2129. doi:<a href=\"https://doi.org/10.1021/acsaem.9b02137\">10.1021/acsaem.9b02137</a>","short":"D. Cadavid, S. Ortega, S. Illera, Y. Liu, M. Ibáñez, A. Shavel, Y. Zhang, M. Li, A.M. López, G. Noriega, O.J. Durá, M.A. López De La Torre, J.D. Prades, A. Cabot, ACS Applied Energy Materials 3 (2020) 2120–2129."},"oa_version":"Accepted Version","language":[{"iso":"eng"}],"publisher":"American Chemical Society","issue":"3","date_published":"2020-03-01T00:00:00Z","abstract":[{"text":"Nanomaterials produced from the bottom-up assembly of nanocrystals may incorporate ∼1020–1021 cm–3 not fully coordinated surface atoms, i.e., ∼1020–1021 cm–3 potential donor or acceptor states that can strongly affect transport properties. Therefore, to exploit the full potential of nanocrystal building blocks to produce functional nanomaterials and thin films, a proper control of their surface chemistry is required. Here, we analyze how the ligand stripping procedure influences the charge and heat transport properties of sintered PbSe nanomaterials produced from the bottom-up assembly of colloidal PbSe nanocrystals. First, we show that the removal of the native organic ligands by thermal decomposition in an inert atmosphere leaves relatively large amounts of carbon at the crystal interfaces. This carbon blocks crystal growth during consolidation and at the same time hampers charge and heat transport through the final nanomaterial. Second, we demonstrate that, by stripping ligands from the nanocrystal surface before consolidation, nanomaterials with larger crystal domains, lower porosity, and higher charge carrier concentrations are obtained, thus resulting in nanomaterials with higher electrical and thermal conductivities. In addition, the ligand displacement leaves the nanocrystal surface unprotected, facilitating oxidation and chalcogen evaporation. The influence of the ligand displacement on the nanomaterial charge transport properties is rationalized here using a two-band model based on the standard Boltzmann transport equation with the relaxation time approximation. Finally, we present an application of the produced functional nanomaterials by modeling, fabricating, and testing a simple PbSe-based thermoelectric device with a ring geometry.","lang":"eng"}],"department":[{"_id":"MaIb"}],"date_updated":"2026-07-28T12:54:00Z","external_id":{"isi":["000526598300012"]},"isi":1,"ddc":["540"],"publication":"ACS Applied Energy Materials","day":"01","ec_funded":1,"acknowledgement":"This work was supported by the Spanish Ministerio de Economía y Competitividad through the project SEHTOP (ENE2016-77798-C4-3-R) and the Generalitat de Catalunya through the project 2017SGR1246. D.C. acknowledges support from Universidad Nacional de Colombia. Y.L. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement no. 754411. M.I. acknowledges financial support from IST Austria.","date_created":"2020-02-09T23:00:52Z","scopus_import":"1","OA_type":"green","file":[{"file_size":6423548,"content_type":"application/pdf","date_updated":"2022-08-23T08:34:17Z","file_name":"2020_ACSAppliedEnergyMat_Cadavid.pdf","access_level":"open_access","success":1,"creator":"dernst","file_id":"11942","relation":"main_file","date_created":"2022-08-23T08:34:17Z","checksum":"f23be731a766a480c77c962c1380315c"}],"volume":3,"article_processing_charge":"No","month":"03","page":"2120-2129","title":"Influence of the ligand stripping on the transport properties of nanoparticle-based PbSe nanomaterials","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"intvolume":"         3","type":"journal_article","status":"public","file_date_updated":"2022-08-23T08:34:17Z","year":"2020","publication_status":"published","quality_controlled":"1","oa":1,"article_type":"original","has_accepted_license":"1","publication_identifier":{"eissn":["2574-0962"]},"doi":"10.1021/acsaem.9b02137","_id":"7467"},{"ddc":["580"],"abstract":[{"text":"The plant hormone auxin plays indispensable roles in plant growth and development. An essential level of regulation in auxin action is the directional auxin transport within cells. The establishment of auxin gradient in plant tissue has been attributed to local auxin biosynthesis and directional intercellular auxin transport, which both are controlled by various environmental and developmental signals. It is well established that asymmetric auxin distribution in cells is achieved by polarly localized PIN-FORMED (PIN) auxin efflux transporters. Despite the initial insights into cellular mechanisms of PIN polarization obtained from the last decades, the molecular mechanism and specific regulators mediating PIN polarization remains elusive. In this thesis, we aim to find novel players in PIN subcellular polarity regulation during Arabidopsis development. We first characterize the physiological effect of piperonylic acid (PA) on Arabidopsis hypocotyl gravitropic bending and PIN polarization. Secondly, we reveal the importance of SCFTIR1/AFB auxin signaling pathway in shoot gravitropism bending termination. In addition, we also explore the role of myosin XI complex, and actin cytoskeleton in auxin feedback regulation on PIN polarity. In Chapter 1, we give an overview of the current knowledge about PIN-mediated auxin fluxes in various plant tropic responses. In Chapter 2, we study the physiological effect of PA on shoot gravitropic bending. Our results show that PA treatment inhibits auxin-mediated PIN3 repolarization by interfering with PINOID and PIN3 phosphorylation status, ultimately leading to hyperbending hypocotyls. In Chapter 3, we provide evidence to show that the SCFTIR1/AFB nuclear auxin signaling pathway is crucial and required for auxin-mediated PIN3 repolarization and shoot gravitropic bending termination. In Chapter 4, we perform a phosphoproteomics approach and identify the motor protein Myosin XI and its binding protein, the MadB2 family, as an essential regulator of PIN polarity for auxin-canalization related developmental processes. In Chapter 5, we demonstrate the vital role of actin cytoskeleton in auxin feedback on PIN polarity by regulating PIN subcellular trafficking. Overall, the data presented in this PhD thesis brings novel insights into the PIN polar localization regulation that resulted in the (re)establishment of the polar auxin flow and gradient in response to environmental stimuli during plant development.","lang":"eng"}],"supervisor":[{"first_name":"Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří"}],"date_updated":"2026-07-28T12:51:58Z","department":[{"_id":"JiFr"}],"date_published":"2020-09-30T00:00:00Z","related_material":{"record":[{"id":"7643","relation":"part_of_dissertation","status":"public"}]},"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","language":[{"iso":"eng"}],"oa_version":"Published Version","citation":{"chicago":"Han, Huibin. “Novel Insights into PIN Polarity Regulation during Arabidopsis Development.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8589\">https://doi.org/10.15479/AT:ISTA:8589</a>.","ieee":"H. Han, “Novel insights into PIN polarity regulation during Arabidopsis development,” Institute of Science and Technology Austria, 2020.","mla":"Han, Huibin. <i>Novel Insights into PIN Polarity Regulation during Arabidopsis Development</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8589\">10.15479/AT:ISTA:8589</a>.","ista":"Han H. 2020. Novel insights into PIN polarity regulation during Arabidopsis development. Institute of Science and Technology Austria.","apa":"Han, H. (2020). <i>Novel insights into PIN polarity regulation during Arabidopsis development</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8589\">https://doi.org/10.15479/AT:ISTA:8589</a>","short":"H. Han, Novel Insights into PIN Polarity Regulation during Arabidopsis Development, Institute of Science and Technology Austria, 2020.","ama":"Han H. Novel insights into PIN polarity regulation during Arabidopsis development. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8589\">10.15479/AT:ISTA:8589</a>"},"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"corr_author":"1","author":[{"full_name":"Han, Huibin","last_name":"Han","first_name":"Huibin","id":"31435098-F248-11E8-B48F-1D18A9856A87"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","_id":"8589","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:8589","oa":1,"has_accepted_license":"1","file_date_updated":"2021-10-01T13:33:02Z","year":"2020","publication_status":"published","type":"dissertation","status":"public","alternative_title":["ISTA Thesis"],"title":"Novel insights into PIN polarity regulation during Arabidopsis development","page":"164","file":[{"file_size":49198118,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2020-09-30T14:50:20Z","file_name":"2020_Han_Thesis.docx","access_level":"closed","relation":"source_file","file_id":"8590","creator":"dernst","date_created":"2020-09-30T14:50:20Z","checksum":"c4bda1947d4c09c428ac9ce667b02327"},{"content_type":"application/pdf","date_updated":"2021-10-01T13:33:02Z","file_size":15513963,"file_name":"2020_Han_Thesis.pdf","access_level":"open_access","checksum":"3f4f5d1718c2230adf30639ecaf8a00b","date_created":"2020-09-30T14:49:59Z","file_id":"8591","creator":"dernst","relation":"main_file"}],"month":"09","article_processing_charge":"No","day":"30","date_created":"2020-09-30T14:50:51Z","OA_place":"publisher","acknowledgement":"I also want to thank the China Scholarship Council for supporting my study during the year from 2015 to 2019. I also want to thank IST facilities – the Bioimaging facility, the media kitchen, the plant facility and all of the campus services, for their support."},{"citation":{"apa":"Chakraborty, S., Dziembowski, S., &#38; Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs. In <i>Advances in Cryptology – CRYPTO 2020</i> (Vol. 12171, pp. 732–762). Santa Barbara, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">https://doi.org/10.1007/978-3-030-56880-1_26</a>","ama":"Chakraborty S, Dziembowski S, Nielsen JB. Reverse firewalls for actively secure MPCs. In: <i>Advances in Cryptology – CRYPTO 2020</i>. Vol 12171. Springer Nature; 2020:732-762. doi:<a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">10.1007/978-3-030-56880-1_26</a>","short":"S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology – CRYPTO 2020, Springer Nature, 2020, pp. 732–762.","chicago":"Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.” In <i>Advances in Cryptology – CRYPTO 2020</i>, 12171:732–62. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">https://doi.org/10.1007/978-3-030-56880-1_26</a>.","ieee":"S. Chakraborty, S. Dziembowski, and J. B. Nielsen, “Reverse firewalls for actively secure MPCs,” in <i>Advances in Cryptology – CRYPTO 2020</i>, Santa Barbara, CA, United States, 2020, vol. 12171, pp. 732–762.","mla":"Chakraborty, Suvradip, et al. “Reverse Firewalls for Actively Secure MPCs.” <i>Advances in Cryptology – CRYPTO 2020</i>, vol. 12171, Springer Nature, 2020, pp. 732–62, doi:<a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">10.1007/978-3-030-56880-1_26</a>.","ista":"Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs. Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology Conference, LNCS, vol. 12171, 732–762."},"language":[{"iso":"eng"}],"oa_version":"Preprint","author":[{"full_name":"Chakraborty, Suvradip","id":"B9CD0494-D033-11E9-B219-A439E6697425","last_name":"Chakraborty","first_name":"Suvradip"},{"last_name":"Dziembowski","first_name":"Stefan","full_name":"Dziembowski, Stefan"},{"full_name":"Nielsen, Jesper Buus","last_name":"Nielsen","first_name":"Jesper Buus"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz, as a method for protecting cryptographic protocols against attacks on the devices of the honest parties. In a nutshell: a reverse firewall is placed outside of a device and its goal is to “sanitize” the messages sent by it, in such a way that a malicious device cannot leak its secrets to the outside world. It is typically assumed that the cryptographic devices are attacked in a “functionality-preserving way” (i.e. informally speaking, the functionality of the protocol remains unchanged under this attacks). In their paper, Mironov and Stephens-Davidowitz construct a protocol for passively-secure two-party computations with firewalls, leaving extension of this result to stronger models as an open question.\r\nIn this paper, we address this problem by constructing a protocol for secure computation with firewalls that has two main advantages over the original protocol from Eurocrypt 2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary number n of the parties, and not just for 2). Secondly, it is secure in much stronger corruption settings, namely in the active corruption model. More precisely: we consider an adversary that can fully corrupt up to 𝑛−1 parties, while the remaining parties are corrupt in a functionality-preserving way.\r\nOur core techniques are: malleable commitments and malleable non-interactive zero-knowledge, which in particular allow us to create a novel protocol for multiparty augmented coin-tossing into the well with reverse firewalls (that is based on a protocol of Lindell from Crypto 2001)."}],"date_updated":"2026-07-28T12:45:44Z","department":[{"_id":"KrPi"}],"isi":1,"external_id":{"isi":["001415325700026"],"cryptoeprintid":["2019/1317"]},"cryptoeprintid":1,"publisher":"Springer Nature","conference":{"name":"CRYPTO: Annual International Cryptology Conference","end_date":"2020-08-21","location":"Santa Barbara, CA, United States","start_date":"2020-08-17"},"date_published":"2020-08-10T00:00:00Z","volume":12171,"month":"08","article_processing_charge":"No","title":"Reverse firewalls for actively secure MPCs","page":"732-762","intvolume":"     12171","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"publication":"Advances in Cryptology – CRYPTO 2020","day":"10","scopus_import":"1","OA_type":"green","date_created":"2020-08-30T22:01:12Z","ec_funded":1,"OA_place":"repository","acknowledgement":"We would like to thank the anonymous reviewers for their helpful comments and suggestions. The work was initiated while the first author was in IIT Madras, India. Part of this work was done while the author was visiting the University of Warsaw. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT) and from the Foundation for Polish Science under grant TEAM/2016-1/4 founded within the UE 2014–2020 Smart Growth Operational Program. The last author was supported by the Independent Research Fund Denmark project BETHE and the Concordium Blockchain Research Center, Aarhus University, Denmark.","oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2019/1317","open_access":"1"}],"_id":"8322","publication_identifier":{"isbn":["9783030568795"],"issn":["0302-9743"],"eissn":["1611-3349"]},"doi":"10.1007/978-3-030-56880-1_26","alternative_title":["LNCS"],"year":"2020","publication_status":"published","type":"conference","status":"public","quality_controlled":"1"},{"author":[{"first_name":"Trevor A","last_name":"Brown","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A"},{"full_name":"Prokopec, Aleksandar","last_name":"Prokopec","first_name":"Aleksandar"},{"last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"oa_version":"Published Version","citation":{"ista":"Brown TA, Prokopec A, Alistarh D-A. 2020. Non-blocking interpolation search trees with doubly-logarithmic running time. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPOPP: Principles and Practice of Parallel Programming, 276–291.","mla":"Brown, Trevor A., et al. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” <i>Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, Association for Computing Machinery, 2020, pp. 276–91, doi:<a href=\"https://doi.org/10.1145/3332466.3374542\">10.1145/3332466.3374542</a>.","chicago":"Brown, Trevor A, Aleksandar Prokopec, and Dan-Adrian Alistarh. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” In <i>Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, 276–91. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3332466.3374542\">https://doi.org/10.1145/3332466.3374542</a>.","ieee":"T. A. Brown, A. Prokopec, and D.-A. Alistarh, “Non-blocking interpolation search trees with doubly-logarithmic running time,” in <i>Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>, San Diego, CA, United States, 2020, pp. 276–291.","apa":"Brown, T. A., Prokopec, A., &#38; Alistarh, D.-A. (2020). Non-blocking interpolation search trees with doubly-logarithmic running time. In <i>Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i> (pp. 276–291). San Diego, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3332466.3374542\">https://doi.org/10.1145/3332466.3374542</a>","short":"T.A. Brown, A. Prokopec, D.-A. Alistarh, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–291.","ama":"Brown TA, Prokopec A, Alistarh D-A. Non-blocking interpolation search trees with doubly-logarithmic running time. In: <i>Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</i>. Association for Computing Machinery; 2020:276-291. doi:<a href=\"https://doi.org/10.1145/3332466.3374542\">10.1145/3332466.3374542</a>"},"date_published":"2020-02-19T00:00:00Z","publisher":"Association for Computing Machinery","conference":{"end_date":"2020-02-26","name":"PPOPP: Principles and Practice of Parallel Programming","location":"San Diego, CA, United States","start_date":"2020-02-22"},"ddc":["000"],"isi":1,"external_id":{"isi":["000564476500020"]},"abstract":[{"text":"Balanced search trees typically use key comparisons to guide their operations, and achieve logarithmic running time. By relying on numerical properties of the keys, interpolation search achieves lower search complexity and better performance. Although interpolation-based data structures were investigated in the past, their non-blocking concurrent variants have received very little attention so far.\r\nIn this paper, we propose the first non-blocking implementation of the classic interpolation search tree (IST) data structure. For arbitrary key distributions, the data structure ensures worst-case O(log n + p) amortized time for search, insertion and deletion traversals. When the input key distributions are smooth, lookups run in expected O(log log n + p) time, and insertion and deletion run in expected amortized O(log log n + p) time, where p is a bound on the number of threads. To improve the scalability of concurrent insertion and deletion, we propose a novel parallel rebuilding technique, which should be of independent interest.\r\nWe evaluate whether the theoretical improvements translate to practice by implementing the concurrent interpolation search tree, and benchmarking it on uniform and nonuniform key distributions, for dataset sizes in the millions to billions of keys. Relative to the state-of-the-art concurrent data structures, the concurrent interpolation search tree achieves performance improvements of up to 15% under high update rates, and of up to 50% under moderate update rates. Further, ISTs exhibit up to 2X less cache-misses, and consume 1.2 -- 2.6X less memory compared to the next best alternative on typical dataset sizes. We find that the results are surprisingly robust to distributional skew, which suggests that our data structure can be a promising alternative to classic concurrent search structures.","lang":"eng"}],"date_updated":"2026-07-28T12:49:59Z","department":[{"_id":"DaAl"}],"day":"19","OA_type":"free access","scopus_import":"1","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union Horizon 2020 research and innovation program, grant agreement No 805223, ERC Starting Grant ScaleML. We acknowledge the support of the Natural Sciences and\r\nEngineering Research Council of Canada (NSERC). ","date_created":"2020-04-05T22:00:49Z","ec_funded":1,"OA_place":"publisher","publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","page":"276-291","title":"Non-blocking interpolation search trees with doubly-logarithmic running time","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"month":"02","article_processing_charge":"No","publication_status":"published","year":"2020","status":"public","type":"conference","quality_controlled":"1","_id":"7636","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3332466.3374542"}],"publication_identifier":{"isbn":["9781450368186"]},"doi":"10.1145/3332466.3374542","oa":1},{"corr_author":"1","acknowledged_ssus":[{"_id":"M-Shop"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Käfer, Karola","id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","last_name":"Käfer","first_name":"Karola"},{"id":"30BD0376-F248-11E8-B48F-1D18A9856A87","last_name":"Nardin","first_name":"Michele","full_name":"Nardin, Michele","orcid":"0000-0001-8849-6570"},{"full_name":"Blahna, Karel","id":"3EA859AE-F248-11E8-B48F-1D18A9856A87","last_name":"Blahna","first_name":"Karel"},{"last_name":"Csicsvari","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036"}],"language":[{"iso":"eng"}],"oa_version":"Published Version","citation":{"short":"K. Käfer, M. Nardin, K. Blahna, J.L. Csicsvari, Neuron 106 (2020) P154–165.e6.","ama":"Käfer K, Nardin M, Blahna K, Csicsvari JL. Replay of behavioral sequences in the medial prefrontal cortex during rule switching. <i>Neuron</i>. 2020;106(1):P154-165.e6. doi:<a href=\"https://doi.org/10.1016/j.neuron.2020.01.015\">10.1016/j.neuron.2020.01.015</a>","apa":"Käfer, K., Nardin, M., Blahna, K., &#38; Csicsvari, J. L. (2020). Replay of behavioral sequences in the medial prefrontal cortex during rule switching. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2020.01.015\">https://doi.org/10.1016/j.neuron.2020.01.015</a>","ista":"Käfer K, Nardin M, Blahna K, Csicsvari JL. 2020. Replay of behavioral sequences in the medial prefrontal cortex during rule switching. Neuron. 106(1), P154–165.e6.","mla":"Käfer, Karola, et al. “Replay of Behavioral Sequences in the Medial Prefrontal Cortex during Rule Switching.” <i>Neuron</i>, vol. 106, no. 1, Elsevier, 2020, p. P154–165.e6, doi:<a href=\"https://doi.org/10.1016/j.neuron.2020.01.015\">10.1016/j.neuron.2020.01.015</a>.","ieee":"K. Käfer, M. Nardin, K. Blahna, and J. L. Csicsvari, “Replay of behavioral sequences in the medial prefrontal cortex during rule switching,” <i>Neuron</i>, vol. 106, no. 1. Elsevier, p. P154–165.e6, 2020.","chicago":"Käfer, Karola, Michele Nardin, Karel Blahna, and Jozsef L Csicsvari. “Replay of Behavioral Sequences in the Medial Prefrontal Cortex during Rule Switching.” <i>Neuron</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.neuron.2020.01.015\">https://doi.org/10.1016/j.neuron.2020.01.015</a>."},"date_published":"2020-04-08T00:00:00Z","issue":"1","publisher":"Elsevier","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/this-brain-area-helps-us-decide/"}]},"ddc":["570"],"isi":1,"external_id":{"isi":["000525319300016"],"pmid":["32032512"]},"date_updated":"2026-07-28T12:55:10Z","department":[{"_id":"JoCs"}],"abstract":[{"text":"Temporally organized reactivation of experiences during awake immobility periods is thought to underlie cognitive processes like planning and evaluation. While replay of trajectories is well established for the hippocampus, it is unclear whether the medial prefrontal cortex (mPFC) can reactivate sequential behavioral experiences in the awake state to support task execution. We simultaneously recorded from hippocampal and mPFC principal neurons in rats performing a mPFC-dependent rule-switching task on a plus maze. We found that mPFC neuronal activity encoded relative positions between the start and goal. During awake immobility periods, the mPFC replayed temporally organized sequences of these generalized positions, resembling entire spatial trajectories. The occurrence of mPFC trajectory replay positively correlated with rule-switching performance. However, hippocampal and mPFC trajectory replay occurred independently, indicating different functions. These results demonstrate that the mPFC can replay ordered activity patterns representing generalized locations and suggest that mPFC replay might have a role in flexible behavior.","lang":"eng"}],"OA_type":"free access","scopus_import":"1","date_created":"2020-02-10T15:45:48Z","ec_funded":1,"OA_place":"publisher","acknowledgement":"We thank Todor Asenov and Thomas Menner from the Machine Shop for the drive design and production, Hugo Malagon-Vina for assistance in maze automatization, Jago Wallenschus for taking the images of the histology, and Federico Stella and Juan Felipe Ramirez-Villegas for comments on an earlier version of the manuscript. This work was supported by the EU-FP7 MC-ITN IN-SENS (grant 607616 ).","pmid":1,"day":"08","publication":"Neuron","intvolume":"       106","project":[{"_id":"257BBB4C-B435-11E9-9278-68D0E5697425","name":"inter-and intracellular signalling in schizophrenia","grant_number":"607616","call_identifier":"FP7"}],"title":"Replay of behavioral sequences in the medial prefrontal cortex during rule switching","page":"P154-165.e6","article_processing_charge":"No","month":"04","volume":106,"quality_controlled":"1","publication_status":"published","year":"2020","status":"public","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.neuron.2020.01.015"}],"_id":"7472","doi":"10.1016/j.neuron.2020.01.015","publication_identifier":{"issn":["0896-6273"]},"article_type":"original","oa":1},{"citation":{"ista":"Han H, Rakusova H, Verstraeten I, Zhang Y, Friml J. 2020. SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism. Plant Physiology. 183(5), 37–40.","mla":"Han, Huibin, et al. “SCF TIR1/AFB Auxin Signaling for Bending Termination during Shoot Gravitropism.” <i>Plant Physiology</i>, vol. 183, no. 5, American Society of Plant Biologists, 2020, pp. 37–40, doi:<a href=\"https://doi.org/10.1104/pp.20.00212\">10.1104/pp.20.00212</a>.","ieee":"H. Han, H. Rakusova, I. Verstraeten, Y. Zhang, and J. Friml, “SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism,” <i>Plant Physiology</i>, vol. 183, no. 5. American Society of Plant Biologists, pp. 37–40, 2020.","chicago":"Han, Huibin, Hana Rakusova, Inge Verstraeten, Yuzhou Zhang, and Jiří Friml. “SCF TIR1/AFB Auxin Signaling for Bending Termination during Shoot Gravitropism.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2020. <a href=\"https://doi.org/10.1104/pp.20.00212\">https://doi.org/10.1104/pp.20.00212</a>.","short":"H. Han, H. Rakusova, I. Verstraeten, Y. Zhang, J. Friml, Plant Physiology 183 (2020) 37–40.","ama":"Han H, Rakusova H, Verstraeten I, Zhang Y, Friml J. SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism. <i>Plant Physiology</i>. 2020;183(5):37-40. doi:<a href=\"https://doi.org/10.1104/pp.20.00212\">10.1104/pp.20.00212</a>","apa":"Han, H., Rakusova, H., Verstraeten, I., Zhang, Y., &#38; Friml, J. (2020). SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.20.00212\">https://doi.org/10.1104/pp.20.00212</a>"},"oa_version":"Published Version","language":[{"iso":"eng"}],"author":[{"full_name":"Han, Huibin","id":"31435098-F248-11E8-B48F-1D18A9856A87","first_name":"Huibin","last_name":"Han"},{"full_name":"Rakusova, Hana","last_name":"Rakusova","first_name":"Hana","id":"4CAAA450-78D2-11EA-8E57-B40A396E08BA"},{"last_name":"Verstraeten","first_name":"Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","full_name":"Verstraeten, Inge","orcid":"0000-0001-7241-2328"},{"first_name":"Yuzhou","last_name":"Zhang","id":"3B6137F2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2627-6956","full_name":"Zhang, Yuzhou"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","last_name":"Friml","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","department":[{"_id":"JiFr"}],"date_updated":"2026-07-28T12:51:59Z","isi":1,"external_id":{"pmid":["32107280"],"isi":["000536641800018"]},"ddc":["580"],"publisher":"American Society of Plant Biologists","related_material":{"record":[{"id":"8589","status":"public","relation":"dissertation_contains"}]},"issue":"5","date_published":"2020-05-08T00:00:00Z","volume":183,"article_processing_charge":"No","month":"05","page":"37-40","title":"SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism","project":[{"grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425"},{"_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630","name":"Molecular mechanisms of endocytic cargo recognition in plants","call_identifier":"FWF"}],"intvolume":"       183","publication":"Plant Physiology","day":"08","pmid":1,"OA_place":"publisher","ec_funded":1,"date_created":"2020-04-06T10:06:40Z","acknowledgement":"This work was supported by the European Research Council under the European Union’s Horizon 2020 research and innovation Programme (ERC grant agreement number 742985), and the Austrian Science Fund (FWF, grant number I 3630-B25) to JF. HH is supported by the China Scholarship Council (CSC scholarship).  We thank Keiko U. Torii (University of Washington/Nagoya University), Mark Estelle (University of California San Diego), Ottoline Leyser (Sainsbury Laboratory, University of Cambridge), and Yunde Zhao (University of California San Diego) for sharing published genetic lines. We also thank Dr. Maciek Adamowski (Institute of Science and Technology Austria) for critical reading of the manuscript.","scopus_import":"1","OA_type":"free access","oa":1,"article_type":"letter_editor","doi":"10.1104/pp.20.00212","publication_identifier":{"issn":["0032-0889"],"eissn":["1532-2548"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1104/pp.20.00212"}],"_id":"7643","type":"journal_article","status":"public","year":"2020","publication_status":"published","quality_controlled":"1"},{"month":"07","article_processing_charge":"No","page":"31-40","title":"Long-lived snapshots with polylogarithmic amortized step complexity","publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","day":"31","date_created":"2020-09-13T22:01:17Z","scopus_import":"1","oa":1,"doi":"10.1145/3382734.3406005","publication_identifier":{"isbn":["9781450375825"]},"_id":"8382","main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-02860087/document","open_access":"1"}],"das_tickbox":"1","status":"public","type":"conference","year":"2020","publication_status":"published","quality_controlled":"1","citation":{"ama":"Baig MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic amortized step complexity. In: <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2020:31-40. doi:<a href=\"https://doi.org/10.1145/3382734.3406005\">10.1145/3382734.3406005</a>","short":"M.A. Baig, D. Hendler, A. Milani, C. Travers, in:, Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 31–40.","apa":"Baig, M. A., Hendler, D., Milani, A., &#38; Travers, C. (2020). Long-lived snapshots with polylogarithmic amortized step complexity. In <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i> (pp. 31–40). Virtual, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3382734.3406005\">https://doi.org/10.1145/3382734.3406005</a>","ieee":"M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived snapshots with polylogarithmic amortized step complexity,” in <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, Virtual, Italy, 2020, pp. 31–40.","chicago":"Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” In <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, 31–40. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3382734.3406005\">https://doi.org/10.1145/3382734.3406005</a>.","ista":"Baig MA, Hendler D, Milani A, Travers C. 2020. Long-lived snapshots with polylogarithmic amortized step complexity. Proceedings of the 39th Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 31–40.","mla":"Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” <i>Proceedings of the 39th Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2020, pp. 31–40, doi:<a href=\"https://doi.org/10.1145/3382734.3406005\">10.1145/3382734.3406005</a>."},"oa_version":"Preprint","language":[{"iso":"eng"}],"author":[{"id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","last_name":"Baig","first_name":"Mirza Ahad","full_name":"Baig, Mirza Ahad"},{"last_name":"Hendler","first_name":"Danny","full_name":"Hendler, Danny"},{"first_name":"Alessia","last_name":"Milani","full_name":"Milani, Alessia"},{"full_name":"Travers, Corentin","first_name":"Corentin","last_name":"Travers"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest.","lang":"eng"}],"department":[{"_id":"GradSch"}],"date_updated":"2026-07-28T09:50:30Z","external_id":{"isi":["001436693500004"]},"isi":1,"publisher":"Association for Computing Machinery","conference":{"end_date":"2020-08-07","name":"PODC: Principles of Distributed Computing","start_date":"2020-08-03","location":"Virtual, Italy"},"date_published":"2020-07-31T00:00:00Z"},{"type":"journal_article","status":"public","year":"2020","publication_status":"published","file_date_updated":"2020-07-14T12:47:46Z","quality_controlled":"1","oa":1,"article_type":"original","has_accepted_license":"1","publication_identifier":{"eissn":["1573-1405"],"issn":["0920-5691"]},"doi":"10.1007/s11263-019-01219-8","_id":"6952","publication":"International Journal of Computer Vision","day":"01","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","date_created":"2019-10-17T13:38:20Z","OA_place":"publisher","scopus_import":"1","OA_type":"hybrid","file":[{"file_name":"2019_CompVision_Henderson.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:46Z","file_size":2243134,"checksum":"a0f05dd4f5f64e4f713d8d9d4b5b1e3f","date_created":"2019-10-25T10:28:29Z","relation":"main_file","file_id":"6973","creator":"dernst","access_level":"open_access"}],"volume":128,"month":"04","article_processing_charge":"Yes (via OA deal)","page":"835-854","title":"Learning single-image 3D reconstruction by generative modelling of shape, pose and shading","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"intvolume":"       128","publisher":"Springer Nature","arxiv":1,"date_published":"2020-04-01T00:00:00Z","abstract":[{"text":"We present a unified framework tackling two problems: class-specific 3D reconstruction from a single image, and generation of new 3D shape samples. These tasks have received considerable attention recently; however, most existing approaches rely on 3D supervision, annotation of 2D images with keypoints or poses, and/or training with multiple views of each object instance. Our framework is very general: it can be trained in similar settings to existing approaches, while also supporting weaker supervision. Importantly, it can be trained purely from 2D images, without pose annotations, and with only a single view per instance. We employ meshes as an output representation, instead of voxels used in most prior work. This allows us to reason over lighting parameters and exploit shading information during training, which previous 2D-supervised methods cannot. Thus, our method can learn to generate and reconstruct concave object classes. We evaluate our approach in various settings, showing that: (i) it learns to disentangle shape from pose and lighting; (ii) using shading in the loss improves performance compared to just silhouettes; (iii) when using a standard single white light, our model outperforms state-of-the-art 2D-supervised methods, both with and without pose supervision, thanks to exploiting shading cues; (iv) performance improves further when using multiple coloured lights, even approaching that of state-of-the-art 3D-supervised methods; (v) shapes produced by our model capture smooth surfaces and fine details better than voxel-based approaches; and (vi) our approach supports concave classes such as bathtubs and sofas, which methods based on silhouettes cannot learn.","lang":"eng"}],"department":[{"_id":"ChLa"}],"date_updated":"2026-07-28T13:01:49Z","external_id":{"arxiv":["1901.06447"],"isi":["000491042100002"]},"isi":1,"ddc":["004"],"author":[{"orcid":"0000-0002-5198-7445","full_name":"Henderson, Paul M","last_name":"Henderson","first_name":"Paul M","id":"13C09E74-18D9-11E9-8878-32CFE5697425"},{"full_name":"Ferrari, Vittorio","last_name":"Ferrari","first_name":"Vittorio"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","citation":{"apa":"Henderson, P. M., &#38; Ferrari, V. (2020). Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. <i>International Journal of Computer Vision</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11263-019-01219-8\">https://doi.org/10.1007/s11263-019-01219-8</a>","ama":"Henderson PM, Ferrari V. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. <i>International Journal of Computer Vision</i>. 2020;128:835-854. doi:<a href=\"https://doi.org/10.1007/s11263-019-01219-8\">10.1007/s11263-019-01219-8</a>","short":"P.M. Henderson, V. Ferrari, International Journal of Computer Vision 128 (2020) 835–854.","mla":"Henderson, Paul M., and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” <i>International Journal of Computer Vision</i>, vol. 128, Springer Nature, 2020, pp. 835–54, doi:<a href=\"https://doi.org/10.1007/s11263-019-01219-8\">10.1007/s11263-019-01219-8</a>.","ista":"Henderson PM, Ferrari V. 2020. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. 128, 835–854.","chicago":"Henderson, Paul M, and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” <i>International Journal of Computer Vision</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s11263-019-01219-8\">https://doi.org/10.1007/s11263-019-01219-8</a>.","ieee":"P. M. Henderson and V. Ferrari, “Learning single-image 3D reconstruction by generative modelling of shape, pose and shading,” <i>International Journal of Computer Vision</i>, vol. 128. Springer Nature, pp. 835–854, 2020."},"oa_version":"Published Version","language":[{"iso":"eng"}]},{"intvolume":"        14","project":[{"call_identifier":"H2020","grant_number":"732894","name":"Hybrid Optomechanical Technologies","_id":"257EB838-B435-11E9-9278-68D0E5697425"},{"_id":"237CBA6C-32DE-11EA-91FC-C7463DDC885E","name":"Quantum readout techniques and technologies","grant_number":"862644","call_identifier":"H2020"},{"name":"A Fiber Optic Transceiver for Superconducting Qubits","grant_number":"758053","call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425"},{"grant_number":"F07105","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f"}],"title":"Surpassing the resistance quantum with a geometric superinductor","month":"10","article_processing_charge":"No","volume":14,"file":[{"file_size":2607823,"date_updated":"2021-03-29T11:43:20Z","content_type":"application/pdf","file_name":"2020_PhysReviewApplied_Peruzzo.pdf","access_level":"open_access","success":1,"relation":"main_file","creator":"dernst","file_id":"9300","date_created":"2021-03-29T11:43:20Z","checksum":"2a634abe75251ae7628cd54c8a4ce2e8"}],"scopus_import":"1","ec_funded":1,"date_created":"2020-11-15T23:01:17Z","acknowledgement":"The authors acknowledge the support from I. Prieto and the IST Nanofabrication Facility. This work was supported by IST Austria and a NOMIS foundation research grant and the Austrian Science Fund (FWF) through BeyondC (F71). MP is the recipient of a P¨ottinger scholarship at IST Austria. JMF acknowledges support from the European Union’s Horizon 2020 research and innovation programs under grant agreement No 732894 (FET Proactive HOT), 862644 (FET Open QUARTET), and the European Research Council under grant agreement\r\nnumber 758053 (ERC StG QUNNECT). ","day":"29","publication":"Physical Review Applied","_id":"8755","publication_identifier":{"eissn":["2331-7019"]},"doi":"10.1103/PhysRevApplied.14.044055","article_number":"044055","has_accepted_license":"1","article_type":"original","oa":1,"quality_controlled":"1","publication_status":"published","file_date_updated":"2021-03-29T11:43:20Z","year":"2020","type":"journal_article","status":"public","language":[{"iso":"eng"}],"oa_version":"Published Version","citation":{"mla":"Peruzzo, Matilda, et al. “Surpassing the Resistance Quantum with a Geometric Superinductor.” <i>Physical Review Applied</i>, vol. 14, no. 4, 044055, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.14.044055\">10.1103/PhysRevApplied.14.044055</a>.","ista":"Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. 2020. Surpassing the resistance quantum with a geometric superinductor. Physical Review Applied. 14(4), 044055.","ieee":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, and J. M. Fink, “Surpassing the resistance quantum with a geometric superinductor,” <i>Physical Review Applied</i>, vol. 14, no. 4. American Physical Society, 2020.","chicago":"Peruzzo, Matilda, Andrea Trioni, Farid Hassani, Martin Zemlicka, and Johannes M Fink. “Surpassing the Resistance Quantum with a Geometric Superinductor.” <i>Physical Review Applied</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/PhysRevApplied.14.044055\">https://doi.org/10.1103/PhysRevApplied.14.044055</a>.","short":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, J.M. Fink, Physical Review Applied 14 (2020).","ama":"Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. Surpassing the resistance quantum with a geometric superinductor. <i>Physical Review Applied</i>. 2020;14(4). doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.14.044055\">10.1103/PhysRevApplied.14.044055</a>","apa":"Peruzzo, M., Trioni, A., Hassani, F., Zemlicka, M., &#38; Fink, J. M. (2020). Surpassing the resistance quantum with a geometric superinductor. <i>Physical Review Applied</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevApplied.14.044055\">https://doi.org/10.1103/PhysRevApplied.14.044055</a>"},"acknowledged_ssus":[{"_id":"NanoFab"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3F920B30-F248-11E8-B48F-1D18A9856A87","first_name":"Matilda","last_name":"Peruzzo","full_name":"Peruzzo, Matilda","orcid":"0000-0002-3415-4628"},{"last_name":"Trioni","first_name":"Andrea","id":"42F71B44-F248-11E8-B48F-1D18A9856A87","full_name":"Trioni, Andrea"},{"full_name":"Hassani, Farid","orcid":"0000-0001-6937-5773","id":"2AED110C-F248-11E8-B48F-1D18A9856A87","first_name":"Farid","last_name":"Hassani"},{"first_name":"Martin","last_name":"Zemlicka","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","full_name":"Zemlicka, Martin","orcid":"0009-0005-0878-3032"},{"last_name":"Fink","first_name":"Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8112-028X","full_name":"Fink, Johannes M"}],"ddc":["530"],"external_id":{"arxiv":["2007.01644"],"isi":["000582797300003"]},"isi":1,"date_updated":"2026-07-29T13:12:09Z","department":[{"_id":"JoFi"}],"abstract":[{"lang":"eng","text":"The superconducting circuit community has recently discovered the promising potential of superinductors. These circuit elements have a characteristic impedance exceeding the resistance quantum RQ ≈ 6.45 kΩ which leads to a suppression of ground state charge fluctuations. Applications include the realization of hardware protected qubits for fault tolerant quantum computing, improved coupling to small dipole moment objects and defining a new quantum metrology standard for the ampere. In this work we refute the widespread notion that superinductors can only be implemented based on kinetic inductance, i.e. using disordered superconductors or Josephson junction arrays. We present modeling, fabrication and characterization of 104 planar aluminum coil resonators with a characteristic impedance up to 30.9 kΩ at 5.6 GHz and a capacitance down to ≤ 1 fF, with lowloss and a power handling reaching 108 intra-cavity photons. Geometric superinductors are free of uncontrolled tunneling events and offer high reproducibility, linearity and the ability to couple magnetically - properties that significantly broaden the scope of future quantum circuits. "}],"date_published":"2020-10-29T00:00:00Z","arxiv":1,"issue":"4","related_material":{"record":[{"id":"13070","status":"public","relation":"research_data"},{"id":"9920","relation":"dissertation_contains","status":"public"},{"id":"17133","status":"public","relation":"dissertation_contains"},{"id":"20371","relation":"dissertation_contains","status":"public"}]},"publisher":"American Physical Society"},{"citation":{"ieee":"L. Erdös, T. H. Krüger, and D. J. Schröder, “Cusp universality for random matrices I: Local law and the complex Hermitian case,” <i>Communications in Mathematical Physics</i>, vol. 378. Springer Nature, pp. 1203–1278, 2020.","chicago":"Erdös, László, Torben H Krüger, and Dominik J Schröder. “Cusp Universality for Random Matrices I: Local Law and the Complex Hermitian Case.” <i>Communications in Mathematical Physics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s00220-019-03657-4\">https://doi.org/10.1007/s00220-019-03657-4</a>.","ista":"Erdös L, Krüger TH, Schröder DJ. 2020. Cusp universality for random matrices I: Local law and the complex Hermitian case. Communications in Mathematical Physics. 378, 1203–1278.","mla":"Erdös, László, et al. “Cusp Universality for Random Matrices I: Local Law and the Complex Hermitian Case.” <i>Communications in Mathematical Physics</i>, vol. 378, Springer Nature, 2020, pp. 1203–78, doi:<a href=\"https://doi.org/10.1007/s00220-019-03657-4\">10.1007/s00220-019-03657-4</a>.","short":"L. Erdös, T.H. Krüger, D.J. Schröder, Communications in Mathematical Physics 378 (2020) 1203–1278.","ama":"Erdös L, Krüger TH, Schröder DJ. Cusp universality for random matrices I: Local law and the complex Hermitian case. <i>Communications in Mathematical Physics</i>. 2020;378:1203-1278. doi:<a href=\"https://doi.org/10.1007/s00220-019-03657-4\">10.1007/s00220-019-03657-4</a>","apa":"Erdös, L., Krüger, T. H., &#38; Schröder, D. J. (2020). Cusp universality for random matrices I: Local law and the complex Hermitian case. <i>Communications in Mathematical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00220-019-03657-4\">https://doi.org/10.1007/s00220-019-03657-4</a>"},"language":[{"iso":"eng"}],"oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László"},{"full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297","last_name":"Krüger","first_name":"Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","last_name":"Schröder","first_name":"Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-07-29T13:46:19Z","department":[{"_id":"LaEr"}],"abstract":[{"lang":"eng","text":"For complex Wigner-type matrices, i.e. Hermitian random matrices with independent, not necessarily identically distributed entries above the diagonal, we show that at any cusp singularity of the limiting eigenvalue distribution the local eigenvalue statistics are universal and form a Pearcey process. Since the density of states typically exhibits only square root or cubic root cusp singularities, our work complements previous results on the bulk and edge universality and it thus completes the resolution of the Wigner–Dyson–Mehta universality conjecture for the last remaining universality type in the complex Hermitian class. Our analysis holds not only for exact cusps, but approximate cusps as well, where an extended Pearcey process emerges. As a main technical ingredient we prove an optimal local law at the cusp for both symmetry classes. This result is also the key input in the companion paper (Cipolloni et al. in Pure Appl Anal, 2018. arXiv:1811.04055) where the cusp universality for real symmetric Wigner-type matrices is proven. The novel cusp fluctuation mechanism is also essential for the recent results on the spectral radius of non-Hermitian random matrices (Alt et al. in Spectral radius of random matrices with independent entries, 2019. arXiv:1907.13631), and the non-Hermitian edge universality (Cipolloni et al. in Edge universality for non-Hermitian random matrices, 2019. arXiv:1908.00969)."}],"ddc":["530","510"],"isi":1,"external_id":{"arxiv":["1809.03971"],"isi":["000529483000001"]},"related_material":{"record":[{"id":"6179","status":"public","relation":"dissertation_contains"}]},"publisher":"Springer Nature","date_published":"2020-09-01T00:00:00Z","arxiv":1,"month":"09","article_processing_charge":"Yes (via OA deal)","volume":378,"file":[{"date_updated":"2020-11-18T11:14:37Z","content_type":"application/pdf","file_size":2904574,"file_name":"2020_CommMathPhysics_Erdoes.pdf","success":1,"access_level":"open_access","checksum":"c3a683e2afdcea27afa6880b01e53dc2","date_created":"2020-11-18T11:14:37Z","relation":"main_file","creator":"dernst","file_id":"8771"}],"intvolume":"       378","project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"page":"1203-1278","title":"Cusp universality for random matrices I: Local law and the complex Hermitian case","publication":"Communications in Mathematical Physics","scopus_import":"1","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The authors are very grateful to Johannes Alt for numerous discussions on the Dyson equation and for his invaluable help in adjusting [10] to the needs of the present work.","ec_funded":1,"date_created":"2019-03-28T10:21:15Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"01","has_accepted_license":"1","article_type":"original","oa":1,"_id":"6185","publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"doi":"10.1007/s00220-019-03657-4","quality_controlled":"1","publication_status":"published","year":"2020","file_date_updated":"2020-11-18T11:14:37Z","status":"public","type":"journal_article"},{"external_id":{"arxiv":["1804.07744"],"isi":["000528269100013"]},"isi":1,"date_updated":"2026-07-29T13:46:19Z","department":[{"_id":"LaEr"}],"abstract":[{"text":"We prove edge universality for a general class of correlated real symmetric or complex Hermitian Wigner matrices with arbitrary expectation. Our theorem also applies to internal edges of the self-consistent density of states. In particular, we establish a strong form of band rigidity which excludes mismatches between location and label of eigenvalues close to internal edges in these general models.","lang":"eng"}],"date_published":"2020-03-01T00:00:00Z","arxiv":1,"issue":"2","related_material":{"record":[{"id":"149","status":"public","relation":"dissertation_contains"},{"id":"6179","relation":"dissertation_contains","status":"public"}]},"publisher":"Institute of Mathematical Statistics","language":[{"iso":"eng"}],"oa_version":"Preprint","citation":{"short":"J. Alt, L. Erdös, T.H. Krüger, D.J. Schröder, Annals of Probability 48 (2020) 963–1001.","ama":"Alt J, Erdös L, Krüger TH, Schröder DJ. Correlated random matrices: Band rigidity and edge universality. <i>Annals of Probability</i>. 2020;48(2):963-1001. doi:<a href=\"https://doi.org/10.1214/19-AOP1379\">10.1214/19-AOP1379</a>","apa":"Alt, J., Erdös, L., Krüger, T. H., &#38; Schröder, D. J. (2020). Correlated random matrices: Band rigidity and edge universality. <i>Annals of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/19-AOP1379\">https://doi.org/10.1214/19-AOP1379</a>","ieee":"J. Alt, L. Erdös, T. H. Krüger, and D. J. Schröder, “Correlated random matrices: Band rigidity and edge universality,” <i>Annals of Probability</i>, vol. 48, no. 2. Institute of Mathematical Statistics, pp. 963–1001, 2020.","chicago":"Alt, Johannes, László Erdös, Torben H Krüger, and Dominik J Schröder. “Correlated Random Matrices: Band Rigidity and Edge Universality.” <i>Annals of Probability</i>. Institute of Mathematical Statistics, 2020. <a href=\"https://doi.org/10.1214/19-AOP1379\">https://doi.org/10.1214/19-AOP1379</a>.","ista":"Alt J, Erdös L, Krüger TH, Schröder DJ. 2020. Correlated random matrices: Band rigidity and edge universality. Annals of Probability. 48(2), 963–1001.","mla":"Alt, Johannes, et al. “Correlated Random Matrices: Band Rigidity and Edge Universality.” <i>Annals of Probability</i>, vol. 48, no. 2, Institute of Mathematical Statistics, 2020, pp. 963–1001, doi:<a href=\"https://doi.org/10.1214/19-AOP1379\">10.1214/19-AOP1379</a>."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Alt, Johannes","first_name":"Johannes","last_name":"Alt","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"id":"3020C786-F248-11E8-B48F-1D18A9856A87","last_name":"Krüger","first_name":"Torben H","orcid":"0000-0002-4821-3297","full_name":"Krüger, Torben H"},{"last_name":"Schröder","first_name":"Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07744"}],"_id":"6184","doi":"10.1214/19-AOP1379","publication_identifier":{"issn":["0091-1798"]},"article_type":"original","oa":1,"quality_controlled":"1","year":"2020","publication_status":"published","type":"journal_article","status":"public","intvolume":"        48","project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"page":"963-1001","title":"Correlated random matrices: Band rigidity and edge universality","article_processing_charge":"No","month":"03","volume":48,"scopus_import":"1","date_created":"2019-03-28T09:20:08Z","ec_funded":1,"day":"01","publication":"Annals of Probability"},{"title":"Functional vs. parametric equivalence of ReLU networks","language":[{"iso":"eng"}],"oa_version":"Published Version","month":"04","article_processing_charge":"No","file":[{"file_id":"7482","creator":"bphuong","relation":"main_file","date_created":"2020-02-11T09:07:27Z","checksum":"8d372ea5defd8cb8fdc430111ed754a9","access_level":"open_access","file_name":"main.pdf","file_size":405469,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:59Z"}],"citation":{"short":"M. Phuong, C. Lampert, in:, 8th International Conference on Learning Representations, 2020.","ama":"Phuong M, Lampert C. Functional vs. parametric equivalence of ReLU networks. In: <i>8th International Conference on Learning Representations</i>. ; 2020.","apa":"Phuong, M., &#38; Lampert, C. (2020). Functional vs. parametric equivalence of ReLU networks. In <i>8th International Conference on Learning Representations</i>. Online.","ista":"Phuong M, Lampert C. 2020. Functional vs. parametric equivalence of ReLU networks. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","mla":"Phuong, Mary, and Christoph Lampert. “Functional vs. Parametric Equivalence of ReLU Networks.” <i>8th International Conference on Learning Representations</i>, 2020.","ieee":"M. Phuong and C. Lampert, “Functional vs. parametric equivalence of ReLU networks,” in <i>8th International Conference on Learning Representations</i>, Online, 2020.","chicago":"Phuong, Mary, and Christoph Lampert. “Functional vs. Parametric Equivalence of ReLU Networks.” In <i>8th International Conference on Learning Representations</i>, 2020."},"corr_author":"1","date_created":"2020-02-11T09:07:37Z","day":"26","publication":"8th International Conference on Learning Representations","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Bui Thi Mai, Phuong","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","last_name":"Bui Thi Mai","first_name":"Phuong"},{"last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887"}],"_id":"7481","ddc":["000"],"date_updated":"2026-07-30T05:33:51Z","has_accepted_license":"1","department":[{"_id":"ChLa"}],"abstract":[{"text":"We address the following question:  How redundant is the parameterisation of ReLU networks? Specifically, we consider transformations of the weight space which leave the function implemented by the network intact.  Two such transformations are known for feed-forward architectures:  permutation of neurons within a layer, and positive scaling of all incoming weights of a neuron coupled with inverse scaling of its outgoing weights. In this work, we show for architectures with non-increasing widths that permutation and scaling are in fact the only function-preserving weight transformations.  For any eligible architecture we give an explicit construction of a neural network such that any other network that implements the same function can be obtained from the original one by the application of permutations and rescaling.  The proof relies on a geometric understanding of boundaries between linear regions of ReLU networks, and we hope the developed mathematical tools are of independent interest.","lang":"eng"}],"oa":1,"quality_controlled":"1","date_published":"2020-04-26T00:00:00Z","file_date_updated":"2020-07-14T12:47:59Z","publication_status":"published","year":"2020","type":"conference","status":"public","conference":{"end_date":"2020-04-30","name":"ICLR: International Conference on Learning Representations","start_date":"2020-04-27","location":"Online"},"related_material":{"record":[{"id":"9418","relation":"dissertation_contains","status":"public"}],"link":[{"relation":"supplementary_material","url":"https://iclr.cc/virtual_2020/poster_Bylx-TNKvH.html"}]}},{"department":[{"_id":"KrPi"},{"_id":"GradSch"}],"date_updated":"2026-07-30T13:43:53Z","supervisor":[{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"abstract":[{"text":"A search problem lies in the complexity class FNP if a solution to the given instance of the problem can be verified efficiently. The complexity class TFNP consists of all search problems in FNP that are total in the sense that a solution is guaranteed to exist. TFNP contains a host of interesting problems from fields such as algorithmic game theory, computational topology, number theory and combinatorics. Since TFNP is a semantic class, it is unlikely to have a complete problem. Instead, one studies its syntactic subclasses which are defined based on the combinatorial principle used to argue totality. Of particular interest is the subclass PPAD, which contains important problems\r\nlike computing Nash equilibrium for bimatrix games and computational counterparts of several fixed-point theorems as complete. In the thesis, we undertake the study of averagecase hardness of TFNP, and in particular its subclass PPAD.\r\nAlmost nothing was known about average-case hardness of PPAD before a series of recent results showed how to achieve it using a cryptographic primitive called program obfuscation.\r\nHowever, it is currently not known how to construct program obfuscation from standard cryptographic assumptions. Therefore, it is desirable to relax the assumption under which average-case hardness of PPAD can be shown. In the thesis we take a step in this direction. First, we show that assuming the (average-case) hardness of a numbertheoretic\r\nproblem related to factoring of integers, which we call Iterated-Squaring, PPAD is hard-on-average in the random-oracle model. Then we strengthen this result to show that the average-case hardness of PPAD reduces to the (adaptive) soundness of the Fiat-Shamir Transform, a well-known technique used to compile a public-coin interactive protocol into a non-interactive one. As a corollary, we obtain average-case hardness for PPAD in the random-oracle model assuming the worst-case hardness of #SAT. Moreover, the above results can all be strengthened to obtain average-case hardness for the class CLS ⊆ PPAD.\r\nOur main technical contribution is constructing incrementally-verifiable procedures for computing Iterated-Squaring and #SAT. By incrementally-verifiable, we mean that every intermediate state of the computation includes a proof of its correctness, and the proof can be updated and verified in polynomial time. Previous constructions of such procedures relied on strong, non-standard assumptions. Instead, we introduce a technique called recursive proof-merging to obtain the same from weaker assumptions. ","lang":"eng"}],"doi_confirm":"1","ddc":["000"],"degree_awarded":"PhD","related_material":{"record":[{"id":"6677","relation":"part_of_dissertation","status":"public"}]},"publisher":"Institute of Science and Technology Austria","date_published":"2020-05-25T00:00:00Z","citation":{"short":"C. Kamath Hosdurg, On the Average-Case Hardness of Total Search Problems, Institute of Science and Technology Austria, 2020.","ama":"Kamath Hosdurg C. On the average-case hardness of total search problems. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7896\">10.15479/AT:ISTA:7896</a>","apa":"Kamath Hosdurg, C. (2020). <i>On the average-case hardness of total search problems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7896\">https://doi.org/10.15479/AT:ISTA:7896</a>","mla":"Kamath Hosdurg, Chethan. <i>On the Average-Case Hardness of Total Search Problems</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7896\">10.15479/AT:ISTA:7896</a>.","ista":"Kamath Hosdurg C. 2020. On the average-case hardness of total search problems. Institute of Science and Technology Austria.","ieee":"C. Kamath Hosdurg, “On the average-case hardness of total search problems,” Institute of Science and Technology Austria, 2020.","chicago":"Kamath Hosdurg, Chethan. “On the Average-Case Hardness of Total Search Problems.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:7896\">https://doi.org/10.15479/AT:ISTA:7896</a>."},"oa_version":"Published Version","language":[{"iso":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"last_name":"Kamath Hosdurg","first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan","orcid":"0009-0006-6812-7317"}],"corr_author":"1","has_accepted_license":"1","oa":1,"doi":"10.15479/AT:ISTA:7896","publication_identifier":{"issn":["2663-337X"]},"_id":"7896","alternative_title":["ISTA Thesis"],"type":"dissertation","status":"public","file_date_updated":"2020-07-14T12:48:04Z","publication_status":"published","year":"2020","article_processing_charge":"No","month":"05","file":[{"date_created":"2020-05-26T14:08:13Z","checksum":"b39e2e1c376f5819b823fb7077491c64","file_id":"7897","creator":"dernst","relation":"main_file","access_level":"open_access","file_name":"2020_Thesis_Kamath.pdf","date_updated":"2020-07-14T12:48:04Z","content_type":"application/pdf","file_size":1622742},{"file_name":"Thesis_Kamath.zip","file_size":15301529,"content_type":"application/x-zip-compressed","date_updated":"2020-07-14T12:48:04Z","file_id":"7898","creator":"dernst","relation":"source_file","date_created":"2020-05-26T14:08:23Z","checksum":"8b26ba729c1a85ac6bea775f5d73cdc7","access_level":"closed"}],"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7"},{"call_identifier":"H2020","grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"title":"On the average-case hardness of total search problems","page":"126","date_created":"2020-05-26T14:08:55Z","OA_place":"publisher","ec_funded":1,"day":"25","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"article_type":"original","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1805.10715"}],"_id":"179","publication_identifier":{"issn":["0012-7094"]},"doi":"10.1215/00127094-2020-0031","das_tickbox":"0","quality_controlled":"1","supplementarymaterial":"no","publication_status":"published","year":"2020","status":"public","type":"journal_article","month":"09","article_processing_charge":"No","volume":169,"intvolume":"       169","title":"Density of rational points on a quadric bundle in ℙ3×ℙ3","page":"3099-3165","publication":"Duke Mathematical Journal","scopus_import":"1","date_created":"2018-12-11T11:45:02Z","day":"10","date_updated":"2026-08-06T11:22:52Z","department":[{"_id":"TiBr"}],"abstract":[{"text":"An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski dense subset of the biprojective hypersurface x1y21+⋯+x4y24=0 in ℙ3×ℙ3. This confirms the modified Manin conjecture for this variety, in which the removal of a thin set of rational points is allowed.","lang":"eng"}],"isi":1,"external_id":{"isi":["000582676300002"],"arxiv":["1805.10715"]},"issue":"16","publisher":"Duke University Press","date_published":"2020-09-10T00:00:00Z","arxiv":1,"citation":{"ista":"Browning TD, Heath Brown R. 2020. Density of rational points on a quadric bundle in ℙ3×ℙ3. Duke Mathematical Journal. 169(16), 3099–3165.","mla":"Browning, Timothy D., and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” <i>Duke Mathematical Journal</i>, vol. 169, no. 16, Duke University Press, 2020, pp. 3099–165, doi:<a href=\"https://doi.org/10.1215/00127094-2020-0031\">10.1215/00127094-2020-0031</a>.","chicago":"Browning, Timothy D, and Roger Heath Brown. “Density of Rational Points on a Quadric Bundle in ℙ3×ℙ3.” <i>Duke Mathematical Journal</i>. Duke University Press, 2020. <a href=\"https://doi.org/10.1215/00127094-2020-0031\">https://doi.org/10.1215/00127094-2020-0031</a>.","ieee":"T. D. Browning and R. Heath Brown, “Density of rational points on a quadric bundle in ℙ3×ℙ3,” <i>Duke Mathematical Journal</i>, vol. 169, no. 16. Duke University Press, pp. 3099–3165, 2020.","apa":"Browning, T. D., &#38; Heath Brown, R. (2020). Density of rational points on a quadric bundle in ℙ3×ℙ3. <i>Duke Mathematical Journal</i>. Duke University Press. <a href=\"https://doi.org/10.1215/00127094-2020-0031\">https://doi.org/10.1215/00127094-2020-0031</a>","ama":"Browning TD, Heath Brown R. Density of rational points on a quadric bundle in ℙ3×ℙ3. <i>Duke Mathematical Journal</i>. 2020;169(16):3099-3165. doi:<a href=\"https://doi.org/10.1215/00127094-2020-0031\">10.1215/00127094-2020-0031</a>","short":"T.D. Browning, R. Heath Brown, Duke Mathematical Journal 169 (2020) 3099–3165."},"language":[{"iso":"eng"}],"oa_version":"Preprint","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177"},{"first_name":"Roger","last_name":"Heath Brown","full_name":"Heath Brown, Roger"}],"researchdata_availability":"no"},{"oa":1,"article_type":"original","doi":"10.4007/annals.2020.191.3.4","_id":"177","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.10451"}],"das_tickbox":"0","status":"public","type":"journal_article","year":"2020","publication_status":"published","supplementarymaterial":"no","quality_controlled":"1","volume":191,"month":"05","article_processing_charge":"No","title":"A geometric version of the circle method","page":"893-948","intvolume":"       191","publication":"Annals of Mathematics","day":"01","date_created":"2018-12-11T11:45:02Z","scopus_import":"1","abstract":[{"text":"We develop a geometric version of the circle method and use it to compute the compactly supported cohomology of the space of rational curves through a point on a smooth affine hypersurface of sufficiently low degree.","lang":"eng"}],"department":[{"_id":"TiBr"}],"date_updated":"2026-08-06T11:15:18Z","external_id":{"isi":["000526986300004"],"arxiv":["1711.10451"]},"isi":1,"publisher":"Princeton University","issue":"3","arxiv":1,"date_published":"2020-05-01T00:00:00Z","citation":{"ieee":"T. D. Browning and W. Sawin, “A geometric version of the circle method,” <i>Annals of Mathematics</i>, vol. 191, no. 3. Princeton University, pp. 893–948, 2020.","chicago":"Browning, Timothy D, and Will Sawin. “A Geometric Version of the Circle Method.” <i>Annals of Mathematics</i>. Princeton University, 2020. <a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">https://doi.org/10.4007/annals.2020.191.3.4</a>.","mla":"Browning, Timothy D., and Will Sawin. “A Geometric Version of the Circle Method.” <i>Annals of Mathematics</i>, vol. 191, no. 3, Princeton University, 2020, pp. 893–948, doi:<a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">10.4007/annals.2020.191.3.4</a>.","ista":"Browning TD, Sawin W. 2020. A geometric version of the circle method. Annals of Mathematics. 191(3), 893–948.","short":"T.D. Browning, W. Sawin, Annals of Mathematics 191 (2020) 893–948.","ama":"Browning TD, Sawin W. A geometric version of the circle method. <i>Annals of Mathematics</i>. 2020;191(3):893-948. doi:<a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">10.4007/annals.2020.191.3.4</a>","apa":"Browning, T. D., &#38; Sawin, W. (2020). A geometric version of the circle method. <i>Annals of Mathematics</i>. Princeton University. <a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">https://doi.org/10.4007/annals.2020.191.3.4</a>"},"publist_id":"7744","oa_version":"Preprint","language":[{"iso":"eng"}],"author":[{"orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sawin, Will","first_name":"Will","last_name":"Sawin"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","researchdata_availability":"no"},{"article_type":"original","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1903.04046","open_access":"1"}],"_id":"14891","publication_identifier":{"eissn":["2578-5885"],"issn":["2578-5893"]},"doi":"10.2140/paa.2020.2.35","publication_status":"published","year":"2020","type":"journal_article","status":"public","quality_controlled":"1","volume":2,"month":"01","article_processing_charge":"No","title":"The local density approximation in density functional theory","page":"35-73","intvolume":"         2","publication":"Pure and Applied Analysis","day":"01","scopus_import":"1","date_created":"2024-01-28T23:01:44Z","abstract":[{"lang":"eng","text":"We give the first mathematically rigorous justification of the local density approximation in density functional theory. We provide a quantitative estimate on the difference between the grand-canonical Levy–Lieb energy of a given density (the lowest possible energy of all quantum states having this density) and the integral over the uniform electron gas energy of this density. The error involves gradient terms and justifies the use of the local density approximation in the situation where the density is very flat on sufficiently large regions in space."}],"date_updated":"2026-08-12T08:47:14Z","department":[{"_id":"RoSe"}],"external_id":{"arxiv":["1903.04046"]},"publisher":"Mathematical Sciences Publishers","issue":"1","arxiv":1,"date_published":"2020-01-01T00:00:00Z","citation":{"mla":"Lewin, Mathieu, et al. “The Local Density Approximation in Density Functional Theory.” <i>Pure and Applied Analysis</i>, vol. 2, no. 1, Mathematical Sciences Publishers, 2020, pp. 35–73, doi:<a href=\"https://doi.org/10.2140/paa.2020.2.35\">10.2140/paa.2020.2.35</a>.","ista":"Lewin M, Lieb EH, Seiringer R. 2020. The local density approximation in density functional theory. Pure and Applied Analysis. 2(1), 35–73.","chicago":"Lewin, Mathieu, Elliott H. Lieb, and Robert Seiringer. “The Local Density Approximation in Density Functional Theory.” <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers, 2020. <a href=\"https://doi.org/10.2140/paa.2020.2.35\">https://doi.org/10.2140/paa.2020.2.35</a>.","ieee":"M. Lewin, E. H. Lieb, and R. Seiringer, “The local density approximation in density functional theory,” <i>Pure and Applied Analysis</i>, vol. 2, no. 1. Mathematical Sciences Publishers, pp. 35–73, 2020.","apa":"Lewin, M., Lieb, E. H., &#38; Seiringer, R. (2020). The local density approximation in density functional theory. <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/paa.2020.2.35\">https://doi.org/10.2140/paa.2020.2.35</a>","short":"M. Lewin, E.H. Lieb, R. Seiringer, Pure and Applied Analysis 2 (2020) 35–73.","ama":"Lewin M, Lieb EH, Seiringer R. The local density approximation in density functional theory. <i>Pure and Applied Analysis</i>. 2020;2(1):35-73. doi:<a href=\"https://doi.org/10.2140/paa.2020.2.35\">10.2140/paa.2020.2.35</a>"},"language":[{"iso":"eng"}],"oa_version":"Preprint","author":[{"full_name":"Lewin, Mathieu","first_name":"Mathieu","last_name":"Lewin"},{"full_name":"Lieb, Elliott H.","last_name":"Lieb","first_name":"Elliott H."},{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1"},{"date_published":"2020-05-01T00:00:00Z","arxiv":1,"issue":"3","publisher":"Elsevier","isi":1,"external_id":{"arxiv":["1902.07635"],"isi":["000531049800007"]},"department":[{"_id":"JaMa"}],"date_updated":"2026-08-12T09:16:09Z","abstract":[{"lang":"eng","text":"We give a Wong-Zakai type characterisation of the solutions of quasilinear heat equations driven by space-time white noise in 1 + 1 dimensions. In order to show that the renormalisation counterterms are local in the solution, a careful arrangement of a few hundred terms is required. The main tool in this computation is a general ‘integration by parts’ formula that provides a number of linear identities for the renormalisation constants."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate","last_name":"Gerencser","full_name":"Gerencser, Mate"}],"oa_version":"Preprint","language":[{"iso":"eng"}],"citation":{"ama":"Gerencser M. Nondivergence form quasilinear heat equations driven by space-time white noise. <i>Annales de l’Institut Henri Poincaré C</i>. 2020;37(3):663-682. doi:<a href=\"https://doi.org/10.1016/j.anihpc.2020.01.003\">10.1016/j.anihpc.2020.01.003</a>","short":"M. Gerencser, Annales de l’Institut Henri Poincaré C 37 (2020) 663–682.","apa":"Gerencser, M. (2020). Nondivergence form quasilinear heat equations driven by space-time white noise. <i>Annales de l’Institut Henri Poincaré C</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.anihpc.2020.01.003\">https://doi.org/10.1016/j.anihpc.2020.01.003</a>","ista":"Gerencser M. 2020. Nondivergence form quasilinear heat equations driven by space-time white noise. Annales de l’Institut Henri Poincaré C. 37(3), 663–682.","mla":"Gerencser, Mate. “Nondivergence Form Quasilinear Heat Equations Driven by Space-Time White Noise.” <i>Annales de l’Institut Henri Poincaré C</i>, vol. 37, no. 3, Elsevier, 2020, pp. 663–82, doi:<a href=\"https://doi.org/10.1016/j.anihpc.2020.01.003\">10.1016/j.anihpc.2020.01.003</a>.","ieee":"M. Gerencser, “Nondivergence form quasilinear heat equations driven by space-time white noise,” <i>Annales de l’Institut Henri Poincaré C</i>, vol. 37, no. 3. Elsevier, pp. 663–682, 2020.","chicago":"Gerencser, Mate. “Nondivergence Form Quasilinear Heat Equations Driven by Space-Time White Noise.” <i>Annales de l’Institut Henri Poincaré C</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.anihpc.2020.01.003\">https://doi.org/10.1016/j.anihpc.2020.01.003</a>."},"quality_controlled":"1","status":"public","type":"journal_article","publication_status":"published","year":"2020","publication_identifier":{"issn":["0294-1449"]},"doi":"10.1016/j.anihpc.2020.01.003","_id":"7388","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.07635"}],"oa":1,"article_type":"original","date_created":"2020-01-29T09:39:41Z","scopus_import":"1","day":"01","publication":"Annales de l'Institut Henri Poincaré C","intvolume":"        37","title":"Nondivergence form quasilinear heat equations driven by space-time white noise","page":"663-682","article_processing_charge":"No","month":"05","volume":37},{"citation":{"short":"M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International Symposium on Information Theory, IEEE, 2020.","ama":"Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. Simplified successive cancellation decoding of polar codes has sublinear latency. In: <i>IEEE International Symposium on Information Theory</i>. Vol 2020-June. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">10.1109/ISIT44484.2020.9174141</a>","apa":"Mondelli, M., Hashemi, S. A., Cioffi, J., &#38; Goldsmith, A. (2020). Simplified successive cancellation decoding of polar codes has sublinear latency. In <i>IEEE International Symposium on Information Theory</i> (Vol. 2020–June). Los Angeles, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">https://doi.org/10.1109/ISIT44484.2020.9174141</a>","ieee":"M. Mondelli, S. A. Hashemi, J. Cioffi, and A. Goldsmith, “Simplified successive cancellation decoding of polar codes has sublinear latency,” in <i>IEEE International Symposium on Information Theory</i>, Los Angeles, CA, United States, 2020, vol. 2020–June.","chicago":"Mondelli, Marco, Seyyed Ali Hashemi, John Cioffi, and Andrea Goldsmith. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” In <i>IEEE International Symposium on Information Theory</i>, Vol. 2020–June. IEEE, 2020. <a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">https://doi.org/10.1109/ISIT44484.2020.9174141</a>.","ista":"Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. 2020. Simplified successive cancellation decoding of polar codes has sublinear latency. IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory vol. 2020–June, 401–406.","mla":"Mondelli, Marco, et al. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” <i>IEEE International Symposium on Information Theory</i>, vol. 2020–June, 401–406, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/ISIT44484.2020.9174141\">10.1109/ISIT44484.2020.9174141</a>."},"oa_version":"Preprint","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco"},{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"first_name":"John","last_name":"Cioffi","full_name":"Cioffi, John"},{"first_name":"Andrea","last_name":"Goldsmith","full_name":"Goldsmith, Andrea"}],"department":[{"_id":"MaMo"}],"date_updated":"2026-08-12T11:12:23Z","abstract":[{"text":"This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block length and µ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 and 1.","lang":"eng"}],"external_id":{"isi":["000714963400069"],"arxiv":["1909.04892"]},"isi":1,"conference":{"name":"ISIT: International Symposium on Information Theory","end_date":"2020-06-26","start_date":"2020-06-21","location":"Los Angeles, CA, United States"},"related_material":{"record":[{"status":"public","relation":"later_version","id":"9047"}]},"publisher":"IEEE","date_published":"2020-06-01T00:00:00Z","arxiv":1,"article_processing_charge":"No","month":"06","volume":"2020-June","title":"Simplified successive cancellation decoding of polar codes has sublinear latency","publication":"IEEE International Symposium on Information Theory","date_created":"2020-09-20T22:01:37Z","acknowledgement":"M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305, IIS-1741162 and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC) and by Huawei.","scopus_import":"1","day":"01","oa":1,"publication_identifier":{"isbn":["9781728164328"],"issn":["2157-8095"]},"doi":"10.1109/ISIT44484.2020.9174141","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.04892"}],"_id":"8536","article_number":"401-406","quality_controlled":"1","status":"public","type":"conference","publication_status":"published","year":"2020"}]