---
_id: '10015'
abstract:
- lang: eng
text: "Auxin plays a dual role in growth regulation and, depending on the tissue
and concentration of the hormone, it can either promote or inhibit division and
expansion processes in plants. Recent studies have revealed that, beyond transcriptional
reprogramming, alternative auxincontrolled mechanisms regulate root growth. Here,
we explored the impact of different concentrations of the synthetic auxin NAA
that establish growth-promoting and -repressing conditions on the root tip proteome
and phosphoproteome, generating a unique resource. From the phosphoproteome data,
we pinpointed (novel) growth regulators, such as the RALF34-THE1 module. Our results,
together with previously published studies, suggest that auxin, H+-ATPases, cell
wall modifications and cell wall sensing receptor-like kinases are tightly embedded
in a pathway regulating cell elongation. Furthermore, our study assigned a novel
role to MKK2 as a regulator of primary root growth and a (potential) regulator
of auxin biosynthesis and signalling, and suggests the importance of the MKK2\r\nThr31
phosphorylation site for growth regulation in the Arabidopsis root tip."
acknowledgement: We thank the Nottingham Stock Centre for seeds, Frank Van Breusegem
for the phb3 mutant, and Herman Höfte for the the1 mutant. Open Access Funding by
the Austrian Science Fund (FWF).
alternative_title:
- Protein Phosphorylation and Cell Signaling in Plants
article_number: '1665 '
article_processing_charge: Yes
article_type: original
author:
- first_name: N
full_name: Nikonorova, N
last_name: Nikonorova
- first_name: E
full_name: Murphy, E
last_name: Murphy
- first_name: CF
full_name: Fonseca de Lima, CF
last_name: Fonseca de Lima
- first_name: S
full_name: Zhu, S
last_name: Zhu
- first_name: B
full_name: van de Cotte, B
last_name: van de Cotte
- first_name: LD
full_name: Vu, LD
last_name: Vu
- first_name: D
full_name: Balcerowicz, D
last_name: Balcerowicz
- first_name: Lanxin
full_name: Li, Lanxin
id: 367EF8FA-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0002-5607-272X
- first_name: X
full_name: Kong, X
last_name: Kong
- first_name: G
full_name: De Rop, G
last_name: De Rop
- first_name: T
full_name: Beeckman, T
last_name: Beeckman
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: K
full_name: Vissenberg, K
last_name: Vissenberg
- first_name: PC
full_name: Morris, PC
last_name: Morris
- first_name: Z
full_name: Ding, Z
last_name: Ding
- first_name: I
full_name: De Smet, I
last_name: De Smet
citation:
ama: Nikonorova N, Murphy E, Fonseca de Lima C, et al. The Arabidopsis root tip
(phospho)proteomes at growth-promoting versus growth-repressing conditions reveal
novel root growth regulators. Cells. 2021;10. doi:10.3390/cells10071665
apa: Nikonorova, N., Murphy, E., Fonseca de Lima, C., Zhu, S., van de Cotte, B.,
Vu, L., … De Smet, I. (2021). The Arabidopsis root tip (phospho)proteomes at growth-promoting
versus growth-repressing conditions reveal novel root growth regulators. Cells.
MDPI. https://doi.org/10.3390/cells10071665
chicago: Nikonorova, N, E Murphy, CF Fonseca de Lima, S Zhu, B van de Cotte, LD
Vu, D Balcerowicz, et al. “The Arabidopsis Root Tip (Phospho)Proteomes at Growth-Promoting
versus Growth-Repressing Conditions Reveal Novel Root Growth Regulators.” Cells.
MDPI, 2021. https://doi.org/10.3390/cells10071665.
ieee: N. Nikonorova et al., “The Arabidopsis root tip (phospho)proteomes
at growth-promoting versus growth-repressing conditions reveal novel root growth
regulators,” Cells, vol. 10. MDPI, 2021.
ista: Nikonorova N, Murphy E, Fonseca de Lima C, Zhu S, van de Cotte B, Vu L, Balcerowicz
D, Li L, Kong X, De Rop G, Beeckman T, Friml J, Vissenberg K, Morris P, Ding Z,
De Smet I. 2021. The Arabidopsis root tip (phospho)proteomes at growth-promoting
versus growth-repressing conditions reveal novel root growth regulators. Cells.
10, 1665.
mla: Nikonorova, N., et al. “The Arabidopsis Root Tip (Phospho)Proteomes at Growth-Promoting
versus Growth-Repressing Conditions Reveal Novel Root Growth Regulators.” Cells,
vol. 10, 1665, MDPI, 2021, doi:10.3390/cells10071665.
short: N. Nikonorova, E. Murphy, C. Fonseca de Lima, S. Zhu, B. van de Cotte, L.
Vu, D. Balcerowicz, L. Li, X. Kong, G. De Rop, T. Beeckman, J. Friml, K. Vissenberg,
P. Morris, Z. Ding, I. De Smet, Cells 10 (2021).
date_created: 2021-09-14T11:36:20Z
date_published: 2021-07-02T00:00:00Z
date_updated: 2024-10-29T10:22:44Z
day: '02'
ddc:
- '575'
department:
- _id: JiFr
doi: 10.3390/cells10071665
ec_funded: 1
external_id:
isi:
- '000676604700001'
pmid:
- '34359847'
file:
- access_level: open_access
checksum: 2a9f534b9c2200e72e2cde95afaf4eed
content_type: application/pdf
creator: cchlebak
date_created: 2021-09-16T09:07:06Z
date_updated: 2021-09-16T09:07:06Z
file_id: '10021'
file_name: 2021_Cells_Nikonorova.pdf
file_size: 2667848
relation: main_file
success: 1
file_date_updated: 2021-09-16T09:07:06Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
keyword:
- primary root
- (phospho)proteomics
- auxin
- (receptor) kinase
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
publication: Cells
publication_identifier:
issn:
- 2073-4409
publication_status: published
publisher: MDPI
quality_controlled: '1'
related_material:
record:
- id: '10083'
relation: dissertation_contains
status: public
status: public
title: The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing
conditions reveal novel root growth regulators
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: 10
year: '2021'
...
---
_id: '10023'
abstract:
- lang: eng
text: We study the temporal dissipation of variance and relative entropy for ergodic
Markov Chains in continuous time, and compute explicitly the corresponding dissipation
rates. These are identified, as is well known, in the case of the variance in
terms of an appropriate Hilbertian norm; and in the case of the relative entropy,
in terms of a Dirichlet form which morphs into a version of the familiar Fisher
information under conditions of detailed balance. Here we obtain trajectorial
versions of these results, valid along almost every path of the random motion
and most transparent in the backwards direction of time. Martingale arguments
and time reversal play crucial roles, as in the recent work of Karatzas, Schachermayer
and Tschiderer for conservative diffusions. Extensions are developed to general
“convex divergences” and to countable state-spaces. The steepest descent and gradient
flow properties for the variance, the relative entropy, and appropriate generalizations,
are studied along with their respective geometries under conditions of detailed
balance, leading to a very direct proof for the HWI inequality of Otto and Villani
in the present context.
acknowledgement: I.K. acknowledges support from the U.S. National Science Foundation
under Grant NSF-DMS-20-04997. J.M. acknowledges support from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 716117) and from the Austrian Science Fund (FWF) through project
F65. W.S. acknowledges support from the Austrian Science Fund (FWF) under grant
P28861 and by the Vienna Science and Technology Fund (WWTF) through projects MA14-008
and MA16-021.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Ioannis
full_name: Karatzas, Ioannis
last_name: Karatzas
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Walter
full_name: Schachermayer, Walter
last_name: Schachermayer
citation:
ama: Karatzas I, Maas J, Schachermayer W. Trajectorial dissipation and gradient
flow for the relative entropy in Markov chains. Communications in Information
and Systems. 2021;21(4):481-536. doi:10.4310/CIS.2021.v21.n4.a1
apa: Karatzas, I., Maas, J., & Schachermayer, W. (2021). Trajectorial dissipation
and gradient flow for the relative entropy in Markov chains. Communications
in Information and Systems. International Press. https://doi.org/10.4310/CIS.2021.v21.n4.a1
chicago: Karatzas, Ioannis, Jan Maas, and Walter Schachermayer. “Trajectorial Dissipation
and Gradient Flow for the Relative Entropy in Markov Chains.” Communications
in Information and Systems. International Press, 2021. https://doi.org/10.4310/CIS.2021.v21.n4.a1.
ieee: I. Karatzas, J. Maas, and W. Schachermayer, “Trajectorial dissipation and
gradient flow for the relative entropy in Markov chains,” Communications in
Information and Systems, vol. 21, no. 4. International Press, pp. 481–536,
2021.
ista: Karatzas I, Maas J, Schachermayer W. 2021. Trajectorial dissipation and gradient
flow for the relative entropy in Markov chains. Communications in Information
and Systems. 21(4), 481–536.
mla: Karatzas, Ioannis, et al. “Trajectorial Dissipation and Gradient Flow for the
Relative Entropy in Markov Chains.” Communications in Information and Systems,
vol. 21, no. 4, International Press, 2021, pp. 481–536, doi:10.4310/CIS.2021.v21.n4.a1.
short: I. Karatzas, J. Maas, W. Schachermayer, Communications in Information and
Systems 21 (2021) 481–536.
date_created: 2021-09-19T08:53:19Z
date_published: 2021-06-04T00:00:00Z
date_updated: 2021-09-20T12:51:18Z
day: '04'
department:
- _id: JaMa
doi: 10.4310/CIS.2021.v21.n4.a1
ec_funded: 1
external_id:
arxiv:
- '2005.14177'
intvolume: ' 21'
issue: '4'
keyword:
- Markov Chain
- relative entropy
- time reversal
- steepest descent
- gradient flow
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.14177
month: '06'
oa: 1
oa_version: Preprint
page: 481-536
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication: Communications in Information and Systems
publication_identifier:
issn:
- 1526-7555
publication_status: published
publisher: International Press
quality_controlled: '1'
status: public
title: Trajectorial dissipation and gradient flow for the relative entropy in Markov
chains
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 21
year: '2021'
...
---
_id: '10024'
abstract:
- lang: eng
text: In this paper, we introduce a random environment for the exclusion process
in obtained by assigning a maximal occupancy to each site. This maximal occupancy
is allowed to randomly vary among sites, and partial exclusion occurs. Under the
assumption of ergodicity under translation and uniform ellipticity of the environment,
we derive a quenched hydrodynamic limit in path space by strengthening the mild
solution approach initiated in Nagy (2002) and Faggionato (2007). To this purpose,
we prove, employing the technology developed for the random conductance model,
a homogenization result in the form of an arbitrary starting point quenched invariance
principle for a single particle in the same environment, which is a result of
independent interest. The self-duality property of the partial exclusion process
allows us to transfer this homogenization result to the particle system and, then,
apply the tightness criterion in Redig et al. (2020).
acknowledgement: The authors would like to thank Marek Biskup and Alberto Chiarini
for useful suggestions and Cristian Giardina, Frank den Hollander and Shubhamoy Nandan for inspiring discussions. S.F. acknowledges Simona Villa for her help in creating the picture. Furthermore,
the authors thank two anonymous referees for the careful reading of the manuscript. S.F.
acknowledges financial support from NWO, The Netherlands via the grant TOP1.17.019.
F.S. acknowledges financial support from NWO via the TOP1 grant 613.001.552 as well as
funding from the European Union’s Horizon 2020 research and innovation programme
under the Marie-Skłodowska-Curie grant agreement No. 754411.
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Simone
full_name: Floreani, Simone
last_name: Floreani
- first_name: Frank
full_name: Redig, Frank
last_name: Redig
- first_name: Federico
full_name: Sau, Federico
id: E1836206-9F16-11E9-8814-AEFDE5697425
last_name: Sau
citation:
ama: Floreani S, Redig F, Sau F. Hydrodynamics for the partial exclusion process
in random environment. Stochastic Processes and their Applications. 2021;142:124-158.
doi:10.1016/j.spa.2021.08.006
apa: Floreani, S., Redig, F., & Sau, F. (2021). Hydrodynamics for the partial
exclusion process in random environment. Stochastic Processes and Their Applications.
Elsevier. https://doi.org/10.1016/j.spa.2021.08.006
chicago: Floreani, Simone, Frank Redig, and Federico Sau. “Hydrodynamics for the
Partial Exclusion Process in Random Environment.” Stochastic Processes and
Their Applications. Elsevier, 2021. https://doi.org/10.1016/j.spa.2021.08.006.
ieee: S. Floreani, F. Redig, and F. Sau, “Hydrodynamics for the partial exclusion
process in random environment,” Stochastic Processes and their Applications,
vol. 142. Elsevier, pp. 124–158, 2021.
ista: Floreani S, Redig F, Sau F. 2021. Hydrodynamics for the partial exclusion
process in random environment. Stochastic Processes and their Applications. 142,
124–158.
mla: Floreani, Simone, et al. “Hydrodynamics for the Partial Exclusion Process in
Random Environment.” Stochastic Processes and Their Applications, vol.
142, Elsevier, 2021, pp. 124–58, doi:10.1016/j.spa.2021.08.006.
short: S. Floreani, F. Redig, F. Sau, Stochastic Processes and Their Applications
142 (2021) 124–158.
date_created: 2021-09-19T22:01:25Z
date_published: 2021-08-27T00:00:00Z
date_updated: 2023-08-14T06:52:43Z
day: '27'
ddc:
- '519'
department:
- _id: JaMa
doi: 10.1016/j.spa.2021.08.006
ec_funded: 1
external_id:
arxiv:
- '1911.12564'
isi:
- '000697748500005'
file:
- access_level: open_access
checksum: 56768c553d7218ee5714902ffec90ec4
content_type: application/pdf
creator: dernst
date_created: 2022-05-13T07:55:50Z
date_updated: 2022-05-13T07:55:50Z
file_id: '11370'
file_name: 2021_StochasticProcessesAppl_Floreani.pdf
file_size: 2115791
relation: main_file
success: 1
file_date_updated: 2022-05-13T07:55:50Z
has_accepted_license: '1'
intvolume: ' 142'
isi: 1
keyword:
- hydrodynamic limit
- random environment
- random conductance model
- arbitrary starting point quenched invariance principle
- duality
- mild solution
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 124-158
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Stochastic Processes and their Applications
publication_identifier:
issn:
- 0304-4149
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Hydrodynamics for the partial exclusion process in random environment
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: 142
year: '2021'
...
---
_id: '10025'
abstract:
- lang: eng
text: Ferromagnetism is most common in transition metal compounds but may also arise
in low-density two-dimensional electron systems, with signatures observed in silicon,
III-V semiconductor systems, and graphene moiré heterostructures. Here we show
that gate-tuned van Hove singularities in rhombohedral trilayer graphene drive
the spontaneous ferromagnetic polarization of the electron system into one or
more spin- and valley flavors. Using capacitance measurements on graphite-gated
van der Waals heterostructures, we find a cascade of density- and electronic displacement
field tuned phase transitions marked by negative electronic compressibility. The
transitions define the boundaries between phases where quantum oscillations have
either four-fold, two-fold, or one-fold degeneracy, associated with a spin and
valley degenerate normal metal, spin-polarized `half-metal', and spin and valley
polarized `quarter metal', respectively. For electron doping, the salient features
are well captured by a phenomenological Stoner model with a valley-anisotropic
Hund's coupling, likely arising from interactions at the lattice scale. For hole
filling, we observe a richer phase diagram featuring a delicate interplay of broken
symmetries and transitions in the Fermi surface topology. Finally, by rotational
alignment of a hexagonal boron nitride substrate to induce a moiré superlattice,
we find that the superlattice perturbs the preexisting isospin order only weakly,
leaving the basic phase diagram intact while catalyzing the formation of topologically
nontrivial gapped states whenever itinerant half- or quarter metal states occur
at half- or quarter superlattice band filling. Our results show that rhombohedral
trilayer graphene is an ideal platform for well-controlled tests of many-body
theory and reveal magnetism in moiré materials to be fundamentally itinerant in
nature.
acknowledgement: "The authors acknowledge discussions with A. Macdonald, L. Fu, F.
Wang and M. Zaletel. AFY acknowledges support of the National Science Foundation
under DMR1654186, and the Gordon and Betty Moore Foundation under award GBMF9471.
The authors acknowledge the use of the research facilities within the California
NanoSystems Institute, supported by the University of California, Santa Barbara
and the University of California, Office of the President.\r\nK.W. and T.T. acknowledge
support from the Elemental Strategy Initiative conducted by the MEXT, Japan, Grant
Number JPMXP0112101001 and JSPS KAKENHI, Grant Number JP20H00354. EB and TH were
supported by the European Research Council (ERC) under grant HQMAT (Grant Agreement
No. 817799). A.G. acknowledges support by the European Unions Horizon 2020 research
and innovation program under the Marie Sklodowska-Curie Grant Agreement\r\nNo. 754411.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Haoxin
full_name: Zhou, Haoxin
last_name: Zhou
- first_name: Tian
full_name: Xie, Tian
last_name: Xie
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: Tobias
full_name: Holder, Tobias
last_name: Holder
- first_name: James R.
full_name: Ehrets, James R.
last_name: Ehrets
- first_name: Eric M.
full_name: Spanton, Eric M.
last_name: Spanton
- first_name: Takashi
full_name: Taniguchi, Takashi
last_name: Taniguchi
- first_name: Kenji
full_name: Watanabe, Kenji
last_name: Watanabe
- first_name: Erez
full_name: Berg, Erez
last_name: Berg
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Andrea F.
full_name: Young, Andrea F.
last_name: Young
citation:
ama: Zhou H, Xie T, Ghazaryan A, et al. Half and quarter metals in rhombohedral
trilayer graphene. Nature. 2021. doi:10.1038/s41586-021-03938-w
apa: Zhou, H., Xie, T., Ghazaryan, A., Holder, T., Ehrets, J. R., Spanton, E. M.,
… Young, A. F. (2021). Half and quarter metals in rhombohedral trilayer graphene.
Nature. Springer Nature. https://doi.org/10.1038/s41586-021-03938-w
chicago: Zhou, Haoxin, Tian Xie, Areg Ghazaryan, Tobias Holder, James R. Ehrets,
Eric M. Spanton, Takashi Taniguchi, et al. “Half and Quarter Metals in Rhombohedral
Trilayer Graphene.” Nature. Springer Nature, 2021. https://doi.org/10.1038/s41586-021-03938-w.
ieee: H. Zhou et al., “Half and quarter metals in rhombohedral trilayer graphene,”
Nature. Springer Nature, 2021.
ista: Zhou H, Xie T, Ghazaryan A, Holder T, Ehrets JR, Spanton EM, Taniguchi T,
Watanabe K, Berg E, Serbyn M, Young AF. 2021. Half and quarter metals in rhombohedral
trilayer graphene. Nature.
mla: Zhou, Haoxin, et al. “Half and Quarter Metals in Rhombohedral Trilayer Graphene.”
Nature, Springer Nature, 2021, doi:10.1038/s41586-021-03938-w.
short: H. Zhou, T. Xie, A. Ghazaryan, T. Holder, J.R. Ehrets, E.M. Spanton, T. Taniguchi,
K. Watanabe, E. Berg, M. Serbyn, A.F. Young, Nature (2021).
date_created: 2021-09-19T22:01:25Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2023-08-14T07:04:06Z
day: '01'
department:
- _id: MaSe
- _id: MiLe
doi: 10.1038/s41586-021-03938-w
ec_funded: 1
external_id:
arxiv:
- '2104.00653'
isi:
- '000706977400002'
isi: 1
keyword:
- condensed matter - mesoscale and nanoscale physics
- condensed matter - strongly correlated electrons
- multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2104.00653
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1038/s41586-021-04181-z
scopus_import: '1'
status: public
title: Half and quarter metals in rhombohedral trilayer graphene
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '10029'
abstract:
- lang: eng
text: Superconductor-semiconductor hybrids are platforms for realizing effective
p-wave superconductivity. Spin-orbit coupling, combined with the proximity effect,
causes the two-dimensional semiconductor to inherit p±ip intraband pairing, and
application of magnetic field can then result in transitions to the normal state,
partial Bogoliubov Fermi surfaces, or topological phases with Majorana modes.
Experimentally probing the hybrid superconductor-semiconductor interface is challenging
due to the shunting effect of the conventional superconductor. Consequently, the
nature of induced pairing remains an open question. Here, we use the circuit quantum
electrodynamics architecture to probe induced superconductivity in a two dimensional
Al-InAs hybrid system. We observe a strong suppression of superfluid density and
enhanced dissipation driven by magnetic field, which cannot be accounted for by
the depairing theory of an s-wave superconductor. These observations are explained
by a picture of independent intraband p±ip superconductors giving way to partial
Bogoliubov Fermi surfaces, and allow for the first characterization of key properties
of the hybrid superconducting system.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: This research was supported by the Scientific Service Units of IST
Austria through resources provided by the MIBA Machine Shop and the nanofabrication
facility. JS and AG were supported by funding from the European Union’s Horizon
2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement
No.754411.
article_number: '2107.03695'
article_processing_charge: No
arxiv: 1
author:
- first_name: Duc T
full_name: Phan, Duc T
id: 29C8C0B4-F248-11E8-B48F-1D18A9856A87
last_name: Phan
- first_name: Jorden L
full_name: Senior, Jorden L
id: 5479D234-2D30-11EA-89CC-40953DDC885E
last_name: Senior
orcid: 0000-0002-0672-9295
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: M.
full_name: Hatefipour, M.
last_name: Hatefipour
- first_name: W. M.
full_name: Strickland, W. M.
last_name: Strickland
- first_name: J.
full_name: Shabani, J.
last_name: Shabani
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
citation:
ama: Phan DT, Senior JL, Ghazaryan A, et al. Breakdown of induced p±ip pairing in
a superconductor-semiconductor hybrid. arXiv.
apa: Phan, D. T., Senior, J. L., Ghazaryan, A., Hatefipour, M., Strickland, W. M.,
Shabani, J., … Higginbotham, A. P. (n.d.). Breakdown of induced p±ip pairing in
a superconductor-semiconductor hybrid. arXiv.
chicago: Phan, Duc T, Jorden L Senior, Areg Ghazaryan, M. Hatefipour, W. M. Strickland,
J. Shabani, Maksym Serbyn, and Andrew P Higginbotham. “Breakdown of Induced P±ip
Pairing in a Superconductor-Semiconductor Hybrid.” ArXiv, n.d.
ieee: D. T. Phan et al., “Breakdown of induced p±ip pairing in a superconductor-semiconductor
hybrid,” arXiv. .
ista: Phan DT, Senior JL, Ghazaryan A, Hatefipour M, Strickland WM, Shabani J, Serbyn
M, Higginbotham AP. Breakdown of induced p±ip pairing in a superconductor-semiconductor
hybrid. arXiv, 2107.03695.
mla: Phan, Duc T., et al. “Breakdown of Induced P±ip Pairing in a Superconductor-Semiconductor
Hybrid.” ArXiv, 2107.03695.
short: D.T. Phan, J.L. Senior, A. Ghazaryan, M. Hatefipour, W.M. Strickland, J.
Shabani, M. Serbyn, A.P. Higginbotham, ArXiv (n.d.).
date_created: 2021-09-21T08:41:02Z
date_published: 2021-07-08T00:00:00Z
date_updated: 2024-02-21T12:36:52Z
day: '08'
department:
- _id: MaSe
- _id: AnHi
- _id: MiLe
ec_funded: 1
external_id:
arxiv:
- '2107.03695'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2107.03695
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '10851'
relation: later_version
status: public
- id: '9636'
relation: research_data
status: public
status: public
title: Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10030'
abstract:
- lang: eng
text: "This PhD thesis is primarily focused on the study of discrete transport problems,
introduced for the first time in the seminal works of Maas [Maa11] and Mielke
[Mie11] on finite state Markov chains and reaction-diffusion equations, respectively.
More in detail, my research focuses on the study of transport costs on graphs,
in particular the convergence and the stability of such problems in the discrete-to-continuum
limit. This thesis also includes some results concerning\r\nnon-commutative optimal
transport. The first chapter of this thesis consists of a general introduction
to the optimal transport problems, both in the discrete, the continuous, and the
non-commutative setting. Chapters 2 and 3 present the content of two works, obtained
in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have
been able to show the convergence of discrete transport costs on periodic graphs
to suitable continuous ones, which can be described by means of a homogenisation
result. We first focus on the particular case of quadratic costs on the real line
and then extending the result to more general costs in arbitrary dimension. Our
results are the first complete characterisation of limits of transport costs on
periodic graphs in arbitrary dimension which do not rely on any additional symmetry.
In Chapter 4 we turn our attention to one of the intriguing connection between
evolution equations and optimal transport, represented by the theory of gradient
flows. We show that discrete gradient flow structures associated to a finite volume
approximation of a certain class of diffusive equations (Fokker–Planck) is stable
in the limit of vanishing meshes, reproving the convergence of the scheme via
the method of evolutionary Γ-convergence and exploiting a more variational point
of view on the problem. This is based on a collaboration with Dominik Forkert
and Jan Maas. Chapter 5 represents a change of perspective, moving away from the
discrete world and reaching the non-commutative one. As in the discrete case,
we discuss how classical tools coming from the commutative optimal transport can
be translated into the setting of density matrices. In particular, in this final
chapter we present a non-commutative version of the Schrödinger problem (or entropic
regularised optimal transport problem) and discuss existence and characterisation
of minimisers, a duality result, and present a non-commutative version of the
well-known Sinkhorn algorithm to compute the above mentioned optimisers. This
is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally,
Appendix A and B contain some additional material and discussions, with particular
attention to Harnack inequalities and the regularity of flows on discrete spaces."
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: The author gratefully acknowledges support by the Austrian Science
Fund (FWF), grants No W1245.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
citation:
ama: Portinale L. Discrete-to-continuum limits of transport problems and gradient
flows in the space of measures. 2021. doi:10.15479/at:ista:10030
apa: Portinale, L. (2021). Discrete-to-continuum limits of transport problems
and gradient flows in the space of measures. Institute of Science and Technology
Austria. https://doi.org/10.15479/at:ista:10030
chicago: Portinale, Lorenzo. “Discrete-to-Continuum Limits of Transport Problems
and Gradient Flows in the Space of Measures.” Institute of Science and Technology
Austria, 2021. https://doi.org/10.15479/at:ista:10030.
ieee: L. Portinale, “Discrete-to-continuum limits of transport problems and gradient
flows in the space of measures,” Institute of Science and Technology Austria,
2021.
ista: Portinale L. 2021. Discrete-to-continuum limits of transport problems and
gradient flows in the space of measures. Institute of Science and Technology Austria.
mla: Portinale, Lorenzo. Discrete-to-Continuum Limits of Transport Problems and
Gradient Flows in the Space of Measures. Institute of Science and Technology
Austria, 2021, doi:10.15479/at:ista:10030.
short: L. Portinale, Discrete-to-Continuum Limits of Transport Problems and Gradient
Flows in the Space of Measures, Institute of Science and Technology Austria, 2021.
date_created: 2021-09-21T09:14:15Z
date_published: 2021-09-22T00:00:00Z
date_updated: 2023-09-07T13:31:06Z
day: '22'
ddc:
- '515'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JaMa
doi: 10.15479/at:ista:10030
file:
- access_level: closed
checksum: 8cd60dcb8762e8f21867e21e8001e183
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2021-09-21T09:17:34Z
date_updated: 2022-03-10T12:14:42Z
file_id: '10032'
file_name: tex_and_pictures.zip
file_size: 3876668
relation: source_file
- access_level: open_access
checksum: 9789e9d967c853c1503ec7f307170279
content_type: application/pdf
creator: cchlebak
date_created: 2021-09-27T11:14:31Z
date_updated: 2021-09-27T11:14:31Z
file_id: '10047'
file_name: thesis_portinale_Final (1).pdf
file_size: 2532673
relation: main_file
file_date_updated: 2022-03-10T12:14:42Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 260788DE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
name: Dissipation and Dispersion in Nonlinear Partial Differential Equations
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10022'
relation: part_of_dissertation
status: public
- id: '9792'
relation: part_of_dissertation
status: public
- id: '7573'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
title: Discrete-to-continuum limits of transport problems and gradient flows in the
space of measures
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10033'
abstract:
- lang: eng
text: The ⊗*-monoidal structure on the category of sheaves on the Ran space is not
pro-nilpotent in the sense of [3]. However, under some connectivity assumptions,
we prove that Koszul duality induces an equivalence of categories and that this
equivalence behaves nicely with respect to Verdier duality on the Ran space and
integrating along the Ran space, i.e. taking factorization homology. Based on
ideas sketched in [4], we show that these results also offer a simpler alternative
to one of the two main steps in the proof of the Atiyah-Bott formula given in
[7] and [5].
acknowledgement: 'The author would like to express his gratitude to D. Gaitsgory,
without whose tireless guidance and encouragement in pursuing this problem, this
work would not have been possible. The author is grateful to his advisor B.C. Ngô
for many years of patient guidance and support. This paper is revised while the
author is a postdoc in Hausel group at IST Austria. We thank him and the group for
providing a wonderful research environment. The author also gratefully acknowledges
the support of the Lise Meitner fellowship “Algebro-Geometric Applications of Factorization
Homology,” Austrian Science Fund (FWF): M 2751.'
article_number: '107992'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Quoc P
full_name: Ho, Quoc P
id: 3DD82E3C-F248-11E8-B48F-1D18A9856A87
last_name: Ho
orcid: 0000-0001-6889-1418
citation:
ama: Ho QP. The Atiyah-Bott formula and connectivity in chiral Koszul duality. Advances
in Mathematics. 2021;392. doi:10.1016/j.aim.2021.107992
apa: Ho, Q. P. (2021). The Atiyah-Bott formula and connectivity in chiral Koszul
duality. Advances in Mathematics. Elsevier. https://doi.org/10.1016/j.aim.2021.107992
chicago: Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul
Duality.” Advances in Mathematics. Elsevier, 2021. https://doi.org/10.1016/j.aim.2021.107992.
ieee: Q. P. Ho, “The Atiyah-Bott formula and connectivity in chiral Koszul duality,”
Advances in Mathematics, vol. 392. Elsevier, 2021.
ista: Ho QP. 2021. The Atiyah-Bott formula and connectivity in chiral Koszul duality.
Advances in Mathematics. 392, 107992.
mla: Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul Duality.”
Advances in Mathematics, vol. 392, 107992, Elsevier, 2021, doi:10.1016/j.aim.2021.107992.
short: Q.P. Ho, Advances in Mathematics 392 (2021).
date_created: 2021-09-21T15:58:59Z
date_published: 2021-09-21T00:00:00Z
date_updated: 2023-08-14T06:54:35Z
day: '21'
ddc:
- '514'
department:
- _id: TaHa
doi: 10.1016/j.aim.2021.107992
external_id:
arxiv:
- '1610.00212'
isi:
- '000707040300031'
file:
- access_level: open_access
checksum: f3c0086d41af11db31c00014efb38072
content_type: application/pdf
creator: qho
date_created: 2021-09-21T15:58:52Z
date_updated: 2021-09-21T15:58:52Z
file_id: '10034'
file_name: 1-s2.0-S000187082100431X-main.pdf
file_size: 840635
relation: main_file
file_date_updated: 2021-09-21T15:58:52Z
has_accepted_license: '1'
intvolume: ' 392'
isi: 1
keyword:
- Chiral algebras
- Chiral homology
- Factorization algebras
- Koszul duality
- Ran space
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 26B96266-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02751
name: Algebro-Geometric Applications of Factorization Homology
publication: Advances in Mathematics
publication_identifier:
eissn:
- 1090-2082
issn:
- 0001-8708
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Atiyah-Bott formula and connectivity in chiral Koszul duality
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: 392
year: '2021'
...
---
_id: '10035'
abstract:
- lang: eng
text: 'Many security definitions come in two flavors: a stronger “adaptive” flavor,
where the adversary can arbitrarily make various choices during the course of
the attack, and a weaker “selective” flavor where the adversary must commit to
some or all of their choices a-priori. For example, in the context of identity-based
encryption, selective security requires the adversary to decide on the identity
of the attacked party at the very beginning of the game whereas adaptive security
allows the attacker to first see the master public key and some secret keys before
making this choice. Often, it appears to be much easier to achieve selective security
than it is to achieve adaptive security. A series of several recent works shows
how to cleverly achieve adaptive security in several such scenarios including
generalized selective decryption [Pan07][FJP15], constrained PRFs [FKPR14], and
Yao’s garbled circuits [JW16]. Although the above works expressed vague intuition
that they share a common technique, the connection was never made precise. In
this work we present a new framework (published at Crypto ’17 [JKK+17a]) that
connects all of these works and allows us to present them in a unified and simplified
fashion. Having the framework in place, we show how to achieve adaptive security
for proxy re-encryption schemes (published at PKC ’19 [FKKP19]) and provide the
first adaptive security proofs for continuous group key agreement protocols (published
at S&P ’21 [KPW+21]). Questioning optimality of our framework, we then show that
currently used proof techniques cannot lead to significantly better security guarantees
for "graph-building" games (published at TCC ’21 [KKPW21a]). These games cover
generalized selective decryption, as well as the security of prominent constructions
for constrained PRFs, continuous group key agreement, and proxy re-encryption.
Finally, we revisit the adaptive security of Yao’s garbled circuits and extend
the analysis of Jafargholi and Wichs in two directions: While they prove adaptive
security only for a modified construction with increased online complexity, we
provide the first positive results for the original construction by Yao (published
at TCC ’21 [KKP21a]). On the negative side, we prove that the results of Jafargholi
and Wichs are essentially optimal by showing that no black-box reduction can provide
a significantly better security bound (published at Crypto ’21 [KKPW21c]).'
acknowledgement: "I want to acknowledge the funding by the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(682815 - TOCNeT).\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
citation:
ama: Klein K. On the adaptive security of graph-based games. 2021. doi:10.15479/at:ista:10035
apa: Klein, K. (2021). On the adaptive security of graph-based games. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:10035
chicago: Klein, Karen. “On the Adaptive Security of Graph-Based Games.” Institute
of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10035.
ieee: K. Klein, “On the adaptive security of graph-based games,” Institute of Science
and Technology Austria, 2021.
ista: Klein K. 2021. On the adaptive security of graph-based games. Institute of
Science and Technology Austria.
mla: Klein, Karen. On the Adaptive Security of Graph-Based Games. Institute
of Science and Technology Austria, 2021, doi:10.15479/at:ista:10035.
short: K. Klein, On the Adaptive Security of Graph-Based Games, Institute of Science
and Technology Austria, 2021.
date_created: 2021-09-23T07:31:44Z
date_published: 2021-09-23T00:00:00Z
date_updated: 2023-10-17T09:24:07Z
day: '23'
ddc:
- '519'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrPi
doi: 10.15479/at:ista:10035
ec_funded: 1
file:
- access_level: open_access
checksum: 73a44345c683e81f3e765efbf86fdcc5
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-04T12:22:33Z
date_updated: 2021-10-04T12:22:33Z
file_id: '10082'
file_name: thesis_pdfa.pdf
file_size: 2104726
relation: main_file
success: 1
- access_level: closed
checksum: 7b80df30a0e686c3ef6a56d4e1c59e29
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2021-10-05T07:04:37Z
date_updated: 2022-03-10T12:15:18Z
file_id: '10085'
file_name: thesis_final (1).zip
file_size: 9538359
relation: source_file
file_date_updated: 2022-03-10T12:15:18Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '276'
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10044'
relation: part_of_dissertation
status: public
- id: '10049'
relation: part_of_dissertation
status: public
- id: '637'
relation: part_of_dissertation
status: public
- id: '10041'
relation: part_of_dissertation
status: public
- id: '6430'
relation: part_of_dissertation
status: public
- id: '10048'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
title: On the adaptive security of graph-based games
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10041'
abstract:
- lang: eng
text: Yao’s garbling scheme is one of the most fundamental cryptographic constructions.
Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security
in the selective setting where the adversary chooses the challenge inputs before
seeing the garbled circuit assuming secure symmetric-key encryption (and hence
one-way functions). This was followed by results, both positive and negative,
concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto
2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility
argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s
scheme (where the output mapping is sent in the online phase, together with the
garbled input) that circumvents this negative result, and proved that it is adaptively
secure, at least for shallow circuits. In particular, they showed that for the
class of circuits of depth δ , the loss in security is at most exponential in δ
. The above results all concern the simulation-based notion of security. In this
work, we show that the upper bound of Jafargholi and Wichs is basically optimal
in a strong sense. As our main result, we show that there exists a family of Boolean
circuits, one for each depth δ∈N , such that any black-box reduction proving
the adaptive indistinguishability of the natural adaptation of Yao’s scheme from
any symmetric-key encryption has to lose a factor that is exponential in δ√
. Since indistinguishability is a weaker notion than simulation, our bound also
applies to adaptive simulation. To establish our results, we build on the recent
approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction
with oracle separations to prove fine-grained lower bounds on loss in cryptographic
security.
acknowledgement: We would like to thank the anonymous reviewers of Crypto’21 whose
detailed comments helped us considerably improve the presentation of the paper.
alternative_title:
- LCNS
article_processing_charge: No
author:
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security
of Yao’s Garbling. In: 41st Annual International Cryptology Conference, Part
II . Vol 12826. Cham: Springer Nature; 2021:486-515. doi:10.1007/978-3-030-84245-1_17'
apa: 'Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Wichs, D. (2021). Limits
on the Adaptive Security of Yao’s Garbling. In 41st Annual International Cryptology
Conference, Part II (Vol. 12826, pp. 486–515). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-84245-1_17'
chicago: 'Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel
Wichs. “Limits on the Adaptive Security of Yao’s Garbling.” In 41st Annual
International Cryptology Conference, Part II , 12826:486–515. Cham: Springer
Nature, 2021. https://doi.org/10.1007/978-3-030-84245-1_17.'
ieee: C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the
Adaptive Security of Yao’s Garbling,” in 41st Annual International Cryptology
Conference, Part II , Virtual, 2021, vol. 12826, pp. 486–515.
ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive
Security of Yao’s Garbling. 41st Annual International Cryptology Conference, Part
II . CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.'
mla: Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.”
41st Annual International Cryptology Conference, Part II , vol. 12826,
Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.
short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International
Cryptology Conference, Part II , Springer Nature, Cham, 2021, pp. 486–515.
conference:
end_date: 2021-08-20
location: Virtual
name: 'CRYPTO: Annual International Cryptology Conference'
start_date: 2021-08-16
date_created: 2021-09-23T14:06:15Z
date_published: 2021-08-11T00:00:00Z
date_updated: 2023-09-07T13:32:11Z
day: '11'
department:
- _id: KrPi
doi: 10.1007/978-3-030-84245-1_17
ec_funded: 1
intvolume: ' 12826'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/945
month: '08'
oa: 1
oa_version: Preprint
page: 486-515
place: Cham
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: '41st Annual International Cryptology Conference, Part II '
publication_identifier:
eisbn:
- 978-3-030-84245-1
eissn:
- 1611-3349
isbn:
- 978-3-030-84244-4
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '10035'
relation: dissertation_contains
status: public
status: public
title: Limits on the Adaptive Security of Yao’s Garbling
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 12826
year: '2021'
...
---
_id: '10044'
abstract:
- lang: eng
text: We show that Yao’s garbling scheme is adaptively indistinguishable for the
class of Boolean circuits of size S and treewidth w with only a S^O(w) loss in
security. For instance, circuits with constant treewidth are as a result adaptively
indistinguishable with only a polynomial loss. This (partially) complements a
negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way
functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main
technical contributions, we introduce a new pebble game that abstracts out our
security reduction and then present a pebbling strategy for this game where the
number of pebbles used is roughly O(d w log(S)), d being the fan-out of the circuit.
The design of the strategy relies on separators, a graph-theoretic notion with
connections to circuit complexity.
acknowledgement: 'We would like to thank Daniel Wichs for helpful discussions on the
landscape of adaptive security of Yao’s garbling. '
article_number: 2021/926
article_processing_charge: No
author:
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s
garbling. In: 19th Theory of Cryptography Conference 2021. International
Association for Cryptologic Research; 2021.'
apa: 'Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2021). On treewidth,
separators and Yao’s garbling. In 19th Theory of Cryptography Conference 2021.
Raleigh, NC, United States: International Association for Cryptologic Research.'
chicago: Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth,
Separators and Yao’s Garbling.” In 19th Theory of Cryptography Conference 2021.
International Association for Cryptologic Research, 2021.
ieee: C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators
and Yao’s garbling,” in 19th Theory of Cryptography Conference 2021, Raleigh,
NC, United States, 2021.
ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and
Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography
Conference, 2021/926.'
mla: Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.”
19th Theory of Cryptography Conference 2021, 2021/926, International Association
for Cryptologic Research, 2021.
short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography
Conference 2021, International Association for Cryptologic Research, 2021.
conference:
end_date: 2021-11-11
location: Raleigh, NC, United States
name: 'TCC: Theory of Cryptography Conference'
start_date: 2021-11-08
date_created: 2021-09-24T12:01:34Z
date_published: 2021-07-08T00:00:00Z
date_updated: 2023-09-07T13:32:11Z
day: '08'
department:
- _id: KrPi
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/926
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 19th Theory of Cryptography Conference 2021
publication_status: published
publisher: International Association for Cryptologic Research
quality_controlled: '1'
related_material:
record:
- id: '10409'
relation: later_version
status: public
- id: '10035'
relation: dissertation_contains
status: public
status: public
title: On treewidth, separators and Yao's garbling
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10045'
abstract:
- lang: eng
text: "Given a fixed finite metric space (V,μ), the {\\em minimum 0-extension problem},
denoted as 0-Ext[μ], is equivalent to the following optimization problem: minimize
function of the form minx∈Vn∑ifi(xi)+∑ijcijμ(xi,xj) where cij,cvi are given nonnegative
costs and fi:V→R are functions given by fi(xi)=∑v∈Vcviμ(xi,v). The computational
complexity of 0-Ext[μ] has been recently established by Karzanov and by Hirai:
if metric μ is {\\em orientable modular} then 0-Ext[μ] can be solved in polynomial
time, otherwise 0-Ext[μ] is NP-hard. To prove the tractability part, Hirai developed
a theory of discrete convex functions on orientable modular graphs generalizing
several known classes of functions in discrete convex analysis, such as L♮-convex
functions. We consider a more general version of the problem in which unary functions
fi(xi) can additionally have terms of the form cuv;iμ(xi,{u,v}) for {u,v}∈F, where
set F⊆(V2) is fixed. We extend the complexity classification above by providing
an explicit condition on (μ,F) for the problem to be tractable. In order to prove
the tractability part, we generalize Hirai's theory and define a larger class
of discrete convex functions. It covers, in particular, another well-known class
of functions, namely submodular functions on an integer lattice. Finally, we improve
the complexity of Hirai's algorithm for solving 0-Ext on orientable modular graphs.\r\n"
article_number: '2109.10203'
article_processing_charge: No
arxiv: 1
author:
- first_name: Martin
full_name: Dvorak, Martin
id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425
last_name: Dvorak
orcid: 0000-0001-5293-214X
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete
convexity. arXiv. doi:10.48550/arXiv.2109.10203
apa: Dvorak, M., & Kolmogorov, V. (n.d.). Generalized minimum 0-extension problem
and discrete convexity. arXiv. https://doi.org/10.48550/arXiv.2109.10203
chicago: Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension
Problem and Discrete Convexity.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2109.10203.
ieee: M. Dvorak and V. Kolmogorov, “Generalized minimum 0-extension problem and
discrete convexity,” arXiv. .
ista: Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete
convexity. arXiv, 2109.10203.
mla: Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem
and Discrete Convexity.” ArXiv, 2109.10203, doi:10.48550/arXiv.2109.10203.
short: M. Dvorak, V. Kolmogorov, ArXiv (n.d.).
date_created: 2021-09-27T10:48:23Z
date_published: 2021-09-21T00:00:00Z
date_updated: 2023-05-03T10:40:16Z
day: '21'
ddc:
- '004'
department:
- _id: GradSch
- _id: VlKo
doi: 10.48550/arXiv.2109.10203
external_id:
arxiv:
- '2109.10203'
file:
- access_level: open_access
checksum: e7e83065f7bc18b9c188bf93b5ca5db6
content_type: application/pdf
creator: mdvorak
date_created: 2021-09-27T10:54:51Z
date_updated: 2021-09-27T10:54:51Z
file_id: '10046'
file_name: Generalized-0-Ext.pdf
file_size: 603672
relation: main_file
success: 1
file_date_updated: 2021-09-27T10:54:51Z
has_accepted_license: '1'
keyword:
- minimum 0-extension problem
- metric labeling problem
- discrete metric spaces
- metric extensions
- computational complexity
- valued constraint satisfaction problems
- discrete convex analysis
- L-convex functions
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2109.10203'
month: '09'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Generalized minimum 0-extension problem and discrete convexity
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10048'
abstract:
- lang: eng
text: "The security of cryptographic primitives and protocols against adversaries
that are allowed to make adaptive choices (e.g., which parties to corrupt or which
queries to make) is notoriously difficult to establish. A broad theoretical\r\nframework
was introduced by Jafargholi et al. [Crypto’17] for this purpose. In this paper
we initiate the study of lower bounds on loss in adaptive security for certain
cryptographic protocols considered in the framework. We prove lower\r\nbounds
that almost match the upper bounds (proven using the framework) for proxy re-encryption,
prefix-constrained PRFs and generalized selective decryption, a security game
that captures the security of certain group messaging and\r\nbroadcast encryption
schemes. Those primitives have in common that their security game involves an
underlying graph that can be adaptively built by the adversary. Some of our lower
bounds only apply to a restricted class of black-box reductions which we term
“oblivious” (the existing upper bounds are of this restricted type), some apply
to the broader but still restricted class of non-rewinding reductions, while our
lower bound for proxy re-encryption applies to all black-box reductions. The fact
that some of our lower bounds seem to crucially rely on obliviousness or at least
a non-rewinding reduction hints to the exciting possibility that the existing
upper bounds can be improved by using more sophisticated reductions. Our main
conceptual contribution is a two-player multi-stage game called the Builder-Pebbler
Game. We can translate bounds on the winning probabilities for various instantiations
of this game into cryptographic lower bounds for the above-mentioned primitives
using oracle separation techniques.\r\n"
article_processing_charge: No
author:
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
citation:
ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in
security games on graphs. In: 19th Theory of Cryptography Conference 2021.
International Association for Cryptologic Research; 2021.'
apa: 'Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Walter, M. (2021). The
cost of adaptivity in security games on graphs. In 19th Theory of Cryptography
Conference 2021. Raleigh, NC, United States: International Association for
Cryptologic Research.'
chicago: Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael
Walter. “The Cost of Adaptivity in Security Games on Graphs.” In 19th Theory
of Cryptography Conference 2021. International Association for Cryptologic
Research, 2021.
ieee: C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity
in security games on graphs,” in 19th Theory of Cryptography Conference 2021,
Raleigh, NC, United States, 2021.
ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity
in security games on graphs. 19th Theory of Cryptography Conference 2021. TCC:
Theory of Cryptography Conference.'
mla: Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on
Graphs.” 19th Theory of Cryptography Conference 2021, International Association
for Cryptologic Research, 2021.
short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th Theory of
Cryptography Conference 2021, International Association for Cryptologic Research,
2021.
conference:
end_date: 2021-11-11
location: Raleigh, NC, United States
name: 'TCC: Theory of Cryptography Conference'
start_date: 2021-11-08
date_created: 2021-09-27T12:52:05Z
date_published: 2021-07-08T00:00:00Z
date_updated: 2023-10-17T09:24:08Z
day: '08'
department:
- _id: KrPi
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ia.cr/2021/059
month: '07'
oa: 1
oa_version: Preprint
publication: 19th Theory of Cryptography Conference 2021
publication_status: published
publisher: International Association for Cryptologic Research
quality_controlled: '1'
related_material:
record:
- id: '10410'
relation: later_version
status: public
- id: '10035'
relation: dissertation_contains
status: public
status: public
title: The cost of adaptivity in security games on graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10049'
abstract:
- lang: eng
text: While messaging systems with strong security guarantees are widely used in
practice, designing a protocol that scales efficiently to large groups and enjoys
similar security guarantees remains largely open. The two existing proposals to
date are ART (Cohn-Gordon et al., CCS18) and TreeKEM (IETF, The Messaging Layer
Security Protocol, draft). TreeKEM is the currently considered candidate by the
IETF MLS working group, but dynamic group operations (i.e. adding and removing
users) can cause efficiency issues. In this paper we formalize and analyze a variant
of TreeKEM which we term Tainted TreeKEM (TTKEM for short). The basic idea underlying
TTKEM was suggested by Millican (MLS mailing list, February 2018). This version
is more efficient than TreeKEM for some natural distributions of group operations,
we quantify this through simulations.Our second contribution is two security proofs
for TTKEM which establish post compromise and forward secrecy even against adaptive
attackers. The security loss (to the underlying PKE) in the Random Oracle Model
is a polynomial factor, and a quasipolynomial one in the Standard Model. Our proofs
can be adapted to TreeKEM as well. Before our work no security proof for any TreeKEM-like
protocol establishing tight security against an adversary who can adaptively choose
the sequence of operations was known. We also are the first to prove (or even
formalize) active security where the server can arbitrarily deviate from the protocol
specification. Proving fully active security – where also the users can arbitrarily
deviate – remains open.
acknowledgement: The first three authors contributed equally to this work. Funded
by the European Research Council (ERC) under the European Union’s Horizon2020 research
and innovation programme (682815-TOCNeT). Funded by the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No.665385.
article_processing_charge: No
author:
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Guillermo
full_name: Pascual Perez, Guillermo
id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87
last_name: Pascual Perez
orcid: 0000-0001-8630-415X
- first_name: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Margarita
full_name: Capretto, Margarita
last_name: Capretto
- first_name: Miguel
full_name: Cueto Noval, Miguel
id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc
last_name: Cueto Noval
- first_name: Ilia
full_name: Markov, Ilia
id: D0CF4148-C985-11E9-8066-0BDEE5697425
last_name: Markov
- first_name: Michelle X
full_name: Yeo, Michelle X
id: 2D82B818-F248-11E8-B48F-1D18A9856A87
last_name: Yeo
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM,
adaptively and actively secure continuous group key agreement. In: 2021 IEEE
Symposium on Security and Privacy . IEEE; 2021:268-284. doi:10.1109/sp40001.2021.00035'
apa: 'Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M.,
Cueto Noval, M., … Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively
and actively secure continuous group key agreement. In 2021 IEEE Symposium
on Security and Privacy (pp. 268–284). San Francisco, CA, United States:
IEEE. https://doi.org/10.1109/sp40001.2021.00035'
chicago: 'Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath
Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo,
Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively
and Actively Secure Continuous Group Key Agreement.” In 2021 IEEE Symposium
on Security and Privacy , 268–84. IEEE, 2021. https://doi.org/10.1109/sp40001.2021.00035.'
ieee: 'K. Klein et al., “Keep the dirt: tainted TreeKEM, adaptively and actively
secure continuous group key agreement,” in 2021 IEEE Symposium on Security
and Privacy , San Francisco, CA, United States, 2021, pp. 268–284.'
ista: 'Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval
M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM,
adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium
on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.'
mla: 'Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively
Secure Continuous Group Key Agreement.” 2021 IEEE Symposium on Security and
Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.'
short: K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M.
Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium
on Security and Privacy , IEEE, 2021, pp. 268–284.
conference:
end_date: 2021-05-27
location: San Francisco, CA, United States
name: 'SP: Symposium on Security and Privacy'
start_date: 2021-05-24
date_created: 2021-09-27T13:46:27Z
date_published: 2021-08-26T00:00:00Z
date_updated: 2023-09-07T13:32:11Z
day: '26'
department:
- _id: KrPi
- _id: DaAl
doi: 10.1109/sp40001.2021.00035
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/1489
month: '08'
oa: 1
oa_version: Preprint
page: 268-284
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: '2021 IEEE Symposium on Security and Privacy '
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '10035'
relation: dissertation_contains
status: public
status: public
title: 'Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous
group key agreement'
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10051'
abstract:
- lang: eng
text: 'Rab-interacting molecule (RIM)-binding protein 2 (BP2) is a multidomain protein
of the presynaptic active zone (AZ). By binding to RIM, bassoon (Bsn), and voltage-gated
Ca2+ channels (CaV), it is considered to be a central organizer of the topography
of CaV and release sites of synaptic vesicles (SVs) at the AZ. Here, we used RIM-BP2
knock-out (KO) mice and their wild-type (WT) littermates of either sex to investigate
the role of RIM-BP2 at the endbulb of Held synapse of auditory nerve fibers (ANFs)
with bushy cells (BCs) of the cochlear nucleus, a fast relay of the auditory pathway
with high release probability. Disruption of RIM-BP2 lowered release probability
altering short-term plasticity and reduced evoked EPSCs. Analysis of SV pool dynamics
during high-frequency train stimulation indicated a reduction of SVs with high
release probability but an overall normal size of the readily releasable SV pool
(RRP). The Ca2+-dependent fast component of SV replenishment after RRP depletion
was slowed. Ultrastructural analysis by superresolution light and electron microscopy
revealed an impaired topography of presynaptic CaV and a reduction of docked and
membrane-proximal SVs at the AZ. We conclude that RIM-BP2 organizes the topography
of CaV, and promotes SV tethering and docking. This way RIM-BP2 is critical for
establishing a high initial release probability as required to reliably signal
sound onset information that we found to be degraded in BCs of RIM-BP2-deficient
mice in vivo. SIGNIFICANCE STATEMENT: Rab-interacting molecule (RIM)-binding proteins
(BPs) are key organizers of the active zone (AZ). Using a multidisciplinary approach
to the calyceal endbulb of Held synapse that transmits auditory information at
rates of up to hundreds of Hertz with submillisecond precision we demonstrate
a requirement for RIM-BP2 for normal auditory signaling. Endbulb synapses lacking
RIM-BP2 show a reduced release probability despite normal whole-terminal Ca2+
influx and abundance of the key priming protein Munc13-1, a reduced rate of SV
replenishment, as well as an altered topography of voltage-gated (CaV)2.1 Ca2+
channels, and fewer docked and membrane proximal synaptic vesicles (SVs). This
hampers transmission of sound onset information likely affecting downstream neural
computations such as of sound localization.'
acknowledgement: This work was supported by the Deutsche Forschungsgemeinschaft (DFG,
German Research Foundation) through the Collaborative Sensory Research Center 1286
[to C.W. (A4) and T.M. (B5)] and under Germany’s Excellence Strategy Grant EXC 2067/1-390729940.
We thank S. Gerke, A.J. Goldak, and C. Senger-Freitag for expert technical assistance;
G. Hoch for developing image analysis routines; and S. Chepurwar and N. Strenzke
for technical support and discussion regarding in vivo experiments. We also thank
Dr. Christian Rosenmund, Dr. Katharina Grauel, and Dr. Stephan Sigrist for providing
RIM-BP2 KO mice and Dr. Masahiko Watanabe for providing the anti-neurexin-antibody,
and Dr. Toshihisa Ohtsuka for the anti-ELKS-antibody. J. Neef for help with the
STED imaging and image analysis; E. Neher and S. Rizzoli for discussion and comments
on the manuscript; K. Eguchi for help with the statistical analysis; and C. H. Huang
and J. Neef for constant support and scientific discussion.
article_processing_charge: No
article_type: original
author:
- first_name: Tanvi
full_name: Butola, Tanvi
last_name: Butola
- first_name: Theocharis
full_name: Alvanos, Theocharis
last_name: Alvanos
- first_name: Anika
full_name: Hintze, Anika
last_name: Hintze
- first_name: Peter
full_name: Koppensteiner, Peter
id: 3B8B25A8-F248-11E8-B48F-1D18A9856A87
last_name: Koppensteiner
orcid: 0000-0002-3509-1948
- first_name: David
full_name: Kleindienst, David
id: 42E121A4-F248-11E8-B48F-1D18A9856A87
last_name: Kleindienst
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Carolin
full_name: Wichmann, Carolin
last_name: Wichmann
- first_name: Tobias
full_name: Moser, Tobias
last_name: Moser
citation:
ama: Butola T, Alvanos T, Hintze A, et al. RIM-binding protein 2 organizes Ca21
channel topography and regulates release probability and vesicle replenishment
at a fast central synapse. Journal of Neuroscience. 2021;41(37):7742-7767.
doi:10.1523/JNEUROSCI.0586-21.2021
apa: Butola, T., Alvanos, T., Hintze, A., Koppensteiner, P., Kleindienst, D., Shigemoto,
R., … Moser, T. (2021). RIM-binding protein 2 organizes Ca21 channel
topography and regulates release probability and vesicle replenishment at a fast
central synapse. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.0586-21.2021
chicago: Butola, Tanvi, Theocharis Alvanos, Anika Hintze, Peter Koppensteiner, David
Kleindienst, Ryuichi Shigemoto, Carolin Wichmann, and Tobias Moser. “RIM-Binding
Protein 2 Organizes Ca21 Channel Topography and Regulates Release Probability
and Vesicle Replenishment at a Fast Central Synapse.” Journal of Neuroscience.
Society for Neuroscience, 2021. https://doi.org/10.1523/JNEUROSCI.0586-21.2021.
ieee: T. Butola et al., “RIM-binding protein 2 organizes Ca21
channel topography and regulates release probability and vesicle replenishment
at a fast central synapse,” Journal of Neuroscience, vol. 41, no. 37. Society
for Neuroscience, pp. 7742–7767, 2021.
ista: Butola T, Alvanos T, Hintze A, Koppensteiner P, Kleindienst D, Shigemoto R,
Wichmann C, Moser T. 2021. RIM-binding protein 2 organizes Ca21 channel
topography and regulates release probability and vesicle replenishment at a fast
central synapse. Journal of Neuroscience. 41(37), 7742–7767.
mla: Butola, Tanvi, et al. “RIM-Binding Protein 2 Organizes Ca21 Channel
Topography and Regulates Release Probability and Vesicle Replenishment at a Fast
Central Synapse.” Journal of Neuroscience, vol. 41, no. 37, Society for
Neuroscience, 2021, pp. 7742–67, doi:10.1523/JNEUROSCI.0586-21.2021.
short: T. Butola, T. Alvanos, A. Hintze, P. Koppensteiner, D. Kleindienst, R. Shigemoto,
C. Wichmann, T. Moser, Journal of Neuroscience 41 (2021) 7742–7767.
date_created: 2021-09-27T14:33:13Z
date_published: 2021-09-15T00:00:00Z
date_updated: 2023-08-14T06:56:30Z
day: '15'
ddc:
- '570'
department:
- _id: RySh
doi: 10.1523/JNEUROSCI.0586-21.2021
external_id:
isi:
- '000752287700005'
pmid:
- '34353898'
file:
- access_level: open_access
checksum: 769ab627c7355a50ccfd445e43a5f351
content_type: application/pdf
creator: dernst
date_created: 2022-05-31T09:10:15Z
date_updated: 2022-05-31T09:10:15Z
file_id: '11423'
file_name: 2021_JourNeuroscience_Butola.pdf
file_size: 11571961
relation: main_file
success: 1
file_date_updated: 2022-05-31T09:10:15Z
has_accepted_license: '1'
intvolume: ' 41'
isi: 1
issue: '37'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 7742-7767
pmid: 1
publication: Journal of Neuroscience
publication_identifier:
eissn:
- 1529-2401
issn:
- 0270-6474
publication_status: published
publisher: Society for Neuroscience
quality_controlled: '1'
scopus_import: '1'
status: public
title: RIM-binding protein 2 organizes Ca21 channel topography and regulates
release probability and vesicle replenishment at a fast central synapse
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: 41
year: '2021'
...
---
_id: '10052'
abstract:
- lang: eng
text: "A deterministic finite automaton (DFA) \U0001D49C is composite if its language
L(\U0001D49C) can be decomposed into an intersection ⋂_{i = 1}^k L(\U0001D49C_i)
of languages of smaller DFAs. Otherwise, \U0001D49C is prime. This notion of primality
was introduced by Kupferman and Mosheiff in 2013, and while they proved that we
can decide whether a DFA is composite, the precise complexity of this problem
is still open, with a doubly-exponential gap between the upper and lower bounds.
In this work, we focus on permutation DFAs, i.e., those for which the transition
monoid is a group. We provide an NP algorithm to decide whether a permutation
DFA is composite, and show that the difficulty of this problem comes from the
number of non-accepting states of the instance: we give a fixed-parameter tractable
algorithm with the number of rejecting states as the parameter. Moreover, we investigate
the class of commutative permutation DFAs. Their structural properties allow us
to decide compositionality in NL, and even in LOGSPACE if the alphabet size is
fixed. Despite this low complexity, we show that complex behaviors still arise
in this class: we provide a family of composite DFAs each requiring polynomially
many factors with respect to its size. We also consider the variant of the problem
that asks whether a DFA is k-factor composite, that is, decomposable into k smaller
DFAs, for some given integer k ∈ ℕ. We show that, for commutative permutation
DFAs, restricting the number of factors makes the decision computationally harder,
and yields a problem with tight bounds: it is NP-complete. Finally, we show that
in general, this problem is in PSPACE, and it is in LOGSPACE for DFAs with a singleton
alphabet."
acknowledgement: "Ismaël Jecker: Marie Skłodowska-Curie Grant Agreement No. 754411.
Nicolas Mazzocchi: BOSCO project PGC2018-102210-B-I00 (MCIU/AEI/FEDER, UE), BLOQUESCM
project S2018/TCS-4339, and MINECO grant RYC-2016-20281.\r\nPetra Wolf : DFG project
FE 560/9-1.\r\n"
alternative_title:
- LIPIcs
article_number: '18'
article_processing_charge: No
arxiv: 1
author:
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Nicolas
full_name: Mazzocchi, Nicolas
last_name: Mazzocchi
- first_name: Petra
full_name: Wolf, Petra
last_name: Wolf
citation:
ama: 'Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: 32nd
International Conference on Concurrency Theory. Vol 203. Schloss Dagstuhl
- Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.CONCUR.2021.18'
apa: 'Jecker, I. R., Mazzocchi, N., & Wolf, P. (2021). Decomposing permutation
automata. In 32nd International Conference on Concurrency Theory (Vol.
203). Paris, France: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18'
chicago: Jecker, Ismael R, Nicolas Mazzocchi, and Petra Wolf. “Decomposing Permutation
Automata.” In 32nd International Conference on Concurrency Theory, Vol.
203. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18.
ieee: I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,”
in 32nd International Conference on Concurrency Theory, Paris, France,
2021, vol. 203.
ista: 'Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd
International Conference on Concurrency Theory. CONCUR: Conference on Concurrency
Theory, LIPIcs, vol. 203, 18.'
mla: Jecker, Ismael R., et al. “Decomposing Permutation Automata.” 32nd International
Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz
Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.
short: I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on
Concurrency Theory, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
conference:
end_date: 2021-08-27
location: Paris, France
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2021-08-23
date_created: 2021-09-27T14:33:14Z
date_published: 2021-08-13T00:00:00Z
date_updated: 2022-05-13T08:12:52Z
day: '13'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CONCUR.2021.18
ec_funded: 1
external_id:
arxiv:
- '2107.04683'
file:
- access_level: open_access
checksum: 4722c81be82265cf45e78adf9db91250
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-01T11:10:53Z
date_updated: 2021-10-01T11:10:53Z
file_id: '10064'
file_name: 2021_CONCUR_Jecker.pdf
file_size: 1003552
relation: main_file
success: 1
file_date_updated: 2021-10-01T11:10:53Z
has_accepted_license: '1'
intvolume: ' 203'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 32nd International Conference on Concurrency Theory
publication_identifier:
isbn:
- 978-3-9597-7203-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Decomposing permutation automata
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 203
year: '2021'
...
---
_id: '10053'
abstract:
- lang: eng
text: 'This paper characterizes the latency of the simplified successive-cancellation
(SSC) decoding scheme for polar codes under hardware resource constraints. In
particular, when the number of processing elements P that can perform SSC decoding
operations in parallel is limited, as is the case in practice, the latency of
SSC decoding is O(N1−1 μ+NPlog2log2NP), where N is the block length of the code
and μ is the scaling exponent of polar codes for the channel. Three direct consequences
of this bound are presented. First, in a fully-parallel implementation where P=N2
, the latency of SSC decoding is O(N1−1/μ) , which is sublinear in the block length.
This recovers a result from an earlier work. Second, in a fully-serial implementation
where P=1 , the latency of SSC decoding scales as O(Nlog2log2N) . The multiplicative
constant is also calculated: we show that the latency of SSC decoding when P=1
is given by (2+o(1))Nlog2log2N . Third, in a semi-parallel implementation, the
smallest P that gives the same latency as that of the fully-parallel implementation
is P=N1/μ . The tightness of our bound on SSC decoding latency and the applicability
of the foregoing results is validated through extensive simulations.'
acknowledgement: "S. A. Hashemi is supported by a Postdoctoral Fellowship from the
Natural Sciences and Engineering Research Council\r\nof Canada (NSERC) and by Huawei.
M. Mondelli is partially supported by the 2019 Lopez-Loreta Prize. A. Fazeli and
A. Vardy were supported in part by the National Science Foundation under Grant CCF-1764104."
article_processing_charge: No
arxiv: 1
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Arman
full_name: Fazeli, Arman
last_name: Fazeli
- first_name: Alexander
full_name: Vardy, Alexander
last_name: Vardy
- first_name: John
full_name: Cioffi, John
last_name: Cioffi
- first_name: Andrea
full_name: Goldsmith, Andrea
last_name: Goldsmith
citation:
ama: 'Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism
versus latency in simplified successive-cancellation decoding of polar codes.
In: 2021 IEEE International Symposium on Information Theory. Institute
of Electrical and Electronics Engineers; 2021:2369-2374. doi:10.1109/ISIT45174.2021.9518153'
apa: 'Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., & Goldsmith,
A. (2021). Parallelism versus latency in simplified successive-cancellation decoding
of polar codes. In 2021 IEEE International Symposium on Information Theory
(pp. 2369–2374). Melbourne, Australia: Institute of Electrical and Electronics
Engineers. https://doi.org/10.1109/ISIT45174.2021.9518153'
chicago: Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John
Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation
Decoding of Polar Codes.” In 2021 IEEE International Symposium on Information
Theory, 2369–74. Institute of Electrical and Electronics Engineers, 2021.
https://doi.org/10.1109/ISIT45174.2021.9518153.
ieee: S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith,
“Parallelism versus latency in simplified successive-cancellation decoding of
polar codes,” in 2021 IEEE International Symposium on Information Theory,
Melbourne, Australia, 2021, pp. 2369–2374.
ista: 'Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2021. Parallelism
versus latency in simplified successive-cancellation decoding of polar codes.
2021 IEEE International Symposium on Information Theory. ISIT: International Symposium
on Information Theory, 2369–2374.'
mla: Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation
Decoding of Polar Codes.” 2021 IEEE International Symposium on Information
Theory, Institute of Electrical and Electronics Engineers, 2021, pp. 2369–74,
doi:10.1109/ISIT45174.2021.9518153.
short: S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith,
in:, 2021 IEEE International Symposium on Information Theory, Institute of Electrical
and Electronics Engineers, 2021, pp. 2369–2374.
conference:
end_date: 2021-07-20
location: Melbourne, Australia
name: 'ISIT: International Symposium on Information Theory'
start_date: 2021-07-12
date_created: 2021-09-27T14:33:14Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2024-09-10T13:03:18Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/ISIT45174.2021.9518153
external_id:
arxiv:
- '2012.13378'
isi:
- '000701502202078'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2012.13378
month: '09'
oa: 1
oa_version: Preprint
page: 2369-2374
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 2021 IEEE International Symposium on Information Theory
publication_identifier:
eisbn:
- 978-1-5386-8209-8
isbn:
- 978-1-5386-8210-4
issn:
- 2157-8095
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
related_material:
record:
- id: '10364'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Parallelism versus latency in simplified successive-cancellation decoding of
polar codes
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '10054'
abstract:
- lang: eng
text: 'Graphs and games on graphs are fundamental models for the analysis of reactive
systems, in particular, for model-checking and the synthesis of reactive systems.
The class of ω-regular languages provides a robust specification formalism for
the desired properties of reactive systems. In the classical infinitary formulation
of the liveness part of an ω-regular specification, a "good" event must happen
eventually without any bound between the good events. A stronger notion of liveness
is bounded liveness, which requires that good events happen within d transitions.
Given a graph or a game graph with n vertices, m edges, and a bounded liveness
objective, the previous best-known algorithmic bounds are as follows: (i) O(dm)
for graphs, which in the worst-case is O(n³); and (ii) O(n² d²) for games on graphs.
Our main contributions improve these long-standing algorithmic bounds. For graphs
we present: (i) a randomized algorithm with one-sided error with running time
O(n^{2.5} log n) for the bounded liveness objectives; and (ii) a deterministic
linear-time algorithm for the complement of bounded liveness objectives. For games
on graphs, we present an O(n² d) time algorithm for the bounded liveness objectives.'
acknowledgement: 'Krishnendu Chatterjee: Supported by the ERC CoG 863818 (ForM-SMArt).
Monika Henzinger: Supported by the Austrian Science Fund (FWF) and netIDEE SCIENCE
project P 33775-N. Sagar Sudhir Kale: Partially supported by the Vienna Science
and Technology Fund (WWTF) through project ICT15-003. Alexander Svozil: Fully supported
by the Vienna Science and Technology Fund (WWTF) through project ICT15-003.'
alternative_title:
- LIPIcs
article_number: '124'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sagar Sudhir
full_name: Kale, Sagar Sudhir
last_name: Kale
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Henzinger MH, Kale SS, Svozil A. Faster algorithms for bounded
liveness in graphs and game graphs. In: 48th International Colloquium on Automata,
Languages, and Programming. Vol 198. Schloss Dagstuhl - Leibniz Zentrum für
Informatik; 2021. doi:10.4230/LIPIcs.ICALP.2021.124'
apa: 'Chatterjee, K., Henzinger, M. H., Kale, S. S., & Svozil, A. (2021). Faster
algorithms for bounded liveness in graphs and game graphs. In 48th International
Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland:
Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2021.124'
chicago: Chatterjee, Krishnendu, Monika H Henzinger, Sagar Sudhir Kale, and Alexander
Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” In
48th International Colloquium on Automata, Languages, and Programming,
Vol. 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.ICALP.2021.124.
ieee: K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms
for bounded liveness in graphs and game graphs,” in 48th International Colloquium
on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.
ista: 'Chatterjee K, Henzinger MH, Kale SS, Svozil A. 2021. Faster algorithms for
bounded liveness in graphs and game graphs. 48th International Colloquium on Automata,
Languages, and Programming. ICALP: International Colloquium on Automata, Languages,
and Programming, LIPIcs, vol. 198, 124.'
mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs
and Game Graphs.” 48th International Colloquium on Automata, Languages, and
Programming, vol. 198, 124, Schloss Dagstuhl - Leibniz Zentrum für Informatik,
2021, doi:10.4230/LIPIcs.ICALP.2021.124.
short: K. Chatterjee, M.H. Henzinger, S.S. Kale, A. Svozil, in:, 48th International
Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz
Zentrum für Informatik, 2021.
conference:
end_date: 2021-07-16
location: Glasgow, Scotland
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2021-07-12
date_created: 2021-09-27T14:33:15Z
date_published: 2021-07-02T00:00:00Z
date_updated: 2025-07-14T09:10:08Z
day: '02'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2021.124
ec_funded: 1
file:
- access_level: open_access
checksum: 5a3fed8dbba8c088cbeac1e24cc10bc5
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-01T08:49:26Z
date_updated: 2021-10-01T08:49:26Z
file_id: '10062'
file_name: 2021_LIPIcs_Chatterjee.pdf
file_size: 854576
relation: main_file
success: 1
file_date_updated: 2021-10-01T08:49:26Z
has_accepted_license: '1'
intvolume: ' 198'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 48th International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- 978-3-95977-195-5
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster algorithms for bounded liveness in graphs and game graphs
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: conference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 198
year: '2021'
...
---
_id: '10055'
abstract:
- lang: eng
text: "Repeated idempotent elements are commonly used to characterise iterable behaviours
in abstract models of computation. Therefore, given a monoid M, it is natural
to ask how long a sequence of elements of M needs to be to ensure the presence
of consecutive idempotent factors. This question is formalised through the notion
of the Ramsey function R_M associated to M, obtained by mapping every k ∈ ℕ to
the minimal integer R_M(k) such that every word u ∈ M^* of length R_M(k) contains
k consecutive non-empty factors that correspond to the same idempotent element
of M. In this work, we study the behaviour of the Ramsey function R_M by investigating
the regular \U0001D49F-length of M, defined as the largest size L(M) of a submonoid
of M isomorphic to the set of natural numbers {1,2, …, L(M)} equipped with the
max operation. We show that the regular \U0001D49F-length of M determines the
degree of R_M, by proving that k^L(M) ≤ R_M(k) ≤ (k|M|⁴)^L(M). To allow applications
of this result, we provide the value of the regular \U0001D49F-length of diverse
monoids. In particular, we prove that the full monoid of n × n Boolean matrices,
which is used to express transition monoids of non-deterministic automata, has
a regular \U0001D49F-length of (n²+n+2)/2."
acknowledgement: This project has received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 754411. I wish to thank Michaël Cadilhac, Emmanuel Filiot and Charles Paperman
for their valuable insights concerning Green’s relations.
alternative_title:
- LIPIcs
article_number: '44'
article_processing_charge: No
author:
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
citation:
ama: 'Jecker IR. A Ramsey theorem for finite monoids. In: 38th International
Symposium on Theoretical Aspects of Computer Science. Vol 187. Schloss Dagstuhl
- Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.STACS.2021.44'
apa: 'Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In 38th International
Symposium on Theoretical Aspects of Computer Science (Vol. 187). Saarbrücken,
Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2021.44'
chicago: Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” In 38th International
Symposium on Theoretical Aspects of Computer Science, Vol. 187. Schloss Dagstuhl
- Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.STACS.2021.44.
ieee: I. R. Jecker, “A Ramsey theorem for finite monoids,” in 38th International
Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany,
2021, vol. 187.
ista: 'Jecker IR. 2021. A Ramsey theorem for finite monoids. 38th International
Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical
Aspects of Computer Science, LIPIcs, vol. 187, 44.'
mla: Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” 38th International
Symposium on Theoretical Aspects of Computer Science, vol. 187, 44, Schloss
Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.STACS.2021.44.
short: I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of
Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
conference:
end_date: 2021-03-19
location: Saarbrücken, Germany
name: 'STACS: Symposium on Theoretical Aspects of Computer Science'
start_date: 2021-03-16
date_created: 2021-09-27T14:33:15Z
date_published: 2021-03-10T00:00:00Z
date_updated: 2023-08-14T07:03:23Z
day: '10'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.STACS.2021.44
ec_funded: 1
external_id:
isi:
- '000635691700044'
file:
- access_level: open_access
checksum: 17432a05733f408de300e17e390a90e4
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-01T09:55:00Z
date_updated: 2021-10-01T09:55:00Z
file_id: '10063'
file_name: 2021_LIPIcs_Jecker.pdf
file_size: 720250
relation: main_file
success: 1
file_date_updated: 2021-10-01T09:55:00Z
has_accepted_license: '1'
intvolume: ' 187'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 38th International Symposium on Theoretical Aspects of Computer Science
publication_identifier:
isbn:
- 978-3-9597-7180-1
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: A Ramsey theorem for finite monoids
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: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 187
year: '2021'
...
---
_id: '10058'
abstract:
- lang: eng
text: 'Quantum information and computation has become a vast field paved with opportunities
for researchers and investors. As large multinational companies and international
funds are heavily investing in quantum technologies it is still a question which
platform is best suited for the task of realizing a scalable quantum processor.
In this work we investigate hole spins in Ge quantum wells. These hold great promise
as they possess several favorable properties: a small effective mass, a strong
spin-orbit coupling, long relaxation time and an inherent immunity to hyperfine
noise. All these characteristics helped Ge hole spin qubits to evolve from a single
qubit to a fully entangled four qubit processor in only 3 years. Here, we investigated
a qubit approach leveraging the large out-of-plane g-factors of heavy hole states
in Ge quantum dots. We found this qubit to be reproducibly operable at extremely
low magnetic field and at large speeds while maintaining coherence. This was possible
because large differences of g-factors in adjacent dots can be achieved in the
out-of-plane direction. In the in-plane direction the small g-factors, on the
other hand, can be altered very effectively by the confinement potentials. Here,
we found that this can even lead to a sign change of the g-factors. The resulting
g-factor difference alters the dynamics of the system drastically and produces
effects typically attributed to a spin-orbit induced spin-flip term. The investigations
carried out in this thesis give further insights into the possibilities of holes
in Ge and reveal new physical properties that need to be considered when designing
future spin qubit experiments.'
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: The author gratefully acknowledges support by the Austrian Science
Fund (FWF), grants No P30207, and the Nomis foundation.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Daniel
full_name: Jirovec, Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
orcid: 0000-0002-7197-4801
citation:
ama: Jirovec D. Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional
Ge hole gases. 2021. doi:10.15479/at:ista:10058
apa: Jirovec, D. (2021). Singlet-Triplet qubits and spin-orbit interaction in
2-dimensional Ge hole gases. Institute of Science and Technology Austria.
https://doi.org/10.15479/at:ista:10058
chicago: Jirovec, Daniel. “Singlet-Triplet Qubits and Spin-Orbit Interaction in
2-Dimensional Ge Hole Gases.” Institute of Science and Technology Austria, 2021.
https://doi.org/10.15479/at:ista:10058.
ieee: D. Jirovec, “Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional
Ge hole gases,” Institute of Science and Technology Austria, 2021.
ista: Jirovec D. 2021. Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional
Ge hole gases. Institute of Science and Technology Austria.
mla: Jirovec, Daniel. Singlet-Triplet Qubits and Spin-Orbit Interaction in 2-Dimensional
Ge Hole Gases. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10058.
short: D. Jirovec, Singlet-Triplet Qubits and Spin-Orbit Interaction in 2-Dimensional
Ge Hole Gases, Institute of Science and Technology Austria, 2021.
date_created: 2021-09-30T07:53:49Z
date_published: 2021-10-05T00:00:00Z
date_updated: 2023-09-08T11:41:08Z
day: '05'
ddc:
- '621'
- '539'
degree_awarded: PhD
department:
- _id: GradSch
- _id: GeKa
doi: 10.15479/at:ista:10058
file:
- access_level: closed
checksum: ad6bcb24083ed7c02baaf1885c9ea3d5
content_type: application/x-zip-compressed
creator: djirovec
date_created: 2021-09-30T14:29:14Z
date_updated: 2022-12-20T23:30:07Z
embargo_to: open_access
file_id: '10061'
file_name: PHD_Thesis_Jirovec_Source.zip
file_size: 32397600
relation: source_file
- access_level: open_access
checksum: 5fbe08d4f66d1153e04c47971538fae8
content_type: application/pdf
creator: djirovec
date_created: 2021-10-05T07:56:49Z
date_updated: 2022-12-20T23:30:07Z
embargo: 2022-10-06
file_id: '10087'
file_name: PHD_Thesis_pdfa2b_1.pdf
file_size: 26910829
relation: main_file
file_date_updated: 2022-12-20T23:30:07Z
has_accepted_license: '1'
keyword:
- qubits
- quantum computing
- holes
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '151'
project:
- _id: 2641CE5E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P30207
name: Hole spin orbit qubits in Ge quantum wells
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8831'
relation: part_of_dissertation
status: public
- id: '10065'
relation: part_of_dissertation
status: public
- id: '10066'
relation: part_of_dissertation
status: public
- id: '8909'
relation: part_of_dissertation
status: public
- id: '5816'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole
gases
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10066'
abstract:
- lang: eng
text: The potential of Si and SiGe-based devices for the scaling of quantum circuits
is tainted by device variability. Each device needs to be tuned to operation conditions.
We give a key step towards tackling this variability with an algorithm that, without
modification, is capable of tuning a 4-gate Si FinFET, a 5-gate GeSi nanowire
and a 7-gate SiGe heterostructure double quantum dot device from scratch. We achieve
tuning times of 30, 10, and 92 minutes, respectively. The algorithm also provides
insight into the parameter space landscape for each of these devices. These results
show that overarching solutions for the tuning of quantum devices are enabled
by machine learning.
acknowledged_ssus:
- _id: NanoFab
acknowledgement: "We acknowledge Ang Li, Erik P. A. M. Bakkers (University of Eindhoven)
for the fabrication of the Ge/Si nanowire. This work was supported by the Royal
Society, the EPSRC National Quantum Technology Hub in Networked Quantum Information
Technology (EP/M013243/1), Quantum Technology Capital (EP/N014995/1), EPSRC Platform
Grant\r\n(EP/R029229/1), the European Research Council (Grant agreement 948932),
the Swiss Nanoscience Institute, the\r\nNCCR SPIN, the EU H2020 European Microkelvin
Platform EMP grant No. 824109, the Scientific Service Units\r\nof IST Austria through
resources provided by the nanofabrication facility and, the FWF-P30207 project.
This publication was also made possible through support from Templeton World Charity
Foundation and John Templeton Foundation. The opinions expressed in this publication
are those of the authors and do not necessarily reflect the views of the Templeton
Foundations."
article_number: '2107.12975'
article_processing_charge: No
arxiv: 1
author:
- first_name: B.
full_name: Severin, B.
last_name: Severin
- first_name: D. T.
full_name: Lennon, D. T.
last_name: Lennon
- first_name: L. C.
full_name: Camenzind, L. C.
last_name: Camenzind
- first_name: F.
full_name: Vigneau, F.
last_name: Vigneau
- first_name: F.
full_name: Fedele, F.
last_name: Fedele
- first_name: Daniel
full_name: Jirovec, Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
orcid: 0000-0002-7197-4801
- first_name: A.
full_name: Ballabio, A.
last_name: Ballabio
- first_name: D.
full_name: Chrastina, D.
last_name: Chrastina
- first_name: G.
full_name: Isella, G.
last_name: Isella
- first_name: M. de
full_name: Kruijf, M. de
last_name: Kruijf
- first_name: M. J.
full_name: Carballido, M. J.
last_name: Carballido
- first_name: S.
full_name: Svab, S.
last_name: Svab
- first_name: A. V.
full_name: Kuhlmann, A. V.
last_name: Kuhlmann
- first_name: F. R.
full_name: Braakman, F. R.
last_name: Braakman
- first_name: S.
full_name: Geyer, S.
last_name: Geyer
- first_name: F. N. M.
full_name: Froning, F. N. M.
last_name: Froning
- first_name: H.
full_name: Moon, H.
last_name: Moon
- first_name: M. A.
full_name: Osborne, M. A.
last_name: Osborne
- first_name: D.
full_name: Sejdinovic, D.
last_name: Sejdinovic
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
- first_name: D. M.
full_name: Zumbühl, D. M.
last_name: Zumbühl
- first_name: G. A. D.
full_name: Briggs, G. A. D.
last_name: Briggs
- first_name: N.
full_name: Ares, N.
last_name: Ares
citation:
ama: Severin B, Lennon DT, Camenzind LC, et al. Cross-architecture tuning of silicon
and SiGe-based quantum devices using machine learning. arXiv. doi:10.48550/arXiv.2107.12975
apa: Severin, B., Lennon, D. T., Camenzind, L. C., Vigneau, F., Fedele, F., Jirovec,
D., … Ares, N. (n.d.). Cross-architecture tuning of silicon and SiGe-based quantum
devices using machine learning. arXiv. https://doi.org/10.48550/arXiv.2107.12975
chicago: Severin, B., D. T. Lennon, L. C. Camenzind, F. Vigneau, F. Fedele, Daniel
Jirovec, A. Ballabio, et al. “Cross-Architecture Tuning of Silicon and SiGe-Based
Quantum Devices Using Machine Learning.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2107.12975.
ieee: B. Severin et al., “Cross-architecture tuning of silicon and SiGe-based
quantum devices using machine learning,” arXiv. .
ista: Severin B, Lennon DT, Camenzind LC, Vigneau F, Fedele F, Jirovec D, Ballabio
A, Chrastina D, Isella G, Kruijf M de, Carballido MJ, Svab S, Kuhlmann AV, Braakman
FR, Geyer S, Froning FNM, Moon H, Osborne MA, Sejdinovic D, Katsaros G, Zumbühl
DM, Briggs GAD, Ares N. Cross-architecture tuning of silicon and SiGe-based quantum
devices using machine learning. arXiv, 2107.12975.
mla: Severin, B., et al. “Cross-Architecture Tuning of Silicon and SiGe-Based Quantum
Devices Using Machine Learning.” ArXiv, 2107.12975, doi:10.48550/arXiv.2107.12975.
short: B. Severin, D.T. Lennon, L.C. Camenzind, F. Vigneau, F. Fedele, D. Jirovec,
A. Ballabio, D. Chrastina, G. Isella, M. de Kruijf, M.J. Carballido, S. Svab,
A.V. Kuhlmann, F.R. Braakman, S. Geyer, F.N.M. Froning, H. Moon, M.A. Osborne,
D. Sejdinovic, G. Katsaros, D.M. Zumbühl, G.A.D. Briggs, N. Ares, ArXiv (n.d.).
date_created: 2021-10-01T12:40:22Z
date_published: 2021-07-27T00:00:00Z
date_updated: 2024-03-25T23:30:14Z
day: '27'
department:
- _id: GeKa
doi: 10.48550/arXiv.2107.12975
external_id:
arxiv:
- '2107.12975'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2107.12975
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 2641CE5E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P30207
name: Hole spin orbit qubits in Ge quantum wells
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '10058'
relation: dissertation_contains
status: public
status: public
title: Cross-architecture tuning of silicon and SiGe-based quantum devices using machine
learning
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...