---
_id: '8329'
abstract:
- lang: eng
text: We show the synthesis of a redox‐active quinone, 2‐methoxy‐1,4‐hydroquinone
(MHQ), from a bio‐based feedstock and its suitability as electrolyte in aqueous
redox flow batteries. We identified semiquinone intermediates at insufficiently
low pH and quinoid radicals as responsible for decomposition of MHQ under electrochemical
conditions. Both can be avoided and/or stabilized, respectively, using H 3 PO
4 electrolyte, allowing for reversible cycling in a redox flow battery for hundreds
of cycles.
acknowledgement: The Austrian Research Promotion Agency (FFG) is gratefully acknowledged
for financial support of the project LignoBatt (860429).
article_processing_charge: No
article_type: original
author:
- first_name: Werner
full_name: Schlemmer, Werner
last_name: Schlemmer
- first_name: Philipp
full_name: Nothdurft, Philipp
last_name: Nothdurft
- first_name: Alina
full_name: Petzold, Alina
last_name: Petzold
- first_name: Philipp
full_name: Frühwirt, Philipp
last_name: Frühwirt
- first_name: Max
full_name: Schmallegger, Max
last_name: Schmallegger
- first_name: Georg
full_name: Gescheidt-Demner, Georg
last_name: Gescheidt-Demner
- first_name: Roland
full_name: Fischer, Roland
last_name: Fischer
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: Wolfgang
full_name: Kern, Wolfgang
last_name: Kern
- first_name: Stefan
full_name: Spirk, Stefan
last_name: Spirk
citation:
ama: Schlemmer W, Nothdurft P, Petzold A, et al. 2‐methoxyhydroquinone from vanillin
for aqueous redox‐flow batteries. Angewandte Chemie International Edition.
2020;59(51):22943-22946. doi:10.1002/anie.202008253
apa: Schlemmer, W., Nothdurft, P., Petzold, A., Frühwirt, P., Schmallegger, M.,
Gescheidt-Demner, G., … Spirk, S. (2020). 2‐methoxyhydroquinone from vanillin
for aqueous redox‐flow batteries. Angewandte Chemie International Edition.
Wiley. https://doi.org/10.1002/anie.202008253
chicago: Schlemmer, Werner, Philipp Nothdurft, Alina Petzold, Philipp Frühwirt,
Max Schmallegger, Georg Gescheidt-Demner, Roland Fischer, Stefan Alexander Freunberger,
Wolfgang Kern, and Stefan Spirk. “2‐methoxyhydroquinone from Vanillin for Aqueous
Redox‐flow Batteries.” Angewandte Chemie International Edition. Wiley,
2020. https://doi.org/10.1002/anie.202008253.
ieee: W. Schlemmer et al., “2‐methoxyhydroquinone from vanillin for aqueous
redox‐flow batteries,” Angewandte Chemie International Edition, vol. 59,
no. 51. Wiley, pp. 22943–22946, 2020.
ista: Schlemmer W, Nothdurft P, Petzold A, Frühwirt P, Schmallegger M, Gescheidt-Demner
G, Fischer R, Freunberger SA, Kern W, Spirk S. 2020. 2‐methoxyhydroquinone from
vanillin for aqueous redox‐flow batteries. Angewandte Chemie International Edition.
59(51), 22943–22946.
mla: Schlemmer, Werner, et al. “2‐methoxyhydroquinone from Vanillin for Aqueous
Redox‐flow Batteries.” Angewandte Chemie International Edition, vol. 59,
no. 51, Wiley, 2020, pp. 22943–46, doi:10.1002/anie.202008253.
short: W. Schlemmer, P. Nothdurft, A. Petzold, P. Frühwirt, M. Schmallegger, G.
Gescheidt-Demner, R. Fischer, S.A. Freunberger, W. Kern, S. Spirk, Angewandte
Chemie International Edition 59 (2020) 22943–22946.
date_created: 2020-09-03T16:10:56Z
date_published: 2020-12-14T00:00:00Z
date_updated: 2023-09-05T16:03:47Z
day: '14'
department:
- _id: StFr
doi: 10.1002/anie.202008253
external_id:
isi:
- '000576148700001'
intvolume: ' 59'
isi: 1
issue: '51'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/anie.202008253
month: '12'
oa: 1
oa_version: Published Version
page: 22943-22946
publication: Angewandte Chemie International Edition
publication_identifier:
eissn:
- 1521-3773
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '9780'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 2‐methoxyhydroquinone from vanillin for aqueous redox‐flow batteries
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 59
year: '2020'
...
---
_id: '8361'
abstract:
- lang: eng
text: With the lithium-ion technology approaching its intrinsic limit with graphite-based
anodes, Li metal is recently receiving renewed interest from the battery community
as potential high capacity anode for next-generation rechargeable batteries. In
this focus paper, we review the main advances in this field since the first attempts
in the mid-1970s. Strategies for enabling reversible cycling and avoiding dendrite
growth are thoroughly discussed, including specific applications in all-solid-state
(inorganic and polymeric), Lithium–Sulfur (Li–S) and Lithium-O2 (air) batteries.
A particular attention is paid to recent developments of these battery technologies
and their current state with respect to the 2030 targets of the EU Integrated
Strategic Energy Technology Plan (SET-Plan) Action 7.
acknowledgement: A.V. and K.T. acknowledge, respectively, the financial support of
the Helmholtz Association and BMW AG. J.H. acknowledges the collabo-ration project
“Accordo di Collaborazione Quadro 2015” between Uni-versity of Ferrara (Department
of Chemical and Pharmaceutical Sciences) and Sapienza University of Rome (Department
of Chemistry). S.D., H.A. and S.K. thank the Fraunhofer Gesellschaft, Technische
Uni-versit ̈at Dresden and would like to acknowledge European Union’s Horizon
2020 research and innovation programme under grant agree-ment No 814471. S.A.F.
and C.P. are indebted to the European Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation program (grant agreement no. 636069)
and IST Austria.
article_number: '228803'
article_processing_charge: No
article_type: original
author:
- first_name: Alberto
full_name: Varzi, Alberto
last_name: Varzi
orcid: 0000-0001-5069-0589
- first_name: Katharina
full_name: Thanner, Katharina
last_name: Thanner
orcid: 0000-0001-5394-2323
- first_name: Roberto
full_name: Scipioni, Roberto
last_name: Scipioni
orcid: 0000-0003-1926-421X
- first_name: Daniele
full_name: Di Lecce, Daniele
last_name: Di Lecce
- first_name: Jusef
full_name: Hassoun, Jusef
last_name: Hassoun
- first_name: Susanne
full_name: Dörfler, Susanne
last_name: Dörfler
- first_name: Holger
full_name: Altheus, Holger
last_name: Altheus
- first_name: Stefan
full_name: Kaskel, Stefan
last_name: Kaskel
- first_name: Christian
full_name: Prehal, Christian
last_name: Prehal
orcid: 0000-0003-0654-0940
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: Varzi A, Thanner K, Scipioni R, et al. Current status and future perspectives
of lithium metal batteries. Journal of Power Sources. 2020;480(12). doi:10.1016/j.jpowsour.2020.228803
apa: Varzi, A., Thanner, K., Scipioni, R., Di Lecce, D., Hassoun, J., Dörfler, S.,
… Freunberger, S. A. (2020). Current status and future perspectives of lithium
metal batteries. Journal of Power Sources. Elsevier. https://doi.org/10.1016/j.jpowsour.2020.228803
chicago: Varzi, Alberto, Katharina Thanner, Roberto Scipioni, Daniele Di Lecce,
Jusef Hassoun, Susanne Dörfler, Holger Altheus, Stefan Kaskel, Christian Prehal,
and Stefan Alexander Freunberger. “Current Status and Future Perspectives of Lithium
Metal Batteries.” Journal of Power Sources. Elsevier, 2020. https://doi.org/10.1016/j.jpowsour.2020.228803.
ieee: A. Varzi et al., “Current status and future perspectives of lithium
metal batteries,” Journal of Power Sources, vol. 480, no. 12. Elsevier,
2020.
ista: Varzi A, Thanner K, Scipioni R, Di Lecce D, Hassoun J, Dörfler S, Altheus
H, Kaskel S, Prehal C, Freunberger SA. 2020. Current status and future perspectives
of lithium metal batteries. Journal of Power Sources. 480(12), 228803.
mla: Varzi, Alberto, et al. “Current Status and Future Perspectives of Lithium Metal
Batteries.” Journal of Power Sources, vol. 480, no. 12, 228803, Elsevier,
2020, doi:10.1016/j.jpowsour.2020.228803.
short: A. Varzi, K. Thanner, R. Scipioni, D. Di Lecce, J. Hassoun, S. Dörfler, H.
Altheus, S. Kaskel, C. Prehal, S.A. Freunberger, Journal of Power Sources 480
(2020).
date_created: 2020-09-10T10:48:40Z
date_published: 2020-12-31T00:00:00Z
date_updated: 2024-10-21T06:02:28Z
day: '31'
department:
- _id: StFr
doi: 10.1016/j.jpowsour.2020.228803
external_id:
isi:
- '000593857300001'
intvolume: ' 480'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.jpowsour.2020.228803
month: '12'
oa: 1
oa_version: Published Version
publication: Journal of Power Sources
publication_identifier:
issn:
- 0378-7753
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '8067'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Current status and future perspectives of lithium metal batteries
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 480
year: '2020'
...
---
_id: '8382'
abstract:
- lang: eng
text: We present the first deterministic wait-free long-lived snapshot algorithm,
using only read and write operations, that guarantees polylogarithmic amortized
step complexity in all executions. This is the first non-blocking snapshot algorithm,
using reads and writes only, that has sub-linear amortized step complexity in
executions of arbitrary length. The key to our construction is a novel implementation
of a 2-component max array object which may be of independent interest.
article_processing_charge: No
author:
- first_name: Mirza Ahad
full_name: Baig, Mirza Ahad
id: 3EDE6DE4-AA5A-11E9-986D-341CE6697425
last_name: Baig
- first_name: Danny
full_name: Hendler, Danny
last_name: Hendler
- first_name: Alessia
full_name: Milani, Alessia
last_name: Milani
- first_name: Corentin
full_name: Travers, Corentin
last_name: Travers
citation:
ama: 'Baig MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic
amortized step complexity. In: Proceedings of the 39th Symposium on Principles
of Distributed Computing. Association for Computing Machinery; 2020:31-40.
doi:10.1145/3382734.3406005'
apa: 'Baig, M. A., Hendler, D., Milani, A., & Travers, C. (2020). Long-lived
snapshots with polylogarithmic amortized step complexity. In Proceedings of
the 39th Symposium on Principles of Distributed Computing (pp. 31–40). Virtual,
Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3406005'
chicago: Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers.
“Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” In Proceedings
of the 39th Symposium on Principles of Distributed Computing, 31–40. Association
for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3406005.
ieee: M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived snapshots with
polylogarithmic amortized step complexity,” in Proceedings of the 39th Symposium
on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 31–40.
ista: 'Baig MA, Hendler D, Milani A, Travers C. 2020. Long-lived snapshots with
polylogarithmic amortized step complexity. Proceedings of the 39th Symposium on
Principles of Distributed Computing. PODC: Principles of Distributed Computing,
31–40.'
mla: Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized
Step Complexity.” Proceedings of the 39th Symposium on Principles of Distributed
Computing, Association for Computing Machinery, 2020, pp. 31–40, doi:10.1145/3382734.3406005.
short: M.A. Baig, D. Hendler, A. Milani, C. Travers, in:, Proceedings of the 39th
Symposium on Principles of Distributed Computing, Association for Computing Machinery,
2020, pp. 31–40.
conference:
end_date: 2020-08-07
location: Virtual, Italy
name: 'PODC: Principles of Distributed Computing'
start_date: 2020-08-03
date_created: 2020-09-13T22:01:17Z
date_published: 2020-07-31T00:00:00Z
date_updated: 2025-09-10T10:25:23Z
day: '31'
doi: 10.1145/3382734.3406005
external_id:
isi:
- '001436693500004'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-02860087/document
month: '07'
oa: 1
oa_version: Preprint
page: 31-40
publication: Proceedings of the 39th Symposium on Principles of Distributed Computing
publication_identifier:
isbn:
- '9781450375825'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Long-lived snapshots with polylogarithmic amortized step complexity
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2020'
...
---
_id: '8383'
abstract:
- lang: eng
text: We introduce extension-based proofs, a class of impossibility proofs that
includes valency arguments. They are modelled as an interaction between a prover
and a protocol. Using proofs based on combinatorial topology, it has been shown
that it is impossible to deterministically solve k-set agreement among n > k ≥
2 processes in a wait-free manner. However, it was unknown whether proofs based
on simpler techniques were possible. We explain why this impossibility result
cannot be obtained by an extension-based proof and, hence, extension-based proofs
are limited in power.
article_processing_charge: No
author:
- 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: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Faith
full_name: Ellen, Faith
last_name: Ellen
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
- first_name: Leqi
full_name: Zhu, Leqi
last_name: Zhu
citation:
ama: 'Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Brief Announcement:
Why Extension-Based Proofs Fail. In: Proceedings of the 39th Symposium on Principles
of Distributed Computing. Association for Computing Machinery; 2020:54-56.
doi:10.1145/3382734.3405743'
apa: 'Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., & Zhu, L. (2020).
Brief Announcement: Why Extension-Based Proofs Fail. In Proceedings of the
39th Symposium on Principles of Distributed Computing (pp. 54–56). Virtual,
Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405743'
chicago: 'Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and
Leqi Zhu. “Brief Announcement: Why Extension-Based Proofs Fail.” In Proceedings
of the 39th Symposium on Principles of Distributed Computing, 54–56. Association
for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405743.'
ieee: 'D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement:
Why Extension-Based Proofs Fail,” in Proceedings of the 39th Symposium on Principles
of Distributed Computing, Virtual, Italy, 2020, pp. 54–56.'
ista: 'Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. 2020. Brief Announcement:
Why Extension-Based Proofs Fail. Proceedings of the 39th Symposium on Principles
of Distributed Computing. PODC: Principles of Distributed Computing, 54–56.'
mla: 'Alistarh, Dan-Adrian, et al. “Brief Announcement: Why Extension-Based Proofs
Fail.” Proceedings of the 39th Symposium on Principles of Distributed Computing,
Association for Computing Machinery, 2020, pp. 54–56, doi:10.1145/3382734.3405743.'
short: D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings
of the 39th Symposium on Principles of Distributed Computing, Association for
Computing Machinery, 2020, pp. 54–56.
conference:
end_date: 2020-08-07
location: Virtual, Italy
name: 'PODC: Principles of Distributed Computing'
start_date: 2020-08-03
date_created: 2020-09-13T22:01:18Z
date_published: 2020-07-31T00:00:00Z
date_updated: 2025-09-10T10:26:32Z
day: '31'
department:
- _id: DaAl
doi: 10.1145/3382734.3405743
external_id:
isi:
- '001436693500007'
isi: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 54-56
publication: Proceedings of the 39th Symposium on Principles of Distributed Computing
publication_identifier:
isbn:
- '9781450375825'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Brief Announcement: Why Extension-Based Proofs Fail'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2020'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '8402'
abstract:
- lang: eng
text: "Background: The mitochondrial pyruvate carrier (MPC) plays a central role
in energy metabolism by transporting pyruvate across the inner mitochondrial membrane.
Its heterodimeric composition and homology to SWEET and semiSWEET transporters
set the MPC apart from the canonical mitochondrial carrier family (named MCF or
SLC25). The import of the canonical carriers is mediated by the carrier translocase
of the inner membrane (TIM22) pathway and is dependent on their structure, which
features an even number of transmembrane segments and both termini in the intermembrane
space. The import pathway of MPC proteins has not been elucidated. The odd number
of transmembrane segments and positioning of the N-terminus in the matrix argues
against an import via the TIM22 carrier pathway but favors an import via the flexible
presequence pathway.\r\nResults: Here, we systematically analyzed the import pathways
of Mpc2 and Mpc3 and report that, contrary to an expected import via the flexible
presequence pathway, yeast MPC proteins with an odd number of transmembrane segments
and matrix-exposed N-terminus are imported by the carrier pathway, using the receptor
Tom70, small TIM chaperones, and the TIM22 complex. The TIM9·10 complex chaperones
MPC proteins through the mitochondrial intermembrane space using conserved hydrophobic
motifs that are also required for the interaction with canonical carrier proteins.\r\nConclusions:
The carrier pathway can import paired and non-paired transmembrane helices and
translocate N-termini to either side of the mitochondrial inner membrane, revealing
an unexpected versatility of the mitochondrial import pathway for non-cleavable
inner membrane proteins."
article_number: '2'
article_processing_charge: No
article_type: original
author:
- first_name: Heike
full_name: Rampelt, Heike
last_name: Rampelt
- first_name: Iva
full_name: Sucec, Iva
last_name: Sucec
- first_name: Beate
full_name: Bersch, Beate
last_name: Bersch
- first_name: Patrick
full_name: Horten, Patrick
last_name: Horten
- first_name: Inge
full_name: Perschil, Inge
last_name: Perschil
- first_name: Jean-Claude
full_name: Martinou, Jean-Claude
last_name: Martinou
- first_name: Martin
full_name: van der Laan, Martin
last_name: van der Laan
- first_name: Nils
full_name: Wiedemann, Nils
last_name: Wiedemann
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
- first_name: Nikolaus
full_name: Pfanner, Nikolaus
last_name: Pfanner
citation:
ama: Rampelt H, Sucec I, Bersch B, et al. The mitochondrial carrier pathway transports
non-canonical substrates with an odd number of transmembrane segments. BMC
Biology. 2020;18. doi:10.1186/s12915-019-0733-6
apa: Rampelt, H., Sucec, I., Bersch, B., Horten, P., Perschil, I., Martinou, J.-C.,
… Pfanner, N. (2020). The mitochondrial carrier pathway transports non-canonical
substrates with an odd number of transmembrane segments. BMC Biology. Springer
Nature. https://doi.org/10.1186/s12915-019-0733-6
chicago: Rampelt, Heike, Iva Sucec, Beate Bersch, Patrick Horten, Inge Perschil,
Jean-Claude Martinou, Martin van der Laan, Nils Wiedemann, Paul Schanda, and Nikolaus
Pfanner. “The Mitochondrial Carrier Pathway Transports Non-Canonical Substrates
with an Odd Number of Transmembrane Segments.” BMC Biology. Springer Nature,
2020. https://doi.org/10.1186/s12915-019-0733-6.
ieee: H. Rampelt et al., “The mitochondrial carrier pathway transports non-canonical
substrates with an odd number of transmembrane segments,” BMC Biology,
vol. 18. Springer Nature, 2020.
ista: Rampelt H, Sucec I, Bersch B, Horten P, Perschil I, Martinou J-C, van der
Laan M, Wiedemann N, Schanda P, Pfanner N. 2020. The mitochondrial carrier pathway
transports non-canonical substrates with an odd number of transmembrane segments.
BMC Biology. 18, 2.
mla: Rampelt, Heike, et al. “The Mitochondrial Carrier Pathway Transports Non-Canonical
Substrates with an Odd Number of Transmembrane Segments.” BMC Biology,
vol. 18, 2, Springer Nature, 2020, doi:10.1186/s12915-019-0733-6.
short: H. Rampelt, I. Sucec, B. Bersch, P. Horten, I. Perschil, J.-C. Martinou,
M. van der Laan, N. Wiedemann, P. Schanda, N. Pfanner, BMC Biology 18 (2020).
date_created: 2020-09-17T10:26:53Z
date_published: 2020-01-06T00:00:00Z
date_updated: 2024-10-15T13:23:11Z
day: '06'
doi: 10.1186/s12915-019-0733-6
extern: '1'
external_id:
pmid:
- '31907035'
intvolume: ' 18'
keyword:
- Biotechnology
- Plant Science
- General Biochemistry
- Genetics and Molecular Biology
- Developmental Biology
- Cell Biology
- Physiology
- Ecology
- Evolution
- Behavior and Systematics
- Structural Biology
- General Agricultural and Biological Sciences
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1186/s12915-019-0733-6
month: '01'
oa: 1
oa_version: Published Version
pmid: 1
publication: BMC Biology
publication_identifier:
issn:
- 1741-7007
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: The mitochondrial carrier pathway transports non-canonical substrates with
an odd number of transmembrane segments
type: journal_article
user_id: 0043cee0-e5fc-11ee-9736-f83bc23afbf0
volume: 18
year: '2020'
...
---
_id: '8403'
abstract:
- lang: eng
text: Chaperones are essential for assisting protein folding, and for transferring
poorly soluble proteins to their functional locations within cells. Hydrophobic
interactions drive promiscuous chaperone–client binding, but our understanding
of how additional interactions enable client specificity is sparse. Here we decipher
what determines binding of two chaperones (TIM8·13, TIM9·10) to different integral
membrane proteins, the all-transmembrane mitochondrial carrier Ggc1, and Tim23
which has an additional disordered hydrophilic domain. Combining NMR, SAXS and
molecular dynamics simulations, we determine the structures of Tim23/TIM8·13 and
Tim23/TIM9·10 complexes. TIM8·13 uses transient salt bridges to interact with
the hydrophilic part of its client, but its interactions to the transmembrane
part are weaker than in TIM9·10. Consequently, TIM9·10 outcompetes TIM8·13 in
binding hydrophobic clients, while TIM8·13 is tuned to few clients with both hydrophilic
and hydrophobic parts. Our study exemplifies how chaperones fine-tune the balance
of promiscuity vs. specificity.
article_processing_charge: No
author:
- first_name: Iva
full_name: Sučec, Iva
last_name: Sučec
- first_name: Yong
full_name: Wang, Yong
last_name: Wang
- first_name: Ons
full_name: Dakhlaoui, Ons
last_name: Dakhlaoui
- first_name: Katharina
full_name: Weinhäupl, Katharina
last_name: Weinhäupl
- first_name: Tobias
full_name: Jores, Tobias
last_name: Jores
- first_name: Doriane
full_name: Costa, Doriane
last_name: Costa
- first_name: Audrey
full_name: Hessel, Audrey
last_name: Hessel
- first_name: Martha
full_name: Brennich, Martha
last_name: Brennich
- first_name: Doron
full_name: Rapaport, Doron
last_name: Rapaport
- first_name: Kresten
full_name: Lindorff-Larsen, Kresten
last_name: Lindorff-Larsen
- first_name: Beate
full_name: Bersch, Beate
last_name: Bersch
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
citation:
ama: Sučec I, Wang Y, Dakhlaoui O, et al. Structural basis of client specificity
in mitochondrial membrane-protein chaperones. bioRxiv. doi:10.1101/2020.06.08.140772
apa: Sučec, I., Wang, Y., Dakhlaoui, O., Weinhäupl, K., Jores, T., Costa, D., …
Schanda, P. (n.d.). Structural basis of client specificity in mitochondrial membrane-protein
chaperones. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.06.08.140772
chicago: Sučec, Iva, Yong Wang, Ons Dakhlaoui, Katharina Weinhäupl, Tobias Jores,
Doriane Costa, Audrey Hessel, et al. “Structural Basis of Client Specificity in
Mitochondrial Membrane-Protein Chaperones.” BioRxiv. Cold Spring Harbor
Laboratory, n.d. https://doi.org/10.1101/2020.06.08.140772.
ieee: I. Sučec et al., “Structural basis of client specificity in mitochondrial
membrane-protein chaperones,” bioRxiv. Cold Spring Harbor Laboratory.
ista: Sučec I, Wang Y, Dakhlaoui O, Weinhäupl K, Jores T, Costa D, Hessel A, Brennich
M, Rapaport D, Lindorff-Larsen K, Bersch B, Schanda P. Structural basis of client
specificity in mitochondrial membrane-protein chaperones. bioRxiv, 10.1101/2020.06.08.140772.
mla: Sučec, Iva, et al. “Structural Basis of Client Specificity in Mitochondrial
Membrane-Protein Chaperones.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.06.08.140772.
short: I. Sučec, Y. Wang, O. Dakhlaoui, K. Weinhäupl, T. Jores, D. Costa, A. Hessel,
M. Brennich, D. Rapaport, K. Lindorff-Larsen, B. Bersch, P. Schanda, BioRxiv (n.d.).
date_created: 2020-09-17T10:27:47Z
date_published: 2020-09-17T00:00:00Z
date_updated: 2021-01-12T08:19:02Z
day: '17'
doi: 10.1101/2020.06.08.140772
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2020.06.08.140772
month: '09'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: Structural basis of client specificity in mitochondrial membrane-protein chaperones
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8404'
abstract:
- lang: eng
text: The mitochondrial Tim chaperones are responsible for the transport
of membrane proteins across the inter-membrane space to the inner and outer mitochondrial
membranes. TIM9·10, a hexameric 70 kDa protein complex formed by 3 copies of Tim9
and Tim10, guides its clients across the aqueous compartment. The TIM9·10·12 complex
is the anchor point at the inner-membrane insertase complex TIM22. The mechanism
of client transport by TIM9·10 has been resolved recently, but the structure and
subunit composition of the TIM9·10·12 complex remains largely unresolved. Furthermore,
the assembly process of the hexameric TIM chaperones from its subunits remained
elusive. We investigate the structural and dynamical properties of the Tim subunits,
and show that they are highly dynamic. In their non-assembled form, the subunits
behave as intrinsically disordered proteins; when the conserved cysteines of the
CX3C-Xn-CX3C
motifs are formed, short marginally stable α-helices
are formed, which are only fully stabilized upon hexamer formation to the mature
chaperone. Subunits are in equilibrium between their hexamer-embedded and a free
form, with exchange kinetics on a minutes time scale. Joint NMR, small-angle X-ray
scattering and MD simulation data allow us to derive a structural model of the
TIM9·10·12 assembly, which has a 2:3:1 stoichiometry (Tim9:Tim10:Tim12) with a
conserved hydrophobic client-binding groove and flexible N- and C-terminal tentacles.
article_processing_charge: No
author:
- first_name: Katharina
full_name: Weinhäupl, Katharina
last_name: Weinhäupl
- first_name: Yong
full_name: Wang, Yong
last_name: Wang
- first_name: Audrey
full_name: Hessel, Audrey
last_name: Hessel
- first_name: Martha
full_name: Brennich, Martha
last_name: Brennich
- first_name: Kresten
full_name: Lindorff-Larsen, Kresten
last_name: Lindorff-Larsen
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
citation:
ama: Weinhäupl K, Wang Y, Hessel A, Brennich M, Lindorff-Larsen K, Schanda P. Architecture
and subunit dynamics of the mitochondrial TIM9·10·12 chaperone. bioRxiv.
doi:10.1101/2020.03.13.990150
apa: Weinhäupl, K., Wang, Y., Hessel, A., Brennich, M., Lindorff-Larsen, K., &
Schanda, P. (n.d.). Architecture and subunit dynamics of the mitochondrial TIM9·10·12
chaperone. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.03.13.990150
chicago: Weinhäupl, Katharina, Yong Wang, Audrey Hessel, Martha Brennich, Kresten
Lindorff-Larsen, and Paul Schanda. “Architecture and Subunit Dynamics of the Mitochondrial
TIM9·10·12 Chaperone.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2020.03.13.990150.
ieee: K. Weinhäupl, Y. Wang, A. Hessel, M. Brennich, K. Lindorff-Larsen, and P.
Schanda, “Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone,”
bioRxiv. Cold Spring Harbor Laboratory.
ista: Weinhäupl K, Wang Y, Hessel A, Brennich M, Lindorff-Larsen K, Schanda P. Architecture
and subunit dynamics of the mitochondrial TIM9·10·12 chaperone. bioRxiv, 10.1101/2020.03.13.990150.
mla: Weinhäupl, Katharina, et al. “Architecture and Subunit Dynamics of the Mitochondrial
TIM9·10·12 Chaperone.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.03.13.990150.
short: K. Weinhäupl, Y. Wang, A. Hessel, M. Brennich, K. Lindorff-Larsen, P. Schanda,
BioRxiv (n.d.).
date_created: 2020-09-17T10:27:59Z
date_published: 2020-03-14T00:00:00Z
date_updated: 2021-01-12T08:19:03Z
day: '14'
doi: 10.1101/2020.03.13.990150
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2020.03.13.990150
month: '03'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8414'
abstract:
- lang: eng
text: "Arnold diffusion, which concerns the appearance of chaos in classical mechanics,
is one of the most important problems in the fields of dynamical systems and mathematical
physics. Since it was discovered by Vladimir Arnold in 1963, it has attracted
the efforts of some of the most prominent researchers in mathematics. The question
is whether a typical perturbation of a particular system will result in chaotic
or unstable dynamical phenomena. In this groundbreaking book, Vadim Kaloshin and
Ke Zhang provide the first complete proof of Arnold diffusion, demonstrating that
that there is topological instability for typical perturbations of five-dimensional
integrable systems (two and a half degrees of freedom).\r\nThis proof realizes
a plan John Mather announced in 2003 but was unable to complete before his death.
Kaloshin and Zhang follow Mather’s strategy but emphasize a more Hamiltonian approach,
tying together normal forms theory, hyperbolic theory, Mather theory, and weak
KAM theory. Offering a complete, clean, and modern explanation of the steps involved
in the proof, and a clear account of background material, this book is designed
to be accessible to students as well as researchers. The result is a critical
contribution to mathematical physics and dynamical systems, especially Hamiltonian
systems."
alternative_title:
- Annals of Mathematics Studies
article_processing_charge: No
author:
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
- first_name: Ke
full_name: Zhang, Ke
last_name: Zhang
citation:
ama: Kaloshin V, Zhang K. Arnold Diffusion for Smooth Systems of Two and a Half
Degrees of Freedom. Vol 208. 1st ed. Princeton University Press; 2020. doi:10.1515/9780691204932
apa: Kaloshin, V., & Zhang, K. (2020). Arnold Diffusion for Smooth Systems
of Two and a Half Degrees of Freedom (1st ed., Vol. 208). Princeton University
Press. https://doi.org/10.1515/9780691204932
chicago: Kaloshin, Vadim, and Ke Zhang. Arnold Diffusion for Smooth Systems of
Two and a Half Degrees of Freedom. 1st ed. Vol. 208. AMS. Princeton University
Press, 2020. https://doi.org/10.1515/9780691204932.
ieee: V. Kaloshin and K. Zhang, Arnold Diffusion for Smooth Systems of Two and
a Half Degrees of Freedom, 1st ed., vol. 208. Princeton University Press,
2020.
ista: Kaloshin V, Zhang K. 2020. Arnold Diffusion for Smooth Systems of Two and
a Half Degrees of Freedom 1st ed., Princeton University Press, 224p.
mla: Kaloshin, Vadim, and Ke Zhang. Arnold Diffusion for Smooth Systems of Two
and a Half Degrees of Freedom. 1st ed., vol. 208, Princeton University Press,
2020, doi:10.1515/9780691204932.
short: V. Kaloshin, K. Zhang, Arnold Diffusion for Smooth Systems of Two and a Half
Degrees of Freedom, 1st ed., Princeton University Press, 2020.
date_created: 2020-09-17T10:41:05Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2021-12-21T10:50:49Z
day: '01'
doi: 10.1515/9780691204932
edition: '1'
extern: '1'
intvolume: ' 208'
language:
- iso: eng
month: '03'
oa_version: None
page: '224'
publication_identifier:
isbn:
- 9-780-6912-0253-2
publication_status: published
publisher: Princeton University Press
quality_controlled: '1'
scopus_import: '1'
series_title: AMS
status: public
title: Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom
type: book
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 208
year: '2020'
...
---
_id: '8533'
abstract:
- lang: eng
text: Game of Life is a simple and elegant model to study dynamical system over
networks. The model consists of a graph where every vertex has one of two types,
namely, dead or alive. A configuration is a mapping of the vertices to the types.
An update rule describes how the type of a vertex is updated given the types of
its neighbors. In every round, all vertices are updated synchronously, which leads
to a configuration update. While in general, Game of Life allows a broad range
of update rules, we focus on two simple families of update rules, namely, underpopulation
and overpopulation, that model several interesting dynamics studied in the literature.
In both settings, a dead vertex requires at least a desired number of live neighbors
to become alive. For underpopulation (resp., overpopulation), a live vertex requires
at least (resp. at most) a desired number of live neighbors to remain alive. We
study the basic computation problems, e.g., configuration reachability, for these
two families of rules. For underpopulation rules, we show that these problems
can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete.
acknowledgement: "Krishnendu Chatterjee: The research was partially supported by the
Vienna Science and\r\nTechnology Fund (WWTF) Project ICT15-003.\r\nIsmaël Jecker:
This project has received funding from the European Union’s Horizon 2020 research\r\nand
innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411."
alternative_title:
- LIPIcs
article_number: 22:1-22:13
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life:
Algorithms and complexity. In: 45th International Symposium on Mathematical
Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.22'
apa: 'Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020).
Simplified game of life: Algorithms and complexity. In 45th International Symposium
on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech
Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.22'
chicago: 'Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub
Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International
Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.'
ieee: 'K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified
game of life: Algorithms and complexity,” in 45th International Symposium on
Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020,
vol. 170.'
ista: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game
of life: Algorithms and complexity. 45th International Symposium on Mathematical
Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science,
LIPIcs, vol. 170, 22:1-22:13.'
mla: 'Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.”
45th International Symposium on Mathematical Foundations of Computer Science,
vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020,
doi:10.4230/LIPIcs.MFCS.2020.22.'
short: K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International
Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-08-28
location: Prague, Czech Republic
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2020-08-24
date_created: 2020-09-20T22:01:36Z
date_published: 2020-08-18T00:00:00Z
date_updated: 2025-07-10T11:57:06Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2020.22
ec_funded: 1
external_id:
arxiv:
- '2007.02894'
file:
- access_level: open_access
checksum: bbd7c4f55d45f2ff2a0a4ef0e10a77b1
content_type: application/pdf
creator: dernst
date_created: 2020-09-21T13:57:34Z
date_updated: 2020-09-21T13:57:34Z
file_id: '8550'
file_name: 2020_LIPIcs_Chatterjee.pdf
file_size: 491374
relation: main_file
success: 1
file_date_updated: 2020-09-21T13:57:34Z
has_accepted_license: '1'
intvolume: ' 170'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 45th International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- '9783959771597'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Simplified game of life: Algorithms and complexity'
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: 170
year: '2020'
...
---
_id: '8534'
abstract:
- lang: eng
text: A regular language L of finite words is composite if there are regular languages
L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a
minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise,
L is prime. Primality of regular languages was introduced and studied in [O. Kupferman
and J. Mosheiff, 2015], where the complexity of deciding the primality of the
language of a given DFA was left open, with a doubly-exponential gap between the
upper and lower bounds. We study primality for unary regular languages, namely
regular languages with a singleton alphabet. A unary language corresponds to a
subset of ℕ, making the study of unary prime languages closer to that of primality
in number theory. We show that the setting of languages is richer. In particular,
while every composite number is the product of two smaller numbers, the number
t of languages necessary to decompose a composite unary language induces a strict
hierarchy. In addition, a primality witness for a unary language L, namely a word
that is not in L but is in all products of languages that contain L and have an
index smaller than L’s, may be of exponential length. Still, we are able to characterize
compositionality by structural properties of a DFA for L, leading to a LogSpace
algorithm for primality checking of unary DFAs.
acknowledgement: "Ismaël Jecker: This project has received funding from the European
Union’s Horizon\r\n2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No.\r\n754411. Nicolas Mazzocchi: PhD fellowship FRIA from the F.R.S.-FNRS."
alternative_title:
- LIPIcs
article_number: 51:1-51:12
article_processing_charge: No
author:
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
- first_name: Nicolas
full_name: Mazzocchi, Nicolas
last_name: Mazzocchi
citation:
ama: 'Jecker IR, Kupferman O, Mazzocchi N. Unary prime languages. In: 45th International
Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.51'
apa: 'Jecker, I. R., Kupferman, O., & Mazzocchi, N. (2020). Unary prime languages.
In 45th International Symposium on Mathematical Foundations of Computer Science
(Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.MFCS.2020.51'
chicago: Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.”
In 45th International Symposium on Mathematical Foundations of Computer Science,
Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.51.
ieee: I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in
45th International Symposium on Mathematical Foundations of Computer Science,
Prague, Czech Republic, 2020, vol. 170.
ista: 'Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International
Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical
Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.'
mla: Jecker, Ismael R., et al. “Unary Prime Languages.” 45th International Symposium
on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51.
short: I.R. Jecker, O. Kupferman, N. Mazzocchi, in:, 45th International Symposium
on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020.
conference:
end_date: 2020-08-28
location: Prague, Czech Republic
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2020-08-24
corr_author: '1'
date_created: 2020-09-20T22:01:36Z
date_published: 2020-08-18T00:00:00Z
date_updated: 2025-07-10T11:57:07Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2020.51
ec_funded: 1
file:
- access_level: open_access
checksum: 2dc9e2fad6becd4563aef3e27a473f70
content_type: application/pdf
creator: dernst
date_created: 2020-09-21T14:17:08Z
date_updated: 2020-09-21T14:17:08Z
file_id: '8552'
file_name: 2020_LIPIcsMFCS_Jecker.pdf
file_size: 597977
relation: main_file
success: 1
file_date_updated: 2020-09-21T14:17:08Z
has_accepted_license: '1'
intvolume: ' 170'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 45th International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- '9783959771597'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unary prime languages
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: 170
year: '2020'
...
---
_id: '8536'
abstract:
- lang: eng
text: This work analyzes the latency of the simplified successive cancellation (SSC)
decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It
is shown that, unlike conventional successive cancellation decoding, where latency
is linear in the block length, the latency of SSC decoding is sublinear. More
specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block
length and µ is the scaling exponent of the channel, which captures the speed
of convergence of the rate to capacity. Numerical results demonstrate the tightness
of the bound and show that most of the latency reduction arises from the parallel
decoding of subcodes of rate 0 and 1.
acknowledgement: M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305,
IIS-1741162 and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral
Fellowship from the Natural Sciences and Engineering Research Council of Canada
(NSERC) and by Huawei.
article_number: 401-406
article_processing_charge: No
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: John
full_name: Cioffi, John
last_name: Cioffi
- first_name: Andrea
full_name: Goldsmith, Andrea
last_name: Goldsmith
citation:
ama: 'Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. Simplified successive cancellation
decoding of polar codes has sublinear latency. In: IEEE International Symposium
on Information Theory - Proceedings. Vol 2020-June. IEEE; 2020. doi:10.1109/ISIT44484.2020.9174141'
apa: 'Mondelli, M., Hashemi, S. A., Cioffi, J., & Goldsmith, A. (2020). Simplified
successive cancellation decoding of polar codes has sublinear latency. In IEEE
International Symposium on Information Theory - Proceedings (Vol. 2020–June).
Los Angeles, CA, United States: IEEE. https://doi.org/10.1109/ISIT44484.2020.9174141'
chicago: Mondelli, Marco, Seyyed Ali Hashemi, John Cioffi, and Andrea Goldsmith.
“Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.”
In IEEE International Symposium on Information Theory - Proceedings, Vol.
2020–June. IEEE, 2020. https://doi.org/10.1109/ISIT44484.2020.9174141.
ieee: M. Mondelli, S. A. Hashemi, J. Cioffi, and A. Goldsmith, “Simplified successive
cancellation decoding of polar codes has sublinear latency,” in IEEE International
Symposium on Information Theory - Proceedings, Los Angeles, CA, United States,
2020, vol. 2020–June.
ista: 'Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. 2020. Simplified successive
cancellation decoding of polar codes has sublinear latency. IEEE International
Symposium on Information Theory - Proceedings. ISIT: International Symposium on
Information Theory vol. 2020–June, 401–406.'
mla: Mondelli, Marco, et al. “Simplified Successive Cancellation Decoding of Polar
Codes Has Sublinear Latency.” IEEE International Symposium on Information Theory
- Proceedings, vol. 2020–June, 401–406, IEEE, 2020, doi:10.1109/ISIT44484.2020.9174141.
short: M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International
Symposium on Information Theory - Proceedings, IEEE, 2020.
conference:
end_date: 2020-06-26
location: Los Angeles, CA, United States
name: 'ISIT: International Symposium on Information Theory'
start_date: 2020-06-21
date_created: 2020-09-20T22:01:37Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2025-09-10T10:27:05Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/ISIT44484.2020.9174141
external_id:
arxiv:
- '1909.04892'
isi:
- '000714963400069'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.04892
month: '06'
oa: 1
oa_version: Preprint
publication: IEEE International Symposium on Information Theory - Proceedings
publication_identifier:
isbn:
- '9781728164328'
issn:
- 2157-8095
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '9047'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Simplified successive cancellation decoding of polar codes has sublinear latency
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2020-June
year: '2020'
...
---
_id: '8539'
abstract:
- lang: eng
text: Cohomological and K-theoretic stable bases originated from the study of quantum
cohomology and quantum K-theory. Restriction formula for cohomological stable
bases played an important role in computing the quantum connection of cotangent
bundle of partial flag varieties. In this paper we study the K-theoretic stable
bases of cotangent bundles of flag varieties. We describe these bases in terms
of the action of the affine Hecke algebra and the twisted group algebra of KostantKumar.
Using this algebraic description and the method of root polynomials, we give a
restriction formula of the stable bases. We apply it to obtain the restriction
formula for partial flag varieties. We also build a relation between the stable
basis and the Casselman basis in the principal series representations of the Langlands
dual group. As an application, we give a closed formula for the transition matrix
between Casselman basis and the characteristic functions.
- lang: fre
text: "Les bases stables cohomologiques et K-théoriques proviennent de l’étude de
la cohomologie quantique et de la K-théorie quantique. La formule de restriction
pour les bases stables cohomologiques a joué un rôle important dans le calcul
de la connexion quantique du fibré cotangent de variétés de drapeaux partielles.
Dans cet article, nous étudions les bases stables K-théoriques de fibré cotangents
des variétés de drapeaux. Nous décrivons ces bases en fonction de l’action de
l’algèbre de Hecke affine et de l’algèbre de Kostant-Kumar. En utilisant cette
description algébrique et la méthode des polynômes de racine, nous donnons une
formule de restriction des bases stables. Nous l’appliquons\r\npour obtenir la
formule de restriction pour les variétés de drapeaux partielles. Nous construisons
également une relation entre la base stable et la base de Casselman dans les représentations
de la série principale du groupe dual de Langlands p-adique. Comme une application,
nous donnons une formule close pour la matrice de transition entre la base de
Casselman et les fonctions caractéristiques. "
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: C.
full_name: Su, C.
last_name: Su
- first_name: Gufang
full_name: Zhao, Gufang
id: 2BC2AC5E-F248-11E8-B48F-1D18A9856A87
last_name: Zhao
- first_name: C.
full_name: Zhong, C.
last_name: Zhong
citation:
ama: Su C, Zhao G, Zhong C. On the K-theory stable bases of the springer resolution.
Annales Scientifiques de l’Ecole Normale Superieure. 2020;53(3):663-671.
doi:10.24033/asens.2431
apa: Su, C., Zhao, G., & Zhong, C. (2020). On the K-theory stable bases of the
springer resolution. Annales Scientifiques de l’Ecole Normale Superieure.
Société Mathématique de France. https://doi.org/10.24033/asens.2431
chicago: Su, C., Gufang Zhao, and C. Zhong. “On the K-Theory Stable Bases of the
Springer Resolution.” Annales Scientifiques de l’Ecole Normale Superieure.
Société Mathématique de France, 2020. https://doi.org/10.24033/asens.2431.
ieee: C. Su, G. Zhao, and C. Zhong, “On the K-theory stable bases of the springer
resolution,” Annales Scientifiques de l’Ecole Normale Superieure, vol.
53, no. 3. Société Mathématique de France, pp. 663–671, 2020.
ista: Su C, Zhao G, Zhong C. 2020. On the K-theory stable bases of the springer
resolution. Annales Scientifiques de l’Ecole Normale Superieure. 53(3), 663–671.
mla: Su, C., et al. “On the K-Theory Stable Bases of the Springer Resolution.” Annales
Scientifiques de l’Ecole Normale Superieure, vol. 53, no. 3, Société Mathématique
de France, 2020, pp. 663–71, doi:10.24033/asens.2431.
short: C. Su, G. Zhao, C. Zhong, Annales Scientifiques de l’Ecole Normale Superieure
53 (2020) 663–671.
date_created: 2020-09-20T22:01:38Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2023-08-22T09:27:57Z
day: '01'
department:
- _id: TaHa
doi: 10.24033/asens.2431
external_id:
arxiv:
- '1708.08013'
isi:
- '000592182600004'
intvolume: ' 53'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.08013
month: '06'
oa: 1
oa_version: Preprint
page: 663-671
publication: Annales Scientifiques de l'Ecole Normale Superieure
publication_identifier:
issn:
- 0012-9593
publication_status: published
publisher: Société Mathématique de France
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the K-theory stable bases of the springer resolution
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 53
year: '2020'
...
---
_id: '8568'
abstract:
- lang: eng
text: Aqueous iodine based electrochemical energy storage is considered a potential
candidate to improve sustainability and performance of current battery and supercapacitor
technology. It harnesses the redox activity of iodide, iodine, and polyiodide
species in the confined geometry of nanoporous carbon electrodes. However, current
descriptions of the electrochemical reaction mechanism to interconvert these species
are elusive. Here we show that electrochemical oxidation of iodide in nanoporous
carbons forms persistent solid iodine deposits. Confinement slows down dissolution
into triiodide and pentaiodide, responsible for otherwise significant self-discharge
via shuttling. The main tools for these insights are in situ Raman spectroscopy
and in situ small and wide-angle X-ray scattering (in situ SAXS/WAXS). In situ
Raman confirms the reversible formation of triiodide and pentaiodide. In situ
SAXS/WAXS indicates remarkable amounts of solid iodine deposited in the carbon
nanopores. Combined with stochastic modeling, in situ SAXS allows quantifying
the solid iodine volume fraction and visualizing the iodine structure on 3D lattice
models at the sub-nanometer scale. Based on the derived mechanism, we demonstrate
strategies for improved iodine pore filling capacity and prevention of self-discharge,
applicable to hybrid supercapacitors and batteries.
article_number: '4838'
article_processing_charge: No
article_type: original
author:
- first_name: Christian
full_name: Prehal, Christian
last_name: Prehal
- first_name: Harald
full_name: Fitzek, Harald
last_name: Fitzek
- first_name: Gerald
full_name: Kothleitner, Gerald
last_name: Kothleitner
- first_name: Volker
full_name: Presser, Volker
last_name: Presser
- first_name: Bernhard
full_name: Gollas, Bernhard
last_name: Gollas
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: Qamar
full_name: Abbas, Qamar
last_name: Abbas
citation:
ama: Prehal C, Fitzek H, Kothleitner G, et al. Persistent and reversible solid iodine
electrodeposition in nanoporous carbons. Nature Communications. 2020;11.
doi:10.1038/s41467-020-18610-6
apa: Prehal, C., Fitzek, H., Kothleitner, G., Presser, V., Gollas, B., Freunberger,
S. A., & Abbas, Q. (2020). Persistent and reversible solid iodine electrodeposition
in nanoporous carbons. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-020-18610-6
chicago: Prehal, Christian, Harald Fitzek, Gerald Kothleitner, Volker Presser, Bernhard
Gollas, Stefan Alexander Freunberger, and Qamar Abbas. “Persistent and Reversible
Solid Iodine Electrodeposition in Nanoporous Carbons.” Nature Communications.
Springer Nature, 2020. https://doi.org/10.1038/s41467-020-18610-6.
ieee: C. Prehal et al., “Persistent and reversible solid iodine electrodeposition
in nanoporous carbons,” Nature Communications, vol. 11. Springer Nature,
2020.
ista: Prehal C, Fitzek H, Kothleitner G, Presser V, Gollas B, Freunberger SA, Abbas
Q. 2020. Persistent and reversible solid iodine electrodeposition in nanoporous
carbons. Nature Communications. 11, 4838.
mla: Prehal, Christian, et al. “Persistent and Reversible Solid Iodine Electrodeposition
in Nanoporous Carbons.” Nature Communications, vol. 11, 4838, Springer
Nature, 2020, doi:10.1038/s41467-020-18610-6.
short: C. Prehal, H. Fitzek, G. Kothleitner, V. Presser, B. Gollas, S.A. Freunberger,
Q. Abbas, Nature Communications 11 (2020).
corr_author: '1'
date_created: 2020-09-25T07:23:13Z
date_published: 2020-09-24T00:00:00Z
date_updated: 2025-06-12T06:58:51Z
day: '24'
ddc:
- '530'
department:
- _id: StFr
doi: 10.1038/s41467-020-18610-6
external_id:
isi:
- '000573756600004'
pmid:
- '32973214'
file:
- access_level: open_access
checksum: eada7bc8dd16a49390137cff882ef328
content_type: application/pdf
creator: dernst
date_created: 2020-09-28T13:16:15Z
date_updated: 2020-09-28T13:16:15Z
file_id: '8585'
file_name: 2020_NatureComm_Prehal.pdf
file_size: 1822469
relation: main_file
success: 1
file_date_updated: 2020-09-28T13:16:15Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
keyword:
- General Biochemistry
- Genetics and Molecular Biology
- General Physics and Astronomy
- General Chemistry
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1038/s41467-020-19720-x
scopus_import: '1'
status: public
title: Persistent and reversible solid iodine electrodeposition in nanoporous carbons
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: 11
year: '2020'
...
---
_id: '8571'
abstract:
- lang: eng
text: We present the results of a friendly competition for formal verification of
continuous and hybrid systems with nonlinear continuous dynamics. The friendly
competition took place as part of the workshop Applied Verification for Continuous
and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex,
Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These
tools are applied to solve reachability analysis problems on six benchmark problems,
two of them featuring hybrid dynamics. We do not rank the tools based on the results,
but show the current status and discover the potential advantages of different
tools.
acknowledgement: Christian Schilling acknowledges support in part by the Austrian
Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award) and the European Union’s
Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie
grant agreement No. 754411.
article_processing_charge: No
author:
- first_name: Luca
full_name: Geretti, Luca
last_name: Geretti
- first_name: Julien
full_name: Alexandre Dit Sandretto, Julien
last_name: Alexandre Dit Sandretto
- first_name: Matthias
full_name: Althoff, Matthias
last_name: Althoff
- first_name: Luis
full_name: Benet, Luis
last_name: Benet
- first_name: Alexandre
full_name: Chapoutot, Alexandre
last_name: Chapoutot
- first_name: Xin
full_name: Chen, Xin
last_name: Chen
- first_name: Pieter
full_name: Collins, Pieter
last_name: Collins
- first_name: Marcelo
full_name: Forets, Marcelo
last_name: Forets
- first_name: Daniel
full_name: Freire, Daniel
last_name: Freire
- first_name: Fabian
full_name: Immler, Fabian
last_name: Immler
- first_name: Niklas
full_name: Kochdumper, Niklas
last_name: Kochdumper
- first_name: David
full_name: Sanders, David
last_name: Sanders
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
citation:
ama: 'Geretti L, Alexandre Dit Sandretto J, Althoff M, et al. ARCH-COMP20 Category
Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series
in Computing. Vol 74. EasyChair; 2020:49-75. doi:10.29007/zkf6'
apa: 'Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot,
A., Chen, X., … Schilling, C. (2020). ARCH-COMP20 Category Report: Continuous
and hybrid systems with nonlinear dynamics. In EPiC Series in Computing
(Vol. 74, pp. 49–75). EasyChair. https://doi.org/10.29007/zkf6'
chicago: 'Geretti, Luca, Julien Alexandre Dit Sandretto, Matthias Althoff, Luis
Benet, Alexandre Chapoutot, Xin Chen, Pieter Collins, et al. “ARCH-COMP20 Category
Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In EPiC Series
in Computing, 74:49–75. EasyChair, 2020. https://doi.org/10.29007/zkf6.'
ieee: 'L. Geretti et al., “ARCH-COMP20 Category Report: Continuous and hybrid
systems with nonlinear dynamics,” in EPiC Series in Computing, 2020, vol.
74, pp. 49–75.'
ista: 'Geretti L, Alexandre Dit Sandretto J, Althoff M, Benet L, Chapoutot A, Chen
X, Collins P, Forets M, Freire D, Immler F, Kochdumper N, Sanders D, Schilling
C. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear
dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification
on Continuous and Hybrid Systems vol. 74, 49–75.'
mla: 'Geretti, Luca, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid
Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair,
2020, pp. 49–75, doi:10.29007/zkf6.'
short: L. Geretti, J. Alexandre Dit Sandretto, M. Althoff, L. Benet, A. Chapoutot,
X. Chen, P. Collins, M. Forets, D. Freire, F. Immler, N. Kochdumper, D. Sanders,
C. Schilling, in:, EPiC Series in Computing, EasyChair, 2020, pp. 49–75.
conference:
end_date: 2020-07-12
name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid
Systems'
start_date: 2020-07-12
corr_author: '1'
date_created: 2020-09-26T14:41:29Z
date_published: 2020-09-25T00:00:00Z
date_updated: 2025-04-15T06:26:12Z
day: '25'
department:
- _id: ToHe
doi: 10.29007/zkf6
ec_funded: 1
intvolume: ' 74'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://easychair.org/publications/download/nrdD
month: '09'
oa: 1
oa_version: Published Version
page: 49-75
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: EPiC Series in Computing
publication_status: published
publisher: EasyChair
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear
dynamics'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 74
year: '2020'
...
---
_id: '8572'
abstract:
- lang: eng
text: 'We present the results of the ARCH 2020 friendly competition for formal verification
of continuous and hybrid systems with linear continuous dynamics. In its fourth
edition, eight tools have been applied to solve eight different benchmark problems
in the category for linear continuous dynamics (in alphabetical order): CORA,
C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report
is a snapshot of the current landscape of tools and the types of benchmarks they
are particularly suited for. Due to the diversity of problems, we are not ranking
tools, yet the presented results provide one of the most complete assessments
of tools for the safety verification of continuous and hybrid systems with linear
continuous dynamics up to this date.'
acknowledgement: "The authors gratefully acknowledge financial support by the European
Commission project\r\njustITSELF under grant number 817629, by the Austrian Science
Fund (FWF) under grant\r\nZ211-N23 (Wittgenstein Award), by the European Union’s
Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie
grant agreement No. 754411, and by the\r\nScience and Engineering Research Board
(SERB) project with file number IMP/2018/000523.\r\nThis material is based upon
work supported by the Air Force Office of Scientific Research under\r\naward number
FA9550-19-1-0288. Any opinions, finding, and conclusions or recommendations\r\nexpressed
in this material are those of the author(s) and do not necessarily reflect the views
of\r\nthe United States Air Force."
article_processing_charge: No
author:
- first_name: Matthias
full_name: Althoff, Matthias
last_name: Althoff
- first_name: Stanley
full_name: Bak, Stanley
last_name: Bak
- first_name: Zongnan
full_name: Bao, Zongnan
last_name: Bao
- first_name: Marcelo
full_name: Forets, Marcelo
last_name: Forets
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Daniel
full_name: Freire, Daniel
last_name: Freire
- first_name: Niklas
full_name: Kochdumper, Niklas
last_name: Kochdumper
- first_name: Yangge
full_name: Li, Yangge
last_name: Li
- first_name: Sayan
full_name: Mitra, Sayan
last_name: Mitra
- first_name: Rajarshi
full_name: Ray, Rajarshi
last_name: Ray
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
- first_name: Stefan
full_name: Schupp, Stefan
last_name: Schupp
- first_name: Mark
full_name: Wetzlinger, Mark
last_name: Wetzlinger
citation:
ama: 'Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and
hybrid systems with linear dynamics. In: EPiC Series in Computing. Vol
74. EasyChair; 2020:16-48. doi:10.29007/7dt2'
apa: 'Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D., … Wetzlinger,
M. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with linear
dynamics. In EPiC Series in Computing (Vol. 74, pp. 16–48). EasyChair.
https://doi.org/10.29007/7dt2'
chicago: 'Althoff, Matthias, Stanley Bak, Zongnan Bao, Marcelo Forets, Goran Frehse,
Daniel Freire, Niklas Kochdumper, et al. “ARCH-COMP20 Category Report: Continuous
and Hybrid Systems with Linear Dynamics.” In EPiC Series in Computing,
74:16–48. EasyChair, 2020. https://doi.org/10.29007/7dt2.'
ieee: 'M. Althoff et al., “ARCH-COMP20 Category Report: Continuous and hybrid
systems with linear dynamics,” in EPiC Series in Computing, 2020, vol.
74, pp. 16–48.'
ista: 'Althoff M, Bak S, Bao Z, Forets M, Frehse G, Freire D, Kochdumper N, Li Y,
Mitra S, Ray R, Schilling C, Schupp S, Wetzlinger M. 2020. ARCH-COMP20 Category
Report: Continuous and hybrid systems with linear dynamics. EPiC Series in Computing.
ARCH: International Workshop on Applied Verification on Continuous and Hybrid
Systems vol. 74, 16–48.'
mla: 'Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid
Systems with Linear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair,
2020, pp. 16–48, doi:10.29007/7dt2.'
short: M. Althoff, S. Bak, Z. Bao, M. Forets, G. Frehse, D. Freire, N. Kochdumper,
Y. Li, S. Mitra, R. Ray, C. Schilling, S. Schupp, M. Wetzlinger, in:, EPiC Series
in Computing, EasyChair, 2020, pp. 16–48.
conference:
end_date: 2020-07-12
name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid
Systems'
start_date: 2020-07-12
corr_author: '1'
date_created: 2020-09-26T14:49:43Z
date_published: 2020-09-25T00:00:00Z
date_updated: 2025-04-15T08:29:04Z
day: '25'
department:
- _id: ToHe
doi: 10.29007/7dt2
ec_funded: 1
intvolume: ' 74'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://easychair.org/publications/download/DRpS
month: '09'
oa: 1
oa_version: Published Version
page: 16-48
project:
- _id: 25C5A090-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00312
name: Synaptic communication in neuronal microcircuits
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: EPiC Series in Computing
publication_status: published
publisher: EasyChair
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 74
year: '2020'
...
---
_id: '8580'
abstract:
- lang: eng
text: We evaluate the usefulness of persistent homology in the analysis of heart
rate variability. In our approach we extract several topological descriptors characterising
datasets of RR-intervals, which are later used in classical machine learning algorithms.
By this method we are able to differentiate the group of patients with the history
of transient ischemic attack and the group of hypertensive patients.
article_number: '9158054'
article_processing_charge: No
author:
- first_name: Grzegorz
full_name: Graff, Grzegorz
last_name: Graff
- first_name: Beata
full_name: Graff, Beata
last_name: Graff
- first_name: Grzegorz
full_name: Jablonski, Grzegorz
id: 4483EF78-F248-11E8-B48F-1D18A9856A87
last_name: Jablonski
orcid: 0000-0002-3536-9866
- first_name: Krzysztof
full_name: Narkiewicz, Krzysztof
last_name: Narkiewicz
citation:
ama: 'Graff G, Graff B, Jablonski G, Narkiewicz K. The application of persistent
homology in the analysis of heart rate variability. In: 11th Conference of
the European Study Group on Cardiovascular Oscillations: Computation and Modelling
in Physiology: New Challenges and Opportunities, . IEEE; 2020. doi:10.1109/ESGCO49734.2020.9158054'
apa: 'Graff, G., Graff, B., Jablonski, G., & Narkiewicz, K. (2020). The application
of persistent homology in the analysis of heart rate variability. In 11th Conference
of the European Study Group on Cardiovascular Oscillations: Computation and Modelling
in Physiology: New Challenges and Opportunities, . Pisa, Italy: IEEE. https://doi.org/10.1109/ESGCO49734.2020.9158054'
chicago: 'Graff, Grzegorz, Beata Graff, Grzegorz Jablonski, and Krzysztof Narkiewicz.
“The Application of Persistent Homology in the Analysis of Heart Rate Variability.”
In 11th Conference of the European Study Group on Cardiovascular Oscillations:
Computation and Modelling in Physiology: New Challenges and Opportunities, .
IEEE, 2020. https://doi.org/10.1109/ESGCO49734.2020.9158054.'
ieee: 'G. Graff, B. Graff, G. Jablonski, and K. Narkiewicz, “The application of
persistent homology in the analysis of heart rate variability,” in 11th Conference
of the European Study Group on Cardiovascular Oscillations: Computation and Modelling
in Physiology: New Challenges and Opportunities, , Pisa, Italy, 2020.'
ista: 'Graff G, Graff B, Jablonski G, Narkiewicz K. 2020. The application of persistent
homology in the analysis of heart rate variability. 11th Conference of the European
Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology:
New Challenges and Opportunities, . ESGCO: European Study Group on Cardiovascular
Oscillations, 9158054.'
mla: 'Graff, Grzegorz, et al. “The Application of Persistent Homology in the Analysis
of Heart Rate Variability.” 11th Conference of the European Study Group on
Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges
and Opportunities, , 9158054, IEEE, 2020, doi:10.1109/ESGCO49734.2020.9158054.'
short: 'G. Graff, B. Graff, G. Jablonski, K. Narkiewicz, in:, 11th Conference of
the European Study Group on Cardiovascular Oscillations: Computation and Modelling
in Physiology: New Challenges and Opportunities, , IEEE, 2020.'
conference:
end_date: 2020-07-15
location: Pisa, Italy
name: 'ESGCO: European Study Group on Cardiovascular Oscillations'
start_date: 2020-07-15
date_created: 2020-09-28T08:59:27Z
date_published: 2020-08-01T00:00:00Z
date_updated: 2023-08-22T09:33:34Z
day: '01'
department:
- _id: HeEd
doi: 10.1109/ESGCO49734.2020.9158054
external_id:
isi:
- '000621172600045'
isi: 1
language:
- iso: eng
month: '08'
oa_version: None
publication: '11th Conference of the European Study Group on Cardiovascular Oscillations:
Computation and Modelling in Physiology: New Challenges and Opportunities, '
publication_identifier:
isbn:
- '9781728157511'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: The application of persistent homology in the analysis of heart rate variability
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2020'
...
---
_id: '8581'
abstract:
- lang: eng
text: The majority of adenosine triphosphate (ATP) powering cellular processes in
eukaryotes is produced by the mitochondrial F1Fo ATP synthase. Here, we present
the atomic models of the membrane Fo domain and the entire mammalian (ovine) F1Fo,
determined by cryo-electron microscopy. Subunits in the membrane domain are arranged
in the ‘proton translocation cluster’ attached to the c-ring and a more distant
‘hook apparatus’ holding subunit e. Unexpectedly, this subunit is anchored to
a lipid ‘plug’ capping the c-ring. We present a detailed proton translocation
pathway in mammalian Fo and key inter-monomer contacts in F1Fo multimers. Cryo-EM
maps of F1Fo exposed to calcium reveal a retracted subunit e and a disassembled
c-ring, suggesting permeability transition pore opening. We propose a model for
the permeability transition pore opening, whereby subunit e pulls the lipid plug
out of the c-ring. Our structure will allow the design of drugs for many emerging
applications in medicine.
acknowledged_ssus:
- _id: EM-Fac
- _id: ScienComp
acknowledgement: We thank J. Novacek from CEITEC (Brno, Czech Republic) for assistance
with collecting the FEI Krios dataset and iNEXT for providing access to CEITEC.
We thank the IST Austria EM facility for access and assistance with collecting the
FEI Glacios dataset. Data processing was performed at the IST high-performance computing
cluster. This work has been supported by iNEXT EM HEDC (proposal 4506), funded by
the Horizon 2020 Programme of the European Commission.
article_processing_charge: No
article_type: original
author:
- first_name: Gergely
full_name: Pinke, Gergely
id: 4D5303E6-F248-11E8-B48F-1D18A9856A87
last_name: Pinke
- first_name: Long
full_name: Zhou, Long
id: 3E751364-F248-11E8-B48F-1D18A9856A87
last_name: Zhou
orcid: 0000-0002-1864-8951
- 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: Pinke G, Zhou L, Sazanov LA. Cryo-EM structure of the entire mammalian F-type
ATP synthase. Nature Structural and Molecular Biology. 2020;27(11):1077-1085.
doi:10.1038/s41594-020-0503-8
apa: Pinke, G., Zhou, L., & Sazanov, L. A. (2020). Cryo-EM structure of the
entire mammalian F-type ATP synthase. Nature Structural and Molecular Biology.
Springer Nature. https://doi.org/10.1038/s41594-020-0503-8
chicago: Pinke, Gergely, Long Zhou, and Leonid A Sazanov. “Cryo-EM Structure of
the Entire Mammalian F-Type ATP Synthase.” Nature Structural and Molecular
Biology. Springer Nature, 2020. https://doi.org/10.1038/s41594-020-0503-8.
ieee: G. Pinke, L. Zhou, and L. A. Sazanov, “Cryo-EM structure of the entire mammalian
F-type ATP synthase,” Nature Structural and Molecular Biology, vol. 27,
no. 11. Springer Nature, pp. 1077–1085, 2020.
ista: Pinke G, Zhou L, Sazanov LA. 2020. Cryo-EM structure of the entire mammalian
F-type ATP synthase. Nature Structural and Molecular Biology. 27(11), 1077–1085.
mla: Pinke, Gergely, et al. “Cryo-EM Structure of the Entire Mammalian F-Type ATP
Synthase.” Nature Structural and Molecular Biology, vol. 27, no. 11, Springer
Nature, 2020, pp. 1077–85, doi:10.1038/s41594-020-0503-8.
short: G. Pinke, L. Zhou, L.A. Sazanov, Nature Structural and Molecular Biology
27 (2020) 1077–1085.
date_created: 2020-09-28T08:59:27Z
date_published: 2020-11-01T00:00:00Z
date_updated: 2025-07-10T11:57:09Z
day: '01'
department:
- _id: LeSa
doi: 10.1038/s41594-020-0503-8
external_id:
isi:
- '000569299400004'
pmid:
- '32929284'
intvolume: ' 27'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa_version: None
page: 1077-1085
pmid: 1
publication: Nature Structural and Molecular Biology
publication_identifier:
eissn:
- 1545-9985
issn:
- 1545-9993
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/structure-of-atpase-solved/
scopus_import: '1'
status: public
title: Cryo-EM structure of the entire mammalian F-type ATP synthase
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2020'
...
---
_id: '8588'
abstract:
- lang: eng
text: Dipolar (or spatially indirect) excitons (IXs) in semiconductor double quantum
well (DQW) subjected to an electric field are neutral species with a dipole moment
oriented perpendicular to the DQW plane. Here, we theoretically study interactions
between IXs in stacked DQW bilayers, where the dipolar coupling can be either
attractive or repulsive depending on the relative positions of the particles.
By using microscopic band structure calculations to determine the electronic states
forming the excitons, we show that the attractive dipolar interaction between
stacked IXs deforms their electronic wave function, thereby increasing the inter-DQW
interaction energy and making the IX even more electrically polarizable. Many-particle
interaction effects are addressed by considering the coupling between a single
IX in one of the DQWs to a cloud of IXs in the other DQW, which is modeled either
as a closed-packed lattice or as a continuum IX fluid. We find that the lattice
model yields IX interlayer binding energies decreasing with increasing lattice
density. This behavior is due to the dominating role of the intra-DQW dipolar
repulsion, which prevents more than one exciton from entering the attractive region
of the inter-DQW coupling. Finally, both models shows that the single IX distorts
the distribution of IXs in the adjacent DQW, thus inducing the formation of an
IX dipolar polaron (dipolaron). While the interlayer binding energy reduces with
IX density for lattice dipolarons, the continuous polaron model predicts a nonmonotonous
dependence on density in semiquantitative agreement with a recent experimental
study [cf. Hubert et al., Phys. Rev. X 9, 021026 (2019)].
acknowledgement: "We thank W. Kaganer for discussions and for comment on the manuscript.
We acknowledge the financial support from the German-Israeli Foundation (GIF), grant
agreement I-1277-303.10/2014. M.L. acknowledges support by the Austrian Science
Fund (FWF), under project No. P29902-N27, and by the European Research Council (ERC)
Starting Grant No. 801770 (ANGULON). A.G. acknowledges support by the European Unions
Horizon 2020 research and innovation\r\nprogram under the Marie Skodowska-Curie
grant agreement No 754411. P.V.S acknowledges financial support\r\nfrom the Deutsche
Forschungsgemeinschaft (DFG) under\r\nProject No. SA 598/12-1."
article_number: '045307'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: C.
full_name: Hubert, C.
last_name: Hubert
- first_name: K.
full_name: Cohen, K.
last_name: Cohen
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: R.
full_name: Rapaport, R.
last_name: Rapaport
- first_name: P. V.
full_name: Santos, P. V.
last_name: Santos
citation:
ama: Hubert C, Cohen K, Ghazaryan A, Lemeshko M, Rapaport R, Santos PV. Attractive
interactions, molecular complexes, and polarons in coupled dipolar exciton fluids.
Physical Review B. 2020;102(4). doi:10.1103/physrevb.102.045307
apa: Hubert, C., Cohen, K., Ghazaryan, A., Lemeshko, M., Rapaport, R., & Santos,
P. V. (2020). Attractive interactions, molecular complexes, and polarons in coupled
dipolar exciton fluids. Physical Review B. American Physical Society. https://doi.org/10.1103/physrevb.102.045307
chicago: Hubert, C., K. Cohen, Areg Ghazaryan, Mikhail Lemeshko, R. Rapaport, and
P. V. Santos. “Attractive Interactions, Molecular Complexes, and Polarons in Coupled
Dipolar Exciton Fluids.” Physical Review B. American Physical Society,
2020. https://doi.org/10.1103/physrevb.102.045307.
ieee: C. Hubert, K. Cohen, A. Ghazaryan, M. Lemeshko, R. Rapaport, and P. V. Santos,
“Attractive interactions, molecular complexes, and polarons in coupled dipolar
exciton fluids,” Physical Review B, vol. 102, no. 4. American Physical
Society, 2020.
ista: Hubert C, Cohen K, Ghazaryan A, Lemeshko M, Rapaport R, Santos PV. 2020. Attractive
interactions, molecular complexes, and polarons in coupled dipolar exciton fluids.
Physical Review B. 102(4), 045307.
mla: Hubert, C., et al. “Attractive Interactions, Molecular Complexes, and Polarons
in Coupled Dipolar Exciton Fluids.” Physical Review B, vol. 102, no. 4,
045307, American Physical Society, 2020, doi:10.1103/physrevb.102.045307.
short: C. Hubert, K. Cohen, A. Ghazaryan, M. Lemeshko, R. Rapaport, P.V. Santos,
Physical Review B 102 (2020).
date_created: 2020-09-30T10:33:43Z
date_published: 2020-07-21T00:00:00Z
date_updated: 2025-04-14T07:43:49Z
day: '21'
department:
- _id: MiLe
doi: 10.1103/physrevb.102.045307
ec_funded: 1
external_id:
arxiv:
- '1910.06015'
isi:
- '000550579100004'
intvolume: ' 102'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1910.06015
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Attractive interactions, molecular complexes, and polarons in coupled dipolar
exciton fluids
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 102
year: '2020'
...
---
_id: '8592'
abstract:
- lang: eng
text: Glioblastoma is the most malignant cancer in the brain and currently incurable.
It is urgent to identify effective targets for this lethal disease. Inhibition
of such targets should suppress the growth of cancer cells and, ideally also precancerous
cells for early prevention, but minimally affect their normal counterparts. Using
genetic mouse models with neural stem cells (NSCs) or oligodendrocyte precursor
cells (OPCs) as the cells‐of‐origin/mutation, it is shown that the susceptibility
of cells within the development hierarchy of glioma to the knockout of insulin‐like
growth factor I receptor (IGF1R) is determined not only by their oncogenic states,
but also by their cell identities/states. Knockout of IGF1R selectively disrupts
the growth of mutant and transformed, but not normal OPCs, or NSCs. The desirable
outcome of IGF1R knockout on cell growth requires the mutant cells to commit to
the OPC identity regardless of its development hierarchical status. At the molecular
level, oncogenic mutations reprogram the cellular network of OPCs and force them
to depend more on IGF1R for their growth. A new‐generation brain‐penetrable, orally
available IGF1R inhibitor harnessing tumor OPCs in the brain is also developed.
The findings reveal the cellular window of IGF1R targeting and establish IGF1R
as an effective target for the prevention and treatment of glioblastoma.
acknowledgement: The authors thank Drs. J. Eisen, QR. Lu, S. Duan, Z‐H. Li, W. Mo,
and Q. Wu for their critical comments on the manuscript. They also thank Dr. H.
Zong for providing the CKO_NG2‐CreER model. This work is supported by the National
Key Research and Development Program of China, Stem Cell and Translational Research
(2016YFA0101201 to C.L., 2016YFA0100303 to Y.J.W.), the National Natural Science
Foundation of China (81673035 and 81972915 to C.L., 81472722 to Y.J.W.), the Science
Foundation for Distinguished Young Scientists of Zhejiang Province (LR17H160001
to C.L.), Fundamental Research Funds for the Central Universities (2016QNA7023 and
2017QNA7028 to C.L.) and the Thousand Talent Program for Young Outstanding Scientists,
China (to C.L.), IST Austria institutional funds (to S.H.), European Research Council
(ERC) under the European Union's Horizon 2020 research and innovation programme
(725780 LinPro to S.H.). C.L. is a scholar of K. C. Wong Education Foundation.
article_number: '2001724'
article_processing_charge: No
article_type: original
author:
- first_name: Anhao
full_name: Tian, Anhao
last_name: Tian
- first_name: Bo
full_name: Kang, Bo
last_name: Kang
- first_name: Baizhou
full_name: Li, Baizhou
last_name: Li
- first_name: Biying
full_name: Qiu, Biying
last_name: Qiu
- first_name: Wenhong
full_name: Jiang, Wenhong
last_name: Jiang
- first_name: Fangjie
full_name: Shao, Fangjie
last_name: Shao
- first_name: Qingqing
full_name: Gao, Qingqing
last_name: Gao
- first_name: Rui
full_name: Liu, Rui
last_name: Liu
- first_name: Chengwei
full_name: Cai, Chengwei
last_name: Cai
- first_name: Rui
full_name: Jing, Rui
last_name: Jing
- first_name: Wei
full_name: Wang, Wei
last_name: Wang
- first_name: Pengxiang
full_name: Chen, Pengxiang
last_name: Chen
- first_name: Qinghui
full_name: Liang, Qinghui
last_name: Liang
- first_name: Lili
full_name: Bao, Lili
last_name: Bao
- first_name: Jianghong
full_name: Man, Jianghong
last_name: Man
- first_name: Yan
full_name: Wang, Yan
last_name: Wang
- first_name: Yu
full_name: Shi, Yu
last_name: Shi
- first_name: Jin
full_name: Li, Jin
last_name: Li
- first_name: Minmin
full_name: Yang, Minmin
last_name: Yang
- first_name: Lisha
full_name: Wang, Lisha
last_name: Wang
- first_name: Jianmin
full_name: Zhang, Jianmin
last_name: Zhang
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Junming
full_name: Zhu, Junming
last_name: Zhu
- first_name: Xiuwu
full_name: Bian, Xiuwu
last_name: Bian
- first_name: Ying‐Jie
full_name: Wang, Ying‐Jie
last_name: Wang
- first_name: Chong
full_name: Liu, Chong
last_name: Liu
citation:
ama: Tian A, Kang B, Li B, et al. Oncogenic state and cell identity combinatorially
dictate the susceptibility of cells within glioma development hierarchy to IGF1R
targeting. Advanced Science. 2020;7(21). doi:10.1002/advs.202001724
apa: Tian, A., Kang, B., Li, B., Qiu, B., Jiang, W., Shao, F., … Liu, C. (2020).
Oncogenic state and cell identity combinatorially dictate the susceptibility of
cells within glioma development hierarchy to IGF1R targeting. Advanced Science.
Wiley. https://doi.org/10.1002/advs.202001724
chicago: Tian, Anhao, Bo Kang, Baizhou Li, Biying Qiu, Wenhong Jiang, Fangjie Shao,
Qingqing Gao, et al. “Oncogenic State and Cell Identity Combinatorially Dictate
the Susceptibility of Cells within Glioma Development Hierarchy to IGF1R Targeting.”
Advanced Science. Wiley, 2020. https://doi.org/10.1002/advs.202001724.
ieee: A. Tian et al., “Oncogenic state and cell identity combinatorially
dictate the susceptibility of cells within glioma development hierarchy to IGF1R
targeting,” Advanced Science, vol. 7, no. 21. Wiley, 2020.
ista: Tian A, Kang B, Li B, Qiu B, Jiang W, Shao F, Gao Q, Liu R, Cai C, Jing R,
Wang W, Chen P, Liang Q, Bao L, Man J, Wang Y, Shi Y, Li J, Yang M, Wang L, Zhang
J, Hippenmeyer S, Zhu J, Bian X, Wang Y, Liu C. 2020. Oncogenic state and cell
identity combinatorially dictate the susceptibility of cells within glioma development
hierarchy to IGF1R targeting. Advanced Science. 7(21), 2001724.
mla: Tian, Anhao, et al. “Oncogenic State and Cell Identity Combinatorially Dictate
the Susceptibility of Cells within Glioma Development Hierarchy to IGF1R Targeting.”
Advanced Science, vol. 7, no. 21, 2001724, Wiley, 2020, doi:10.1002/advs.202001724.
short: A. Tian, B. Kang, B. Li, B. Qiu, W. Jiang, F. Shao, Q. Gao, R. Liu, C. Cai,
R. Jing, W. Wang, P. Chen, Q. Liang, L. Bao, J. Man, Y. Wang, Y. Shi, J. Li, M.
Yang, L. Wang, J. Zhang, S. Hippenmeyer, J. Zhu, X. Bian, Y. Wang, C. Liu, Advanced
Science 7 (2020).
date_created: 2020-10-01T09:44:13Z
date_published: 2020-11-04T00:00:00Z
date_updated: 2025-06-12T06:59:38Z
day: '04'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1002/advs.202001724
ec_funded: 1
external_id:
isi:
- '000573860700001'
pmid:
- '33173731'
file:
- access_level: open_access
checksum: 92818c23ecc70e35acfa671f3cfb9909
content_type: application/pdf
creator: dernst
date_created: 2020-12-10T14:07:24Z
date_updated: 2020-12-10T14:07:24Z
file_id: '8938'
file_name: 2020_AdvScience_Tian.pdf
file_size: 7835833
relation: main_file
success: 1
file_date_updated: 2020-12-10T14:07:24Z
has_accepted_license: '1'
intvolume: ' 7'
isi: 1
issue: '21'
keyword:
- General Engineering
- General Physics and Astronomy
- General Materials Science
- Medicine (miscellaneous)
- General Chemical Engineering
- Biochemistry
- Genetics and Molecular Biology (miscellaneous)
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
publication: Advanced Science
publication_identifier:
issn:
- 2198-3844
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Oncogenic state and cell identity combinatorially dictate the susceptibility
of cells within glioma development hierarchy to IGF1R targeting
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: 7
year: '2020'
...
---
_id: '8599'
abstract:
- lang: eng
text: A graph game is a two-player zero-sum game in which the players move a token
throughout a graph to produce an infinite path, which determines the winner or
payoff of the game. In bidding games, both players have budgets, and in each turn,
we hold an "auction" (bidding) to determine which player moves the token. In this
survey, we consider several bidding mechanisms and study their effect on the properties
of the game. Specifically, bidding games, and in particular bidding games of infinite
duration, have an intriguing equivalence with random-turn games in which in each
turn, the player who moves is chosen randomly. We show how minor changes in the
bidding mechanism lead to unexpected differences in the equivalence with random-turn
games.
acknowledgement: We would like to thank all our collaborators Milad Aghajohari, Ventsislav
Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný, Josef Tkadlec, and Ðorđe
Žikelić; we hope the collaboration was as fun and meaningful for you as it was for
us.
alternative_title:
- LIPIcs
article_number: '2'
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- 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: 'Avni G, Henzinger TA. A survey of bidding games on graphs. In: 31st International
Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.2'
apa: 'Avni, G., & Henzinger, T. A. (2020). A survey of bidding games on graphs.
In 31st International Conference on Concurrency Theory (Vol. 171). Virtual:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2'
chicago: Avni, Guy, and Thomas A Henzinger. “A Survey of Bidding Games on Graphs.”
In 31st International Conference on Concurrency Theory, Vol. 171. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2.
ieee: G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in 31st
International Conference on Concurrency Theory, Virtual, 2020, vol. 171.
ista: 'Avni G, Henzinger TA. 2020. A survey of bidding games on graphs. 31st International
Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs,
vol. 171, 2.'
mla: Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.”
31st International Conference on Concurrency Theory, vol. 171, 2, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.2.
short: G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency
Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-09-04
location: Virtual
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2020-09-01
corr_author: '1'
date_created: 2020-10-04T22:01:36Z
date_published: 2020-08-06T00:00:00Z
date_updated: 2025-07-10T11:57:09Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2020.2
file:
- access_level: open_access
checksum: 8f33b098e73724e0ac817f764d8e1a2d
content_type: application/pdf
creator: dernst
date_created: 2020-10-05T14:13:19Z
date_updated: 2020-10-05T14:13:19Z
file_id: '8611'
file_name: 2020_LIPIcsCONCUR_Avni.pdf
file_size: 868510
relation: main_file
success: 1
file_date_updated: 2020-10-05T14:13:19Z
has_accepted_license: '1'
intvolume: ' 171'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
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: 31st International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959771603'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: A survey of bidding games on graphs
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: 171
year: '2020'
...