---
_id: '8319'
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.
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.
article_number: '012224'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Yunfan
  full_name: Wu, Yunfan
  last_name: Wu
- first_name: Rajiv
  full_name: Krishnakumar, Rajiv
  last_name: Krishnakumar
- first_name: Julián
  full_name: Martínez-Rincón, Julián
  last_name: Martínez-Rincón
- first_name: Benjamin K.
  full_name: Malia, Benjamin K.
  last_name: Malia
- first_name: Onur
  full_name: Hosten, Onur
  id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
  last_name: Hosten
  orcid: 0000-0002-2031-204X
- first_name: Mark A.
  full_name: Kasevich, Mark A.
  last_name: Kasevich
citation:
  ama: Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA. Retrieval
    of cavity-generated atomic spin squeezing after free-space release. <i>Physical
    Review A</i>. 2020;102(1). doi:<a href="https://doi.org/10.1103/PhysRevA.102.012224">10.1103/PhysRevA.102.012224</a>
  apa: Wu, Y., Krishnakumar, R., Martínez-Rincón, J., Malia, B. K., Hosten, O., &#38;
    Kasevich, M. A. (2020). Retrieval of cavity-generated atomic spin squeezing after
    free-space release. <i>Physical Review A</i>. American Physical Society. <a href="https://doi.org/10.1103/PhysRevA.102.012224">https://doi.org/10.1103/PhysRevA.102.012224</a>
  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>.
  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.
  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.
  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).
das_tickbox: '0'
date_created: 2020-08-30T22:01:10Z
date_published: 2020-07-30T00:00:00Z
date_updated: 2026-07-08T08:59:02Z
day: '30'
department:
- _id: OnHo
doi: 10.1103/PhysRevA.102.012224
external_id:
  arxiv:
  - '1912.08334'
  isi:
  - '000555104200011'
intvolume: '       102'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1912.08334
month: '07'
oa: 1
oa_version: Preprint
publication: Physical Review A
publication_identifier:
  eissn:
  - 2469-9934
  issn:
  - 2469-9926
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Retrieval of cavity-generated atomic spin squeezing after free-space release
type: journal_article
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
volume: 102
year: '2020'
...
---
_id: '8127'
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.
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.
article_number: e56261
article_processing_charge: No
article_type: original
author:
- first_name: Pedro J.
  full_name: Gonçalves, Pedro J.
  last_name: Gonçalves
  orcid: 0000-0002-6987-4836
- first_name: Jan-Matthis
  full_name: Lueckmann, Jan-Matthis
  last_name: Lueckmann
  orcid: 0000-0003-4320-4663
- first_name: Michael
  full_name: Deistler, Michael
  last_name: Deistler
  orcid: 0000-0002-3573-0404
- first_name: Marcel
  full_name: Nonnenmacher, Marcel
  last_name: Nonnenmacher
  orcid: 0000-0001-6044-6627
- first_name: Kaan
  full_name: Öcal, Kaan
  last_name: Öcal
  orcid: 0000-0002-8528-6858
- first_name: Giacomo
  full_name: Bassetto, Giacomo
  last_name: Bassetto
- first_name: Chaitanya
  full_name: Chintaluri, Chaitanya
  id: BA06AFEE-A4BA-11EA-AE5C-14673DDC885E
  last_name: Chintaluri
  orcid: 0000-0003-4252-1608
- first_name: William F.
  full_name: Podlaski, William F.
  last_name: Podlaski
  orcid: 0000-0001-6619-7502
- first_name: Sara A.
  full_name: Haddad, Sara A.
  last_name: Haddad
  orcid: 0000-0003-0807-0823
- first_name: Tim P
  full_name: Vogels, Tim P
  id: CB6FF8D2-008F-11EA-8E08-2637E6697425
  last_name: Vogels
  orcid: 0000-0003-3295-6181
- first_name: David S.
  full_name: Greenberg, David S.
  last_name: Greenberg
- first_name: Jakob H.
  full_name: Macke, Jakob H.
  last_name: Macke
  orcid: 0000-0001-5154-8912
citation:
  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>
  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>
  chicago: Gonçalves, Pedro J., Jan-Matthis Lueckmann, Michael Deistler, Marcel Nonnenmacher,
    Kaan Öcal, Giacomo Bassetto, Chaitanya Chintaluri, et al. “Training Deep Neural
    Density Estimators to Identify Mechanistic Models of Neural Dynamics.” <i>ELife</i>.
    eLife Sciences Publications, 2020. <a href="https://doi.org/10.7554/eLife.56261">https://doi.org/10.7554/eLife.56261</a>.
  ieee: P. J. Gonçalves <i>et al.</i>, “Training deep neural density estimators to
    identify mechanistic models of neural dynamics,” <i>eLife</i>, vol. 9. eLife Sciences
    Publications, 2020.
  ista: Gonçalves PJ, Lueckmann J-M, Deistler M, Nonnenmacher M, Öcal K, Bassetto
    G, Chintaluri C, Podlaski WF, Haddad SA, Vogels TP, Greenberg DS, Macke JH. 2020.
    Training deep neural density estimators to identify mechanistic models of neural
    dynamics. eLife. 9, e56261.
  mla: Gonçalves, Pedro J., et al. “Training Deep Neural Density Estimators to Identify
    Mechanistic Models of Neural Dynamics.” <i>ELife</i>, vol. 9, e56261, eLife Sciences
    Publications, 2020, doi:<a href="https://doi.org/10.7554/eLife.56261">10.7554/eLife.56261</a>.
  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).
das_tickbox: '1'
date_created: 2020-07-16T12:26:04Z
date_published: 2020-09-17T00:00:00Z
date_updated: 2026-07-13T12:31:21Z
day: '17'
ddc:
- '570'
department:
- _id: TiVo
doi: 10.7554/eLife.56261
ec_funded: 1
external_id:
  isi:
  - '000584989400001'
  pmid:
  - '32940606'
file:
- access_level: open_access
  checksum: c4300ddcd93ed03fc9c6cdf1f77890be
  content_type: application/pdf
  creator: cziletti
  date_created: 2020-10-27T11:37:32Z
  date_updated: 2020-10-27T11:37:32Z
  file_id: '8709'
  file_name: 2020_eLife_Gonçalves.pdf
  file_size: 17355867
  relation: main_file
  success: 1
file_date_updated: 2020-10-27T11:37:32Z
has_accepted_license: '1'
intvolume: '         9'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 0aacfa84-070f-11eb-9043-d7eb2c709234
  call_identifier: H2020
  grant_number: '819603'
  name: Learning the shape of synaptic plasticity rules for neuronal architectures
    and function through machine learning.
publication: eLife
publication_identifier:
  eissn:
  - 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Training deep neural density estimators to identify mechanistic models of neural
  dynamics
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2020'
...
---
OA_place: repository
OA_type: green
_id: '22166'
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).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jacob
  full_name: Fox, Jacob
  last_name: Fox
- first_name: Xiaoyu
  full_name: He, Xiaoyu
  last_name: He
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
citation:
  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>
  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>
  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>.
  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.
  ista: Fox J, He X, Wigderson Y. 2020. Ramsey, Paper, Scissors. Random Structures
    &#38; Algorithms. 57(4), 1157–1173.
  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.
date_created: 2026-06-29T10:54:10Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2026-07-14T08:31:05Z
day: '01'
doi: 10.1002/rsa.20950
extern: '1'
external_id:
  arxiv:
  - '1906.01092'
intvolume: '        57'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1906.01092
month: '12'
oa: 1
oa_version: Preprint
page: 1157-1173
publication: Random Structures & Algorithms
publication_identifier:
  eissn:
  - 1098-2418
  issn:
  - 1042-9832
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ramsey, Paper, Scissors
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2020'
...
---
OA_place: repository
OA_type: green
_id: '22182'
abstract:
- lang: eng
  text: We present a short new proof of the canonical polynomial van der Waerden theorem,
    recently established by Girão.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jacob
  full_name: Fox, Jacob
  last_name: Fox
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
- first_name: Yufei
  full_name: Zhao, Yufei
  last_name: Zhao
citation:
  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>
  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>
  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>.
  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.
  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.
date_created: 2026-06-29T11:00:09Z
date_published: 2020-12-03T00:00:00Z
date_updated: 2026-07-14T09:19:20Z
day: '03'
doi: 10.5802/crmath.101
extern: '1'
external_id:
  arxiv:
  - '2005.04135'
intvolume: '       358'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2005.04135
mathsc:
- 05D10
- 11B30
month: '12'
oa: 1
oa_version: Preprint
page: 957-959
publication: Comptes Rendus Mathématique
publication_identifier:
  eissn:
  - 1778-3569
  issn:
  - 1631-073X
publication_status: published
publisher: Académie des Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: A short proof of the canonical polynomial van der Waerden theorem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 358
year: '2020'
...
---
OA_place: repository
OA_type: green
_id: '22185'
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"
article_number: P1.32
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Xiaoyu
  full_name: He, Xiaoyu
  last_name: He
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
citation:
  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>
  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>.
  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.
  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>.
  short: X. He, Y. Wigderson, The Electronic Journal of Combinatorics 27 (2020).
date_created: 2026-06-29T12:06:14Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2026-07-14T09:42:53Z
day: '01'
doi: 10.37236/9071
extern: '1'
external_id:
  arxiv:
  - '1910.06287'
intvolume: '        27'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1910.06287
mathsc:
- 05C55
- 05D10
month: '02'
oa: 1
oa_version: Preprint
publication: The Electronic Journal of Combinatorics
publication_identifier:
  eissn:
  - 1077-8926
publication_status: published
publisher: The Electronic Journal of Combinatorics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multicolor Ramsey numbers via pseudorandom graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2020'
...
---
OA_place: repository
OA_type: green
_id: '22153'
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."
article_number: P1.32
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Xiaoyu
  full_name: He, Xiaoyu
  last_name: He
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
citation:
  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>
  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>.
  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.
  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>.
  short: X. He, Y. Wigderson, The Electronic Journal of Combinatorics 27 (2020).
das_tickbox: '1'
date_created: 2026-06-29T10:47:47Z
date_published: 2020-02-07T00:00:00Z
date_updated: 2026-07-14T09:55:01Z
day: '07'
doi: 10.37236/9071
extern: '1'
external_id:
  arxiv:
  - '1910.06287'
intvolume: '        27'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1910.06287
month: '02'
oa: 1
oa_version: Preprint
publication: The Electronic Journal of Combinatorics
publication_identifier:
  issn:
  - 1077-8926
publication_status: published
publisher: The Electronic Journal of Combinatorics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multicolor Ramsey numbers via pseudorandom graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2020'
...
---
OA_type: closed access
_id: '22216'
abstract:
- lang: eng
  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.
article_processing_charge: No
article_type: original
author:
- first_name: Carla
  full_name: Fernández-Rico, Carla
  id: 492def71-6250-11f0-b278-d41dbd241b62
  last_name: Fernández-Rico
- first_name: Massimiliano
  full_name: Chiappini, Massimiliano
  last_name: Chiappini
- first_name: Taiki
  full_name: Yanagishima, Taiki
  last_name: Yanagishima
- first_name: Heidi
  full_name: de Sousa, Heidi
  last_name: de Sousa
- first_name: Dirk G. A. L.
  full_name: Aarts, Dirk G. A. L.
  last_name: Aarts
- first_name: Marjolein
  full_name: Dijkstra, Marjolein
  last_name: Dijkstra
- first_name: Roel P. A.
  full_name: Dullens, Roel P. A.
  last_name: Dullens
citation:
  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>
  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>
  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>.
  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.
  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.
  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.
date_created: 2026-06-30T06:33:29Z
date_published: 2020-08-21T00:00:00Z
date_updated: 2026-07-15T07:45:41Z
day: '21'
doi: 10.1126/science.abb4536
extern: '1'
external_id:
  pmid:
  - '32820121'
intvolume: '       369'
issue: '6506'
language:
- iso: eng
month: '08'
oa_version: None
page: 950-955
pmid: 1
publication: Science
publication_identifier:
  eissn:
  - 1095-9203
  issn:
  - 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Shaping colloidal bananas to reveal biaxial, splay-bend nematic, and smectic
  phases
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 369
year: '2020'
...
---
OA_type: green
_id: '7467'
abstract:
- lang: eng
  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.
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.
article_processing_charge: No
article_type: original
author:
- first_name: Doris
  full_name: Cadavid, Doris
  last_name: Cadavid
- first_name: Silvia
  full_name: Ortega, Silvia
  last_name: Ortega
- first_name: Sergio
  full_name: Illera, Sergio
  last_name: Illera
- first_name: Yu
  full_name: Liu, Yu
  id: 2A70014E-F248-11E8-B48F-1D18A9856A87
  last_name: Liu
  orcid: 0000-0001-7313-6740
- first_name: Maria
  full_name: Ibáñez, Maria
  id: 43C61214-F248-11E8-B48F-1D18A9856A87
  last_name: Ibáñez
  orcid: 0000-0001-5013-2843
- first_name: Alexey
  full_name: Shavel, Alexey
  last_name: Shavel
- first_name: Yu
  full_name: Zhang, Yu
  last_name: Zhang
- first_name: Mengyao
  full_name: Li, Mengyao
  last_name: Li
- first_name: Antonio M.
  full_name: López, Antonio M.
  last_name: López
- first_name: Germán
  full_name: Noriega, Germán
  last_name: Noriega
- first_name: Oscar Juan
  full_name: Durá, Oscar Juan
  last_name: Durá
- first_name: M. A.
  full_name: López De La Torre, M. A.
  last_name: López De La Torre
- first_name: Joan Daniel
  full_name: Prades, Joan Daniel
  last_name: Prades
- first_name: Andreu
  full_name: Cabot, Andreu
  last_name: Cabot
citation:
  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>
  chicago: Cadavid, Doris, Silvia Ortega, Sergio Illera, Yu Liu, Maria Ibáñez, Alexey
    Shavel, Yu Zhang, et al. “Influence of the Ligand Stripping on the Transport Properties
    of Nanoparticle-Based PbSe Nanomaterials.” <i>ACS Applied Energy Materials</i>.
    American Chemical Society, 2020. <a href="https://doi.org/10.1021/acsaem.9b02137">https://doi.org/10.1021/acsaem.9b02137</a>.
  ieee: D. Cadavid <i>et al.</i>, “Influence of the ligand stripping on the transport
    properties of nanoparticle-based PbSe nanomaterials,” <i>ACS Applied Energy Materials</i>,
    vol. 3, no. 3. American Chemical Society, pp. 2120–2129, 2020.
  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.
  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>.
  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.
date_created: 2020-02-09T23:00:52Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2026-07-28T12:54:00Z
day: '01'
ddc:
- '540'
department:
- _id: MaIb
doi: 10.1021/acsaem.9b02137
ec_funded: 1
external_id:
  isi:
  - '000526598300012'
file:
- access_level: open_access
  checksum: f23be731a766a480c77c962c1380315c
  content_type: application/pdf
  creator: dernst
  date_created: 2022-08-23T08:34:17Z
  date_updated: 2022-08-23T08:34:17Z
  file_id: '11942'
  file_name: 2020_ACSAppliedEnergyMat_Cadavid.pdf
  file_size: 6423548
  relation: main_file
  success: 1
file_date_updated: 2022-08-23T08:34:17Z
has_accepted_license: '1'
intvolume: '         3'
isi: 1
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Accepted Version
page: 2120-2129
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: ACS Applied Energy Materials
publication_identifier:
  eissn:
  - 2574-0962
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Influence of the ligand stripping on the transport properties of nanoparticle-based
  PbSe nanomaterials
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2020'
...
---
OA_place: publisher
_id: '8589'
abstract:
- lang: eng
  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.
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
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.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Huibin
  full_name: Han, Huibin
  id: 31435098-F248-11E8-B48F-1D18A9856A87
  last_name: Han
citation:
  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>
  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>
  chicago: Han, Huibin. “Novel Insights into PIN Polarity Regulation during Arabidopsis
    Development.” Institute of Science and Technology Austria, 2020. <a href="https://doi.org/10.15479/AT:ISTA:8589">https://doi.org/10.15479/AT:ISTA:8589</a>.
  ieee: H. Han, “Novel insights into PIN polarity regulation during Arabidopsis development,”
    Institute of Science and Technology Austria, 2020.
  ista: Han H. 2020. Novel insights into PIN polarity regulation during Arabidopsis
    development. Institute of Science and Technology Austria.
  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.
corr_author: '1'
date_created: 2020-09-30T14:50:51Z
date_published: 2020-09-30T00:00:00Z
date_updated: 2026-07-28T12:51:58Z
day: '30'
ddc:
- '580'
degree_awarded: PhD
department:
- _id: JiFr
doi: 10.15479/AT:ISTA:8589
file:
- access_level: closed
  checksum: c4bda1947d4c09c428ac9ce667b02327
  content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
  creator: dernst
  date_created: 2020-09-30T14:50:20Z
  date_updated: 2020-09-30T14:50:20Z
  file_id: '8590'
  file_name: 2020_Han_Thesis.docx
  file_size: 49198118
  relation: source_file
- access_level: open_access
  checksum: 3f4f5d1718c2230adf30639ecaf8a00b
  content_type: application/pdf
  creator: dernst
  date_created: 2020-09-30T14:49:59Z
  date_updated: 2021-10-01T13:33:02Z
  file_id: '8591'
  file_name: 2020_Han_Thesis.pdf
  file_size: 15513963
  relation: main_file
file_date_updated: 2021-10-01T13:33:02Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '164'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '7643'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Jiří
  full_name: Friml, Jiří
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
title: Novel insights into PIN polarity regulation during Arabidopsis development
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
OA_place: repository
OA_type: green
_id: '8322'
abstract:
- lang: eng
  text: "Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz,
    as a method for protecting cryptographic protocols against attacks on the devices
    of the honest parties. In a nutshell: a reverse firewall is placed outside of
    a device and its goal is to “sanitize” the messages sent by it, in such a way
    that a malicious device cannot leak its secrets to the outside world. It is typically
    assumed that the cryptographic devices are attacked in a “functionality-preserving
    way” (i.e. informally speaking, the functionality of the protocol remains unchanged
    under this attacks). In their paper, Mironov and Stephens-Davidowitz construct
    a protocol for passively-secure two-party computations with firewalls, leaving
    extension of this result to stronger models as an open question.\r\nIn this paper,
    we address this problem by constructing a protocol for secure computation with
    firewalls that has two main advantages over the original protocol from Eurocrypt
    2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary
    number n of the parties, and not just for 2). Secondly, it is secure in much stronger
    corruption settings, namely in the active corruption model. More precisely: we
    consider an adversary that can fully corrupt up to \U0001D45B−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)."
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.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Suvradip
  full_name: Chakraborty, Suvradip
  id: B9CD0494-D033-11E9-B219-A439E6697425
  last_name: Chakraborty
- first_name: Stefan
  full_name: Dziembowski, Stefan
  last_name: Dziembowski
- first_name: Jesper Buus
  full_name: Nielsen, Jesper Buus
  last_name: Nielsen
citation:
  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>'
  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>'
  chicago: Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.”
    In <i>Advances in Cryptology – CRYPTO 2020</i>, 12171:732–62. Springer Nature,
    2020. <a href="https://doi.org/10.1007/978-3-030-56880-1_26">https://doi.org/10.1007/978-3-030-56880-1_26</a>.
  ieee: S. Chakraborty, S. Dziembowski, and J. B. Nielsen, “Reverse firewalls for actively secure MPCs,”
    in <i>Advances in Cryptology – CRYPTO 2020</i>, Santa Barbara, CA, United States,
    2020, vol. 12171, pp. 732–762.
  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.'
  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.
conference:
  end_date: 2020-08-21
  location: Santa Barbara, CA, United States
  name: 'CRYPTO: Annual International Cryptology Conference'
  start_date: 2020-08-17
cryptoeprintid: 1
date_created: 2020-08-30T22:01:12Z
date_published: 2020-08-10T00:00:00Z
date_updated: 2026-07-28T12:45:44Z
day: '10'
department:
- _id: KrPi
doi: 10.1007/978-3-030-56880-1_26
ec_funded: 1
external_id:
  cryptoeprintid:
  - 2019/1317
  isi:
  - '001415325700026'
intvolume: '     12171'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2019/1317
month: '08'
oa: 1
oa_version: Preprint
page: 732-762
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '682815'
  name: Teaching Old Crypto New Tricks
publication: Advances in Cryptology – CRYPTO 2020
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783030568795'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reverse firewalls for actively secure MPCs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12171
year: '2020'
...
---
OA_place: publisher
OA_type: free access
_id: '7636'
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."
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). "
article_processing_charge: No
author:
- first_name: Trevor A
  full_name: Brown, Trevor A
  id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
  last_name: Brown
- first_name: Aleksandar
  full_name: Prokopec, Aleksandar
  last_name: Prokopec
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
citation:
  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>'
  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.'
  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>.
  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.
conference:
  end_date: 2020-02-26
  location: San Diego, CA, United States
  name: 'PPOPP: Principles and Practice of Parallel Programming'
  start_date: 2020-02-22
date_created: 2020-04-05T22:00:49Z
date_published: 2020-02-19T00:00:00Z
date_updated: 2026-07-28T12:49:59Z
day: '19'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1145/3332466.3374542
ec_funded: 1
external_id:
  isi:
  - '000564476500020'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1145/3332466.3374542
month: '02'
oa: 1
oa_version: Published Version
page: 276-291
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '805223'
  name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of
  Parallel Programming
publication_identifier:
  isbn:
  - '9781450368186'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Non-blocking interpolation search trees with doubly-logarithmic running time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
OA_place: publisher
OA_type: free access
_id: '7472'
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.
acknowledged_ssus:
- _id: M-Shop
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 ).
article_processing_charge: No
article_type: original
author:
- first_name: Karola
  full_name: Käfer, Karola
  id: 2DAA49AA-F248-11E8-B48F-1D18A9856A87
  last_name: Käfer
- first_name: Michele
  full_name: Nardin, Michele
  id: 30BD0376-F248-11E8-B48F-1D18A9856A87
  last_name: Nardin
  orcid: 0000-0001-8849-6570
- first_name: Karel
  full_name: Blahna, Karel
  id: 3EA859AE-F248-11E8-B48F-1D18A9856A87
  last_name: Blahna
- first_name: Jozsef L
  full_name: Csicsvari, Jozsef L
  id: 3FA14672-F248-11E8-B48F-1D18A9856A87
  last_name: Csicsvari
  orcid: 0000-0002-5193-4036
citation:
  ama: Käfer K, Nardin M, Blahna K, Csicsvari JL. Replay of behavioral sequences in
    the medial prefrontal cortex during rule switching. <i>Neuron</i>. 2020;106(1):P154-165.e6.
    doi:<a href="https://doi.org/10.1016/j.neuron.2020.01.015">10.1016/j.neuron.2020.01.015</a>
  apa: Käfer, K., Nardin, M., Blahna, K., &#38; Csicsvari, J. L. (2020). Replay of
    behavioral sequences in the medial prefrontal cortex during rule switching. <i>Neuron</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.neuron.2020.01.015">https://doi.org/10.1016/j.neuron.2020.01.015</a>
  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>.
  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.
  ista: Käfer K, Nardin M, Blahna K, Csicsvari JL. 2020. Replay of behavioral sequences
    in the medial prefrontal cortex during rule switching. Neuron. 106(1), P154–165.e6.
  mla: Käfer, Karola, et al. “Replay of Behavioral Sequences in the Medial Prefrontal
    Cortex during Rule Switching.” <i>Neuron</i>, vol. 106, no. 1, Elsevier, 2020,
    p. P154–165.e6, doi:<a href="https://doi.org/10.1016/j.neuron.2020.01.015">10.1016/j.neuron.2020.01.015</a>.
  short: K. Käfer, M. Nardin, K. Blahna, J.L. Csicsvari, Neuron 106 (2020) P154–165.e6.
corr_author: '1'
date_created: 2020-02-10T15:45:48Z
date_published: 2020-04-08T00:00:00Z
date_updated: 2026-07-28T12:55:10Z
day: '08'
ddc:
- '570'
department:
- _id: JoCs
doi: 10.1016/j.neuron.2020.01.015
ec_funded: 1
external_id:
  isi:
  - '000525319300016'
  pmid:
  - '32032512'
intvolume: '       106'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1016/j.neuron.2020.01.015
month: '04'
oa: 1
oa_version: Published Version
page: P154-165.e6
pmid: 1
project:
- _id: 257BBB4C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '607616'
  name: inter-and intracellular signalling in schizophrenia
publication: Neuron
publication_identifier:
  issn:
  - 0896-6273
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
  link:
  - description: News on IST Homepage
    relation: press_release
    url: https://ist.ac.at/en/news/this-brain-area-helps-us-decide/
scopus_import: '1'
status: public
title: Replay of behavioral sequences in the medial prefrontal cortex during rule
  switching
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 106
year: '2020'
...
---
OA_place: publisher
OA_type: free access
_id: '7643'
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.
article_processing_charge: No
article_type: letter_editor
author:
- first_name: Huibin
  full_name: Han, Huibin
  id: 31435098-F248-11E8-B48F-1D18A9856A87
  last_name: Han
- first_name: Hana
  full_name: Rakusova, Hana
  id: 4CAAA450-78D2-11EA-8E57-B40A396E08BA
  last_name: Rakusova
- first_name: Inge
  full_name: Verstraeten, Inge
  id: 362BF7FE-F248-11E8-B48F-1D18A9856A87
  last_name: Verstraeten
  orcid: 0000-0001-7241-2328
- first_name: Yuzhou
  full_name: Zhang, Yuzhou
  id: 3B6137F2-F248-11E8-B48F-1D18A9856A87
  last_name: Zhang
  orcid: 0000-0003-2627-6956
- first_name: Jiří
  full_name: Friml, Jiří
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: Han H, Rakusova H, Verstraeten I, Zhang Y, Friml J. SCF TIR1/AFB auxin signaling
    for bending termination during shoot gravitropism. <i>Plant Physiology</i>. 2020;183(5):37-40.
    doi:<a href="https://doi.org/10.1104/pp.20.00212">10.1104/pp.20.00212</a>
  apa: Han, H., Rakusova, H., Verstraeten, I., Zhang, Y., &#38; Friml, J. (2020).
    SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism.
    <i>Plant Physiology</i>. American Society of Plant Biologists. <a href="https://doi.org/10.1104/pp.20.00212">https://doi.org/10.1104/pp.20.00212</a>
  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>.
  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.
  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.
corr_author: '1'
date_created: 2020-04-06T10:06:40Z
date_published: 2020-05-08T00:00:00Z
date_updated: 2026-07-28T12:51:59Z
day: '08'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1104/pp.20.00212
ec_funded: 1
external_id:
  isi:
  - '000536641800018'
  pmid:
  - '32107280'
intvolume: '       183'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1104/pp.20.00212
month: '05'
oa: 1
oa_version: Published Version
page: 37-40
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '742985'
  name: Tracing Evolution of Auxin Transport and Polarity in Plants
- _id: 26538374-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I03630
  name: Molecular mechanisms of endocytic cargo recognition in plants
publication: Plant Physiology
publication_identifier:
  eissn:
  - 1532-2548
  issn:
  - 0032-0889
publication_status: published
publisher: American Society of Plant Biologists
quality_controlled: '1'
related_material:
  record:
  - id: '8589'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: SCF TIR1/AFB auxin signaling for bending termination during shoot gravitropism
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 183
year: '2020'
...
---
_id: '8382'
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.
article_processing_charge: No
author:
- first_name: Mirza Ahad
  full_name: Baig, Mirza Ahad
  id: 3EDE6DE4-AA5A-11E9-986D-341CE6697425
  last_name: Baig
- first_name: Danny
  full_name: Hendler, Danny
  last_name: Hendler
- first_name: Alessia
  full_name: Milani, Alessia
  last_name: Milani
- first_name: Corentin
  full_name: Travers, Corentin
  last_name: Travers
citation:
  ama: 'Baig MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic
    amortized step complexity. In: <i>Proceedings of the 39th Symposium on Principles
    of Distributed Computing</i>. Association for Computing Machinery; 2020:31-40.
    doi:<a href="https://doi.org/10.1145/3382734.3406005">10.1145/3382734.3406005</a>'
  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>'
  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>.
  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.
  ista: 'Baig MA, Hendler D, Milani A, Travers C. 2020. Long-lived snapshots with
    polylogarithmic amortized step complexity. Proceedings of the 39th Symposium on
    Principles of Distributed Computing. PODC: Principles of Distributed Computing,
    31–40.'
  mla: Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized
    Step Complexity.” <i>Proceedings of the 39th Symposium on Principles of Distributed
    Computing</i>, Association for Computing Machinery, 2020, pp. 31–40, doi:<a href="https://doi.org/10.1145/3382734.3406005">10.1145/3382734.3406005</a>.
  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.
conference:
  end_date: 2020-08-07
  location: Virtual, Italy
  name: 'PODC: Principles of Distributed Computing'
  start_date: 2020-08-03
das_tickbox: '1'
date_created: 2020-09-13T22:01:17Z
date_published: 2020-07-31T00:00:00Z
date_updated: 2026-07-28T09:50:30Z
day: '31'
department:
- _id: GradSch
doi: 10.1145/3382734.3406005
external_id:
  isi:
  - '001436693500004'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://hal.archives-ouvertes.fr/hal-02860087/document
month: '07'
oa: 1
oa_version: Preprint
page: 31-40
publication: Proceedings of the 39th Symposium on Principles of Distributed Computing
publication_identifier:
  isbn:
  - '9781450375825'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Long-lived snapshots with polylogarithmic amortized step complexity
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
OA_place: publisher
OA_type: hybrid
_id: '6952'
abstract:
- lang: eng
  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.'
acknowledgement: Open access funding provided by Institute of Science and Technology
  (IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Paul M
  full_name: Henderson, Paul M
  id: 13C09E74-18D9-11E9-8878-32CFE5697425
  last_name: Henderson
  orcid: 0000-0002-5198-7445
- first_name: Vittorio
  full_name: Ferrari, Vittorio
  last_name: Ferrari
citation:
  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>
  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>
  chicago: Henderson, Paul M, and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction
    by Generative Modelling of Shape, Pose and Shading.” <i>International Journal
    of Computer Vision</i>. Springer Nature, 2020. <a href="https://doi.org/10.1007/s11263-019-01219-8">https://doi.org/10.1007/s11263-019-01219-8</a>.
  ieee: P. M. Henderson and V. Ferrari, “Learning single-image 3D reconstruction by
    generative modelling of shape, pose and shading,” <i>International Journal of
    Computer Vision</i>, vol. 128. Springer Nature, pp. 835–854, 2020.
  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.
  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.
corr_author: '1'
date_created: 2019-10-17T13:38:20Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2026-07-28T13:01:49Z
day: '01'
ddc:
- '004'
department:
- _id: ChLa
doi: 10.1007/s11263-019-01219-8
external_id:
  arxiv:
  - '1901.06447'
  isi:
  - '000491042100002'
file:
- access_level: open_access
  checksum: a0f05dd4f5f64e4f713d8d9d4b5b1e3f
  content_type: application/pdf
  creator: dernst
  date_created: 2019-10-25T10:28:29Z
  date_updated: 2020-07-14T12:47:46Z
  file_id: '6973'
  file_name: 2019_CompVision_Henderson.pdf
  file_size: 2243134
  relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: '       128'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 835-854
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
publication: International Journal of Computer Vision
publication_identifier:
  eissn:
  - 1573-1405
  issn:
  - 0920-5691
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning single-image 3D reconstruction by generative modelling of shape, pose
  and shading
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 128
year: '2020'
...
---
_id: '8755'
abstract:
- lang: eng
  text: 'The superconducting circuit community has recently discovered the promising
    potential of superinductors. These circuit elements have a characteristic impedance
    exceeding the resistance quantum RQ ≈ 6.45 kΩ which leads to a suppression of
    ground state charge fluctuations. Applications include the realization of hardware
    protected qubits for fault tolerant quantum computing, improved coupling to small
    dipole moment objects and defining a new quantum metrology standard for the ampere.
    In this work we refute the widespread notion that superinductors can only be implemented
    based on kinetic inductance, i.e. using disordered superconductors or Josephson
    junction arrays. We present modeling, fabrication and characterization of 104
    planar aluminum coil resonators with a characteristic impedance up to 30.9 kΩ
    at 5.6 GHz and a capacitance down to ≤ 1 fF, with lowloss and a power handling
    reaching 108 intra-cavity photons. Geometric superinductors are free of uncontrolled
    tunneling events and offer high reproducibility, linearity and the ability to
    couple magnetically - properties that significantly broaden the scope of future
    quantum circuits. '
acknowledged_ssus:
- _id: NanoFab
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). "
article_number: '044055'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Matilda
  full_name: Peruzzo, Matilda
  id: 3F920B30-F248-11E8-B48F-1D18A9856A87
  last_name: Peruzzo
  orcid: 0000-0002-3415-4628
- first_name: Andrea
  full_name: Trioni, Andrea
  id: 42F71B44-F248-11E8-B48F-1D18A9856A87
  last_name: Trioni
- first_name: Farid
  full_name: Hassani, Farid
  id: 2AED110C-F248-11E8-B48F-1D18A9856A87
  last_name: Hassani
  orcid: 0000-0001-6937-5773
- first_name: Martin
  full_name: Zemlicka, Martin
  id: 2DCF8DE6-F248-11E8-B48F-1D18A9856A87
  last_name: Zemlicka
  orcid: 0009-0005-0878-3032
- first_name: Johannes M
  full_name: Fink, Johannes M
  id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
  last_name: Fink
  orcid: 0000-0001-8112-028X
citation:
  ama: Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. Surpassing the resistance
    quantum with a geometric superinductor. <i>Physical Review Applied</i>. 2020;14(4).
    doi:<a href="https://doi.org/10.1103/PhysRevApplied.14.044055">10.1103/PhysRevApplied.14.044055</a>
  apa: Peruzzo, M., Trioni, A., Hassani, F., Zemlicka, M., &#38; Fink, J. M. (2020).
    Surpassing the resistance quantum with a geometric superinductor. <i>Physical
    Review Applied</i>. American Physical Society. <a href="https://doi.org/10.1103/PhysRevApplied.14.044055">https://doi.org/10.1103/PhysRevApplied.14.044055</a>
  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>.
  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.
  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.
  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).
date_created: 2020-11-15T23:01:17Z
date_published: 2020-10-29T00:00:00Z
date_updated: 2026-07-29T13:12:09Z
day: '29'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.1103/PhysRevApplied.14.044055
ec_funded: 1
external_id:
  arxiv:
  - '2007.01644'
  isi:
  - '000582797300003'
file:
- access_level: open_access
  checksum: 2a634abe75251ae7628cd54c8a4ce2e8
  content_type: application/pdf
  creator: dernst
  date_created: 2021-03-29T11:43:20Z
  date_updated: 2021-03-29T11:43:20Z
  file_id: '9300'
  file_name: 2020_PhysReviewApplied_Peruzzo.pdf
  file_size: 2607823
  relation: main_file
  success: 1
file_date_updated: 2021-03-29T11:43:20Z
has_accepted_license: '1'
intvolume: '        14'
isi: 1
issue: '4'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 257EB838-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '732894'
  name: Hybrid Optomechanical Technologies
- _id: 237CBA6C-32DE-11EA-91FC-C7463DDC885E
  call_identifier: H2020
  grant_number: '862644'
  name: Quantum readout techniques and technologies
- _id: 26336814-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '758053'
  name: A Fiber Optic Transceiver for Superconducting Qubits
- _id: bdb108fd-d553-11ed-ba76-83dc74a9864f
  grant_number: F07105
  name: QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration
    of Superconducting Quantum Circuits
publication: Physical Review Applied
publication_identifier:
  eissn:
  - 2331-7019
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
  record:
  - id: '13070'
    relation: research_data
    status: public
  - id: '9920'
    relation: dissertation_contains
    status: public
  - id: '17133'
    relation: dissertation_contains
    status: public
  - id: '20371'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Surpassing the resistance quantum with a geometric superinductor
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2020'
...
---
_id: '6185'
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).
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.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: László
  full_name: Erdös, László
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
- first_name: Torben H
  full_name: Krüger, Torben H
  id: 3020C786-F248-11E8-B48F-1D18A9856A87
  last_name: Krüger
  orcid: 0000-0002-4821-3297
- first_name: Dominik J
  full_name: Schröder, Dominik J
  id: 408ED176-F248-11E8-B48F-1D18A9856A87
  last_name: Schröder
  orcid: 0000-0002-2904-1856
citation:
  ama: 'Erdös L, Krüger TH, Schröder DJ. Cusp universality for random matrices I:
    Local law and the complex Hermitian case. <i>Communications in Mathematical Physics</i>.
    2020;378:1203-1278. doi:<a href="https://doi.org/10.1007/s00220-019-03657-4">10.1007/s00220-019-03657-4</a>'
  apa: 'Erdös, L., Krüger, T. H., &#38; Schröder, D. J. (2020). Cusp universality
    for random matrices I: Local law and the complex Hermitian case. <i>Communications
    in Mathematical Physics</i>. Springer Nature. <a href="https://doi.org/10.1007/s00220-019-03657-4">https://doi.org/10.1007/s00220-019-03657-4</a>'
  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>.'
  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.'
  ista: 'Erdös L, Krüger TH, Schröder DJ. 2020. Cusp universality for random matrices
    I: Local law and the complex Hermitian case. Communications in Mathematical Physics.
    378, 1203–1278.'
  mla: 'Erdös, László, et al. “Cusp Universality for Random Matrices I: Local Law
    and the Complex Hermitian Case.” <i>Communications in Mathematical Physics</i>,
    vol. 378, Springer Nature, 2020, pp. 1203–78, doi:<a href="https://doi.org/10.1007/s00220-019-03657-4">10.1007/s00220-019-03657-4</a>.'
  short: L. Erdös, T.H. Krüger, D.J. Schröder, Communications in Mathematical Physics
    378 (2020) 1203–1278.
date_created: 2019-03-28T10:21:15Z
date_published: 2020-09-01T00:00:00Z
date_updated: 2026-07-29T13:46:19Z
day: '01'
ddc:
- '530'
- '510'
department:
- _id: LaEr
doi: 10.1007/s00220-019-03657-4
ec_funded: 1
external_id:
  arxiv:
  - '1809.03971'
  isi:
  - '000529483000001'
file:
- access_level: open_access
  checksum: c3a683e2afdcea27afa6880b01e53dc2
  content_type: application/pdf
  creator: dernst
  date_created: 2020-11-18T11:14:37Z
  date_updated: 2020-11-18T11:14:37Z
  file_id: '8771'
  file_name: 2020_CommMathPhysics_Erdoes.pdf
  file_size: 2904574
  relation: main_file
  success: 1
file_date_updated: 2020-11-18T11:14:37Z
has_accepted_license: '1'
intvolume: '       378'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 1203-1278
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '338804'
  name: Random matrices, universality and disordered quantum systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
  name: IST Austria Open Access Fund
publication: Communications in Mathematical Physics
publication_identifier:
  eissn:
  - 1432-0916
  issn:
  - 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '6179'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: 'Cusp universality for random matrices I: Local law and the complex Hermitian
  case'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 378
year: '2020'
...
---
_id: '6184'
abstract:
- lang: eng
  text: We prove edge universality for a general class of correlated real symmetric
    or complex Hermitian Wigner matrices with arbitrary expectation. Our theorem also
    applies to internal edges of the self-consistent density of states. In particular,
    we establish a strong form of band rigidity which excludes mismatches between
    location and label of eigenvalues close to internal edges in these general models.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Johannes
  full_name: Alt, Johannes
  id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
  last_name: Alt
- first_name: László
  full_name: Erdös, László
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
- first_name: Torben H
  full_name: Krüger, Torben H
  id: 3020C786-F248-11E8-B48F-1D18A9856A87
  last_name: Krüger
  orcid: 0000-0002-4821-3297
- first_name: Dominik J
  full_name: Schröder, Dominik J
  id: 408ED176-F248-11E8-B48F-1D18A9856A87
  last_name: Schröder
  orcid: 0000-0002-2904-1856
citation:
  ama: 'Alt J, Erdös L, Krüger TH, Schröder DJ. Correlated random matrices: Band rigidity
    and edge universality. <i>Annals of Probability</i>. 2020;48(2):963-1001. doi:<a
    href="https://doi.org/10.1214/19-AOP1379">10.1214/19-AOP1379</a>'
  apa: 'Alt, J., Erdös, L., Krüger, T. H., &#38; Schröder, D. J. (2020). Correlated
    random matrices: Band rigidity and edge universality. <i>Annals of Probability</i>.
    Institute of Mathematical Statistics. <a href="https://doi.org/10.1214/19-AOP1379">https://doi.org/10.1214/19-AOP1379</a>'
  chicago: 'Alt, Johannes, László Erdös, Torben H Krüger, and Dominik J Schröder.
    “Correlated Random Matrices: Band Rigidity and Edge Universality.” <i>Annals of
    Probability</i>. Institute of Mathematical Statistics, 2020. <a href="https://doi.org/10.1214/19-AOP1379">https://doi.org/10.1214/19-AOP1379</a>.'
  ieee: 'J. Alt, L. Erdös, T. H. Krüger, and D. J. Schröder, “Correlated random matrices:
    Band rigidity and edge universality,” <i>Annals of Probability</i>, vol. 48, no.
    2. Institute of Mathematical Statistics, pp. 963–1001, 2020.'
  ista: 'Alt J, Erdös L, Krüger TH, Schröder DJ. 2020. Correlated random matrices:
    Band rigidity and edge universality. Annals of Probability. 48(2), 963–1001.'
  mla: 'Alt, Johannes, et al. “Correlated Random Matrices: Band Rigidity and Edge
    Universality.” <i>Annals of Probability</i>, vol. 48, no. 2, Institute of Mathematical
    Statistics, 2020, pp. 963–1001, doi:<a href="https://doi.org/10.1214/19-AOP1379">10.1214/19-AOP1379</a>.'
  short: J. Alt, L. Erdös, T.H. Krüger, D.J. Schröder, Annals of Probability 48 (2020)
    963–1001.
date_created: 2019-03-28T09:20:08Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2026-07-29T13:46:19Z
day: '01'
department:
- _id: LaEr
doi: 10.1214/19-AOP1379
ec_funded: 1
external_id:
  arxiv:
  - '1804.07744'
  isi:
  - '000528269100013'
intvolume: '        48'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1804.07744
month: '03'
oa: 1
oa_version: Preprint
page: 963-1001
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '338804'
  name: Random matrices, universality and disordered quantum systems
publication: Annals of Probability
publication_identifier:
  issn:
  - 0091-1798
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
related_material:
  record:
  - id: '149'
    relation: dissertation_contains
    status: public
  - id: '6179'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: 'Correlated random matrices: Band rigidity and edge universality'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2020'
...
---
_id: '7481'
abstract:
- lang: eng
  text: 'We address the following question:  How redundant is the parameterisation
    of ReLU networks? Specifically, we consider transformations of the weight space
    which leave the function implemented by the network intact.  Two such transformations
    are known for feed-forward architectures:  permutation of neurons within a layer,
    and positive scaling of all incoming weights of a neuron coupled with inverse
    scaling of its outgoing weights. In this work, we show for architectures with
    non-increasing widths that permutation and scaling are in fact the only function-preserving
    weight transformations.  For any eligible architecture we give an explicit construction
    of a neural network such that any other network that implements the same function
    can be obtained from the original one by the application of permutations and rescaling.  The
    proof relies on a geometric understanding of boundaries between linear regions
    of ReLU networks, and we hope the developed mathematical tools are of independent
    interest.'
article_processing_charge: No
author:
- first_name: Phuong
  full_name: Bui Thi Mai, Phuong
  id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87
  last_name: Bui Thi Mai
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
citation:
  ama: 'Phuong M, Lampert C. Functional vs. parametric equivalence of ReLU networks.
    In: <i>8th International Conference on Learning Representations</i>. ; 2020.'
  apa: Phuong, M., &#38; Lampert, C. (2020). Functional vs. parametric equivalence
    of ReLU networks. In <i>8th International Conference on Learning Representations</i>.
    Online.
  chicago: Phuong, Mary, and Christoph Lampert. “Functional vs. Parametric Equivalence
    of ReLU Networks.” In <i>8th International Conference on Learning Representations</i>,
    2020.
  ieee: M. Phuong and C. Lampert, “Functional vs. parametric equivalence of ReLU networks,”
    in <i>8th International Conference on Learning Representations</i>, Online, 2020.
  ista: 'Phuong M, Lampert C. 2020. Functional vs. parametric equivalence of ReLU
    networks. 8th International Conference on Learning Representations. ICLR: International
    Conference on Learning Representations.'
  mla: Phuong, Mary, and Christoph Lampert. “Functional vs. Parametric Equivalence
    of ReLU Networks.” <i>8th International Conference on Learning Representations</i>,
    2020.
  short: M. Phuong, C. Lampert, in:, 8th International Conference on Learning Representations,
    2020.
conference:
  end_date: 2020-04-30
  location: Online
  name: 'ICLR: International Conference on Learning Representations'
  start_date: 2020-04-27
corr_author: '1'
date_created: 2020-02-11T09:07:37Z
date_published: 2020-04-26T00:00:00Z
date_updated: 2026-07-30T05:33:51Z
day: '26'
ddc:
- '000'
department:
- _id: ChLa
file:
- access_level: open_access
  checksum: 8d372ea5defd8cb8fdc430111ed754a9
  content_type: application/pdf
  creator: bphuong
  date_created: 2020-02-11T09:07:27Z
  date_updated: 2020-07-14T12:47:59Z
  file_id: '7482'
  file_name: main.pdf
  file_size: 405469
  relation: main_file
file_date_updated: 2020-07-14T12:47:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: 8th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
related_material:
  link:
  - relation: supplementary_material
    url: https://iclr.cc/virtual_2020/poster_Bylx-TNKvH.html
  record:
  - id: '9418'
    relation: dissertation_contains
    status: public
status: public
title: Functional vs. parametric equivalence of ReLU networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
OA_place: publisher
OA_type: hybrid
_id: '22479'
abstract:
- lang: eng
  text: <jats:title>Abstract</jats:title><jats:p>Climate impact studies often require
    climate data at a higher space–time resolution than is available from global and
    regional climate models. Weather generator (WG) models, generally designed for
    mesoscale applications (e.g., 10<jats:sup>1</jats:sup>–10<jats:sup>5</jats:sup>
    km<jats:sup>2</jats:sup>), are popular and widely used tools to downscale climate
    data to finer resolution. One advantage of using WGs is their ability to generate
    the necessary climate variables for impact studies in data sparse regions. In
    this study, we evaluate the ability of a previously established state of the art
    WG (the AWE‐GEN‐2d model) to perform in data sparse regions that are beyond the
    mesoscale, using the Zambezi River basin (10<jats:sup>6</jats:sup> km<jats:sup>2</jats:sup>)
    in southeast Africa as a case study. The AWE‐GEN‐2d model was calibrated using
    data from satellite retrievals and climate re‐analysis products in place of the
    absent observational data. An 8‐km climate ensemble at hourly resolution, covering
    the period of 1976–2099 (present climate and RCP4.5 emission scenario from 2020),
    was then simulated. Using the simulated 30‐member ensemble, climate indices for
    both present and future climates were computed. The high‐resolution climate indices
    allow detailed analysis of the effects of climate change on different areas within
    the basin. For example, the southwestern area of the basin is predicted to experience
    the greatest change due to increased temperature, while the southeastern area
    was found to be already so hot that is less affected (e.g., the number of 'very
    hot days' per year increase by 18 and 9 days, respectively). Rainfall intensities
    are found to increase most in the eastern areas of the basin (1 mm·d<jats:sup>−1</jats:sup>)
    in comparison to the western region (0.3 mm·d<jats:sup>−1</jats:sup>). As demonstrated
    in this study, AWE‐GEN‐2d can be calibrated successfully using data from climate
    reanalysis products in the absence of ground station data and can be applied at
    larger scales than the mesoscale.</jats:p>
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Nadav
  full_name: Peleg, Nadav
  last_name: Peleg
- first_name: Scott
  full_name: Sinclair, Scott
  last_name: Sinclair
- first_name: Simone
  full_name: Fatichi, Simone
  id: cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6
  last_name: Fatichi
- first_name: Paolo
  full_name: Burlando, Paolo
  last_name: Burlando
citation:
  ama: 'Peleg N, Sinclair S, Fatichi S, Burlando P. Downscaling climate projections
    over large and data sparse regions: Methodological application in the Zambezi
    River Basin. <i>International Journal of Climatology</i>. 2020;40(15):6242-6264.
    doi:<a href="https://doi.org/10.1002/joc.6578">10.1002/joc.6578</a>'
  apa: 'Peleg, N., Sinclair, S., Fatichi, S., &#38; Burlando, P. (2020). Downscaling
    climate projections over large and data sparse regions: Methodological application
    in the Zambezi River Basin. <i>International Journal of Climatology</i>. Wiley.
    <a href="https://doi.org/10.1002/joc.6578">https://doi.org/10.1002/joc.6578</a>'
  chicago: 'Peleg, Nadav, Scott Sinclair, Simone Fatichi, and Paolo Burlando. “Downscaling
    Climate Projections over Large and Data Sparse Regions: Methodological Application
    in the Zambezi River Basin.” <i>International Journal of Climatology</i>. Wiley,
    2020. <a href="https://doi.org/10.1002/joc.6578">https://doi.org/10.1002/joc.6578</a>.'
  ieee: 'N. Peleg, S. Sinclair, S. Fatichi, and P. Burlando, “Downscaling climate
    projections over large and data sparse regions: Methodological application in
    the Zambezi River Basin,” <i>International Journal of Climatology</i>, vol. 40,
    no. 15. Wiley, pp. 6242–6264, 2020.'
  ista: 'Peleg N, Sinclair S, Fatichi S, Burlando P. 2020. Downscaling climate projections
    over large and data sparse regions: Methodological application in the Zambezi
    River Basin. International Journal of Climatology. 40(15), 6242–6264.'
  mla: 'Peleg, Nadav, et al. “Downscaling Climate Projections over Large and Data
    Sparse Regions: Methodological Application in the Zambezi River Basin.” <i>International
    Journal of Climatology</i>, vol. 40, no. 15, Wiley, 2020, pp. 6242–64, doi:<a
    href="https://doi.org/10.1002/joc.6578">10.1002/joc.6578</a>.'
  short: N. Peleg, S. Sinclair, S. Fatichi, P. Burlando, International Journal of
    Climatology 40 (2020) 6242–6264.
das_tickbox: '1'
date_created: 2026-07-27T12:30:23Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2026-07-30T07:10:15Z
day: '01'
ddc:
- '550'
doi: 10.1002/joc.6578
extern: '1'
has_accepted_license: '1'
intvolume: '        40'
issue: '15'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1002/joc.6578
month: '12'
oa: 1
oa_version: Published Version
page: 6242-6264
publication: International Journal of Climatology
publication_identifier:
  eissn:
  - 1097-0088
  issn:
  - 0899-8418
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Downscaling climate projections over large and data sparse regions: Methodological
  application in the Zambezi River Basin'
tmp:
  image: /images/cc_by_nc.png
  legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
  short: CC BY-NC (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2020'
...
