[{"alternative_title":["LIPIcs"],"author":[{"first_name":"Sebastian","last_name":"Brandt","full_name":"Brandt, Sebastian"},{"full_name":"Keller, Barbara","last_name":"Keller","first_name":"Barbara"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","full_name":"Rybicki, Joel","last_name":"Rybicki","first_name":"Joel","orcid":"0000-0002-6432-6646"},{"first_name":"Jukka","last_name":"Suomela","full_name":"Suomela, Jukka"},{"full_name":"Uitto, Jara","first_name":"Jara","last_name":"Uitto"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"9678"}]},"volume":179,"month":"10","year":"2020","file_date_updated":"2024-03-05T07:08:27Z","publication_status":"published","citation":{"chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” In <i>34th International Symposium on Distributed Computing</i>, Vol. 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">https://doi.org/10.4230/LIPIcs.DISC.2020.40</a>.","apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., &#38; Uitto, J. (2020). Brief announcement: Efficient load-balancing through distributed token dropping. In <i>34th International Symposium on Distributed Computing</i> (Vol. 179). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">https://doi.org/10.4230/LIPIcs.DISC.2020.40</a>","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Brief announcement: Efficient load-balancing through distributed token dropping. In: <i>34th International Symposium on Distributed Computing</i>. Vol 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">10.4230/LIPIcs.DISC.2020.40</a>","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2020. Brief announcement: Efficient load-balancing through distributed token dropping. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 179, 40.","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement: Efficient load-balancing through distributed token dropping,” in <i>34th International Symposium on Distributed Computing</i>, Virtual, 2020, vol. 179.","mla":"Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” <i>34th International Symposium on Distributed Computing</i>, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">10.4230/LIPIcs.DISC.2020.40</a>.","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"language":[{"iso":"eng"}],"scopus_import":"1","oa_version":"Published Version","publication":"34th International Symposium on Distributed Computing","date_created":"2024-03-05T07:09:12Z","type":"conference","corr_author":"1","abstract":[{"text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for the stable orientation problem, which is a special case of the more general locally optimal semi-matching problem. The prior work by Czygrinow et al. (DISC 2012) finds a locally optimal semi-matching in O(Δ⁵) rounds in graphs of maximum degree Δ, which directly implies an algorithm with the same runtime for stable orientations. We improve the runtime to O(Δ⁴) for stable orientations and prove a lower bound of Ω(Δ) rounds.","lang":"eng"}],"has_accepted_license":"1","status":"public","external_id":{"arxiv":["2005.07761"]},"intvolume":"       179","date_updated":"2026-07-07T06:21:32Z","ddc":["000"],"arxiv":1,"article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","short":"CC BY (3.0)"},"day":"07","department":[{"_id":"DaAl"}],"license":"https://creativecommons.org/licenses/by/3.0/","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"title":"Brief announcement: Efficient load-balancing through distributed token dropping","_id":"15074","date_published":"2020-10-07T00:00:00Z","quality_controlled":"1","article_number":"40","file":[{"success":1,"checksum":"23e2d9321aef53092dc1e24a8ab82d72","date_updated":"2024-03-05T07:08:27Z","file_name":"2020_LIPIcs_Brandt.pdf","file_id":"15075","file_size":303529,"date_created":"2024-03-05T07:08:27Z","content_type":"application/pdf","relation":"main_file","creator":"dernst","access_level":"open_access"}],"doi":"10.4230/LIPIcs.DISC.2020.40","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","conference":{"name":"DISC: Symposium on Distributed Computing","location":"Virtual","start_date":"2020-10-12","end_date":"2020-10-16"}},{"language":[{"iso":"eng"}],"citation":{"ieee":"M. Kurtz <i>et al.</i>, “Inducing and exploiting activation sparsity for fast neural network inference,” in <i>37th International Conference on Machine Learning</i>, Online, 2020, vol. 119, pp. 5533–5543.","ista":"Kurtz M, Kopinsky J, Gelashvili R, Matveev A, Carr J, Goin M, Leiserson W, Moore S, Nell B, Shavit N, Alistarh D-A. 2020. Inducing and exploiting activation sparsity for fast neural network inference. 37th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 119, 5533–5543.","ama":"Kurtz M, Kopinsky J, Gelashvili R, et al. Inducing and exploiting activation sparsity for fast neural network inference. In: <i>37th International Conference on Machine Learning</i>. Vol 119. ; 2020:5533-5543.","apa":"Kurtz, M., Kopinsky, J., Gelashvili, R., Matveev, A., Carr, J., Goin, M., … Alistarh, D.-A. (2020). Inducing and exploiting activation sparsity for fast neural network inference. In <i>37th International Conference on Machine Learning</i> (Vol. 119, pp. 5533–5543). Online.","short":"M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson, S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference on Machine Learning, 2020, pp. 5533–5543.","mla":"Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” <i>37th International Conference on Machine Learning</i>, vol. 119, 2020, pp. 5533–43.","chicago":"Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” In <i>37th International Conference on Machine Learning</i>, 119:5533–43, 2020."},"status":"public","has_accepted_license":"1","abstract":[{"text":"Optimizing convolutional neural networks for fast inference has recently become an extremely active area of research. One of the go-to solutions in this context is weight pruning, which aims to reduce computational and memory footprint by removing large subsets of the connections in a neural network. Surprisingly, much less attention has been given to exploiting sparsity in the activation maps, which tend to be naturally sparse in many settings thanks to the structure of rectified linear (ReLU) activation functions. In this paper, we present an in-depth analysis of methods for maximizing the sparsity of the activations in a trained neural network, and show that, when coupled with an efficient sparse-input convolution algorithm, we can leverage this sparsity for significant performance gains. To induce highly sparse activation maps without accuracy loss, we introduce a new regularization technique, coupled with a new threshold-based sparsification method based on a parameterized activation function called Forced-Activation-Threshold Rectified Linear Unit (FATReLU). We examine the impact of our methods on popular image classification models, showing that most architectures can adapt to significantly sparser activation maps without any accuracy loss. Our second contribution is showing that these these compression gains can be translated into inference speedups: we provide a new algorithm to enable fast convolution operations over networks with sparse activations, and show that it can enable significant speedups for end-to-end inference on a range of popular models on the large-scale ImageNet image classification task on modern Intel CPUs, with little or no retraining cost. ","lang":"eng"}],"type":"conference","oa_version":"Published Version","publication":"37th International Conference on Machine Learning","date_created":"2021-05-23T22:01:45Z","scopus_import":"1","ddc":["000"],"date_updated":"2026-07-07T13:42:32Z","intvolume":"       119","page":"5533-5543","author":[{"last_name":"Kurtz","first_name":"Mark","full_name":"Kurtz, Mark"},{"full_name":"Kopinsky, Justin","first_name":"Justin","last_name":"Kopinsky"},{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"},{"full_name":"Matveev, Alexander","first_name":"Alexander","last_name":"Matveev"},{"full_name":"Carr, John","last_name":"Carr","first_name":"John"},{"full_name":"Goin, Michael","first_name":"Michael","last_name":"Goin"},{"last_name":"Leiserson","first_name":"William","full_name":"Leiserson, William"},{"full_name":"Moore, Sage","first_name":"Sage","last_name":"Moore"},{"full_name":"Nell, Bill","last_name":"Nell","first_name":"Bill"},{"full_name":"Shavit, Nir","first_name":"Nir","last_name":"Shavit"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"}],"month":"07","volume":119,"file_date_updated":"2021-05-25T09:51:36Z","year":"2020","_id":"9415","date_published":"2020-07-12T00:00:00Z","quality_controlled":"1","das_tickbox":"1","file":[{"success":1,"checksum":"2aaaa7d7226e49161311d91627cf783b","file_id":"9421","file_name":"2020_PMLR_Kurtz.pdf","date_updated":"2021-05-25T09:51:36Z","file_size":741899,"date_created":"2021-05-25T09:51:36Z","content_type":"application/pdf","creator":"kschuh","relation":"main_file","access_level":"open_access"}],"conference":{"location":"Online","start_date":"2020-07-12","end_date":"2020-07-18","name":"ICML: International Conference on Machine Learning"},"publication_identifier":{"issn":["2640-3498"]},"article_processing_charge":"No","department":[{"_id":"DaAl"}],"day":"12","title":"Inducing and exploiting activation sparsity for fast neural network inference","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"oa":1,"title":"Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","department":[{"_id":"OnHo"}],"day":"24","researchdata_availability":"no","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"article_processing_charge":"No","publisher":"American Physical Society","acknowledgement":"This work is supported by the Office of Naval Research (N00014-16-1-2927- A00003), Vannevar Bush Faculty Fellowship (N00014-16-1-2812- P00005), Department of Energy (DE-SC0019174- 0001), and Defense Threat Reduction Agency (HDTRA1-15-1-0017- P00005).","doi":"10.1103/PhysRevLett.125.043202","isi":1,"das_tickbox":"0","article_number":"043202","quality_controlled":"1","_id":"8285","date_published":"2020-07-24T00:00:00Z","publication_status":"published","year":"2020","month":"07","issue":"4","volume":125,"author":[{"full_name":"Malia, Benjamin K.","first_name":"Benjamin K.","last_name":"Malia"},{"full_name":"Martínez-Rincón, Julián","first_name":"Julián","last_name":"Martínez-Rincón"},{"full_name":"Wu, Yunfan","first_name":"Yunfan","last_name":"Wu"},{"last_name":"Hosten","first_name":"Onur","orcid":"0000-0002-2031-204X","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","full_name":"Hosten, Onur"},{"first_name":"Mark A.","last_name":"Kasevich","full_name":"Kasevich, Mark A."}],"pmid":1,"date_updated":"2026-07-08T08:56:44Z","arxiv":1,"intvolume":"       125","abstract":[{"text":"We demonstrate the utility of optical cavity generated spin-squeezed states in free space atomic fountain clocks in ensembles of 390 000 87Rb atoms. Fluorescence imaging, correlated to an initial quantum nondemolition measurement, is used for population spectroscopy after the atoms are released from a confining lattice. For a free fall time of 4 milliseconds, we resolve a single-shot phase sensitivity of 814(61) microradians, which is 5.8(0.6) decibels (dB) below the quantum projection limit. We observe that this squeezing is preserved as the cloud expands to a roughly 200  μm radius and falls roughly 300  μm in free space. Ramsey spectroscopy with 240 000 atoms at a 3.6 ms Ramsey time results in a single-shot fractional frequency stability of 8.4(0.2)×10−12, 3.8(0.2) dB below the quantum projection limit. The sensitivity and stability are limited by the technical noise in the fluorescence detection protocol and the microwave system, respectively.","lang":"eng"}],"status":"public","external_id":{"arxiv":["1912.10218"],"pmid":["32794788"],"isi":["000552227400008"]},"publication":"Physical Review Letters","date_created":"2020-08-24T06:24:04Z","scopus_import":"1","oa_version":"Preprint","type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1912.10218","open_access":"1"}],"article_type":"original","citation":{"chicago":"Malia, Benjamin K., Julián Martínez-Rincón, Yunfan Wu, Onur Hosten, and Mark A. Kasevich. “Free Space Ramsey Spectroscopy in Rubidium with Noise below the Quantum Projection Limit.” <i>Physical Review Letters</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/PhysRevLett.125.043202\">https://doi.org/10.1103/PhysRevLett.125.043202</a>.","mla":"Malia, Benjamin K., et al. “Free Space Ramsey Spectroscopy in Rubidium with Noise below the Quantum Projection Limit.” <i>Physical Review Letters</i>, vol. 125, no. 4, 043202, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.125.043202\">10.1103/PhysRevLett.125.043202</a>.","short":"B.K. Malia, J. Martínez-Rincón, Y. Wu, O. Hosten, M.A. Kasevich, Physical Review Letters 125 (2020).","apa":"Malia, B. K., Martínez-Rincón, J., Wu, Y., Hosten, O., &#38; Kasevich, M. A. (2020). Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.125.043202\">https://doi.org/10.1103/PhysRevLett.125.043202</a>","ieee":"B. K. Malia, J. Martínez-Rincón, Y. Wu, O. Hosten, and M. A. Kasevich, “Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit,” <i>Physical Review Letters</i>, vol. 125, no. 4. American Physical Society, 2020.","ama":"Malia BK, Martínez-Rincón J, Wu Y, Hosten O, Kasevich MA. Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. <i>Physical Review Letters</i>. 2020;125(4). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.125.043202\">10.1103/PhysRevLett.125.043202</a>","ista":"Malia BK, Martínez-Rincón J, Wu Y, Hosten O, Kasevich MA. 2020. Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit. Physical Review Letters. 125(4), 043202."},"language":[{"iso":"eng"}],"supplementarymaterial":"yes"},{"author":[{"full_name":"Wu, Yunfan","first_name":"Yunfan","last_name":"Wu"},{"full_name":"Krishnakumar, Rajiv","last_name":"Krishnakumar","first_name":"Rajiv"},{"last_name":"Martínez-Rincón","first_name":"Julián","full_name":"Martínez-Rincón, Julián"},{"last_name":"Malia","first_name":"Benjamin K.","full_name":"Malia, Benjamin K."},{"full_name":"Hosten, Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","last_name":"Hosten","orcid":"0000-0002-2031-204X","first_name":"Onur"},{"last_name":"Kasevich","first_name":"Mark A.","full_name":"Kasevich, Mark A."}],"publication_status":"published","year":"2020","month":"07","issue":"1","volume":102,"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."}],"external_id":{"isi":["000555104200011"],"arxiv":["1912.08334"]},"status":"public","date_created":"2020-08-30T22:01:10Z","publication":"Physical Review A","scopus_import":"1","oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1912.08334","open_access":"1"}],"type":"journal_article","citation":{"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>.","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>.","short":"Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B.K. Malia, O. Hosten, M.A. Kasevich, Physical Review A 102 (2020).","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>","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>","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."},"article_type":"original","language":[{"iso":"eng"}],"supplementarymaterial":"no","date_updated":"2026-07-08T08:59:02Z","arxiv":1,"intvolume":"       102","publication_identifier":{"eissn":["2469-9934"],"issn":["2469-9926"]},"article_processing_charge":"No","oa":1,"title":"Retrieval of cavity-generated atomic spin squeezing after free-space release","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","department":[{"_id":"OnHo"}],"day":"30","researchdata_availability":"no","das_tickbox":"0","article_number":"012224","date_published":"2020-07-30T00:00:00Z","_id":"8319","quality_controlled":"1","publisher":"American Physical Society","doi":"10.1103/PhysRevA.102.012224","isi":1,"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."},{"language":[{"iso":"eng"}],"citation":{"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>.","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).","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>","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.","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>","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.","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>."},"article_type":"original","ec_funded":1,"status":"public","has_accepted_license":"1","external_id":{"pmid":["32940606"],"isi":["000584989400001"]},"abstract":[{"lang":"eng","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."}],"type":"journal_article","publication":"eLife","scopus_import":"1","oa_version":"Published Version","date_created":"2020-07-16T12:26:04Z","project":[{"_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","call_identifier":"H2020","name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","grant_number":"819603"}],"ddc":["570"],"date_updated":"2026-07-13T12:31:21Z","intvolume":"         9","pmid":1,"author":[{"last_name":"Gonçalves","orcid":"0000-0002-6987-4836","first_name":"Pedro J.","full_name":"Gonçalves, Pedro J."},{"full_name":"Lueckmann, Jan-Matthis","first_name":"Jan-Matthis","orcid":"0000-0003-4320-4663","last_name":"Lueckmann"},{"full_name":"Deistler, Michael","last_name":"Deistler","orcid":"0000-0002-3573-0404","first_name":"Michael"},{"full_name":"Nonnenmacher, Marcel","last_name":"Nonnenmacher","first_name":"Marcel","orcid":"0000-0001-6044-6627"},{"last_name":"Öcal","first_name":"Kaan","orcid":"0000-0002-8528-6858","full_name":"Öcal, Kaan"},{"full_name":"Bassetto, Giacomo","first_name":"Giacomo","last_name":"Bassetto"},{"first_name":"Chaitanya","orcid":"0000-0003-4252-1608","last_name":"Chintaluri","id":"BA06AFEE-A4BA-11EA-AE5C-14673DDC885E","full_name":"Chintaluri, Chaitanya"},{"full_name":"Podlaski, William F.","last_name":"Podlaski","orcid":"0000-0001-6619-7502","first_name":"William F."},{"first_name":"Sara A.","orcid":"0000-0003-0807-0823","last_name":"Haddad","full_name":"Haddad, Sara A."},{"last_name":"Vogels","orcid":"0000-0003-3295-6181","first_name":"Tim P","full_name":"Vogels, Tim P","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425"},{"full_name":"Greenberg, David S.","last_name":"Greenberg","first_name":"David S."},{"full_name":"Macke, Jakob H.","orcid":"0000-0001-5154-8912","first_name":"Jakob H.","last_name":"Macke"}],"month":"09","volume":9,"publication_status":"published","file_date_updated":"2020-10-27T11:37:32Z","year":"2020","article_number":"e56261","date_published":"2020-09-17T00:00:00Z","_id":"8127","quality_controlled":"1","das_tickbox":"1","publisher":"eLife Sciences Publications","isi":1,"file":[{"file_name":"2020_eLife_Gonçalves.pdf","file_id":"8709","date_updated":"2020-10-27T11:37:32Z","checksum":"c4300ddcd93ed03fc9c6cdf1f77890be","success":1,"file_size":17355867,"content_type":"application/pdf","date_created":"2020-10-27T11:37:32Z","access_level":"open_access","creator":"cziletti","relation":"main_file"}],"doi":"10.7554/eLife.56261","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.","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)"},"publication_identifier":{"eissn":["2050-084X"]},"article_processing_charge":"No","department":[{"_id":"TiVo"}],"day":"17","title":"Training deep neural density estimators to identify mechanistic models of neural dynamics","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"OA_type":"green","OA_place":"repository","intvolume":"        57","arxiv":1,"date_updated":"2026-07-14T08:31:05Z","language":[{"iso":"eng"}],"article_type":"original","citation":{"mla":"Fox, Jacob, et al. “Ramsey, Paper, Scissors.” <i>Random Structures &#38; Algorithms</i>, vol. 57, no. 4, Wiley, 2020, pp. 1157–73, doi:<a href=\"https://doi.org/10.1002/rsa.20950\">10.1002/rsa.20950</a>.","short":"J. Fox, X. He, Y. Wigderson, Random Structures &#38; Algorithms 57 (2020) 1157–1173.","apa":"Fox, J., He, X., &#38; Wigderson, Y. (2020). Ramsey, Paper, Scissors. <i>Random Structures &#38; Algorithms</i>. Wiley. <a href=\"https://doi.org/10.1002/rsa.20950\">https://doi.org/10.1002/rsa.20950</a>","ista":"Fox J, He X, Wigderson Y. 2020. Ramsey, Paper, Scissors. Random Structures &#38; Algorithms. 57(4), 1157–1173.","ieee":"J. Fox, X. He, and Y. Wigderson, “Ramsey, Paper, Scissors,” <i>Random Structures &#38; Algorithms</i>, vol. 57, no. 4. Wiley, pp. 1157–1173, 2020.","ama":"Fox J, He X, Wigderson Y. Ramsey, Paper, Scissors. <i>Random Structures &#38; Algorithms</i>. 2020;57(4):1157-1173. doi:<a href=\"https://doi.org/10.1002/rsa.20950\">10.1002/rsa.20950</a>","chicago":"Fox, Jacob, Xiaoyu He, and Yuval Wigderson. “Ramsey, Paper, Scissors.” <i>Random Structures &#38; Algorithms</i>. Wiley, 2020. <a href=\"https://doi.org/10.1002/rsa.20950\">https://doi.org/10.1002/rsa.20950</a>."},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1906.01092","open_access":"1"}],"type":"journal_article","scopus_import":"1","oa_version":"Preprint","date_created":"2026-06-29T10:54:10Z","publication":"Random Structures & Algorithms","status":"public","external_id":{"arxiv":["1906.01092"]},"abstract":[{"lang":"eng","text":"We introduce a graph Ramsey game called Ramsey, Paper,Scissors. This game has two players, Proposer and Decider.Starting from an empty graph on n vertices, on each turnProposer proposes a potential edge and Decider simultane-ously decides (without knowing Proposer’s choice) whether toadd it to the graph. Proposer cannot propose an edge whichwould create a triangle in the graph. The game ends whenProposer has no legal moves remaining, and Proposer wins ifthe final graph has independence number at least s. We provea threshold phenomenon exists for this game by exhibitingrandomized strategies for both players that are optimal up toconstants. Namely, there exist constants 0 < A < B such that(under optimal play) Proposer wins with high probability ifs < A√n log n, while Decider wins with high probability ifs > B√n log n. This is a factor of Θ(√log n)) larger than thelower bound coming from the off-diagonal Ramsey numberr(3, s)."}],"volume":57,"issue":"4","month":"12","year":"2020","publication_status":"published","page":"1157-1173","author":[{"full_name":"Fox, Jacob","last_name":"Fox","first_name":"Jacob"},{"full_name":"He, Xiaoyu","last_name":"He","first_name":"Xiaoyu"},{"id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","full_name":"Wigderson, Yuval","last_name":"Wigderson","first_name":"Yuval"}],"doi":"10.1002/rsa.20950","publisher":"Wiley","extern":"1","_id":"22166","date_published":"2020-12-01T00:00:00Z","quality_controlled":"1","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Ramsey, Paper, Scissors","oa":1,"article_processing_charge":"No","publication_identifier":{"issn":["1042-9832"],"eissn":["1098-2418"]}},{"citation":{"chicago":"Fox, Jacob, Yuval Wigderson, and Yufei Zhao. “A Short Proof of the Canonical Polynomial van Der Waerden Theorem.” <i>Comptes Rendus Mathématique</i>. Académie des Sciences, 2020. <a href=\"https://doi.org/10.5802/crmath.101\">https://doi.org/10.5802/crmath.101</a>.","apa":"Fox, J., Wigderson, Y., &#38; Zhao, Y. (2020). A short proof of the canonical polynomial van der Waerden theorem. <i>Comptes Rendus Mathématique</i>. Académie des Sciences. <a href=\"https://doi.org/10.5802/crmath.101\">https://doi.org/10.5802/crmath.101</a>","ieee":"J. Fox, Y. Wigderson, and Y. Zhao, “A short proof of the canonical polynomial van der Waerden theorem,” <i>Comptes Rendus Mathématique</i>, vol. 358, no. 8. Académie des Sciences, pp. 957–959, 2020.","ista":"Fox J, Wigderson Y, Zhao Y. 2020. A short proof of the canonical polynomial van der Waerden theorem. Comptes Rendus Mathématique. 358(8), 957–959.","ama":"Fox J, Wigderson Y, Zhao Y. A short proof of the canonical polynomial van der Waerden theorem. <i>Comptes Rendus Mathématique</i>. 2020;358(8):957-959. doi:<a href=\"https://doi.org/10.5802/crmath.101\">10.5802/crmath.101</a>","mla":"Fox, Jacob, et al. “A Short Proof of the Canonical Polynomial van Der Waerden Theorem.” <i>Comptes Rendus Mathématique</i>, vol. 358, no. 8, Académie des Sciences, 2020, pp. 957–59, doi:<a href=\"https://doi.org/10.5802/crmath.101\">10.5802/crmath.101</a>.","short":"J. Fox, Y. Wigderson, Y. Zhao, Comptes Rendus Mathématique 358 (2020) 957–959."},"article_type":"original","language":[{"iso":"eng"}],"abstract":[{"text":"We present a short new proof of the canonical polynomial van der Waerden theorem, recently established by Girão.","lang":"eng"}],"mathsc":["05D10","11B30"],"status":"public","external_id":{"arxiv":["2005.04135"]},"scopus_import":"1","date_created":"2026-06-29T11:00:09Z","oa_version":"Preprint","publication":"Comptes Rendus Mathématique","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2005.04135","open_access":"1"}],"type":"journal_article","OA_type":"green","date_updated":"2026-07-14T09:19:20Z","arxiv":1,"OA_place":"repository","intvolume":"       358","page":"957-959","author":[{"first_name":"Jacob","last_name":"Fox","full_name":"Fox, Jacob"},{"first_name":"Yuval","last_name":"Wigderson","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","full_name":"Wigderson, Yuval"},{"full_name":"Zhao, Yufei","last_name":"Zhao","first_name":"Yufei"}],"month":"12","issue":"8","volume":358,"publication_status":"published","year":"2020","_id":"22182","date_published":"2020-12-03T00:00:00Z","quality_controlled":"1","publisher":"Académie des Sciences","doi":"10.5802/crmath.101","extern":"1","publication_identifier":{"issn":["1631-073X"],"eissn":["1778-3569"]},"article_processing_charge":"No","day":"03","oa":1,"title":"A short proof of the canonical polynomial van der Waerden theorem","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"year":"2020","publication_status":"published","volume":27,"issue":"1","month":"02","author":[{"last_name":"He","first_name":"Xiaoyu","full_name":"He, Xiaoyu"},{"first_name":"Yuval","last_name":"Wigderson","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","full_name":"Wigderson, Yuval"}],"OA_place":"repository","intvolume":"        27","arxiv":1,"date_updated":"2026-07-14T09:42:53Z","OA_type":"green","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1910.06287","open_access":"1"}],"type":"journal_article","oa_version":"Preprint","date_created":"2026-06-29T12:06:14Z","publication":"The Electronic Journal of Combinatorics","scopus_import":"1","external_id":{"arxiv":["1910.06287"]},"status":"public","mathsc":["05C55","05D10"],"abstract":[{"lang":"eng","text":"A weakly optimal Ks-free (n,d,λ)-graph is ad-regular Ks-free graph on n vertices with d= Θ(n1−α) and spectral expansion λ= Θ(n1−(s−1)α),  for some fixed α >0.  Such a graph is called optimal if additionally α=12s−3.  We prove that if s1,...,sk>3 are fixed positive integers and weakly optimal Ksi-free pseudorandom graphs exist for each 1<i<k, then the multicolor Ramsey numbers satisfy \r\n\r\nΩ(tS+1log2St)6r(s1,...,sk,t)6O(tS+1logSt),\r\nas t→∞, where S=∑ki=1(si−2). This generalizes previous results of Mubayi andVerstraete, who proved the case k= 1, and Alon and Rodl, who proved the cases1=···=sk= 3.  Both previous results used the existence of optimal rather than weakly optimal Ksi-free graphs"}],"language":[{"iso":"eng"}],"citation":{"ieee":"X. He and Y. Wigderson, “Multicolor Ramsey numbers via pseudorandom graphs,” <i>The Electronic Journal of Combinatorics</i>, vol. 27, no. 1. The Electronic Journal of Combinatorics, 2020.","ista":"He X, Wigderson Y. 2020. Multicolor Ramsey numbers via pseudorandom graphs. The Electronic Journal of Combinatorics. 27(1), P1.32.","ama":"He X, Wigderson Y. Multicolor Ramsey numbers via pseudorandom graphs. <i>The Electronic Journal of Combinatorics</i>. 2020;27(1). doi:<a href=\"https://doi.org/10.37236/9071\">10.37236/9071</a>","apa":"He, X., &#38; Wigderson, Y. (2020). Multicolor Ramsey numbers via pseudorandom graphs. <i>The Electronic Journal of Combinatorics</i>. The Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/9071\">https://doi.org/10.37236/9071</a>","short":"X. He, Y. Wigderson, The Electronic Journal of Combinatorics 27 (2020).","mla":"He, Xiaoyu, and Yuval Wigderson. “Multicolor Ramsey Numbers via Pseudorandom Graphs.” <i>The Electronic Journal of Combinatorics</i>, vol. 27, no. 1, P1.32, The Electronic Journal of Combinatorics, 2020, doi:<a href=\"https://doi.org/10.37236/9071\">10.37236/9071</a>.","chicago":"He, Xiaoyu, and Yuval Wigderson. “Multicolor Ramsey Numbers via Pseudorandom Graphs.” <i>The Electronic Journal of Combinatorics</i>. The Electronic Journal of Combinatorics, 2020. <a href=\"https://doi.org/10.37236/9071\">https://doi.org/10.37236/9071</a>."},"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Multicolor Ramsey numbers via pseudorandom graphs","oa":1,"day":"01","article_processing_charge":"No","publication_identifier":{"eissn":["1077-8926"]},"extern":"1","doi":"10.37236/9071","publisher":"The Electronic Journal of Combinatorics","_id":"22185","date_published":"2020-02-01T00:00:00Z","quality_controlled":"1","article_number":"P1.32"},{"OA_type":"green","arxiv":1,"date_updated":"2026-07-14T09:55:01Z","intvolume":"        27","OA_place":"repository","language":[{"iso":"eng"}],"citation":{"ieee":"X. He and Y. Wigderson, “Multicolor Ramsey numbers via pseudorandom graphs,” <i>The Electronic Journal of Combinatorics</i>, vol. 27, no. 1. The Electronic Journal of Combinatorics, 2020.","ama":"He X, Wigderson Y. Multicolor Ramsey numbers via pseudorandom graphs. <i>The Electronic Journal of Combinatorics</i>. 2020;27(1). doi:<a href=\"https://doi.org/10.37236/9071\">10.37236/9071</a>","ista":"He X, Wigderson Y. 2020. Multicolor Ramsey numbers via pseudorandom graphs. The Electronic Journal of Combinatorics. 27(1), P1.32.","apa":"He, X., &#38; Wigderson, Y. (2020). Multicolor Ramsey numbers via pseudorandom graphs. <i>The Electronic Journal of Combinatorics</i>. The Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/9071\">https://doi.org/10.37236/9071</a>","short":"X. He, Y. Wigderson, The Electronic Journal of Combinatorics 27 (2020).","mla":"He, Xiaoyu, and Yuval Wigderson. “Multicolor Ramsey Numbers via Pseudorandom Graphs.” <i>The Electronic Journal of Combinatorics</i>, vol. 27, no. 1, P1.32, The Electronic Journal of Combinatorics, 2020, doi:<a href=\"https://doi.org/10.37236/9071\">10.37236/9071</a>.","chicago":"He, Xiaoyu, and Yuval Wigderson. “Multicolor Ramsey Numbers via Pseudorandom Graphs.” <i>The Electronic Journal of Combinatorics</i>. The Electronic Journal of Combinatorics, 2020. <a href=\"https://doi.org/10.37236/9071\">https://doi.org/10.37236/9071</a>."},"article_type":"original","status":"public","external_id":{"arxiv":["1910.06287"]},"abstract":[{"lang":"eng","text":"A weakly optimal Ks-free (n,d,λ)-graph is a d-regular Ks-free graph on n vertices with d=Θ(n1−α) and spectral expansion λ=Θ(n1−(s−1)α), for some fixed α>0. Such a graph is called optimal if additionally α=12s−3. We prove that if s1,…,sk≥3 are fixed positive integers and weakly optimal Ksi-free pseudorandom graphs exist for each 1≤i≤k, then the multicolor Ramsey numbers satisfy\r\nΩ(tS+1log2St)≤r(s1,…,sk,t)≤O(tS+1logSt),\r\nas t→∞, where S=∑ki=1(si−2). This generalizes previous results of Mubayi and Verstraëte, who proved the case k=1, and Alon and Rödl, who proved the case s1=⋯=sk=3. Both previous results used the existence of optimal rather than weakly optimal Ksi-free graphs."}],"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1910.06287"}],"scopus_import":"1","oa_version":"Preprint","date_created":"2026-06-29T10:47:47Z","publication":"The Electronic Journal of Combinatorics","month":"02","volume":27,"issue":"1","publication_status":"published","year":"2020","author":[{"full_name":"He, Xiaoyu","first_name":"Xiaoyu","last_name":"He"},{"full_name":"Wigderson, Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","first_name":"Yuval","last_name":"Wigderson"}],"publisher":"The Electronic Journal of Combinatorics","doi":"10.37236/9071","extern":"1","article_number":"P1.32","date_published":"2020-02-07T00:00:00Z","_id":"22153","quality_controlled":"1","das_tickbox":"1","day":"07","title":"Multicolor Ramsey numbers via pseudorandom graphs","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["1077-8926"]},"article_processing_charge":"No"},{"article_processing_charge":"No","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Shaping colloidal bananas to reveal biaxial, splay-bend nematic, and smectic phases","day":"21","quality_controlled":"1","_id":"22216","date_published":"2020-08-21T00:00:00Z","extern":"1","doi":"10.1126/science.abb4536","publisher":"American Association for the Advancement of Science","author":[{"full_name":"Fernández-Rico, Carla","id":"492def71-6250-11f0-b278-d41dbd241b62","first_name":"Carla","last_name":"Fernández-Rico"},{"last_name":"Chiappini","first_name":"Massimiliano","full_name":"Chiappini, Massimiliano"},{"last_name":"Yanagishima","first_name":"Taiki","full_name":"Yanagishima, Taiki"},{"first_name":"Heidi","last_name":"de Sousa","full_name":"de Sousa, Heidi"},{"first_name":"Dirk G. A. L.","last_name":"Aarts","full_name":"Aarts, Dirk G. A. L."},{"full_name":"Dijkstra, Marjolein","first_name":"Marjolein","last_name":"Dijkstra"},{"first_name":"Roel P. A.","last_name":"Dullens","full_name":"Dullens, Roel P. A."}],"pmid":1,"page":"950-955","year":"2020","publication_status":"published","volume":369,"issue":"6506","month":"08","type":"journal_article","oa_version":"None","publication":"Science","date_created":"2026-06-30T06:33:29Z","scopus_import":"1","status":"public","external_id":{"pmid":["32820121"]},"abstract":[{"text":"Understanding the impact of curvature on the self-assembly of elongated microscopic building blocks, such as molecules and proteins, is key to engineering functional materials with predesigned structure. We develop model “banana-shaped” colloidal particles with tunable dimensions and curvature, whose structure and dynamics are accessible at the particle level. By heating initially straight rods made of SU-8 photoresist, we induce a controllable shape deformation that causes the rods to buckle into banana-shaped particles. We elucidate the phase behavior of differently curved colloidal bananas using confocal microscopy. Although highly curved bananas only form isotropic phases, less curved bananas exhibit very rich phase behavior, including biaxial nematic phases, polar and antipolar smectic-like phases, and even the long-predicted, elusive splay-bend nematic phase.","lang":"eng"}],"language":[{"iso":"eng"}],"citation":{"chicago":"Fernández-Rico, Carla, Massimiliano Chiappini, Taiki Yanagishima, Heidi de Sousa, Dirk G. A. L. Aarts, Marjolein Dijkstra, and Roel P. A. Dullens. “Shaping Colloidal Bananas to Reveal Biaxial, Splay-Bend Nematic, and Smectic Phases.” <i>Science</i>. American Association for the Advancement of Science, 2020. <a href=\"https://doi.org/10.1126/science.abb4536\">https://doi.org/10.1126/science.abb4536</a>.","apa":"Fernández-Rico, C., Chiappini, M., Yanagishima, T., de Sousa, H., Aarts, D. G. A. L., Dijkstra, M., &#38; Dullens, R. P. A. (2020). Shaping colloidal bananas to reveal biaxial, splay-bend nematic, and smectic phases. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.abb4536\">https://doi.org/10.1126/science.abb4536</a>","ista":"Fernández-Rico C, Chiappini M, Yanagishima T, de Sousa H, Aarts DGAL, Dijkstra M, Dullens RPA. 2020. Shaping colloidal bananas to reveal biaxial, splay-bend nematic, and smectic phases. Science. 369(6506), 950–955.","ieee":"C. Fernández-Rico <i>et al.</i>, “Shaping colloidal bananas to reveal biaxial, splay-bend nematic, and smectic phases,” <i>Science</i>, vol. 369, no. 6506. American Association for the Advancement of Science, pp. 950–955, 2020.","ama":"Fernández-Rico C, Chiappini M, Yanagishima T, et al. Shaping colloidal bananas to reveal biaxial, splay-bend nematic, and smectic phases. <i>Science</i>. 2020;369(6506):950-955. doi:<a href=\"https://doi.org/10.1126/science.abb4536\">10.1126/science.abb4536</a>","mla":"Fernández-Rico, Carla, et al. “Shaping Colloidal Bananas to Reveal Biaxial, Splay-Bend Nematic, and Smectic Phases.” <i>Science</i>, vol. 369, no. 6506, American Association for the Advancement of Science, 2020, pp. 950–55, doi:<a href=\"https://doi.org/10.1126/science.abb4536\">10.1126/science.abb4536</a>.","short":"C. Fernández-Rico, M. Chiappini, T. Yanagishima, H. de Sousa, D.G.A.L. Aarts, M. Dijkstra, R.P.A. Dullens, Science 369 (2020) 950–955."},"article_type":"original","intvolume":"       369","date_updated":"2026-07-15T07:45:41Z","OA_type":"closed access"},{"quality_controlled":"1","_id":"7467","date_published":"2020-03-01T00:00:00Z","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.","isi":1,"doi":"10.1021/acsaem.9b02137","file":[{"file_size":6423548,"success":1,"checksum":"f23be731a766a480c77c962c1380315c","date_updated":"2022-08-23T08:34:17Z","file_id":"11942","file_name":"2020_ACSAppliedEnergyMat_Cadavid.pdf","relation":"main_file","creator":"dernst","access_level":"open_access","date_created":"2022-08-23T08:34:17Z","content_type":"application/pdf"}],"publisher":"American Chemical Society","article_processing_charge":"No","publication_identifier":{"eissn":["2574-0962"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Influence of the ligand stripping on the transport properties of nanoparticle-based PbSe nanomaterials","oa":1,"day":"01","department":[{"_id":"MaIb"}],"type":"journal_article","date_created":"2020-02-09T23:00:52Z","publication":"ACS Applied Energy Materials","scopus_import":"1","oa_version":"Accepted Version","external_id":{"isi":["000526598300012"]},"status":"public","has_accepted_license":"1","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"}],"language":[{"iso":"eng"}],"ec_funded":1,"citation":{"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.","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.","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>","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>","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.","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>.","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>."},"article_type":"original","intvolume":"         3","ddc":["540"],"date_updated":"2026-07-28T12:54:00Z","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"OA_type":"green","author":[{"full_name":"Cadavid, Doris","first_name":"Doris","last_name":"Cadavid"},{"first_name":"Silvia","last_name":"Ortega","full_name":"Ortega, Silvia"},{"last_name":"Illera","first_name":"Sergio","full_name":"Illera, Sergio"},{"last_name":"Liu","first_name":"Yu","orcid":"0000-0001-7313-6740","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","full_name":"Liu, Yu"},{"orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez","full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Shavel, Alexey","first_name":"Alexey","last_name":"Shavel"},{"full_name":"Zhang, Yu","last_name":"Zhang","first_name":"Yu"},{"first_name":"Mengyao","last_name":"Li","full_name":"Li, Mengyao"},{"first_name":"Antonio M.","last_name":"López","full_name":"López, Antonio M."},{"first_name":"Germán","last_name":"Noriega","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.","last_name":"López De La Torre","first_name":"M. A."},{"last_name":"Prades","first_name":"Joan Daniel","full_name":"Prades, Joan Daniel"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"page":"2120-2129","year":"2020","publication_status":"published","file_date_updated":"2022-08-23T08:34:17Z","volume":3,"issue":"3","month":"03"},{"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","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.","file":[{"relation":"source_file","creator":"dernst","access_level":"closed","date_created":"2020-09-30T14:50:20Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":49198118,"checksum":"c4bda1947d4c09c428ac9ce667b02327","date_updated":"2020-09-30T14:50:20Z","file_name":"2020_Han_Thesis.docx","file_id":"8590"},{"creator":"dernst","relation":"main_file","access_level":"open_access","date_created":"2020-09-30T14:49:59Z","content_type":"application/pdf","file_size":15513963,"checksum":"3f4f5d1718c2230adf30639ecaf8a00b","file_id":"8591","file_name":"2020_Han_Thesis.pdf","date_updated":"2021-10-01T13:33:02Z"}],"doi":"10.15479/AT:ISTA:8589","supervisor":[{"full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jiří"}],"date_published":"2020-09-30T00:00:00Z","_id":"8589","title":"Novel insights into PIN polarity regulation during Arabidopsis development","oa":1,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","department":[{"_id":"JiFr"}],"day":"30","publication_identifier":{"issn":["2663-337X"]},"article_processing_charge":"No","ddc":["580"],"date_updated":"2026-07-28T12:51:58Z","OA_place":"publisher","has_accepted_license":"1","status":"public","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"}],"corr_author":"1","type":"dissertation","oa_version":"Published Version","date_created":"2020-09-30T14:50:51Z","language":[{"iso":"eng"}],"citation":{"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>.","short":"H. Han, Novel Insights into PIN Polarity Regulation during Arabidopsis Development, Institute of Science and Technology Austria, 2020.","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>","ieee":"H. Han, “Novel insights into PIN polarity regulation during Arabidopsis development,” Institute of Science and Technology Austria, 2020.","ista":"Han H. 2020. Novel insights into PIN polarity regulation during Arabidopsis development. Institute of Science and Technology Austria.","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>","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>."},"publication_status":"published","file_date_updated":"2021-10-01T13:33:02Z","year":"2020","month":"09","related_material":{"record":[{"status":"public","id":"7643","relation":"part_of_dissertation"}]},"author":[{"id":"31435098-F248-11E8-B48F-1D18A9856A87","full_name":"Han, Huibin","first_name":"Huibin","last_name":"Han"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"alternative_title":["ISTA Thesis"],"page":"164"},{"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030568795"]},"article_processing_charge":"No","oa":1,"title":"Reverse firewalls for actively secure MPCs","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"}],"day":"10","cryptoeprintid":1,"_id":"8322","date_published":"2020-08-10T00:00:00Z","quality_controlled":"1","conference":{"location":"Santa Barbara, CA, United States","start_date":"2020-08-17","end_date":"2020-08-21","name":"CRYPTO: Annual International Cryptology Conference"},"publisher":"Springer Nature","isi":1,"doi":"10.1007/978-3-030-56880-1_26","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.","author":[{"full_name":"Chakraborty, Suvradip","id":"B9CD0494-D033-11E9-B219-A439E6697425","first_name":"Suvradip","last_name":"Chakraborty"},{"first_name":"Stefan","last_name":"Dziembowski","full_name":"Dziembowski, Stefan"},{"first_name":"Jesper Buus","last_name":"Nielsen","full_name":"Nielsen, Jesper Buus"}],"alternative_title":["LNCS"],"page":"732-762","publication_status":"published","year":"2020","month":"08","volume":12171,"abstract":[{"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).","lang":"eng"}],"external_id":{"isi":["001415325700026"],"cryptoeprintid":["2019/1317"]},"status":"public","date_created":"2020-08-30T22:01:12Z","scopus_import":"1","publication":"Advances in Cryptology – CRYPTO 2020","oa_version":"Preprint","type":"conference","main_file_link":[{"url":"https://eprint.iacr.org/2019/1317","open_access":"1"}],"citation":{"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>.","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>.","short":"S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology – CRYPTO 2020, Springer Nature, 2020, pp. 732–762.","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>","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.","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>","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."},"ec_funded":1,"language":[{"iso":"eng"}],"date_updated":"2026-07-28T12:45:44Z","OA_place":"repository","intvolume":"     12171","OA_type":"green","project":[{"grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}]},{"conference":{"end_date":"2020-02-26","start_date":"2020-02-22","location":"San Diego, CA, United States","name":"PPOPP: Principles and Practice of Parallel Programming"},"publisher":"Association for Computing Machinery","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). ","doi":"10.1145/3332466.3374542","isi":1,"_id":"7636","date_published":"2020-02-19T00:00:00Z","quality_controlled":"1","title":"Non-blocking interpolation search trees with doubly-logarithmic running time","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"}],"day":"19","publication_identifier":{"isbn":["9781450368186"]},"article_processing_charge":"No","ddc":["000"],"date_updated":"2026-07-28T12:49:59Z","OA_place":"publisher","OA_type":"free access","project":[{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"external_id":{"isi":["000564476500020"]},"status":"public","abstract":[{"lang":"eng","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."}],"main_file_link":[{"url":"https://doi.org/10.1145/3332466.3374542","open_access":"1"}],"type":"conference","date_created":"2020-04-05T22:00:49Z","oa_version":"Published Version","publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","scopus_import":"1","language":[{"iso":"eng"}],"ec_funded":1,"citation":{"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.","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.","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>","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.","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>."},"publication_status":"published","year":"2020","month":"02","author":[{"id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A","first_name":"Trevor A","last_name":"Brown"},{"last_name":"Prokopec","first_name":"Aleksandar","full_name":"Prokopec, Aleksandar"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"page":"276-291"},{"page":"P154-165.e6","pmid":1,"acknowledged_ssus":[{"_id":"M-Shop"}],"author":[{"id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","full_name":"Käfer, Karola","first_name":"Karola","last_name":"Käfer"},{"full_name":"Nardin, Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8849-6570","first_name":"Michele","last_name":"Nardin"},{"first_name":"Karel","last_name":"Blahna","id":"3EA859AE-F248-11E8-B48F-1D18A9856A87","full_name":"Blahna, Karel"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","orcid":"0000-0002-5193-4036","last_name":"Csicsvari"}],"month":"04","issue":"1","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/this-brain-area-helps-us-decide/"}]},"volume":106,"publication_status":"published","year":"2020","citation":{"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.","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.","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>","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>.","short":"K. Käfer, M. Nardin, K. Blahna, J.L. Csicsvari, Neuron 106 (2020) P154–165.e6.","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>."},"ec_funded":1,"article_type":"original","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"status":"public","external_id":{"pmid":["32032512"],"isi":["000525319300016"]},"scopus_import":"1","date_created":"2020-02-10T15:45:48Z","publication":"Neuron","oa_version":"Published Version","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.neuron.2020.01.015"}],"type":"journal_article","project":[{"name":"inter-and intracellular signalling in schizophrenia","call_identifier":"FP7","_id":"257BBB4C-B435-11E9-9278-68D0E5697425","grant_number":"607616"}],"OA_type":"free access","date_updated":"2026-07-28T12:55:10Z","ddc":["570"],"OA_place":"publisher","intvolume":"       106","publication_identifier":{"issn":["0896-6273"]},"article_processing_charge":"No","department":[{"_id":"JoCs"}],"day":"08","oa":1,"title":"Replay of behavioral sequences in the medial prefrontal cortex during rule switching","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","_id":"7472","date_published":"2020-04-08T00:00:00Z","publisher":"Elsevier","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 ).","isi":1,"doi":"10.1016/j.neuron.2020.01.015"},{"external_id":{"pmid":["32107280"],"isi":["000536641800018"]},"status":"public","scopus_import":"1","publication":"Plant Physiology","date_created":"2020-04-06T10:06:40Z","oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.1104/pp.20.00212","open_access":"1"}],"type":"journal_article","corr_author":"1","article_type":"letter_editor","ec_funded":1,"citation":{"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>.","short":"H. Han, H. Rakusova, I. Verstraeten, Y. Zhang, J. Friml, Plant Physiology 183 (2020) 37–40.","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>","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>","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.","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.","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>."},"language":[{"iso":"eng"}],"date_updated":"2026-07-28T12:51:59Z","ddc":["580"],"intvolume":"       183","OA_place":"publisher","OA_type":"free access","project":[{"grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"26538374-B435-11E9-9278-68D0E5697425","name":"Molecular mechanisms of endocytic cargo recognition in plants","grant_number":"I03630"}],"author":[{"last_name":"Han","first_name":"Huibin","id":"31435098-F248-11E8-B48F-1D18A9856A87","full_name":"Han, Huibin"},{"id":"4CAAA450-78D2-11EA-8E57-B40A396E08BA","full_name":"Rakusova, Hana","first_name":"Hana","last_name":"Rakusova"},{"id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","full_name":"Verstraeten, Inge","first_name":"Inge","orcid":"0000-0001-7241-2328","last_name":"Verstraeten"},{"orcid":"0000-0003-2627-6956","first_name":"Yuzhou","last_name":"Zhang","full_name":"Zhang, Yuzhou","id":"3B6137F2-F248-11E8-B48F-1D18A9856A87"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","first_name":"Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml"}],"page":"37-40","pmid":1,"publication_status":"published","year":"2020","month":"05","related_material":{"record":[{"relation":"dissertation_contains","id":"8589","status":"public"}]},"issue":"5","volume":183,"quality_controlled":"1","_id":"7643","date_published":"2020-05-08T00:00:00Z","publisher":"American Society of Plant Biologists","isi":1,"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.","doi":"10.1104/pp.20.00212","publication_identifier":{"issn":["0032-0889"],"eissn":["1532-2548"]},"article_processing_charge":"No","oa":1,"title":"SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JiFr"}],"day":"08"},{"article_processing_charge":"No","publication_identifier":{"isbn":["9781450375825"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"title":"Long-lived snapshots with polylogarithmic amortized step complexity","day":"31","department":[{"_id":"GradSch"}],"das_tickbox":"1","_id":"8382","quality_controlled":"1","date_published":"2020-07-31T00:00:00Z","conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2020-08-03","location":"Virtual, Italy","end_date":"2020-08-07"},"doi":"10.1145/3382734.3406005","isi":1,"publisher":"Association for Computing Machinery","author":[{"last_name":"Baig","first_name":"Mirza Ahad","full_name":"Baig, Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425"},{"last_name":"Hendler","first_name":"Danny","full_name":"Hendler, Danny"},{"last_name":"Milani","first_name":"Alessia","full_name":"Milani, Alessia"},{"first_name":"Corentin","last_name":"Travers","full_name":"Travers, Corentin"}],"page":"31-40","year":"2020","publication_status":"published","month":"07","publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","date_created":"2020-09-13T22:01:17Z","oa_version":"Preprint","scopus_import":"1","type":"conference","main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-02860087/document"}],"abstract":[{"lang":"eng","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."}],"status":"public","external_id":{"isi":["001436693500004"]},"citation":{"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>.","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.","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>.","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.","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>","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.","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>"},"language":[{"iso":"eng"}],"date_updated":"2026-07-28T09:50:30Z"},{"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"OA_type":"hybrid","ddc":["004"],"arxiv":1,"date_updated":"2026-07-28T13:01:49Z","intvolume":"       128","OA_place":"publisher","language":[{"iso":"eng"}],"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>","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.","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.","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>.","short":"P.M. Henderson, V. Ferrari, International Journal of Computer Vision 128 (2020) 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>."},"article_type":"original","external_id":{"arxiv":["1901.06447"],"isi":["000491042100002"]},"has_accepted_license":"1","status":"public","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"}],"corr_author":"1","type":"journal_article","date_created":"2019-10-17T13:38:20Z","scopus_import":"1","publication":"International Journal of Computer Vision","oa_version":"Published Version","month":"04","volume":128,"publication_status":"published","file_date_updated":"2020-07-14T12:47:46Z","year":"2020","page":"835-854","author":[{"full_name":"Henderson, Paul M","id":"13C09E74-18D9-11E9-8878-32CFE5697425","last_name":"Henderson","orcid":"0000-0002-5198-7445","first_name":"Paul M"},{"last_name":"Ferrari","first_name":"Vittorio","full_name":"Ferrari, Vittorio"}],"publisher":"Springer Nature","doi":"10.1007/s11263-019-01219-8","file":[{"file_size":2243134,"file_id":"6973","file_name":"2019_CompVision_Henderson.pdf","date_updated":"2020-07-14T12:47:46Z","checksum":"a0f05dd4f5f64e4f713d8d9d4b5b1e3f","access_level":"open_access","creator":"dernst","relation":"main_file","content_type":"application/pdf","date_created":"2019-10-25T10:28:29Z"}],"isi":1,"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","_id":"6952","date_published":"2020-04-01T00:00:00Z","quality_controlled":"1","department":[{"_id":"ChLa"}],"day":"01","title":"Learning single-image 3D reconstruction by generative modelling of shape, pose and shading","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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)"},"publication_identifier":{"issn":["0920-5691"],"eissn":["1573-1405"]},"article_processing_charge":"Yes (via OA deal)"},{"isi":1,"file":[{"creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_created":"2021-03-29T11:43:20Z","file_size":2607823,"success":1,"checksum":"2a634abe75251ae7628cd54c8a4ce2e8","file_name":"2020_PhysReviewApplied_Peruzzo.pdf","file_id":"9300","date_updated":"2021-03-29T11:43:20Z"}],"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). ","doi":"10.1103/PhysRevApplied.14.044055","publisher":"American Physical Society","quality_controlled":"1","_id":"8755","date_published":"2020-10-29T00:00:00Z","article_number":"044055","day":"29","department":[{"_id":"JoFi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Surpassing the resistance quantum with a geometric superinductor","oa":1,"article_processing_charge":"No","publication_identifier":{"eissn":["2331-7019"]},"project":[{"grant_number":"732894","call_identifier":"H2020","name":"Hybrid Optomechanical Technologies","_id":"257EB838-B435-11E9-9278-68D0E5697425"},{"grant_number":"862644","name":"Quantum readout techniques and technologies","_id":"237CBA6C-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020"},{"name":"A Fiber Optic Transceiver for Superconducting Qubits","call_identifier":"H2020","_id":"26336814-B435-11E9-9278-68D0E5697425","grant_number":"758053"},{"_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f","name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","grant_number":"F07105"}],"intvolume":"        14","arxiv":1,"ddc":["530"],"date_updated":"2026-07-29T13:12:09Z","language":[{"iso":"eng"}],"citation":{"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>.","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>.","short":"M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, J.M. Fink, Physical Review Applied 14 (2020).","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>","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.","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>","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."},"ec_funded":1,"article_type":"original","type":"journal_article","scopus_import":"1","date_created":"2020-11-15T23:01:17Z","oa_version":"Published Version","publication":"Physical Review Applied","external_id":{"isi":["000582797300003"],"arxiv":["2007.01644"]},"has_accepted_license":"1","status":"public","abstract":[{"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. ","lang":"eng"}],"volume":14,"issue":"4","related_material":{"record":[{"relation":"research_data","id":"13070","status":"public"},{"relation":"dissertation_contains","status":"public","id":"9920"},{"status":"public","id":"17133","relation":"dissertation_contains"},{"status":"public","id":"20371","relation":"dissertation_contains"}]},"month":"10","year":"2020","file_date_updated":"2021-03-29T11:43:20Z","publication_status":"published","author":[{"full_name":"Peruzzo, Matilda","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3415-4628","first_name":"Matilda","last_name":"Peruzzo"},{"full_name":"Trioni, Andrea","id":"42F71B44-F248-11E8-B48F-1D18A9856A87","first_name":"Andrea","last_name":"Trioni"},{"last_name":"Hassani","orcid":"0000-0001-6937-5773","first_name":"Farid","full_name":"Hassani, Farid","id":"2AED110C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zemlicka, Martin","id":"2DCF8DE6-F248-11E8-B48F-1D18A9856A87","last_name":"Zemlicka","orcid":"0009-0005-0878-3032","first_name":"Martin"},{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M","last_name":"Fink","first_name":"Johannes M","orcid":"0000-0001-8112-028X"}],"acknowledged_ssus":[{"_id":"NanoFab"}]},{"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.","file":[{"relation":"main_file","creator":"dernst","access_level":"open_access","date_created":"2020-11-18T11:14:37Z","content_type":"application/pdf","file_size":2904574,"success":1,"checksum":"c3a683e2afdcea27afa6880b01e53dc2","date_updated":"2020-11-18T11:14:37Z","file_name":"2020_CommMathPhysics_Erdoes.pdf","file_id":"8771"}],"doi":"10.1007/s00220-019-03657-4","isi":1,"publisher":"Springer Nature","quality_controlled":"1","_id":"6185","date_published":"2020-09-01T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Cusp universality for random matrices I: Local law and the complex Hermitian case","oa":1,"day":"01","department":[{"_id":"LaEr"}],"article_processing_charge":"Yes (via OA deal)","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)"},"publication_identifier":{"eissn":["1432-0916"],"issn":["0010-3616"]},"intvolume":"       378","arxiv":1,"ddc":["530","510"],"date_updated":"2026-07-29T13:46:19Z","project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"type":"journal_article","date_created":"2019-03-28T10:21:15Z","publication":"Communications in Mathematical Physics","oa_version":"Published Version","scopus_import":"1","status":"public","has_accepted_license":"1","external_id":{"isi":["000529483000001"],"arxiv":["1809.03971"]},"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)."}],"language":[{"iso":"eng"}],"article_type":"original","citation":{"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.","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>","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.","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>","short":"L. Erdös, T.H. Krüger, D.J. Schröder, Communications in Mathematical Physics 378 (2020) 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>.","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>."},"ec_funded":1,"year":"2020","publication_status":"published","file_date_updated":"2020-11-18T11:14:37Z","volume":378,"related_material":{"record":[{"id":"6179","status":"public","relation":"dissertation_contains"}]},"month":"09","author":[{"orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"id":"3020C786-F248-11E8-B48F-1D18A9856A87","full_name":"Krüger, Torben H","first_name":"Torben H","orcid":"0000-0002-4821-3297","last_name":"Krüger"},{"full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","last_name":"Schröder","orcid":"0000-0002-2904-1856","first_name":"Dominik J"}],"page":"1203-1278"}]