---
_id: '6844'
abstract:
- lang: eng
text: Studying the progression of the proliferative and differentiative patterns
of neural stem cells at the individual cell level is crucial to the understanding
of cortex development and how the disruption of such patterns can lead to malformations
and neurodevelopmental diseases. However, our understanding of the precise lineage
progression programme at single-cell resolution is still incomplete due to the
technical variations in lineage- tracing approaches. One of the key challenges
involves developing a robust theoretical framework in which we can integrate experimental
observations and introduce correction factors to obtain a reliable and representative
description of the temporal modulation of proliferation and differentiation. In
order to obtain more conclusive insights, we carry out virtual clonal analysis
using mathematical modelling and compare our results against experimental data.
Using a dataset obtained with Mosaic Analysis with Double Markers, we illustrate
how the theoretical description can be exploited to interpret and reconcile the
disparity between virtual and experimental results.
article_processing_charge: No
article_type: original
author:
- first_name: Noemi
full_name: Picco, Noemi
last_name: Picco
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Julio
full_name: Rodarte, Julio
id: 3C70A038-F248-11E8-B48F-1D18A9856A87
last_name: Rodarte
- first_name: Carmen
full_name: Streicher, Carmen
id: 36BCB99C-F248-11E8-B48F-1D18A9856A87
last_name: Streicher
- first_name: Zoltán
full_name: Molnár, Zoltán
last_name: Molnár
- first_name: Philip K.
full_name: Maini, Philip K.
last_name: Maini
- first_name: Thomas E.
full_name: Woolley, Thomas E.
last_name: Woolley
citation:
ama: Picco N, Hippenmeyer S, Rodarte J, et al. A mathematical insight into cell
labelling experiments for clonal analysis. Journal of Anatomy. 2019;235(3):686-696.
doi:10.1111/joa.13001
apa: Picco, N., Hippenmeyer, S., Rodarte, J., Streicher, C., Molnár, Z., Maini,
P. K., & Woolley, T. E. (2019). A mathematical insight into cell labelling
experiments for clonal analysis. Journal of Anatomy. Wiley. https://doi.org/10.1111/joa.13001
chicago: Picco, Noemi, Simon Hippenmeyer, Julio Rodarte, Carmen Streicher, Zoltán
Molnár, Philip K. Maini, and Thomas E. Woolley. “A Mathematical Insight into Cell
Labelling Experiments for Clonal Analysis.” Journal of Anatomy. Wiley,
2019. https://doi.org/10.1111/joa.13001.
ieee: N. Picco et al., “A mathematical insight into cell labelling experiments
for clonal analysis,” Journal of Anatomy, vol. 235, no. 3. Wiley, pp. 686–696,
2019.
ista: Picco N, Hippenmeyer S, Rodarte J, Streicher C, Molnár Z, Maini PK, Woolley
TE. 2019. A mathematical insight into cell labelling experiments for clonal analysis.
Journal of Anatomy. 235(3), 686–696.
mla: Picco, Noemi, et al. “A Mathematical Insight into Cell Labelling Experiments
for Clonal Analysis.” Journal of Anatomy, vol. 235, no. 3, Wiley, 2019,
pp. 686–96, doi:10.1111/joa.13001.
short: N. Picco, S. Hippenmeyer, J. Rodarte, C. Streicher, Z. Molnár, P.K. Maini,
T.E. Woolley, Journal of Anatomy 235 (2019) 686–696.
date_created: 2019-09-02T11:57:28Z
date_published: 2019-09-01T00:00:00Z
date_updated: 2025-04-14T07:43:05Z
day: '01'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1111/joa.13001
ec_funded: 1
external_id:
isi:
- '000482426800017'
file:
- access_level: open_access
checksum: 160f960844b204057f20896e0e1f8ee7
content_type: application/pdf
creator: dernst
date_created: 2019-09-02T12:05:18Z
date_updated: 2020-07-14T12:47:42Z
file_id: '6845'
file_name: 2019_JournalAnatomy_Picco.pdf
file_size: 1192994
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 235'
isi: 1
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '09'
oa: 1
oa_version: Published Version
page: 686-696
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
publication: Journal of Anatomy
publication_identifier:
eissn:
- 1469-7580
issn:
- 0021-8782
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: A mathematical insight into cell labelling experiments for clonal analysis
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 235
year: '2019'
...
---
_id: '6855'
abstract:
- lang: eng
text: Many traits of interest are highly heritable and genetically complex, meaning
that much of the variation they exhibit arises from differences at numerous loci
in the genome. Complex traits and their evolution have been studied for more than
a century, but only in the last decade have genome-wide association studies (GWASs)
in humans begun to reveal their genetic basis. Here, we bring these threads of
research together to ask how findings from GWASs can further our understanding
of the processes that give rise to heritable variation in complex traits and of
the genetic basis of complex trait evolution in response to changing selection
pressures (i.e., of polygenic adaptation). Conversely, we ask how evolutionary
thinking helps us to interpret findings from GWASs and informs related efforts
of practical importance.
article_processing_charge: No
author:
- first_name: Guy
full_name: Sella, Guy
last_name: Sella
- 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: Sella G, Barton NH. Thinking about the evolution of complex traits in the era
of genome-wide association studies. Annual Review of Genomics and Human Genetics.
2019;20:461-493. doi:10.1146/annurev-genom-083115-022316
apa: Sella, G., & Barton, N. H. (2019). Thinking about the evolution of complex
traits in the era of genome-wide association studies. Annual Review of Genomics
and Human Genetics. Annual Reviews. https://doi.org/10.1146/annurev-genom-083115-022316
chicago: Sella, Guy, and Nicholas H Barton. “Thinking about the Evolution of Complex
Traits in the Era of Genome-Wide Association Studies.” Annual Review of Genomics
and Human Genetics. Annual Reviews, 2019. https://doi.org/10.1146/annurev-genom-083115-022316.
ieee: G. Sella and N. H. Barton, “Thinking about the evolution of complex traits
in the era of genome-wide association studies,” Annual Review of Genomics and
Human Genetics, vol. 20. Annual Reviews, pp. 461–493, 2019.
ista: Sella G, Barton NH. 2019. Thinking about the evolution of complex traits in
the era of genome-wide association studies. Annual Review of Genomics and Human
Genetics. 20, 461–493.
mla: Sella, Guy, and Nicholas H. Barton. “Thinking about the Evolution of Complex
Traits in the Era of Genome-Wide Association Studies.” Annual Review of Genomics
and Human Genetics, vol. 20, Annual Reviews, 2019, pp. 461–93, doi:10.1146/annurev-genom-083115-022316.
short: G. Sella, N.H. Barton, Annual Review of Genomics and Human Genetics 20 (2019)
461–493.
corr_author: '1'
date_created: 2019-09-07T14:28:29Z
date_published: 2019-07-05T00:00:00Z
date_updated: 2024-10-09T20:58:59Z
day: '05'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1146/annurev-genom-083115-022316
external_id:
isi:
- '000485148400020'
pmid:
- '31283361'
file:
- access_level: open_access
checksum: 23d3978cf4739a89ce2c3e779f9305ca
content_type: application/pdf
creator: dernst
date_created: 2019-09-09T07:22:12Z
date_updated: 2020-07-14T12:47:42Z
file_id: '6862'
file_name: 2019_AnnualReview_Sella.pdf
file_size: 411491
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 20'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 461-493
pmid: 1
publication: Annual Review of Genomics and Human Genetics
publication_identifier:
eissn:
- 1545-293X
issn:
- 1527-8204
publication_status: published
publisher: Annual Reviews
quality_controlled: '1'
scopus_import: '1'
status: public
title: Thinking about the evolution of complex traits in the era of genome-wide association
studies
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 20
year: '2019'
...
---
_id: '6856'
abstract:
- lang: eng
text: 'Plant mating systems play a key role in structuring genetic variation both
within and between species. In hybrid zones, the outcomes and dynamics of hybridization
are usually interpreted as the balance between gene flow and selection against
hybrids. Yet, mating systems can introduce selective forces that alter these expectations;
with diverse outcomes for the level and direction of gene flow depending on variation
in outcrossing and whether the mating systems of the species pair are the same
or divergent. We present a survey of hybridization in 133 species pairs from 41
plant families and examine how patterns of hybridization vary with mating system.
We examine if hybrid zone mode, level of gene flow, asymmetries in gene flow and
the frequency of reproductive isolating barriers vary in relation to mating system/s
of the species pair. We combine these results with a simulation model and examples
from the literature to address two general themes: (i) the two‐way interaction
between introgression and the evolution of reproductive systems, and (ii) how
mating system can facilitate or restrict interspecific gene flow. We conclude
that examining mating system with hybridization provides unique opportunities
to understand divergence and the processes underlying reproductive isolation.'
article_processing_charge: No
article_type: original
author:
- first_name: Melinda
full_name: Pickup, Melinda
id: 2C78037E-F248-11E8-B48F-1D18A9856A87
last_name: Pickup
orcid: 0000-0001-6118-0541
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Yaniv
full_name: Brandvain, Yaniv
last_name: Brandvain
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: Sarah
full_name: Yakimowski, Sarah
last_name: Yakimowski
- first_name: Tanmay
full_name: Dixit, Tanmay
last_name: Dixit
- first_name: Christian
full_name: Lexer, Christian
last_name: Lexer
- first_name: Eva
full_name: Cereghetti, Eva
id: 71AA91B4-05ED-11EA-8BEB-F5833E63BD63
last_name: Cereghetti
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
citation:
ama: 'Pickup M, Barton NH, Brandvain Y, et al. Mating system variation in hybrid
zones: Facilitation, barriers and asymmetries to gene flow. New Phytologist.
2019;224(3):1035-1047. doi:10.1111/nph.16180'
apa: 'Pickup, M., Barton, N. H., Brandvain, Y., Fraisse, C., Yakimowski, S., Dixit,
T., … Field, D. (2019). Mating system variation in hybrid zones: Facilitation,
barriers and asymmetries to gene flow. New Phytologist. Wiley. https://doi.org/10.1111/nph.16180'
chicago: 'Pickup, Melinda, Nicholas H Barton, Yaniv Brandvain, Christelle Fraisse,
Sarah Yakimowski, Tanmay Dixit, Christian Lexer, Eva Cereghetti, and David Field.
“Mating System Variation in Hybrid Zones: Facilitation, Barriers and Asymmetries
to Gene Flow.” New Phytologist. Wiley, 2019. https://doi.org/10.1111/nph.16180.'
ieee: 'M. Pickup et al., “Mating system variation in hybrid zones: Facilitation,
barriers and asymmetries to gene flow,” New Phytologist, vol. 224, no.
3. Wiley, pp. 1035–1047, 2019.'
ista: 'Pickup M, Barton NH, Brandvain Y, Fraisse C, Yakimowski S, Dixit T, Lexer
C, Cereghetti E, Field D. 2019. Mating system variation in hybrid zones: Facilitation,
barriers and asymmetries to gene flow. New Phytologist. 224(3), 1035–1047.'
mla: 'Pickup, Melinda, et al. “Mating System Variation in Hybrid Zones: Facilitation,
Barriers and Asymmetries to Gene Flow.” New Phytologist, vol. 224, no.
3, Wiley, 2019, pp. 1035–47, doi:10.1111/nph.16180.'
short: M. Pickup, N.H. Barton, Y. Brandvain, C. Fraisse, S. Yakimowski, T. Dixit,
C. Lexer, E. Cereghetti, D. Field, New Phytologist 224 (2019) 1035–1047.
date_created: 2019-09-07T14:35:40Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2025-04-15T07:17:08Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1111/nph.16180
ec_funded: 1
external_id:
pmid:
- '31505037'
file:
- access_level: open_access
checksum: 21e4c95599bbcaf7c483b89954658672
content_type: application/pdf
creator: dernst
date_created: 2019-11-13T08:15:05Z
date_updated: 2020-07-14T12:47:42Z
file_id: '7011'
file_name: 2019_NewPhytologist_Pickup.pdf
file_size: 1511958
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 224'
issue: '3'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1035-1047
pmid: 1
project:
- _id: 25B36484-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '329960'
name: Mating system and the evolutionary dynamics of hybrid zones
- _id: 2662AADE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02463
name: Sex chromosomes and species barriers
publication: New Phytologist
publication_identifier:
eissn:
- 1469-8137
issn:
- 0028-646X
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Mating system variation in hybrid zones: Facilitation, barriers and asymmetries
to gene flow'
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: 224
year: '2019'
...
---
_id: '6857'
abstract:
- lang: eng
text: "Gene Drives are regarded as future tools with a high potential for population
control. Due to their inherent ability to overcome the rules of Mendelian inheritance,
gene drives (GD) may spread genes rapidly through populations of sexually reproducing
organisms. A release of organisms carrying a GD would constitute a paradigm shift
in the handling of genetically modified organisms because gene drive organisms
(GDO) are designed to drive their transgenes into wild populations and thereby
increase the number of GDOs. The rapid development in this field and its focus
on wild populations demand a prospective risk assessment with a focus on exposure
related aspects. Presently, it is unclear how adequate risk management could be
guaranteed to limit the spread of GDs in time and space, in order to avoid potential
adverse effects in socio‐ecological systems.\r\n\r\nThe recent workshop on the
“Evaluation of Spatial and Temporal Control of Gene Drives” hosted by the Institute
of Safety/Security and Risk Sciences (ISR) in Vienna aimed at gaining some insight
into the potential population dynamic behavior of GDs and appropriate measures
of control. Scientists from France, Germany, England, and the USA discussed both
topics in this meeting on April 4–5, 2019. This article summarizes results of
the workshop."
article_number: '1900151'
article_processing_charge: No
article_type: original
author:
- first_name: B
full_name: Giese, B
last_name: Giese
- first_name: J L
full_name: Friess, J L
last_name: Friess
- first_name: 'M F '
full_name: 'Schetelig, M F '
last_name: Schetelig
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Philip
full_name: Messer, Philip
last_name: Messer
- first_name: Florence
full_name: Debarre, Florence
last_name: Debarre
- first_name: H
full_name: Meimberg, H
last_name: Meimberg
- first_name: N
full_name: Windbichler, N
last_name: Windbichler
- first_name: C
full_name: Boete, C
last_name: Boete
citation:
ama: 'Giese B, Friess JL, Schetelig MF, et al. Gene Drives: Dynamics and regulatory
matters – A report from the workshop “Evaluation of spatial and temporal control
of Gene Drives”, 4 – 5 April 2019, Vienna. BioEssays. 2019;41(11). doi:10.1002/bies.201900151'
apa: 'Giese, B., Friess, J. L., Schetelig, M. F., Barton, N. H., Messer, P., Debarre,
F., … Boete, C. (2019). Gene Drives: Dynamics and regulatory matters – A report
from the workshop “Evaluation of spatial and temporal control of Gene Drives”,
4 – 5 April 2019, Vienna. BioEssays. Wiley. https://doi.org/10.1002/bies.201900151'
chicago: 'Giese, B, J L Friess, M F Schetelig, Nicholas H Barton, Philip Messer,
Florence Debarre, H Meimberg, N Windbichler, and C Boete. “Gene Drives: Dynamics
and Regulatory Matters – A Report from the Workshop ‘Evaluation of Spatial and
Temporal Control of Gene Drives’, 4 – 5 April 2019, Vienna.” BioEssays.
Wiley, 2019. https://doi.org/10.1002/bies.201900151.'
ieee: 'B. Giese et al., “Gene Drives: Dynamics and regulatory matters – A
report from the workshop ‘Evaluation of spatial and temporal control of Gene Drives’,
4 – 5 April 2019, Vienna,” BioEssays, vol. 41, no. 11. Wiley, 2019.'
ista: 'Giese B, Friess JL, Schetelig MF, Barton NH, Messer P, Debarre F, Meimberg
H, Windbichler N, Boete C. 2019. Gene Drives: Dynamics and regulatory matters
– A report from the workshop “Evaluation of spatial and temporal control of Gene
Drives”, 4 – 5 April 2019, Vienna. BioEssays. 41(11), 1900151.'
mla: 'Giese, B., et al. “Gene Drives: Dynamics and Regulatory Matters – A Report
from the Workshop ‘Evaluation of Spatial and Temporal Control of Gene Drives’,
4 – 5 April 2019, Vienna.” BioEssays, vol. 41, no. 11, 1900151, Wiley,
2019, doi:10.1002/bies.201900151.'
short: B. Giese, J.L. Friess, M.F. Schetelig, N.H. Barton, P. Messer, F. Debarre,
H. Meimberg, N. Windbichler, C. Boete, BioEssays 41 (2019).
date_created: 2019-09-07T14:40:03Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2023-08-30T06:56:26Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1002/bies.201900151
external_id:
isi:
- '000489502000001'
file:
- access_level: open_access
checksum: 8cc7551bff70b2658f8d5630f228ee12
content_type: application/pdf
creator: dernst
date_created: 2019-10-11T06:59:26Z
date_updated: 2020-07-14T12:47:42Z
file_id: '6939'
file_name: 2019_BioEssays_Giese.pdf
file_size: 193248
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 41'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: BioEssays
publication_identifier:
eissn:
- 1521-1878
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Gene Drives: Dynamics and regulatory matters – A report from the workshop
“Evaluation of spatial and temporal control of Gene Drives”, 4 – 5 April 2019, Vienna'
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 41
year: '2019'
...
---
_id: '6858'
article_processing_charge: No
article_type: review
author:
- 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: Barton NH. Is speciation driven by cycles of mixing and isolation? National
Science Review. 2019;6(2):291-292. doi:10.1093/nsr/nwy113
apa: Barton, N. H. (2019). Is speciation driven by cycles of mixing and isolation?
National Science Review. Oxford University Press. https://doi.org/10.1093/nsr/nwy113
chicago: Barton, Nicholas H. “Is Speciation Driven by Cycles of Mixing and Isolation?”
National Science Review. Oxford University Press, 2019. https://doi.org/10.1093/nsr/nwy113.
ieee: N. H. Barton, “Is speciation driven by cycles of mixing and isolation?,” National
Science Review, vol. 6, no. 2. Oxford University Press, pp. 291–292, 2019.
ista: Barton NH. 2019. Is speciation driven by cycles of mixing and isolation? National
Science Review. 6(2), 291–292.
mla: Barton, Nicholas H. “Is Speciation Driven by Cycles of Mixing and Isolation?”
National Science Review, vol. 6, no. 2, Oxford University Press, 2019,
pp. 291–92, doi:10.1093/nsr/nwy113.
short: N.H. Barton, National Science Review 6 (2019) 291–292.
date_created: 2019-09-07T14:43:02Z
date_published: 2019-03-01T00:00:00Z
date_updated: 2023-08-29T07:51:09Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1093/nsr/nwy113
external_id:
isi:
- '000467957400025'
file:
- access_level: open_access
checksum: 571d60fa21a568607d1fd04e119da88c
content_type: application/pdf
creator: dernst
date_created: 2020-10-02T09:16:44Z
date_updated: 2020-10-02T09:16:44Z
file_id: '8595'
file_name: 2019_NSR_Barton.pdf
file_size: 106463
relation: main_file
success: 1
file_date_updated: 2020-10-02T09:16:44Z
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
issue: '2'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 291-292
publication: National Science Review
publication_identifier:
eissn:
- 2053-714X
issn:
- 2095-5138
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Is speciation driven by cycles of mixing and isolation?
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 6
year: '2019'
...
---
_id: '6859'
abstract:
- lang: eng
text: V (vacuolar)/A (archaeal)-type adenosine triphosphatases (ATPases), found
in archaeaand eubacteria, couple ATP hydrolysis or synthesis to proton translocation
across theplasma membrane using the rotary-catalysis mechanism. They belong to
the V-typeATPase family, which differs from the mitochondrial/chloroplast F-type
ATP synthasesin overall architecture. We solved cryo–electron microscopy structures
of the intactThermus thermophilusV/A-ATPase, reconstituted into lipid nanodiscs,
in three rotationalstates and two substates. These structures indicate substantial
flexibility betweenV1and Voin a working enzyme, which results from mechanical
competition between centralshaft rotation and resistance from the peripheral stalks.
We also describedetails of adenosine diphosphate inhibition release, V1-Votorque
transmission, andproton translocation, which are relevant for the entire V-type
ATPase family.
acknowledged_ssus:
- _id: ScienComp
article_number: eaaw9144
article_processing_charge: No
author:
- first_name: Long
full_name: Zhou, Long
id: 3E751364-F248-11E8-B48F-1D18A9856A87
last_name: Zhou
orcid: 0000-0002-1864-8951
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Zhou L, Sazanov LA. Structure and conformational plasticity of the intact Thermus
thermophilus V/A-type ATPase. Science. 2019;365(6455). doi:10.1126/science.aaw9144
apa: Zhou, L., & Sazanov, L. A. (2019). Structure and conformational plasticity
of the intact Thermus thermophilus V/A-type ATPase. Science. AAAS. https://doi.org/10.1126/science.aaw9144
chicago: Zhou, Long, and Leonid A Sazanov. “Structure and Conformational Plasticity
of the Intact Thermus Thermophilus V/A-Type ATPase.” Science. AAAS, 2019.
https://doi.org/10.1126/science.aaw9144.
ieee: L. Zhou and L. A. Sazanov, “Structure and conformational plasticity of the
intact Thermus thermophilus V/A-type ATPase,” Science, vol. 365, no. 6455.
AAAS, 2019.
ista: Zhou L, Sazanov LA. 2019. Structure and conformational plasticity of the intact
Thermus thermophilus V/A-type ATPase. Science. 365(6455), eaaw9144.
mla: Zhou, Long, and Leonid A. Sazanov. “Structure and Conformational Plasticity
of the Intact Thermus Thermophilus V/A-Type ATPase.” Science, vol. 365,
no. 6455, eaaw9144, AAAS, 2019, doi:10.1126/science.aaw9144.
short: L. Zhou, L.A. Sazanov, Science 365 (2019).
date_created: 2019-09-07T19:04:45Z
date_published: 2019-08-23T00:00:00Z
date_updated: 2023-08-29T07:52:02Z
day: '23'
department:
- _id: LeSa
doi: 10.1126/science.aaw9144
external_id:
isi:
- '000482464000043'
pmid:
- '31439765'
intvolume: ' 365'
isi: 1
issue: '6455'
language:
- iso: eng
month: '08'
oa_version: None
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: AAAS
quality_controlled: '1'
related_material:
link:
- description: News on IST Website
relation: press_release
url: https://ist.ac.at/en/news/structure-of-protein-nano-turbine-revealed/
scopus_import: '1'
status: public
title: Structure and conformational plasticity of the intact Thermus thermophilus
V/A-type ATPase
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 365
year: '2019'
...
---
_id: '6884'
abstract:
- lang: eng
text: 'In two-player games on graphs, the players move a token through a graph to
produce a finite or infinite path, which determines the qualitative winner or
quantitative payoff of the game. We study bidding games in which the players bid
for the right to move the token. Several bidding rules were studied previously.
In Richman bidding, in each round, the players simultaneously submit bids, and
the higher bidder moves the token and pays the other player. Poorman bidding is
similar except that the winner of the bidding pays the "bank" rather than the
other player. Taxman bidding spans the spectrum between Richman and poorman bidding.
They are parameterized by a constant tau in [0,1]: portion tau of the winning
bid is paid to the other player, and portion 1-tau to the bank. While finite-duration
(reachability) taxman games have been studied before, we present, for the first
time, results on infinite-duration taxman games. It was previously shown that
both Richman and poorman infinite-duration games with qualitative objectives reduce
to reachability games, and we show a similar result here. Our most interesting
results concern quantitative taxman games, namely mean-payoff games, where poorman
and Richman bidding differ significantly. A central quantity in these games is
the ratio between the two players'' initial budgets. While in poorman mean-payoff
games, the optimal payoff of a player depends on the initial ratio, in Richman
bidding, the payoff depends only on the structure of the game. In both games the
optimal payoffs can be found using (different) probabilistic connections with
random-turn games in which in each turn, instead of bidding, a coin is tossed
to determine which player moves. While the value with Richman bidding equals the
value of a random-turn game with an un-biased coin, with poorman bidding, the
bias in the coin is the initial ratio of the budgets. We give a complete classification
of mean-payoff taxman games that is based on a probabilistic connection: the value
of a taxman bidding game with parameter tau and initial ratio r, equals the value
of a random-turn game that uses a coin with bias F(tau, r) = (r+tau * (1-r))/(1+tau).
Thus, we show that Richman bidding is the exception; namely, for every tau <1,
the value of the game depends on the initial ratio. Our proof technique simplifies
and unifies the previous proof techniques for both Richman and poorman bidding. '
alternative_title:
- LIPIcs
article_number: '11'
article_processing_charge: No
arxiv: 1
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol
138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.MFCS.2019.11'
apa: 'Avni, G., Henzinger, T. A., & Zikelic, D. (2019). Bidding mechanisms in
graph games (Vol. 138). Presented at the MFCS: Mathematical Foundations of Computer
Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.11'
chicago: Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in
Graph Games,” Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
https://doi.org/10.4230/LIPICS.MFCS.2019.11.
ieee: 'G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,”
presented at the MFCS: Mathematical Foundations of Computer Science, Aachen, Germany,
2019, vol. 138.'
ista: 'Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games.
MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 138, 11.'
mla: Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, 11, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.MFCS.2019.11.
short: G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019.
conference:
end_date: 2019-08-30
location: Aachen, Germany
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2019-08-26
corr_author: '1'
date_created: 2019-09-18T08:04:26Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2025-07-10T11:53:57Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4230/LIPICS.MFCS.2019.11
ec_funded: 1
external_id:
arxiv:
- '1905.03835'
file:
- access_level: open_access
checksum: 6346e116a4f4ed1414174d96d2c4fbd7
content_type: application/pdf
creator: kschuh
date_created: 2019-09-27T11:45:15Z
date_updated: 2020-07-14T12:47:42Z
file_id: '6913'
file_name: 2019_LIPIcs_Avni.pdf
file_size: 554457
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 138'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '9239'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Bidding mechanisms in graph games
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: 138
year: '2019'
...
---
_id: '6885'
abstract:
- lang: eng
text: 'A vector addition system with states (VASS) consists of a finite set of states
and counters. A configuration is a state and a value for each counter; a transition
changes the state and each counter is incremented, decremented, or left unchanged.
While qualitative properties such as state and configuration reachability have
been studied for VASS, we consider the long-run average cost of infinite computations
of VASS. The cost of a configuration is for each state, a linear combination of
the counter values. In the special case of uniform cost functions, the linear
combination is the same for all states. The (regular) long-run emptiness problem
is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped)
computation such that the long-run average value of the cost function does not
exceed the threshold. For uniform cost functions, we show that the regular long-run
emptiness problem is (a) decidable in polynomial time for integer-valued VASS,
and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative
counters). For general cost functions, we show that the problem is (c) NP-complete
for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most
interesting result is for (c) integer-valued VASS with general cost functions,
where we establish a connection between the regular long-run emptiness problem
and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness
problem is equally hard as the regular problem in all cases except (c), where
it remains open. '
alternative_title:
- LIPIcs
article_number: '27'
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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition
systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2019. doi:10.4230/LIPICS.CONCUR.2019.27'
apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average
behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR:
Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average
Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27.
ieee: 'K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of
vector addition systems with states,” presented at the CONCUR: Conference on Concurrency
Theory, Amsterdam, Netherlands, 2019, vol. 140.'
ista: 'Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector
addition systems with states. CONCUR: Conference on Concurrency Theory, LIPIcs,
vol. 140, 27.'
mla: Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition
Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019.
conference:
end_date: 2019-08-30
location: Amsterdam, Netherlands
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2019-08-27
corr_author: '1'
date_created: 2019-09-18T08:06:14Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2025-07-10T11:53:58Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4230/LIPICS.CONCUR.2019.27
file:
- access_level: open_access
checksum: 4985e26e1572d1575d64d38acabd71d6
content_type: application/pdf
creator: kschuh
date_created: 2019-09-27T12:09:35Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6914'
file_name: 2019_LIPIcs_Chatterjee.pdf
file_size: 538120
relation: main_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
intvolume: ' 140'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Long-run average behavior of vector addition systems with states
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: 140
year: '2019'
...
---
_id: '6886'
abstract:
- lang: eng
text: 'In two-player games on graphs, the players move a token through a graph to
produce an infinite path, which determines the winner of the game. Such games
are central in formal methods since they model the interaction between a non-terminating
system and its environment. In bidding games the players bid for the right to
move the token: in each round, the players simultaneously submit bids, and the
higher bidder moves the token and pays the other player. Bidding games are known
to have a clean and elegant mathematical structure that relies on the ability
of the players to submit arbitrarily small bids. Many applications, however, require
a fixed granularity for the bids, which can represent, for example, the monetary
value expressed in cents. We study, for the first time, the combination of discrete-bidding
and infinite-duration games. Our most important result proves that these games
form a large determined subclass of concurrent games, where determinacy is the
strong property that there always exists exactly one player who can guarantee
winning the game. In particular, we show that, in contrast to non-discrete bidding
games, the mechanism with which tied bids are resolved plays an important role
in discrete-bidding games. We study several natural tie-breaking mechanisms and
show that, while some do not admit determinacy, most natural mechanisms imply
determinacy for every pair of initial budgets. '
alternative_title:
- LIPIcs
article_number: '20'
article_processing_charge: No
arxiv: 1
author:
- first_name: Milad
full_name: Aghajohari, Milad
last_name: Aghajohari
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration
games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.20'
apa: 'Aghajohari, M., Avni, G., & Henzinger, T. A. (2019). Determinacy in discrete-bidding
infinite-duration games (Vol. 140). Presented at the CONCUR: Conference on Concurrency
Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.CONCUR.2019.20'
chicago: Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding
Infinite-Duration Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.20.
ieee: 'M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding
infinite-duration games,” presented at the CONCUR: Conference on Concurrency Theory,
Amsterdam, Netherlands, 2019, vol. 140.'
ista: 'Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding
infinite-duration games. CONCUR: Conference on Concurrency Theory, LIPIcs, vol.
140, 20.'
mla: Aghajohari, Milad, et al. Determinacy in Discrete-Bidding Infinite-Duration
Games. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019,
doi:10.4230/LIPICS.CONCUR.2019.20.
short: M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019.
conference:
end_date: 2019-08-30
location: Amsterdam, Netherlands
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2019-08-27
corr_author: '1'
date_created: 2019-09-18T08:06:58Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2025-07-10T11:53:58Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPICS.CONCUR.2019.20
external_id:
arxiv:
- '1905.03588'
file:
- access_level: open_access
checksum: 4df6d3575c506edb17215adada03cc8e
content_type: application/pdf
creator: kschuh
date_created: 2019-09-27T12:21:38Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6915'
file_name: 2019_LIPIcs_Aghajohari.pdf
file_size: 741425
relation: main_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
intvolume: ' 140'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
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: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Determinacy in discrete-bidding infinite-duration games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 140
year: '2019'
...
---
_id: '6887'
abstract:
- lang: eng
text: 'The fundamental model-checking problem, given as input a model and a specification,
asks for the algorithmic verification of whether the model satisfies the specification.
Two classical models for reactive systems are graphs and Markov decision processes
(MDPs). A basic specification formalism in the verification of reactive systems
is the strong fairness (aka Streett) objective, where given different types of
requests and corresponding grants, the requirement is that for each type, if the
request event happens infinitely often, then the corresponding grant event must
also happen infinitely often. All omega-regular objectives can be expressed as
Streett objectives and hence they are canonical in verification. Consider graphs/MDPs
with n vertices, m edges, and a Streett objectives with k pairs, and let b denote
the size of the description of the Streett objective for the sets of requests
and grants. The current best-known algorithm for the problem requires time O(min(n^2,
m sqrt{m log n}) + b log n). In this work we present randomized near-linear time
algorithms, with expected running time O~(m + b), where the O~ notation hides
poly-log factors. Our randomized algorithms are near-linear in the size of the
input, and hence optimal up to poly-log factors. '
alternative_title:
- LIPIcs
article_number: '7'
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: Wolfgang
full_name: Dvorák, Wolfgang
last_name: Dvorák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvorák W, Henzinger M, Svozil A. Near-linear time algorithms
for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings
in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2019. doi:10.4230/LIPICS.CONCUR.2019.7'
apa: 'Chatterjee, K., Dvorák, W., Henzinger, M., & Svozil, A. (2019). Near-linear
time algorithms for Streett objectives in graphs and MDPs. In Leibniz International
Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Alexander
Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.”
In Leibniz International Proceedings in Informatics, Vol. 140. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7.
ieee: K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Near-linear time algorithms
for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings
in Informatics, Amsterdam, Netherlands, 2019, vol. 140.
ista: 'Chatterjee K, Dvorák W, Henzinger M, Svozil A. 2019. Near-linear time algorithms
for Streett objectives in graphs and MDPs. Leibniz International Proceedings in
Informatics. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 140, 7.'
mla: Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives
in Graphs and MDPs.” Leibniz International Proceedings in Informatics,
vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.
short: K. Chatterjee, W. Dvorák, M. Henzinger, A. Svozil, in:, Leibniz International
Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019.
conference:
end_date: 2019-08-30
location: Amsterdam, Netherlands
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2019-08-27
corr_author: '1'
date_created: 2019-09-18T08:07:58Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2025-07-10T11:53:59Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPICS.CONCUR.2019.7
ec_funded: 1
file:
- access_level: open_access
checksum: e1f0e4061212454574f34a1368d018ec
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T08:20:30Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6922'
file_name: 2019_LIPIcs_Chatterjee.pdf
file_size: 730112
relation: main_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
intvolume: ' 140'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Leibniz International Proceedings in Informatics
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Near-linear time algorithms for Streett objectives in graphs and MDPs
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: 140
year: '2019'
...
---
_id: '6888'
abstract:
- lang: eng
text: In this paper, we design novel liquid time-constant recurrent neural networks
for robotic control, inspired by the brain of the nematode, C. elegans. In the
worm's nervous system, neurons communicate through nonlinear time-varying synaptic
links established amongst them by their particular wiring structure. This property
enables neurons to express liquid time-constants dynamics and therefore allows
the network to originate complex behaviors with a small number of neurons. We
identify neuron-pair communication motifs as design operators and use them to
configure compact neuronal network structures to govern sequential robotic tasks.
The networks are systematically designed to map the environmental observations
to motor actions, by their hierarchical topology from sensory neurons, through
recurrently-wired interneurons, to motor neurons. The networks are then parametrized
in a supervised-learning scheme by a search-based algorithm. We demonstrate that
obtained networks realize interpretable dynamics. We evaluate their performance
in controlling mobile and arm robots, and compare their attributes to other artificial
neural network-based control agents. Finally, we experimentally show their superior
resilience to environmental noise, compared to the existing machine learning-based
methods.
alternative_title:
- ICRA
article_number: '8793840'
article_processing_charge: No
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Manuel
full_name: Zimmer, Manuel
last_name: Zimmer
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. Designing worm-inspired
neural networks for interpretable robotic control. In: Proceedings - IEEE International
Conference on Robotics and Automation. Vol 2019-May. IEEE; 2019. doi:10.1109/icra.2019.8793840'
apa: 'Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., & Grosu, R. (2019).
Designing worm-inspired neural networks for interpretable robotic control. In
Proceedings - IEEE International Conference on Robotics and Automation
(Vol. 2019–May). Montreal, QC, Canada: IEEE. https://doi.org/10.1109/icra.2019.8793840'
chicago: Lechner, Mathias, Ramin Hasani, Manuel Zimmer, Thomas A Henzinger, and
Radu Grosu. “Designing Worm-Inspired Neural Networks for Interpretable Robotic
Control.” In Proceedings - IEEE International Conference on Robotics and Automation,
Vol. 2019–May. IEEE, 2019. https://doi.org/10.1109/icra.2019.8793840.
ieee: M. Lechner, R. Hasani, M. Zimmer, T. A. Henzinger, and R. Grosu, “Designing
worm-inspired neural networks for interpretable robotic control,” in Proceedings
- IEEE International Conference on Robotics and Automation, Montreal, QC,
Canada, 2019, vol. 2019–May.
ista: 'Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. 2019. Designing worm-inspired
neural networks for interpretable robotic control. Proceedings - IEEE International
Conference on Robotics and Automation. ICRA: International Conference on Robotics
and Automation, ICRA, vol. 2019–May, 8793840.'
mla: Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable
Robotic Control.” Proceedings - IEEE International Conference on Robotics and
Automation, vol. 2019–May, 8793840, IEEE, 2019, doi:10.1109/icra.2019.8793840.
short: M. Lechner, R. Hasani, M. Zimmer, T.A. Henzinger, R. Grosu, in:, Proceedings
- IEEE International Conference on Robotics and Automation, IEEE, 2019.
conference:
end_date: 2019-05-24
location: Montreal, QC, Canada
name: 'ICRA: International Conference on Robotics and Automation'
start_date: 2019-05-20
date_created: 2019-09-18T08:09:51Z
date_published: 2019-05-01T00:00:00Z
date_updated: 2025-09-10T10:42:55Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1109/icra.2019.8793840
external_id:
isi:
- '000494942300011'
file:
- access_level: open_access
checksum: f5545a6b60c3ffd01feb3613f81d03b6
content_type: application/pdf
creator: dernst
date_created: 2020-10-08T17:30:38Z
date_updated: 2020-10-08T17:30:38Z
file_id: '8636'
file_name: 2019_ICRA_Lechner.pdf
file_size: 3265107
relation: main_file
success: 1
file_date_updated: 2020-10-08T17:30:38Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Proceedings - IEEE International Conference on Robotics and Automation
publication_identifier:
isbn:
- '9781538660270'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Designing worm-inspired neural networks for interpretable robotic control
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2019-May
year: '2019'
...
---
_id: '6889'
abstract:
- lang: eng
text: 'We study Markov decision processes and turn-based stochastic games with parity
conditions. There are three qualitative winning criteria, namely, sure winning,
which requires all paths to satisfy the condition, almost-sure winning, which
requires the condition to be satisfied with probability 1, and limit-sure winning,
which requires the condition to be satisfied with probability arbitrarily close
to 1. We study the combination of two of these criteria for parity conditions,
e.g., there are two parity conditions one of which must be won surely, and the
other almost-surely. The problem has been studied recently by Berthon et al. for
MDPs with combination of sure and almost-sure winning, under infinite-memory strategies,
and the problem has been established to be in NP cap co-NP. Even in MDPs there
is a difference between finite-memory and infinite-memory strategies. Our main
results for combination of sure and almost-sure winning are as follows: (a) we
show that for MDPs with finite-memory strategies the problem is in NP cap co-NP;
(b) we show that for turn-based stochastic games the problem is co-NP-complete,
both for finite-memory and infinite-memory strategies; and (c) we present algorithmic
results for the finite-memory case, both for MDPs and turn-based stochastic games,
by reduction to non-stochastic parity games. In addition we show that all the
above complexity results also carry over to combination of sure and limit-sure
winning, and results for all other combinations can be derived from existing results
in the literature. Thus we present a complete picture for the study of combinations
of two qualitative winning criteria for parity conditions in MDPs and turn-based
stochastic games. '
alternative_title:
- LIPIcs
article_number: '6'
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: Nir
full_name: Piterman, Nir
last_name: Piterman
citation:
ama: 'Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic
Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2019. doi:10.4230/LIPICS.CONCUR.2019.6'
apa: 'Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning
for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: Conference on
Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6'
chicago: Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative
Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6.
ieee: 'K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic
Parity Games,” presented at the CONCUR: Conference on Concurrency Theory, Amsterdam,
Netherlands, 2019, vol. 140.'
ista: 'Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic
Parity Games. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 140, 6.'
mla: Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning
for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6.
short: K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019.
conference:
end_date: 2019-08-30
location: Amsterdam, Netherlands
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2019-08-27
date_created: 2019-09-18T08:11:43Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2025-07-10T11:53:59Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPICS.CONCUR.2019.6
file:
- access_level: open_access
checksum: 7b2ecfd4d9d02360308c0ca986fc10a7
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T08:49:45Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6923'
file_name: 2019_LIPIcs_Chatterjee.pdf
file_size: 509163
relation: main_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
intvolume: ' 140'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Combinations of Qualitative Winning for Stochastic Parity Games
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: 140
year: '2019'
...
---
_id: '6890'
abstract:
- lang: eng
text: Describing the protein interactions that form pleomorphic and asymmetric viruses
represents a considerable challenge to most structural biology techniques, including
X-ray crystallography and single particle cryo-electron microscopy. Obtaining
a detailed understanding of these interactions is nevertheless important, considering
the number of relevant human pathogens that do not follow strict icosahedral or
helical symmetry. Cryo-electron tomography and subtomogram averaging methods provide
structural insights into complex biological environments and are well suited to
go beyond structures of perfectly symmetric viruses. This chapter discusses recent
developments showing that cryo-ET and subtomogram averaging can provide high-resolution
insights into hitherto unknown structural features of pleomorphic and asymmetric
virus particles. It also describes how these methods have significantly added
to our understanding of retrovirus capsid assemblies in immature and mature viruses.
Additional examples of irregular viruses and their associated proteins, whose
structures have been studied via cryo-ET and subtomogram averaging, further support
the versatility of these methods.
article_processing_charge: No
author:
- first_name: Martin
full_name: Obr, Martin
id: 4741CA5A-F248-11E8-B48F-1D18A9856A87
last_name: Obr
orcid: 0000-0003-1756-6564
- first_name: Florian KM
full_name: Schur, Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
citation:
ama: 'Obr M, Schur FK. Structural analysis of pleomorphic and asymmetric viruses
using cryo-electron tomography and subtomogram averaging. In: Rey FA, ed. Complementary
Strategies to Study Virus Structure and Function. Vol 105. Advances in Virus
Research. Elsevier; 2019:117-159. doi:10.1016/bs.aivir.2019.07.008'
apa: Obr, M., & Schur, F. K. (2019). Structural analysis of pleomorphic and
asymmetric viruses using cryo-electron tomography and subtomogram averaging. In
F. A. Rey (Ed.), Complementary Strategies to Study Virus Structure and Function
(Vol. 105, pp. 117–159). Elsevier. https://doi.org/10.1016/bs.aivir.2019.07.008
chicago: Obr, Martin, and Florian KM Schur. “Structural Analysis of Pleomorphic
and Asymmetric Viruses Using Cryo-Electron Tomography and Subtomogram Averaging.”
In Complementary Strategies to Study Virus Structure and Function, edited
by Félix A. Rey, 105:117–59. Advances in Virus Research. Elsevier, 2019. https://doi.org/10.1016/bs.aivir.2019.07.008.
ieee: M. Obr and F. K. Schur, “Structural analysis of pleomorphic and asymmetric
viruses using cryo-electron tomography and subtomogram averaging,” in Complementary
Strategies to Study Virus Structure and Function, vol. 105, F. A. Rey, Ed.
Elsevier, 2019, pp. 117–159.
ista: 'Obr M, Schur FK. 2019.Structural analysis of pleomorphic and asymmetric viruses
using cryo-electron tomography and subtomogram averaging. In: Complementary Strategies
to Study Virus Structure and Function. vol. 105, 117–159.'
mla: Obr, Martin, and Florian KM Schur. “Structural Analysis of Pleomorphic and
Asymmetric Viruses Using Cryo-Electron Tomography and Subtomogram Averaging.”
Complementary Strategies to Study Virus Structure and Function, edited
by Félix A. Rey, vol. 105, Elsevier, 2019, pp. 117–59, doi:10.1016/bs.aivir.2019.07.008.
short: M. Obr, F.K. Schur, in:, F.A. Rey (Ed.), Complementary Strategies to Study
Virus Structure and Function, Elsevier, 2019, pp. 117–159.
date_created: 2019-09-18T08:15:37Z
date_published: 2019-08-27T00:00:00Z
date_updated: 2023-08-30T06:56:00Z
day: '27'
department:
- _id: FlSc
doi: 10.1016/bs.aivir.2019.07.008
editor:
- first_name: Félix A.
full_name: Rey, Félix A.
last_name: Rey
external_id:
isi:
- '000501594500006'
pmid:
- ' 31522703'
intvolume: ' 105'
isi: 1
language:
- iso: eng
month: '08'
oa_version: None
page: 117-159
pmid: 1
publication: Complementary Strategies to Study Virus Structure and Function
publication_identifier:
isbn:
- '9780128184561'
issn:
- 0065-3527
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
series_title: Advances in Virus Research
status: public
title: Structural analysis of pleomorphic and asymmetric viruses using cryo-electron
tomography and subtomogram averaging
type: book_chapter
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 105
year: '2019'
...
---
_id: '6896'
abstract:
- lang: eng
text: "Until recently, a great amount of brain studies have been conducted in human
post mortem tissues, cell lines and model organisms. These researches provided
useful insights regarding cell-cell interactions occurring in the brain. However,
such approaches suffer from technical limitations and inaccurate modeling of the
tissue 3D cytoarchitecture. Importantly, they might lack a human genetic background
essential for disease modeling. With the development of protocols to generate
human cerebral organoids, we are now closer to reproducing the early stages of
human brain development in vitro. As a result, more relevant cell-cell interaction
studies can be conducted.\r\n\r\nIn this review, we discuss the advantages of
3D cultures over 2D in modulating brain cell-cell interactions during physiological
and pathological development, as well as the progress made in developing organoids
in which neurons, macroglia, microglia and vascularization are present. Finally,
we debate the limitations of those models and possible future directions."
article_number: '146458'
article_processing_charge: No
article_type: original
author:
- first_name: Bárbara
full_name: Oliveira, Bárbara
id: 3B03AA1A-F248-11E8-B48F-1D18A9856A87
last_name: Oliveira
- first_name: Aysan Çerağ
full_name: Yahya, Aysan Çerağ
id: 365A65F8-F248-11E8-B48F-1D18A9856A87
last_name: Yahya
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: Oliveira B, Yahya AÇ, Novarino G. Modeling cell-cell interactions in the brain
using cerebral organoids. Brain Research. 2019;1724. doi:10.1016/j.brainres.2019.146458
apa: Oliveira, B., Yahya, A. Ç., & Novarino, G. (2019). Modeling cell-cell interactions
in the brain using cerebral organoids. Brain Research. Elsevier. https://doi.org/10.1016/j.brainres.2019.146458
chicago: Oliveira, Bárbara, Aysan Çerağ Yahya, and Gaia Novarino. “Modeling Cell-Cell
Interactions in the Brain Using Cerebral Organoids.” Brain Research. Elsevier,
2019. https://doi.org/10.1016/j.brainres.2019.146458.
ieee: B. Oliveira, A. Ç. Yahya, and G. Novarino, “Modeling cell-cell interactions
in the brain using cerebral organoids,” Brain Research, vol. 1724. Elsevier,
2019.
ista: Oliveira B, Yahya AÇ, Novarino G. 2019. Modeling cell-cell interactions in
the brain using cerebral organoids. Brain Research. 1724, 146458.
mla: Oliveira, Bárbara, et al. “Modeling Cell-Cell Interactions in the Brain Using
Cerebral Organoids.” Brain Research, vol. 1724, 146458, Elsevier, 2019,
doi:10.1016/j.brainres.2019.146458.
short: B. Oliveira, A.Ç. Yahya, G. Novarino, Brain Research 1724 (2019).
date_created: 2019-09-22T22:00:35Z
date_published: 2019-12-01T00:00:00Z
date_updated: 2025-07-10T11:54:01Z
day: '01'
department:
- _id: GaNo
doi: 10.1016/j.brainres.2019.146458
external_id:
isi:
- '000491646600033'
pmid:
- '31521639'
intvolume: ' 1724'
isi: 1
language:
- iso: eng
month: '12'
oa_version: None
pmid: 1
publication: Brain Research
publication_identifier:
eissn:
- 1872-6240
issn:
- 0006-8993
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Modeling cell-cell interactions in the brain using cerebral organoids
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1724
year: '2019'
...
---
_id: '6920'
article_processing_charge: No
article_type: original
author:
- first_name: Christina
full_name: Artner, Christina
id: 45DF286A-F248-11E8-B48F-1D18A9856A87
last_name: Artner
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Artner C, Benková E. Ethylene and cytokinin - partners in root growth regulation.
Molecular Plant. 2019;12(10):1312-1314. doi:10.1016/j.molp.2019.09.003
apa: Artner, C., & Benková, E. (2019). Ethylene and cytokinin - partners in
root growth regulation. Molecular Plant. Cell Press. https://doi.org/10.1016/j.molp.2019.09.003
chicago: Artner, Christina, and Eva Benková. “Ethylene and Cytokinin - Partners
in Root Growth Regulation.” Molecular Plant. Cell Press, 2019. https://doi.org/10.1016/j.molp.2019.09.003.
ieee: C. Artner and E. Benková, “Ethylene and cytokinin - partners in root growth
regulation,” Molecular Plant, vol. 12, no. 10. Cell Press, pp. 1312–1314,
2019.
ista: Artner C, Benková E. 2019. Ethylene and cytokinin - partners in root growth
regulation. Molecular Plant. 12(10), 1312–1314.
mla: Artner, Christina, and Eva Benková. “Ethylene and Cytokinin - Partners in Root
Growth Regulation.” Molecular Plant, vol. 12, no. 10, Cell Press, 2019,
pp. 1312–14, doi:10.1016/j.molp.2019.09.003.
short: C. Artner, E. Benková, Molecular Plant 12 (2019) 1312–1314.
date_created: 2019-09-30T10:00:40Z
date_published: 2019-10-07T00:00:00Z
date_updated: 2025-07-10T11:54:01Z
day: '07'
department:
- _id: EvBe
doi: 10.1016/j.molp.2019.09.003
external_id:
isi:
- '000489132500002'
pmid:
- '31541740'
intvolume: ' 12'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
page: 1312-1314
pmid: 1
project:
- _id: 2685A872-B435-11E9-9278-68D0E5697425
name: Hormonal regulation of plant adaptive responses to environmental signals
publication: Molecular Plant
publication_identifier:
eissn:
- 1674-2052
publication_status: published
publisher: Cell Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ethylene and cytokinin - partners in root growth regulation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2019'
...
---
_id: '6931'
abstract:
- lang: eng
text: "Consider a distributed system with n processors out of which f can be Byzantine
faulty. In the\r\napproximate agreement task, each processor i receives an input
value xi and has to decide on an\r\noutput value yi such that\r\n1. the output
values are in the convex hull of the non-faulty processors’ input values,\r\n2.
the output values are within distance d of each other.\r\n\r\n\r\nClassically,
the values are assumed to be from an m-dimensional Euclidean space, where m ≥
1.\r\nIn this work, we study the task in a discrete setting, where input values
with some structure\r\nexpressible as a graph. Namely, the input values are vertices
of a finite graph G and the goal is to\r\noutput vertices that are within distance
d of each other in G, but still remain in the graph-induced\r\nconvex hull of
the input values. For d = 0, the task reduces to consensus and cannot be solved
with\r\na deterministic algorithm in an asynchronous system even with a single
crash fault. For any d ≥ 1,\r\nwe show that the task is solvable in asynchronous
systems when G is chordal and n > (ω + 1)f,\r\nwhere ω is the clique number of
G. In addition, we give the first Byzantine-tolerant algorithm for a\r\nvariant
of lattice agreement. For synchronous systems, we show tight resilience bounds
for the exact\r\nvariants of these and related tasks over a large class of combinatorial
structures."
alternative_title:
- LIPIcs
article_processing_charge: No
arxiv: 1
author:
- first_name: Thomas
full_name: Nowak, Thomas
last_name: Nowak
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
citation:
ama: 'Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: 33rd
International Symposium on Distributed Computing. Vol 146. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:10.4230/LIPICS.DISC.2019.29'
apa: 'Nowak, T., & Rybicki, J. (2019). Byzantine approximate agreement on graphs.
In 33rd International Symposium on Distributed Computing (Vol. 146, p.
29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.DISC.2019.29'
chicago: Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.”
In 33rd International Symposium on Distributed Computing, 146:29:1--29:17.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.DISC.2019.29.
ieee: T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd
International Symposium on Distributed Computing, Budapest, Hungary, 2019,
vol. 146, p. 29:1--29:17.
ista: 'Nowak T, Rybicki J. 2019. Byzantine approximate agreement on graphs. 33rd
International Symposium on Distributed Computing. DISC: Symposium on Distributed
Computing, LIPIcs, vol. 146, 29:1--29:17.'
mla: Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.”
33rd International Symposium on Distributed Computing, vol. 146, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.
short: T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17.
conference:
end_date: 2019-10-18
location: Budapest, Hungary
name: 'DISC: Symposium on Distributed Computing'
start_date: 2019-10-14
date_created: 2019-10-08T12:41:38Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2025-07-10T11:54:03Z
day: '01'
ddc:
- '004'
department:
- _id: DaAl
doi: 10.4230/LIPICS.DISC.2019.29
ec_funded: 1
external_id:
arxiv:
- '1908.02743'
file:
- access_level: open_access
checksum: 2d2202f90c6ac991e50876451627c4b5
content_type: application/pdf
creator: jrybicki
date_created: 2019-10-08T12:47:19Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6934'
file_name: LIPIcs-DISC-2019-29.pdf
file_size: 639378
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 146'
keyword:
- consensus
- approximate agreement
- Byzantine faults
- chordal graphs
- lattice agreement
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 29:1--29:17
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 33rd International Symposium on Distributed Computing
publication_identifier:
eisbn:
- 978-3-95977-126-9
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Byzantine approximate agreement on graphs
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: 146
year: '2019'
...
---
_id: '6933'
abstract:
- lang: eng
text: "We design fast deterministic algorithms for distance computation in the CONGESTED
CLIQUE model. Our key contributions include:\r\n\r\n - A (2+ε)-approximation for
all-pairs shortest paths problem in O(log²n / ε) rounds on unweighted undirected
graphs. With a small additional additive factor, this also applies for weighted
graphs. This is the first sub-polynomial constant-factor approximation for APSP
in this model.\r\n - A (1+ε)-approximation for multi-source shortest paths problem
from O(√n) sources in O(log² n / ε) rounds on weighted undirected graphs. This
is the first sub-polynomial algorithm obtaining this approximation for a set of
sources of polynomial size.\r\n\r\nOur main techniques are new distance tools
that are obtained via improved algorithms for sparse matrix multiplication, which
we leverage to construct efficient hopsets and shortest paths. Furthermore, our
techniques extend to additional distance problems for which we improve upon the
state-of-the-art, including diameter approximation, and an exact single-source
shortest paths algorithm for weighted undirected graphs in Õ(n^{1/6}) rounds."
article_processing_charge: No
arxiv: 1
author:
- first_name: Keren
full_name: Censor-Hillel, Keren
last_name: Censor-Hillel
- first_name: Michal
full_name: Dory, Michal
last_name: Dory
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Dean
full_name: Leitersdorf, Dean
last_name: Leitersdorf
citation:
ama: 'Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest
paths in the congested clique. In: Proceedings of the 2019 ACM Symposium on
Principles of Distributed Computin. ACM; 2019:74-83. doi:10.1145/3293611.3331633'
apa: 'Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2019). Fast
approximate shortest paths in the congested clique. In Proceedings of the 2019
ACM Symposium on Principles of Distributed Computin (pp. 74–83). Toronto,
ON, Canada: ACM. https://doi.org/10.1145/3293611.3331633'
chicago: Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf.
“Fast Approximate Shortest Paths in the Congested Clique.” In Proceedings of
the 2019 ACM Symposium on Principles of Distributed Computin, 74–83. ACM,
2019. https://doi.org/10.1145/3293611.3331633.
ieee: K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate
shortest paths in the congested clique,” in Proceedings of the 2019 ACM Symposium
on Principles of Distributed Computin, Toronto, ON, Canada, 2019, pp. 74–83.
ista: 'Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2019. Fast approximate
shortest paths in the congested clique. Proceedings of the 2019 ACM Symposium
on Principles of Distributed Computin. PODC: Symposium on Principles of Distributed
Computing, 74–83.'
mla: Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested
Clique.” Proceedings of the 2019 ACM Symposium on Principles of Distributed
Computin, ACM, 2019, pp. 74–83, doi:10.1145/3293611.3331633.
short: K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings
of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp.
74–83.
conference:
end_date: 2019-08-02
location: Toronto, ON, Canada
name: 'PODC: Symposium on Principles of Distributed Computing'
start_date: 2019-07-29
date_created: 2019-10-08T12:48:42Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2025-04-15T06:53:15Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3293611.3331633
external_id:
arxiv:
- '1903.05956'
isi:
- '000570442000011'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.05956
month: '08'
oa: 1
oa_version: Preprint
page: 74-83
publication: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin
publication_identifier:
isbn:
- '9781450362177'
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '7939'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Fast approximate shortest paths in the congested clique
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '6935'
abstract:
- lang: eng
text: "This paper investigates the power of preprocessing in the CONGEST model.
Schmid and Suomela (ACM HotSDN 2013) introduced the SUPPORTED CONGEST model to
study the application of distributed algorithms in Software-Defined Networks (SDNs).
In this paper, we show that a large class of lower bounds in the CONGEST model
still hold in the SUPPORTED model, highlighting the robustness of these bounds.
This also raises the question how much does\r\npreprocessing help in the CONGEST
model."
article_processing_charge: No
arxiv: 1
author:
- first_name: Klaus-Tycho
full_name: Foerster, Klaus-Tycho
last_name: Foerster
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Foerster K-T, Korhonen J, Rybicki J, Schmid S. Does preprocessing help under
congestion? In: Proceedings of the 2019 ACM Symposium on Principles of Distributed
Computing. ACM; 2019:259-261. doi:10.1145/3293611.3331581'
apa: 'Foerster, K.-T., Korhonen, J., Rybicki, J., & Schmid, S. (2019). Does
preprocessing help under congestion? In Proceedings of the 2019 ACM Symposium
on Principles of Distributed Computing (pp. 259–261). Toronto, ON, Canada:
ACM. https://doi.org/10.1145/3293611.3331581'
chicago: Foerster, Klaus-Tycho, Janne Korhonen, Joel Rybicki, and Stefan Schmid.
“Does Preprocessing Help under Congestion?” In Proceedings of the 2019 ACM
Symposium on Principles of Distributed Computing, 259–61. ACM, 2019. https://doi.org/10.1145/3293611.3331581.
ieee: K.-T. Foerster, J. Korhonen, J. Rybicki, and S. Schmid, “Does preprocessing
help under congestion?,” in Proceedings of the 2019 ACM Symposium on Principles
of Distributed Computing, Toronto, ON, Canada, 2019, pp. 259–261.
ista: 'Foerster K-T, Korhonen J, Rybicki J, Schmid S. 2019. Does preprocessing help
under congestion? Proceedings of the 2019 ACM Symposium on Principles of Distributed
Computing. PODC: Symposium on Principles of Distributed Computing, 259–261.'
mla: Foerster, Klaus-Tycho, et al. “Does Preprocessing Help under Congestion?” Proceedings
of the 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019,
pp. 259–61, doi:10.1145/3293611.3331581.
short: K.-T. Foerster, J. Korhonen, J. Rybicki, S. Schmid, in:, Proceedings of the
2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–261.
conference:
end_date: 2019-08-02
location: Toronto, ON, Canada
name: 'PODC: Symposium on Principles of Distributed Computing'
start_date: 2019-07-29
date_created: 2019-10-08T12:57:14Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2025-04-14T07:44:06Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3293611.3331581
ec_funded: 1
external_id:
arxiv:
- '1905.03012'
isi:
- '000570442000037'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1905.03012
month: '08'
oa: 1
oa_version: Preprint
page: 259-261
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
publication_identifier:
isbn:
- '9781450362177'
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: Does preprocessing help under congestion?
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6936'
abstract:
- lang: eng
text: "A key challenge for community ecology is to understand to what extent observational
data can be used to infer the underlying community assembly processes. As different
processes can lead to similar or even identical patterns, statistical analyses
of non‐manipulative observational data never yield undisputable causal inference
on the underlying processes. Still, most empirical studies in community ecology
are based on observational data, and hence understanding under which circumstances
such data can shed light on assembly processes is a central concern for community
ecologists. We simulated a spatial agent‐based model that generates variation
in metacommunity dynamics across multiple axes, including the four classic metacommunity
paradigms as special cases. We further simulated a virtual ecologist who analysed
snapshot data sampled from the simulations using eighteen output metrics derived
from beta‐diversity and habitat variation indices, variation partitioning and
joint species distribution modelling. Our results indicated two main axes of variation
in the output metrics. The first axis of variation described whether the landscape
has patchy or continuous variation, and thus was essentially independent of the
properties of the species community. The second axis of variation related to the
level of predictability of the metacommunity. The most predictable communities
were niche‐based metacommunities inhabiting static landscapes with marked environmental
heterogeneity, such as metacommunities following the species sorting paradigm
or the mass effects paradigm. The most unpredictable communities were neutral‐based
metacommunities inhabiting dynamics landscapes with little spatial heterogeneity,
such as metacommunities following the neutral or patch sorting paradigms. The
output metrics from joint species distribution modelling yielded generally the
highest resolution to disentangle among the simulated scenarios. Yet, the different
types of statistical approaches utilized in this study carried complementary information,
and thus our results suggest that the most comprehensive evaluation of metacommunity
structure can be obtained by combining them.\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Otso
full_name: Ovaskainen, Otso
last_name: Ovaskainen
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Nerea
full_name: Abrego, Nerea
last_name: Abrego
citation:
ama: Ovaskainen O, Rybicki J, Abrego N. What can observational data reveal about
metacommunity processes? Ecography. 2019;42(11):1877-1886. doi:10.1111/ecog.04444
apa: Ovaskainen, O., Rybicki, J., & Abrego, N. (2019). What can observational
data reveal about metacommunity processes? Ecography. Wiley. https://doi.org/10.1111/ecog.04444
chicago: Ovaskainen, Otso, Joel Rybicki, and Nerea Abrego. “What Can Observational
Data Reveal about Metacommunity Processes?” Ecography. Wiley, 2019. https://doi.org/10.1111/ecog.04444.
ieee: O. Ovaskainen, J. Rybicki, and N. Abrego, “What can observational data reveal
about metacommunity processes?,” Ecography, vol. 42, no. 11. Wiley, pp.
1877–1886, 2019.
ista: Ovaskainen O, Rybicki J, Abrego N. 2019. What can observational data reveal
about metacommunity processes? Ecography. 42(11), 1877–1886.
mla: Ovaskainen, Otso, et al. “What Can Observational Data Reveal about Metacommunity
Processes?” Ecography, vol. 42, no. 11, Wiley, 2019, pp. 1877–86, doi:10.1111/ecog.04444.
short: O. Ovaskainen, J. Rybicki, N. Abrego, Ecography 42 (2019) 1877–1886.
date_created: 2019-10-08T13:01:24Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2025-04-14T07:44:06Z
day: '01'
ddc:
- '577'
department:
- _id: DaAl
doi: 10.1111/ecog.04444
ec_funded: 1
external_id:
isi:
- '000486348700001'
file:
- access_level: open_access
checksum: 6c9fbbd5ea8ce10ae93e55ad560a7bf9
content_type: application/pdf
creator: jrybicki
date_created: 2019-10-08T13:07:44Z
date_updated: 2020-07-14T12:47:45Z
file_id: '6937'
file_name: ecog.04444.pdf
file_size: 1682718
relation: main_file
file_date_updated: 2020-07-14T12:47:45Z
has_accepted_license: '1'
intvolume: ' 42'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1877-1886
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Ecography
publication_identifier:
eissn:
- 1600-0587
issn:
- 0906-7590
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: What can observational data reveal about metacommunity processes?
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 42
year: '2019'
...
---
_id: '6940'
abstract:
- lang: eng
text: "We study the effect of a linear tunneling coupling between two-dimensional
systems, each separately\r\nexhibiting the topological Berezinskii-Kosterlitz-Thouless
(BKT) transition. In the uncoupled limit, there\r\nare two phases: one where the
one-body correlation functions are algebraically decaying and the other with\r\nexponential
decay. When the linear coupling is turned on, a third BKT-paired phase emerges,
in which one-body correlations are exponentially decaying, while two-body correlation
functions exhibit power-law\r\ndecay. We perform numerical simulations in the
paradigmatic case of two coupled XY models at finite\r\ntemperature, finding evidences
that for any finite value of the interlayer coupling, the BKT-paired phase is\r\npresent.
We provide a picture of the phase diagram using a renormalization group approach."
acknowledgement: "We thank S. Chiacchiera, G. Delfino, N. Dupuis, T. Enss, M. Fabrizio
and G. Gori for many stimulating discussions.\r\nG.B. acknowledges support from
the Austrian Science Fund (FWF), under project No. M2461-N27. N.D. acknowledges\r\nsupport
from Deutsche Forschungsgemeinschaft (DFG) under Germany’s Excellence Strategy EXC-2181/1
- 390900948 (the Heidelberg STRUCTURES Excellence Cluster) and from the DFG Collaborative
Research Centre “SFB 1225 ISOQUANT”. Support from the CNR/MTA Italy-Hungary 2019-2021
Joint Project “Strongly interacting systems in confined geometries” is gratefully
acknowledged."
article_number: '100601'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
- first_name: Nicolò
full_name: Defenu, Nicolò
last_name: Defenu
- first_name: István
full_name: Nándori, István
last_name: Nándori
- first_name: Luca
full_name: Salasnich, Luca
last_name: Salasnich
- first_name: Andrea
full_name: Trombettoni, Andrea
last_name: Trombettoni
citation:
ama: Bighin G, Defenu N, Nándori I, Salasnich L, Trombettoni A. Berezinskii-Kosterlitz-Thouless
paired phase in coupled XY models. Physical Review Letters. 2019;123(10).
doi:10.1103/physrevlett.123.100601
apa: Bighin, G., Defenu, N., Nándori, I., Salasnich, L., & Trombettoni, A. (2019).
Berezinskii-Kosterlitz-Thouless paired phase in coupled XY models. Physical
Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.123.100601
chicago: Bighin, Giacomo, Nicolò Defenu, István Nándori, Luca Salasnich, and Andrea
Trombettoni. “Berezinskii-Kosterlitz-Thouless Paired Phase in Coupled XY Models.”
Physical Review Letters. American Physical Society, 2019. https://doi.org/10.1103/physrevlett.123.100601.
ieee: G. Bighin, N. Defenu, I. Nándori, L. Salasnich, and A. Trombettoni, “Berezinskii-Kosterlitz-Thouless
paired phase in coupled XY models,” Physical Review Letters, vol. 123,
no. 10. American Physical Society, 2019.
ista: Bighin G, Defenu N, Nándori I, Salasnich L, Trombettoni A. 2019. Berezinskii-Kosterlitz-Thouless
paired phase in coupled XY models. Physical Review Letters. 123(10), 100601.
mla: Bighin, Giacomo, et al. “Berezinskii-Kosterlitz-Thouless Paired Phase in Coupled
XY Models.” Physical Review Letters, vol. 123, no. 10, 100601, American
Physical Society, 2019, doi:10.1103/physrevlett.123.100601.
short: G. Bighin, N. Defenu, I. Nándori, L. Salasnich, A. Trombettoni, Physical
Review Letters 123 (2019).
date_created: 2019-10-14T06:31:13Z
date_published: 2019-09-06T00:00:00Z
date_updated: 2025-04-14T08:57:11Z
day: '06'
department:
- _id: MiLe
doi: 10.1103/physrevlett.123.100601
external_id:
arxiv:
- '1907.06253'
isi:
- '000483587200004'
intvolume: ' 123'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1907.06253
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 26986C82-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02641
name: A path-integral approach to composite impurities
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
link:
- description: News auf IST Website
relation: press_release
url: https://ist.ac.at/en/news/new-form-of-magnetism-found/
scopus_import: '1'
status: public
title: Berezinskii-Kosterlitz-Thouless paired phase in coupled XY models
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 123
year: '2019'
...