---
_id: '7142'
abstract:
- lang: eng
text: The phytohormone auxin acts as an amazingly versatile coordinator of plant
growth and development. With its morphogen-like properties, auxin controls sites
and timing of differentiation and/or growth responses both, in quantitative and
qualitative terms. Specificity in the auxin response depends largely on distinct
modes of signal transmission, by which individual cells perceive and convert auxin
signals into a remarkable diversity of responses. The best understood, or so-called
canonical mechanism of auxin perception ultimately results in variable adjustments
of the cellular transcriptome, via a short, nuclear signal transduction pathway.
Additional findings that accumulated over decades implied that an additional,
presumably, cell surface-based auxin perception mechanism mediates very rapid
cellular responses and decisively contributes to the cell's overall hormonal response.
Recent investigations into both, nuclear and cell surface auxin signalling challenged
this assumed partition of roles for different auxin signalling pathways and revealed
an unexpected complexity in transcriptional and non-transcriptional cellular responses
mediated by auxin.
acknowledgement: Research in J.F. laboratory is funded by the European Union's Horizon
2020 program (ERC grant agreement n° 742985); C.L. is supported by the Austrian
Science Fund (FWF grant P 31493).
article_processing_charge: No
article_type: original
author:
- first_name: Michelle C
full_name: Gallei, Michelle C
id: 35A03822-F248-11E8-B48F-1D18A9856A87
last_name: Gallei
orcid: 0000-0003-1286-7368
- first_name: Christian
full_name: Luschnig, Christian
last_name: Luschnig
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Gallei MC, Luschnig C, Friml J. Auxin signalling in growth: Schrödinger’s
cat out of the bag. Current Opinion in Plant Biology. 2020;53(2):43-49.
doi:10.1016/j.pbi.2019.10.003'
apa: 'Gallei, M. C., Luschnig, C., & Friml, J. (2020). Auxin signalling in growth:
Schrödinger’s cat out of the bag. Current Opinion in Plant Biology. Elsevier.
https://doi.org/10.1016/j.pbi.2019.10.003'
chicago: 'Gallei, Michelle C, Christian Luschnig, and Jiří Friml. “Auxin Signalling
in Growth: Schrödinger’s Cat out of the Bag.” Current Opinion in Plant Biology.
Elsevier, 2020. https://doi.org/10.1016/j.pbi.2019.10.003.'
ieee: 'M. C. Gallei, C. Luschnig, and J. Friml, “Auxin signalling in growth: Schrödinger’s
cat out of the bag,” Current Opinion in Plant Biology, vol. 53, no. 2.
Elsevier, pp. 43–49, 2020.'
ista: 'Gallei MC, Luschnig C, Friml J. 2020. Auxin signalling in growth: Schrödinger’s
cat out of the bag. Current Opinion in Plant Biology. 53(2), 43–49.'
mla: 'Gallei, Michelle C., et al. “Auxin Signalling in Growth: Schrödinger’s Cat
out of the Bag.” Current Opinion in Plant Biology, vol. 53, no. 2, Elsevier,
2020, pp. 43–49, doi:10.1016/j.pbi.2019.10.003.'
short: M.C. Gallei, C. Luschnig, J. Friml, Current Opinion in Plant Biology 53 (2020)
43–49.
corr_author: '1'
date_created: 2019-12-02T12:05:26Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2026-04-07T14:18:57Z
day: '01'
department:
- _id: JiFr
doi: 10.1016/j.pbi.2019.10.003
ec_funded: 1
external_id:
isi:
- '000521120600007'
pmid:
- '31760231'
intvolume: ' 53'
isi: 1
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 43-49
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: Current Opinion in Plant Biology
publication_identifier:
eissn:
- 1879-0356
issn:
- 1369-5266
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '11626'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Auxin signalling in growth: Schrödinger''s cat out of the bag'
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 53
year: '2020'
...
---
_id: '8724'
abstract:
- lang: eng
text: "We study the problem of learning from multiple untrusted data sources, a
scenario of increasing practical relevance given the recent emergence of crowdsourcing
and collaborative learning paradigms. Specifically, we analyze the situation in
which a learning system obtains datasets from multiple sources, some of which
might be biased or even adversarially perturbed. It is\r\nknown that in the single-source
case, an adversary with the power to corrupt a fixed fraction of the training
data can prevent PAC-learnability, that is, even in the limit of infinitely much
training data, no learning system can approach the optimal test error. In this
work we show that, surprisingly, the same is not true in the multi-source setting,
where the adversary can arbitrarily\r\ncorrupt a fixed fraction of the data sources.
Our main results are a generalization bound that provides finite-sample guarantees
for this learning setting, as well as corresponding lower bounds. Besides establishing
PAC-learnability our results also show that in a cooperative learning setting
sharing data with other parties has provable benefits, even if some\r\nparticipants
are malicious. "
acknowledged_ssus:
- _id: ScienComp
acknowledgement: Dan Alistarh is supported in part by the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML). This research was supported by the Scientific
Service Units (SSU) of IST Austria through resources provided by Scientific Computing
(SciComp).
article_processing_charge: No
arxiv: 1
author:
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
orcid: 0009-0009-5204-7621
- first_name: Elias
full_name: Frantar, Elias
id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f
last_name: Frantar
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. On the sample complexity
of adversarial multi-source PAC learning. In: Proceedings of the 37th International
Conference on Machine Learning. Vol 119. ML Research Press; 2020:5416-5425.'
apa: 'Konstantinov, N. H., Frantar, E., Alistarh, D.-A., & Lampert, C. (2020).
On the sample complexity of adversarial multi-source PAC learning. In Proceedings
of the 37th International Conference on Machine Learning (Vol. 119, pp. 5416–5425).
Online: ML Research Press.'
chicago: Konstantinov, Nikola H, Elias Frantar, Dan-Adrian Alistarh, and Christoph
Lampert. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.”
In Proceedings of the 37th International Conference on Machine Learning,
119:5416–25. ML Research Press, 2020.
ieee: N. H. Konstantinov, E. Frantar, D.-A. Alistarh, and C. Lampert, “On the sample
complexity of adversarial multi-source PAC learning,” in Proceedings of the
37th International Conference on Machine Learning, Online, 2020, vol. 119,
pp. 5416–5425.
ista: 'Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. 2020. On the sample
complexity of adversarial multi-source PAC learning. Proceedings of the 37th International
Conference on Machine Learning. ICML: International Conference on Machine Learning
vol. 119, 5416–5425.'
mla: Konstantinov, Nikola H., et al. “On the Sample Complexity of Adversarial Multi-Source
PAC Learning.” Proceedings of the 37th International Conference on Machine
Learning, vol. 119, ML Research Press, 2020, pp. 5416–25.
short: N.H. Konstantinov, E. Frantar, D.-A. Alistarh, C. Lampert, in:, Proceedings
of the 37th International Conference on Machine Learning, ML Research Press, 2020,
pp. 5416–5425.
conference:
end_date: 2020-07-18
location: Online
name: 'ICML: International Conference on Machine Learning'
start_date: 2020-07-12
corr_author: '1'
date_created: 2020-11-05T15:25:58Z
date_published: 2020-07-12T00:00:00Z
date_updated: 2026-04-07T14:19:48Z
day: '12'
ddc:
- '000'
department:
- _id: DaAl
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '2002.10384'
file:
- access_level: open_access
checksum: cc755d0054bc4b2be778ea7aa7884d2f
content_type: application/pdf
creator: dernst
date_created: 2021-02-15T09:00:01Z
date_updated: 2021-02-15T09:00:01Z
file_id: '9120'
file_name: 2020_PMLR_Konstantinov.pdf
file_size: 281286
relation: main_file
success: 1
file_date_updated: 2021-02-15T09:00:01Z
has_accepted_license: '1'
intvolume: ' 119'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 5416-5425
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the 37th International Conference on Machine Learning
publication_identifier:
issn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
link:
- relation: supplementary_material
url: http://proceedings.mlr.press/v119/konstantinov20a/konstantinov20a-supp.pdf
record:
- id: '10799'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: On the sample complexity of adversarial multi-source PAC learning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2020'
...
---
_id: '8644'
abstract:
- lang: eng
text: Determining the phase diagram of systems consisting of smaller subsystems
'connected' via a tunable coupling is a challenging task relevant for a variety
of physical settings. A general question is whether new phases, not present in
the uncoupled limit, may arise. We use machine learning and a suitable quasidistance
between different points of the phase diagram to study layered spin models, in
which the spin variables constituting each of the uncoupled systems (to which
we refer as layers) are coupled to each other via an interlayer coupling. In such
systems, in general, composite order parameters involving spins of different layers
may emerge as a consequence of the interlayer coupling. We focus on the layered
Ising and Ashkin–Teller models as a paradigmatic case study, determining their
phase diagram via the application of a machine learning algorithm to the Monte
Carlo data. Remarkably our technique is able to correctly characterize all the
system phases also in the case of hidden order parameters, i.e. order parameters
whose expression in terms of the microscopic configurations would require additional
preprocessing of the data fed to the algorithm. We correctly retrieve the three
known phases of the Ashkin–Teller model with ferromagnetic couplings, including
the phase described by a composite order parameter. For the bilayer and trilayer
Ising models the phases we find are only the ferromagnetic and the paramagnetic
ones. Within the approach we introduce, owing to the construction of convolutional
neural networks, naturally suitable for layered image-like data with arbitrary
number of layers, no preprocessing of the Monte Carlo data is needed, also with
regard to its spatial structure. The physical meaning of our results is discussed
and compared with analytical data, where available. Yet, the method can be used
without any a priori knowledge of the phases one seeks to find and can be applied
to other models and structures.
acknowledgement: We thank Gesualdo Delfino, Michele Fabrizio, Piero Ferrarese, Robert
Konik, Christoph Lampert and Mikhail Lemeshko for stimulating discussions at various
stages of this work. WR has received funding from the EU Horizon 2020 program under
the Marie Skłodowska-Curie Grant Agreement No. 665385 and is a recipient of a DOC
Fellowship of the Austrian Academy of Sciences. GB acknowledges support from the
Austrian Science Fund (FWF), under project No. M2641-N27. ND acknowledges support
by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) via Collaborative
Research Center SFB 1225 (ISOQUANT)--project-id 273811115--and under Germany's Excellence
Strategy 'EXC-2181/1-390900948' (the Heidelberg STRUCTURES Excellence Cluster).
article_number: '093026'
article_processing_charge: No
article_type: original
author:
- first_name: Wojciech
full_name: Rzadkowski, Wojciech
id: 48C55298-F248-11E8-B48F-1D18A9856A87
last_name: Rzadkowski
orcid: 0000-0002-1106-4419
- first_name: N
full_name: Defenu, N
last_name: Defenu
- first_name: S
full_name: Chiacchiera, S
last_name: Chiacchiera
- first_name: A
full_name: Trombettoni, A
last_name: Trombettoni
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
citation:
ama: Rzadkowski W, Defenu N, Chiacchiera S, Trombettoni A, Bighin G. Detecting composite
orders in layered models via machine learning. New Journal of Physics.
2020;22(9). doi:10.1088/1367-2630/abae44
apa: Rzadkowski, W., Defenu, N., Chiacchiera, S., Trombettoni, A., & Bighin,
G. (2020). Detecting composite orders in layered models via machine learning.
New Journal of Physics. IOP Publishing. https://doi.org/10.1088/1367-2630/abae44
chicago: Rzadkowski, Wojciech, N Defenu, S Chiacchiera, A Trombettoni, and Giacomo
Bighin. “Detecting Composite Orders in Layered Models via Machine Learning.” New
Journal of Physics. IOP Publishing, 2020. https://doi.org/10.1088/1367-2630/abae44.
ieee: W. Rzadkowski, N. Defenu, S. Chiacchiera, A. Trombettoni, and G. Bighin, “Detecting
composite orders in layered models via machine learning,” New Journal of Physics,
vol. 22, no. 9. IOP Publishing, 2020.
ista: Rzadkowski W, Defenu N, Chiacchiera S, Trombettoni A, Bighin G. 2020. Detecting
composite orders in layered models via machine learning. New Journal of Physics.
22(9), 093026.
mla: Rzadkowski, Wojciech, et al. “Detecting Composite Orders in Layered Models
via Machine Learning.” New Journal of Physics, vol. 22, no. 9, 093026,
IOP Publishing, 2020, doi:10.1088/1367-2630/abae44.
short: W. Rzadkowski, N. Defenu, S. Chiacchiera, A. Trombettoni, G. Bighin, New
Journal of Physics 22 (2020).
corr_author: '1'
date_created: 2020-10-11T22:01:14Z
date_published: 2020-09-01T00:00:00Z
date_updated: 2026-04-07T14:20:12Z
day: '01'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1088/1367-2630/abae44
ec_funded: 1
external_id:
isi:
- '000573298000001'
file:
- access_level: open_access
checksum: c9238fff422e7a957c3a0d559f756b3a
content_type: application/pdf
creator: dernst
date_created: 2020-10-12T12:18:47Z
date_updated: 2020-10-12T12:18:47Z
file_id: '8650'
file_name: 2020_NewJournalPhysics_Rzdkowski.pdf
file_size: 2725143
relation: main_file
success: 1
file_date_updated: 2020-10-12T12:18:47Z
has_accepted_license: '1'
intvolume: ' 22'
isi: 1
issue: '9'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 05A235A0-7A3F-11EA-A408-12923DDC885E
grant_number: '25681'
name: Analytic and machine learning approaches to composite quantum impurities
- _id: 26986C82-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02641
name: A path-integral approach to composite impurities
publication: New Journal of Physics
publication_identifier:
issn:
- 1367-2630
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
related_material:
record:
- id: '10759'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Detecting composite orders in layered models via machine learning
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: 22
year: '2020'
...
---
_id: '7956'
abstract:
- lang: eng
text: When short-range attractions are combined with long-range repulsions in colloidal
particle systems, complex microphases can emerge. Here, we study a system of isotropic
particles, which can form lamellar structures or a disordered fluid phase when
temperature is varied. We show that, at equilibrium, the lamellar structure crystallizes,
while out of equilibrium, the system forms a variety of structures at different
shear rates and temperatures above melting. The shear-induced ordering is analyzed
by means of principal component analysis and artificial neural networks, which
are applied to data of reduced dimensionality. Our results reveal the possibility
of inducing ordering by shear, potentially providing a feasible route to the fabrication
of ordered lamellar structures from isotropic particles.
article_number: '204905'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: J.
full_name: Pȩkalski, J.
last_name: Pȩkalski
- first_name: Wojciech
full_name: Rzadkowski, Wojciech
id: 48C55298-F248-11E8-B48F-1D18A9856A87
last_name: Rzadkowski
orcid: 0000-0002-1106-4419
- first_name: A. Z.
full_name: Panagiotopoulos, A. Z.
last_name: Panagiotopoulos
citation:
ama: 'Pȩkalski J, Rzadkowski W, Panagiotopoulos AZ. Shear-induced ordering in systems
with competing interactions: A machine learning study. The Journal of chemical
physics. 2020;152(20). doi:10.1063/5.0005194'
apa: 'Pȩkalski, J., Rzadkowski, W., & Panagiotopoulos, A. Z. (2020). Shear-induced
ordering in systems with competing interactions: A machine learning study. The
Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/5.0005194'
chicago: 'Pȩkalski, J., Wojciech Rzadkowski, and A. Z. Panagiotopoulos. “Shear-Induced
Ordering in Systems with Competing Interactions: A Machine Learning Study.” The
Journal of Chemical Physics. AIP Publishing, 2020. https://doi.org/10.1063/5.0005194.'
ieee: 'J. Pȩkalski, W. Rzadkowski, and A. Z. Panagiotopoulos, “Shear-induced ordering
in systems with competing interactions: A machine learning study,” The Journal
of chemical physics, vol. 152, no. 20. AIP Publishing, 2020.'
ista: 'Pȩkalski J, Rzadkowski W, Panagiotopoulos AZ. 2020. Shear-induced ordering
in systems with competing interactions: A machine learning study. The Journal
of chemical physics. 152(20), 204905.'
mla: 'Pȩkalski, J., et al. “Shear-Induced Ordering in Systems with Competing Interactions:
A Machine Learning Study.” The Journal of Chemical Physics, vol. 152, no.
20, 204905, AIP Publishing, 2020, doi:10.1063/5.0005194.'
short: J. Pȩkalski, W. Rzadkowski, A.Z. Panagiotopoulos, The Journal of Chemical
Physics 152 (2020).
date_created: 2020-06-14T22:00:49Z
date_published: 2020-05-29T00:00:00Z
date_updated: 2026-04-07T14:20:12Z
day: '29'
department:
- _id: MiLe
doi: 10.1063/5.0005194
ec_funded: 1
external_id:
arxiv:
- '2002.07294'
isi:
- '000537900300001'
pmid:
- '32486692'
intvolume: ' 152'
isi: 1
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1063/5.0005194
month: '05'
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
publication: The Journal of chemical physics
publication_identifier:
eissn:
- 1089-7690
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
related_material:
record:
- id: '10759'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Shear-induced ordering in systems with competing interactions: A machine learning
study'
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 152
year: '2020'
...
---
_id: '7573'
abstract:
- lang: eng
text: This paper deals with dynamical optimal transport metrics defined by spatial
discretisation of the Benamou–Benamou formula for the Kantorovich metric . Such
metrics appear naturally in discretisations of -gradient flow formulations for
dissipative PDE. However, it has recently been shown that these metrics do not
in general converge to , unless strong geometric constraints are imposed on the
discrete mesh. In this paper we prove that, in a 1-dimensional periodic setting,
discrete transport metrics converge to a limiting transport metric with a non-trivial
effective mobility. This mobility depends sensitively on the geometry of the mesh
and on the non-local mobility at the discrete level. Our result quantifies to
what extent discrete transport can make use of microstructure in the mesh to reduce
the cost of transport.
acknowledgement: J.M. gratefully acknowledges support by the European Research Council
(ERC) under the European Union's Horizon 2020 research and innovation programme
(grant agreement No 716117). J.M. and L.P. also acknowledge support from the Austrian
Science Fund (FWF), grants No F65 and W1245. E.K. gratefully acknowledges support
by the German Research Foundation through the Hausdorff Center for Mathematics and
the Collaborative Research Center 1060. P.G. is partially funded by the Deutsche
Forschungsgemeinschaft (DFG, German Research Foundation) – 350398276.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Peter
full_name: Gladbach, Peter
last_name: Gladbach
- first_name: Eva
full_name: Kopfer, Eva
last_name: Kopfer
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
citation:
ama: Gladbach P, Kopfer E, Maas J, Portinale L. Homogenisation of one-dimensional
discrete optimal transport. Journal de Mathematiques Pures et Appliquees.
2020;139(7):204-234. doi:10.1016/j.matpur.2020.02.008
apa: Gladbach, P., Kopfer, E., Maas, J., & Portinale, L. (2020). Homogenisation
of one-dimensional discrete optimal transport. Journal de Mathematiques Pures
et Appliquees. Elsevier. https://doi.org/10.1016/j.matpur.2020.02.008
chicago: Gladbach, Peter, Eva Kopfer, Jan Maas, and Lorenzo Portinale. “Homogenisation
of One-Dimensional Discrete Optimal Transport.” Journal de Mathematiques Pures
et Appliquees. Elsevier, 2020. https://doi.org/10.1016/j.matpur.2020.02.008.
ieee: P. Gladbach, E. Kopfer, J. Maas, and L. Portinale, “Homogenisation of one-dimensional
discrete optimal transport,” Journal de Mathematiques Pures et Appliquees,
vol. 139, no. 7. Elsevier, pp. 204–234, 2020.
ista: Gladbach P, Kopfer E, Maas J, Portinale L. 2020. Homogenisation of one-dimensional
discrete optimal transport. Journal de Mathematiques Pures et Appliquees. 139(7),
204–234.
mla: Gladbach, Peter, et al. “Homogenisation of One-Dimensional Discrete Optimal
Transport.” Journal de Mathematiques Pures et Appliquees, vol. 139, no.
7, Elsevier, 2020, pp. 204–34, doi:10.1016/j.matpur.2020.02.008.
short: P. Gladbach, E. Kopfer, J. Maas, L. Portinale, Journal de Mathematiques Pures
et Appliquees 139 (2020) 204–234.
date_created: 2020-03-08T23:00:47Z
date_published: 2020-07-01T00:00:00Z
date_updated: 2026-04-08T07:00:03Z
day: '01'
department:
- _id: JaMa
doi: 10.1016/j.matpur.2020.02.008
ec_funded: 1
external_id:
arxiv:
- '1905.05757'
isi:
- '000539439400008'
intvolume: ' 139'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1905.05757
month: '07'
oa: 1
oa_version: Preprint
page: 204-234
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: 260482E2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: F06504
name: Taming Complexity in Partial Differential Systems
- _id: 260788DE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W1245
name: Dissipation and dispersion in nonlinear partial differential equations
publication: Journal de Mathematiques Pures et Appliquees
publication_identifier:
issn:
- 0021-7824
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '10030'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Homogenisation of one-dimensional discrete optimal transport
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 139
year: '2020'
...
---
_id: '9781'
abstract:
- lang: eng
text: We consider the Pekar functional on a ball in ℝ3. We prove uniqueness of minimizers,
and a quadratic lower bound in terms of the distance to the minimizer. The latter
follows from nondegeneracy of the Hessian at the minimum.
acknowledgement: We are grateful for the hospitality at the Mittag-Leffler Institute,
where part of this work has been done. The work of the authors was supported by
the European Research Council (ERC)under the European Union's Horizon 2020 research
and innovation programme grant 694227.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Dario
full_name: Feliciangeli, Dario
id: 41A639AA-F248-11E8-B48F-1D18A9856A87
last_name: Feliciangeli
orcid: 0000-0003-0754-8530
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Feliciangeli D, Seiringer R. Uniqueness and nondegeneracy of minimizers of
the Pekar functional on a ball. SIAM Journal on Mathematical Analysis.
2020;52(1):605-622. doi:10.1137/19m126284x
apa: Feliciangeli, D., & Seiringer, R. (2020). Uniqueness and nondegeneracy
of minimizers of the Pekar functional on a ball. SIAM Journal on Mathematical
Analysis. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/19m126284x
chicago: Feliciangeli, Dario, and Robert Seiringer. “Uniqueness and Nondegeneracy
of Minimizers of the Pekar Functional on a Ball.” SIAM Journal on Mathematical
Analysis. Society for Industrial and Applied Mathematics , 2020. https://doi.org/10.1137/19m126284x.
ieee: D. Feliciangeli and R. Seiringer, “Uniqueness and nondegeneracy of minimizers
of the Pekar functional on a ball,” SIAM Journal on Mathematical Analysis,
vol. 52, no. 1. Society for Industrial and Applied Mathematics , pp. 605–622,
2020.
ista: Feliciangeli D, Seiringer R. 2020. Uniqueness and nondegeneracy of minimizers
of the Pekar functional on a ball. SIAM Journal on Mathematical Analysis. 52(1),
605–622.
mla: Feliciangeli, Dario, and Robert Seiringer. “Uniqueness and Nondegeneracy of
Minimizers of the Pekar Functional on a Ball.” SIAM Journal on Mathematical
Analysis, vol. 52, no. 1, Society for Industrial and Applied Mathematics ,
2020, pp. 605–22, doi:10.1137/19m126284x.
short: D. Feliciangeli, R. Seiringer, SIAM Journal on Mathematical Analysis 52 (2020)
605–622.
corr_author: '1'
date_created: 2021-08-06T07:34:16Z
date_published: 2020-02-12T00:00:00Z
date_updated: 2026-04-08T06:59:49Z
day: '12'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1137/19m126284x
ec_funded: 1
external_id:
arxiv:
- '1904.08647 '
isi:
- '000546967700022'
has_accepted_license: '1'
intvolume: ' 52'
isi: 1
issue: '1'
keyword:
- Applied Mathematics
- Computational Mathematics
- Analysis
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.08647
month: '02'
oa: 1
oa_version: Preprint
page: 605-622
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: SIAM Journal on Mathematical Analysis
publication_identifier:
eissn:
- 1095-7154
issn:
- 0036-1410
publication_status: published
publisher: 'Society for Industrial and Applied Mathematics '
quality_controlled: '1'
related_material:
record:
- id: '9733'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Uniqueness and nondegeneracy of minimizers of the Pekar functional on a ball
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2020'
...
---
_id: '10022'
abstract:
- lang: eng
text: We consider finite-volume approximations of Fokker-Planck equations on bounded
convex domains in R^d and study the corresponding gradient flow structures. We
reprove the convergence of the discrete to continuous Fokker-Planck equation via
the method of Evolutionary Γ-convergence, i.e., we pass to the limit at the level
of the gradient flow structures, generalising the one-dimensional result obtained
by Disser and Liero. The proof is of variational nature and relies on a Mosco
convergence result for functionals in the discrete-to-continuum limit that is
of independent interest. Our results apply to arbitrary regular meshes, even though
the associated discrete transport distances may fail to converge to the Wasserstein
distance in this generality.
acknowledgement: This work is supported by the European Research Council (ERC) under
the European Union’s Horizon 2020 research and innovation programme (grant agreement
No 716117) and by the Austrian Science Fund (FWF), grants No F65 and W1245.
article_number: '2008.10962'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dominik L
full_name: Forkert, Dominik L
id: 35C79D68-F248-11E8-B48F-1D18A9856A87
last_name: Forkert
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
citation:
ama: Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient
flow structures for Fokker-Planck equations in multiple dimensions. arXiv.
doi:10.48550/arXiv.2008.10962
apa: Forkert, D. L., Maas, J., & Portinale, L. (n.d.). Evolutionary Γ-convergence
of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions.
arXiv. https://doi.org/10.48550/arXiv.2008.10962
chicago: Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary Γ-Convergence
of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.”
ArXiv, n.d. https://doi.org/10.48550/arXiv.2008.10962.
ieee: D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary Γ-convergence of entropic
gradient flow structures for Fokker-Planck equations in multiple dimensions,”
arXiv. .
ista: Forkert DL, Maas J, Portinale L. Evolutionary Γ-convergence of entropic gradient
flow structures for Fokker-Planck equations in multiple dimensions. arXiv, 2008.10962.
mla: Forkert, Dominik L., et al. “Evolutionary Γ-Convergence of Entropic Gradient
Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” ArXiv,
2008.10962, doi:10.48550/arXiv.2008.10962.
short: D.L. Forkert, J. Maas, L. Portinale, ArXiv (n.d.).
corr_author: '1'
date_created: 2021-09-17T10:57:27Z
date_published: 2020-08-25T00:00:00Z
date_updated: 2026-04-08T07:00:03Z
day: '25'
department:
- _id: JaMa
doi: 10.48550/arXiv.2008.10962
ec_funded: 1
external_id:
arxiv:
- '2008.10962'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2008.10962
month: '08'
oa: 1
oa_version: Preprint
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: arXiv
publication_status: draft
related_material:
record:
- id: '11739'
relation: later_version
status: public
- id: '10030'
relation: dissertation_contains
status: public
status: public
title: Evolutionary Γ-convergence of entropic gradient flow structures for Fokker-Planck
equations in multiple dimensions
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '7489'
abstract:
- lang: eng
text: 'In the present work, we consider the evolution of two fluids separated by
a sharp interface in the presence of surface tension—like, for example, the evolution
of oil bubbles in water. Our main result is a weak–strong uniqueness principle
for the corresponding free boundary problem for the incompressible Navier–Stokes
equation: as long as a strong solution exists, any varifold solution must coincide
with it. In particular, in the absence of physical singularities, the concept
of varifold solutions—whose global in time existence has been shown by Abels (Interfaces
Free Bound 9(1):31–65, 2007) for general initial data—does not introduce a mechanism
for non-uniqueness. The key ingredient of our approach is the construction of
a relative entropy functional capable of controlling the interface error. If the
viscosities of the two fluids do not coincide, even for classical (strong) solutions
the gradient of the velocity field becomes discontinuous at the interface, introducing
the need for a careful additional adaption of the relative entropy.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
- first_name: Sebastian
full_name: Hensel, Sebastian
id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
last_name: Hensel
orcid: 0000-0001-7252-8072
citation:
ama: Fischer JL, Hensel S. Weak–strong uniqueness for the Navier–Stokes equation
for two fluids with surface tension. Archive for Rational Mechanics and Analysis.
2020;236:967-1087. doi:10.1007/s00205-019-01486-2
apa: Fischer, J. L., & Hensel, S. (2020). Weak–strong uniqueness for the Navier–Stokes
equation for two fluids with surface tension. Archive for Rational Mechanics
and Analysis. Springer Nature. https://doi.org/10.1007/s00205-019-01486-2
chicago: Fischer, Julian L, and Sebastian Hensel. “Weak–Strong Uniqueness for the
Navier–Stokes Equation for Two Fluids with Surface Tension.” Archive for Rational
Mechanics and Analysis. Springer Nature, 2020. https://doi.org/10.1007/s00205-019-01486-2.
ieee: J. L. Fischer and S. Hensel, “Weak–strong uniqueness for the Navier–Stokes
equation for two fluids with surface tension,” Archive for Rational Mechanics
and Analysis, vol. 236. Springer Nature, pp. 967–1087, 2020.
ista: Fischer JL, Hensel S. 2020. Weak–strong uniqueness for the Navier–Stokes equation
for two fluids with surface tension. Archive for Rational Mechanics and Analysis.
236, 967–1087.
mla: Fischer, Julian L., and Sebastian Hensel. “Weak–Strong Uniqueness for the Navier–Stokes
Equation for Two Fluids with Surface Tension.” Archive for Rational Mechanics
and Analysis, vol. 236, Springer Nature, 2020, pp. 967–1087, doi:10.1007/s00205-019-01486-2.
short: J.L. Fischer, S. Hensel, Archive for Rational Mechanics and Analysis 236
(2020) 967–1087.
corr_author: '1'
date_created: 2020-02-16T23:00:50Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2026-04-08T07:01:01Z
day: '01'
ddc:
- '530'
- '532'
department:
- _id: JuFi
doi: 10.1007/s00205-019-01486-2
ec_funded: 1
external_id:
isi:
- '000511060200001'
file:
- access_level: open_access
checksum: f107e21b58f5930876f47144be37cf6c
content_type: application/pdf
creator: dernst
date_created: 2020-11-20T09:14:22Z
date_updated: 2020-11-20T09:14:22Z
file_id: '8779'
file_name: 2020_ArchRatMechAn_Fischer.pdf
file_size: 1897571
relation: main_file
success: 1
file_date_updated: 2020-11-20T09:14:22Z
has_accepted_license: '1'
intvolume: ' 236'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 967-1087
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Archive for Rational Mechanics and Analysis
publication_identifier:
eissn:
- 1432-0673
issn:
- 0003-9527
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '10007'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Weak–strong uniqueness for the Navier–Stokes equation for two fluids with surface
tension
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: 236
year: '2020'
...
---
_id: '10012'
abstract:
- lang: eng
text: We prove that in the absence of topological changes, the notion of BV solutions
to planar multiphase mean curvature flow does not allow for a mechanism for (unphysical)
non-uniqueness. Our approach is based on the local structure of the energy landscape
near a classical evolution by mean curvature. Mean curvature flow being the gradient
flow of the surface energy functional, we develop a gradient-flow analogue of
the notion of calibrations. Just like the existence of a calibration guarantees
that one has reached a global minimum in the energy landscape, the existence of
a "gradient flow calibration" ensures that the route of steepest descent in the
energy landscape is unique and stable.
acknowledgement: Parts of the paper were written during the visit of the authors to
the Hausdorff Research Institute for Mathematics (HIM), University of Bonn, in the
framework of the trimester program “Evolution of Interfaces”. The support and the
hospitality of HIM are gratefully acknowledged. This project has received funding
from the European Union’s Horizon 2020 research and innovation programme under the
Marie Sklodowska-Curie Grant Agreement No. 665385.
article_number: '2003.05478'
article_processing_charge: No
arxiv: 1
author:
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
- first_name: Sebastian
full_name: Hensel, Sebastian
id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
last_name: Hensel
orcid: 0000-0001-7252-8072
- first_name: Tim
full_name: Laux, Tim
last_name: Laux
- first_name: Thilo
full_name: Simon, Thilo
last_name: Simon
citation:
ama: 'Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy landscape
in multiphase mean curvature flow: weak-strong uniqueness and stability of evolutions.
arXiv. doi:10.48550/arXiv.2003.05478'
apa: 'Fischer, J. L., Hensel, S., Laux, T., & Simon, T. (n.d.). The local structure
of the energy landscape in multiphase mean curvature flow: weak-strong uniqueness
and stability of evolutions. arXiv. https://doi.org/10.48550/arXiv.2003.05478'
chicago: 'Fischer, Julian L, Sebastian Hensel, Tim Laux, and Thilo Simon. “The Local
Structure of the Energy Landscape in Multiphase Mean Curvature Flow: Weak-Strong
Uniqueness and Stability of Evolutions.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2003.05478.'
ieee: 'J. L. Fischer, S. Hensel, T. Laux, and T. Simon, “The local structure of
the energy landscape in multiphase mean curvature flow: weak-strong uniqueness
and stability of evolutions,” arXiv. .'
ista: 'Fischer JL, Hensel S, Laux T, Simon T. The local structure of the energy
landscape in multiphase mean curvature flow: weak-strong uniqueness and stability
of evolutions. arXiv, 2003.05478.'
mla: 'Fischer, Julian L., et al. “The Local Structure of the Energy Landscape in
Multiphase Mean Curvature Flow: Weak-Strong Uniqueness and Stability of Evolutions.”
ArXiv, 2003.05478, doi:10.48550/arXiv.2003.05478.'
short: J.L. Fischer, S. Hensel, T. Laux, T. Simon, ArXiv (n.d.).
date_created: 2021-09-13T12:17:11Z
date_published: 2020-03-11T00:00:00Z
date_updated: 2026-04-08T07:01:01Z
day: '11'
department:
- _id: JuFi
doi: 10.48550/arXiv.2003.05478
ec_funded: 1
external_id:
arxiv:
- '2003.05478'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2003.05478
month: '03'
oa: 1
oa_version: Preprint
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: arXiv
publication_status: draft
related_material:
record:
- id: '10007'
relation: dissertation_contains
status: public
status: public
title: 'The local structure of the energy landscape in multiphase mean curvature flow:
weak-strong uniqueness and stability of evolutions'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8703'
abstract:
- lang: eng
text: 'Even though Delaunay originally introduced his famous triangulations in the
case of infinite point sets with translational periodicity, a software that computes
such triangulations in the general case is not yet available, to the best of our
knowledge. Combining and generalizing previous work, we present a practical algorithm
for computing such triangulations. The algorithm has been implemented and experiments
show that its performance is as good as the one of the CGAL package, which is
restricted to cubic periodicity. '
alternative_title:
- LIPIcs
article_number: '75'
article_processing_charge: No
author:
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
orcid: 0000-0002-8882-5116
- first_name: Mael
full_name: Rouxel-Labbé, Mael
last_name: Rouxel-Labbé
- first_name: Monique
full_name: Teillaud, Monique
last_name: Teillaud
citation:
ama: 'Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay
triangulations. In: 28th Annual European Symposium on Algorithms. Vol 173.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.75'
apa: 'Osang, G. F., Rouxel-Labbé, M., & Teillaud, M. (2020). Generalizing CGAL
periodic Delaunay triangulations. In 28th Annual European Symposium on Algorithms
(Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für
Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.75'
chicago: Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing
CGAL Periodic Delaunay Triangulations.” In 28th Annual European Symposium on
Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
https://doi.org/10.4230/LIPIcs.ESA.2020.75.
ieee: G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic
Delaunay triangulations,” in 28th Annual European Symposium on Algorithms,
Virtual, Online; Pisa, Italy, 2020, vol. 173.
ista: 'Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay
triangulations. 28th Annual European Symposium on Algorithms. ESA: European Symposium
on Algorithms, LIPIcs, vol. 173, 75.'
mla: Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.”
28th Annual European Symposium on Algorithms, vol. 173, 75, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.75.
short: G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-09-09
location: Virtual, Online; Pisa, Italy
name: 'ESA: European Symposium on Algorithms'
start_date: 2020-09-07
corr_author: '1'
date_created: 2020-10-25T23:01:18Z
date_published: 2020-08-26T00:00:00Z
date_updated: 2026-04-08T07:01:29Z
day: '26'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.ESA.2020.75
ec_funded: 1
file:
- access_level: open_access
checksum: fe0f7c49a99ed870c671b911e10d5496
content_type: application/pdf
creator: cziletti
date_created: 2020-10-27T14:31:52Z
date_updated: 2020-10-27T14:31:52Z
file_id: '8712'
file_name: 2020_LIPIcs_Osang.pdf
file_size: 733291
relation: main_file
success: 1
file_date_updated: 2020-10-27T14:31:52Z
has_accepted_license: '1'
intvolume: ' 173'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
publication: 28th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959771627'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '9056'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Generalizing CGAL periodic Delaunay triangulations
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 173
year: '2020'
...
---
_id: '7481'
abstract:
- lang: eng
text: 'We address the following question: How redundant is the parameterisation
of ReLU networks? Specifically, we consider transformations of the weight space
which leave the function implemented by the network intact. Two such transformations
are known for feed-forward architectures: permutation of neurons within a layer,
and positive scaling of all incoming weights of a neuron coupled with inverse
scaling of its outgoing weights. In this work, we show for architectures with
non-increasing widths that permutation and scaling are in fact the only function-preserving
weight transformations. For any eligible architecture we give an explicit construction
of a neural network such that any other network that implements the same function
can be obtained from the original one by the application of permutations and rescaling. The
proof relies on a geometric understanding of boundaries between linear regions
of ReLU networks, and we hope the developed mathematical tools are of independent
interest.'
article_processing_charge: No
author:
- first_name: Phuong
full_name: Bui Thi Mai, Phuong
id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87
last_name: Bui Thi Mai
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Phuong M, Lampert C. Functional vs. parametric equivalence of ReLU networks.
In: 8th International Conference on Learning Representations. ; 2020.'
apa: Phuong, M., & Lampert, C. (2020). Functional vs. parametric equivalence
of ReLU networks. In 8th International Conference on Learning Representations.
Online.
chicago: Phuong, Mary, and Christoph Lampert. “Functional vs. Parametric Equivalence
of ReLU Networks.” In 8th International Conference on Learning Representations,
2020.
ieee: M. Phuong and C. Lampert, “Functional vs. parametric equivalence of ReLU networks,”
in 8th International Conference on Learning Representations, Online, 2020.
ista: 'Phuong M, Lampert C. 2020. Functional vs. parametric equivalence of ReLU
networks. 8th International Conference on Learning Representations. ICLR: International
Conference on Learning Representations.'
mla: Phuong, Mary, and Christoph Lampert. “Functional vs. Parametric Equivalence
of ReLU Networks.” 8th International Conference on Learning Representations,
2020.
short: M. Phuong, C. Lampert, in:, 8th International Conference on Learning Representations,
2020.
conference:
end_date: 2020-04-30
location: Online
name: 'ICLR: International Conference on Learning Representations'
start_date: 2020-04-27
corr_author: '1'
date_created: 2020-02-11T09:07:37Z
date_published: 2020-04-26T00:00:00Z
date_updated: 2026-04-08T07:01:16Z
day: '26'
ddc:
- '000'
department:
- _id: ChLa
file:
- access_level: open_access
checksum: 8d372ea5defd8cb8fdc430111ed754a9
content_type: application/pdf
creator: bphuong
date_created: 2020-02-11T09:07:27Z
date_updated: 2020-07-14T12:47:59Z
file_id: '7482'
file_name: main.pdf
file_size: 405469
relation: main_file
file_date_updated: 2020-07-14T12:47:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: 8th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
related_material:
link:
- relation: supplementary_material
url: https://iclr.cc/virtual_2020/poster_Bylx-TNKvH.html
record:
- id: '9418'
relation: dissertation_contains
status: public
status: public
title: Functional vs. parametric equivalence of ReLU networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
OA_place: publisher
_id: '7944'
abstract:
- lang: eng
text: "This thesis considers two examples of reconfiguration problems: flipping
edges in edge-labelled triangulations of planar point sets and swapping labelled
tokens placed on vertices of a graph. In both cases the studied structures – all
the triangulations of a given point set or all token placements on a given graph
– can be thought of as vertices of the so-called reconfiguration graph, in which
two vertices are adjacent if the corresponding structures differ by a single elementary
operation – by a flip of a diagonal in a triangulation or by a swap of tokens
on adjacent vertices, respectively. We study the reconfiguration of one instance
of a structure into another via (shortest) paths in the reconfiguration graph.\r\n\r\nFor
triangulations of point sets in which each edge has a unique label and a flip
transfers the label from the removed edge to the new edge, we prove a polynomial-time
testable condition, called the Orbit Theorem, that characterizes when two triangulations
of the same point set lie in the same connected component of the reconfiguration
graph. The condition was first conjectured by Bose, Lubiw, Pathak and Verdonschot.
We additionally provide a polynomial time algorithm that computes a reconfiguring
flip sequence, if it exists. Our proof of the Orbit Theorem uses topological properties
of a certain high-dimensional cell complex that has the usual reconfiguration
graph as its 1-skeleton.\r\n\r\nIn the context of token swapping on a tree graph,
we make partial progress on the problem of finding shortest reconfiguration sequences.
We disprove the so-called Happy Leaf Conjecture and demonstrate the importance
of swapping tokens that are already placed at the correct vertices. We also prove
that a generalization of the problem to weighted coloured token swapping is NP-hard
on trees but solvable in polynomial time on paths and stars."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Zuzana
full_name: Masárová, Zuzana
id: 45CFE238-F248-11E8-B48F-1D18A9856A87
last_name: Masárová
orcid: 0000-0002-6660-1322
citation:
ama: Masárová Z. Reconfiguration problems. 2020. doi:10.15479/AT:ISTA:7944
apa: Masárová, Z. (2020). Reconfiguration problems. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:7944
chicago: Masárová, Zuzana. “Reconfiguration Problems.” Institute of Science and
Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7944.
ieee: Z. Masárová, “Reconfiguration problems,” Institute of Science and Technology
Austria, 2020.
ista: Masárová Z. 2020. Reconfiguration problems. Institute of Science and Technology
Austria.
mla: Masárová, Zuzana. Reconfiguration Problems. Institute of Science and
Technology Austria, 2020, doi:10.15479/AT:ISTA:7944.
short: Z. Masárová, Reconfiguration Problems, Institute of Science and Technology
Austria, 2020.
corr_author: '1'
date_created: 2020-06-08T00:49:46Z
date_published: 2020-06-09T00:00:00Z
date_updated: 2026-04-08T07:23:01Z
day: '09'
ddc:
- '516'
- '514'
degree_awarded: PhD
department:
- _id: HeEd
- _id: UlWa
doi: 10.15479/AT:ISTA:7944
file:
- access_level: open_access
checksum: df688bc5a82b50baee0b99d25fc7b7f0
content_type: application/pdf
creator: zmasarov
date_created: 2020-06-08T00:34:00Z
date_updated: 2020-07-14T12:48:05Z
file_id: '7945'
file_name: THESIS_Zuzka_Masarova.pdf
file_size: 13661779
relation: main_file
- access_level: closed
checksum: 45341a35b8f5529c74010b7af43ac188
content_type: application/zip
creator: zmasarov
date_created: 2020-06-08T00:35:30Z
date_updated: 2020-07-14T12:48:05Z
file_id: '7946'
file_name: THESIS_Zuzka_Masarova_SOURCE_FILES.zip
file_size: 32184006
relation: source_file
file_date_updated: 2020-07-14T12:48:05Z
has_accepted_license: '1'
keyword:
- reconfiguration
- reconfiguration graph
- triangulations
- flip
- constrained triangulations
- shellability
- piecewise-linear balls
- token swapping
- trees
- coloured weighted token swapping
language:
- iso: eng
license: https://creativecommons.org/licenses/by-sa/4.0/
month: '06'
oa: 1
oa_version: Published Version
page: '160'
publication_identifier:
isbn:
- 978-3-99078-005-3
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '7950'
relation: part_of_dissertation
status: public
- id: '5986'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
title: Reconfiguration problems
tmp:
image: /images/cc_by_sa.png
legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
BY-SA 4.0)
short: CC BY-SA (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
OA_place: publisher
_id: '8574'
abstract:
- lang: eng
text: "This thesis concerns itself with the interactions of evolutionary and ecological
forces and the consequences on genetic diversity and the ultimate survival of
populations. It is important to understand what signals processes \r\nleave on
the genome and what we can infer from such data, which is usually abundant but
noisy. Furthermore, understanding how and when populations adapt or go extinct
is important for practical purposes, such as the genetic management of populations,
as well as for theoretical questions, since local adaptation can be the first
step toward speciation. \r\nIn Chapter 2, we introduce the method of maximum entropy
to approximate the demographic changes of a population in a simple setting, namely
the logistic growth model with immigration. We show that this method is not only
a powerful \r\ntool in physics but can be gainfully applied in an ecological framework.
We investigate how well it approximates the real \r\nbehavior of the system, and
find that is does so, even in unexpected situations. Finally, we illustrate how
it can model changing environments.\r\nIn Chapter 3, we analyze the co-evolution
of allele frequencies and population sizes in an infinite island model.\r\nWe
give conditions under which polygenic adaptation to a rare habitat is possible.
The model we use is based on the diffusion approximation, considers eco-evolutionary
feedback mechanisms (hard selection), and treats both \r\ndrift and environmental
fluctuations explicitly. We also look at limiting scenarios, for which we derive
analytical expressions. \r\nIn Chapter 4, we present a coalescent based simulation
tool to obtain patterns of diversity in a spatially explicit subdivided population,
in which the demographic history of each subpopulation can be specified. We compare
\r\nthe results to existing predictions, and explore the relative importance of
time and space under a variety of spatial arrangements and demographic histories,
such as expansion and extinction. \r\nIn the last chapter, we give a brief outlook
to further research. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Eniko
full_name: Szep, Eniko
id: 485BB5A4-F248-11E8-B48F-1D18A9856A87
last_name: Szep
citation:
ama: Szep E. Local adaptation in metapopulations. 2020. doi:10.15479/AT:ISTA:8574
apa: Szep, E. (2020). Local adaptation in metapopulations. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:8574
chicago: Szep, Eniko. “Local Adaptation in Metapopulations.” Institute of Science
and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8574.
ieee: E. Szep, “Local adaptation in metapopulations,” Institute of Science and Technology
Austria, 2020.
ista: Szep E. 2020. Local adaptation in metapopulations. Institute of Science and
Technology Austria.
mla: Szep, Eniko. Local Adaptation in Metapopulations. Institute of Science
and Technology Austria, 2020, doi:10.15479/AT:ISTA:8574.
short: E. Szep, Local Adaptation in Metapopulations, Institute of Science and Technology
Austria, 2020.
corr_author: '1'
date_created: 2020-09-28T07:33:38Z
date_published: 2020-09-20T00:00:00Z
date_updated: 2026-04-08T07:21:44Z
day: '20'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:8574
file:
- access_level: open_access
checksum: 20e71f015fbbd78fea708893ad634ed0
content_type: application/pdf
creator: dernst
date_created: 2020-09-28T07:25:35Z
date_updated: 2020-09-28T07:25:35Z
file_id: '8575'
file_name: thesis_EnikoSzep_final.pdf
file_size: 6354833
relation: main_file
success: 1
- access_level: closed
checksum: a8de2c14a1bb4e53c857787efbb289e1
content_type: application/x-zip-compressed
creator: dernst
date_created: 2020-09-28T07:25:37Z
date_updated: 2020-09-28T07:25:37Z
file_id: '8576'
file_name: thesisFiles_EnikoSzep.zip
file_size: 23020401
relation: source_file
file_date_updated: 2020-09-28T07:25:37Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '158'
publication_identifier:
eissn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
title: Local adaptation in metapopulations
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
OA_place: publisher
_id: '7629'
abstract:
- lang: eng
text: "This thesis is based on three main topics: In the first part, we study convergence
of discrete gradient flow structures associated with regular finite-volume discretisations
of Fokker-Planck equations. We show evolutionary I convergence of the discrete
gradient flows to the L2-Wasserstein gradient flow corresponding to the solution
of a Fokker-Planck\r\nequation in arbitrary dimension d >= 1. Along the argument,
we prove Mosco- and I-convergence results for discrete energy functionals, which
are of independent interest for convergence of equivalent gradient flow structures
in Hilbert spaces.\r\nThe second part investigates L2-Wasserstein flows on metric
graph. The starting point is a Benamou-Brenier formula for the L2-Wasserstein
distance, which is proved via a regularisation scheme for solutions of the continuity
equation, adapted to the peculiar geometric structure of metric graphs. Based
on those results, we show that the L2-Wasserstein space over a metric graph admits
a gradient flow which may be identified as a solution of a Fokker-Planck equation.\r\nIn
the third part, we focus again on the discrete gradient flows, already encountered
in the first part. We propose a variational structure which extends the gradient
flow structure to Markov chains violating the detailed-balance conditions. Using
this structure, we characterise contraction estimates for the discrete heat flow
in terms of convexity of\r\ncorresponding path-dependent energy functionals. In
addition, we use this approach to derive several functional inequalities for said
functionals."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Dominik L
full_name: Forkert, Dominik L
id: 35C79D68-F248-11E8-B48F-1D18A9856A87
last_name: Forkert
citation:
ama: Forkert DL. Gradient flows in spaces of probability measures for finite-volume
schemes, metric graphs and non-reversible Markov chains. 2020. doi:10.15479/AT:ISTA:7629
apa: Forkert, D. L. (2020). Gradient flows in spaces of probability measures
for finite-volume schemes, metric graphs and non-reversible Markov chains.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7629
chicago: Forkert, Dominik L. “Gradient Flows in Spaces of Probability Measures for
Finite-Volume Schemes, Metric Graphs and Non-Reversible Markov Chains.” Institute
of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7629.
ieee: D. L. Forkert, “Gradient flows in spaces of probability measures for finite-volume
schemes, metric graphs and non-reversible Markov chains,” Institute of Science
and Technology Austria, 2020.
ista: Forkert DL. 2020. Gradient flows in spaces of probability measures for finite-volume
schemes, metric graphs and non-reversible Markov chains. Institute of Science
and Technology Austria.
mla: Forkert, Dominik L. Gradient Flows in Spaces of Probability Measures for
Finite-Volume Schemes, Metric Graphs and Non-Reversible Markov Chains. Institute
of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7629.
short: D.L. Forkert, Gradient Flows in Spaces of Probability Measures for Finite-Volume
Schemes, Metric Graphs and Non-Reversible Markov Chains, Institute of Science
and Technology Austria, 2020.
corr_author: '1'
date_created: 2020-04-02T06:40:23Z
date_published: 2020-03-31T00:00:00Z
date_updated: 2026-04-08T07:22:00Z
day: '31'
ddc:
- '510'
degree_awarded: PhD
department:
- _id: JaMa
doi: 10.15479/AT:ISTA:7629
ec_funded: 1
file:
- access_level: open_access
checksum: c814a1a6195269ca6fe48b0dca45ae8a
content_type: application/pdf
creator: dernst
date_created: 2020-04-14T10:47:59Z
date_updated: 2020-07-14T12:48:01Z
file_id: '7657'
file_name: Thesis_Forkert_PDFA.pdf
file_size: 3297129
relation: main_file
- access_level: closed
checksum: ceafb53f923d1b5bdf14b2b0f22e4a81
content_type: application/x-zip-compressed
creator: dernst
date_created: 2020-04-14T10:47:59Z
date_updated: 2020-07-14T12:48:01Z
file_id: '7658'
file_name: Thesis_Forkert_source.zip
file_size: 1063908
relation: source_file
file_date_updated: 2020-07-14T12:48:01Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '154'
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
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: Gradient flows in spaces of probability measures for finite-volume schemes,
metric graphs and non-reversible Markov chains
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
OA_place: publisher
_id: '8032'
abstract:
- lang: eng
text: "Algorithms in computational 3-manifold topology typically take a triangulation
as an input and return topological information about the underlying 3-manifold.
However, extracting the desired information from a triangulation (e.g., evaluating
an invariant) is often computationally very expensive. In recent years this complexity
barrier has been successfully tackled in some cases by importing ideas from the
theory of parameterized algorithms into the realm of 3-manifolds. Various computationally
hard problems were shown to be efficiently solvable for input triangulations that
are sufficiently “tree-like.”\r\nIn this thesis we focus on the key combinatorial
parameter in the above context: we consider the treewidth of a compact, orientable
3-manifold, i.e., the smallest treewidth of the dual graph of any triangulation
thereof. By building on the work of Scharlemann–Thompson and Scharlemann–Schultens–Saito
on generalized Heegaard splittings, and on the work of Jaco–Rubinstein on layered
triangulations, we establish quantitative relations between the treewidth and
classical topological invariants of a 3-manifold. In particular, among other results,
we show that the treewidth of a closed, orientable, irreducible, non-Haken 3-manifold
is always within a constant factor of its Heegaard genus."
acknowledged_ssus:
- _id: E-Lib
- _id: CampIT
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Kristóf
full_name: Huszár, Kristóf
id: 33C26278-F248-11E8-B48F-1D18A9856A87
last_name: Huszár
orcid: 0000-0002-5445-5057
citation:
ama: Huszár K. Combinatorial width parameters for 3-dimensional manifolds. 2020.
doi:10.15479/AT:ISTA:8032
apa: Huszár, K. (2020). Combinatorial width parameters for 3-dimensional manifolds.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8032
chicago: Huszár, Kristóf. “Combinatorial Width Parameters for 3-Dimensional Manifolds.”
Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8032.
ieee: K. Huszár, “Combinatorial width parameters for 3-dimensional manifolds,” Institute
of Science and Technology Austria, 2020.
ista: Huszár K. 2020. Combinatorial width parameters for 3-dimensional manifolds.
Institute of Science and Technology Austria.
mla: Huszár, Kristóf. Combinatorial Width Parameters for 3-Dimensional Manifolds.
Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8032.
short: K. Huszár, Combinatorial Width Parameters for 3-Dimensional Manifolds, Institute
of Science and Technology Austria, 2020.
corr_author: '1'
date_created: 2020-06-26T10:00:36Z
date_published: 2020-06-26T00:00:00Z
date_updated: 2026-04-08T07:21:28Z
day: '26'
ddc:
- '514'
degree_awarded: PhD
department:
- _id: UlWa
doi: 10.15479/AT:ISTA:8032
file:
- access_level: open_access
checksum: bd8be6e4f1addc863dfcc0fad29ee9c3
content_type: application/pdf
creator: khuszar
date_created: 2020-06-26T10:03:58Z
date_updated: 2020-07-14T12:48:08Z
file_id: '8034'
file_name: Kristof_Huszar-Thesis.pdf
file_size: 2637562
relation: main_file
- access_level: closed
checksum: d5f8456202b32f4a77552ef47a2837d1
content_type: application/x-zip-compressed
creator: khuszar
date_created: 2020-06-26T10:10:06Z
date_updated: 2020-07-14T12:48:08Z
file_id: '8035'
file_name: Kristof_Huszar-Thesis-source.zip
file_size: 7163491
relation: source_file
file_date_updated: 2020-07-14T12:48:08Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: xviii+120
publication_identifier:
isbn:
- 978-3-99078-006-0
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6556'
relation: dissertation_contains
status: public
- id: '7093'
relation: dissertation_contains
status: public
status: public
supervisor:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Jonathan
full_name: Spreer, Jonathan
last_name: Spreer
title: Combinatorial width parameters for 3-dimensional manifolds
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
OA_place: publisher
_id: '8353'
abstract:
- lang: eng
text: "Mrp (Multi resistance and pH adaptation) are broadly distributed secondary
active antiporters that catalyze the transport of monovalent ions such as sodium
and potassium outside of the cell coupled to the inward translocation of protons.
Mrp antiporters are unique in a way that they are composed of seven subunits (MrpABCDEFG)
encoded in a single operon, whereas other antiporters catalyzing the same reaction
are mostly encoded by a single gene. Mrp exchangers are crucial for intracellular
pH homeostasis and Na+ efflux, essential mechanisms for H+ uptake under alkaline
environments and for reduction of the intracellular concentration of toxic cations.
Mrp displays no homology to any other monovalent Na+(K+)/H+ antiporters but Mrp
subunits have primary sequence similarity to essential redox-driven proton pumps,
such as respiratory complex I and membrane-bound hydrogenases. This similarity
reinforces the hypothesis that these present day redox-driven proton pumps are
descended from the Mrp antiporter. The Mrp structure serves as a model to understand
the yet obscure coupling mechanism between ion or electron transfer and proton
translocation in this large group of proteins. In the thesis, I am presenting
the purification, biochemical analysis, cryo-EM analysis and molecular structure
of the Mrp complex from Anoxybacillus flavithermus solved by cryo-EM at 3.0 Å
resolution. Numerous conditions were screened to purify Mrp to high homogeneity
and to obtain an appropriate distribution of single particles on cryo-EM grids
covered with a continuous layer of ultrathin carbon. A preferred particle orientation
problem was solved by performing a tilted data collection. The activity assays
showed the specific pH-dependent\r\nprofile of secondary active antiporters. The
molecular structure shows that Mrp is a dimer of seven-subunit protomers with
50 trans-membrane helices each. The dimer interface is built by many short and
tilted transmembrane helices, probably causing a thinning of the bacterial membrane.
The surface charge distribution shows an extraordinary asymmetry within each monomer,
revealing presumable proton and sodium translocation pathways. The two largest\r\nand
homologous Mrp subunits MrpA and MrpD probably translocate one proton each into
the cell. The sodium ion is likely being translocated in the opposite direction
within the small subunits along a ladder of charged and conserved residues. Based
on the structure, we propose a mechanism were the antiport activity is accomplished
via electrostatic interactions between the charged cations and key charged residues.
The flexible key TM helices coordinate these\r\nelectrostatic interactions, while
the membrane thinning between the monomers enables the translocation of sodium
across the charged membrane. The entire family of redox-driven proton pumps is
likely to perform their mechanism in a likewise manner."
acknowledged_ssus:
- _id: LifeSc
- _id: EM-Fac
- _id: ScienComp
acknowledgement: "I acknowledge the scientific service units of the IST Austria for
providing resources by the Life Science Facility, the Electron Microscopy Facility
and the high-performance computer cluster. Special thanks to the cryo-EM specialists
Valentin Hodirnau and Daniel Johann Gütl for spending many hours with me in front
of the microscope and for supporting me to collect the data presented here. I also
want to thank Professor Masahiro Ito for providing plasmid DNA\r\nencoding Mrp from
Anoxybacillus flavithermus WK1. I am a recipient of a DOC Fellowship of the Austrian
Academy of Sciences."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Julia
full_name: Steiner, Julia
id: 3BB67EB0-F248-11E8-B48F-1D18A9856A87
last_name: Steiner
orcid: 0000-0003-0493-3775
citation:
ama: Steiner J. Biochemical and structural investigation of the Mrp antiporter,
an ancestor of complex I. 2020. doi:10.15479/AT:ISTA:8353
apa: Steiner, J. (2020). Biochemical and structural investigation of the Mrp
antiporter, an ancestor of complex I. Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:8353
chicago: Steiner, Julia. “Biochemical and Structural Investigation of the Mrp Antiporter,
an Ancestor of Complex I.” Institute of Science and Technology Austria, 2020.
https://doi.org/10.15479/AT:ISTA:8353.
ieee: J. Steiner, “Biochemical and structural investigation of the Mrp antiporter,
an ancestor of complex I,” Institute of Science and Technology Austria, 2020.
ista: Steiner J. 2020. Biochemical and structural investigation of the Mrp antiporter,
an ancestor of complex I. Institute of Science and Technology Austria.
mla: Steiner, Julia. Biochemical and Structural Investigation of the Mrp Antiporter,
an Ancestor of Complex I. Institute of Science and Technology Austria, 2020,
doi:10.15479/AT:ISTA:8353.
short: J. Steiner, Biochemical and Structural Investigation of the Mrp Antiporter,
an Ancestor of Complex I, Institute of Science and Technology Austria, 2020.
corr_author: '1'
date_created: 2020-09-09T14:27:01Z
date_published: 2020-09-09T00:00:00Z
date_updated: 2026-04-08T07:23:36Z
day: '09'
ddc:
- '572'
degree_awarded: PhD
department:
- _id: LeSa
doi: 10.15479/AT:ISTA:8353
file:
- access_level: open_access
checksum: 2388d7e6e7a4d364c096fa89f305c3de
content_type: application/pdf
creator: jsteiner
date_created: 2020-09-09T14:22:35Z
date_updated: 2021-09-16T12:40:56Z
file_id: '8354'
file_name: Thesis_Julia_Steiner_pdfA.pdf
file_size: 117547589
relation: main_file
- access_level: closed
checksum: ba112f957b7145462d0ab79044873ee9
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: jsteiner
date_created: 2020-09-09T14:23:25Z
date_updated: 2020-09-15T08:48:37Z
file_id: '8355'
file_name: Thesis_Julia_Steiner.docx
file_size: 223328668
relation: source_file
file_date_updated: 2021-09-16T12:40:56Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: None
page: '191'
project:
- _id: 26169496-B435-11E9-9278-68D0E5697425
grant_number: '24741'
name: Revealing the functional mechanism of Mrp antiporter, an ancestor of complex
I
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8284'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
title: Biochemical and structural investigation of the Mrp antiporter, an ancestor
of complex I
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
OA_place: publisher
_id: '8332'
abstract:
- lang: eng
text: "Designing and verifying concurrent programs is a notoriously challenging,
time consuming, and error prone task, even for experts. This is due to the sheer
number of possible interleavings of a concurrent program, all of which have to
be tracked and accounted for in a formal proof. Inventing an inductive invariant
that captures all interleavings of a low-level implementation is theoretically
possible, but practically intractable. We develop a refinement-based verification
framework that provides mechanisms to simplify proof construction by decomposing
the verification task into smaller subtasks.\r\n\r\nIn a first line of work, we
present a foundation for refinement reasoning over structured concurrent programs.
We introduce layered concurrent programs as a compact notation to represent multi-layer
refinement proofs. A layered concurrent program specifies a sequence of connected
concurrent programs, from most concrete to most abstract, such that common parts
of different programs are written exactly once. Each program in this sequence
is expressed as structured concurrent program, i.e., a program over (potentially
recursive) procedures, imperative control flow, gated atomic actions, structured
parallelism, and asynchronous concurrency. This is in contrast to existing refinement-based
verifiers, which represent concurrent systems as flat transition relations. We
present a powerful refinement proof rule that decomposes refinement checking over
structured programs into modular verification conditions. Refinement checking
is supported by a new form of modular, parameterized invariants, called yield
invariants, and a linear permission system to enhance local reasoning.\r\n\r\nIn
a second line of work, we present two new reduction-based program transformations
that target asynchronous programs. These transformations reduce the number of
interleavings that need to be considered, thus reducing the complexity of invariants.
Synchronization simplifies the verification of asynchronous programs by introducing
the fiction, for proof purposes, that asynchronous operations complete synchronously.
Synchronization summarizes an asynchronous computation as immediate atomic effect.
Inductive sequentialization establishes sequential reductions that captures every
behavior of the original program up to reordering of coarse-grained commutative
actions. A sequential reduction of a concurrent program is easy to reason about
since it corresponds to a simple execution of the program in an idealized synchronous
environment, where processes act in a fixed order and at the same speed.\r\n\r\nOur
approach is implemented the CIVL verifier, which has been successfully used for
the verification of several complex concurrent programs. In our methodology, the
overall correctness of a program is established piecemeal by focusing on the invariant
required for each refinement step separately. While the programmer does the creative
work of specifying the chain of programs and the inductive invariant justifying
each link in the chain, the tool automatically constructs the verification conditions
underlying each refinement step."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
citation:
ama: 'Kragl B. Verifying concurrent programs: Refinement, synchronization, sequentialization.
2020. doi:10.15479/AT:ISTA:8332'
apa: 'Kragl, B. (2020). Verifying concurrent programs: Refinement, synchronization,
sequentialization. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8332'
chicago: 'Kragl, Bernhard. “Verifying Concurrent Programs: Refinement, Synchronization,
Sequentialization.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8332.'
ieee: 'B. Kragl, “Verifying concurrent programs: Refinement, synchronization, sequentialization,”
Institute of Science and Technology Austria, 2020.'
ista: 'Kragl B. 2020. Verifying concurrent programs: Refinement, synchronization,
sequentialization. Institute of Science and Technology Austria.'
mla: 'Kragl, Bernhard. Verifying Concurrent Programs: Refinement, Synchronization,
Sequentialization. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8332.'
short: 'B. Kragl, Verifying Concurrent Programs: Refinement, Synchronization, Sequentialization,
Institute of Science and Technology Austria, 2020.'
corr_author: '1'
date_created: 2020-09-04T12:24:12Z
date_published: 2020-09-03T00:00:00Z
date_updated: 2026-04-08T07:23:53Z
day: '03'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ToHe
doi: 10.15479/AT:ISTA:8332
file:
- access_level: open_access
checksum: 26fe261550f691280bda4c454bf015c7
content_type: application/pdf
creator: bkragl
date_created: 2020-09-04T12:17:47Z
date_updated: 2020-09-04T12:17:47Z
file_id: '8333'
file_name: kragl-thesis.pdf
file_size: 1348815
relation: main_file
- access_level: closed
checksum: b9694ce092b7c55557122adba8337ebc
content_type: application/zip
creator: bkragl
date_created: 2020-09-04T13:00:17Z
date_updated: 2020-09-04T13:00:17Z
file_id: '8335'
file_name: kragl-thesis.zip
file_size: 372312
relation: source_file
file_date_updated: 2020-09-04T13:00:17Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '120'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8012'
relation: part_of_dissertation
status: public
- id: '8195'
relation: part_of_dissertation
status: public
- id: '133'
relation: part_of_dissertation
status: public
- id: '160'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
title: 'Verifying concurrent programs: Refinement, synchronization, sequentialization'
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
_id: '8284'
abstract:
- lang: eng
text: Multiple resistance and pH adaptation (Mrp) antiporters are multi-subunit
Na+ (or K+)/H+ exchangers representing an ancestor of many essential redox-driven
proton pumps, such as respiratory complex I. The mechanism of coupling between
ion or electron transfer and proton translocation in this large protein family
is unknown. Here, we present the structure of the Mrp complex from Anoxybacillus
flavithermus solved by cryo-EM at 3.0 Å resolution. It is a dimer of seven-subunit
protomers with 50 trans-membrane helices each. Surface charge distribution within
each monomer is remarkably asymmetric, revealing probable proton and sodium translocation
pathways. On the basis of the structure we propose a mechanism where the coupling
between sodium and proton translocation is facilitated by a series of electrostatic
interactions between a cation and key charged residues. This mechanism is likely
to be applicable to the entire family of redox proton pumps, where electron transfer
to substrates replaces cation movements.
acknowledged_ssus:
- _id: EM-Fac
- _id: LifeSc
acknowledgement: This research was supported by the Scientific Service Units (SSU)
of IST Austria through resources provided by the Electron Microscopy Facility (EMF),
the Life Science Facility (LSF) and the IST high-performance computing cluster.
We thank Dr Victor-Valentin Hodirnau and Daniel Johann Gütl from IST Austria for
assistance with collecting cryo-EM data. We thank Prof. Masahiro Ito (Graduate School
of Life Sciences, Toyo University, Japan) for a kind provision of plasmid DNA encoding
Mrp from A. flavithermus WK1. JS is a recipient of a DOC Fellowship of the Austrian
Academy of Sciences at the Institute of Science and Technology, Austria.
article_number: e59407
article_processing_charge: No
article_type: original
author:
- first_name: Julia
full_name: Steiner, Julia
id: 3BB67EB0-F248-11E8-B48F-1D18A9856A87
last_name: Steiner
orcid: 0000-0003-0493-3775
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Steiner J, Sazanov LA. Structure and mechanism of the Mrp complex, an ancient
cation/proton antiporter. eLife. 2020;9. doi:10.7554/eLife.59407
apa: Steiner, J., & Sazanov, L. A. (2020). Structure and mechanism of the Mrp
complex, an ancient cation/proton antiporter. ELife. eLife Sciences Publications.
https://doi.org/10.7554/eLife.59407
chicago: Steiner, Julia, and Leonid A Sazanov. “Structure and Mechanism of the Mrp
Complex, an Ancient Cation/Proton Antiporter.” ELife. eLife Sciences Publications,
2020. https://doi.org/10.7554/eLife.59407.
ieee: J. Steiner and L. A. Sazanov, “Structure and mechanism of the Mrp complex,
an ancient cation/proton antiporter,” eLife, vol. 9. eLife Sciences Publications,
2020.
ista: Steiner J, Sazanov LA. 2020. Structure and mechanism of the Mrp complex, an
ancient cation/proton antiporter. eLife. 9, e59407.
mla: Steiner, Julia, and Leonid A. Sazanov. “Structure and Mechanism of the Mrp
Complex, an Ancient Cation/Proton Antiporter.” ELife, vol. 9, e59407, eLife
Sciences Publications, 2020, doi:10.7554/eLife.59407.
short: J. Steiner, L.A. Sazanov, ELife 9 (2020).
date_created: 2020-08-24T06:24:04Z
date_published: 2020-07-31T00:00:00Z
date_updated: 2026-04-08T07:23:36Z
day: '31'
ddc:
- '570'
department:
- _id: LeSa
doi: 10.7554/eLife.59407
external_id:
isi:
- '000562123600001'
pmid:
- '32735215'
file:
- access_level: open_access
checksum: b3656d14d5ddbb9d26e3074eea2d0c15
content_type: application/pdf
creator: cziletti
date_created: 2020-08-24T13:31:53Z
date_updated: 2020-08-24T13:31:53Z
file_id: '8289'
file_name: 2020_eLife_Steiner.pdf
file_size: 7320493
relation: main_file
success: 1
file_date_updated: 2020-08-24T13:31:53Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 26169496-B435-11E9-9278-68D0E5697425
grant_number: '24741'
name: Revealing the functional mechanism of Mrp antiporter, an ancestor of complex
I
publication: eLife
publication_identifier:
eissn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/mystery-of-giant-proton-pump-solved/
record:
- id: '8353'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Structure and mechanism of the Mrp complex, an ancient cation/proton antiporter
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 9
year: '2020'
...
---
OA_place: publisher
_id: '7460'
abstract:
- lang: eng
text: "Many methods for the reconstruction of shapes from sets of points produce
ordered simplicial complexes, which are collections of vertices, edges, triangles,
and their higher-dimensional analogues, called simplices, in which every simplex
gets assigned a real value measuring its size. This thesis studies ordered simplicial
complexes, with a focus on their topology, which reflects the connectedness of
the represented shapes and the presence of holes. We are interested both in understanding
better the structure of these complexes, as well as in developing algorithms for
applications.\r\n\r\nFor the Delaunay triangulation, the most popular measure
for a simplex is the radius of the smallest empty circumsphere. Based on it, we
revisit Alpha and Wrap complexes and experimentally determine their probabilistic
properties for random data. Also, we prove the existence of tri-partitions, propose
algorithms to open and close holes, and extend the concepts from Euclidean to
Bregman geometries."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Katharina
full_name: Ölsböck, Katharina
id: 4D4AA390-F248-11E8-B48F-1D18A9856A87
last_name: Ölsböck
orcid: 0000-0002-4672-8297
citation:
ama: Ölsböck K. The hole system of triangulated shapes. 2020. doi:10.15479/AT:ISTA:7460
apa: Ölsböck, K. (2020). The hole system of triangulated shapes. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7460
chicago: Ölsböck, Katharina. “The Hole System of Triangulated Shapes.” Institute
of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7460.
ieee: K. Ölsböck, “The hole system of triangulated shapes,” Institute of Science
and Technology Austria, 2020.
ista: Ölsböck K. 2020. The hole system of triangulated shapes. Institute of Science
and Technology Austria.
mla: Ölsböck, Katharina. The Hole System of Triangulated Shapes. Institute
of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7460.
short: K. Ölsböck, The Hole System of Triangulated Shapes, Institute of Science
and Technology Austria, 2020.
corr_author: '1'
date_created: 2020-02-06T14:56:53Z
date_published: 2020-02-10T00:00:00Z
date_updated: 2026-04-08T07:23:21Z
day: '10'
ddc:
- '514'
degree_awarded: PhD
department:
- _id: HeEd
- _id: GradSch
doi: 10.15479/AT:ISTA:7460
file:
- access_level: open_access
checksum: 1df9f8c530b443c0e63a3f2e4fde412e
content_type: application/pdf
creator: koelsboe
date_created: 2020-02-06T14:43:54Z
date_updated: 2020-07-14T12:47:58Z
file_id: '7461'
file_name: thesis_ist-final_noack.pdf
file_size: 76195184
relation: main_file
- access_level: closed
checksum: 7a52383c812b0be64d3826546509e5a4
content_type: application/x-zip-compressed
creator: koelsboe
date_created: 2020-02-06T14:52:45Z
date_updated: 2020-07-14T12:47:58Z
description: latex source files, figures
file_id: '7462'
file_name: latex-files.zip
file_size: 122103715
relation: source_file
file_date_updated: 2020-07-14T12:47:58Z
has_accepted_license: '1'
keyword:
- shape reconstruction
- hole manipulation
- ordered complexes
- Alpha complex
- Wrap complex
- computational topology
- Bregman geometry
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '02'
oa: 1
oa_version: Published Version
page: '155'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6608'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
title: The hole system of triangulated shapes
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
_id: '8195'
abstract:
- lang: eng
text: This paper presents a foundation for refining concurrent programs with structured
control flow. The verification problem is decomposed into subproblems that aid
interactive program development, proof reuse, and automation. The formalization
in this paper is the basis of a new design and implementation of the Civl verifier.
acknowledgement: "Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe
Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award)."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Kragl B, Qadeer S, Henzinger TA. Refinement for structured concurrent programs.
In: Computer Aided Verification. Vol 12224. Springer Nature; 2020:275-298.
doi:10.1007/978-3-030-53288-8_14'
apa: Kragl, B., Qadeer, S., & Henzinger, T. A. (2020). Refinement for structured
concurrent programs. In Computer Aided Verification (Vol. 12224, pp. 275–298).
Springer Nature. https://doi.org/10.1007/978-3-030-53288-8_14
chicago: Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured
Concurrent Programs.” In Computer Aided Verification, 12224:275–98. Springer
Nature, 2020. https://doi.org/10.1007/978-3-030-53288-8_14.
ieee: B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent
programs,” in Computer Aided Verification, 2020, vol. 12224, pp. 275–298.
ista: Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent
programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298.
mla: Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.” Computer
Aided Verification, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:10.1007/978-3-030-53288-8_14.
short: B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer
Nature, 2020, pp. 275–298.
corr_author: '1'
date_created: 2020-08-03T11:45:35Z
date_published: 2020-07-14T00:00:00Z
date_updated: 2026-04-08T07:23:52Z
day: '14'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-53288-8_14
external_id:
isi:
- '000695276000014'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2020-08-06T08:14:54Z
date_updated: 2020-08-06T08:14:54Z
file_id: '8201'
file_name: 2020_LNCS_Kragl.pdf
file_size: 804237
relation: main_file
success: 1
file_date_updated: 2020-08-06T08:14:54Z
has_accepted_license: '1'
intvolume: ' 12224'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 275-298
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Computer Aided Verification
publication_identifier:
eisbn:
- '9783030532888'
eissn:
- 1611-3349
isbn:
- '9783030532871'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '8332'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Refinement for structured concurrent programs
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 12224
year: '2020'
...