---
_id: '430'
abstract:
- lang: eng
text: In this issue of GENETICS, a new method for detecting natural selection on
polygenic traits is developed and applied to sev- eral human examples ( Racimo
et al. 2018 ). By de fi nition, many loci contribute to variation in polygenic
traits, and a challenge for evolutionary ge neticists has been that these traits
can evolve by small, nearly undetectable shifts in allele frequencies across each
of many, typically unknown, loci. Recently, a helpful remedy has arisen. Genome-wide
associ- ation studies (GWAS) have been illuminating sets of loci that can be interrogated
jointly for c hanges in allele frequencies. By aggregating small signal s of change
across many such loci, directional natural selection is now in principle detect-
able using genetic data, even for highly polygenic traits. This is an exciting
arena of progress – with these methods, tests can be made for selection associated
with traits, and we can now study selection in what may be its most prevalent
mode. The continuing fast pace of GWAS publications suggest there will be many
more polygenic tests of selection in the near future, as every new GWAS is an
opportunity for an accom- panying test of polygenic selection. However, it is
important to be aware of complications th at arise in interpretation, especially
given that these studies may easily be misinter- preted both in and outside the
evolutionary genetics commu- nity. Here, we provide context for understanding
polygenic tests and urge caution regarding how these results are inter- preted
and reported upon more broadly.
article_processing_charge: No
author:
- first_name: John
full_name: Novembre, John
last_name: Novembre
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Novembre J, Barton NH. Tread lightly interpreting polygenic tests of selection.
Genetics. 2018;208(4):1351-1355. doi:10.1534/genetics.118.300786
apa: Novembre, J., & Barton, N. H. (2018). Tread lightly interpreting polygenic
tests of selection. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.118.300786
chicago: Novembre, John, and Nicholas H Barton. “Tread Lightly Interpreting Polygenic
Tests of Selection.” Genetics. Genetics Society of America, 2018. https://doi.org/10.1534/genetics.118.300786.
ieee: J. Novembre and N. H. Barton, “Tread lightly interpreting polygenic tests
of selection,” Genetics, vol. 208, no. 4. Genetics Society of America,
pp. 1351–1355, 2018.
ista: Novembre J, Barton NH. 2018. Tread lightly interpreting polygenic tests of
selection. Genetics. 208(4), 1351–1355.
mla: Novembre, John, and Nicholas H. Barton. “Tread Lightly Interpreting Polygenic
Tests of Selection.” Genetics, vol. 208, no. 4, Genetics Society of America,
2018, pp. 1351–55, doi:10.1534/genetics.118.300786.
short: J. Novembre, N.H. Barton, Genetics 208 (2018) 1351–1355.
date_created: 2018-12-11T11:46:26Z
date_published: 2018-04-01T00:00:00Z
date_updated: 2023-09-19T10:17:30Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1534/genetics.118.300786
external_id:
isi:
- '000429094400005'
file:
- access_level: open_access
checksum: 3d838dc285df394376555b794b6a5ad1
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:40Z
date_updated: 2020-07-14T12:46:26Z
file_id: '4958'
file_name: IST-2018-1012-v1+1_2018_Barton_Tread.pdf
file_size: 500129
relation: main_file
file_date_updated: 2020-07-14T12:46:26Z
has_accepted_license: '1'
intvolume: ' 208'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 1351 - 1355
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '7393'
pubrep_id: '1012'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tread lightly interpreting polygenic tests of selection
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 208
year: '2018'
...
---
_id: '434'
abstract:
- lang: eng
text: In this paper, we present a formal model-driven design approach to establish
a safety-assured implementation of multifunction vehicle bus controller (MVBC),
which controls the data transmission among the devices of the vehicle. First,
the generic models and safety requirements described in International Electrotechnical
Commission Standard 61375 are formalized as time automata and timed computation
tree logic formulas, respectively. With model checking tool Uppaal, we verify
whether or not the constructed timed automata satisfy the formulas and several
logic inconsistencies in the original standard are detected and corrected. Then,
we apply the code generation tool Times to generate C code from the verified model,
which is later synthesized into a real MVBC chip, with some handwriting glue code.
Furthermore, the runtime verification tool RMOR is applied on the integrated code,
to verify some safety requirements that cannot be formalized on the timed automata.
For evaluation, we compare the proposed approach with existing MVBC design methods,
such as BeagleBone, Galsblock, and Simulink. Experiments show that more ambiguousness
or bugs in the standard are detected during Uppaal verification, and the generated
code of Times outperforms the C code generated by others in terms of the synthesized
binary code size. The errors in the standard have been confirmed and the resulting
MVBC has been deployed in the real train communication network.
article_processing_charge: No
author:
- first_name: Yu
full_name: Jiang, Yu
last_name: Jiang
- first_name: Han
full_name: Liu, Han
last_name: Liu
- first_name: Huobing
full_name: Song, Huobing
last_name: Song
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Rui
full_name: Wang, Rui
last_name: Wang
- first_name: Yong
full_name: Guan, Yong
last_name: Guan
- first_name: Lui
full_name: Sha, Lui
last_name: Sha
citation:
ama: Jiang Y, Liu H, Song H, et al. Safety-assured model-driven design of the multifunction
vehicle bus controller. IEEE Transactions on Intelligent Transportation Systems.
2018;19(10):3320-3333. doi:10.1109/TITS.2017.2778077
apa: Jiang, Y., Liu, H., Song, H., Kong, H., Wang, R., Guan, Y., & Sha, L. (2018).
Safety-assured model-driven design of the multifunction vehicle bus controller.
IEEE Transactions on Intelligent Transportation Systems. IEEE. https://doi.org/10.1109/TITS.2017.2778077
chicago: Jiang, Yu, Han Liu, Huobing Song, Hui Kong, Rui Wang, Yong Guan, and Lui
Sha. “Safety-Assured Model-Driven Design of the Multifunction Vehicle Bus Controller.”
IEEE Transactions on Intelligent Transportation Systems. IEEE, 2018. https://doi.org/10.1109/TITS.2017.2778077.
ieee: Y. Jiang et al., “Safety-assured model-driven design of the multifunction
vehicle bus controller,” IEEE Transactions on Intelligent Transportation Systems,
vol. 19, no. 10. IEEE, pp. 3320–3333, 2018.
ista: Jiang Y, Liu H, Song H, Kong H, Wang R, Guan Y, Sha L. 2018. Safety-assured
model-driven design of the multifunction vehicle bus controller. IEEE Transactions
on Intelligent Transportation Systems. 19(10), 3320–3333.
mla: Jiang, Yu, et al. “Safety-Assured Model-Driven Design of the Multifunction
Vehicle Bus Controller.” IEEE Transactions on Intelligent Transportation Systems,
vol. 19, no. 10, IEEE, 2018, pp. 3320–33, doi:10.1109/TITS.2017.2778077.
short: Y. Jiang, H. Liu, H. Song, H. Kong, R. Wang, Y. Guan, L. Sha, IEEE Transactions
on Intelligent Transportation Systems 19 (2018) 3320–3333.
date_created: 2018-12-11T11:46:27Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2025-09-22T09:39:54Z
day: '01'
department:
- _id: ToHe
doi: 10.1109/TITS.2017.2778077
external_id:
isi:
- '000446651100020'
intvolume: ' 19'
isi: 1
issue: '10'
language:
- iso: eng
month: '01'
oa_version: None
page: 3320 - 3333
publication: IEEE Transactions on Intelligent Transportation Systems
publication_status: published
publisher: IEEE
publist_id: '7389'
quality_controlled: '1'
related_material:
record:
- id: '1205'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Safety-assured model-driven design of the multifunction vehicle bus controller
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 19
year: '2018'
...
---
_id: '435'
abstract:
- lang: eng
text: It is shown that two fundamentally different phenomena, the bound states in
continuum and the spectral singularity (or time-reversed spectral singularity),
can occur simultaneously. This can be achieved in a rectangular core dielectric
waveguide with an embedded active (or absorbing) layer. In such a system a two-dimensional
bound state in a continuum is created in the plane of a waveguide cross section,
and it is emitted or absorbed along the waveguide core. The idea can be used for
experimental implementation of a laser or a coherent-perfect-absorber for a photonic
bound state that resides in a continuous spectrum.
acknowledgement: 'Seventh Framework Programme (FP7) People: Marie-Curie Actions (PEOPLE)
(291734). B. M. acknowledges the financial support by the People Programme (Marie
Curie Actions) of the European Union’s Seventh Framework Programme (FP7/ 2007-2013)
under REA.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Bikashkali
full_name: Midya, Bikashkali
id: 456187FC-F248-11E8-B48F-1D18A9856A87
last_name: Midya
- first_name: Vladimir
full_name: Konotop, Vladimir
last_name: Konotop
citation:
ama: Midya B, Konotop V. Coherent-perfect-absorber and laser for bound states in
a continuum. Optics Letters. 2018;43(3):607-610. doi:10.1364/OL.43.000607
apa: Midya, B., & Konotop, V. (2018). Coherent-perfect-absorber and laser for
bound states in a continuum. Optics Letters. Optica Publishing Group. https://doi.org/10.1364/OL.43.000607
chicago: Midya, Bikashkali, and Vladimir Konotop. “Coherent-Perfect-Absorber and
Laser for Bound States in a Continuum.” Optics Letters. Optica Publishing
Group, 2018. https://doi.org/10.1364/OL.43.000607.
ieee: B. Midya and V. Konotop, “Coherent-perfect-absorber and laser for bound states
in a continuum,” Optics Letters, vol. 43, no. 3. Optica Publishing Group,
pp. 607–610, 2018.
ista: Midya B, Konotop V. 2018. Coherent-perfect-absorber and laser for bound states
in a continuum. Optics Letters. 43(3), 607–610.
mla: Midya, Bikashkali, and Vladimir Konotop. “Coherent-Perfect-Absorber and Laser
for Bound States in a Continuum.” Optics Letters, vol. 43, no. 3, Optica
Publishing Group, 2018, pp. 607–10, doi:10.1364/OL.43.000607.
short: B. Midya, V. Konotop, Optics Letters 43 (2018) 607–610.
corr_author: '1'
date_created: 2018-12-11T11:46:27Z
date_published: 2018-02-01T00:00:00Z
date_updated: 2025-06-03T11:21:56Z
day: '01'
department:
- _id: MiLe
doi: 10.1364/OL.43.000607
ec_funded: 1
external_id:
arxiv:
- '1711.01986'
isi:
- '000423776600066'
intvolume: ' 43'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.01986
month: '02'
oa: 1
oa_version: Preprint
page: 607 - 610
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Optics Letters
publication_status: published
publisher: Optica Publishing Group
publist_id: '7388'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coherent-perfect-absorber and laser for bound states in a continuum
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2018'
...
---
_id: '436'
abstract:
- lang: eng
text: There has been significant interest recently in using complex quantum systems
to create effective nonreciprocal dynamics. Proposals have been put forward for
the realization of artificial magnetic fields for photons and phonons; experimental
progress is fast making these proposals a reality. Much work has concentrated
on the use of such systems for controlling the flow of signals, e.g., to create
isolators or directional amplifiers for optical signals. In this Letter, we build
on this work but move in a different direction. We develop the theory of and discuss
a potential realization for the controllable flow of thermal noise in quantum
systems. We demonstrate theoretically that the unidirectional flow of thermal
noise is possible within quantum cascaded systems. Viewing an optomechanical platform
as a cascaded system we show here that one can ultimately control the direction
of the flow of thermal noise. By appropriately engineering the mechanical resonator,
which acts as an artificial reservoir, the flow of thermal noise can be constrained
to a desired direction, yielding a thermal rectifier. The proposed quantum thermal
noise rectifier could potentially be used to develop devices such as a thermal
modulator, a thermal router, and a thermal amplifier for nanoelectronic devices
and superconducting circuits.
article_number: '060601 '
article_processing_charge: No
arxiv: 1
author:
- first_name: Shabir
full_name: Barzanjeh, Shabir
id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87
last_name: Barzanjeh
orcid: 0000-0003-0415-1423
- first_name: Matteo
full_name: Aquilina, Matteo
last_name: Aquilina
- first_name: André
full_name: Xuereb, André
last_name: Xuereb
citation:
ama: Barzanjeh S, Aquilina M, Xuereb A. Manipulating the flow of thermal noise in
quantum devices. Physical Review Letters. 2018;120(6). doi:10.1103/PhysRevLett.120.060601
apa: Barzanjeh, S., Aquilina, M., & Xuereb, A. (2018). Manipulating the flow
of thermal noise in quantum devices. Physical Review Letters. American
Physical Society. https://doi.org/10.1103/PhysRevLett.120.060601
chicago: Barzanjeh, Shabir, Matteo Aquilina, and André Xuereb. “Manipulating the
Flow of Thermal Noise in Quantum Devices.” Physical Review Letters. American
Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.120.060601.
ieee: S. Barzanjeh, M. Aquilina, and A. Xuereb, “Manipulating the flow of thermal
noise in quantum devices,” Physical Review Letters, vol. 120, no. 6. American
Physical Society, 2018.
ista: Barzanjeh S, Aquilina M, Xuereb A. 2018. Manipulating the flow of thermal
noise in quantum devices. Physical Review Letters. 120(6), 060601.
mla: Barzanjeh, Shabir, et al. “Manipulating the Flow of Thermal Noise in Quantum
Devices.” Physical Review Letters, vol. 120, no. 6, 060601, American Physical
Society, 2018, doi:10.1103/PhysRevLett.120.060601.
short: S. Barzanjeh, M. Aquilina, A. Xuereb, Physical Review Letters 120 (2018).
corr_author: '1'
date_created: 2018-12-11T11:46:28Z
date_published: 2018-02-07T00:00:00Z
date_updated: 2024-10-22T09:36:24Z
day: '07'
department:
- _id: JoFi
doi: 10.1103/PhysRevLett.120.060601
ec_funded: 1
external_id:
arxiv:
- '1706.09051'
isi:
- '000424382100004'
intvolume: ' 120'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1706.09051
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 257EB838-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '732894'
name: Hybrid Optomechanical Technologies
- _id: 258047B6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '707438'
name: 'Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination
with cavity Optomechanics'
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '7387'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/interference-as-a-new-method-for-cooling-quantum-devices/
scopus_import: '1'
status: public
title: Manipulating the flow of thermal noise in quantum devices
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 120
year: '2018'
...
---
_id: '437'
abstract:
- lang: eng
text: Dendritic cells (DCs) are sentinels of the adaptive immune system that reside
in peripheral organs of mammals. Upon pathogen encounter, they undergo maturation
and up-regulate the chemokine receptor CCR7 that guides them along gradients of
its chemokine ligands CCL19 and 21 to the next draining lymph node. There, DCs
present peripherally acquired antigen to naïve T cells, thereby triggering adaptive
immunity.
acknowledged_ssus:
- _id: SSU
acknowledgement: "This work was supported by grants of the European Research Council
(ERC CoG 724373) and the Austrian Science Fund (FWF) to M.S. We thank the scientific
support units at IST Austria for excellent technical support.\r\nWe thank the scientific
\ support units at IST Austria for excellent technical support. "
article_processing_charge: Yes (via OA deal)
author:
- first_name: Alexander F
full_name: Leithner, Alexander F
id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
last_name: Leithner
orcid: 0000-0002-1073-744X
- first_name: Jörg
full_name: Renkawitz, Jörg
id: 3F0587C8-F248-11E8-B48F-1D18A9856A87
last_name: Renkawitz
orcid: 0000-0003-2856-3369
- first_name: Ingrid
full_name: De Vries, Ingrid
id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
last_name: De Vries
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Hans
full_name: Haecker, Hans
last_name: Haecker
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Leithner AF, Renkawitz J, de Vries I, Hauschild R, Haecker H, Sixt MK. Fast
and efficient genetic engineering of hematopoietic precursor cells for the study
of dendritic cell migration. European Journal of Immunology. 2018;48(6):1074-1077.
doi:10.1002/eji.201747358
apa: Leithner, A. F., Renkawitz, J., de Vries, I., Hauschild, R., Haecker, H., &
Sixt, M. K. (2018). Fast and efficient genetic engineering of hematopoietic precursor
cells for the study of dendritic cell migration. European Journal of Immunology.
Wiley-Blackwell. https://doi.org/10.1002/eji.201747358
chicago: Leithner, Alexander F, Jörg Renkawitz, Ingrid de Vries, Robert Hauschild,
Hans Haecker, and Michael K Sixt. “Fast and Efficient Genetic Engineering of Hematopoietic
Precursor Cells for the Study of Dendritic Cell Migration.” European Journal
of Immunology. Wiley-Blackwell, 2018. https://doi.org/10.1002/eji.201747358.
ieee: A. F. Leithner, J. Renkawitz, I. de Vries, R. Hauschild, H. Haecker, and M.
K. Sixt, “Fast and efficient genetic engineering of hematopoietic precursor cells
for the study of dendritic cell migration,” European Journal of Immunology,
vol. 48, no. 6. Wiley-Blackwell, pp. 1074–1077, 2018.
ista: Leithner AF, Renkawitz J, de Vries I, Hauschild R, Haecker H, Sixt MK. 2018.
Fast and efficient genetic engineering of hematopoietic precursor cells for the
study of dendritic cell migration. European Journal of Immunology. 48(6), 1074–1077.
mla: Leithner, Alexander F., et al. “Fast and Efficient Genetic Engineering of Hematopoietic
Precursor Cells for the Study of Dendritic Cell Migration.” European Journal
of Immunology, vol. 48, no. 6, Wiley-Blackwell, 2018, pp. 1074–77, doi:10.1002/eji.201747358.
short: A.F. Leithner, J. Renkawitz, I. de Vries, R. Hauschild, H. Haecker, M.K.
Sixt, European Journal of Immunology 48 (2018) 1074–1077.
corr_author: '1'
date_created: 2018-12-11T11:46:28Z
date_published: 2018-02-13T00:00:00Z
date_updated: 2025-04-14T07:42:07Z
day: '13'
ddc:
- '570'
department:
- _id: MiSi
- _id: Bio
doi: 10.1002/eji.201747358
ec_funded: 1
external_id:
isi:
- '000434963700016'
file:
- access_level: open_access
checksum: 9d5b74cd016505aeb9a4c2d33bbedaeb
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:56Z
date_updated: 2020-07-14T12:46:27Z
file_id: '5044'
file_name: IST-2018-1067-v1+2_Leithner_et_al-2018-European_Journal_of_Immunology.pdf
file_size: 590106
relation: main_file
file_date_updated: 2020-07-14T12:46:27Z
has_accepted_license: '1'
intvolume: ' 48'
isi: 1
issue: '6'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 1074 - 1077
project:
- _id: 25FE9508-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '724373'
name: Cellular Navigation Along Spatial Gradients
publication: European Journal of Immunology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7386'
pubrep_id: '1067'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fast and efficient genetic engineering of hematopoietic precursor cells for
the study of dendritic cell migration
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 48
year: '2018'
...
---
_id: '44'
abstract:
- lang: eng
text: 'Recent realization of a kinetically constrained chain of Rydberg atoms by
Bernien et al., [Nature (London) 551, 579 (2017)] resulted in the observation
of unusual revivals in the many-body quantum dynamics. In our previous work [C.
J. Turner et al., Nat. Phys. 14, 745 (2018)], such dynamics was attributed to
the existence of “quantum scarred” eigenstates in the many-body spectrum of the
experimentally realized model. Here, we present a detailed study of the eigenstate
properties of the same model. We find that the majority of the eigenstates exhibit
anomalous thermalization: the observable expectation values converge to their
Gibbs ensemble values, but parametrically slower compared to the predictions of
the eigenstate thermalization hypothesis (ETH). Amidst the thermalizing spectrum,
we identify nonergodic eigenstates that strongly violate the ETH, whose number
grows polynomially with system size. Previously, the same eigenstates were identified
via large overlaps with certain product states, and were used to explain the revivals
observed in experiment. Here, we find that these eigenstates, in addition to highly
atypical expectation values of local observables, also exhibit subthermal entanglement
entropy that scales logarithmically with the system size. Moreover, we identify
an additional class of quantum scarred eigenstates, and discuss their manifestations
in the dynamics starting from initial product states. We use forward scattering
approximation to describe the structure and physical properties of quantum scarred
eigenstates. Finally, we discuss the stability of quantum scars to various perturbations.
We observe that quantum scars remain robust when the introduced perturbation is
compatible with the forward scattering approximation. In contrast, the perturbations
which most efficiently destroy quantum scars also lead to the restoration of “canonical”
thermalization.'
acknowledged_ssus:
- _id: ScienComp
article_number: '155134'
article_processing_charge: No
arxiv: 1
author:
- first_name: C J
full_name: Turner, C J
last_name: Turner
- first_name: Alexios
full_name: Michailidis, Alexios
id: 36EBAD38-F248-11E8-B48F-1D18A9856A87
last_name: Michailidis
orcid: 0000-0002-8443-1064
- first_name: D A
full_name: Abanin, D A
last_name: Abanin
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Z
full_name: Papić, Z
last_name: Papić
citation:
ama: 'Turner CJ, Michailidis A, Abanin DA, Serbyn M, Papić Z. Quantum scarred eigenstates
in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability
to perturbations. Physical Review B. 2018;98(15). doi:10.1103/PhysRevB.98.155134'
apa: 'Turner, C. J., Michailidis, A., Abanin, D. A., Serbyn, M., & Papić, Z.
(2018). Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown
of thermalization, and stability to perturbations. Physical Review B. American
Physical Society. https://doi.org/10.1103/PhysRevB.98.155134'
chicago: 'Turner, C J, Alexios Michailidis, D A Abanin, Maksym Serbyn, and Z Papić.
“Quantum Scarred Eigenstates in a Rydberg Atom Chain: Entanglement, Breakdown
of Thermalization, and Stability to Perturbations.” Physical Review B.
American Physical Society, 2018. https://doi.org/10.1103/PhysRevB.98.155134.'
ieee: 'C. J. Turner, A. Michailidis, D. A. Abanin, M. Serbyn, and Z. Papić, “Quantum
scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization,
and stability to perturbations,” Physical Review B, vol. 98, no. 15. American
Physical Society, 2018.'
ista: 'Turner CJ, Michailidis A, Abanin DA, Serbyn M, Papić Z. 2018. Quantum scarred
eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization,
and stability to perturbations. Physical Review B. 98(15), 155134.'
mla: 'Turner, C. J., et al. “Quantum Scarred Eigenstates in a Rydberg Atom Chain:
Entanglement, Breakdown of Thermalization, and Stability to Perturbations.” Physical
Review B, vol. 98, no. 15, 155134, American Physical Society, 2018, doi:10.1103/PhysRevB.98.155134.'
short: C.J. Turner, A. Michailidis, D.A. Abanin, M. Serbyn, Z. Papić, Physical Review
B 98 (2018).
date_created: 2018-12-11T11:44:19Z
date_published: 2018-10-22T00:00:00Z
date_updated: 2023-10-10T13:28:49Z
day: '22'
department:
- _id: MaSe
doi: 10.1103/PhysRevB.98.155134
external_id:
arxiv:
- '1806.10933'
isi:
- '000447919100001'
intvolume: ' 98'
isi: 1
issue: '15'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.10933
month: '10'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_status: published
publisher: American Physical Society
publist_id: '8010'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown
of thermalization, and stability to perturbations'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 98
year: '2018'
...
---
_id: '446'
abstract:
- lang: eng
text: We prove that in Thomas–Fermi–Dirac–von Weizsäcker theory, a nucleus of charge
Z > 0 can bind at most Z + C electrons, where C is a universal constant. This
result is obtained through a comparison with Thomas-Fermi theory which, as a by-product,
gives bounds on the screened nuclear potential and the radius of the minimizer.
A key ingredient of the proof is a novel technique to control the particles in
the exterior region, which also applies to the liquid drop model with a nuclear
background potential.
acknowledgement: "We thank the referee for helpful suggestions that improved the presentation
of the paper. We also acknowledge partial support by National Science Foundation
Grant DMS-1363432 (R.L.F.), Austrian Science Fund (FWF) Project Nr. P 27533-N27
(P.T.N.), CONICYT (Chile) through CONICYT–PCHA/ Doctorado Nacional/2014, and Iniciativa
Científica Milenio (Chile) through Millenium Nucleus RC–120002 “Física Matemática”
(H.V.D.B.).\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rupert
full_name: Frank, Rupert
last_name: Frank
- first_name: Nam
full_name: Phan Thanh, Nam
id: 404092F4-F248-11E8-B48F-1D18A9856A87
last_name: Phan Thanh
- first_name: Hanne
full_name: Van Den Bosch, Hanne
last_name: Van Den Bosch
citation:
ama: Frank R, Nam P, Van Den Bosch H. The ionization conjecture in Thomas–Fermi–Dirac–von
Weizsäcker theory. Communications on Pure and Applied Mathematics. 2018;71(3):577-614.
doi:10.1002/cpa.21717
apa: Frank, R., Nam, P., & Van Den Bosch, H. (2018). The ionization conjecture
in Thomas–Fermi–Dirac–von Weizsäcker theory. Communications on Pure and Applied
Mathematics. Wiley-Blackwell. https://doi.org/10.1002/cpa.21717
chicago: Frank, Rupert, Phan Nam, and Hanne Van Den Bosch. “The Ionization Conjecture
in Thomas–Fermi–Dirac–von Weizsäcker Theory.” Communications on Pure and Applied
Mathematics. Wiley-Blackwell, 2018. https://doi.org/10.1002/cpa.21717.
ieee: R. Frank, P. Nam, and H. Van Den Bosch, “The ionization conjecture in Thomas–Fermi–Dirac–von
Weizsäcker theory,” Communications on Pure and Applied Mathematics, vol.
71, no. 3. Wiley-Blackwell, pp. 577–614, 2018.
ista: Frank R, Nam P, Van Den Bosch H. 2018. The ionization conjecture in Thomas–Fermi–Dirac–von
Weizsäcker theory. Communications on Pure and Applied Mathematics. 71(3), 577–614.
mla: Frank, Rupert, et al. “The Ionization Conjecture in Thomas–Fermi–Dirac–von
Weizsäcker Theory.” Communications on Pure and Applied Mathematics, vol.
71, no. 3, Wiley-Blackwell, 2018, pp. 577–614, doi:10.1002/cpa.21717.
short: R. Frank, P. Nam, H. Van Den Bosch, Communications on Pure and Applied Mathematics
71 (2018) 577–614.
date_created: 2018-12-11T11:46:31Z
date_published: 2018-03-01T00:00:00Z
date_updated: 2023-09-19T10:09:40Z
day: '01'
department:
- _id: RoSe
doi: 10.1002/cpa.21717
external_id:
arxiv:
- '1606.07355'
isi:
- '000422675800004'
intvolume: ' 71'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1606.07355
month: '03'
oa: 1
oa_version: Preprint
page: 577 - 614
publication: Communications on Pure and Applied Mathematics
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7377'
quality_controlled: '1'
status: public
title: The ionization conjecture in Thomas–Fermi–Dirac–von Weizsäcker theory
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 71
year: '2018'
...
---
_id: '448'
abstract:
- lang: eng
text: Around 150 million years ago, eusocial termites evolved from within the cockroaches,
50 million years before eusocial Hymenoptera, such as bees and ants, appeared.
Here, we report the 2-Gb genome of the German cockroach, Blattella germanica,
and the 1.3-Gb genome of the drywood termite Cryptotermes secundus. We show evolutionary
signatures of termite eusociality by comparing the genomes and transcriptomes
of three termites and the cockroach against the background of 16 other eusocial
and non-eusocial insects. Dramatic adaptive changes in genes underlying the production
and perception of pheromones confirm the importance of chemical communication
in the termites. These are accompanied by major changes in gene regulation and
the molecular evolution of caste determination. Many of these results parallel
molecular mechanisms of eusocial evolution in Hymenoptera. However, the specific
solutions are remarkably different, thus revealing a striking case of convergence
in one of the major evolutionary transitions in biological complexity.
acknowledgement: We thank O. Niehuis for allowing use of the unpublished E. danica
genome, J. Gadau and C. Smith for comments and advice on the manuscript, and J.
Schmitz for assistance with analyses and proofreading the manuscript. J.K. thanks
Charles Darwin University (Australia), especially S. Garnett and the Horticulture
and Aquaculture team, for providing logistic support to collect C. secundus. The
Parks and Wildlife Commission, Northern Territory, the Department of the Environment,
Water, Heritage and the Arts gave permission to collect (Permit number 36401) and
export (Permit WT2010-6997) the termites. USDA is an equal opportunity provider
and employer. M.C.H. and E.J. are supported by DFG grant BO2544/11-1 to E.B.-B.
J.K. is supported by University of Osnabrück and DFG grant KO1895/16-1. X.B. and
M.-D.P. are supported by Spanish Ministerio de Economía y Competitividad (CGL2012-36251
and CGL2015-64727-P to X.B., and CGL2016-76011-R to M.-D.P.), including FEDER funds,
and by Catalan Government (2014 SGR 619). C.S. is supported by grants from the US
Department of Housing and Urban Development (NCHHU-0017-13), the National Science
Foundation (IOS-1557864), the Alfred P. Sloan Foundation (2013-5-35 MBE), the National
Institute of Environmental Health Sciences (P30ES025128) to the Center for Human
Health and the Environment, and the Blanton J. Whitmire Endowment. M.P. is supported
by a Villum Kann Rasmussen Young Investigator Fellowship (VKR10101).
article_processing_charge: No
author:
- first_name: Mark
full_name: Harrison, Mark
last_name: Harrison
- first_name: Evelien
full_name: Jongepier, Evelien
last_name: Jongepier
- first_name: Hugh
full_name: Robertson, Hugh
last_name: Robertson
- first_name: Nicolas
full_name: Arning, Nicolas
last_name: Arning
- first_name: Tristan
full_name: Bitard Feildel, Tristan
last_name: Bitard Feildel
- first_name: Hsu
full_name: Chao, Hsu
last_name: Chao
- first_name: Christopher
full_name: Childers, Christopher
last_name: Childers
- first_name: Huyen
full_name: Dinh, Huyen
last_name: Dinh
- first_name: Harshavardhan
full_name: Doddapaneni, Harshavardhan
last_name: Doddapaneni
- first_name: Shannon
full_name: Dugan, Shannon
last_name: Dugan
- first_name: Johannes
full_name: Gowin, Johannes
last_name: Gowin
- first_name: Carolin
full_name: Greiner, Carolin
last_name: Greiner
- first_name: Yi
full_name: Han, Yi
last_name: Han
- first_name: Haofu
full_name: Hu, Haofu
last_name: Hu
- first_name: Daniel
full_name: Hughes, Daniel
last_name: Hughes
- first_name: Ann K
full_name: Huylmans, Ann K
id: 4C0A3874-F248-11E8-B48F-1D18A9856A87
last_name: Huylmans
orcid: 0000-0001-8871-4961
- first_name: Karsten
full_name: Kemena, Karsten
last_name: Kemena
- first_name: Lukas
full_name: Kremer, Lukas
last_name: Kremer
- first_name: Sandra
full_name: Lee, Sandra
last_name: Lee
- first_name: Alberto
full_name: López Ezquerra, Alberto
last_name: López Ezquerra
- first_name: Ludovic
full_name: Mallet, Ludovic
last_name: Mallet
- first_name: Jose
full_name: Monroy Kuhn, Jose
last_name: Monroy Kuhn
- first_name: Annabell
full_name: Moser, Annabell
last_name: Moser
- first_name: Shwetha
full_name: Murali, Shwetha
last_name: Murali
- first_name: Donna
full_name: Muzny, Donna
last_name: Muzny
- first_name: Saria
full_name: Otani, Saria
last_name: Otani
- first_name: Maria
full_name: Piulachs, Maria
last_name: Piulachs
- first_name: Monica
full_name: Poelchau, Monica
last_name: Poelchau
- first_name: Jiaxin
full_name: Qu, Jiaxin
last_name: Qu
- first_name: Florentine
full_name: Schaub, Florentine
last_name: Schaub
- first_name: Ayako
full_name: Wada Katsumata, Ayako
last_name: Wada Katsumata
- first_name: Kim
full_name: Worley, Kim
last_name: Worley
- first_name: Qiaolin
full_name: Xie, Qiaolin
last_name: Xie
- first_name: Guillem
full_name: Ylla, Guillem
last_name: Ylla
- first_name: Michael
full_name: Poulsen, Michael
last_name: Poulsen
- first_name: Richard
full_name: Gibbs, Richard
last_name: Gibbs
- first_name: Coby
full_name: Schal, Coby
last_name: Schal
- first_name: Stephen
full_name: Richards, Stephen
last_name: Richards
- first_name: Xavier
full_name: Belles, Xavier
last_name: Belles
- first_name: Judith
full_name: Korb, Judith
last_name: Korb
- first_name: Erich
full_name: Bornberg Bauer, Erich
last_name: Bornberg Bauer
citation:
ama: Harrison M, Jongepier E, Robertson H, et al. Hemimetabolous genomes reveal
molecular basis of termite eusociality. Nature Ecology and Evolution. 2018;2(3):557-566.
doi:10.1038/s41559-017-0459-1
apa: Harrison, M., Jongepier, E., Robertson, H., Arning, N., Bitard Feildel, T.,
Chao, H., … Bornberg Bauer, E. (2018). Hemimetabolous genomes reveal molecular
basis of termite eusociality. Nature Ecology and Evolution. Springer Nature.
https://doi.org/10.1038/s41559-017-0459-1
chicago: Harrison, Mark, Evelien Jongepier, Hugh Robertson, Nicolas Arning, Tristan
Bitard Feildel, Hsu Chao, Christopher Childers, et al. “Hemimetabolous Genomes
Reveal Molecular Basis of Termite Eusociality.” Nature Ecology and Evolution.
Springer Nature, 2018. https://doi.org/10.1038/s41559-017-0459-1.
ieee: M. Harrison et al., “Hemimetabolous genomes reveal molecular basis
of termite eusociality,” Nature Ecology and Evolution, vol. 2, no. 3. Springer
Nature, pp. 557–566, 2018.
ista: Harrison M, Jongepier E, Robertson H, Arning N, Bitard Feildel T, Chao H,
Childers C, Dinh H, Doddapaneni H, Dugan S, Gowin J, Greiner C, Han Y, Hu H, Hughes
D, Huylmans AK, Kemena K, Kremer L, Lee S, López Ezquerra A, Mallet L, Monroy
Kuhn J, Moser A, Murali S, Muzny D, Otani S, Piulachs M, Poelchau M, Qu J, Schaub
F, Wada Katsumata A, Worley K, Xie Q, Ylla G, Poulsen M, Gibbs R, Schal C, Richards
S, Belles X, Korb J, Bornberg Bauer E. 2018. Hemimetabolous genomes reveal molecular
basis of termite eusociality. Nature Ecology and Evolution. 2(3), 557–566.
mla: Harrison, Mark, et al. “Hemimetabolous Genomes Reveal Molecular Basis of Termite
Eusociality.” Nature Ecology and Evolution, vol. 2, no. 3, Springer Nature,
2018, pp. 557–66, doi:10.1038/s41559-017-0459-1.
short: M. Harrison, E. Jongepier, H. Robertson, N. Arning, T. Bitard Feildel, H.
Chao, C. Childers, H. Dinh, H. Doddapaneni, S. Dugan, J. Gowin, C. Greiner, Y.
Han, H. Hu, D. Hughes, A.K. Huylmans, K. Kemena, L. Kremer, S. Lee, A. López Ezquerra,
L. Mallet, J. Monroy Kuhn, A. Moser, S. Murali, D. Muzny, S. Otani, M. Piulachs,
M. Poelchau, J. Qu, F. Schaub, A. Wada Katsumata, K. Worley, Q. Xie, G. Ylla,
M. Poulsen, R. Gibbs, C. Schal, S. Richards, X. Belles, J. Korb, E. Bornberg Bauer,
Nature Ecology and Evolution 2 (2018) 557–566.
date_created: 2018-12-11T11:46:32Z
date_published: 2018-02-05T00:00:00Z
date_updated: 2023-09-11T14:10:57Z
day: '05'
ddc:
- '576'
department:
- _id: BeVi
doi: 10.1038/s41559-017-0459-1
external_id:
isi:
- '000426559600026'
file:
- access_level: open_access
checksum: 874953136ac125e65f37971d3cabc5b7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:08Z
date_updated: 2020-07-14T12:46:30Z
file_id: '4731'
file_name: IST-2018-969-v1+1_2018_Huylmans_Hemimetabolous_genomes.pdf
file_size: 3730583
relation: main_file
file_date_updated: 2020-07-14T12:46:30Z
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
issue: '3'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 557-566
publication: Nature Ecology and Evolution
publication_status: published
publisher: Springer Nature
publist_id: '7375'
pubrep_id: '969'
quality_controlled: '1'
related_material:
record:
- id: '9841'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Hemimetabolous genomes reveal molecular basis of termite eusociality
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2
year: '2018'
...
---
_id: '454'
abstract:
- lang: eng
text: Direct reciprocity is a mechanism for cooperation among humans. Many of our
daily interactions are repeated. We interact repeatedly with our family, friends,
colleagues, members of the local and even global community. In the theory of repeated
games, it is a tacit assumption that the various games that a person plays simultaneously
have no effect on each other. Here we introduce a general framework that allows
us to analyze “crosstalk” between a player’s concurrent games. In the presence
of crosstalk, the action a person experiences in one game can alter the person’s
decision in another. We find that crosstalk impedes the maintenance of cooperation
and requires stronger levels of forgiveness. The magnitude of the effect depends
on the population structure. In more densely connected social groups, crosstalk
has a stronger effect. A harsh retaliator, such as Tit-for-Tat, is unable to counteract
crosstalk. The crosstalk framework provides a unified interpretation of direct
and upstream reciprocity in the context of repeated games.
acknowledgement: "This work was supported by the European Research Council (ERC) start
grant 279307: Graph Games (C.K.), Austrian Science Fund (FWF) grant no P23499-N23
(C.K.), FWF\r\nNFN grant no S11407-N23 RiSE/SHiNE (C.K.), Office of Naval Research
grant N00014-16-1-2914 (M.A.N.), National Cancer Institute grant CA179991 (M.A.N.)
and by the John Templeton Foundation. J.G.R. is supported by an Erwin Schrödinger
fellowship\r\n(Austrian Science Fund FWF J-3996). C.H. acknowledges generous support
from the\r\nISTFELLOW program. The Program for Evolutionary Dynamics is supported
in part by\r\na gift from B Wu and Eric Larson."
article_number: '555'
article_processing_charge: No
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
- first_name: David
full_name: Rand, David
last_name: Rand
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. Crosstalk in concurrent repeated
games impedes direct reciprocity and requires stronger levels of forgiveness.
Nature Communications. 2018;9(1). doi:10.1038/s41467-017-02721-8
apa: Reiter, J., Hilbe, C., Rand, D., Chatterjee, K., & Nowak, M. (2018). Crosstalk
in concurrent repeated games impedes direct reciprocity and requires stronger
levels of forgiveness. Nature Communications. Nature Publishing Group.
https://doi.org/10.1038/s41467-017-02721-8
chicago: Reiter, Johannes, Christian Hilbe, David Rand, Krishnendu Chatterjee, and
Martin Nowak. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity
and Requires Stronger Levels of Forgiveness.” Nature Communications. Nature
Publishing Group, 2018. https://doi.org/10.1038/s41467-017-02721-8.
ieee: J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, and M. Nowak, “Crosstalk in concurrent
repeated games impedes direct reciprocity and requires stronger levels of forgiveness,”
Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.
ista: Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. 2018. Crosstalk in concurrent
repeated games impedes direct reciprocity and requires stronger levels of forgiveness.
Nature Communications. 9(1), 555.
mla: Reiter, Johannes, et al. “Crosstalk in Concurrent Repeated Games Impedes Direct
Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications,
vol. 9, no. 1, 555, Nature Publishing Group, 2018, doi:10.1038/s41467-017-02721-8.
short: J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, M. Nowak, Nature Communications
9 (2018).
date_created: 2018-12-11T11:46:34Z
date_published: 2018-02-07T00:00:00Z
date_updated: 2025-04-15T06:30:05Z
day: '07'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1038/s41467-017-02721-8
ec_funded: 1
external_id:
isi:
- '000424318200001'
file:
- access_level: open_access
checksum: b6b90367545b4c615891c960ab0567f1
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:18Z
date_updated: 2020-07-14T12:46:31Z
file_id: '4741'
file_name: IST-2018-964-v1+1_2018_Hilbe_Crosstalk_in.pdf
file_size: 843646
relation: main_file
file_date_updated: 2020-07-14T12:46:31Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '7368'
pubrep_id: '964'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Crosstalk in concurrent repeated games impedes direct reciprocity and requires
stronger levels of forgiveness
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 9
year: '2018'
...
---
_id: '455'
abstract:
- lang: eng
text: The derivation of effective evolution equations is central to the study of
non-stationary quantum many-body systems, and widely used in contexts such as
superconductivity, nuclear physics, Bose–Einstein condensation and quantum chemistry.
We reformulate the Dirac–Frenkel approximation principle in terms of reduced density
matrices and apply it to fermionic and bosonic many-body systems. We obtain the
Bogoliubov–de Gennes and Hartree–Fock–Bogoliubov equations, respectively. While
we do not prove quantitative error estimates, our formulation does show that the
approximation is optimal within the class of quasifree states. Furthermore, we
prove well-posedness of the Bogoliubov–de Gennes equations in energy space and
discuss conserved quantities
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). The authors acknowledge support by ERC Advanced Grant 321029 and
by VILLUM FONDEN via the QMATH Centre of Excellence (Grant No. 10059). The authors
would like to thank Sébastien Breteaux, Enno Lenzmann, Mathieu Lewin and Jochen
Schmid for comments and discussions about well-posedness of the Bogoliubov–de Gennes
equations.
alternative_title:
- Annales Henri Poincare
article_processing_charge: No
author:
- first_name: Niels P
full_name: Benedikter, Niels P
id: 3DE6C32A-F248-11E8-B48F-1D18A9856A87
last_name: Benedikter
orcid: 0000-0002-1071-6091
- first_name: Jérémy
full_name: Sok, Jérémy
last_name: Sok
- first_name: Jan
full_name: Solovej, Jan
last_name: Solovej
citation:
ama: Benedikter NP, Sok J, Solovej J. The Dirac–Frenkel principle for reduced density
matrices and the Bogoliubov–de Gennes equations. Annales Henri Poincare.
2018;19(4):1167-1214. doi:10.1007/s00023-018-0644-z
apa: Benedikter, N. P., Sok, J., & Solovej, J. (2018). The Dirac–Frenkel principle
for reduced density matrices and the Bogoliubov–de Gennes equations. Annales
Henri Poincare. Birkhäuser. https://doi.org/10.1007/s00023-018-0644-z
chicago: Benedikter, Niels P, Jérémy Sok, and Jan Solovej. “The Dirac–Frenkel Principle
for Reduced Density Matrices and the Bogoliubov–de Gennes Equations.” Annales
Henri Poincare. Birkhäuser, 2018. https://doi.org/10.1007/s00023-018-0644-z.
ieee: N. P. Benedikter, J. Sok, and J. Solovej, “The Dirac–Frenkel principle for
reduced density matrices and the Bogoliubov–de Gennes equations,” Annales Henri
Poincare, vol. 19, no. 4. Birkhäuser, pp. 1167–1214, 2018.
ista: Benedikter NP, Sok J, Solovej J. 2018. The Dirac–Frenkel principle for reduced
density matrices and the Bogoliubov–de Gennes equations. Annales Henri Poincare.
19(4), 1167–1214.
mla: Benedikter, Niels P., et al. “The Dirac–Frenkel Principle for Reduced Density
Matrices and the Bogoliubov–de Gennes Equations.” Annales Henri Poincare,
vol. 19, no. 4, Birkhäuser, 2018, pp. 1167–214, doi:10.1007/s00023-018-0644-z.
short: N.P. Benedikter, J. Sok, J. Solovej, Annales Henri Poincare 19 (2018) 1167–1214.
corr_author: '1'
date_created: 2018-12-11T11:46:34Z
date_published: 2018-04-01T00:00:00Z
date_updated: 2024-10-09T20:58:43Z
day: '01'
ddc:
- '510'
- '539'
department:
- _id: RoSe
doi: 10.1007/s00023-018-0644-z
external_id:
isi:
- '000427578900006'
file:
- access_level: open_access
checksum: 883eeccba8384ad7fcaa28761d99a0fa
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:57Z
date_updated: 2020-07-14T12:46:31Z
file_id: '4914'
file_name: IST-2018-993-v1+1_2018_Benedikter_Dirac.pdf
file_size: 923252
relation: main_file
file_date_updated: 2020-07-14T12:46:31Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 1167 - 1214
publication: Annales Henri Poincare
publication_status: published
publisher: Birkhäuser
publist_id: '7367'
pubrep_id: '993'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Dirac–Frenkel principle for reduced density matrices and the Bogoliubov–de
Gennes equations
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 19
year: '2018'
...
---
_id: '456'
abstract:
- lang: eng
text: 'Inhibition of the endoplasmic reticulum stress pathway may hold the key to
Zika virus-associated microcephaly treatment. '
article_number: eaar7514
author:
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: 'Novarino G. Zika-associated microcephaly: Reduce the stress and race for the
treatment. Science Translational Medicine. 2018;10(423). doi:10.1126/scitranslmed.aar7514'
apa: 'Novarino, G. (2018). Zika-associated microcephaly: Reduce the stress and race
for the treatment. Science Translational Medicine. American Association
for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aar7514'
chicago: 'Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race
for the Treatment.” Science Translational Medicine. American Association
for the Advancement of Science, 2018. https://doi.org/10.1126/scitranslmed.aar7514.'
ieee: 'G. Novarino, “Zika-associated microcephaly: Reduce the stress and race for
the treatment,” Science Translational Medicine, vol. 10, no. 423. American
Association for the Advancement of Science, 2018.'
ista: 'Novarino G. 2018. Zika-associated microcephaly: Reduce the stress and race
for the treatment. Science Translational Medicine. 10(423), eaar7514.'
mla: 'Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race
for the Treatment.” Science Translational Medicine, vol. 10, no. 423, eaar7514,
American Association for the Advancement of Science, 2018, doi:10.1126/scitranslmed.aar7514.'
short: G. Novarino, Science Translational Medicine 10 (2018).
corr_author: '1'
date_created: 2018-12-11T11:46:34Z
date_published: 2018-01-10T00:00:00Z
date_updated: 2024-10-09T20:58:46Z
day: '10'
department:
- _id: GaNo
doi: 10.1126/scitranslmed.aar7514
intvolume: ' 10'
issue: '423'
language:
- iso: eng
month: '01'
oa_version: None
publication: Science Translational Medicine
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '7365'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Zika-associated microcephaly: Reduce the stress and race for the treatment'
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2018'
...
---
_id: '458'
abstract:
- lang: eng
text: We consider congruences of straight lines in a plane with the combinatorics
of the square grid, with all elementary quadrilaterals possessing an incircle.
It is shown that all the vertices of such nets (we call them incircular or IC-nets)
lie on confocal conics. Our main new results are on checkerboard IC-nets in the
plane. These are congruences of straight lines in the plane with the combinatorics
of the square grid, combinatorially colored as a checkerboard, such that all black
coordinate quadrilaterals possess inscribed circles. We show how this larger class
of IC-nets appears quite naturally in Laguerre geometry of oriented planes and
spheres and leads to new remarkable incidence theorems. Most of our results are
valid in hyperbolic and spherical geometries as well. We present also generalizations
in spaces of higher dimension, called checkerboard IS-nets. The construction of
these nets is based on a new 9 inspheres incidence theorem.
acknowledgement: DFG Collaborative Research Center TRR 109 “Discretization in Geometry
and Dynamics”; People Programme (Marie Curie Actions) of the European Union’s Seventh
Framework Programme (FP7/2007-2013) REA grant agreement n◦[291734]
article_processing_charge: No
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Alexander
full_name: Bobenko, Alexander
last_name: Bobenko
citation:
ama: Akopyan A, Bobenko A. Incircular nets and confocal conics. Transactions
of the American Mathematical Society. 2018;370(4):2825-2854. doi:10.1090/tran/7292
apa: Akopyan, A., & Bobenko, A. (2018). Incircular nets and confocal conics.
Transactions of the American Mathematical Society. American Mathematical
Society. https://doi.org/10.1090/tran/7292
chicago: Akopyan, Arseniy, and Alexander Bobenko. “Incircular Nets and Confocal
Conics.” Transactions of the American Mathematical Society. American Mathematical
Society, 2018. https://doi.org/10.1090/tran/7292.
ieee: A. Akopyan and A. Bobenko, “Incircular nets and confocal conics,” Transactions
of the American Mathematical Society, vol. 370, no. 4. American Mathematical
Society, pp. 2825–2854, 2018.
ista: Akopyan A, Bobenko A. 2018. Incircular nets and confocal conics. Transactions
of the American Mathematical Society. 370(4), 2825–2854.
mla: Akopyan, Arseniy, and Alexander Bobenko. “Incircular Nets and Confocal Conics.”
Transactions of the American Mathematical Society, vol. 370, no. 4, American
Mathematical Society, 2018, pp. 2825–54, doi:10.1090/tran/7292.
short: A. Akopyan, A. Bobenko, Transactions of the American Mathematical Society
370 (2018) 2825–2854.
corr_author: '1'
date_created: 2018-12-11T11:46:35Z
date_published: 2018-04-01T00:00:00Z
date_updated: 2025-06-04T08:06:10Z
day: '01'
department:
- _id: HeEd
doi: 10.1090/tran/7292
ec_funded: 1
external_id:
arxiv:
- '1602.04637'
isi:
- '000423197800019'
intvolume: ' 370'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.04637
month: '04'
oa: 1
oa_version: Preprint
page: 2825 - 2854
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Transactions of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
publist_id: '7363'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incircular nets and confocal conics
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 370
year: '2018'
...
---
_id: '6459'
article_processing_charge: No
author:
- first_name: Barbara
full_name: Petritsch, Barbara
id: 406048EC-F248-11E8-B48F-1D18A9856A87
last_name: Petritsch
orcid: 0000-0003-2724-4614
citation:
ama: Petritsch B. Open Access at IST Austria 2009-2017. IST Austria; 2018.
doi:10.5281/zenodo.1410279
apa: 'Petritsch, B. (2018). Open Access at IST Austria 2009-2017. Presented
at the OAT: Open Access Tage, Graz, Austria: IST Austria. https://doi.org/10.5281/zenodo.1410279'
chicago: Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria,
2018. https://doi.org/10.5281/zenodo.1410279.
ieee: B. Petritsch, Open Access at IST Austria 2009-2017. IST Austria, 2018.
ista: Petritsch B. 2018. Open Access at IST Austria 2009-2017, IST Austria,p.
mla: Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria,
2018, doi:10.5281/zenodo.1410279.
short: B. Petritsch, Open Access at IST Austria 2009-2017, IST Austria, 2018.
conference:
end_date: 2018-09-26
location: Graz, Austria
name: 'OAT: Open Access Tage'
start_date: 2018-09-24
date_created: 2019-05-16T07:27:14Z
date_published: 2018-09-24T00:00:00Z
date_updated: 2026-03-31T12:35:03Z
day: '24'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.5281/zenodo.1410279
file:
- access_level: open_access
checksum: 9063ab4d10ea93353c3a03bbf53fbcf1
content_type: application/pdf
creator: dernst
date_created: 2019-05-16T07:26:25Z
date_updated: 2020-07-14T12:47:30Z
file_id: '6460'
file_name: Poster_Beitrag_125_Petritsch.pdf
file_size: 1967778
relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
keyword:
- Open Access
- Publication Analysis
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication_status: published
publisher: IST Austria
status: public
title: Open Access at IST Austria 2009-2017
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_poster
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '415'
abstract:
- lang: eng
text: Recently it was shown that a molecule rotating in a quantum solvent can be
described in terms of the “angulon” quasiparticle [M. Lemeshko, Phys. Rev. Lett.
118, 095301 (2017)]. Here we extend the angulon theory to the case of molecules
possessing an additional spin-1/2 degree of freedom and study the behavior of
the system in the presence of a static magnetic field. We show that exchange of
angular momentum between the molecule and the solvent can be altered by the field,
even though the solvent itself is non-magnetic. In particular, we demonstrate
a possibility to control resonant emission of phonons with a given angular momentum
using a magnetic field.
acknowledgement: "We acknowledge insightful discussions with Giacomo Bighin, Igor
Cherepanov, Johan Mentink, and Enderalp Yakaboylu. This work was supported by the
Austrian Science Fund (FWF), Project No. P29902-N27. W.R. was supported by the Polish
Ministry of Science and Higher Education Grant No. MNISW/2016/DIR/285/NN and by
the European Union’s Horizon 2020 research and innovation programme under the Marie
Skłodowska-Curie Grant Agreement No. 665385.\r\n"
article_number: '104307'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Wojciech
full_name: Rzadkowski, Wojciech
id: 48C55298-F248-11E8-B48F-1D18A9856A87
last_name: Rzadkowski
orcid: 0000-0002-1106-4419
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Rzadkowski W, Lemeshko M. Effect of a magnetic field on molecule–solvent angular
momentum transfer. The Journal of Chemical Physics. 2018;148(10). doi:10.1063/1.5017591
apa: Rzadkowski, W., & Lemeshko, M. (2018). Effect of a magnetic field on molecule–solvent
angular momentum transfer. The Journal of Chemical Physics. AIP Publishing.
https://doi.org/10.1063/1.5017591
chicago: Rzadkowski, Wojciech, and Mikhail Lemeshko. “Effect of a Magnetic Field
on Molecule–Solvent Angular Momentum Transfer.” The Journal of Chemical Physics.
AIP Publishing, 2018. https://doi.org/10.1063/1.5017591.
ieee: W. Rzadkowski and M. Lemeshko, “Effect of a magnetic field on molecule–solvent
angular momentum transfer,” The Journal of Chemical Physics, vol. 148,
no. 10. AIP Publishing, 2018.
ista: Rzadkowski W, Lemeshko M. 2018. Effect of a magnetic field on molecule–solvent
angular momentum transfer. The Journal of Chemical Physics. 148(10), 104307.
mla: Rzadkowski, Wojciech, and Mikhail Lemeshko. “Effect of a Magnetic Field on
Molecule–Solvent Angular Momentum Transfer.” The Journal of Chemical Physics,
vol. 148, no. 10, 104307, AIP Publishing, 2018, doi:10.1063/1.5017591.
short: W. Rzadkowski, M. Lemeshko, The Journal of Chemical Physics 148 (2018).
date_created: 2018-12-11T11:46:21Z
date_published: 2018-03-14T00:00:00Z
date_updated: 2026-04-07T14:20:12Z
day: '14'
department:
- _id: MiLe
doi: 10.1063/1.5017591
ec_funded: 1
external_id:
arxiv:
- '1711.09904'
isi:
- '000427517200065'
intvolume: ' 148'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.09904
month: '03'
oa: 1
oa_version: Preprint
project:
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: The Journal of Chemical Physics
publication_status: published
publisher: AIP Publishing
publist_id: '7408'
quality_controlled: '1'
related_material:
record:
- id: '10759'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Effect of a magnetic field on molecule–solvent angular momentum transfer
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 148
year: '2018'
...
---
_id: '141'
abstract:
- lang: eng
text: 'Given a model and a specification, the fundamental model-checking problem
asks for algorithmic verification of whether the model satisfies the specification.
We consider graphs and Markov decision processes (MDPs), which are fundamental
models for reactive systems. One of the very basic specifications that arise in
verification of reactive systems is the strong fairness (aka Streett) objective.
Given different types of requests and corresponding grants, the objective requires
that for each type, if the request event happens infinitely often, then the corresponding
grant event must also happen infinitely often. All ω -regular objectives can be
expressed as Streett objectives and hence they are canonical in verification.
To handle the state-space explosion, symbolic algorithms are required that operate
on a succinct implicit representation of the system rather than explicitly accessing
the system. While explicit algorithms for graphs and MDPs with Streett objectives
have been widely studied, there has been no improvement of the basic symbolic
algorithms. The worst-case numbers of symbolic steps required for the basic symbolic
algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work
we present the first sub-quadratic symbolic algorithm for graphs with Streett
objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic
insights we present an implementation of the new symbolic approach and show that
it improves the existing approach on several academic benchmark examples.'
acknowledgement: 'Acknowledgements. K. C. and M. H. are partially supported by the
Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported
by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant
(279307: Graph Games). V. T. is partially supported by the European Union’s Horizon
2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement
No. 665385.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
- first_name: Simin
full_name: Oraee, Simin
last_name: Oraee
- 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, Henzinger M, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms
for graphs and Markov decision processes with fairness objectives. In: Vol 10982.
Springer; 2018:178-197. doi:10.1007/978-3-319-96142-2_13'
apa: 'Chatterjee, K., Henzinger, M., Loitzenbauer, V., Oraee, S., & Toman, V.
(2018). Symbolic algorithms for graphs and Markov decision processes with fairness
objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification,
Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13'
chicago: Chatterjee, Krishnendu, Monika Henzinger, Veronika Loitzenbauer, Simin
Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes
with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13.
ieee: 'K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic
algorithms for graphs and Markov decision processes with fairness objectives,”
presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018,
vol. 10982, pp. 178–197.'
ista: 'Chatterjee K, Henzinger M, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic
algorithms for graphs and Markov decision processes with fairness objectives.
CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.'
mla: Chatterjee, Krishnendu, et al. Symbolic Algorithms for Graphs and Markov
Decision Processes with Fairness Objectives. Vol. 10982, Springer, 2018, pp.
178–97, doi:10.1007/978-3-319-96142-2_13.
short: K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer,
2018, pp. 178–197.
conference:
end_date: 2018-07-17
location: Oxford, United Kingdom
name: 'CAV: Computer Aided Verification'
start_date: 2018-07-14
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2026-04-08T07:00:31Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-319-96142-2_13
ec_funded: 1
external_id:
isi:
- '000491469700013'
file:
- access_level: open_access
checksum: 1a6ffa4febe8bb8ac28be3adb3eafebc
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T08:52:38Z
date_updated: 2020-07-14T12:44:53Z
file_id: '5737'
file_name: 2018_LNCS_Chatterjee.pdf
file_size: 675606
relation: main_file
file_date_updated: 2020-07-14T12:44:53Z
has_accepted_license: '1'
intvolume: ' 10982'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 178-197
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_status: published
publisher: Springer
publist_id: '7782'
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Symbolic algorithms for graphs and Markov decision processes with fairness
objectives
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10982
year: '2018'
...
---
_id: '5965'
abstract:
- lang: eng
text: Relaxed concurrent data structures have become increasingly popular, due to
their scalability in graph processing and machine learning applications (\citeNguyen13,
gonzalez2012powergraph ). Despite considerable interest, there exist families
of natural, high performing randomized relaxed concurrent data structures, such
as the popular MultiQueue~\citeMQ pattern for implementing relaxed priority queue
data structures, for which no guarantees are known in the concurrent setting~\citeAKLN17.
Our main contribution is in showing for the first time that, under a set of analytic
assumptions, a family of relaxed concurrent data structures, including variants
of MultiQueues, but also a new approximate counting algorithm we call the MultiCounter,
provides strong probabilistic guarantees on the degree of relaxation with respect
to the sequential specification, in arbitrary concurrent executions. We formalize
these guarantees via a new correctness condition called distributional linearizability,
tailored to concurrent implementations with randomized relaxations. Our result
is based on a new analysis of an asynchronous variant of the classic power-of-two-choices
load balancing algorithm, in which placement choices can be based on inconsistent,
outdated information (this result may be of independent interest). We validate
our results empirically, showing that the MultiCounter algorithm can implement
scalable relaxed timestamps.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Jerry Z.
full_name: Li, Jerry Z.
last_name: Li
- first_name: Giorgi
full_name: Nadiradze, Giorgi
last_name: Nadiradze
citation:
ama: 'Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable
data structures. In: Proceedings of the 30th on Symposium on Parallelism in
Algorithms and Architectures - SPAA ’18. ACM; 2018:133-142. doi:10.1145/3210377.3210411'
apa: 'Alistarh, D.-A., Brown, T. A., Kopinsky, J., Li, J. Z., & Nadiradze, G.
(2018). Distributionally linearizable data structures. In Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18
(pp. 133–142). Vienna, Austria: ACM. https://doi.org/10.1145/3210377.3210411'
chicago: Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and
Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings
of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA
’18, 133–42. ACM, 2018. https://doi.org/10.1145/3210377.3210411.
ieee: D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally
linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism
in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 133–142.
ista: 'Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. 2018. Distributionally
linearizable data structures. Proceedings of the 30th on Symposium on Parallelism
in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in
Algorithms and Architectures, 133–142.'
mla: Alistarh, Dan-Adrian, et al. “Distributionally Linearizable Data Structures.”
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
- SPAA ’18, ACM, 2018, pp. 133–42, doi:10.1145/3210377.3210411.
short: D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings
of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA
’18, ACM, 2018, pp. 133–142.
conference:
end_date: 2018-07-18
location: Vienna, Austria
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2018-07-16
date_created: 2019-02-13T10:17:19Z
date_published: 2018-07-16T00:00:00Z
date_updated: 2026-04-08T07:00:45Z
day: '16'
department:
- _id: DaAl
doi: 10.1145/3210377.3210411
external_id:
arxiv:
- '1804.01018'
isi:
- '000545269600016'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.01018
month: '07'
oa: 1
oa_version: Preprint
page: 133-142
publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures - SPAA '18
publication_identifier:
isbn:
- '9781450357999'
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '10429'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Distributionally linearizable data structures
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '187'
abstract:
- lang: eng
text: 'Given a locally finite X ⊆ ℝd and a radius r ≥ 0, the k-fold cover of X and
r consists of all points in ℝd that have k or more points of X within distance
r. We consider two filtrations - one in scale obtained by fixing k and increasing
r, and the other in depth obtained by fixing r and decreasing k - and we compute
the persistence diagrams of both. While standard methods suffice for the filtration
in scale, we need novel geometric and topological concepts for the filtration
in depth. In particular, we introduce a rhomboid tiling in ℝd+1 whose horizontal
integer slices are the order-k Delaunay mosaics of X, and construct a zigzag module
from Delaunay mosaics that is isomorphic to the persistence module of the multi-covers. '
acknowledgement: This work is partially supported by the DFG Collaborative Research
Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35
of the Austrian Science Fund (FWF).
alternative_title:
- LIPIcs
article_number: '34'
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
orcid: 0000-0002-8882-5116
citation:
ama: 'Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls.
In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.34'
apa: 'Edelsbrunner, H., & Osang, G. F. (2018). The multi-cover persistence of
Euclidean balls (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.34'
chicago: Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence
of Euclidean Balls,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.34.
ieee: 'H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean
balls,” presented at the SoCG: Symposium on Computational Geometry, Budapest,
Hungary, 2018, vol. 99.'
ista: 'Edelsbrunner H, Osang GF. 2018. The multi-cover persistence of Euclidean
balls. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 34.'
mla: Edelsbrunner, Herbert, and Georg F. Osang. The Multi-Cover Persistence of
Euclidean Balls. Vol. 99, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018, doi:10.4230/LIPIcs.SoCG.2018.34.
short: H. Edelsbrunner, G.F. Osang, in:, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2018.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:05Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2026-04-08T07:01:29Z
day: '11'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2018.34
file:
- access_level: open_access
checksum: d8c0533ad0018eb4ed1077475eb8fc18
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:27:22Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5738'
file_name: 2018_LIPIcs_Edelsbrunner_Osang.pdf
file_size: 528018
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7732'
quality_controlled: '1'
related_material:
record:
- id: '9317'
relation: later_version
status: public
- id: '9056'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: The multi-cover persistence of Euclidean balls
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2018'
...
---
OA_place: publisher
OA_type: gold
_id: '133'
abstract:
- lang: eng
text: Synchronous programs are easy to specify because the side effects of an operation
are finished by the time the invocation of the operation returns to the caller.
Asynchronous programs, on the other hand, are difficult to specify because there
are side effects due to pending computation scheduled as a result of the invocation
of an operation. They are also difficult to verify because of the large number
of possible interleavings of concurrent computation threads. We present synchronization,
a new proof rule that simplifies the verification of asynchronous programs by
introducing the fiction, for proof purposes, that asynchronous operations complete
synchronously. Synchronization summarizes an asynchronous computation as immediate
atomic effect. Modular verification is enabled via pending asynchronous calls
in atomic summaries, and a complementary proof rule that eliminates pending asynchronous
calls when components and their specifications are composed. We evaluate synchronization
in the context of a multi-layer refinement verification methodology on a collection
of benchmark programs.
alternative_title:
- LIPIcs
article_number: '21'
article_processing_charge: No
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Kragl B, Qadeer S, Henzinger TA. Synchronizing the asynchronous. In: Vol 118.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.21'
apa: 'Kragl, B., Qadeer, S., & Henzinger, T. A. (2018). Synchronizing the asynchronous
(Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory,
Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21'
chicago: Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the
Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
https://doi.org/10.4230/LIPIcs.CONCUR.2018.21.
ieee: 'B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,”
presented at the CONCUR: International Conference on Concurrency Theory, Beijing,
China, 2018, vol. 118.'
ista: 'Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR:
International Conference on Concurrency Theory, LIPIcs, vol. 118, 21.'
mla: Kragl, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.
short: B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018.
conference:
end_date: 2018-09-07
location: Beijing, China
name: 'CONCUR: International Conference on Concurrency Theory'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:48Z
date_published: 2018-08-13T00:00:00Z
date_updated: 2026-04-08T07:23:52Z
day: '13'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2018.21
extern: '1'
file:
- access_level: open_access
checksum: c90895f4c5fafc18ddc54d1c8848077e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:46Z
date_updated: 2020-07-14T12:44:44Z
file_id: '5368'
file_name: IST-2018-853-v2+2_concur2018.pdf
file_size: 745438
relation: main_file
file_date_updated: 2020-07-14T12:44:44Z
has_accepted_license: '1'
intvolume: ' 118'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_identifier:
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7790'
pubrep_id: '1039'
quality_controlled: '1'
related_material:
record:
- id: '6426'
relation: earlier_version
status: public
- id: '8332'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Synchronizing the asynchronous
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 118
year: '2018'
...
---
_id: '160'
abstract:
- lang: eng
text: We present layered concurrent programs, a compact and expressive notation
for specifying refinement proofs of concurrent programs. A layered concurrent
program specifies a sequence of connected concurrent programs, from most concrete
to most abstract, such that common parts of different programs are written exactly
once. These programs are expressed in the ordinary syntax of imperative concurrent
programs using gated atomic actions, sequencing, choice, and (recursive) procedure
calls. Each concurrent program is automatically extracted from the layered program.
We reduce refinement to the safety of a sequence of concurrent checker programs,
one each to justify the connection between every two consecutive concurrent programs.
These checker programs are also automatically extracted from the layered program.
Layered concurrent programs have been implemented in the CIVL verifier which has
been successfully used for the verification of several complex concurrent programs.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
citation:
ama: 'Kragl B, Qadeer S. Layered Concurrent Programs. In: Vol 10981. Springer; 2018:79-102.
doi:10.1007/978-3-319-96145-3_5'
apa: 'Kragl, B., & Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981,
pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer.
https://doi.org/10.1007/978-3-319-96145-3_5'
chicago: Kragl, Bernhard, and Shaz Qadeer. “Layered Concurrent Programs,” 10981:79–102.
Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_5.
ieee: 'B. Kragl and S. Qadeer, “Layered Concurrent Programs,” presented at the CAV:
Computer Aided Verification, Oxford, UK, 2018, vol. 10981, pp. 79–102.'
ista: 'Kragl B, Qadeer S. 2018. Layered Concurrent Programs. CAV: Computer Aided
Verification, LNCS, vol. 10981, 79–102.'
mla: Kragl, Bernhard, and Shaz Qadeer. Layered Concurrent Programs. Vol.
10981, Springer, 2018, pp. 79–102, doi:10.1007/978-3-319-96145-3_5.
short: B. Kragl, S. Qadeer, in:, Springer, 2018, pp. 79–102.
conference:
end_date: 2018-07-17
location: Oxford, UK
name: 'CAV: Computer Aided Verification'
start_date: 2018-07-14
date_created: 2018-12-11T11:44:57Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2026-04-08T07:23:52Z
day: '18'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-96145-3_5
external_id:
isi:
- '000491481600005'
file:
- access_level: open_access
checksum: c64fff560fe5a7532ec10626ad1c215e
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:52:12Z
date_updated: 2020-07-14T12:45:04Z
file_id: '5705'
file_name: 2018_LNCS_Kragl.pdf
file_size: 1603844
relation: main_file
file_date_updated: 2020-07-14T12:45:04Z
has_accepted_license: '1'
intvolume: ' 10981'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 79 - 102
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '7761'
quality_controlled: '1'
related_material:
record:
- id: '8332'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Layered Concurrent Programs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10981
year: '2018'
...
---
_id: '5751'
abstract:
- lang: eng
text: 'Because of the intrinsic randomness of the evolutionary process, a mutant
with a fitness advantage has some chance to be selected but no certainty. Any
experiment that searches for advantageous mutants will lose many of them due to
random drift. It is therefore of great interest to find population structures
that improve the odds of advantageous mutants. Such structures are called amplifiers
of natural selection: they increase the probability that advantageous mutants
are selected. Arbitrarily strong amplifiers guarantee the selection of advantageous
mutants, even for very small fitness advantage. Despite intensive research over
the past decade, arbitrarily strong amplifiers have remained rare. Here we show
how to construct a large variety of them. Our amplifiers are so simple that they
could be useful in biotechnology, when optimizing biological molecules, or as
a diagnostic tool, when searching for faster dividing cells or viruses. They could
also occur in natural population structures.'
article_number: '71'
article_processing_charge: No
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin A.
full_name: Nowak, Martin A.
last_name: Nowak
citation:
ama: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. Construction of arbitrarily
strong amplifiers of natural selection using evolutionary graph theory. Communications
Biology. 2018;1(1). doi:10.1038/s42003-018-0078-7
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Construction
of arbitrarily strong amplifiers of natural selection using evolutionary graph
theory. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-018-0078-7
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection
Using Evolutionary Graph Theory.” Communications Biology. Springer Nature,
2018. https://doi.org/10.1038/s42003-018-0078-7.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction
of arbitrarily strong amplifiers of natural selection using evolutionary graph
theory,” Communications Biology, vol. 1, no. 1. Springer Nature, 2018.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. 2018. Construction of arbitrarily
strong amplifiers of natural selection using evolutionary graph theory. Communications
Biology. 1(1), 71.
mla: Pavlogiannis, Andreas, et al. “Construction of Arbitrarily Strong Amplifiers
of Natural Selection Using Evolutionary Graph Theory.” Communications Biology,
vol. 1, no. 1, 71, Springer Nature, 2018, doi:10.1038/s42003-018-0078-7.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M.A. Nowak, Communications Biology
1 (2018).
date_created: 2018-12-18T13:22:58Z
date_published: 2018-06-14T00:00:00Z
date_updated: 2026-04-08T07:24:11Z
day: '14'
ddc:
- '004'
- '519'
- '576'
department:
- _id: KrCh
doi: 10.1038/s42003-018-0078-7
ec_funded: 1
external_id:
isi:
- '000461126500071'
file:
- access_level: open_access
checksum: a9db825fa3b64a51ff3de035ec973b3e
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T13:37:04Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5752'
file_name: 2018_CommBiology_Pavlogiannis.pdf
file_size: 1804194
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
has_accepted_license: '1'
intvolume: ' 1'
isi: 1
issue: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Communications Biology
publication_identifier:
issn:
- 2399-3642
publication_status: published
publisher: Springer Nature
pubrep_id: '1045'
quality_controlled: '1'
related_material:
record:
- id: '5559'
relation: popular_science
status: public
- id: '7196'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: Construction of arbitrarily strong amplifiers of natural selection using evolutionary
graph theory
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 1
year: '2018'
...