---
_id: '10065'
abstract:
- lang: eng
text: We study double quantum dots in a Ge/SiGe heterostructure and test their maturity
towards singlet-triplet ($S-T_0$) qubits. We demonstrate a large range of tunability,
from two single quantum dots to a double quantum dot. We measure Pauli spin blockade
and study the anisotropy of the $g$-factor. We use an adjacent quantum dot for
sensing charge transitions in the double quantum dot at interest. In conclusion,
Ge/SiGe possesses all ingredients necessary for building a singlet-triplet qubit.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: "We thank Matthias Brauns for helpful discussions and careful proofreading
of the manuscript. This project has received funding from the European Union’s Horizon
2020 research and innovation program under the Marie Sklodowska-Curie grant agreement
No 844511 and from the FWF project P30207. The research was supported by the Scientific
Service Units of IST Austria through resources provided by the MIBA machine shop
and the nanofabrication\r\nfacility."
article_number: '1910.05841'
article_processing_charge: No
arxiv: 1
author:
- first_name: Andrea C
full_name: Hofmann, Andrea C
id: 340F461A-F248-11E8-B48F-1D18A9856A87
last_name: Hofmann
- first_name: Daniel
full_name: Jirovec, Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
orcid: 0000-0002-7197-4801
- first_name: Maxim
full_name: Borovkov, Maxim
last_name: Borovkov
- first_name: Ivan
full_name: Prieto Gonzalez, Ivan
id: 2A307FE2-F248-11E8-B48F-1D18A9856A87
last_name: Prieto Gonzalez
orcid: 0000-0002-7370-5357
- first_name: Andrea
full_name: Ballabio, Andrea
last_name: Ballabio
- first_name: Jacopo
full_name: Frigerio, Jacopo
last_name: Frigerio
- first_name: Daniel
full_name: Chrastina, Daniel
last_name: Chrastina
- first_name: Giovanni
full_name: Isella, Giovanni
last_name: Isella
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
citation:
ama: Hofmann AC, Jirovec D, Borovkov M, et al. Assessing the potential of Ge/SiGe
quantum dots as hosts for singlet-triplet qubits. arXiv. doi:10.48550/arXiv.1910.05841
apa: Hofmann, A. C., Jirovec, D., Borovkov, M., Prieto Gonzalez, I., Ballabio, A.,
Frigerio, J., … Katsaros, G. (n.d.). Assessing the potential of Ge/SiGe quantum
dots as hosts for singlet-triplet qubits. arXiv. https://doi.org/10.48550/arXiv.1910.05841
chicago: Hofmann, Andrea C, Daniel Jirovec, Maxim Borovkov, Ivan Prieto Gonzalez,
Andrea Ballabio, Jacopo Frigerio, Daniel Chrastina, Giovanni Isella, and Georgios
Katsaros. “Assessing the Potential of Ge/SiGe Quantum Dots as Hosts for Singlet-Triplet
Qubits.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1910.05841.
ieee: A. C. Hofmann et al., “Assessing the potential of Ge/SiGe quantum dots
as hosts for singlet-triplet qubits,” arXiv. .
ista: Hofmann AC, Jirovec D, Borovkov M, Prieto Gonzalez I, Ballabio A, Frigerio
J, Chrastina D, Isella G, Katsaros G. Assessing the potential of Ge/SiGe quantum
dots as hosts for singlet-triplet qubits. arXiv, 1910.05841.
mla: Hofmann, Andrea C., et al. “Assessing the Potential of Ge/SiGe Quantum Dots
as Hosts for Singlet-Triplet Qubits.” ArXiv, 1910.05841, doi:10.48550/arXiv.1910.05841.
short: A.C. Hofmann, D. Jirovec, M. Borovkov, I. Prieto Gonzalez, A. Ballabio, J.
Frigerio, D. Chrastina, G. Isella, G. Katsaros, ArXiv (n.d.).
date_created: 2021-10-01T12:14:51Z
date_published: 2019-10-13T00:00:00Z
date_updated: 2024-03-25T23:30:14Z
day: '13'
department:
- _id: GeKa
doi: 10.48550/arXiv.1910.05841
ec_funded: 1
external_id:
arxiv:
- '1910.05841'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1910.05841
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 26A151DA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '844511'
name: Majorana bound states in Ge/SiGe heterostructures
- _id: 2641CE5E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P30207
name: Hole spin orbit qubits in Ge quantum wells
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '10058'
relation: dissertation_contains
status: public
status: public
title: Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet
qubits
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '10190'
abstract:
- lang: eng
text: 'The verification of concurrent programs remains an open challenge, as thread
interaction has to be accounted for, which leads to state-space explosion. Stateless
model checking battles this problem by exploring traces rather than states of
the program. As there are exponentially many traces, dynamic partial-order reduction
(DPOR) techniques are used to partition the trace space into equivalence classes,
and explore a few representatives from each class. The standard equivalence that
underlies most DPOR techniques is the happens-before equivalence, however recent
works have spawned a vivid interest towards coarser equivalences. The efficiency
of such approaches is a product of two parameters: (i) the size of the partitioning
induced by the equivalence, and (ii) the time spent by the exploration algorithm
in each class of the partitioning. In this work, we present a new equivalence,
called value-happens-before and show that it has two appealing features. First,
value-happens-before is always at least as coarse as the happens-before equivalence,
and can be even exponentially coarser. Second, the value-happens-before partitioning
is efficiently explorable when the number of threads is bounded. We present an
algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning
using polynomial time per class. Finally, we perform an experimental evaluation
of VCDPOR on various benchmarks, and compare it against other state-of-the-art
approaches. Our results show that value-happens-before typically induces a significant
reduction in the size of the underlying partitioning, which leads to a considerable
reduction in the running time for exploring the whole partitioning.'
acknowledgement: "The authors would also like to thank anonymous referees for their
valuable comments and helpful suggestions. This work is supported by the Austrian
Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE),
by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian
Science Fund (FWF) Schrodinger grant J-4220.\r\n"
article_number: '124'
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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order
reduction. In: Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications. Vol 3. ACM; 2019. doi:10.1145/3360550'
apa: 'Chatterjee, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic
partial order reduction. In Proceedings of the 34th ACM International Conference
on Object-Oriented Programming, Systems, Languages, and Applications (Vol.
3). Athens, Greece: ACM. https://doi.org/10.1145/3360550'
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric
Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International
Conference on Object-Oriented Programming, Systems, Languages, and Applications,
Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550.
ieee: K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial
order reduction,” in Proceedings of the 34th ACM International Conference on
Object-Oriented Programming, Systems, Languages, and Applications, Athens,
Greece, 2019, vol. 3.
ista: 'Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial
order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming,
Systems, Languages and Applications vol. 3, 124.'
mla: Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.”
Proceedings of the 34th ACM International Conference on Object-Oriented Programming,
Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550.
short: K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM
International Conference on Object-Oriented Programming, Systems, Languages, and
Applications, ACM, 2019.
conference:
end_date: 2019-10-25
location: Athens, Greece
name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications'
start_date: 2019-10-23
date_created: 2021-10-27T14:57:06Z
date_published: 2019-10-10T00:00:00Z
date_updated: 2025-07-14T09:10:15Z
day: '10'
ddc:
- '000'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1145/3360550
external_id:
arxiv:
- '1909.00989'
file:
- access_level: open_access
checksum: 2149979c46964c4d117af06ccb6c0834
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-12T11:41:56Z
date_updated: 2021-11-12T11:41:56Z
file_id: '10278'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 570829
relation: main_file
success: 1
file_date_updated: 2021-11-12T11:41:56Z
has_accepted_license: '1'
intvolume: ' 3'
keyword:
- safety
- risk
- reliability and quality
- software
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/doi/10.1145/3360550
month: '10'
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: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
status: public
title: Value-centric dynamic partial order reduction
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 3
year: '2019'
...
---
_id: '10354'
abstract:
- lang: eng
text: "Background\r\nESCRT-III is a membrane remodelling filament with the unique
ability to cut membranes from the inside of the membrane neck. It is essential
for the final stage of cell division, the formation of vesicles, the release of
viruses, and membrane repair. Distinct from other cytoskeletal filaments, ESCRT-III
filaments do not consume energy themselves, but work in conjunction with another
ATP-consuming complex. Despite rapid progress in describing the cell biology of
ESCRT-III, we lack an understanding of the physical mechanisms behind its force
production and membrane remodelling.\r\nResults\r\nHere we present a minimal coarse-grained
model that captures all the experimentally reported cases of ESCRT-III driven
membrane sculpting, including the formation of downward and upward cones and tubules.
This model suggests that a change in the geometry of membrane bound ESCRT-III
filaments—from a flat spiral to a 3D helix—drives membrane deformation. We then
show that such repetitive filament geometry transitions can induce the fission
of cargo-containing vesicles.\r\nConclusions\r\nOur model provides a general physical
mechanism that explains the full range of ESCRT-III-dependent membrane remodelling
and scission events observed in cells. This mechanism for filament force production
is distinct from the mechanisms described for other cytoskeletal elements discovered
so far. The mechanistic principles revealed here suggest new ways of manipulating
ESCRT-III-driven processes in cells and could be used to guide the engineering
of synthetic membrane-sculpting systems."
acknowledgement: We thank Jeremy Carlton, Mike Staddon, Geraint Harker, and the Wellcome
Trust Consortium “Archaeal Origins of Eukaryotic Cell Organisation” for fruitful
conversations. We thank Peter Wirnsberger and Tine Curk for discussions about the
membrane model implementation.
article_number: '82'
article_processing_charge: No
article_type: original
author:
- first_name: Lena
full_name: Harker-Kirschneck, Lena
last_name: Harker-Kirschneck
- first_name: Buzz
full_name: Baum, Buzz
last_name: Baum
- 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: Harker-Kirschneck L, Baum B, Šarić A. Changes in ESCRT-III filament geometry
drive membrane remodelling and fission in silico. BMC Biology. 2019;17(1).
doi:10.1186/s12915-019-0700-2
apa: Harker-Kirschneck, L., Baum, B., & Šarić, A. (2019). Changes in ESCRT-III
filament geometry drive membrane remodelling and fission in silico. BMC Biology.
Springer Nature. https://doi.org/10.1186/s12915-019-0700-2
chicago: Harker-Kirschneck, Lena, Buzz Baum, and Anđela Šarić. “Changes in ESCRT-III
Filament Geometry Drive Membrane Remodelling and Fission in Silico.” BMC Biology.
Springer Nature, 2019. https://doi.org/10.1186/s12915-019-0700-2.
ieee: L. Harker-Kirschneck, B. Baum, and A. Šarić, “Changes in ESCRT-III filament
geometry drive membrane remodelling and fission in silico,” BMC Biology,
vol. 17, no. 1. Springer Nature, 2019.
ista: Harker-Kirschneck L, Baum B, Šarić A. 2019. Changes in ESCRT-III filament
geometry drive membrane remodelling and fission in silico. BMC Biology. 17(1),
82.
mla: Harker-Kirschneck, Lena, et al. “Changes in ESCRT-III Filament Geometry Drive
Membrane Remodelling and Fission in Silico.” BMC Biology, vol. 17, no.
1, 82, Springer Nature, 2019, doi:10.1186/s12915-019-0700-2.
short: L. Harker-Kirschneck, B. Baum, A. Šarić, BMC Biology 17 (2019).
date_created: 2021-11-26T11:25:03Z
date_published: 2019-10-22T00:00:00Z
date_updated: 2021-11-26T11:54:29Z
day: '22'
ddc:
- '570'
doi: 10.1186/s12915-019-0700-2
extern: '1'
external_id:
pmid:
- '31640700'
file:
- access_level: open_access
checksum: 31d8bae55a376d30925f53f7e1a02396
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-26T11:37:54Z
date_updated: 2021-11-26T11:37:54Z
file_id: '10356'
file_name: 2019_BMCBio_Harker_Kirschneck.pdf
file_size: 1648926
relation: main_file
success: 1
file_date_updated: 2021-11-26T11:37:54Z
has_accepted_license: '1'
intvolume: ' 17'
issue: '1'
keyword:
- cell biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/559898
month: '10'
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'
scopus_import: '1'
status: public
title: Changes in ESCRT-III filament geometry drive membrane remodelling and fission
in silico
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 17
year: '2019'
...
---
_id: '10355'
abstract:
- lang: eng
text: The molecular machinery of life is largely created via self-organisation of
individual molecules into functional assemblies. Minimal coarse-grained models,
in which a whole macromolecule is represented by a small number of particles,
can be of great value in identifying the main driving forces behind self-organisation
in cell biology. Such models can incorporate data from both molecular and continuum
scales, and their results can be directly compared to experiments. Here we review
the state of the art of models for studying the formation and biological function
of macromolecular assemblies in living organisms. We outline the key ingredients
of each model and their main findings. We illustrate the contribution of this
class of simulations to identifying the physical mechanisms behind life and diseases,
and discuss their future developments.
acknowledgement: We acknowledge funding from EPSRC (A.E.H. and A.Š.), the Academy
of Medical Sciences (J.K. and A.Š.), the Wellcome Trust (J.K. and A.Š.), and the
Royal Society (A.Š.). We thank Shiladitya Banerjee and Nikola Ojkic for critically
reading the manuscript, and Claudia Flandoli for helping us with figures and illustrations.
article_processing_charge: No
article_type: original
author:
- first_name: Anne E
full_name: Hafner, Anne E
last_name: Hafner
- first_name: Johannes
full_name: Krausser, Johannes
last_name: Krausser
- 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: Hafner AE, Krausser J, Šarić A. Minimal coarse-grained models for molecular
self-organisation in biology. Current Opinion in Structural Biology. 2019;58:43-52.
doi:10.1016/j.sbi.2019.05.018
apa: Hafner, A. E., Krausser, J., & Šarić, A. (2019). Minimal coarse-grained
models for molecular self-organisation in biology. Current Opinion in Structural
Biology. Elsevier. https://doi.org/10.1016/j.sbi.2019.05.018
chicago: Hafner, Anne E, Johannes Krausser, and Anđela Šarić. “Minimal Coarse-Grained
Models for Molecular Self-Organisation in Biology.” Current Opinion in Structural
Biology. Elsevier, 2019. https://doi.org/10.1016/j.sbi.2019.05.018.
ieee: A. E. Hafner, J. Krausser, and A. Šarić, “Minimal coarse-grained models for
molecular self-organisation in biology,” Current Opinion in Structural Biology,
vol. 58. Elsevier, pp. 43–52, 2019.
ista: Hafner AE, Krausser J, Šarić A. 2019. Minimal coarse-grained models for molecular
self-organisation in biology. Current Opinion in Structural Biology. 58, 43–52.
mla: Hafner, Anne E., et al. “Minimal Coarse-Grained Models for Molecular Self-Organisation
in Biology.” Current Opinion in Structural Biology, vol. 58, Elsevier,
2019, pp. 43–52, doi:10.1016/j.sbi.2019.05.018.
short: A.E. Hafner, J. Krausser, A. Šarić, Current Opinion in Structural Biology
58 (2019) 43–52.
date_created: 2021-11-26T11:33:21Z
date_published: 2019-06-18T00:00:00Z
date_updated: 2021-11-26T11:54:25Z
day: '18'
doi: 10.1016/j.sbi.2019.05.018
extern: '1'
external_id:
pmid:
- '31226513'
intvolume: ' 58'
keyword:
- molecular biology
- structural biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1906.09349
month: '06'
oa: 1
oa_version: Preprint
page: 43-52
pmid: 1
publication: Current Opinion in Structural Biology
publication_identifier:
issn:
- 0959-440X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Minimal coarse-grained models for molecular self-organisation in biology
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 58
year: '2019'
...
---
_id: '105'
abstract:
- lang: eng
text: 'Clinical Utility Gene Card. 1. Name of Disease (Synonyms): Pontocerebellar
hypoplasia type 9 (PCH9) and spastic paraplegia-63 (SPG63). 2. OMIM# of the Disease:
615809 and 615686. 3. Name of the Analysed Genes or DNA/Chromosome Segments: AMPD2
at 1p13.3. 4. OMIM# of the Gene(s): 102771.'
acknowledgement: 'This work was supported by EuroGentest2 (Unit 2: “Genetic testing
as part of health care”), a Coordination Action under FP7 (Grant Agreement Number
261469) and the European Society of Human Genetics. We acknowledge the participation
of the patients and their families in these studies, as well as the generous financial
support of the Lefroy and Handbury families. APLM was supported by an Australian
Postgraduate Award. PJL is supported by an NHMRC Career Development Fellowship (GNT1032364).
RJL is supported by a Melbourne Children’s Clinician Scientist Fellowship.'
article_processing_charge: No
article_type: original
author:
- first_name: Ashley
full_name: Marsh, Ashley
last_name: Marsh
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Paul
full_name: Lockhart, Paul
last_name: Lockhart
- first_name: Richard
full_name: Leventer, Richard
last_name: Leventer
citation:
ama: Marsh A, Novarino G, Lockhart P, Leventer R. CUGC for pontocerebellar hypoplasia
type 9 and spastic paraplegia-63. European Journal of Human Genetics. 2019;27:161-166.
doi:10.1038/s41431-018-0231-2
apa: Marsh, A., Novarino, G., Lockhart, P., & Leventer, R. (2019). CUGC for
pontocerebellar hypoplasia type 9 and spastic paraplegia-63. European Journal
of Human Genetics. Springer Nature. https://doi.org/10.1038/s41431-018-0231-2
chicago: Marsh, Ashley, Gaia Novarino, Paul Lockhart, and Richard Leventer. “CUGC
for Pontocerebellar Hypoplasia Type 9 and Spastic Paraplegia-63.” European
Journal of Human Genetics. Springer Nature, 2019. https://doi.org/10.1038/s41431-018-0231-2.
ieee: A. Marsh, G. Novarino, P. Lockhart, and R. Leventer, “CUGC for pontocerebellar
hypoplasia type 9 and spastic paraplegia-63,” European Journal of Human Genetics,
vol. 27. Springer Nature, pp. 161–166, 2019.
ista: Marsh A, Novarino G, Lockhart P, Leventer R. 2019. CUGC for pontocerebellar
hypoplasia type 9 and spastic paraplegia-63. European Journal of Human Genetics.
27, 161–166.
mla: Marsh, Ashley, et al. “CUGC for Pontocerebellar Hypoplasia Type 9 and Spastic
Paraplegia-63.” European Journal of Human Genetics, vol. 27, Springer Nature,
2019, pp. 161–66, doi:10.1038/s41431-018-0231-2.
short: A. Marsh, G. Novarino, P. Lockhart, R. Leventer, European Journal of Human
Genetics 27 (2019) 161–166.
date_created: 2018-12-11T11:44:39Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2023-08-24T14:28:24Z
day: '01'
department:
- _id: GaNo
doi: 10.1038/s41431-018-0231-2
external_id:
isi:
- '000454111500019'
pmid:
- '30089829'
intvolume: ' 27'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1038/s41431-018-0231-2
month: '01'
oa: 1
oa_version: Published Version
page: 161-166
pmid: 1
publication: European Journal of Human Genetics
publication_status: published
publisher: Springer Nature
publist_id: '7949'
quality_controlled: '1'
scopus_import: '1'
status: public
title: CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 27
year: '2019'
...
---
_id: '10619'
abstract:
- lang: eng
text: The quantum anomalous Hall (QAH) effect combines topology and magnetism to
produce precisely quantized Hall resistance at zero magnetic field. We report
the observation of a QAH effect in twisted bilayer graphene aligned to hexagonal
boron nitride. The effect is driven by intrinsic strong interactions, which polarize
the electrons into a single spin- and valley-resolved moiré miniband with Chern
number C = 1. In contrast to magnetically doped systems, the measured transport
energy gap is larger than the Curie temperature for magnetic ordering, and quantization
to within 0.1% of the von Klitzing constant persists to temperatures of several
kelvin at zero magnetic field. Electrical currents as small as 1 nanoampere controllably
switch the magnetic order between states of opposite polarization, forming an
electrically rewritable magnetic memory.
acknowledgement: The authors acknowledge discussions with A. Macdonald, Y. Saito,
and M. Zaletel.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: M.
full_name: Serlin, M.
last_name: Serlin
- first_name: C. L.
full_name: Tschirhart, C. L.
last_name: Tschirhart
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Y.
full_name: Zhang, Y.
last_name: Zhang
- first_name: J.
full_name: Zhu, J.
last_name: Zhu
- first_name: K.
full_name: Watanabe, K.
last_name: Watanabe
- first_name: T.
full_name: Taniguchi, T.
last_name: Taniguchi
- first_name: L.
full_name: Balents, L.
last_name: Balents
- first_name: A. F.
full_name: Young, A. F.
last_name: Young
citation:
ama: Serlin M, Tschirhart CL, Polshyn H, et al. Intrinsic quantized anomalous Hall
effect in a moiré heterostructure. Science. 2019;367(6480):900-903. doi:10.1126/science.aay5533
apa: Serlin, M., Tschirhart, C. L., Polshyn, H., Zhang, Y., Zhu, J., Watanabe, K.,
… Young, A. F. (2019). Intrinsic quantized anomalous Hall effect in a moiré heterostructure.
Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aay5533
chicago: Serlin, M., C. L. Tschirhart, Hryhoriy Polshyn, Y. Zhang, J. Zhu, K. Watanabe,
T. Taniguchi, L. Balents, and A. F. Young. “Intrinsic Quantized Anomalous Hall
Effect in a Moiré Heterostructure.” Science. American Association for the
Advancement of Science, 2019. https://doi.org/10.1126/science.aay5533.
ieee: M. Serlin et al., “Intrinsic quantized anomalous Hall effect in a moiré
heterostructure,” Science, vol. 367, no. 6480. American Association for
the Advancement of Science, pp. 900–903, 2019.
ista: Serlin M, Tschirhart CL, Polshyn H, Zhang Y, Zhu J, Watanabe K, Taniguchi
T, Balents L, Young AF. 2019. Intrinsic quantized anomalous Hall effect in a moiré
heterostructure. Science. 367(6480), 900–903.
mla: Serlin, M., et al. “Intrinsic Quantized Anomalous Hall Effect in a Moiré Heterostructure.”
Science, vol. 367, no. 6480, American Association for the Advancement of
Science, 2019, pp. 900–03, doi:10.1126/science.aay5533.
short: M. Serlin, C.L. Tschirhart, H. Polshyn, Y. Zhang, J. Zhu, K. Watanabe, T.
Taniguchi, L. Balents, A.F. Young, Science 367 (2019) 900–903.
date_created: 2022-01-13T14:21:32Z
date_published: 2019-12-19T00:00:00Z
date_updated: 2023-02-21T16:00:09Z
day: '19'
doi: 10.1126/science.aay5533
extern: '1'
external_id:
arxiv:
- '1907.00261'
pmid:
- '31857492'
intvolume: ' 367'
issue: '6480'
keyword:
- multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1907.00261
month: '12'
oa: 1
oa_version: Preprint
page: 900-903
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
related_material:
record:
- id: '10697'
relation: other
status: public
- id: '10698'
relation: other
status: public
- id: '10699'
relation: other
status: public
scopus_import: '1'
status: public
title: Intrinsic quantized anomalous Hall effect in a moiré heterostructure
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 367
year: '2019'
...
---
_id: '10621'
abstract:
- lang: eng
text: Twisted bilayer graphene has recently emerged as a platform for hosting correlated
phenomena. For twist angles near θ ≈ 1.1°, the low-energy electronic structure
of twisted bilayer graphene features isolated bands with a flat dispersion1,2.
Recent experiments have observed a variety of low-temperature phases that appear
to be driven by electron interactions, including insulating states, superconductivity
and magnetism3,4,5,6. Here we report electrical transport measurements up to room
temperature for twist angles varying between 0.75° and 2°. We find that the resistivity,
ρ, scales linearly with temperature, T, over a wide range of T before falling
again owing to interband activation. The T-linear response is much larger than
observed in monolayer graphene for all measured devices, and in particular increases
by more than three orders of magnitude in the range where the flat band exists.
Our results point to the dominant role of electron–phonon scattering in twisted
bilayer graphene, with possible implications for the origin of the observed superconductivity.
acknowledgement: The authors thank S. Das Sarma and F. Wu for sharing their unpublished
theoretical results, and acknowledge further discussions with L. Balents and T.
Senthil. Work at both Columbia and UCSB was funded by the Army Research Office under
award W911NF-17-1-0323. Sample device design and fabrication was partially supported
by DoE Pro-QM EFRC (DE-SC0019443). A.F.Y. and C.R.D. separately acknowledge the
support of the David and Lucile Packard Foundation. K.W. and T.T. acknowledge support
from the Elemental Strategy Initiative conducted by the MEXT, Japan and the CREST
(JPMJCR15F3), JST. A portion of this work was carried out at the KITP, Santa Barbara,
supported by the National Science Foundation under grant number NSF PHY-1748958.
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: Matthew
full_name: Yankowitz, Matthew
last_name: Yankowitz
- first_name: Shaowen
full_name: Chen, Shaowen
last_name: Chen
- first_name: Yuxuan
full_name: Zhang, Yuxuan
last_name: Zhang
- first_name: K.
full_name: Watanabe, K.
last_name: Watanabe
- first_name: T.
full_name: Taniguchi, T.
last_name: Taniguchi
- first_name: Cory R.
full_name: Dean, Cory R.
last_name: Dean
- first_name: Andrea F.
full_name: Young, Andrea F.
last_name: Young
citation:
ama: Polshyn H, Yankowitz M, Chen S, et al. Large linear-in-temperature resistivity
in twisted bilayer graphene. Nature Physics. 2019;15(10):1011-1016. doi:10.1038/s41567-019-0596-3
apa: Polshyn, H., Yankowitz, M., Chen, S., Zhang, Y., Watanabe, K., Taniguchi, T.,
… Young, A. F. (2019). Large linear-in-temperature resistivity in twisted bilayer
graphene. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-019-0596-3
chicago: Polshyn, Hryhoriy, Matthew Yankowitz, Shaowen Chen, Yuxuan Zhang, K. Watanabe,
T. Taniguchi, Cory R. Dean, and Andrea F. Young. “Large Linear-in-Temperature
Resistivity in Twisted Bilayer Graphene.” Nature Physics. Springer Nature,
2019. https://doi.org/10.1038/s41567-019-0596-3.
ieee: H. Polshyn et al., “Large linear-in-temperature resistivity in twisted
bilayer graphene,” Nature Physics, vol. 15, no. 10. Springer Nature, pp.
1011–1016, 2019.
ista: Polshyn H, Yankowitz M, Chen S, Zhang Y, Watanabe K, Taniguchi T, Dean CR,
Young AF. 2019. Large linear-in-temperature resistivity in twisted bilayer graphene.
Nature Physics. 15(10), 1011–1016.
mla: Polshyn, Hryhoriy, et al. “Large Linear-in-Temperature Resistivity in Twisted
Bilayer Graphene.” Nature Physics, vol. 15, no. 10, Springer Nature, 2019,
pp. 1011–16, doi:10.1038/s41567-019-0596-3.
short: H. Polshyn, M. Yankowitz, S. Chen, Y. Zhang, K. Watanabe, T. Taniguchi, C.R.
Dean, A.F. Young, Nature Physics 15 (2019) 1011–1016.
date_created: 2022-01-13T15:00:58Z
date_published: 2019-08-05T00:00:00Z
date_updated: 2022-01-20T09:33:38Z
day: '05'
doi: 10.1038/s41567-019-0596-3
extern: '1'
external_id:
arxiv:
- '1902.00763'
intvolume: ' 15'
issue: '10'
keyword:
- general physics and astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.00763
month: '08'
oa: 1
oa_version: Preprint
page: 1011-1016
publication: Nature Physics
publication_identifier:
eissn:
- 1745-2481
issn:
- 1745-2473
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Large linear-in-temperature resistivity in twisted bilayer graphene
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 15
year: '2019'
...
---
_id: '10622'
abstract:
- lang: eng
text: We demonstrate a method for manipulating small ensembles of vortices in multiply
connected superconducting structures. A micron-size magnetic particle attached
to the tip of a silicon cantilever is used to locally apply magnetic flux through
the superconducting structure. By scanning the tip over the surface of the device
and by utilizing the dynamical coupling between the vortices and the cantilever,
a high-resolution spatial map of the different vortex configurations is obtained.
Moving the tip to a particular location in the map stabilizes a distinct multivortex
configuration. Thus, the scanning of the tip over a particular trajectory in space
permits nontrivial operations to be performed, such as braiding of individual
vortices within a larger vortex ensemble—a key capability required by many proposals
for topological quantum computing.
acknowledgement: We are grateful to Nadya Mason, Taylor Hughes, and Alexey Bezryadin
for useful discussions. This work was supported by the DOE Basic Energy Sciences
under DE-SC0012649 and the Department of Physics and the Frederick Seitz Materials
Research Laboratory Central Facilities at the University of Illinois.
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: Tyler
full_name: Naibert, Tyler
last_name: Naibert
- first_name: Raffi
full_name: Budakian, Raffi
last_name: Budakian
citation:
ama: Polshyn H, Naibert T, Budakian R. Manipulating multivortex states in superconducting
structures. Nano Letters. 2019;19(8):5476-5482. doi:10.1021/acs.nanolett.9b01983
apa: Polshyn, H., Naibert, T., & Budakian, R. (2019). Manipulating multivortex
states in superconducting structures. Nano Letters. American Chemical Society.
https://doi.org/10.1021/acs.nanolett.9b01983
chicago: Polshyn, Hryhoriy, Tyler Naibert, and Raffi Budakian. “Manipulating Multivortex
States in Superconducting Structures.” Nano Letters. American Chemical
Society, 2019. https://doi.org/10.1021/acs.nanolett.9b01983.
ieee: H. Polshyn, T. Naibert, and R. Budakian, “Manipulating multivortex states
in superconducting structures,” Nano Letters, vol. 19, no. 8. American
Chemical Society, pp. 5476–5482, 2019.
ista: Polshyn H, Naibert T, Budakian R. 2019. Manipulating multivortex states in
superconducting structures. Nano Letters. 19(8), 5476–5482.
mla: Polshyn, Hryhoriy, et al. “Manipulating Multivortex States in Superconducting
Structures.” Nano Letters, vol. 19, no. 8, American Chemical Society, 2019,
pp. 5476–82, doi:10.1021/acs.nanolett.9b01983.
short: H. Polshyn, T. Naibert, R. Budakian, Nano Letters 19 (2019) 5476–5482.
date_created: 2022-01-13T15:11:14Z
date_published: 2019-06-27T00:00:00Z
date_updated: 2022-01-13T15:41:24Z
day: '27'
doi: 10.1021/acs.nanolett.9b01983
extern: '1'
external_id:
arxiv:
- '1905.06303'
pmid:
- '31246034'
intvolume: ' 19'
issue: '8'
keyword:
- mechanical engineering
- condensed matter physics
- general materials science
- general chemistry
- bioengineering
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1905.06303
month: '06'
oa: 1
oa_version: Preprint
page: 5476-5482
pmid: 1
publication: Nano Letters
publication_identifier:
eissn:
- 1530-6992
issn:
- 1530-6984
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Manipulating multivortex states in superconducting structures
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 19
year: '2019'
...
---
_id: '10625'
abstract:
- lang: eng
text: The discovery of superconductivity and exotic insulating phases in twisted
bilayer graphene has established this material as a model system of strongly correlated
electrons. To achieve superconductivity, the two layers of graphene need to be
at a very precise angle with respect to each other. Yankowitz et al. now show
that another experimental knob, hydrostatic pressure, can be used to tune the
phase diagram of twisted bilayer graphene (see the Perspective by Feldman). Applying
pressure increased the coupling between the layers, which shifted the superconducting
transition to higher angles and somewhat higher temperatures.
acknowledgement: We thank J. Zhu and H. Zhou for experimental assistance and D. Shahar,
A. Millis, O. Vafek, M. Zaletel, L. Balents, C. Xu, A. Bernevig, L. Fu, M. Koshino,
and P. Moon for helpful discussions.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Matthew
full_name: Yankowitz, Matthew
last_name: Yankowitz
- first_name: Shaowen
full_name: Chen, Shaowen
last_name: Chen
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Yuxuan
full_name: Zhang, Yuxuan
last_name: Zhang
- first_name: K.
full_name: Watanabe, K.
last_name: Watanabe
- first_name: T.
full_name: Taniguchi, T.
last_name: Taniguchi
- first_name: David
full_name: Graf, David
last_name: Graf
- first_name: Andrea F.
full_name: Young, Andrea F.
last_name: Young
- first_name: Cory R.
full_name: Dean, Cory R.
last_name: Dean
citation:
ama: Yankowitz M, Chen S, Polshyn H, et al. Tuning superconductivity in twisted
bilayer graphene. Science. 2019;363(6431):1059-1064. doi:10.1126/science.aav1910
apa: Yankowitz, M., Chen, S., Polshyn, H., Zhang, Y., Watanabe, K., Taniguchi, T.,
… Dean, C. R. (2019). Tuning superconductivity in twisted bilayer graphene. Science.
American Association for the Advancement of Science (AAAS). https://doi.org/10.1126/science.aav1910
chicago: Yankowitz, Matthew, Shaowen Chen, Hryhoriy Polshyn, Yuxuan Zhang, K. Watanabe,
T. Taniguchi, David Graf, Andrea F. Young, and Cory R. Dean. “Tuning Superconductivity
in Twisted Bilayer Graphene.” Science. American Association for the Advancement
of Science (AAAS), 2019. https://doi.org/10.1126/science.aav1910.
ieee: M. Yankowitz et al., “Tuning superconductivity in twisted bilayer graphene,”
Science, vol. 363, no. 6431. American Association for the Advancement of
Science (AAAS), pp. 1059–1064, 2019.
ista: Yankowitz M, Chen S, Polshyn H, Zhang Y, Watanabe K, Taniguchi T, Graf D,
Young AF, Dean CR. 2019. Tuning superconductivity in twisted bilayer graphene.
Science. 363(6431), 1059–1064.
mla: Yankowitz, Matthew, et al. “Tuning Superconductivity in Twisted Bilayer Graphene.”
Science, vol. 363, no. 6431, American Association for the Advancement of
Science (AAAS), 2019, pp. 1059–64, doi:10.1126/science.aav1910.
short: M. Yankowitz, S. Chen, H. Polshyn, Y. Zhang, K. Watanabe, T. Taniguchi, D.
Graf, A.F. Young, C.R. Dean, Science 363 (2019) 1059–1064.
date_created: 2022-01-14T12:14:58Z
date_published: 2019-01-24T00:00:00Z
date_updated: 2022-01-14T13:48:32Z
day: '24'
doi: 10.1126/science.aav1910
extern: '1'
external_id:
arxiv:
- '1808.07865'
pmid:
- '30679385 '
intvolume: ' 363'
issue: '6431'
keyword:
- multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1808.07865
month: '01'
oa: 1
oa_version: Preprint
page: 1059-1064
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science (AAAS)
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tuning superconductivity in twisted bilayer graphene
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 363
year: '2019'
...
---
_id: '11826'
abstract:
- lang: eng
text: "The diameter, radius and eccentricities are natural graph parameters. While
these problems have been studied extensively, there are no known dynamic algorithms
for them beyond the ones that follow from trivial recomputation after each update
or from solving dynamic All-Pairs Shortest Paths (APSP), which is very computationally
intensive. This is the situation for dynamic approximation algorithms as well,
and even if only edge insertions or edge deletions need to be supported.\r\nThis
paper provides a comprehensive study of the dynamic approximation of Diameter,
Radius and Eccentricities, providing both conditional lower bounds, and new algorithms
whose bounds are optimal under popular hypotheses in fine-grained complexity.
Some of the highlights include:\r\n- Under popular hardness hypotheses, there
can be no significantly better fully dynamic approximation algorithms than recomputing
the answer after each update, or maintaining full APSP.\r\n- Nearly optimal partially
dynamic (incremental/decremental) algorithms can be achieved via efficient reductions
to (incremental/decremental) maintenance of Single-Source Shortest Paths. For
instance, a nearly (3/2+epsilon)-approximation to Diameter in directed or undirected
n-vertex, m-edge graphs can be maintained decrementally in total time m^{1+o(1)}sqrt{n}/epsilon^2.
This nearly matches the static 3/2-approximation algorithm for the problem that
is known to be conditionally optimal."
alternative_title:
- LIPIcs
article_number: '13'
article_processing_charge: No
arxiv: 1
author:
- first_name: Bertie
full_name: Ancona, Bertie
last_name: Ancona
- 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: Liam
full_name: Roditty, Liam
last_name: Roditty
- first_name: Virginia Vassilevska
full_name: Williams, Virginia Vassilevska
last_name: Williams
- first_name: Nicole
full_name: Wein, Nicole
last_name: Wein
citation:
ama: 'Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. Algorithms and hardness
for diameter in dynamic graphs. In: 46th International Colloquium on Automata,
Languages, and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2019. doi:10.4230/LIPICS.ICALP.2019.13'
apa: 'Ancona, B., Henzinger, M. H., Roditty, L., Williams, V. V., & Wein, N.
(2019). Algorithms and hardness for diameter in dynamic graphs. In 46th International
Colloquium on Automata, Languages, and Programming (Vol. 132). Patras, Greece:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.13'
chicago: Ancona, Bertie, Monika H Henzinger, Liam Roditty, Virginia Vassilevska
Williams, and Nicole Wein. “Algorithms and Hardness for Diameter in Dynamic Graphs.”
In 46th International Colloquium on Automata, Languages, and Programming,
Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.13.
ieee: B. Ancona, M. H. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms
and hardness for diameter in dynamic graphs,” in 46th International Colloquium
on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132.
ista: 'Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. 2019. Algorithms
and hardness for diameter in dynamic graphs. 46th International Colloquium on
Automata, Languages, and Programming. ICALP: International Colloquium on Automata,
Languages, and Programming, LIPIcs, vol. 132, 13.'
mla: Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.”
46th International Colloquium on Automata, Languages, and Programming,
vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ICALP.2019.13.
short: B. Ancona, M.H. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th
International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2019.
conference:
end_date: 2019-07-12
location: Patras, Greece
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2019-07-09
date_created: 2022-08-12T08:14:51Z
date_published: 2019-07-04T00:00:00Z
date_updated: 2023-02-16T10:48:24Z
day: '04'
doi: 10.4230/LIPICS.ICALP.2019.13
extern: '1'
external_id:
arxiv:
- '811.12527'
intvolume: ' 132'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ICALP.2019.13
month: '07'
oa: 1
oa_version: Published Version
publication: 46th International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- 978-3-95977-109-2
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithms and hardness for diameter in dynamic graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 132
year: '2019'
...
---
_id: '11850'
abstract:
- lang: eng
text: 'Modern networked systems are increasingly reconfigurable, enabling demand-aware
infrastructures whose resources can be adjusted according to the workload they
currently serve. Such dynamic adjustments can be exploited to improve network
utilization and hence performance, by moving frequently interacting communication
partners closer, e.g., collocating them in the same server or datacenter. However,
dynamically changing the embedding of workloads is algorithmically challenging:
communication patterns are often not known ahead of time, but must be learned.
During the learning process, overheads related to unnecessary moves (i.e., re-embeddings)
should be minimized. This paper studies a fundamental model which captures the
tradeoff between the benefits and costs of dynamically collocating communication
partners on l servers, in an online manner. Our main contribution is a distributed
online algorithm which is asymptotically almost optimal, i.e., almost matches
the lower bound (also derived in this paper) on the competitive ratio of any (distributed
or centralized) online algorithm.'
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: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Henzinger MH, Neumann S, Schmid S. Efficient distributed workload (re-)embedding.
In: SIGMETRICS’19: International Conference on Measurement and Modeling of
Computer Systems. Association for Computing Machinery; 2019:43–44. doi:10.1145/3309697.3331503'
apa: 'Henzinger, M. H., Neumann, S., & Schmid, S. (2019). Efficient distributed
workload (re-)embedding. In SIGMETRICS’19: International Conference on Measurement
and Modeling of Computer Systems (pp. 43–44). Phoenix, AZ, United States:
Association for Computing Machinery. https://doi.org/10.1145/3309697.3331503'
chicago: 'Henzinger, Monika H, Stefan Neumann, and Stefan Schmid. “Efficient Distributed
Workload (Re-)Embedding.” In SIGMETRICS’19: International Conference on Measurement
and Modeling of Computer Systems, 43–44. Association for Computing Machinery,
2019. https://doi.org/10.1145/3309697.3331503.'
ieee: 'M. H. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload
(re-)embedding,” in SIGMETRICS’19: International Conference on Measurement
and Modeling of Computer Systems, Phoenix, AZ, United States, 2019, pp. 43–44.'
ista: 'Henzinger MH, Neumann S, Schmid S. 2019. Efficient distributed workload (re-)embedding.
SIGMETRICS’19: International Conference on Measurement and Modeling of Computer
Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer
Systems, 43–44.'
mla: 'Henzinger, Monika H., et al. “Efficient Distributed Workload (Re-)Embedding.”
SIGMETRICS’19: International Conference on Measurement and Modeling of Computer
Systems, Association for Computing Machinery, 2019, pp. 43–44, doi:10.1145/3309697.3331503.'
short: 'M.H. Henzinger, S. Neumann, S. Schmid, in:, SIGMETRICS’19: International
Conference on Measurement and Modeling of Computer Systems, Association for Computing
Machinery, 2019, pp. 43–44.'
conference:
end_date: 2019-06-28
location: Phoenix, AZ, United States
name: 'SIGMETRICS: International Conference on Measurement and Modeling of Computer
Systems'
start_date: 2019-06-24
date_created: 2022-08-16T07:14:57Z
date_published: 2019-06-20T00:00:00Z
date_updated: 2023-02-17T09:41:45Z
day: '20'
doi: 10.1145/3309697.3331503
extern: '1'
external_id:
arxiv:
- '1904.05474'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.05474
month: '06'
oa: 1
oa_version: Preprint
page: 43–44
publication: 'SIGMETRICS''19: International Conference on Measurement and Modeling
of Computer Systems'
publication_identifier:
isbn:
- 978-1-4503-6678-6
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient distributed workload (re-)embedding
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11853'
abstract:
- lang: eng
text: We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate
minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input
set system is undergoing element insertions and deletions. Here, n denotes the
number of elements, each element appears in at most f sets, and the cost of each
set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17],
implies that there is a deterministic algorithm for this problem with O(f log(Cn))
amortized update time and O(min(log n, f)) -approximation ratio, which nearly
matches the polynomial-time hardness of approximation for minimum set cover in
the static setting. Our update time is only O(log (Cn)) away from a trivial lower
bound. Prior to our work, the previous best approximation ratio guaranteed by
deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15].
In contrast, the only result that guaranteed O(f) -approximation was obtained
very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with
(1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the
extra O(f) factor in the update time compared to our and Gupta~et~al.'s results,
the Abboud~et~al.~algorithm is randomized, and works only when the adversary is
oblivious and the sets are unweighted (each set has the same cost). We achieve
our result via the primal-dual approach, by maintaining a fractional packing solution
as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and
Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual
algorithms that try to satisfy some local constraints for individual sets at all
time, our algorithm basically waits until the dual solution changes significantly
globally, and fixes the solution only where the fix is needed.
article_processing_charge: No
arxiv: 1
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- 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: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Bhattacharya S, Henzinger MH, Nanongkai D. A new deterministic algorithm for
dynamic set cover. In: 60th Annual Symposium on Foundations of Computer Science.
Institute of Electrical and Electronics Engineers; 2019:406-423. doi:10.1109/focs.2019.00033'
apa: 'Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2019). A new deterministic
algorithm for dynamic set cover. In 60th Annual Symposium on Foundations of
Computer Science (pp. 406–423). Baltimore, MD, United States: Institute of
Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2019.00033'
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “A New
Deterministic Algorithm for Dynamic Set Cover.” In 60th Annual Symposium on
Foundations of Computer Science, 406–23. Institute of Electrical and Electronics
Engineers, 2019. https://doi.org/10.1109/focs.2019.00033.
ieee: S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm
for dynamic set cover,” in 60th Annual Symposium on Foundations of Computer
Science, Baltimore, MD, United States, 2019, pp. 406–423.
ista: 'Bhattacharya S, Henzinger MH, Nanongkai D. 2019. A new deterministic algorithm
for dynamic set cover. 60th Annual Symposium on Foundations of Computer Science.
FOCS: Annual Symposium on Foundations of Computer Science, 406–423.'
mla: Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set
Cover.” 60th Annual Symposium on Foundations of Computer Science, Institute
of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:10.1109/focs.2019.00033.
short: S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 60th Annual Symposium
on Foundations of Computer Science, Institute of Electrical and Electronics Engineers,
2019, pp. 406–423.
conference:
end_date: 2019-11-12
location: Baltimore, MD, United States
name: 'FOCS: Annual Symposium on Foundations of Computer Science'
start_date: 2019-11-09
date_created: 2022-08-16T08:00:00Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2023-02-17T09:50:37Z
day: '01'
doi: 10.1109/focs.2019.00033
extern: '1'
external_id:
arxiv:
- '1909.11600'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.11600
month: '11'
oa: 1
oa_version: Preprint
page: 406-423
publication: 60th Annual Symposium on Foundations of Computer Science
publication_identifier:
eisbn:
- 978-1-7281-4952-3
isbn:
- 978-1-7281-4953-0
issn:
- 2575-8454
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: A new deterministic algorithm for dynamic set cover
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11865'
abstract:
- lang: eng
text: We present the first sublinear-time algorithm that can compute the edge connectivity
λ of a network exactly on distributed message-passing networks (the CONGEST model),
as long as the network contains no multi-edge. We present the first sublinear-time
algorithm for a distributed message-passing network sto compute its edge connectivity
λ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm
takes Õ(n1−1/353D1/353+n1−1/706) time to compute λ and a cut of cardinality λ
with high probability, where n and D are the number of nodes and the diameter
of the network, respectively, and Õ hides polylogarithmic factors. This running
time is sublinear in n (i.e. Õ(n1−є)) whenever D is. Previous sublinear-time distributed
algorithms can solve this problem either (i) exactly only when λ=O(n1/8−є) [Thurimella
PODC’95; Pritchard, Thurimella, ACM Trans. Algorithms’11; Nanongkai, Su, DISC’14]
or (ii) approximately [Ghaffari, Kuhn, DISC’13; Nanongkai, Su, DISC’14]. To achieve
this we develop and combine several new techniques. First, we design the first
distributed algorithm that can compute a k-edge connectivity certificate for any
k=O(n1−є) in time Õ(√nk+D). The previous sublinear-time algorithm can do so only
when k=o(√n) [Thurimella PODC’95]. In fact, our algorithm can be turned into the
first parallel algorithm with polylogarithmic depth and near-linear work. Previous
near-linear work algorithms are essentially sequential and previous polylogarithmic-depth
algorithms require Ω(mk) work in the worst case (e.g. [Karger, Motwani, STOC’93]).
Second, we show that by combining the recent distributed expander decomposition
technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential
deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15],
we can decompose the network into a sublinear number of clusters with small average
diameter and without any mincut separating a cluster (except the “trivial” ones).
This leads to a simplification of the Kawarabayashi-Thorup framework (except that
we are randomized while they are deterministic). This might make this framework
more useful in other models of computation. Finally, by extending the tree packing
technique from [Karger STOC’96], we can find the minimum cut in time proportional
to the number of components. As a byproduct of this technique, we obtain an Õ(n)-time
algorithm for computing exact minimum cut for weighted graphs.
article_processing_charge: No
arxiv: 1
author:
- first_name: Mohit
full_name: Daga, Mohit
last_name: Daga
- 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: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
- first_name: Thatchaphol
full_name: Saranurak, Thatchaphol
last_name: Saranurak
citation:
ama: 'Daga M, Henzinger MH, Nanongkai D, Saranurak T. Distributed edge connectivity
in sublinear time. In: Proceedings of the 51st Annual ACM SIGACT Symposium
on Theory of Computing. Association for Computing Machinery; 2019:343–354.
doi:10.1145/3313276.3316346'
apa: 'Daga, M., Henzinger, M. H., Nanongkai, D., & Saranurak, T. (2019). Distributed
edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM
SIGACT Symposium on Theory of Computing (pp. 343–354). Phoenix, AZ, United
States: Association for Computing Machinery. https://doi.org/10.1145/3313276.3316346'
chicago: Daga, Mohit, Monika H Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak.
“Distributed Edge Connectivity in Sublinear Time.” In Proceedings of the 51st
Annual ACM SIGACT Symposium on Theory of Computing, 343–354. Association for
Computing Machinery, 2019. https://doi.org/10.1145/3313276.3316346.
ieee: M. Daga, M. H. Henzinger, D. Nanongkai, and T. Saranurak, “Distributed edge
connectivity in sublinear time,” in Proceedings of the 51st Annual ACM SIGACT
Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 343–354.
ista: 'Daga M, Henzinger MH, Nanongkai D, Saranurak T. 2019. Distributed edge connectivity
in sublinear time. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory
of Computing. STOC: Symposium on Theory of Computing, 343–354.'
mla: Daga, Mohit, et al. “Distributed Edge Connectivity in Sublinear Time.” Proceedings
of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association
for Computing Machinery, 2019, pp. 343–354, doi:10.1145/3313276.3316346.
short: M. Daga, M.H. Henzinger, D. Nanongkai, T. Saranurak, in:, Proceedings of
the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing
Machinery, 2019, pp. 343–354.
conference:
end_date: 2019-06-26
location: Phoenix, AZ, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2019-06-23
date_created: 2022-08-16T09:11:17Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-02-17T10:26:25Z
day: '01'
doi: 10.1145/3313276.3316346
extern: '1'
external_id:
arxiv:
- '1904.04341'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.04341
month: '06'
oa: 1
oa_version: Preprint
page: 343–354
publication: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
publication_identifier:
isbn:
- 978-1-4503-6705-9
issn:
- 0737-8017
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Distributed edge connectivity in sublinear time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11871'
abstract:
- lang: eng
text: "Many dynamic graph algorithms have an amortized update time, rather than
a stronger worst-case guarantee. But amortized data structures are not suitable
for real-time systems, where each individual operation has to be executed quickly.
For this reason, there exist many recent randomized results that aim to provide
a guarantee stronger than amortized expected. The strongest possible guarantee
for a randomized algorithm is that it is always correct (Las Vegas), and has high-probability
worst-case update time, which gives a bound on the time for each individual operation
that holds with high probability.\r\n\r\nIn this paper we present the first polylogarithmic
high-probability worst-case time bounds for the dynamic spanner and the dynamic
maximal matching problem.\r\n\r\n1.\t\r\nFor dynamic spanner, the only known o(n)
worst-case bounds were O(n3/4) high-probability worst-case update time for maintaining
a 3-spanner, and O(n5/9) for maintaining a 5-spanner. We give a O(1)k log3(n)
high-probability worst-case time bound for maintaining a (2k – 1)-spanner, which
yields the first worst-case polylog update time for all constant k. (All the results
above maintain the optimal tradeoff of stretch 2k – 1 and Õ(n1+1/k) edges.)\r\n\r\n2.\t\r\nFor
dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm
with o(n) worst-case time bound was known and we present an algorithm with O(log5
(n)) high-probability worst-case time; similar worst-case bounds existed only
for maintaining a matching that was (2 + ∊)-approximate, and hence not maximal.\r\n\r\nOur
results are achieved using a new approach for converting amortized guarantees
to worst-case ones for randomized data structures by going through a third type
of guarantee, which is a middle ground between the two above: an algorithm is
said to have worst-case expected update time α if for every update σ, the expected
time to process σ is at most α. Although stronger than amortized expected, the
worst-case expected guarantee does not resolve the fundamental problem of amortization:
a worst-case expected update time of O(1) still allows for the possibility that
every 1/f(n) updates requires Θ(f(n)) time to process, for arbitrarily high f(n).
In this paper we present a black-box reduction that converts any data structure
with worst-case expected update time into one with a high-probability worst-case
update time: the query time remains the same, while the update time increases
by a factor of O(log2(n)).\r\n\r\nThus we achieve our results in two steps: (1)
First we show how to convert existing dynamic graph algorithms with amortized
expected polylogarithmic running times into algorithms with worst-case expected
polylogarithmic running times. (2) Then we use our black-box reduction to achieve
the polylogarithmic high-probability worst-case time bound. All our algorithms
are Las-Vegas-type algorithms."
article_processing_charge: No
arxiv: 1
author:
- first_name: Aaron
full_name: Bernstein, Aaron
last_name: Bernstein
- first_name: Sebastian
full_name: Forster, Sebastian
last_name: Forster
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic
spanner and dynamic maximal matching. In: 30th Annual ACM-SIAM Symposium on
Discrete Algorithms. Society for Industrial and Applied Mathematics; 2019:1899-1918.
doi:10.1137/1.9781611975482.115'
apa: 'Bernstein, A., Forster, S., & Henzinger, M. H. (2019). A deamortization
approach for dynamic spanner and dynamic maximal matching. In 30th Annual ACM-SIAM
Symposium on Discrete Algorithms (pp. 1899–1918). San Diego, CA, United States:
Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.115'
chicago: Bernstein, Aaron, Sebastian Forster, and Monika H Henzinger. “A Deamortization
Approach for Dynamic Spanner and Dynamic Maximal Matching.” In 30th Annual
ACM-SIAM Symposium on Discrete Algorithms, 1899–1918. Society for Industrial
and Applied Mathematics, 2019. https://doi.org/10.1137/1.9781611975482.115.
ieee: A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach
for dynamic spanner and dynamic maximal matching,” in 30th Annual ACM-SIAM
Symposium on Discrete Algorithms, San Diego, CA, United States, 2019, pp.
1899–1918.
ista: 'Bernstein A, Forster S, Henzinger MH. 2019. A deamortization approach for
dynamic spanner and dynamic maximal matching. 30th Annual ACM-SIAM Symposium on
Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1899–1918.'
mla: Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and
Dynamic Maximal Matching.” 30th Annual ACM-SIAM Symposium on Discrete Algorithms,
Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:10.1137/1.9781611975482.115.
short: A. Bernstein, S. Forster, M.H. Henzinger, in:, 30th Annual ACM-SIAM Symposium
on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019,
pp. 1899–1918.
conference:
end_date: 2019-01-09
location: San Diego, CA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2019-01-06
date_created: 2022-08-16T09:50:33Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2023-02-21T16:31:21Z
day: '01'
doi: 10.1137/1.9781611975482.115
extern: '1'
external_id:
arxiv:
- '1810.10932'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1810.10932
month: '01'
oa: 1
oa_version: Preprint
page: 1899-1918
publication: 30th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-1-61197-548-2
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11871'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: A deamortization approach for dynamic spanner and dynamic maximal matching
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11898'
abstract:
- lang: eng
text: "We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (FOCS'12),
and Clifford et al. (FOCS'15) to present a general framework that gives amortized
lower bounds on the update and query times of dynamic data structures. Using our
framework, we present two concrete results.\r\n(1) For the dynamic polynomial
evaluation problem, where the polynomial is defined over a finite field of size
n1+Ω(1) and has degree n, any dynamic data structure must either have an amortized
update time of Ω((lgn/lglgn)2) or an amortized query time of Ω((lgn/lglgn)2).\r\n(2)
For the dynamic online matrix vector multiplication problem, where we get an n×n
matrix whose entires are drawn from a finite field of size nΘ(1), any dynamic
data structure must either have an amortized update time of Ω((lgn/lglgn)2) or
an amortized query time of Ω(n⋅(lgn/lglgn)2).\r\nFor these two problems, the previous
works by Larsen (FOCS'12) and Clifford et al. (FOCS'15) gave the same lower bounds,
but only for worst case update and query times. Our bounds match the highest unconditional
lower bounds known till date for any dynamic problem in the cell-probe model."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- 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
citation:
ama: Bhattacharya S, Henzinger MH, Neumann S. New amortized cell-probe lower bounds
for dynamic problems. Theoretical Computer Science. 2019;779:72-87. doi:10.1016/j.tcs.2019.01.043
apa: Bhattacharya, S., Henzinger, M. H., & Neumann, S. (2019). New amortized
cell-probe lower bounds for dynamic problems. Theoretical Computer Science.
Elsevier. https://doi.org/10.1016/j.tcs.2019.01.043
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Stefan Neumann. “New Amortized
Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science.
Elsevier, 2019. https://doi.org/10.1016/j.tcs.2019.01.043.
ieee: S. Bhattacharya, M. H. Henzinger, and S. Neumann, “New amortized cell-probe
lower bounds for dynamic problems,” Theoretical Computer Science, vol.
779. Elsevier, pp. 72–87, 2019.
ista: Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower
bounds for dynamic problems. Theoretical Computer Science. 779, 72–87.
mla: Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic
Problems.” Theoretical Computer Science, vol. 779, Elsevier, 2019, pp.
72–87, doi:10.1016/j.tcs.2019.01.043.
short: S. Bhattacharya, M.H. Henzinger, S. Neumann, Theoretical Computer Science
779 (2019) 72–87.
date_created: 2022-08-17T09:02:15Z
date_published: 2019-08-02T00:00:00Z
date_updated: 2022-09-09T11:29:04Z
day: '02'
doi: 10.1016/j.tcs.2019.01.043
extern: '1'
external_id:
arxiv:
- '1902.02304'
intvolume: ' 779'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.02304
month: '08'
oa: 1
oa_version: Preprint
page: 72-87
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: New amortized cell-probe lower bounds for dynamic problems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 779
year: '2019'
...
---
_id: '11982'
abstract:
- lang: eng
text: A carbon nitride material can be combined with homogeneous nickel catalysts
for light-mediated cross-couplings of aryl bromides with alcohols under mild conditions.
The metal-free heterogeneous semiconductor is fully recyclable and couples a broad
range of electron-poor aryl bromides with primary and secondary alcohols as well
as water. The application for intramolecular reactions and the synthesis of active
pharmaceutical ingredients was demonstrated. The catalytic protocol is applicable
for the coupling of aryl iodides with thiols as well.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Cristian
full_name: Cavedon, Cristian
last_name: Cavedon
- first_name: Amiera
full_name: Madani, Amiera
last_name: Madani
- first_name: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
- 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: Cavedon C, Madani A, Seeberger PH, Pieber B. Semiheterogeneous dual nickel/photocatalytic
(thio)etherification using carbon nitrides. Organic Letters. 2019;21(13):5331-5334.
doi:10.1021/acs.orglett.9b01957
apa: Cavedon, C., Madani, A., Seeberger, P. H., & Pieber, B. (2019). Semiheterogeneous
dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic
Letters. American Chemical Society. https://doi.org/10.1021/acs.orglett.9b01957
chicago: Cavedon, Cristian, Amiera Madani, Peter H. Seeberger, and Bartholomäus
Pieber. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using
Carbon Nitrides.” Organic Letters. American Chemical Society, 2019. https://doi.org/10.1021/acs.orglett.9b01957.
ieee: C. Cavedon, A. Madani, P. H. Seeberger, and B. Pieber, “Semiheterogeneous
dual nickel/photocatalytic (thio)etherification using carbon nitrides,” Organic
Letters, vol. 21, no. 13. American Chemical Society, pp. 5331–5334, 2019.
ista: Cavedon C, Madani A, Seeberger PH, Pieber B. 2019. Semiheterogeneous dual
nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters.
21(13), 5331–5334.
mla: Cavedon, Cristian, et al. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification
Using Carbon Nitrides.” Organic Letters, vol. 21, no. 13, American Chemical
Society, 2019, pp. 5331–34, doi:10.1021/acs.orglett.9b01957.
short: C. Cavedon, A. Madani, P.H. Seeberger, B. Pieber, Organic Letters 21 (2019)
5331–5334.
date_created: 2022-08-25T11:18:00Z
date_published: 2019-07-05T00:00:00Z
date_updated: 2023-02-21T10:10:19Z
day: '05'
doi: 10.1021/acs.orglett.9b01957
extern: '1'
external_id:
pmid:
- '31247752'
intvolume: ' 21'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1021/acs.orglett.9b01957
month: '07'
oa: 1
oa_version: Published Version
page: 5331-5334
pmid: 1
publication: Organic Letters
publication_identifier:
eissn:
- 1523-7052
issn:
- 1523-7060
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon
nitrides
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2019'
...
---
_id: '11984'
abstract:
- lang: eng
text: Differentially protected galactosamine building blocks are key components
for the synthesis of human and bacterial oligosaccharides. The azidophenylselenylation
of 3,4,6-tri-O-acetyl-d-galactal provides straightforward access to the corresponding
2-nitrogenated glycoside. Poor reproducibility and the use of azides that lead
to the formation of potentially explosive and toxic species limit the scalability
of this reaction and render it a bottleneck for carbohydrate synthesis. Here,
we present a method for the safe, efficient, and reliable azidophenylselenylation
of 3,4,6-tri-O-acetyl-d-galactal at room temperature, using continuous flow chemistry.
Careful analysis of the transformation resulted in reaction conditions that produce
minimal side products while the reaction time was reduced drastically when compared
to batch reactions. The flow setup is readily scalable to process 5 mmol of galactal
in 3 h, producing 1.2 mmol/h of product.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Mónica
full_name: Guberman, Mónica
last_name: Guberman
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
citation:
ama: Guberman M, Pieber B, Seeberger PH. Safe and scalable continuous flow azidophenylselenylation
of galactal to prepare galactosamine building blocks. Organic Process Research
and Development. 2019;23(12):2764-2770. doi:10.1021/acs.oprd.9b00456
apa: Guberman, M., Pieber, B., & Seeberger, P. H. (2019). Safe and scalable
continuous flow azidophenylselenylation of galactal to prepare galactosamine building
blocks. Organic Process Research and Development. American Chemical Society.
https://doi.org/10.1021/acs.oprd.9b00456
chicago: Guberman, Mónica, Bartholomäus Pieber, and Peter H. Seeberger. “Safe and
Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine
Building Blocks.” Organic Process Research and Development. American Chemical
Society, 2019. https://doi.org/10.1021/acs.oprd.9b00456.
ieee: M. Guberman, B. Pieber, and P. H. Seeberger, “Safe and scalable continuous
flow azidophenylselenylation of galactal to prepare galactosamine building blocks,”
Organic Process Research and Development, vol. 23, no. 12. American Chemical
Society, pp. 2764–2770, 2019.
ista: Guberman M, Pieber B, Seeberger PH. 2019. Safe and scalable continuous flow
azidophenylselenylation of galactal to prepare galactosamine building blocks.
Organic Process Research and Development. 23(12), 2764–2770.
mla: Guberman, Mónica, et al. “Safe and Scalable Continuous Flow Azidophenylselenylation
of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research
and Development, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70,
doi:10.1021/acs.oprd.9b00456.
short: M. Guberman, B. Pieber, P.H. Seeberger, Organic Process Research and Development
23 (2019) 2764–2770.
date_created: 2022-08-25T11:30:33Z
date_published: 2019-12-20T00:00:00Z
date_updated: 2023-02-21T10:10:23Z
day: '20'
doi: 10.1021/acs.oprd.9b00456
extern: '1'
intvolume: ' 23'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1021/acs.oprd.9b00456
month: '12'
oa: 1
oa_version: Published Version
page: 2764-2770
publication: Organic Process Research and Development
publication_identifier:
eissn:
- 1520-586X
issn:
- 1083-6160
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Safe and scalable continuous flow azidophenylselenylation of galactal to prepare
galactosamine building blocks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2019'
...
---
_id: '12192'
abstract:
- lang: eng
text: Transposable elements (TEs), the movement of which can damage the genome,
are epigenetically silenced in eukaryotes. Intriguingly, TEs are activated in
the sperm companion cell – vegetative cell (VC) – of the flowering plant Arabidopsis
thaliana. However, the extent and mechanism of this activation are unknown. Here
we show that about 100 heterochromatic TEs are activated in VCs, mostly by DEMETER-catalyzed
DNA demethylation. We further demonstrate that DEMETER access to some of these
TEs is permitted by the natural depletion of linker histone H1 in VCs. Ectopically
expressed H1 suppresses TEs in VCs by reducing DNA demethylation and via a methylation-independent
mechanism. We demonstrate that H1 is required for heterochromatin condensation
in plant cells and show that H1 overexpression creates heterochromatic foci in
the VC progenitor cell. Taken together, our results demonstrate that the natural
depletion of H1 during male gametogenesis facilitates DEMETER-directed DNA demethylation,
heterochromatin relaxation, and TE activation.
acknowledgement: We thank David Twell for the pDONR-P4-P1R-pLAT52 and pDONR-P2R-P3-mRFP
vectors, the John Innes Centre Bioimaging Facility (Elaine Barclay and Grant Calder)
for their assistance with microscopy, and the Norwich BioScience Institute Partnership
Computing infrastructure for Science Group for High Performance Computing resources.
This work was funded by a Biotechnology and Biological Sciences Research Council
(BBSRC) David Phillips Fellowship (BB/L025043/1; SH, JZ and XF), a European Research
Council Starting Grant ('SexMeth' 804981; XF) and a Grant to Exceptional Researchers
by the Gatsby Charitable Foundation (SH and XF).
article_number: '42530'
article_processing_charge: No
article_type: original
author:
- first_name: Shengbo
full_name: He, Shengbo
last_name: He
- first_name: Martin
full_name: Vickers, Martin
last_name: Vickers
- first_name: Jingyi
full_name: Zhang, Jingyi
last_name: Zhang
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
citation:
ama: He S, Vickers M, Zhang J, Feng X. Natural depletion of histone H1 in sex cells
causes DNA demethylation, heterochromatin decondensation and transposon activation.
eLife. 2019;8. doi:10.7554/elife.42530
apa: He, S., Vickers, M., Zhang, J., & Feng, X. (2019). Natural depletion of
histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation
and transposon activation. ELife. eLife Sciences Publications, Ltd. https://doi.org/10.7554/elife.42530
chicago: He, Shengbo, Martin Vickers, Jingyi Zhang, and Xiaoqi Feng. “Natural Depletion
of Histone H1 in Sex Cells Causes DNA Demethylation, Heterochromatin Decondensation
and Transposon Activation.” ELife. eLife Sciences Publications, Ltd, 2019.
https://doi.org/10.7554/elife.42530.
ieee: S. He, M. Vickers, J. Zhang, and X. Feng, “Natural depletion of histone H1
in sex cells causes DNA demethylation, heterochromatin decondensation and transposon
activation,” eLife, vol. 8. eLife Sciences Publications, Ltd, 2019.
ista: He S, Vickers M, Zhang J, Feng X. 2019. Natural depletion of histone H1 in
sex cells causes DNA demethylation, heterochromatin decondensation and transposon
activation. eLife. 8, 42530.
mla: He, Shengbo, et al. “Natural Depletion of Histone H1 in Sex Cells Causes DNA
Demethylation, Heterochromatin Decondensation and Transposon Activation.” ELife,
vol. 8, 42530, eLife Sciences Publications, Ltd, 2019, doi:10.7554/elife.42530.
short: S. He, M. Vickers, J. Zhang, X. Feng, ELife 8 (2019).
date_created: 2023-01-16T09:17:21Z
date_published: 2019-05-28T00:00:00Z
date_updated: 2023-05-08T10:54:12Z
day: '28'
ddc:
- '580'
department:
- _id: XiFe
doi: 10.7554/elife.42530
extern: '1'
external_id:
unknown:
- '31135340'
file:
- access_level: open_access
checksum: ea6b89c20d59e5eb3646916fe5d568ad
content_type: application/pdf
creator: alisjak
date_created: 2023-02-07T09:42:46Z
date_updated: 2023-02-07T09:42:46Z
file_id: '12525'
file_name: 2019_elife_He.pdf
file_size: 2493837
relation: main_file
success: 1
file_date_updated: 2023-02-07T09:42:46Z
has_accepted_license: '1'
intvolume: ' 8'
keyword:
- General Immunology and Microbiology
- General Biochemistry
- Genetics and Molecular Biology
- General Medicine
- General Neuroscience
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6594752/
month: '05'
oa: 1
oa_version: Published Version
publication: eLife
publication_identifier:
issn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications, Ltd
quality_controlled: '1'
scopus_import: '1'
status: public
title: Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin
decondensation and transposon activation
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: 8
year: '2019'
...
---
_id: '12600'
abstract:
- lang: eng
text: The snow cover dynamics of High Mountain Asia are usually assessed at spatial
resolutions of 250 m or greater, but this scale is too coarse to clearly represent
the rugged topography common to the region. Higher-resolution measurement of snow-covered
area often results in biased sampling due to cloud cover and deep shadows. We
therefore develop a Normalized Difference Snow Index-based workflow to delineate
snow lines from Landsat Thematic Mapper/Enhanced Thematic Mapper+ imagery and
apply it to the upper Langtang Valley in Nepal, processing 194 scenes spanning
1999 to 2013. For each scene, we determine the spatial distribution of snow line
altitudes (SLAs) with respect to aspect and across six subcatchments. Our results
show that the mean SLA exhibits distinct seasonal behavior based on aspect and
subcatchment position. We find that SLA dynamics respond to spatial and seasonal
trade-offs in precipitation, temperature, and solar radiation, which act as primary
controls. We identify two SLA spatial gradients, which we attribute to the effect
of spatially variable precipitation. Our results also reveal that aspect-related
SLA differences vary seasonally and are influenced by solar radiation. In terms
of seasonal dominant controls, we demonstrate that the snow line is controlled
by snow precipitation in winter, melt in premonsoon, a combination of both in
postmonsoon, and temperature in monsoon, explaining to a large extent the spatial
and seasonal variability of the SLA in the upper Langtang Valley. We conclude
that while SLA and snow-covered area are complementary metrics, the SLA has a
strong potential for understanding local-scale snow cover dynamics and their controlling
mechanisms.
article_processing_charge: No
article_type: original
author:
- first_name: Marc
full_name: Girona‐Mata, Marc
last_name: Girona‐Mata
- first_name: Evan S.
full_name: Miles, Evan S.
last_name: Miles
- first_name: Silvan
full_name: Ragettli, Silvan
last_name: Ragettli
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: Girona‐Mata M, Miles ES, Ragettli S, Pellicciotti F. High‐resolution snowline
delineation from Landsat imagery to infer snow cover controls in a Himalayan catchment.
Water Resources Research. 2019;55(8):6754-6772. doi:10.1029/2019wr024935
apa: Girona‐Mata, M., Miles, E. S., Ragettli, S., & Pellicciotti, F. (2019).
High‐resolution snowline delineation from Landsat imagery to infer snow cover
controls in a Himalayan catchment. Water Resources Research. American Geophysical
Union. https://doi.org/10.1029/2019wr024935
chicago: Girona‐Mata, Marc, Evan S. Miles, Silvan Ragettli, and Francesca Pellicciotti.
“High‐resolution Snowline Delineation from Landsat Imagery to Infer Snow Cover
Controls in a Himalayan Catchment.” Water Resources Research. American
Geophysical Union, 2019. https://doi.org/10.1029/2019wr024935.
ieee: M. Girona‐Mata, E. S. Miles, S. Ragettli, and F. Pellicciotti, “High‐resolution
snowline delineation from Landsat imagery to infer snow cover controls in a Himalayan
catchment,” Water Resources Research, vol. 55, no. 8. American Geophysical
Union, pp. 6754–6772, 2019.
ista: Girona‐Mata M, Miles ES, Ragettli S, Pellicciotti F. 2019. High‐resolution
snowline delineation from Landsat imagery to infer snow cover controls in a Himalayan
catchment. Water Resources Research. 55(8), 6754–6772.
mla: Girona‐Mata, Marc, et al. “High‐resolution Snowline Delineation from Landsat
Imagery to Infer Snow Cover Controls in a Himalayan Catchment.” Water Resources
Research, vol. 55, no. 8, American Geophysical Union, 2019, pp. 6754–72, doi:10.1029/2019wr024935.
short: M. Girona‐Mata, E.S. Miles, S. Ragettli, F. Pellicciotti, Water Resources
Research 55 (2019) 6754–6772.
date_created: 2023-02-20T08:12:59Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2023-02-28T12:14:18Z
day: '01'
doi: 10.1029/2019wr024935
extern: '1'
intvolume: ' 55'
issue: '8'
keyword:
- Water Science and Technology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1029/2019WR024935
month: '08'
oa: 1
oa_version: Published Version
page: 6754-6772
publication: Water Resources Research
publication_identifier:
eissn:
- 1944-7973
issn:
- 0043-1397
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: High‐resolution snowline delineation from Landsat imagery to infer snow cover
controls in a Himalayan catchment
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2019'
...
---
_id: '12601'
abstract:
- lang: eng
text: Ice cliffs and ponds on debris-covered glaciers have received increased attention
due to their role in amplifying local melt. However, very few studies have looked
at these features on the catchment scale to determine their patterns and changes
in space and time. We have compiled a detailed inventory of cliffs and ponds in
the Langtang catchment, central Himalaya, from six high-resolution satellite orthoimages
and DEMs between 2006 and 2015, and a historic orthophoto from 1974. Cliffs cover
between 1.4% (± 0.4%) in the dry and 3.4% (± 0.9%) in the wet seasons and ponds
between 0.6% (± 0.1%) and 1.6% (± 0.3%) of the total debris-covered tongues. We
find large variations between seasons, as cliffs and ponds tend to grow in the
wetter monsoon period, but there is no obvious trend in total area over the study
period. The inventory further shows that cliffs are predominately north-facing
irrespective of the glacier flow direction. Both cliffs and ponds appear in higher
densities several hundred metres from the terminus in areas where tributaries
reach the main glacier tongue. On the largest glacier in the catchment ~10% of
all cliffs and ponds persisted over nearly a decade.
article_processing_charge: No
article_type: original
author:
- first_name: JAKOB F.
full_name: STEINER, JAKOB F.
last_name: STEINER
- first_name: PASCAL
full_name: BURI, PASCAL
last_name: BURI
- first_name: EVAN S.
full_name: MILES, EVAN S.
last_name: MILES
- first_name: SILVAN
full_name: RAGETTLI, SILVAN
last_name: RAGETTLI
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
citation:
ama: 'STEINER JF, BURI P, MILES ES, RAGETTLI S, Pellicciotti F. Supraglacial ice
cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution and
characteristics. Journal of Glaciology. 2019;65(252):617-632. doi:10.1017/jog.2019.40'
apa: 'STEINER, J. F., BURI, P., MILES, E. S., RAGETTLI, S., & Pellicciotti,
F. (2019). Supraglacial ice cliffs and ponds on debris-covered glaciers: Spatio-temporal
distribution and characteristics. Journal of Glaciology. Cambridge University
Press. https://doi.org/10.1017/jog.2019.40'
chicago: 'STEINER, JAKOB F., PASCAL BURI, EVAN S. MILES, SILVAN RAGETTLI, and Francesca
Pellicciotti. “Supraglacial Ice Cliffs and Ponds on Debris-Covered Glaciers: Spatio-Temporal
Distribution and Characteristics.” Journal of Glaciology. Cambridge University
Press, 2019. https://doi.org/10.1017/jog.2019.40.'
ieee: 'J. F. STEINER, P. BURI, E. S. MILES, S. RAGETTLI, and F. Pellicciotti, “Supraglacial
ice cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution
and characteristics,” Journal of Glaciology, vol. 65, no. 252. Cambridge
University Press, pp. 617–632, 2019.'
ista: 'STEINER JF, BURI P, MILES ES, RAGETTLI S, Pellicciotti F. 2019. Supraglacial
ice cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution
and characteristics. Journal of Glaciology. 65(252), 617–632.'
mla: 'STEINER, JAKOB F., et al. “Supraglacial Ice Cliffs and Ponds on Debris-Covered
Glaciers: Spatio-Temporal Distribution and Characteristics.” Journal of Glaciology,
vol. 65, no. 252, Cambridge University Press, 2019, pp. 617–32, doi:10.1017/jog.2019.40.'
short: J.F. STEINER, P. BURI, E.S. MILES, S. RAGETTLI, F. Pellicciotti, Journal
of Glaciology 65 (2019) 617–632.
date_created: 2023-02-20T08:13:03Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2023-02-28T12:11:07Z
day: '01'
doi: 10.1017/jog.2019.40
extern: '1'
intvolume: ' 65'
issue: '252'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1017/jog.2019.40
month: '08'
oa: 1
oa_version: Published Version
page: 617-632
publication: Journal of Glaciology
publication_identifier:
eissn:
- 1727-5652
issn:
- 0022-1430
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Supraglacial ice cliffs and ponds on debris-covered glaciers: Spatio-temporal
distribution and characteristics'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 65
year: '2019'
...