---
_id: '10350'
abstract:
- lang: eng
text: The misfolding and aberrant aggregation of proteins into fibrillar structures
is a key factor in some of the most prevalent human diseases, including diabetes
and dementia. Low molecular weight oligomers are thought to be a central factor
in the pathology of these diseases, as well as critical intermediates in the fibril
formation process, and as such have received much recent attention. Moreover,
on-pathway oligomeric intermediates are potential targets for therapeutic strategies
aimed at interrupting the fibril formation process. However, a consistent framework
for distinguishing on-pathway from off-pathway oligomers has hitherto been lacking
and, in particular, no consensus definition of on- and off-pathway oligomers is
available. In this paper, we argue that a non-binary definition of oligomers'
contribution to fibril-forming pathways may be more informative and we suggest
a quantitative framework, in which each oligomeric species is assigned a value
between 0 and 1 describing its relative contribution to the formation of fibrils.
First, we clarify the distinction between oligomers and fibrils, and then we use
the formalism of reaction networks to develop a general definition for on-pathway
oligomers, that yields meaningful classifications in the context of amyloid formation.
By applying these concepts to Monte Carlo simulations of a minimal aggregating
system, and by revisiting several previous studies of amyloid oligomers in light
of our new framework, we demonstrate how to perform these classifications in practice.
For each oligomeric species we obtain the degree to which it is on-pathway, highlighting
the most effective pharmaceutical targets for the inhibition of amyloid fibril
formation.
acknowledgement: We are grateful to the Schiff Foundation (AJD), Peterhouse, Cambridge
(TCTM), the Swiss National Science foundation (TCTM), Ramon Jenkins Fellowship,
Sidney Sussex, Cambridge (GM), the Royal Society (AŠ), the Academy of Medical Sciences
and Wellcome Trust (AŠ), the Danish Research Council (MK), the Lundbeck Foundation
(MK), the Swedish Research Council (SL), the Wellcome Trust (TPJK), the Cambridge
Centre for Misfolding Diseases (TPJK), the BBSRC (TPJK), the Frances and Augustus
Newman Foundation (TPJK) for financial support. The research leading to these results
has received funding from the European Research Council under the European Union's
Seventh Framework Programme (FP7/2007-2013) through the ERC grants PhysProt (agreement
no. 337969), MAMBA (agreement no. 340890) and NovoNordiskFonden (SL).
article_processing_charge: No
article_type: original
author:
- first_name: Alexander J.
full_name: Dear, Alexander J.
last_name: Dear
- first_name: Georg
full_name: Meisl, Georg
last_name: Meisl
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Thomas C. T.
full_name: Michaels, Thomas C. T.
last_name: Michaels
- first_name: Magnus
full_name: Kjaergaard, Magnus
last_name: Kjaergaard
- first_name: Sara
full_name: Linse, Sara
last_name: Linse
- first_name: Tuomas P. J.
full_name: Knowles, Tuomas P. J.
last_name: Knowles
citation:
ama: Dear AJ, Meisl G, Šarić A, et al. Identification of on- and off-pathway oligomers
in amyloid fibril formation. Chemical Science. 2020;11(24):6236-6247. doi:10.1039/c9sc06501f
apa: Dear, A. J., Meisl, G., Šarić, A., Michaels, T. C. T., Kjaergaard, M., Linse,
S., & Knowles, T. P. J. (2020). Identification of on- and off-pathway oligomers
in amyloid fibril formation. Chemical Science. Royal Society of Chemistry.
https://doi.org/10.1039/c9sc06501f
chicago: Dear, Alexander J., Georg Meisl, Anđela Šarić, Thomas C. T. Michaels, Magnus
Kjaergaard, Sara Linse, and Tuomas P. J. Knowles. “Identification of On- and off-Pathway
Oligomers in Amyloid Fibril Formation.” Chemical Science. Royal Society
of Chemistry, 2020. https://doi.org/10.1039/c9sc06501f.
ieee: A. J. Dear et al., “Identification of on- and off-pathway oligomers
in amyloid fibril formation,” Chemical Science, vol. 11, no. 24. Royal
Society of Chemistry, pp. 6236–6247, 2020.
ista: Dear AJ, Meisl G, Šarić A, Michaels TCT, Kjaergaard M, Linse S, Knowles TPJ.
2020. Identification of on- and off-pathway oligomers in amyloid fibril formation.
Chemical Science. 11(24), 6236–6247.
mla: Dear, Alexander J., et al. “Identification of On- and off-Pathway Oligomers
in Amyloid Fibril Formation.” Chemical Science, vol. 11, no. 24, Royal
Society of Chemistry, 2020, pp. 6236–47, doi:10.1039/c9sc06501f.
short: A.J. Dear, G. Meisl, A. Šarić, T.C.T. Michaels, M. Kjaergaard, S. Linse,
T.P.J. Knowles, Chemical Science 11 (2020) 6236–6247.
date_created: 2021-11-26T09:08:19Z
date_published: 2020-06-08T00:00:00Z
date_updated: 2021-11-26T11:21:20Z
day: '08'
doi: 10.1039/c9sc06501f
extern: '1'
external_id:
pmid:
- '32953019'
intvolume: ' 11'
issue: '24'
keyword:
- general chemistry
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/3.0/
main_file_link:
- open_access: '1'
url: https://pubs.rsc.org/en/content/articlehtml/2020/sc/c9sc06501f
month: '06'
oa: 1
oa_version: Published Version
page: 6236-6247
pmid: 1
publication: Chemical Science
publication_identifier:
eissn:
- 2041-6539
issn:
- 2041-6520
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Identification of on- and off-pathway oligomers in amyloid fibril formation
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/3.0/legalcode
name: Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
short: CC BY-NC (3.0)
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 11
year: '2020'
...
---
_id: '10351'
abstract:
- lang: eng
text: Oligomeric species populated during the aggregation of the Aβ42 peptide have
been identified as potent cytotoxins linked to Alzheimer’s disease, but the fundamental
molecular pathways that control their dynamics have yet to be elucidated. By developing
a general approach that combines theory, experiment and simulation, we reveal,
in molecular detail, the mechanisms of Aβ42 oligomer dynamics during amyloid fibril
formation. Even though all mature amyloid fibrils must originate as oligomers,
we found that most Aβ42 oligomers dissociate into their monomeric precursors without
forming new fibrils. Only a minority of oligomers converts into fibrillar structures.
Moreover, the heterogeneous ensemble of oligomeric species interconverts on timescales
comparable to those of aggregation. Our results identify fundamentally new steps
that could be targeted by therapeutic interventions designed to combat protein
misfolding diseases.
acknowledgement: We acknowledge support from Peterhouse (T.C.T.M.), the Swiss National
Science foundation (T.C.T.M.), the Royal Society (A.Š.), the Academy of Medical
Sciences (A.Š.), the UCL Institute for the Physics of Living Systems (S.C.), Sidney
Sussex College (G.M.), the Wellcome Trust (A.Š., M.V., C.M.D. and T.P.J.K.), the
Schiff Foundation (A.J.D.), the Cambridge Centre for Misfolding Diseases (M.V.,
C.M.D. and T.P.J.K.), the BBSRC (C.M.D. and T.P.J.K.), the Frances and Augustus
Newman Foundation (T.P.J.K.), the Swedish Research Council (S.L.) and the ERC grant
MAMBA (S.L., agreement no. 340890). The research that led to these results received
funding from the European Research Council under the European Union’s Seventh Framework
Programme (FP7/2007-2013) through the ERC grant PhysProt (agreement no. 337969).
article_processing_charge: No
article_type: original
author:
- first_name: Thomas C. T.
full_name: Michaels, Thomas C. T.
last_name: Michaels
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Samo
full_name: Curk, Samo
last_name: Curk
- first_name: Katja
full_name: Bernfur, Katja
last_name: Bernfur
- first_name: Paolo
full_name: Arosio, Paolo
last_name: Arosio
- first_name: Georg
full_name: Meisl, Georg
last_name: Meisl
- first_name: Alexander J.
full_name: Dear, Alexander J.
last_name: Dear
- first_name: Samuel I. A.
full_name: Cohen, Samuel I. A.
last_name: Cohen
- first_name: Christopher M.
full_name: Dobson, Christopher M.
last_name: Dobson
- first_name: Michele
full_name: Vendruscolo, Michele
last_name: Vendruscolo
- first_name: Sara
full_name: Linse, Sara
last_name: Linse
- first_name: Tuomas P. J.
full_name: Knowles, Tuomas P. J.
last_name: Knowles
citation:
ama: Michaels TCT, Šarić A, Curk S, et al. Dynamics of oligomer populations formed
during the aggregation of Alzheimer’s Aβ42 peptide. Nature Chemistry. 2020;12(5):445-451.
doi:10.1038/s41557-020-0452-1
apa: Michaels, T. C. T., Šarić, A., Curk, S., Bernfur, K., Arosio, P., Meisl, G.,
… Knowles, T. P. J. (2020). Dynamics of oligomer populations formed during the
aggregation of Alzheimer’s Aβ42 peptide. Nature Chemistry. Springer Nature.
https://doi.org/10.1038/s41557-020-0452-1
chicago: Michaels, Thomas C. T., Anđela Šarić, Samo Curk, Katja Bernfur, Paolo Arosio,
Georg Meisl, Alexander J. Dear, et al. “Dynamics of Oligomer Populations Formed
during the Aggregation of Alzheimer’s Aβ42 Peptide.” Nature Chemistry.
Springer Nature, 2020. https://doi.org/10.1038/s41557-020-0452-1.
ieee: T. C. T. Michaels et al., “Dynamics of oligomer populations formed
during the aggregation of Alzheimer’s Aβ42 peptide,” Nature Chemistry,
vol. 12, no. 5. Springer Nature, pp. 445–451, 2020.
ista: Michaels TCT, Šarić A, Curk S, Bernfur K, Arosio P, Meisl G, Dear AJ, Cohen
SIA, Dobson CM, Vendruscolo M, Linse S, Knowles TPJ. 2020. Dynamics of oligomer
populations formed during the aggregation of Alzheimer’s Aβ42 peptide. Nature
Chemistry. 12(5), 445–451.
mla: Michaels, Thomas C. T., et al. “Dynamics of Oligomer Populations Formed during
the Aggregation of Alzheimer’s Aβ42 Peptide.” Nature Chemistry, vol. 12,
no. 5, Springer Nature, 2020, pp. 445–51, doi:10.1038/s41557-020-0452-1.
short: T.C.T. Michaels, A. Šarić, S. Curk, K. Bernfur, P. Arosio, G. Meisl, A.J.
Dear, S.I.A. Cohen, C.M. Dobson, M. Vendruscolo, S. Linse, T.P.J. Knowles, Nature
Chemistry 12 (2020) 445–451.
date_created: 2021-11-26T09:15:13Z
date_published: 2020-04-13T00:00:00Z
date_updated: 2021-11-26T11:21:08Z
day: '13'
doi: 10.1038/s41557-020-0452-1
extern: '1'
external_id:
pmid:
- '32303714'
intvolume: ' 12'
issue: '5'
keyword:
- general chemical engineering
- general chemistry
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/2020.01.08.897488
month: '04'
oa: 1
oa_version: None
page: 445-451
pmid: 1
publication: Nature Chemistry
publication_identifier:
eissn:
- 1755-4349
issn:
- 1755-4330
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1038/s41557-020-0468-6
scopus_import: '1'
status: public
title: Dynamics of oligomer populations formed during the aggregation of Alzheimer’s
Aβ42 peptide
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 12
year: '2020'
...
---
_id: '10352'
abstract:
- lang: eng
text: In the nuclear pore complex, intrinsically disordered nuclear pore proteins
(FG Nups) form a selective barrier for transport into and out of the cell nucleus,
in a way that remains poorly understood. The collective FG Nup behavior has long
been conceptualized either as a polymer brush, dominated by entropic and excluded-volume
(repulsive) interactions, or as a hydrogel, dominated by cohesive (attractive)
interactions between FG Nups. Here we compare mesoscale computational simulations
with a wide range of experimental data to demonstrate that FG Nups are at the
crossover point between these two regimes. Specifically, we find that repulsive
and attractive interactions are balanced, resulting in morphologies and dynamics
that are close to those of ideal polymer chains. We demonstrate that this property
of FG Nups yields sufficient cohesion to seal the transport barrier, and yet maintains
fast dynamics at the molecular scale, permitting the rapid polymer rearrangements
needed for transport events.
acknowledgement: We thank Dino Osmanović (MIT), Roy Beck (Tel-Aviv), Larissa Kapinos
(Basel), Roderick Lim (Basel), Ralf Richter (Leeds), and Anton Zilman (Toronto)
for discussions. This work was funded by the Royal Society (A.Š.) and the UK Engineering
and Physical Sciences Research Council (EP/L504889/1, B.W.H.).
article_number: '022420'
article_processing_charge: No
article_type: original
author:
- first_name: Luke K.
full_name: Davis, Luke K.
last_name: Davis
- first_name: Ian J.
full_name: Ford, Ian J.
last_name: Ford
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Bart W.
full_name: Hoogenboom, Bart W.
last_name: Hoogenboom
citation:
ama: Davis LK, Ford IJ, Šarić A, Hoogenboom BW. Intrinsically disordered nuclear
pore proteins show ideal-polymer morphologies and dynamics. Physical Review
E. 2020;101(2). doi:10.1103/physreve.101.022420
apa: Davis, L. K., Ford, I. J., Šarić, A., & Hoogenboom, B. W. (2020). Intrinsically
disordered nuclear pore proteins show ideal-polymer morphologies and dynamics.
Physical Review E. American Physical Society. https://doi.org/10.1103/physreve.101.022420
chicago: Davis, Luke K., Ian J. Ford, Anđela Šarić, and Bart W. Hoogenboom. “Intrinsically
Disordered Nuclear Pore Proteins Show Ideal-Polymer Morphologies and Dynamics.”
Physical Review E. American Physical Society, 2020. https://doi.org/10.1103/physreve.101.022420.
ieee: L. K. Davis, I. J. Ford, A. Šarić, and B. W. Hoogenboom, “Intrinsically disordered
nuclear pore proteins show ideal-polymer morphologies and dynamics,” Physical
Review E, vol. 101, no. 2. American Physical Society, 2020.
ista: Davis LK, Ford IJ, Šarić A, Hoogenboom BW. 2020. Intrinsically disordered
nuclear pore proteins show ideal-polymer morphologies and dynamics. Physical Review
E. 101(2), 022420.
mla: Davis, Luke K., et al. “Intrinsically Disordered Nuclear Pore Proteins Show
Ideal-Polymer Morphologies and Dynamics.” Physical Review E, vol. 101,
no. 2, 022420, American Physical Society, 2020, doi:10.1103/physreve.101.022420.
short: L.K. Davis, I.J. Ford, A. Šarić, B.W. Hoogenboom, Physical Review E 101 (2020).
date_created: 2021-11-26T09:41:04Z
date_published: 2020-02-28T00:00:00Z
date_updated: 2021-11-26T11:21:16Z
day: '28'
doi: 10.1103/physreve.101.022420
extern: '1'
external_id:
pmid:
- '32168597'
intvolume: ' 101'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/571687
month: '02'
oa: 1
oa_version: Preprint
pmid: 1
publication: Physical Review E
publication_identifier:
eissn:
- 2470-0053
issn:
- 2470-0045
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intrinsically disordered nuclear pore proteins show ideal-polymer morphologies
and dynamics
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 101
year: '2020'
...
---
_id: '10353'
abstract:
- lang: eng
text: Experiments have suggested that bacterial mechanosensitive channels separate
into 2D clusters, the role of which is unclear. By developing a coarse-grained
computer model we find that clustering promotes the channel closure, which is
highly dependent on the channel concentration and membrane stress. This behaviour
yields a tightly regulated gating system, whereby at high tensions channels gate
individually, and at lower tensions the channels spontaneously aggregate and inactivate.
We implement this positive feedback into the model for cell volume regulation,
and find that the channel clustering protects the cell against excessive loss
of cytoplasmic content.
acknowledgement: We thank Samantha Miller, Bert Poolman, and the members of Šarić
and Pilizota laboratories for useful discussion. We acknowledge support from the
Engineering and Physical Sciences Research Council (A.P. and A.Š.), the UCL Institute
for the Physics of Living Systems (A.P. and A.Š.), Darwin Trust of University of
Edinburgh (H.S.), Industrial Biotechnology Innovation Centre (H.S. and T.P.), BBSRC
Council Crossing Biological Membrane Network (H.S. and T.P.), BBSRC/EPSRC/MRC Synthetic
Biology Research Centre (T.P.), and the Royal Society (A.Š.).
article_number: '048102'
article_processing_charge: No
article_type: original
author:
- first_name: Alexandru
full_name: Paraschiv, Alexandru
last_name: Paraschiv
- first_name: Smitha
full_name: Hegde, Smitha
last_name: Hegde
- first_name: Raman
full_name: Ganti, Raman
last_name: Ganti
- first_name: Teuta
full_name: Pilizota, Teuta
last_name: Pilizota
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
citation:
ama: Paraschiv A, Hegde S, Ganti R, Pilizota T, Šarić A. Dynamic clustering regulates
activity of mechanosensitive membrane channels. Physical Review Letters.
2020;124(4). doi:10.1103/physrevlett.124.048102
apa: Paraschiv, A., Hegde, S., Ganti, R., Pilizota, T., & Šarić, A. (2020).
Dynamic clustering regulates activity of mechanosensitive membrane channels. Physical
Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.124.048102
chicago: Paraschiv, Alexandru, Smitha Hegde, Raman Ganti, Teuta Pilizota, and Anđela
Šarić. “Dynamic Clustering Regulates Activity of Mechanosensitive Membrane Channels.”
Physical Review Letters. American Physical Society, 2020. https://doi.org/10.1103/physrevlett.124.048102.
ieee: A. Paraschiv, S. Hegde, R. Ganti, T. Pilizota, and A. Šarić, “Dynamic clustering
regulates activity of mechanosensitive membrane channels,” Physical Review
Letters, vol. 124, no. 4. American Physical Society, 2020.
ista: Paraschiv A, Hegde S, Ganti R, Pilizota T, Šarić A. 2020. Dynamic clustering
regulates activity of mechanosensitive membrane channels. Physical Review Letters.
124(4), 048102.
mla: Paraschiv, Alexandru, et al. “Dynamic Clustering Regulates Activity of Mechanosensitive
Membrane Channels.” Physical Review Letters, vol. 124, no. 4, 048102, American
Physical Society, 2020, doi:10.1103/physrevlett.124.048102.
short: A. Paraschiv, S. Hegde, R. Ganti, T. Pilizota, A. Šarić, Physical Review
Letters 124 (2020).
date_created: 2021-11-26T09:57:01Z
date_published: 2020-01-31T00:00:00Z
date_updated: 2021-11-26T11:21:12Z
day: '31'
doi: 10.1103/physrevlett.124.048102
extern: '1'
external_id:
pmid:
- '32058787'
intvolume: ' 124'
issue: '4'
keyword:
- general physics and astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/553248
month: '01'
oa: 1
oa_version: Preprint
pmid: 1
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic clustering regulates activity of mechanosensitive membrane channels
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 124
year: '2020'
...
---
_id: '10556'
abstract:
- lang: eng
text: In this paper, we present the first Asynchronous Distributed Key Generation
(ADKG) algorithm which is also the first distributed key generation algorithm
that can generate cryptographic keys with a dual (f,2f+1)-threshold (where f is
the number of faulty parties). As a result, using our ADKG we remove the trusted
setup assumption that the most scalable consensus algorithms make. In order to
create a DKG with a dual (f,2f+1)- threshold we first answer in the affirmative
the open question posed by Cachin et al. [7] on how to create an Asynchronous
Verifiable Secret Sharing (AVSS) protocol with a reconstruction threshold of f+1Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications
Security. Association for Computing Machinery; 2020:1751–1767. doi:10.1145/3372297.3423364'
apa: 'Kokoris Kogias, E., Malkhi, D., & Spiegelman, A. (2020). Asynchronous
distributed key generation for computationally-secure randomness, consensus, and
threshold signatures. In Proceedings of the 2020 ACM SIGSAC Conference on Computer
and Communications Security (pp. 1751–1767). Virtual, United States: Association
for Computing Machinery. https://doi.org/10.1145/3372297.3423364'
chicago: Kokoris Kogias, Eleftherios, Dahlia Malkhi, and Alexander Spiegelman. “Asynchronous
Distributed Key Generation for Computationally-Secure Randomness, Consensus, and
Threshold Signatures.” In Proceedings of the 2020 ACM SIGSAC Conference on
Computer and Communications Security, 1751–1767. Association for Computing
Machinery, 2020. https://doi.org/10.1145/3372297.3423364.
ieee: E. Kokoris Kogias, D. Malkhi, and A. Spiegelman, “Asynchronous distributed
key generation for computationally-secure randomness, consensus, and threshold
signatures,” in Proceedings of the 2020 ACM SIGSAC Conference on Computer and
Communications Security, Virtual, United States, 2020, pp. 1751–1767.
ista: 'Kokoris Kogias E, Malkhi D, Spiegelman A. 2020. Asynchronous distributed
key generation for computationally-secure randomness, consensus, and threshold
signatures. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications
Security. CCS: Computer and Communications Security, 1751–1767.'
mla: Kokoris Kogias, Eleftherios, et al. “Asynchronous Distributed Key Generation
for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” Proceedings
of the 2020 ACM SIGSAC Conference on Computer and Communications Security,
Association for Computing Machinery, 2020, pp. 1751–1767, doi:10.1145/3372297.3423364.
short: E. Kokoris Kogias, D. Malkhi, A. Spiegelman, in:, Proceedings of the 2020
ACM SIGSAC Conference on Computer and Communications Security, Association for
Computing Machinery, 2020, pp. 1751–1767.
conference:
end_date: 2020-11-13
location: Virtual, United States
name: 'CCS: Computer and Communications Security'
start_date: 2020-11-09
date_created: 2021-12-16T13:23:27Z
date_published: 2020-10-30T00:00:00Z
date_updated: 2024-02-22T13:10:45Z
day: '30'
department:
- _id: ElKo
doi: 10.1145/3372297.3423364
external_id:
isi:
- '000768470400104'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/1015
month: '10'
oa: 1
oa_version: Preprint
page: 1751–1767
publication: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications
Security
publication_identifier:
isbn:
- 978-1-4503-7089-9
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Asynchronous distributed key generation for computationally-secure randomness,
consensus, and threshold signatures
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '10557'
abstract:
- lang: eng
text: Data storage and retrieval systems, methods, and computer-readable media utilize
a cryptographically verifiable data structure that facilitates verification of
a transaction in a decentralized peer-to-peer environment using multi-hop backwards
and forwards links. Backward links are cryptographic hashes of past records. Forward
links are cryptographic signatures of future records that are added retroactively
to records once the target block has been appended to the data structure.
applicant:
- Ecole Polytechnique Federale de Lausanne
application_date: 2017-06-09
article_processing_charge: No
author:
- first_name: Bryan
full_name: Ford, Bryan
last_name: Ford
- first_name: Linus
full_name: Gasse, Linus
last_name: Gasse
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
- first_name: Philipp
full_name: Jovanovic, Philipp
last_name: Jovanovic
citation:
ama: Ford B, Gasse L, Kokoris Kogias E, Jovanovic P. Cryptographically verifiable
data structure having multi-hop forward and backwards links and associated systems
and methods. 2020.
apa: Ford, B., Gasse, L., Kokoris Kogias, E., & Jovanovic, P. (2020). Cryptographically
verifiable data structure having multi-hop forward and backwards links and associated
systems and methods.
chicago: Ford, Bryan, Linus Gasse, Eleftherios Kokoris Kogias, and Philipp Jovanovic.
“Cryptographically Verifiable Data Structure Having Multi-Hop Forward and Backwards
Links and Associated Systems and Methods,” 2020.
ieee: B. Ford, L. Gasse, E. Kokoris Kogias, and P. Jovanovic, “Cryptographically
verifiable data structure having multi-hop forward and backwards links and associated
systems and methods.” 2020.
ista: Ford B, Gasse L, Kokoris Kogias E, Jovanovic P. 2020. Cryptographically verifiable
data structure having multi-hop forward and backwards links and associated systems
and methods.
mla: Ford, Bryan, et al. Cryptographically Verifiable Data Structure Having Multi-Hop
Forward and Backwards Links and Associated Systems and Methods. 2020.
short: B. Ford, L. Gasse, E. Kokoris Kogias, P. Jovanovic, (2020).
date_created: 2021-12-16T13:28:59Z
date_published: 2020-03-03T00:00:00Z
date_updated: 2021-12-21T10:04:50Z
day: '03'
department:
- _id: ElKo
extern: '1'
ipc: ' H04L9/3247 ; G06Q20/29 ; G06Q20/382 ; H04L9/3236'
ipn: '10581613'
main_file_link:
- open_access: '1'
url: https://patents.google.com/patent/US10581613B2/en
month: '03'
oa: 1
oa_version: Published Version
publication_date: 2020-03-03
related_material:
link:
- relation: earlier_version
url: https://patents.google.com/patent/US20180359096A1/en
status: public
title: Cryptographically verifiable data structure having multi-hop forward and backwards
links and associated systems and methods
type: patent
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2020'
...
---
_id: '10618'
abstract:
- lang: eng
text: Magnetism typically arises from the joint effect of Fermi statistics and repulsive
Coulomb interactions, which favours ground states with non-zero electron spin.
As a result, controlling spin magnetism with electric fields—a longstanding technological
goal in spintronics and multiferroics1,2—can be achieved only indirectly. Here
we experimentally demonstrate direct electric-field control of magnetic states
in an orbital Chern insulator3,4,5,6, a magnetic system in which non-trivial band
topology favours long-range order of orbital angular momentum but the spins are
thought to remain disordered7,8,9,10,11,12,13,14. We use van der Waals heterostructures
consisting of a graphene monolayer rotationally faulted with respect to a Bernal-stacked
bilayer to realize narrow and topologically non-trivial valley-projected moiré
minibands15,16,17. At fillings of one and three electrons per moiré unit cell
within these bands, we observe quantized anomalous Hall effects18 with transverse
resistance approximately equal to h/2e2 (where h is Planck’s constant and e is
the charge on the electron), which is indicative of spontaneous polarization of
the system into a single-valley-projected band with a Chern number equal to two.
At a filling of three electrons per moiré unit cell, we find that the sign of
the quantum anomalous Hall effect can be reversed via field-effect control of
the chemical potential; moreover, this transition is hysteretic, which we use
to demonstrate non-volatile electric-field-induced reversal of the magnetic state.
A theoretical analysis19 indicates that the effect arises from the topological
edge states, which drive a change in sign of the magnetization and thus a reversal
in the favoured magnetic state. Voltage control of magnetic states can be used
to electrically pattern non-volatile magnetic-domain structures hosting chiral
edge states, with applications ranging from reconfigurable microwave circuit elements
to ultralow-power magnetic memories.
acknowledgement: We acknowledge discussions with J. Checkelsky, S. Chen, C. Dean,
M. Yankowitz, D. Reilly, I. Sodemann and M. Zaletel. Work at UCSB was primarily
supported by the ARO under MURI W911NF-16-1-0361. Measurements of twisted bilayer
graphene (Extended Data Fig. 8) and measurements at elevated temperatures (Extended
Data Fig. 3) were supported by a SEED grant and made use of shared facilities of
the UCSB MRSEC (NSF DMR 1720256), a member of the Materials Research Facilities
Network (www.mrfn.org). A.F.Y. acknowledges the support of the David and Lucille
Packard Foundation under award 2016-65145. A.H.M. and J.Z. were supported by the
National Science Foundation through the Center for Dynamics and Control of Materials,
an NSF MRSEC under Cooperative Agreement number DMR-1720595, and by the Welch Foundation
under grant TBF1473. C.L.T. acknowledges support from the Hertz Foundation and from
the National Science Foundation Graduate Research Fellowship Program under grant
1650114. K.W. and T.T. acknowledge support from the Elemental Strategy Initiative
conducted by the MEXT, Japan, Grant Number JPMXP0112101001, JSPS KAKENHI grant numbers
JP20H00354 and the CREST(JPMJCR15F3), JST.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: J.
full_name: Zhu, J.
last_name: Zhu
- first_name: M. A.
full_name: Kumar, M. A.
last_name: Kumar
- first_name: Y.
full_name: Zhang, Y.
last_name: Zhang
- first_name: F.
full_name: Yang, F.
last_name: Yang
- first_name: C. L.
full_name: Tschirhart, C. L.
last_name: Tschirhart
- first_name: M.
full_name: Serlin, M.
last_name: Serlin
- first_name: K.
full_name: Watanabe, K.
last_name: Watanabe
- first_name: T.
full_name: Taniguchi, T.
last_name: Taniguchi
- first_name: A. H.
full_name: MacDonald, A. H.
last_name: MacDonald
- first_name: A. F.
full_name: Young, A. F.
last_name: Young
citation:
ama: Polshyn H, Zhu J, Kumar MA, et al. Electrical switching of magnetic order in
an orbital Chern insulator. Nature. 2020;588(7836):66-70. doi:10.1038/s41586-020-2963-8
apa: Polshyn, H., Zhu, J., Kumar, M. A., Zhang, Y., Yang, F., Tschirhart, C. L.,
… Young, A. F. (2020). Electrical switching of magnetic order in an orbital Chern
insulator. Nature. Springer Nature. https://doi.org/10.1038/s41586-020-2963-8
chicago: Polshyn, Hryhoriy, J. Zhu, M. A. Kumar, Y. Zhang, F. Yang, C. L. Tschirhart,
M. Serlin, et al. “Electrical Switching of Magnetic Order in an Orbital Chern
Insulator.” Nature. Springer Nature, 2020. https://doi.org/10.1038/s41586-020-2963-8.
ieee: H. Polshyn et al., “Electrical switching of magnetic order in an orbital
Chern insulator,” Nature, vol. 588, no. 7836. Springer Nature, pp. 66–70,
2020.
ista: Polshyn H, Zhu J, Kumar MA, Zhang Y, Yang F, Tschirhart CL, Serlin M, Watanabe
K, Taniguchi T, MacDonald AH, Young AF. 2020. Electrical switching of magnetic
order in an orbital Chern insulator. Nature. 588(7836), 66–70.
mla: Polshyn, Hryhoriy, et al. “Electrical Switching of Magnetic Order in an Orbital
Chern Insulator.” Nature, vol. 588, no. 7836, Springer Nature, 2020, pp.
66–70, doi:10.1038/s41586-020-2963-8.
short: H. Polshyn, J. Zhu, M.A. Kumar, Y. Zhang, F. Yang, C.L. Tschirhart, M. Serlin,
K. Watanabe, T. Taniguchi, A.H. MacDonald, A.F. Young, Nature 588 (2020) 66–70.
date_created: 2022-01-13T14:12:17Z
date_published: 2020-11-23T00:00:00Z
date_updated: 2022-01-13T14:21:04Z
day: '23'
doi: 10.1038/s41586-020-2963-8
extern: '1'
external_id:
arxiv:
- '2004.11353'
pmid:
- '33230333'
intvolume: ' 588'
issue: '7836'
keyword:
- multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2004.11353
month: '11'
oa: 1
oa_version: Preprint
page: 66-70
pmid: 1
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Electrical switching of magnetic order in an orbital Chern insulator
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 588
year: '2020'
...
---
_id: '10650'
abstract:
- lang: eng
text: The understanding of material systems with strong electron-electron interactions
is the central problem in modern condensed matter physics. Despite this, the essential
physics of many of these materials is still not understood and we have no overall
perspective on their properties. Moreover, we have very little ability to make
predictions in this class of systems. In this manuscript we share our personal
views of what the major open problems are in correlated electron systems and we
discuss some possible routes to make progress in this rich and fascinating field.
This manuscript is the result of the vigorous discussions and deliberations that
took place at Johns Hopkins University during a three-day workshop January 27,
28, and 29, 2020 that brought together six senior scientists and 46 more junior
scientists. Our hope, is that the topics we have presented will provide inspiration
for others working in this field and motivation for the idea that significant
progress can be made on very hard problems if we focus our collective energies.
acknowledgement: "We thank NSF CMP program for suggestions regarding the topic and
general structure of the workshop. This project was supported by the NSF DMR-2002329
and The Gordon and Betty Moore Foundation (GBMF) EPiQS initiative. We would like
to sincerely thank A. Kapitulnik, A. J. Leggett, M.B. Maple, T.M. McQueen, M. Norman,
P. S. Riseborough, and G. A. Sawatzky for their lectures at the workshop and advice
on the writing of this manuscript. We would also like to thank G. Blumberg, C. Broholm,
S. Crooker, N. Drichko, and A. Patel for helpful consultation on topics discussed\r\nherein.
A number of individuals also had independent support: (AA, EH; GBMF-4305), (IMH;
GBMF-9071), (HJC; NHMFL is supported by the NSF DMR-1644779 and the state of Florida),
(YH, AZ; Miller Institute for Basic Research in Science), (YC; US DOE-BES DEAC02-06CH11357),
(AS; Spallation Neutron Source, a DOE Office of Science User Facility operated by
ORNL), (SAAG; ARO-W911NF-18-1-0290, NSF DMR-1455233), (YW; DOE-BES DE-SC0019331,
GBMF-4532)."
article_processing_charge: No
arxiv: 1
author:
- first_name: A
full_name: Alexandradinata, A
last_name: Alexandradinata
- first_name: N.P.
full_name: Armitage, N.P.
last_name: Armitage
- first_name: Andrey
full_name: Baydin, Andrey
last_name: Baydin
- first_name: Wenli
full_name: Bi, Wenli
last_name: Bi
- first_name: Yue
full_name: Cao, Yue
last_name: Cao
- first_name: Hitesh J.
full_name: Changlani, Hitesh J.
last_name: Changlani
- first_name: Eli
full_name: Chertkov, Eli
last_name: Chertkov
- first_name: Eduardo H.
full_name: da Silva Neto, Eduardo H.
last_name: da Silva Neto
- first_name: Luca
full_name: Delacretaz, Luca
last_name: Delacretaz
- first_name: Ismail
full_name: El Baggari, Ismail
last_name: El Baggari
- first_name: G.M.
full_name: Ferguson, G.M.
last_name: Ferguson
- first_name: William J.
full_name: Gannon, William J.
last_name: Gannon
- first_name: Sayed Ali Akbar
full_name: Ghorashi, Sayed Ali Akbar
last_name: Ghorashi
- first_name: Berit H.
full_name: Goodge, Berit H.
last_name: Goodge
- first_name: Olga
full_name: Goulko, Olga
last_name: Goulko
- first_name: G.
full_name: Grissonnache, G.
last_name: Grissonnache
- first_name: Alannah
full_name: Hallas, Alannah
last_name: Hallas
- first_name: Ian M.
full_name: Hayes, Ian M.
last_name: Hayes
- first_name: Yu
full_name: He, Yu
last_name: He
- first_name: Edwin W.
full_name: Huang, Edwin W.
last_name: Huang
- first_name: Anshu
full_name: Kogar, Anshu
last_name: Kogar
- first_name: Divine
full_name: Kumah, Divine
last_name: Kumah
- first_name: Jong Yeon
full_name: Lee, Jong Yeon
last_name: Lee
- first_name: A.
full_name: Legros, A.
last_name: Legros
- first_name: Fahad
full_name: Mahmood, Fahad
last_name: Mahmood
- first_name: Yulia
full_name: Maximenko, Yulia
last_name: Maximenko
- first_name: Nick
full_name: Pellatz, Nick
last_name: Pellatz
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Tarapada
full_name: Sarkar, Tarapada
last_name: Sarkar
- first_name: Allen
full_name: Scheie, Allen
last_name: Scheie
- first_name: Kyle L.
full_name: Seyler, Kyle L.
last_name: Seyler
- first_name: Zhenzhong
full_name: Shi, Zhenzhong
last_name: Shi
- first_name: Brian
full_name: Skinner, Brian
last_name: Skinner
- first_name: Lucia
full_name: Steinke, Lucia
last_name: Steinke
- first_name: K.
full_name: Thirunavukkuarasu, K.
last_name: Thirunavukkuarasu
- first_name: Thaís Victa
full_name: Trevisan, Thaís Victa
last_name: Trevisan
- first_name: Michael
full_name: Vogl, Michael
last_name: Vogl
- first_name: Pavel A.
full_name: Volkov, Pavel A.
last_name: Volkov
- first_name: Yao
full_name: Wang, Yao
last_name: Wang
- first_name: Yishu
full_name: Wang, Yishu
last_name: Wang
- first_name: Di
full_name: Wei, Di
last_name: Wei
- first_name: Kaya
full_name: Wei, Kaya
last_name: Wei
- first_name: Shuolong
full_name: Yang, Shuolong
last_name: Yang
- first_name: Xian
full_name: Zhang, Xian
last_name: Zhang
- first_name: Ya-Hui
full_name: Zhang, Ya-Hui
last_name: Zhang
- first_name: Liuyan
full_name: Zhao, Liuyan
last_name: Zhao
- first_name: Alfred
full_name: Zong, Alfred
last_name: Zong
citation:
ama: Alexandradinata A, Armitage NP, Baydin A, et al. The future of the correlated
electron problem. arXiv.
apa: Alexandradinata, A., Armitage, N. P., Baydin, A., Bi, W., Cao, Y., Changlani,
H. J., … Zong, A. (n.d.). The future of the correlated electron problem. arXiv.
chicago: Alexandradinata, A, N.P. Armitage, Andrey Baydin, Wenli Bi, Yue Cao, Hitesh
J. Changlani, Eli Chertkov, et al. “The Future of the Correlated Electron Problem.”
ArXiv, n.d.
ieee: A. Alexandradinata et al., “The future of the correlated electron problem,”
arXiv. .
ista: Alexandradinata A, Armitage NP, Baydin A, Bi W, Cao Y, Changlani HJ, Chertkov
E, da Silva Neto EH, Delacretaz L, El Baggari I, Ferguson GM, Gannon WJ, Ghorashi
SAA, Goodge BH, Goulko O, Grissonnache G, Hallas A, Hayes IM, He Y, Huang EW,
Kogar A, Kumah D, Lee JY, Legros A, Mahmood F, Maximenko Y, Pellatz N, Polshyn
H, Sarkar T, Scheie A, Seyler KL, Shi Z, Skinner B, Steinke L, Thirunavukkuarasu
K, Trevisan TV, Vogl M, Volkov PA, Wang Y, Wang Y, Wei D, Wei K, Yang S, Zhang
X, Zhang Y-H, Zhao L, Zong A. The future of the correlated electron problem. arXiv,
.
mla: Alexandradinata, A., et al. “The Future of the Correlated Electron Problem.”
ArXiv.
short: A. Alexandradinata, N.P. Armitage, A. Baydin, W. Bi, Y. Cao, H.J. Changlani,
E. Chertkov, E.H. da Silva Neto, L. Delacretaz, I. El Baggari, G.M. Ferguson,
W.J. Gannon, S.A.A. Ghorashi, B.H. Goodge, O. Goulko, G. Grissonnache, A. Hallas,
I.M. Hayes, Y. He, E.W. Huang, A. Kogar, D. Kumah, J.Y. Lee, A. Legros, F. Mahmood,
Y. Maximenko, N. Pellatz, H. Polshyn, T. Sarkar, A. Scheie, K.L. Seyler, Z. Shi,
B. Skinner, L. Steinke, K. Thirunavukkuarasu, T.V. Trevisan, M. Vogl, P.A. Volkov,
Y. Wang, Y. Wang, D. Wei, K. Wei, S. Yang, X. Zhang, Y.-H. Zhang, L. Zhao, A.
Zong, ArXiv (n.d.).
date_created: 2022-01-20T10:55:36Z
date_published: 2020-10-01T00:00:00Z
date_updated: 2022-01-24T08:05:51Z
day: '01'
extern: '1'
external_id:
arxiv:
- '2010.00584'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2010.00584
month: '10'
oa: 1
oa_version: Preprint
page: '55'
publication: arXiv
publication_status: submitted
status: public
title: The future of the correlated electron problem
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2020'
...
---
_id: '11816'
abstract:
- lang: eng
text: In recent years, significant advances have been made in the design and analysis
of fully dynamic maximal matching algorithms. However, these theoretical results
have received very little attention from the practical perspective. Few of the
algorithms are implemented and tested on real datasets, and their practical potential
is far from understood. In this paper, we attempt to bridge the gap between theory
and practice that is currently observed for the fully dynamic maximal matching
problem. We engineer several algorithms and empirically study those algorithms
on an extensive set of dynamic instances.
alternative_title:
- LIPIcs
article_number: '58'
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Khan
full_name: Shahbaz, Khan
last_name: Shahbaz
- first_name: Richard
full_name: Paul, Richard
last_name: Paul
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
citation:
ama: 'Henzinger MH, Shahbaz K, Paul R, Schulz C. Dynamic matching algorithms in
practice. In: 8th Annual European Symposium on Algorithms. Vol 173. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.58'
apa: 'Henzinger, M. H., Shahbaz, K., Paul, R., & Schulz, C. (2020). Dynamic
matching algorithms in practice. In 8th Annual European Symposium on Algorithms
(Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.58'
chicago: Henzinger, Monika H, Khan Shahbaz, Richard Paul, and Christian Schulz.
“Dynamic Matching Algorithms in Practice.” In 8th Annual European Symposium
on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020. https://doi.org/10.4230/LIPIcs.ESA.2020.58.
ieee: M. H. Henzinger, K. Shahbaz, R. Paul, and C. Schulz, “Dynamic matching algorithms
in practice,” in 8th Annual European Symposium on Algorithms, Pisa, Italy,
2020, vol. 173.
ista: 'Henzinger MH, Shahbaz K, Paul R, Schulz C. 2020. Dynamic matching algorithms
in practice. 8th Annual European Symposium on Algorithms. ESA: Annual European
Symposium on Algorithms, LIPIcs, vol. 173, 58.'
mla: Henzinger, Monika H., et al. “Dynamic Matching Algorithms in Practice.” 8th
Annual European Symposium on Algorithms, vol. 173, 58, Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.58.
short: M.H. Henzinger, K. Shahbaz, R. Paul, C. Schulz, in:, 8th Annual European
Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-09-09
location: Pisa, Italy
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2020-09-07
date_created: 2022-08-12T07:13:25Z
date_published: 2020-08-26T00:00:00Z
date_updated: 2023-02-14T08:57:55Z
day: '26'
doi: 10.4230/LIPIcs.ESA.2020.58
extern: '1'
external_id:
arxiv:
- '2004.09099'
intvolume: ' 173'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ESA.2020.58
month: '08'
oa: 1
oa_version: Published Version
publication: 8th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959771627'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic matching algorithms in practice
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 173
year: '2020'
...
---
_id: '11818'
abstract:
- lang: eng
text: "With input sizes becoming massive, coresets - small yet representative summary
of the input - are relevant more than ever. A weighted set C_w that is a subset
of the input is an ε-coreset if the cost of any feasible solution S with respect
to C_w is within [1±ε] of the cost of S with respect to the original input. We
give a very general technique to compute coresets in the fully-dynamic setting
where input points can be added or deleted. Given a static (i.e., not dynamic)
ε-coreset-construction algorithm that runs in time t(n, ε, λ) and computes a coreset
of size s(n, ε, λ), where n is the number of input points and 1-λ is the success
probability, we give a fully-dynamic algorithm that computes an ε-coreset with
worst-case update time O((log n) ⋅ t(s(n, ε/log n, λ/n), ε/log n, λ/n)) (this
bound is stated informally), where the success probability is 1-λ. Our technique
is a fully-dynamic analog of the merge-and-reduce technique, which is due to Har-Peled
and Mazumdar [Har-Peled and Mazumdar, 2004] and is based on a technique of Bentley
and Saxe [Jon Louis Bentley and James B. Saxe, 1980], that applies to the insertion-only
setting where points can only be added. Although, our space usage is O(n), our
technique works in the presence of an adaptive adversary, and we show that Ω(n)
space is required when adversary is adaptive.\r\nAs a concrete implication of
our technique, using the result of Braverman et al. [{Braverman} et al., 2016],
we get fully-dynamic ε-coreset-construction algorithms for k-median and k-means
with worst-case update time O(ε^{-2} k² log⁵ n log³ k) and coreset size O(ε^{-2}
k log n log² k) ignoring log log n and log(1/ε) factors and assuming that ε =
Ω(1/poly(n)) and λ = Ω(1/poly(n)) (which are very weak assumptions made only to
make these bounds easy to parse). This results in the first fully-dynamic constant-approximation
algorithms for k-median and k-means with update times O(poly(k, log n, ε^{-1})).
Specifically, the dependence on k is only quadratic, and the bounds are worst-case.
The best previous bound for both problems was amortized O(nlog n) by Cohen-Addad
et al. [Cohen-Addad et al., 2019] via randomized O(1)-coresets in O(n) space.\r\nWe
also show that under the OMv conjecture [Monika Henzinger et al., 2015], a fully-dynamic
(4 - δ)-approximation algorithm for k-means must either have an amortized update
time of Ω(k^{1-γ}) or amortized query time of Ω(k^{2 - γ}), where γ > 0 is a constant."
alternative_title:
- LIPIcs
article_number: '57'
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sagar
full_name: Kale, Sagar
last_name: Kale
citation:
ama: 'Henzinger MH, Kale S. Fully-dynamic coresets. In: 28th Annual European
Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2020. doi:10.4230/LIPIcs.ESA.2020.57'
apa: 'Henzinger, M. H., & Kale, S. (2020). Fully-dynamic coresets. In 28th
Annual European Symposium on Algorithms (Vol. 173). Pisa, Italy: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.57'
chicago: Henzinger, Monika H, and Sagar Kale. “Fully-Dynamic Coresets.” In 28th
Annual European Symposium on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ESA.2020.57.
ieee: M. H. Henzinger and S. Kale, “Fully-dynamic coresets,” in 28th Annual European
Symposium on Algorithms, Pisa, Italy, 2020, vol. 173.
ista: 'Henzinger MH, Kale S. 2020. Fully-dynamic coresets. 28th Annual European
Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs,
vol. 173, 57.'
mla: Henzinger, Monika H., and Sagar Kale. “Fully-Dynamic Coresets.” 28th Annual
European Symposium on Algorithms, vol. 173, 57, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.57.
short: M.H. Henzinger, S. Kale, in:, 28th Annual European Symposium on Algorithms,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-09-09
location: Pisa, Italy
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2020-09-07
date_created: 2022-08-12T07:22:55Z
date_published: 2020-08-26T00:00:00Z
date_updated: 2023-02-14T09:29:51Z
day: '26'
doi: 10.4230/LIPIcs.ESA.2020.57
extern: '1'
external_id:
arxiv:
- '2004.14891'
intvolume: ' 173'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ESA.2020.57
month: '08'
oa: 1
oa_version: Published Version
publication: 28th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959771627'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fully-dynamic coresets
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 173
year: '2020'
...
---
_id: '11819'
abstract:
- lang: eng
text: We present a practically efficient algorithm that finds all global minimum
cuts in huge undirected graphs. Our algorithm uses a multitude of kernelization
rules to reduce the graph to a small equivalent instance and then finds all minimum
cuts using an optimized version of the algorithm of Nagamochi, Nakao and Ibaraki.
In shared memory we are able to find all minimum cuts of graphs with up to billions
of edges and millions of minimum cuts in a few minutes. We also give a new linear
time algorithm to find the most balanced minimum cuts given as input the representation
of all minimum cuts.
alternative_title:
- LIPIcs
article_number: '59'
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Noe, Alexander
last_name: Noe
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
- first_name: Darren
full_name: Strash, Darren
last_name: Strash
citation:
ama: 'Henzinger MH, Noe A, Schulz C, Strash D. Finding all global minimum cuts in
practice. In: 28th Annual European Symposium on Algorithms. Vol 173. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.59'
apa: 'Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2020). Finding all
global minimum cuts in practice. In 28th Annual European Symposium on Algorithms
(Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.59'
chicago: Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash.
“Finding All Global Minimum Cuts in Practice.” In 28th Annual European Symposium
on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020. https://doi.org/10.4230/LIPIcs.ESA.2020.59.
ieee: M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Finding all global minimum
cuts in practice,” in 28th Annual European Symposium on Algorithms, Pisa,
Italy, 2020, vol. 173.
ista: 'Henzinger MH, Noe A, Schulz C, Strash D. 2020. Finding all global minimum
cuts in practice. 28th Annual European Symposium on Algorithms. ESA: Annual European
Symposium on Algorithms, LIPIcs, vol. 173, 59.'
mla: Henzinger, Monika H., et al. “Finding All Global Minimum Cuts in Practice.”
28th Annual European Symposium on Algorithms, vol. 173, 59, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.59.
short: M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 28th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-09-09
location: Pisa, Italy
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2020-09-07
date_created: 2022-08-12T07:27:42Z
date_published: 2020-08-26T00:00:00Z
date_updated: 2023-02-14T09:39:18Z
day: '26'
doi: 10.4230/LIPIcs.ESA.2020.59
extern: '1'
external_id:
arxiv:
- '2002.06948'
intvolume: ' 173'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ESA.2020.59
month: '08'
oa: 1
oa_version: Published Version
publication: 28th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959771627'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finding all global minimum cuts in practice
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 173
year: '2020'
...
---
_id: '11822'
abstract:
- lang: eng
text: "The fully dynamic transitive closure problem asks to maintain reachability
information in a directed graph between arbitrary pairs of vertices, while the
graph undergoes a sequence of edge insertions and deletions. The problem has been
thoroughly investigated in theory and many specialized algorithms for solving
it have been proposed in the last decades. In two large studies [Frigioni ea,
2001; Krommidas and Zaroliagis, 2008], a number of these algorithms have been
evaluated experimentally against simple, static algorithms for graph traversal,
showing the competitiveness and even superiority of the simple algorithms in practice,
except for very dense random graphs or very high ratios of queries. A major drawback
of those studies is that only small and mostly randomly generated graphs are considered.\r\nIn
this paper, we engineer new algorithms to maintain all-pairs reachability information
which are simple and space-efficient. Moreover, we perform an extensive experimental
evaluation on both generated and real-world instances that are several orders
of magnitude larger than those in the previous studies. Our results indicate that
our new algorithms outperform all state-of-the-art algorithms on all types of
input considerably in practice."
alternative_title:
- LIPIcs
article_number: '14'
article_processing_charge: No
arxiv: 1
author:
- first_name: Kathrin
full_name: Hanauer, Kathrin
last_name: Hanauer
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
citation:
ama: 'Hanauer K, Henzinger MH, Schulz C. Faster fully dynamic transitive closure
in practice. In: 18th International Symposium on Experimental Algorithms.
Vol 160. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SEA.2020.14'
apa: 'Hanauer, K., Henzinger, M. H., & Schulz, C. (2020). Faster fully dynamic
transitive closure in practice. In 18th International Symposium on Experimental
Algorithms (Vol. 160). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für
Informatik. https://doi.org/10.4230/LIPIcs.SEA.2020.14'
chicago: Hanauer, Kathrin, Monika H Henzinger, and Christian Schulz. “Faster Fully
Dynamic Transitive Closure in Practice.” In 18th International Symposium on
Experimental Algorithms, Vol. 160. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2020. https://doi.org/10.4230/LIPIcs.SEA.2020.14.
ieee: K. Hanauer, M. H. Henzinger, and C. Schulz, “Faster fully dynamic transitive
closure in practice,” in 18th International Symposium on Experimental Algorithms,
Pisa, Italy, 2020, vol. 160.
ista: 'Hanauer K, Henzinger MH, Schulz C. 2020. Faster fully dynamic transitive
closure in practice. 18th International Symposium on Experimental Algorithms.
SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 160, 14.'
mla: Hanauer, Kathrin, et al. “Faster Fully Dynamic Transitive Closure in Practice.”
18th International Symposium on Experimental Algorithms, vol. 160, 14,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SEA.2020.14.
short: K. Hanauer, M.H. Henzinger, C. Schulz, in:, 18th International Symposium
on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020.
conference:
end_date: 2020-09-09
location: Pisa, Italy
name: 'SEA: Symposium on Experimental Algorithms'
start_date: 2020-09-07
date_created: 2022-08-12T07:32:53Z
date_published: 2020-06-12T00:00:00Z
date_updated: 2023-02-14T09:58:42Z
day: '12'
doi: 10.4230/LIPIcs.SEA.2020.14
extern: '1'
external_id:
arxiv:
- '2002.00813'
intvolume: ' 160'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.SEA.2020.14
month: '06'
oa: 1
oa_version: Published Version
publication: 18th International Symposium on Experimental Algorithms
publication_identifier:
isbn:
- '9783959771481'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster fully dynamic transitive closure in practice
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 160
year: '2020'
...
---
_id: '11824'
abstract:
- lang: eng
text: "Independent set is a fundamental problem in combinatorial optimization. While
in general graphs the problem is essentially inapproximable, for many important
graph classes there are approximation algorithms known in the offline setting.
These graph classes include interval graphs and geometric intersection graphs,
where vertices correspond to intervals/geometric objects and an edge indicates
that the two corresponding objects intersect.\r\nWe present dynamic approximation
algorithms for independent set of intervals, hypercubes and hyperrectangles in
d dimensions. They work in the fully dynamic model where each update inserts or
deletes a geometric object. All our algorithms are deterministic and have worst-case
update times that are polylogarithmic for constant d and ε>0, assuming that the
coordinates of all input objects are in [0, N]^d and each of their edges has length
at least 1. We obtain the following results:\r\n- For weighted intervals, we maintain
a (1+ε)-approximate solution.\r\n- For d-dimensional hypercubes we maintain a
(1+ε)2^d-approximate solution in the unweighted case and a O(2^d)-approximate
solution in the weighted case. Also, we show that for maintaining an unweighted
(1+ε)-approximate solution one needs polynomial update time for d ≥ 2 if the ETH
holds.\r\n- For weighted d-dimensional hyperrectangles we present a dynamic algorithm
with approximation ratio (1+ε)log^{d-1}N."
alternative_title:
- LIPIcs
article_number: '51'
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Stefan
full_name: Neumann, Stefan
last_name: Neumann
- first_name: Andreas
full_name: Wiese, Andreas
last_name: Wiese
citation:
ama: 'Henzinger MH, Neumann S, Wiese A. Dynamic approximate maximum independent
set of intervals, hypercubes and hyperrectangles. In: 36th International Symposium
on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.51'
apa: 'Henzinger, M. H., Neumann, S., & Wiese, A. (2020). Dynamic approximate
maximum independent set of intervals, hypercubes and hyperrectangles. In 36th
International Symposium on Computational Geometry (Vol. 164). Zurich, Switzerland:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.51'
chicago: Henzinger, Monika H, Stefan Neumann, and Andreas Wiese. “Dynamic Approximate
Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.” In 36th
International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.51.
ieee: M. H. Henzinger, S. Neumann, and A. Wiese, “Dynamic approximate maximum independent
set of intervals, hypercubes and hyperrectangles,” in 36th International Symposium
on Computational Geometry, Zurich, Switzerland, 2020, vol. 164.
ista: 'Henzinger MH, Neumann S, Wiese A. 2020. Dynamic approximate maximum independent
set of intervals, hypercubes and hyperrectangles. 36th International Symposium
on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs,
vol. 164, 51.'
mla: Henzinger, Monika H., et al. “Dynamic Approximate Maximum Independent Set of
Intervals, Hypercubes and Hyperrectangles.” 36th International Symposium on
Computational Geometry, vol. 164, 51, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.51.
short: M.H. Henzinger, S. Neumann, A. Wiese, in:, 36th International Symposium on
Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-06-26
location: Zurich, Switzerland
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2020-06-23
date_created: 2022-08-12T07:46:44Z
date_published: 2020-06-08T00:00:00Z
date_updated: 2023-02-14T10:00:58Z
day: '08'
doi: 10.4230/LIPIcs.SoCG.2020.51
extern: '1'
external_id:
arxiv:
- '2003.02605'
intvolume: ' 164'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.SoCG.2020.51
month: '06'
oa: 1
oa_version: Published Version
publication: 36th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771436'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 164
year: '2020'
...
---
_id: '11825'
abstract:
- lang: eng
text: We give a fully dynamic (Las-Vegas style) algorithm with constant expected
amortized time per update that maintains a proper (Δ+1)-vertex coloring of a graph
with maximum degree at most Δ. This improves upon the previous O(log Δ)-time algorithm
by Bhattacharya et al. (SODA 2018). Our algorithm uses an approach based on assigning
random ranks to vertices and does not need to maintain a hierarchical graph decomposition.
We show that our result does not only have optimal running time, but is also optimal
in the sense that already deciding whether a Δ-coloring exists in a dynamically
changing graph with maximum degree at most Δ takes Ω(log n) time per operation.
alternative_title:
- LIPIcs
article_number: '53'
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Pan
full_name: Peng, Pan
last_name: Peng
citation:
ama: 'Henzinger MH, Peng P. Constant-time dynamic (Δ+1)-coloring. In: 37th International
Symposium on Theoretical Aspects of Computer Science. Vol 154. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.STACS.2020.53'
apa: 'Henzinger, M. H., & Peng, P. (2020). Constant-time dynamic (Δ+1)-coloring.
In 37th International Symposium on Theoretical Aspects of Computer Science
(Vol. 154). Montpellier, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.STACS.2020.53'
chicago: Henzinger, Monika H, and Pan Peng. “Constant-Time Dynamic (Δ+1)-Coloring.”
In 37th International Symposium on Theoretical Aspects of Computer Science,
Vol. 154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.STACS.2020.53.
ieee: M. H. Henzinger and P. Peng, “Constant-time dynamic (Δ+1)-coloring,” in 37th
International Symposium on Theoretical Aspects of Computer Science, Montpellier,
France, 2020, vol. 154.
ista: 'Henzinger MH, Peng P. 2020. Constant-time dynamic (Δ+1)-coloring. 37th International
Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical
Aspects of Computer Science, LIPIcs, vol. 154, 53.'
mla: Henzinger, Monika H., and Pan Peng. “Constant-Time Dynamic (Δ+1)-Coloring.”
37th International Symposium on Theoretical Aspects of Computer Science,
vol. 154, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.STACS.2020.53.
short: M.H. Henzinger, P. Peng, in:, 37th International Symposium on Theoretical
Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020.
conference:
end_date: 2020-03-13
location: Montpellier, France
name: 'STACS: Symposium on Theoretical Aspects of Computer Science'
start_date: 2020-03-10
date_created: 2022-08-12T07:53:05Z
date_published: 2020-03-04T00:00:00Z
date_updated: 2023-02-14T10:03:43Z
day: '04'
doi: 10.4230/LIPIcs.STACS.2020.53
extern: '1'
external_id:
arxiv:
- '1907.04745'
intvolume: ' 154'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.STACS.2020.53
month: '03'
oa: 1
oa_version: Published Version
publication: 37th International Symposium on Theoretical Aspects of Computer Science
publication_identifier:
isbn:
- '9783959771405'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Constant-time dynamic (Δ+1)-coloring
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 154
year: '2020'
...
---
_id: '11852'
abstract:
- lang: eng
text: We present a general framework of designing efficient dynamic approximate
algorithms for optimization problems on undirected graphs. In particular, we develop
a technique that, given any problem that admits a certain notion of vertex sparsifiers,
gives data structures that maintain approximate solutions in sub-linear update
and query time. We illustrate the applicability of our paradigm to the following
problems. (1)A fully-dynamic algorithm that approximates all-pair maximum-flows/minimum-cuts
up to a nearly logarithmic factor in O~(n2/3) 11The O~(⋅) notation is used in
this paper to hide poly-logarithmic factors. amortized time against an oblivious
adversary, and O~(m3/4) time against an adaptive adversary. (2)An incremental
data structure that maintains O(1) - approximate shortest path in no(1) time per
operation, as well as fully dynamic approximate all-pair shortest path and transshipment
in O~(n2/3+o(1)) amortized time per operation. (3)A fully-dynamic algorithm that
approximates all-pair effective resistance up to an (1+ϵ) factor in O~(n2/3+o(1)ϵ−O(1))
amortized update time per operation. The key tool behind result (1) is the dynamic
maintenance of an algorithmic construction due to Madry [FOCS' 10], which partitions
a graph into a collection of simpler graph structures (known as j-trees) and approximately
captures the cut-flow and metric structure of the graph. The O(1)-approximation
guarantee of (2) is by adapting the distance oracles by [Thorup-Zwick JACM '05].
Result (3) is obtained by invoking the random-walk based spectral vertex sparsifier
by [Durfee et al. STOC '19] in a hierarchical manner, while carefully keeping
track of the recourse among levels in the hierarchy. See https://arxiv.org/pdf/2005.02368.pdf
for the full version of this paper.
article_processing_charge: No
arxiv: 1
author:
- first_name: Li
full_name: Chen, Li
last_name: Chen
- first_name: Gramoz
full_name: Goranci, Gramoz
last_name: Goranci
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Richard
full_name: Peng, Richard
last_name: Peng
- first_name: Thatchaphol
full_name: Saranurak, Thatchaphol
last_name: Saranurak
citation:
ama: 'Chen L, Goranci G, Henzinger MH, Peng R, Saranurak T. Fast dynamic cuts, distances
and effective resistances via vertex sparsifiers. In: 61st Annual Symposium
on Foundations of Computer Science. Institute of Electrical and Electronics
Engineers; 2020:1135-1146. doi:10.1109/focs46700.2020.00109'
apa: 'Chen, L., Goranci, G., Henzinger, M. H., Peng, R., & Saranurak, T. (2020).
Fast dynamic cuts, distances and effective resistances via vertex sparsifiers.
In 61st Annual Symposium on Foundations of Computer Science (pp. 1135–1146).
Durham, NC, United States: Institute of Electrical and Electronics Engineers.
https://doi.org/10.1109/focs46700.2020.00109'
chicago: Chen, Li, Gramoz Goranci, Monika H Henzinger, Richard Peng, and Thatchaphol
Saranurak. “Fast Dynamic Cuts, Distances and Effective Resistances via Vertex
Sparsifiers.” In 61st Annual Symposium on Foundations of Computer Science,
1135–46. Institute of Electrical and Electronics Engineers, 2020. https://doi.org/10.1109/focs46700.2020.00109.
ieee: L. Chen, G. Goranci, M. H. Henzinger, R. Peng, and T. Saranurak, “Fast dynamic
cuts, distances and effective resistances via vertex sparsifiers,” in 61st
Annual Symposium on Foundations of Computer Science, Durham, NC, United States,
2020, pp. 1135–1146.
ista: 'Chen L, Goranci G, Henzinger MH, Peng R, Saranurak T. 2020. Fast dynamic
cuts, distances and effective resistances via vertex sparsifiers. 61st Annual
Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations
of Computer Science, 1135–1146.'
mla: Chen, Li, et al. “Fast Dynamic Cuts, Distances and Effective Resistances via
Vertex Sparsifiers.” 61st Annual Symposium on Foundations of Computer Science,
Institute of Electrical and Electronics Engineers, 2020, pp. 1135–46, doi:10.1109/focs46700.2020.00109.
short: L. Chen, G. Goranci, M.H. Henzinger, R. Peng, T. Saranurak, in:, 61st Annual
Symposium on Foundations of Computer Science, Institute of Electrical and Electronics
Engineers, 2020, pp. 1135–1146.
conference:
end_date: 2020-11-19
location: Durham, NC, United States
name: 'FOCS: Annual Symposium on Foundations of Computer Science'
start_date: 2020-11-16
date_created: 2022-08-16T07:33:12Z
date_published: 2020-11-01T00:00:00Z
date_updated: 2023-02-17T09:47:36Z
day: '01'
doi: 10.1109/focs46700.2020.00109
extern: '1'
external_id:
arxiv:
- '2005.02368'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.02368
month: '11'
oa: 1
oa_version: Preprint
page: 1135-1146
publication: 61st Annual Symposium on Foundations of Computer Science
publication_identifier:
eisbn:
- 978-1-7281-9621-3
eissn:
- 2575-8454
isbn:
- 978-1-7281-9622-0
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fast dynamic cuts, distances and effective resistances via vertex sparsifiers
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '11880'
abstract:
- lang: eng
text: "Given a directed graph and a source vertex, the fully dynamic single-source
reachability problem is to maintain the set of vertices that are reachable from
the given vertex, subject to edge deletions and insertions. It is one of the most
fundamental problems on graphs and appears directly or indirectly in many and
varied applications. While there has been theoretical work on this problem, showing
both linear conditional lower bounds for the fully dynamic problem and insertions-only
and deletions-only upper bounds beating these conditional lower bounds, there
has been no experimental study that compares the performance of fully dynamic
reachability algorithms in practice. Previous experimental studies in this area
concentrated only on the more general all-pairs reachability or transitive closure
problem and did not use real-world dynamic graphs.\r\n\r\nIn this paper, we bridge
this gap by empirically studying an extensive set of algorithms for the single-source
reachability problem in the fully dynamic setting. In particular, we design several
fully dynamic variants of well-known approaches to obtain and maintain reachability
information with respect to a distinguished source. Moreover, we extend the existing
insertions-only or deletions-only upper bounds into fully dynamic algorithms.
Even though the worst-case time per operation of all the fully dynamic algorithms
we evaluate is at least linear in the number of edges in the graph (as is to be
expected given the conditional lower bounds) we show in our extensive experimental
evaluation that their performance differs greatly, both on generated as well as
on real-world instances."
article_processing_charge: No
arxiv: 1
author:
- first_name: Kathrin
full_name: Hanauer, Kathrin
last_name: Hanauer
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
citation:
ama: 'Hanauer K, Henzinger MH, Schulz C. Fully dynamic single-source reachability
in practice: An experimental study. In: 2020 Symposium on Algorithm Engineering
and Experiments. Society for Industrial and Applied Mathematics; 2020:106-119.
doi:10.1137/1.9781611976007.9'
apa: 'Hanauer, K., Henzinger, M. H., & Schulz, C. (2020). Fully dynamic single-source
reachability in practice: An experimental study. In 2020 Symposium on Algorithm
Engineering and Experiments (pp. 106–119). Salt Lake City, UT, United States:
Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976007.9'
chicago: 'Hanauer, Kathrin, Monika H Henzinger, and Christian Schulz. “Fully Dynamic
Single-Source Reachability in Practice: An Experimental Study.” In 2020 Symposium
on Algorithm Engineering and Experiments, 106–19. Society for Industrial and
Applied Mathematics, 2020. https://doi.org/10.1137/1.9781611976007.9.'
ieee: 'K. Hanauer, M. H. Henzinger, and C. Schulz, “Fully dynamic single-source
reachability in practice: An experimental study,” in 2020 Symposium on Algorithm
Engineering and Experiments, Salt Lake City, UT, United States, 2020, pp.
106–119.'
ista: 'Hanauer K, Henzinger MH, Schulz C. 2020. Fully dynamic single-source reachability
in practice: An experimental study. 2020 Symposium on Algorithm Engineering and
Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 106–119.'
mla: 'Hanauer, Kathrin, et al. “Fully Dynamic Single-Source Reachability in Practice:
An Experimental Study.” 2020 Symposium on Algorithm Engineering and Experiments,
Society for Industrial and Applied Mathematics, 2020, pp. 106–19, doi:10.1137/1.9781611976007.9.'
short: K. Hanauer, M.H. Henzinger, C. Schulz, in:, 2020 Symposium on Algorithm Engineering
and Experiments, Society for Industrial and Applied Mathematics, 2020, pp. 106–119.
conference:
end_date: 2020-01-06
location: Salt Lake City, UT, United States
name: 'ALENEX: Symposium on Algorithm Engineering and Experiments'
start_date: 2020-01-05
date_created: 2022-08-17T06:39:32Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2023-02-17T14:00:37Z
day: '01'
doi: 10.1137/1.9781611976007.9
extern: '1'
external_id:
arxiv:
- '1905.01216'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1905.01216
month: '01'
oa: 1
oa_version: Preprint
page: 106-119
publication: 2020 Symposium on Algorithm Engineering and Experiments
publication_identifier:
eisbn:
- 978-1-61197-600-7
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Fully dynamic single-source reachability in practice: An experimental study'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '11881'
abstract:
- lang: eng
text: We introduce the fastest known exact algorithm for the multiterminal cut problem
with k terminals. In particular, we engineer existing as well as new data reduction
rules. We use the rules within a branch-and-reduce framework and to boost the
performance of an ILP formulation. Our algorithms achieve improvements in running
time of up to multiple orders of magnitudes over the ILP formulation without data
reductions, which has been the de facto standard used by practitioners. This allows
us to solve instances to optimality that are significantly larger than was previously
possible.
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Noe, Alexander
last_name: Noe
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
citation:
ama: 'Henzinger MH, Noe A, Schulz C. Shared-memory branch-and-reduce for multiterminal
cuts. In: 2020 Symposium on Algorithm Engineering and Experiments. Society
for Industrial and Applied Mathematics; 2020:42-55. doi:10.1137/1.9781611976007.4'
apa: 'Henzinger, M. H., Noe, A., & Schulz, C. (2020). Shared-memory branch-and-reduce
for multiterminal cuts. In 2020 Symposium on Algorithm Engineering and Experiments
(pp. 42–55). Salt Lake City, UT, United States: Society for Industrial and Applied
Mathematics. https://doi.org/10.1137/1.9781611976007.4'
chicago: Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Shared-Memory
Branch-and-Reduce for Multiterminal Cuts.” In 2020 Symposium on Algorithm Engineering
and Experiments, 42–55. Society for Industrial and Applied Mathematics, 2020.
https://doi.org/10.1137/1.9781611976007.4.
ieee: M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory branch-and-reduce for
multiterminal cuts,” in 2020 Symposium on Algorithm Engineering and Experiments,
Salt Lake City, UT, United States, 2020, pp. 42–55.
ista: 'Henzinger MH, Noe A, Schulz C. 2020. Shared-memory branch-and-reduce for
multiterminal cuts. 2020 Symposium on Algorithm Engineering and Experiments. ALENEX:
Symposium on Algorithm Engineering and Experiments, 42–55.'
mla: Henzinger, Monika H., et al. “Shared-Memory Branch-and-Reduce for Multiterminal
Cuts.” 2020 Symposium on Algorithm Engineering and Experiments, Society
for Industrial and Applied Mathematics, 2020, pp. 42–55, doi:10.1137/1.9781611976007.4.
short: M.H. Henzinger, A. Noe, C. Schulz, in:, 2020 Symposium on Algorithm Engineering
and Experiments, Society for Industrial and Applied Mathematics, 2020, pp. 42–55.
conference:
end_date: 2020-01-06
location: Salt Lake City, UT, United States
name: 'ALENEX: Symposium on Algorithm Engineering and Experiments'
start_date: 2020-01-05
date_created: 2022-08-17T06:47:40Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2023-02-17T14:02:04Z
day: '01'
doi: 10.1137/1.9781611976007.4
extern: '1'
external_id:
arxiv:
- '1908.04141'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1908.04141
month: '01'
oa: 1
oa_version: Preprint
page: 42-55
publication: 2020 Symposium on Algorithm Engineering and Experiments
publication_identifier:
eisbn:
- 978-1-61197-600-7
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Shared-memory branch-and-reduce for multiterminal cuts
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '11889'
abstract:
- lang: eng
text: "We study the problem of computing a minimum cut in a simple, undirected graph
and give a deterministic \U0001D442(\U0001D45Alog2\U0001D45Bloglog2\U0001D45B)
time algorithm. This improves on both the best previously known deterministic
running time of \U0001D442(\U0001D45Alog12\U0001D45B) (Kawarabayashi and Thorup
[J. ACM, 66 (2018), 4]) and the best previously known randomized running time
of \U0001D442(\U0001D45Alog3\U0001D45B) (Karger [J. ACM, 47 (2000), pp. 46--76])
for this problem, though Karger's algorithm can be further applied to weighted
graphs. Moreover, our result extends to balanced directed graphs, where the balance
of a directed graph captures how close the graph is to being Eulerian. Our approach
is using the Kawarabayashi and Thorup graph compression technique, which repeatedly
finds low conductance cuts. To find these cuts they use a diffusion-based local
algorithm. We use instead a flow-based local algorithm and suitably adjust their
framework to work with our flow-based subroutine. Both flow- and diffusion-based
methods have a long history of being applied to finding low conductance cuts.
Diffusion algorithms have several variants that are naturally local, while it
is more complicated to make flow methods local. Some prior work has proven nice
properties for local flow-based algorithms with respect to improving or cleaning
up low conductance cuts. Our flow subroutine, however, is the first that both
is local and produces low conductance cuts. Thus, it may be of independent interest."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Satish
full_name: Rao, Satish
last_name: Rao
- first_name: Di
full_name: Wang, Di
last_name: Wang
citation:
ama: Henzinger MH, Rao S, Wang D. Local flow partitioning for faster edge connectivity.
SIAM Journal on Computing. 2020;49(1):1-36. doi:10.1137/18m1180335
apa: Henzinger, M. H., Rao, S., & Wang, D. (2020). Local flow partitioning for
faster edge connectivity. SIAM Journal on Computing. Society for Industrial
& Applied Mathematics. https://doi.org/10.1137/18m1180335
chicago: Henzinger, Monika H, Satish Rao, and Di Wang. “Local Flow Partitioning
for Faster Edge Connectivity.” SIAM Journal on Computing. Society for Industrial
& Applied Mathematics, 2020. https://doi.org/10.1137/18m1180335.
ieee: M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster
edge connectivity,” SIAM Journal on Computing, vol. 49, no. 1. Society
for Industrial & Applied Mathematics, pp. 1–36, 2020.
ista: Henzinger MH, Rao S, Wang D. 2020. Local flow partitioning for faster edge
connectivity. SIAM Journal on Computing. 49(1), 1–36.
mla: Henzinger, Monika H., et al. “Local Flow Partitioning for Faster Edge Connectivity.”
SIAM Journal on Computing, vol. 49, no. 1, Society for Industrial &
Applied Mathematics, 2020, pp. 1–36, doi:10.1137/18m1180335.
short: M.H. Henzinger, S. Rao, D. Wang, SIAM Journal on Computing 49 (2020) 1–36.
date_created: 2022-08-17T08:09:31Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2023-02-21T16:31:25Z
day: '01'
doi: 10.1137/18m1180335
extern: '1'
external_id:
arxiv:
- '1704.01254'
intvolume: ' 49'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/abs/1704.01254
month: '01'
oa_version: Preprint
page: 1-36
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11873'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Local flow partitioning for faster edge connectivity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 49
year: '2020'
...
---
_id: '11894'
abstract:
- lang: eng
text: "Graph sparsification aims at compressing large graphs into smaller ones while
preserving important characteristics of the input graph. In this work we study
vertex sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices.
We focus on the following notions: (1) Given a digraph \U0001D43A=(\U0001D449,\U0001D438)
and terminal vertices \U0001D43E⊂\U0001D449 with |\U0001D43E|=\U0001D458, a (vertex)
reachability sparsifier of \U0001D43A is a digraph \U0001D43B=(\U0001D449\U0001D43B,\U0001D438\U0001D43B),
\U0001D43E⊂\U0001D449\U0001D43B that preserves all reachability information among
terminal pairs. Let |\U0001D449\U0001D43B| denote the size of \U0001D43B. In this
work we introduce the notion of reachability-preserving minors (RPMs), i.e., we
require \U0001D43B to be a minor of \U0001D43A. We show any directed graph \U0001D43A
admits an RPM \U0001D43B of size \U0001D442(\U0001D4583), and if \U0001D43A is
planar, then the size of \U0001D43B improves to \U0001D442(\U0001D4582log\U0001D458).
We complement our upper bound by showing that there exists an infinite family
of grids such that any RPM must have Ω(\U0001D4582) vertices. (2) Given a weighted
undirected graph \U0001D43A=(\U0001D449,\U0001D438) and terminal vertices \U0001D43E
with |\U0001D43E|=\U0001D458, an exact (vertex) cut sparsifier of \U0001D43A is
a graph \U0001D43B with \U0001D43E⊂\U0001D449\U0001D43B that preserves the value
of minimum cuts separating any bipartition of \U0001D43E. We show that planar
graphs with all the \U0001D458 terminals lying on the same face admit exact cut
sparsifiers of size \U0001D442(\U0001D4582) that are also planar. Our result extends
to flow and distance sparsifiers. It improves the previous best-known bound of
\U0001D442(\U0001D458222\U0001D458) for cut and flow sparsifiers by an exponential
factor and matches an Ω(\U0001D4582) lower-bound for this class of graphs."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Gramoz
full_name: Goranci, Gramoz
last_name: Goranci
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Pan
full_name: Peng, Pan
last_name: Peng
citation:
ama: Goranci G, Henzinger MH, Peng P. Improved guarantees for vertex sparsification
in planar graphs. SIAM Journal on Discrete Mathematics. 2020;34(1):130-162.
doi:10.1137/17m1163153
apa: Goranci, G., Henzinger, M. H., & Peng, P. (2020). Improved guarantees for
vertex sparsification in planar graphs. SIAM Journal on Discrete Mathematics.
Society for Industrial & Applied Mathematics. https://doi.org/10.1137/17m1163153
chicago: Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Improved Guarantees
for Vertex Sparsification in Planar Graphs.” SIAM Journal on Discrete Mathematics.
Society for Industrial & Applied Mathematics, 2020. https://doi.org/10.1137/17m1163153.
ieee: G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex
sparsification in planar graphs,” SIAM Journal on Discrete Mathematics,
vol. 34, no. 1. Society for Industrial & Applied Mathematics, pp. 130–162,
2020.
ista: Goranci G, Henzinger MH, Peng P. 2020. Improved guarantees for vertex sparsification
in planar graphs. SIAM Journal on Discrete Mathematics. 34(1), 130–162.
mla: Goranci, Gramoz, et al. “Improved Guarantees for Vertex Sparsification in Planar
Graphs.” SIAM Journal on Discrete Mathematics, vol. 34, no. 1, Society
for Industrial & Applied Mathematics, 2020, pp. 130–62, doi:10.1137/17m1163153.
short: G. Goranci, M.H. Henzinger, P. Peng, SIAM Journal on Discrete Mathematics
34 (2020) 130–162.
date_created: 2022-08-17T08:50:24Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2023-02-21T16:29:44Z
day: '01'
doi: 10.1137/17m1163153
extern: '1'
external_id:
arxiv:
- '1702.01136'
intvolume: ' 34'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1702.01136
month: '01'
oa: 1
oa_version: Preprint
page: 130-162
publication: SIAM Journal on Discrete Mathematics
publication_identifier:
eissn:
- 1095-7146
issn:
- 0895-4801
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11831'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Improved guarantees for vertex sparsification in planar graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2020'
...
---
_id: '11954'
abstract:
- lang: eng
text: The combination of nickel and photocatalysis has unlocked a variety of cross-couplings.
These protocols rely on a few photocatalysts that can only convert a small portion
of visible light (<500 nm) into chemical energy. The high-energy photons that
excite the photocatalyst can result in unwanted side reactions. Dyes that absorb
a much broader spectrum of light are not applicable because of their short-lived
singlet excited states. Here, we describe a self-assembling catalyst system that
overcomes this limitation. Immobilization of a nickel catalyst on dye-sensitized
titanium dioxide results in a material that catalyzes carbon–heteroatom and carbon–carbon
bond formations. The modular approach of dye-sensitized metallaphotocatalysts
accesses the entire visible light spectrum and allows tackling selectivity issues
resulting from low wavelengths strategically. The concept overcomes current limitations
of metallaphotocatalysis by unlocking the potential of dyes that were previously
unsuitable.
article_processing_charge: No
article_type: original
author:
- first_name: Susanne
full_name: Reischauer, Susanne
last_name: Reischauer
- first_name: Volker
full_name: Strauss, Volker
last_name: Strauss
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
citation:
ama: Reischauer S, Strauss V, Pieber B. Modular, self-assembling metallaphotocatalyst
for cross-couplings using the full visible-light spectrum. ACS Catalysis.
2020;10(22):13269–13274. doi:10.1021/acscatal.0c03950
apa: Reischauer, S., Strauss, V., & Pieber, B. (2020). Modular, self-assembling
metallaphotocatalyst for cross-couplings using the full visible-light spectrum.
ACS Catalysis. American Chemical Society. https://doi.org/10.1021/acscatal.0c03950
chicago: Reischauer, Susanne, Volker Strauss, and Bartholomäus Pieber. “Modular,
Self-Assembling Metallaphotocatalyst for Cross-Couplings Using the Full Visible-Light
Spectrum.” ACS Catalysis. American Chemical Society, 2020. https://doi.org/10.1021/acscatal.0c03950.
ieee: S. Reischauer, V. Strauss, and B. Pieber, “Modular, self-assembling metallaphotocatalyst
for cross-couplings using the full visible-light spectrum,” ACS Catalysis,
vol. 10, no. 22. American Chemical Society, pp. 13269–13274, 2020.
ista: Reischauer S, Strauss V, Pieber B. 2020. Modular, self-assembling metallaphotocatalyst
for cross-couplings using the full visible-light spectrum. ACS Catalysis. 10(22),
13269–13274.
mla: Reischauer, Susanne, et al. “Modular, Self-Assembling Metallaphotocatalyst
for Cross-Couplings Using the Full Visible-Light Spectrum.” ACS Catalysis,
vol. 10, no. 22, American Chemical Society, 2020, pp. 13269–13274, doi:10.1021/acscatal.0c03950.
short: S. Reischauer, V. Strauss, B. Pieber, ACS Catalysis 10 (2020) 13269–13274.
date_created: 2022-08-24T10:40:46Z
date_published: 2020-11-02T00:00:00Z
date_updated: 2023-02-21T10:09:09Z
day: '02'
doi: 10.1021/acscatal.0c03950
extern: '1'
intvolume: ' 10'
issue: '22'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.26434/chemrxiv.12444908
month: '11'
oa: 1
oa_version: Preprint
page: 13269–13274
publication: ACS Catalysis
publication_identifier:
eissn:
- 2155-5435
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Modular, self-assembling metallaphotocatalyst for cross-couplings using the
full visible-light spectrum
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2020'
...