---
_id: '6867'
abstract:
- lang: eng
text: A novel magnetic scratch method achieves repeatability, reproducibility and
geometric control greater than pipette scratch assays and closely approximating
the precision of cell exclusion assays while inducing the cell injury inherently
necessary for wound healing assays. The magnetic scratch is affordable, easily
implemented and standardisable and thus may contribute toward better comparability
of data generated in different studies and laboratories.
article_number: '12625'
article_processing_charge: No
author:
- first_name: M.
full_name: Fenu, M.
last_name: Fenu
- first_name: T.
full_name: Bettermann, T.
last_name: Bettermann
- first_name: C.
full_name: Vogl, C.
last_name: Vogl
- first_name: Nasser
full_name: Darwish-Miranda, Nasser
id: 39CD9926-F248-11E8-B48F-1D18A9856A87
last_name: Darwish-Miranda
orcid: 0000-0002-8821-8236
- first_name: J.
full_name: Schramel, J.
last_name: Schramel
- first_name: F.
full_name: Jenner, F.
last_name: Jenner
- first_name: I.
full_name: Ribitsch, I.
last_name: Ribitsch
citation:
ama: Fenu M, Bettermann T, Vogl C, et al. A novel magnet-based scratch method for
standardisation of wound-healing assays. Scientific Reports. 2019;9(1).
doi:10.1038/s41598-019-48930-7
apa: Fenu, M., Bettermann, T., Vogl, C., Darwish-Miranda, N., Schramel, J., Jenner,
F., & Ribitsch, I. (2019). A novel magnet-based scratch method for standardisation
of wound-healing assays. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-019-48930-7
chicago: Fenu, M., T. Bettermann, C. Vogl, Nasser Darwish-Miranda, J. Schramel,
F. Jenner, and I. Ribitsch. “A Novel Magnet-Based Scratch Method for Standardisation
of Wound-Healing Assays.” Scientific Reports. Springer Nature, 2019. https://doi.org/10.1038/s41598-019-48930-7.
ieee: M. Fenu et al., “A novel magnet-based scratch method for standardisation
of wound-healing assays,” Scientific Reports, vol. 9, no. 1. Springer Nature,
2019.
ista: Fenu M, Bettermann T, Vogl C, Darwish-Miranda N, Schramel J, Jenner F, Ribitsch
I. 2019. A novel magnet-based scratch method for standardisation of wound-healing
assays. Scientific Reports. 9(1), 12625.
mla: Fenu, M., et al. “A Novel Magnet-Based Scratch Method for Standardisation of
Wound-Healing Assays.” Scientific Reports, vol. 9, no. 1, 12625, Springer
Nature, 2019, doi:10.1038/s41598-019-48930-7.
short: M. Fenu, T. Bettermann, C. Vogl, N. Darwish-Miranda, J. Schramel, F. Jenner,
I. Ribitsch, Scientific Reports 9 (2019).
date_created: 2019-09-15T22:00:42Z
date_published: 2019-09-02T00:00:00Z
date_updated: 2023-08-29T07:55:15Z
day: '02'
ddc:
- '570'
department:
- _id: Bio
doi: 10.1038/s41598-019-48930-7
external_id:
isi:
- '000483697800007'
pmid:
- '31477739'
file:
- access_level: open_access
checksum: 9cfd986d4108e288cc72276ef047ab0c
content_type: application/pdf
creator: dernst
date_created: 2019-09-16T12:42:40Z
date_updated: 2020-07-14T12:47:42Z
file_id: '6879'
file_name: 2019_ScientificReports_Fenu.pdf
file_size: 3523795
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: Scientific Reports
publication_identifier:
eissn:
- '20452322'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A novel magnet-based scratch method for standardisation of wound-healing assays
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: 9
year: '2019'
...
---
_id: '6868'
abstract:
- lang: eng
text: "Hyperpolarization-activated cyclic-nucleotide-gated (HCN) channels control
electrical rhythmicity and excitability in the heart and brain, but the function
of HCN channels at the subcellular level in axons remains poorly understood. Here,
we show that the action potential conduction velocity in both myelinated and unmyelinated
central axons can be bidirectionally modulated by a HCN channel blocker, cyclic
adenosine monophosphate (cAMP), and neuromodulators. Recordings from mouse cerebellar
mossy fiber boutons show that HCN channels ensure reliable high-frequency firing
and are strongly modulated by cAMP (EC50 40 mM; estimated endogenous cAMP concentration
13 mM). In addition, immunogold-electron microscopy revealed HCN2 as the dominating
subunit in cerebellar mossy fibers. Computational modeling indicated that HCN2
channels control conduction velocity primarily by altering the resting membrane
potential\r\nand are associated with significant metabolic costs. These results
suggest that the cAMP-HCN pathway provides neuromodulators with an opportunity
to finely tune energy consumption and temporal delays across axons in the brain."
article_number: e42766
article_processing_charge: No
article_type: original
author:
- first_name: Niklas
full_name: Byczkowicz, Niklas
last_name: Byczkowicz
- first_name: Abdelmoneim
full_name: Eshra, Abdelmoneim
last_name: Eshra
- first_name: Jacqueline-Claire
full_name: Montanaro-Punzengruber, Jacqueline-Claire
id: 3786AB44-F248-11E8-B48F-1D18A9856A87
last_name: Montanaro-Punzengruber
- first_name: Andrea
full_name: Trevisiol, Andrea
last_name: Trevisiol
- first_name: Johannes
full_name: Hirrlinger, Johannes
last_name: Hirrlinger
- first_name: Maarten Hp
full_name: Kole, Maarten Hp
last_name: Kole
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Stefan
full_name: Hallermann, Stefan
last_name: Hallermann
citation:
ama: Byczkowicz N, Eshra A, Montanaro-Punzengruber J-C, et al. HCN channel-mediated
neuromodulation can control action potential velocity and fidelity in central
axons. eLife. 2019;8. doi:10.7554/eLife.42766
apa: Byczkowicz, N., Eshra, A., Montanaro-Punzengruber, J.-C., Trevisiol, A., Hirrlinger,
J., Kole, M. H., … Hallermann, S. (2019). HCN channel-mediated neuromodulation
can control action potential velocity and fidelity in central axons. ELife.
eLife Sciences Publications. https://doi.org/10.7554/eLife.42766
chicago: Byczkowicz, Niklas, Abdelmoneim Eshra, Jacqueline-Claire Montanaro-Punzengruber,
Andrea Trevisiol, Johannes Hirrlinger, Maarten Hp Kole, Ryuichi Shigemoto, and
Stefan Hallermann. “HCN Channel-Mediated Neuromodulation Can Control Action Potential
Velocity and Fidelity in Central Axons.” ELife. eLife Sciences Publications,
2019. https://doi.org/10.7554/eLife.42766.
ieee: N. Byczkowicz et al., “HCN channel-mediated neuromodulation can control
action potential velocity and fidelity in central axons,” eLife, vol. 8.
eLife Sciences Publications, 2019.
ista: Byczkowicz N, Eshra A, Montanaro-Punzengruber J-C, Trevisiol A, Hirrlinger
J, Kole MH, Shigemoto R, Hallermann S. 2019. HCN channel-mediated neuromodulation
can control action potential velocity and fidelity in central axons. eLife. 8,
e42766.
mla: Byczkowicz, Niklas, et al. “HCN Channel-Mediated Neuromodulation Can Control
Action Potential Velocity and Fidelity in Central Axons.” ELife, vol. 8,
e42766, eLife Sciences Publications, 2019, doi:10.7554/eLife.42766.
short: N. Byczkowicz, A. Eshra, J.-C. Montanaro-Punzengruber, A. Trevisiol, J. Hirrlinger,
M.H. Kole, R. Shigemoto, S. Hallermann, ELife 8 (2019).
date_created: 2019-09-15T22:00:43Z
date_published: 2019-09-09T00:00:00Z
date_updated: 2023-08-30T06:17:06Z
day: '09'
ddc:
- '570'
department:
- _id: RySh
doi: 10.7554/eLife.42766
external_id:
isi:
- '000485663900001'
file:
- access_level: open_access
checksum: c350b7861ef0fb537cae8a3232aec016
content_type: application/pdf
creator: dernst
date_created: 2019-09-16T13:14:33Z
date_updated: 2020-07-14T12:47:42Z
file_id: '6880'
file_name: 2019_eLife_Byczkowicz.pdf
file_size: 4008137
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: eLife
publication_identifier:
eissn:
- 2050084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: HCN channel-mediated neuromodulation can control action potential velocity
and fidelity in central axons
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: 8
year: '2019'
...
---
_id: '6877'
article_processing_charge: No
article_type: original
author:
- first_name: Aglaja
full_name: Kopf, Aglaja
id: 31DAC7B6-F248-11E8-B48F-1D18A9856A87
last_name: Kopf
orcid: 0000-0002-2187-6656
- 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: Kopf A, Sixt MK. The neural crest pitches in to remove apoptotic debris. Cell.
2019;179(1):51-53. doi:10.1016/j.cell.2019.08.047
apa: Kopf, A., & Sixt, M. K. (2019). The neural crest pitches in to remove apoptotic
debris. Cell. Elsevier. https://doi.org/10.1016/j.cell.2019.08.047
chicago: Kopf, Aglaja, and Michael K Sixt. “The Neural Crest Pitches in to Remove
Apoptotic Debris.” Cell. Elsevier, 2019. https://doi.org/10.1016/j.cell.2019.08.047.
ieee: A. Kopf and M. K. Sixt, “The neural crest pitches in to remove apoptotic debris,”
Cell, vol. 179, no. 1. Elsevier, pp. 51–53, 2019.
ista: Kopf A, Sixt MK. 2019. The neural crest pitches in to remove apoptotic debris.
Cell. 179(1), 51–53.
mla: Kopf, Aglaja, and Michael K. Sixt. “The Neural Crest Pitches in to Remove Apoptotic
Debris.” Cell, vol. 179, no. 1, Elsevier, 2019, pp. 51–53, doi:10.1016/j.cell.2019.08.047.
short: A. Kopf, M.K. Sixt, Cell 179 (2019) 51–53.
date_created: 2019-09-15T22:00:46Z
date_published: 2019-09-19T00:00:00Z
date_updated: 2024-03-25T23:30:22Z
day: '19'
department:
- _id: MiSi
doi: 10.1016/j.cell.2019.08.047
external_id:
isi:
- '000486618500011'
pmid:
- '31539498'
intvolume: ' 179'
isi: 1
issue: '1'
language:
- iso: eng
month: '09'
oa_version: None
page: 51-53
pmid: 1
publication: Cell
publication_identifier:
eissn:
- 1097-4172
issn:
- 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '6891'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The neural crest pitches in to remove apoptotic debris
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 179
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'
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
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: nternational Symposium on 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: nternational Symposium on Mathematical Foundations of Computer
Science, Aachen, Germany, 2019, vol. 138.'
ista: 'Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games.
MFCS: nternational Symposium on 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: nternational Symposium on Mathematical Foundations of Computer Science'
start_date: 2019-08-26
date_created: 2019-09-18T08:04:26Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2023-08-07T14:08:34Z
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: The Wittgenstein Prize
- _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: 3E5EF7F0-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'
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:
International 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: International 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: International 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: International Conference on Concurrency Theory'
start_date: 2019-08-27
date_created: 2019-09-18T08:06:14Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2021-01-12T08:09:27Z
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: 3E5EF7F0-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: International 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: International 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: International 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: International Conference on Concurrency Theory'
start_date: 2019-08-27
date_created: 2019-09-18T08:06:58Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2022-01-26T08:27:10Z
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
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 MH, 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. H., & 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 H 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. H. 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 MH, Svozil A. 2019. Near-linear time algorithms
for Streett objectives in graphs and MDPs. Leibniz International Proceedings in
Informatics. CONCUR: International 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.H. 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: International Conference on Concurrency Theory'
start_date: 2019-08-27
date_created: 2019-09-18T08:07:58Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2022-08-12T10:54:34Z
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: 6785fbc1-c503-11eb-8a32-93094b40e1cf
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: 2021-01-12T08:09:28Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1109/icra.2019.8793840
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'
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: The Wittgenstein Prize
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: D865714E-FA4E-11E9-B85B-F5C5E5697425
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'
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: International
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: International Conference on Concurrency
Theory, Amsterdam, Netherlands, 2019, vol. 140.'
ista: 'Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic
Parity Games. CONCUR: International 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: International 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: 2021-01-12T08:09:28Z
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: 3E5EF7F0-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: '6891'
abstract:
- lang: eng
text: "While cells of mesenchymal or epithelial origin perform their effector functions
in a purely anchorage dependent manner, cells derived from the hematopoietic lineage
are not committed to operate only within a specific niche. Instead, these cells
are able to function autonomously of the molecular composition in a broad range
of tissue compartments. By this means, cells of the hematopoietic lineage retain
the capacity to disseminate into connective tissue and recirculate between organs,
building the foundation for essential processes such as tissue regeneration or
immune surveillance. \r\nCells of the immune system, specifically leukocytes,
are extraordinarily good at performing this task. These cells are able to flexibly
shift their mode of migration between an adhesion-mediated and an adhesion-independent
manner, instantaneously accommodating for any changes in molecular composition
of the external scaffold. The key component driving directed leukocyte migration
is the chemokine receptor 7, which guides the cell along gradients of chemokine
ligand. Therefore, the physical destination of migrating leukocytes is purely
deterministic, i.e. given by global directional cues such as chemokine gradients.
\r\nNevertheless, these cells typically reside in three-dimensional scaffolds
of inhomogeneous complexity, raising the question whether cells are able to locally
discriminate between multiple optional migration routes. Current literature provides
evidence that leukocytes, specifically dendritic cells, do indeed probe their
surrounding by virtue of multiple explorative protrusions. However, it remains
enigmatic how these cells decide which one is the more favorable route to follow
and what are the key players involved in performing this task. Due to the heterogeneous
environment of most tissues, and the vast adaptability of migrating leukocytes,
at this time it is not clear to what extent leukocytes are able to optimize their
migratory strategy by adapting their level of adhesiveness. And, given the fact
that leukocyte migration is characterized by branched cell shapes in combination
with high migration velocities, it is reasonable to assume that these cells require
fine tuned shape maintenance mechanisms that tightly coordinate protrusion and
adhesion dynamics in a spatiotemporal manner. \r\nTherefore, this study aimed
to elucidate how rapidly migrating leukocytes opt for an ideal migratory path
while maintaining a continuous cell shape and balancing adhesive forces to efficiently
navigate through complex microenvironments. \r\nThe results of this study unraveled
a role for the microtubule cytoskeleton in promoting the decision making process
during path finding and for the first time point towards a microtubule-mediated
function in cell shape maintenance of highly ramified cells such as dendritic
cells. Furthermore, we found that migrating low-adhesive leukocytes are able to
instantaneously adapt to increased tensile load by engaging adhesion receptors.
This response was only occurring tangential to the substrate while adhesive properties
in the vertical direction were not increased. As leukocytes are primed for rapid
migration velocities, these results demonstrate that leukocyte integrins are able
to confer a high level of traction forces parallel to the cell membrane along
the direction of migration without wasting energy in gluing the cell to the substrate.
\r\nThus, the data in the here presented thesis provide new insights into the
pivotal role of cytoskeletal dynamics and the mechanisms of force transduction
during leukocyte migration. \r\nThereby the here presented results help to further
define fundamental principles underlying leukocyte migration and open up potential
therapeutic avenues of clinical relevance.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Aglaja
full_name: Kopf, Aglaja
id: 31DAC7B6-F248-11E8-B48F-1D18A9856A87
last_name: Kopf
orcid: 0000-0002-2187-6656
citation:
ama: Kopf A. The implication of cytoskeletal dynamics on leukocyte migration. 2019.
doi:10.15479/AT:ISTA:6891
apa: Kopf, A. (2019). The implication of cytoskeletal dynamics on leukocyte migration.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6891
chicago: Kopf, Aglaja. “The Implication of Cytoskeletal Dynamics on Leukocyte Migration.”
Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6891.
ieee: A. Kopf, “The implication of cytoskeletal dynamics on leukocyte migration,”
Institute of Science and Technology Austria, 2019.
ista: Kopf A. 2019. The implication of cytoskeletal dynamics on leukocyte migration.
Institute of Science and Technology Austria.
mla: Kopf, Aglaja. The Implication of Cytoskeletal Dynamics on Leukocyte Migration.
Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6891.
short: A. Kopf, The Implication of Cytoskeletal Dynamics on Leukocyte Migration,
Institute of Science and Technology Austria, 2019.
date_created: 2019-09-19T08:19:44Z
date_published: 2019-07-24T00:00:00Z
date_updated: 2023-10-18T08:49:17Z
day: '24'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: MiSi
doi: 10.15479/AT:ISTA:6891
file:
- access_level: closed
checksum: 00d100d6468e31e583051e0a006b640c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: akopf
date_created: 2019-10-15T05:28:42Z
date_updated: 2020-10-17T22:30:03Z
embargo_to: open_access
file_id: '6950'
file_name: Kopf_PhD_Thesis.docx
file_size: 74735267
relation: source_file
- access_level: open_access
checksum: 5d1baa899993ae6ca81aebebe1797000
content_type: application/pdf
creator: akopf
date_created: 2019-10-15T05:28:47Z
date_updated: 2020-10-17T22:30:03Z
embargo: 2020-10-16
file_id: '6951'
file_name: Kopf_PhD_Thesis1.pdf
file_size: 52787224
relation: main_file
file_date_updated: 2020-10-17T22:30:03Z
has_accepted_license: '1'
keyword:
- cell biology
- immunology
- leukocyte
- migration
- microfluidics
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '171'
project:
- _id: 265E2996-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W01250-B20
name: Nano-Analytics of Cellular Systems
publication_identifier:
eissn:
- 2663-337X
isbn:
- 978-3-99078-002-2
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
link:
- relation: press_release
url: https://ist.ac.at/en/news/feeling-like-a-cell/
record:
- id: '6328'
relation: part_of_dissertation
status: public
- id: '15'
relation: part_of_dissertation
status: public
- id: '6877'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
title: The implication of cytoskeletal dynamics on leukocyte migration
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6894'
abstract:
- lang: eng
text: "Hybrid automata combine finite automata and dynamical systems, and model
the interaction of digital with physical systems. Formal analysis that can guarantee
the safety of all behaviors or rigorously witness failures, while unsolvable in
general, has been tackled algorithmically using, e.g., abstraction, bounded model-checking,
assisted theorem proving.\r\nNevertheless, very few methods have addressed the
time-unbounded reachability analysis of hybrid automata and, for current sound
and automatic tools, scalability remains critical. We develop methods for the
polyhedral abstraction of hybrid automata, which construct coarse overapproximations
and tightens them incrementally, in a CEGAR fashion. We use template polyhedra,
i.e., polyhedra whose facets are normal to a given set of directions.\r\nWhile,
previously, directions were given by the user, we introduce (1) the first method\r\nfor
computing template directions from spurious counterexamples, so as to generalize
and\r\neliminate them. The method applies naturally to convex hybrid automata,
i.e., hybrid\r\nautomata with (possibly non-linear) convex constraints on derivatives
only, while for linear\r\nODE requires further abstraction. Specifically, we introduce
(2) the conic abstractions,\r\nwhich, partitioning the state space into appropriate
(possibly non-uniform) cones, divide\r\ncurvy trajectories into relatively straight
sections, suitable for polyhedral abstractions.\r\nFinally, we introduce (3) space-time
interpolation, which, combining interval arithmetic\r\nand template refinement,
computes appropriate (possibly non-uniform) time partitioning\r\nand template
directions along spurious trajectories, so as to eliminate them.\r\nWe obtain
sound and automatic methods for the reachability analysis over dense\r\nand unbounded
time of convex hybrid automata and hybrid automata with linear ODE.\r\nWe build
prototype tools and compare—favorably—our methods against the respective\r\nstate-of-the-art
tools, on several benchmarks."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
citation:
ama: Giacobbe M. Automatic time-unbounded reachability analysis of hybrid systems.
2019. doi:10.15479/AT:ISTA:6894
apa: Giacobbe, M. (2019). Automatic time-unbounded reachability analysis of hybrid
systems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6894
chicago: Giacobbe, Mirco. “Automatic Time-Unbounded Reachability Analysis of Hybrid
Systems.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6894.
ieee: M. Giacobbe, “Automatic time-unbounded reachability analysis of hybrid systems,”
Institute of Science and Technology Austria, 2019.
ista: Giacobbe M. 2019. Automatic time-unbounded reachability analysis of hybrid
systems. Institute of Science and Technology Austria.
mla: Giacobbe, Mirco. Automatic Time-Unbounded Reachability Analysis of Hybrid
Systems. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6894.
short: M. Giacobbe, Automatic Time-Unbounded Reachability Analysis of Hybrid Systems,
Institute of Science and Technology Austria, 2019.
date_created: 2019-09-22T14:08:44Z
date_published: 2019-09-30T00:00:00Z
date_updated: 2023-09-19T09:30:43Z
day: '30'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ToHe
doi: 10.15479/AT:ISTA:6894
file:
- access_level: open_access
checksum: 773beaf4a85dc2acc2c12b578fbe1965
content_type: application/pdf
creator: mgiacobbe
date_created: 2019-09-27T14:15:05Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6916'
file_name: giacobbe_thesis.pdf
file_size: 4100685
relation: main_file
- access_level: closed
checksum: 97f1c3da71feefd27e6e625d32b4c75b
content_type: application/gzip
creator: mgiacobbe
date_created: 2019-09-27T14:22:04Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6917'
file_name: giacobbe_thesis_src.tar.gz
file_size: 7959732
relation: source_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '132'
publication_identifier:
eissn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '631'
relation: part_of_dissertation
status: public
- id: '647'
relation: part_of_dissertation
status: public
- id: '140'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
title: Automatic time-unbounded reachability analysis of hybrid systems
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
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: 2023-08-30T06:19:49Z
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:
- '18726240'
issn:
- '00068993'
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 1724
year: '2019'
...
---
_id: '6897'
abstract:
- lang: eng
text: The apical hook is a transiently formed structure that plays a protective
role when the germinating seedling penetrates through the soil towards the surface.
Crucial for proper bending is the local auxin maxima, which defines the concave
(inner) side of the hook curvature. As no sign of asymmetric auxin distribution
has been reported in embryonic hypocotyls prior to hook formation, the question
of how auxin asymmetry is established in the early phases of seedling germination
remains largely unanswered. Here, we analyzed the auxin distribution and expression
of PIN auxin efflux carriers from early phases of germination, and show that bending
of the root in response to gravity is the crucial initial cue that governs the
hypocotyl bending required for apical hook formation. Importantly, polar auxin
transport machinery is established gradually after germination starts as a result
of tight root-hypocotyl interaction and a proper balance between abscisic acid
and gibberellins.
acknowledged_ssus:
- _id: LifeSc
- _id: Bio
acknowledgement: "We thank Jiri Friml and Phillip Brewer for inspiring discussion
and for help in preparing the manuscript. This research was supported by the Scientific
Service Units (SSU) of IST-Austria through resources provided by the Bioimaging
Facility\r\n(BIF), the Life Science Facility (LSF).\r\nThis work was supported by
grants from the European Research Council (Starting Independent Research Grant ERC-2007-Stg-
207362-HCPO to E.B.). J.P. and M.S. received funds from European Regional Development
Fund-Project ‘Centre for Experimental Plant Biology’ (No. CZ.02.1.01/0.0/0.0/16_019/0000738)."
article_number: dev175919
article_processing_charge: No
article_type: original
author:
- first_name: Qiang
full_name: Zhu, Qiang
id: 40A4B9E6-F248-11E8-B48F-1D18A9856A87
last_name: Zhu
- first_name: Marçal
full_name: Gallemi, Marçal
id: 460C6802-F248-11E8-B48F-1D18A9856A87
last_name: Gallemi
orcid: 0000-0003-4675-6893
- first_name: Jiří
full_name: Pospíšil, Jiří
last_name: Pospíšil
- first_name: Petra
full_name: Žádníková, Petra
last_name: Žádníková
- first_name: Miroslav
full_name: Strnad, Miroslav
last_name: Strnad
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Zhu Q, Gallemi M, Pospíšil J, Žádníková P, Strnad M, Benková E. Root gravity
response module guides differential growth determining both root bending and apical
hook formation in Arabidopsis. Development. 2019;146(17). doi:10.1242/dev.175919
apa: Zhu, Q., Gallemi, M., Pospíšil, J., Žádníková, P., Strnad, M., & Benková,
E. (2019). Root gravity response module guides differential growth determining
both root bending and apical hook formation in Arabidopsis. Development.
The Company of Biologists. https://doi.org/10.1242/dev.175919
chicago: Zhu, Qiang, Marçal Gallemi, Jiří Pospíšil, Petra Žádníková, Miroslav Strnad,
and Eva Benková. “Root Gravity Response Module Guides Differential Growth Determining
Both Root Bending and Apical Hook Formation in Arabidopsis.” Development.
The Company of Biologists, 2019. https://doi.org/10.1242/dev.175919.
ieee: Q. Zhu, M. Gallemi, J. Pospíšil, P. Žádníková, M. Strnad, and E. Benková,
“Root gravity response module guides differential growth determining both root
bending and apical hook formation in Arabidopsis,” Development, vol. 146,
no. 17. The Company of Biologists, 2019.
ista: Zhu Q, Gallemi M, Pospíšil J, Žádníková P, Strnad M, Benková E. 2019. Root
gravity response module guides differential growth determining both root bending
and apical hook formation in Arabidopsis. Development. 146(17), dev175919.
mla: Zhu, Qiang, et al. “Root Gravity Response Module Guides Differential Growth
Determining Both Root Bending and Apical Hook Formation in Arabidopsis.” Development,
vol. 146, no. 17, dev175919, The Company of Biologists, 2019, doi:10.1242/dev.175919.
short: Q. Zhu, M. Gallemi, J. Pospíšil, P. Žádníková, M. Strnad, E. Benková, Development
146 (2019).
date_created: 2019-09-22T22:00:36Z
date_published: 2019-09-12T00:00:00Z
date_updated: 2025-05-07T11:10:55Z
day: '12'
department:
- _id: EvBe
doi: 10.1242/dev.175919
ec_funded: 1
external_id:
isi:
- '000486297400011'
pmid:
- '31391194'
intvolume: ' 146'
isi: 1
issue: '17'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1242/dev.175919
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 253FCA6A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '207362'
name: Hormonal cross-talk in plant organogenesis
publication: Development
publication_identifier:
eissn:
- '14779129'
publication_status: published
publisher: The Company of Biologists
quality_controlled: '1'
scopus_import: '1'
status: public
title: Root gravity response module guides differential growth determining both root
bending and apical hook formation in Arabidopsis
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 146
year: '2019'
...
---
_id: '6898'
abstract:
- lang: eng
text: "Background\r\n\r\nChlamydia are ancient intracellular pathogens with reduced,
though strikingly conserved genome. Despite their parasitic lifestyle and isolated
intracellular environment, these bacteria managed to avoid accumulation of deleterious
mutations leading to subsequent genome degradation characteristic for many parasitic
bacteria.\r\nResults\r\n\r\nWe report pan-genomic analysis of sixteen species
from genus Chlamydia including identification and functional annotation of orthologous
genes, and characterization of gene gains, losses, and rearrangements. We demonstrate
the overall genome stability of these bacteria as indicated by a large fraction
of common genes with conserved genomic locations. On the other hand, extreme evolvability
is confined to several paralogous gene families such as polymorphic membrane proteins
and phospholipase D, and likely is caused by the pressure from the host immune
system.\r\nConclusions\r\n\r\nThis combination of a large, conserved core genome
and a small, evolvable periphery likely reflect the balance between the selective
pressure towards genome reduction and the need to adapt to escape from the host
immunity."
article_number: '710'
article_processing_charge: No
author:
- first_name: Olga M.
full_name: Sigalova, Olga M.
last_name: Sigalova
- first_name: Andrei V.
full_name: Chaplin, Andrei V.
last_name: Chaplin
- first_name: Olga
full_name: Bochkareva, Olga
id: C4558D3C-6102-11E9-A62E-F418E6697425
last_name: Bochkareva
orcid: 0000-0003-1006-6639
- first_name: Pavel V.
full_name: Shelyakin, Pavel V.
last_name: Shelyakin
- first_name: Vsevolod A.
full_name: Filaretov, Vsevolod A.
last_name: Filaretov
- first_name: Evgeny E.
full_name: Akkuratov, Evgeny E.
last_name: Akkuratov
- first_name: Valentina
full_name: Burskaia, Valentina
last_name: Burskaia
- first_name: Mikhail S.
full_name: Gelfand, Mikhail S.
last_name: Gelfand
citation:
ama: Sigalova OM, Chaplin AV, Bochkareva O, et al. Chlamydia pan-genomic analysis
reveals balance between host adaptation and selective pressure to genome reduction.
BMC Genomics. 2019;20(1). doi:10.1186/s12864-019-6059-5
apa: Sigalova, O. M., Chaplin, A. V., Bochkareva, O., Shelyakin, P. V., Filaretov,
V. A., Akkuratov, E. E., … Gelfand, M. S. (2019). Chlamydia pan-genomic analysis
reveals balance between host adaptation and selective pressure to genome reduction.
BMC Genomics. BioMed Central. https://doi.org/10.1186/s12864-019-6059-5
chicago: Sigalova, Olga M., Andrei V. Chaplin, Olga Bochkareva, Pavel V. Shelyakin,
Vsevolod A. Filaretov, Evgeny E. Akkuratov, Valentina Burskaia, and Mikhail S.
Gelfand. “Chlamydia Pan-Genomic Analysis Reveals Balance between Host Adaptation
and Selective Pressure to Genome Reduction.” BMC Genomics. BioMed Central,
2019. https://doi.org/10.1186/s12864-019-6059-5.
ieee: O. M. Sigalova et al., “Chlamydia pan-genomic analysis reveals balance
between host adaptation and selective pressure to genome reduction,” BMC Genomics,
vol. 20, no. 1. BioMed Central, 2019.
ista: Sigalova OM, Chaplin AV, Bochkareva O, Shelyakin PV, Filaretov VA, Akkuratov
EE, Burskaia V, Gelfand MS. 2019. Chlamydia pan-genomic analysis reveals balance
between host adaptation and selective pressure to genome reduction. BMC Genomics.
20(1), 710.
mla: Sigalova, Olga M., et al. “Chlamydia Pan-Genomic Analysis Reveals Balance between
Host Adaptation and Selective Pressure to Genome Reduction.” BMC Genomics,
vol. 20, no. 1, 710, BioMed Central, 2019, doi:10.1186/s12864-019-6059-5.
short: O.M. Sigalova, A.V. Chaplin, O. Bochkareva, P.V. Shelyakin, V.A. Filaretov,
E.E. Akkuratov, V. Burskaia, M.S. Gelfand, BMC Genomics 20 (2019).
date_created: 2019-09-22T22:00:36Z
date_published: 2019-09-12T00:00:00Z
date_updated: 2023-08-30T06:20:22Z
day: '12'
ddc:
- '570'
department:
- _id: FyKo
doi: 10.1186/s12864-019-6059-5
external_id:
isi:
- '000485256100001'
file:
- access_level: open_access
checksum: b798773c5823012d31c812c9f7975da2
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T10:33:17Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6924'
file_name: 2019_BioMed_Sigalova.pdf
file_size: 4157175
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 20'
isi: 1
issue: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: BMC Genomics
publication_identifier:
eissn:
- '14712164'
publication_status: published
publisher: BioMed Central
quality_controlled: '1'
related_material:
record:
- id: '9731'
relation: research_data
status: public
- id: '9783'
relation: research_data
status: public
- id: '9890'
relation: research_data
status: public
- id: '9892'
relation: research_data
status: public
- id: '9893'
relation: research_data
status: public
- id: '9894'
relation: research_data
status: public
- id: '9895'
relation: research_data
status: public
- id: '9896'
relation: research_data
status: public
- id: '9897'
relation: research_data
status: public
- id: '9898'
relation: research_data
status: public
- id: '9899'
relation: research_data
status: public
- id: '9900'
relation: research_data
status: public
- id: '9901'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Chlamydia pan-genomic analysis reveals balance between host adaptation and
selective pressure to genome reduction
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 20
year: '2019'
...
---
_id: '6899'
abstract:
- lang: eng
text: Intra-organ communication guides morphogenetic processes that are essential
for an organ to carry out complex physiological functions. In the heart, the growth
of the myocardium is tightly coupled to that of the endocardium, a specialized
endothelial tissue that lines its interior. Several molecular pathways have been
implicated in the communication between these tissues including secreted factors,
components of the extracellular matrix, or proteins involved in cell-cell communication.
Yet, it is unknown how the growth of the endocardium is coordinated with that
of the myocardium. Here, we show that an increased expansion of the myocardial
atrial chamber volume generates higher junctional forces within endocardial cells.
This leads to biomechanical signaling involving VE-cadherin, triggering nuclear
localization of the Hippo pathway transcriptional regulator Yap1 and endocardial
proliferation. Our work suggests that the growth of the endocardium results from
myocardial chamber volume expansion and ends when the tension on the tissue is
relaxed.
article_processing_charge: No
author:
- first_name: Dorothee
full_name: Bornhorst, Dorothee
last_name: Bornhorst
- first_name: Peng
full_name: Xia, Peng
id: 4AB6C7D0-F248-11E8-B48F-1D18A9856A87
last_name: Xia
orcid: 0000-0002-5419-7756
- first_name: Hiroyuki
full_name: Nakajima, Hiroyuki
last_name: Nakajima
- first_name: Chaitanya
full_name: Dingare, Chaitanya
last_name: Dingare
- first_name: Wiebke
full_name: Herzog, Wiebke
last_name: Herzog
- first_name: Virginie
full_name: Lecaudey, Virginie
last_name: Lecaudey
- first_name: Naoki
full_name: Mochizuki, Naoki
last_name: Mochizuki
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Deborah
full_name: Yelon, Deborah
last_name: Yelon
- first_name: Salim
full_name: Abdelilah-Seyfried, Salim
last_name: Abdelilah-Seyfried
citation:
ama: Bornhorst D, Xia P, Nakajima H, et al. Biomechanical signaling within the developing
zebrafish heart attunes endocardial growth to myocardial chamber dimensions. Nature
communications. 2019;10(1):4113. doi:10.1038/s41467-019-12068-x
apa: Bornhorst, D., Xia, P., Nakajima, H., Dingare, C., Herzog, W., Lecaudey, V.,
… Abdelilah-Seyfried, S. (2019). Biomechanical signaling within the developing
zebrafish heart attunes endocardial growth to myocardial chamber dimensions. Nature
Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-019-12068-x
chicago: Bornhorst, Dorothee, Peng Xia, Hiroyuki Nakajima, Chaitanya Dingare, Wiebke
Herzog, Virginie Lecaudey, Naoki Mochizuki, Carl-Philipp J Heisenberg, Deborah
Yelon, and Salim Abdelilah-Seyfried. “Biomechanical Signaling within the Developing
Zebrafish Heart Attunes Endocardial Growth to Myocardial Chamber Dimensions.”
Nature Communications. Nature Publishing Group, 2019. https://doi.org/10.1038/s41467-019-12068-x.
ieee: D. Bornhorst et al., “Biomechanical signaling within the developing
zebrafish heart attunes endocardial growth to myocardial chamber dimensions,”
Nature communications, vol. 10, no. 1. Nature Publishing Group, p. 4113,
2019.
ista: Bornhorst D, Xia P, Nakajima H, Dingare C, Herzog W, Lecaudey V, Mochizuki
N, Heisenberg C-PJ, Yelon D, Abdelilah-Seyfried S. 2019. Biomechanical signaling
within the developing zebrafish heart attunes endocardial growth to myocardial
chamber dimensions. Nature communications. 10(1), 4113.
mla: Bornhorst, Dorothee, et al. “Biomechanical Signaling within the Developing
Zebrafish Heart Attunes Endocardial Growth to Myocardial Chamber Dimensions.”
Nature Communications, vol. 10, no. 1, Nature Publishing Group, 2019, p.
4113, doi:10.1038/s41467-019-12068-x.
short: D. Bornhorst, P. Xia, H. Nakajima, C. Dingare, W. Herzog, V. Lecaudey, N.
Mochizuki, C.-P.J. Heisenberg, D. Yelon, S. Abdelilah-Seyfried, Nature Communications
10 (2019) 4113.
date_created: 2019-09-22T22:00:37Z
date_published: 2019-09-11T00:00:00Z
date_updated: 2023-08-30T06:21:23Z
day: '11'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.1038/s41467-019-12068-x
external_id:
isi:
- '000485216800009'
pmid:
- '31511517'
file:
- access_level: open_access
checksum: 62c2512712e16d27c1797d318d14ba9f
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T11:18:50Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6926'
file_name: 2019_Nature_Bornhorst.pdf
file_size: 3905793
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
issue: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '4113'
pmid: 1
publication: Nature communications
publication_identifier:
eissn:
- '20411723'
publication_status: published
publisher: Nature Publishing Group
quality_controlled: '1'
scopus_import: '1'
status: public
title: Biomechanical signaling within the developing zebrafish heart attunes endocardial
growth to myocardial chamber dimensions
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: 10
year: '2019'
...
---
_id: '6900'
abstract:
- lang: eng
text: Across diverse biological systems—ranging from neural networks to intracellular
signaling and genetic regulatory networks—the information about changes in the
environment is frequently encoded in the full temporal dynamics of the network
nodes. A pressing data-analysis challenge has thus been to efficiently estimate
the amount of information that these dynamics convey from experimental data. Here
we develop and evaluate decoding-based estimation methods to lower bound the mutual
information about a finite set of inputs, encoded in single-cell high-dimensional
time series data. For biological reaction networks governed by the chemical Master
equation, we derive model-based information approximations and analytical upper
bounds, against which we benchmark our proposed model-free decoding estimators.
In contrast to the frequently-used k-nearest-neighbor estimator, decoding-based
estimators robustly extract a large fraction of the available information from
high-dimensional trajectories with a realistic number of data samples. We apply
these estimators to previously published data on Erk and Ca2+ signaling in mammalian
cells and to yeast stress-response, and find that substantial amount of information
about environmental state can be encoded by non-trivial response statistics even
in stationary signals. We argue that these single-cell, decoding-based information
estimates, rather than the commonly-used tests for significant differences between
selected population response statistics, provide a proper and unbiased measure
for the performance of biological signaling networks.
article_processing_charge: No
author:
- first_name: Sarah A
full_name: Cepeda Humerez, Sarah A
id: 3DEE19A4-F248-11E8-B48F-1D18A9856A87
last_name: Cepeda Humerez
- first_name: Jakob
full_name: Ruess, Jakob
last_name: Ruess
orcid: 0000-0003-1615-3282
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: Cepeda Humerez SA, Ruess J, Tkačik G. Estimating information in time-varying
signals. PLoS computational biology. 2019;15(9):e1007290. doi:10.1371/journal.pcbi.1007290
apa: Cepeda Humerez, S. A., Ruess, J., & Tkačik, G. (2019). Estimating information
in time-varying signals. PLoS Computational Biology. Public Library of
Science. https://doi.org/10.1371/journal.pcbi.1007290
chicago: Cepeda Humerez, Sarah A, Jakob Ruess, and Gašper Tkačik. “Estimating Information
in Time-Varying Signals.” PLoS Computational Biology. Public Library of
Science, 2019. https://doi.org/10.1371/journal.pcbi.1007290.
ieee: S. A. Cepeda Humerez, J. Ruess, and G. Tkačik, “Estimating information in
time-varying signals,” PLoS computational biology, vol. 15, no. 9. Public
Library of Science, p. e1007290, 2019.
ista: Cepeda Humerez SA, Ruess J, Tkačik G. 2019. Estimating information in time-varying
signals. PLoS computational biology. 15(9), e1007290.
mla: Cepeda Humerez, Sarah A., et al. “Estimating Information in Time-Varying Signals.”
PLoS Computational Biology, vol. 15, no. 9, Public Library of Science,
2019, p. e1007290, doi:10.1371/journal.pcbi.1007290.
short: S.A. Cepeda Humerez, J. Ruess, G. Tkačik, PLoS Computational Biology 15 (2019)
e1007290.
date_created: 2019-09-22T22:00:37Z
date_published: 2019-09-03T00:00:00Z
date_updated: 2023-09-07T12:55:21Z
day: '03'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1007290
external_id:
isi:
- '000489741800021'
pmid:
- '31479447'
file:
- access_level: open_access
checksum: 81bdce1361c9aa8395d6fa635fb6ab47
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T10:53:45Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6925'
file_name: 2019_PLoS_Cepeda-Humerez.pdf
file_size: 3081855
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: e1007290
pmid: 1
project:
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
publication: PLoS computational biology
publication_identifier:
eissn:
- '15537358'
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
record:
- id: '6473'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: Estimating information in time-varying signals
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: 15
year: '2019'
...
---
_id: '6919'
article_number: eaaw6490
article_processing_charge: No
author:
- first_name: Chao
full_name: Qi, Chao
last_name: Qi
- first_name: Giulio Di
full_name: Minin, Giulio Di
last_name: Minin
- first_name: Irene
full_name: Vercellino, Irene
id: 3ED6AF16-F248-11E8-B48F-1D18A9856A87
last_name: Vercellino
orcid: 0000-0001-5618-3449
- first_name: Anton
full_name: Wutz, Anton
last_name: Wutz
- first_name: Volodymyr M.
full_name: Korkhov, Volodymyr M.
last_name: Korkhov
citation:
ama: Qi C, Minin GD, Vercellino I, Wutz A, Korkhov VM. Structural basis of sterol
recognition by human hedgehog receptor PTCH1. Science Advances. 2019;5(9).
doi:10.1126/sciadv.aaw6490
apa: Qi, C., Minin, G. D., Vercellino, I., Wutz, A., & Korkhov, V. M. (2019).
Structural basis of sterol recognition by human hedgehog receptor PTCH1. Science
Advances. American Association for the Advancement of Science. https://doi.org/10.1126/sciadv.aaw6490
chicago: Qi, Chao, Giulio Di Minin, Irene Vercellino, Anton Wutz, and Volodymyr
M. Korkhov. “Structural Basis of Sterol Recognition by Human Hedgehog Receptor
PTCH1.” Science Advances. American Association for the Advancement of Science,
2019. https://doi.org/10.1126/sciadv.aaw6490.
ieee: C. Qi, G. D. Minin, I. Vercellino, A. Wutz, and V. M. Korkhov, “Structural
basis of sterol recognition by human hedgehog receptor PTCH1,” Science Advances,
vol. 5, no. 9. American Association for the Advancement of Science, 2019.
ista: Qi C, Minin GD, Vercellino I, Wutz A, Korkhov VM. 2019. Structural basis of
sterol recognition by human hedgehog receptor PTCH1. Science Advances. 5(9), eaaw6490.
mla: Qi, Chao, et al. “Structural Basis of Sterol Recognition by Human Hedgehog
Receptor PTCH1.” Science Advances, vol. 5, no. 9, eaaw6490, American Association
for the Advancement of Science, 2019, doi:10.1126/sciadv.aaw6490.
short: C. Qi, G.D. Minin, I. Vercellino, A. Wutz, V.M. Korkhov, Science Advances
5 (2019).
date_created: 2019-09-29T22:00:45Z
date_published: 2019-09-18T00:00:00Z
date_updated: 2023-08-30T06:55:31Z
day: '18'
ddc:
- '570'
department:
- _id: LeSa
doi: 10.1126/sciadv.aaw6490
external_id:
isi:
- '000491128800062'
file:
- access_level: open_access
checksum: b2256c9117655bc15f621ba0babf219f
content_type: application/pdf
creator: kschuh
date_created: 2019-10-02T11:13:54Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6928'
file_name: 2019_AAAS_Qi.pdf
file_size: 1236101
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
issue: '9'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '09'
oa: 1
oa_version: Published Version
publication: Science Advances
publication_identifier:
eissn:
- '23752548'
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structural basis of sterol recognition by human hedgehog receptor PTCH1
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: 5
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: 2023-08-30T06:55:02Z
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:
issn:
- 1674-2052
- 1752-9867
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
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: International 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: International Symposium on Distributed Computing'
start_date: 2019-10-14
date_created: 2019-10-08T12:41:38Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2021-01-12T08:09:38Z
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
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 146
year: '2019'
...