---
OA_place: publisher
_id: '83'
abstract:
- lang: eng
text: "A proof system is a protocol between a prover and a verifier over a common
input in which an honest prover convinces the verifier of the validity of true
statements. Motivated by the success of decentralized cryptocurrencies, exemplified
by Bitcoin, the focus of this thesis will be on proof systems which found applications
in some sustainable alternatives to Bitcoin, such as the Spacemint and Chia cryptocurrencies.
In particular, we focus on proofs of space and proofs of sequential work.\r\nProofs
of space (PoSpace) were suggested as more ecological, economical, and egalitarian
alternative to the energy-wasteful proof-of-work mining of Bitcoin. However, the
state-of-the-art constructions of PoSpace are based on sophisticated graph pebbling
lower bounds, and are therefore complex. Moreover, when these PoSpace are used
in cryptocurrencies like Spacemint, miners can only start mining after ensuring
that a commitment to their space is already added in a special transaction to
the blockchain. Proofs of sequential work (PoSW) are proof systems in which a
prover, upon receiving a statement x and a time parameter T, computes a proof
which convinces the verifier that T time units had passed since x was received.
Whereas Spacemint assumes synchrony to retain some interesting Bitcoin dynamics,
Chia requires PoSW with unique proofs, i.e., PoSW in which it is hard to come
up with more than one accepting proof for any true statement. In this thesis we
construct simple and practically-efficient PoSpace and PoSW. When using our PoSpace
in cryptocurrencies, miners can start mining on the fly, like in Bitcoin, and
unlike current constructions of PoSW, which either achieve efficient verification
of sequential work, or faster-than-recomputing verification of correctness of
proofs, but not both at the same time, ours achieve the best of these two worlds."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Hamza M
full_name: Abusalah, Hamza M
id: 40297222-F248-11E8-B48F-1D18A9856A87
last_name: Abusalah
citation:
ama: Abusalah HM. Proof systems for sustainable decentralized cryptocurrencies.
2018. doi:10.15479/AT:ISTA:TH_1046
apa: Abusalah, H. M. (2018). Proof systems for sustainable decentralized cryptocurrencies.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1046
chicago: Abusalah, Hamza M. “Proof Systems for Sustainable Decentralized Cryptocurrencies.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1046.
ieee: H. M. Abusalah, “Proof systems for sustainable decentralized cryptocurrencies,”
Institute of Science and Technology Austria, 2018.
ista: Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies.
Institute of Science and Technology Austria.
mla: Abusalah, Hamza M. Proof Systems for Sustainable Decentralized Cryptocurrencies.
Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1046.
short: H.M. Abusalah, Proof Systems for Sustainable Decentralized Cryptocurrencies,
Institute of Science and Technology Austria, 2018.
corr_author: '1'
date_created: 2018-12-11T11:44:32Z
date_published: 2018-09-05T00:00:00Z
date_updated: 2026-04-08T14:10:22Z
day: '05'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: KrPi
doi: 10.15479/AT:ISTA:TH_1046
ec_funded: 1
file:
- access_level: open_access
checksum: c4b5f7d111755d1396787f41886fc674
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T06:43:41Z
date_updated: 2020-07-14T12:48:11Z
file_id: '6245'
file_name: 2018_Thesis_Abusalah.pdf
file_size: 876241
relation: main_file
- access_level: closed
checksum: 0f382ac56b471c48fd907d63eb87dafe
content_type: application/x-gzip
creator: dernst
date_created: 2019-04-09T06:43:41Z
date_updated: 2020-07-14T12:48:11Z
file_id: '6246'
file_name: 2018_Thesis_Abusalah_source.tar.gz
file_size: 2029190
relation: source_file
file_date_updated: 2020-07-14T12:48:11Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '59'
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7971'
pubrep_id: '1046'
related_material:
record:
- id: '559'
relation: part_of_dissertation
status: public
- id: '1236'
relation: part_of_dissertation
status: public
- id: '1235'
relation: part_of_dissertation
status: public
- id: '1229'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
title: Proof systems for sustainable decentralized cryptocurrencies
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2018'
...
---
_id: '23'
abstract:
- lang: eng
text: The strong atomistic spin–orbit coupling of holes makes single-shot spin readout
measurements difficult because it reduces the spin lifetimes. By integrating the
charge sensor into a high bandwidth radio frequency reflectometry setup, we were
able to demonstrate single-shot readout of a germanium quantum dot hole spin and
measure the spin lifetime. Hole spin relaxation times of about 90 μs at 500 mT
are reported, with a total readout visibility of about 70%. By analyzing separately
the spin-to-charge conversion and charge readout fidelities, we have obtained
insight into the processes limiting the visibilities of hole spins. The analyses
suggest that high hole visibilities are feasible at realistic experimental conditions,
underlying the potential of hole spins for the realization of viable qubit devices.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
article_processing_charge: No
author:
- first_name: Lada
full_name: Vukušić, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukušić
orcid: 0000-0003-2424-8636
- first_name: Josip
full_name: Kukucka, Josip
id: 3F5D8856-F248-11E8-B48F-1D18A9856A87
last_name: Kukucka
- first_name: Hannes
full_name: Watzinger, Hannes
id: 35DF8E50-F248-11E8-B48F-1D18A9856A87
last_name: Watzinger
- first_name: Joshua M
full_name: Milem, Joshua M
id: 4CDE0A96-F248-11E8-B48F-1D18A9856A87
last_name: Milem
- first_name: Friedrich
full_name: Schäffler, Friedrich
last_name: Schäffler
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
citation:
ama: Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. Single-shot
readout of hole spins in Ge. Nano Letters. 2018;18(11):7141-7145. doi:10.1021/acs.nanolett.8b03217
apa: Vukušić, L., Kukucka, J., Watzinger, H., Milem, J. M., Schäffler, F., &
Katsaros, G. (2018). Single-shot readout of hole spins in Ge. Nano Letters.
American Chemical Society. https://doi.org/10.1021/acs.nanolett.8b03217
chicago: Vukušić, Lada, Josip Kukucka, Hannes Watzinger, Joshua M Milem, Friedrich
Schäffler, and Georgios Katsaros. “Single-Shot Readout of Hole Spins in Ge.” Nano
Letters. American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.8b03217.
ieee: L. Vukušić, J. Kukucka, H. Watzinger, J. M. Milem, F. Schäffler, and G. Katsaros,
“Single-shot readout of hole spins in Ge,” Nano Letters, vol. 18, no. 11.
American Chemical Society, pp. 7141–7145, 2018.
ista: Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. 2018.
Single-shot readout of hole spins in Ge. Nano Letters. 18(11), 7141–7145.
mla: Vukušić, Lada, et al. “Single-Shot Readout of Hole Spins in Ge.” Nano Letters,
vol. 18, no. 11, American Chemical Society, 2018, pp. 7141–45, doi:10.1021/acs.nanolett.8b03217.
short: L. Vukušić, J. Kukucka, H. Watzinger, J.M. Milem, F. Schäffler, G. Katsaros,
Nano Letters 18 (2018) 7141–7145.
date_created: 2018-12-11T11:44:13Z
date_published: 2018-10-25T00:00:00Z
date_updated: 2026-04-08T14:09:47Z
day: '25'
ddc:
- '530'
department:
- _id: GeKa
doi: 10.1021/acs.nanolett.8b03217
ec_funded: 1
external_id:
isi:
- '000451102100064'
pmid:
- '30359041'
file:
- access_level: open_access
checksum: 3e6034a94c6b5335e939145d88bdb371
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:08Z
date_updated: 2020-07-14T12:45:37Z
file_id: '5194'
file_name: IST-2018-1065-v1+1_ACS_nanoletters_8b03217.pdf
file_size: 1361441
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 18'
isi: 1
issue: '11'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '10'
oa: 1
oa_version: Published Version
page: 7141 - 7145
pmid: 1
project:
- _id: 25517E86-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '335497'
name: Towards Spin qubits and Majorana fermions in Germanium self assembled hut-wires
publication: Nano Letters
publication_identifier:
issn:
- 1530-6984
publication_status: published
publisher: American Chemical Society
publist_id: '8032'
pubrep_id: '1065'
quality_controlled: '1'
related_material:
record:
- id: '7977'
relation: popular_science
- id: '7996'
relation: dissertation_contains
status: public
- id: '69'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Single-shot readout of hole spins in Ge
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2018'
...
---
OA_place: publisher
_id: '69'
abstract:
- lang: eng
text: 'A qubit, a unit of quantum information, is essentially any quantum mechanical
two-level system which can be coherently controlled. Still, to be used for computation,
it has to fulfill criteria. Qubits, regardless of the system in which they are
realized, suffer from decoherence. This leads to loss of the information stored
in the qubit. The upper bound of the time scale on which decoherence happens is
set by the spin relaxation time. In this thesis I studied a two-level system consisting
of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire.
Such Ge hut wires have emerged as a promising material system for the realization
of spin qubits, due to the combination of two significant properties: long spin
coherence time as expected for group IV semiconductors due to the low hyperfine
interaction and a strong valence band spin-orbit coupling. Here, I present how
to fabricate quantum dot devices suitable for electrical transport measurements.
Coupled quantum dot devices allowed the realization of a charge sensor, which
is electrostatically and tunnel coupled to a quantum dot. By integrating the charge
sensor into a radio-frequency reflectometry setup, I performed for the first time
single-shot readout measurements of hole spins and extracted the hole spin relaxation
times in Ge hut wires.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lada
full_name: Vukušić, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukušić
orcid: 0000-0003-2424-8636
citation:
ama: Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires.
2018. doi:10.15479/AT:ISTA:TH_1047
apa: Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in
Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047
chicago: Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge
Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047.
ieee: L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,”
Institute of Science and Technology Austria, 2018.
ista: Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut
wires. Institute of Science and Technology Austria.
mla: Vukušić, Lada. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut
Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047.
short: L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires,
Institute of Science and Technology Austria, 2018.
corr_author: '1'
date_created: 2018-12-11T11:44:28Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2026-04-08T14:09:47Z
day: '01'
ddc:
- '530'
- '600'
degree_awarded: PhD
department:
- _id: GeKa
- _id: GradSch
doi: 10.15479/AT:ISTA:TH_1047
file:
- access_level: open_access
checksum: c570b656e30749cd65b1c7e13a9ce0a8
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:00:40Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6247'
file_name: 2018_Thesis_Vukusic.pdf
file_size: 28452385
relation: main_file
- access_level: closed
checksum: 7856771d9cd401fe0b311191076db6e1
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:00:40Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6248'
file_name: 2018_Thesis_Vukusic_source.zip
file_size: 53058704
relation: source_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '103'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7985'
pubrep_id: '1047'
related_material:
record:
- id: '23'
relation: part_of_dissertation
status: public
- id: '840'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: Charge sensing and spin relaxation times of holes in Ge hut wires
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2018'
...
---
OA_place: publisher
_id: '149'
abstract:
- lang: eng
text: The eigenvalue density of many large random matrices is well approximated
by a deterministic measure, the self-consistent density of states. In the present
work, we show this behaviour for several classes of random matrices. In fact,
we establish that, in each of these classes, the self-consistent density of states
approximates the eigenvalue density of the random matrix on all scales slightly
above the typical eigenvalue spacing. For large classes of random matrices, the
self-consistent density of states exhibits several universal features. We prove
that, under suitable assumptions, random Gram matrices and Hermitian random matrices
with decaying correlations have a 1/3-Hölder continuous self-consistent density
of states ρ on R, which is analytic, where it is positive, and has either a square
root edge or a cubic root cusp, where it vanishes. We, thus, extend the validity
of the corresponding result for Wigner-type matrices from [4, 5, 7]. We show that
ρ is determined as the inverse Stieltjes transform of the normalized trace of
the unique solution m(z) to the Dyson equation −m(z) −1 = z − a + S[m(z)] on C
N×N with the constraint Im m(z) ≥ 0. Here, z lies in the complex upper half-plane,
a is a self-adjoint element of C N×N and S is a positivity-preserving operator
on C N×N encoding the first two moments of the random matrix. In order to analyze
a possible limit of ρ for N → ∞ and address some applications in free probability
theory, we also consider the Dyson equation on infinite dimensional von Neumann
algebras. We present two applications to random matrices. We first establish that,
under certain assumptions, large random matrices with independent entries have
a rotationally symmetric self-consistent density of states which is supported
on a centered disk in C. Moreover, it is infinitely often differentiable apart
from a jump on the boundary of this disk. Second, we show edge universality at
all regular (not necessarily extreme) spectral edges for Hermitian random matrices
with decaying correlations.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Johannes
full_name: Alt, Johannes
id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
last_name: Alt
citation:
ama: Alt J. Dyson equation and eigenvalue statistics of random matrices. 2018. doi:10.15479/AT:ISTA:TH_1040
apa: Alt, J. (2018). Dyson equation and eigenvalue statistics of random matrices.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1040
chicago: Alt, Johannes. “Dyson Equation and Eigenvalue Statistics of Random Matrices.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1040.
ieee: J. Alt, “Dyson equation and eigenvalue statistics of random matrices,” Institute
of Science and Technology Austria, 2018.
ista: Alt J. 2018. Dyson equation and eigenvalue statistics of random matrices.
Institute of Science and Technology Austria.
mla: Alt, Johannes. Dyson Equation and Eigenvalue Statistics of Random Matrices.
Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1040.
short: J. Alt, Dyson Equation and Eigenvalue Statistics of Random Matrices, Institute
of Science and Technology Austria, 2018.
corr_author: '1'
date_created: 2018-12-11T11:44:53Z
date_published: 2018-07-12T00:00:00Z
date_updated: 2026-04-08T14:11:37Z
day: '12'
ddc:
- '515'
- '519'
degree_awarded: PhD
department:
- _id: LaEr
doi: 10.15479/AT:ISTA:TH_1040
ec_funded: 1
file:
- access_level: open_access
checksum: d4dad55a7513f345706aaaba90cb1bb8
content_type: application/pdf
creator: dernst
date_created: 2019-04-08T13:55:20Z
date_updated: 2020-07-14T12:44:57Z
file_id: '6241'
file_name: 2018_thesis_Alt.pdf
file_size: 5801709
relation: main_file
- access_level: closed
checksum: d73fcf46300dce74c403f2b491148ab4
content_type: application/zip
creator: dernst
date_created: 2019-04-08T13:55:20Z
date_updated: 2020-07-14T12:44:57Z
file_id: '6242'
file_name: 2018_thesis_Alt_source.zip
file_size: 3802059
relation: source_file
file_date_updated: 2020-07-14T12:44:57Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '456'
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7772'
pubrep_id: '1040'
related_material:
record:
- id: '6240'
relation: part_of_dissertation
status: public
- id: '6184'
relation: part_of_dissertation
status: public
- id: '566'
relation: part_of_dissertation
status: public
- id: '6183'
relation: part_of_dissertation
status: public
- id: '1010'
relation: part_of_dissertation
status: public
- id: '550'
relation: part_of_dissertation
status: public
- id: '1677'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
title: Dyson equation and eigenvalue statistics of random matrices
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2018'
...
---
_id: '566'
abstract:
- lang: eng
text: "We consider large random matrices X with centered, independent entries which
have comparable but not necessarily identical variances. Girko's circular law
asserts that the spectrum is supported in a disk and in case of identical variances,
the limiting density is uniform. In this special case, the local circular law
by Bourgade et. al. [11,12] shows that the empirical density converges even locally
on scales slightly above the typical eigenvalue spacing. In the general case,
the limiting density is typically inhomogeneous and it is obtained via solving
a system of deterministic equations. Our main result is the local inhomogeneous
circular law in the bulk spectrum on the optimal scale for a general variance
profile of the entries of X. \r\n\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Johannes
full_name: Alt, Johannes
id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
last_name: Alt
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
citation:
ama: Alt J, Erdös L, Krüger TH. Local inhomogeneous circular law. Annals Applied
Probability . 2018;28(1):148-203. doi:10.1214/17-AAP1302
apa: Alt, J., Erdös, L., & Krüger, T. H. (2018). Local inhomogeneous circular
law. Annals Applied Probability . Institute of Mathematical Statistics.
https://doi.org/10.1214/17-AAP1302
chicago: Alt, Johannes, László Erdös, and Torben H Krüger. “Local Inhomogeneous
Circular Law.” Annals Applied Probability . Institute of Mathematical Statistics,
2018. https://doi.org/10.1214/17-AAP1302.
ieee: J. Alt, L. Erdös, and T. H. Krüger, “Local inhomogeneous circular law,” Annals
Applied Probability , vol. 28, no. 1. Institute of Mathematical Statistics,
pp. 148–203, 2018.
ista: Alt J, Erdös L, Krüger TH. 2018. Local inhomogeneous circular law. Annals
Applied Probability . 28(1), 148–203.
mla: Alt, Johannes, et al. “Local Inhomogeneous Circular Law.” Annals Applied
Probability , vol. 28, no. 1, Institute of Mathematical Statistics, 2018,
pp. 148–203, doi:10.1214/17-AAP1302.
short: J. Alt, L. Erdös, T.H. Krüger, Annals Applied Probability 28 (2018) 148–203.
corr_author: '1'
date_created: 2018-12-11T11:47:13Z
date_published: 2018-03-03T00:00:00Z
date_updated: 2026-04-08T14:11:36Z
day: '03'
department:
- _id: LaEr
doi: 10.1214/17-AAP1302
ec_funded: 1
external_id:
arxiv:
- '1612.07776 '
isi:
- '000431721800005'
intvolume: ' 28'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'https://arxiv.org/abs/1612.07776 '
month: '03'
oa: 1
oa_version: Preprint
page: 148-203
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: 'Annals Applied Probability '
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
related_material:
record:
- id: '149'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Local inhomogeneous circular law
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 28
year: '2018'
...
---
_id: '6183'
abstract:
- lang: eng
text: "We study the unique solution $m$ of the Dyson equation \\[ -m(z)^{-1} = z
- a\r\n+ S[m(z)] \\] on a von Neumann algebra $\\mathcal{A}$ with the constraint\r\n$\\mathrm{Im}\\,m\\geq
0$. Here, $z$ lies in the complex upper half-plane, $a$ is\r\na self-adjoint element
of $\\mathcal{A}$ and $S$ is a positivity-preserving\r\nlinear operator on $\\mathcal{A}$.
We show that $m$ is the Stieltjes transform\r\nof a compactly supported $\\mathcal{A}$-valued
measure on $\\mathbb{R}$. Under\r\nsuitable assumptions, we establish that this
measure has a uniformly\r\n$1/3$-H\\\"{o}lder continuous density with respect
to the Lebesgue measure, which\r\nis supported on finitely many intervals, called
bands. In fact, the density is\r\nanalytic inside the bands with a square-root
growth at the edges and internal\r\ncubic root cusps whenever the gap between
two bands vanishes. The shape of\r\nthese singularities is universal and no other
singularity may occur. We give a\r\nprecise asymptotic description of $m$ near
the singular points. These\r\nasymptotics generalize the analysis at the regular
edges given in the companion\r\npaper on the Tracy-Widom universality for the
edge eigenvalue statistics for\r\ncorrelated random matrices [arXiv:1804.07744]
and they play a key role in the\r\nproof of the Pearcey universality at the cusp
for Wigner-type matrices\r\n[arXiv:1809.03971,arXiv:1811.04055]. We also extend
the finite dimensional band\r\nmass formula from [arXiv:1804.07744] to the von
Neumann algebra setting by\r\nshowing that the spectral mass of the bands is topologically
rigid under\r\ndeformations and we conclude that these masses are quantized in
some important\r\ncases."
acknowledgement: "Partially funded by ERC Advanced Grant RANMAT No. 338804.\r\nPartially
supported by the Hausdorff Center for Mathematics.\r\n"
article_number: '1804.07752'
article_processing_charge: No
arxiv: 1
author:
- first_name: Johannes
full_name: Alt, Johannes
id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
last_name: Alt
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
citation:
ama: 'Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral
bands, edges and cusps. arXiv. doi:10.48550/arXiv.1804.07752'
apa: 'Alt, J., Erdös, L., & Krüger, T. H. (n.d.). The Dyson equation with linear
self-energy: Spectral bands, edges and cusps. arXiv. https://doi.org/10.48550/arXiv.1804.07752'
chicago: 'Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation
with Linear Self-Energy: Spectral Bands, Edges and Cusps.” ArXiv, n.d.
https://doi.org/10.48550/arXiv.1804.07752.'
ieee: 'J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy:
Spectral bands, edges and cusps,” arXiv. .'
ista: 'Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral
bands, edges and cusps. arXiv, 1804.07752.'
mla: 'Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral
Bands, Edges and Cusps.” ArXiv, 1804.07752, doi:10.48550/arXiv.1804.07752.'
short: J. Alt, L. Erdös, T.H. Krüger, ArXiv (n.d.).
date_created: 2019-03-28T09:20:06Z
date_published: 2018-04-20T00:00:00Z
date_updated: 2026-04-08T14:11:36Z
day: '20'
department:
- _id: LaEr
doi: 10.48550/arXiv.1804.07752
ec_funded: 1
external_id:
arxiv:
- '1804.07752'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.07752
month: '04'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: arXiv
publication_status: draft
related_material:
record:
- id: '14694'
relation: later_version
status: public
- id: '149'
relation: dissertation_contains
status: public
status: public
title: 'The Dyson equation with linear self-energy: Spectral bands, edges and cusps'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
OA_place: publisher
_id: '418'
abstract:
- lang: eng
text: "The aim of this thesis was the development of new strategies for optical
and optogenetic control of proliferative and pro-survival signaling, and characterizing
them from the molecular mechanism up to cellular effects. These new light-based
methods have unique features, such as red light as an activator, or the avoidance
of gene delivery, which enable to overcome current limitations, such as light
delivery to target tissues and feasibility as therapeutic approach. A special
focus was placed on implementing these new light-based approaches in pancreatic
β-cells, as β-cells are the key players in diabetes and especially their loss
in number negatively affects disease progression. Currently no treatment options
are available to compensate the lack of functional β-cells in diabetic patients.\r\nIn
a first approach, red-light-activated growth factor receptors, in particular receptor
tyrosine kinases were engineered and characterized. Receptor activation with light
allows spatio-temporal control compared to ligand-based activation, and especially
red light exhibits deeper tissue penetration than other wavelengths of the visible
spectrum. Red-light-activated receptor tyrosine kinases robustly activated major
growth factor related signaling pathways with a high temporal resolution. Moreover,
the remote activation of the proliferative MAPK/Erk pathway by red-light-activated
receptor tyrosine kinases in a pancreatic β-cell line was also achieved, through
one centimeter thick mouse tissue. Although red-light-activated receptor tyrosine
kinases are particularly attractive for applications in animal models due to the
deep tissue penetration of red light, a drawback, especially with regard to translation
into humans, is the requirement of gene therapy.\r\nIn a second approach an endogenous
light-sensitive mechanism was identified and its potential to promote proliferative
and pro-survival signals was explored, towards light-based tissue regeneration
without the need for gene transfer. Blue-green light illumination was found to
be sufficient for the activation of proliferation and survival promoting signaling
pathways in primary pancreatic murine and human islets. Blue-green light also
led to an increase in proliferation of primary islet cells, an effect which was
shown to be mostly β-cell specific in human islets. Moreover, it was demonstrated
that this approach of pancreatic β-cell expansion did not have any negative effect
on the β-cell function, in particular on their insulin secretion capacity. In
contrast, a trend for enhanced insulin secretion under high glucose conditions
after illumination was detected. In order to unravel the detailed characteristics
of this endogenous light-sensitive mechanism, the precise light requirements were
determined. In addition, the expression of light sensing proteins, OPN3 and rhodopsin,
was detected. The observed effects were found to be independent of handling effects
such as temperature differences and cytochrome c oxidase dependent ATP increase,
but they were found to be enhanced through the knockout of OPN3. The exact mechanism
of how islets cells sense light and the identity of the photoreceptor remains
unknown.\r\nSummarized two new light-based systems with unique features were established
that enable the activation of proliferative and pro-survival signaling pathways.
While red-light-activated receptor tyrosine kinases open a new avenue for optogenetics
research, by allowing non-invasive control of signaling in vivo, the identified
endogenous light-sensitive mechanism has the potential to be the basis of a gene
therapy-free therapeutical approach for light-based β-cell expansion."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Eva
full_name: Gschaider-Reichhart, Eva
id: 3FEE232A-F248-11E8-B48F-1D18A9856A87
last_name: Gschaider-Reichhart
orcid: 0000-0002-7218-7738
citation:
ama: Gschaider-Reichhart E. Optical and optogenetic control of proliferation and
survival . 2018. doi:10.15479/AT:ISTA:th_913
apa: Gschaider-Reichhart, E. (2018). Optical and optogenetic control of proliferation
and survival . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_913
chicago: Gschaider-Reichhart, Eva. “Optical and Optogenetic Control of Proliferation
and Survival .” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_913.
ieee: E. Gschaider-Reichhart, “Optical and optogenetic control of proliferation
and survival ,” Institute of Science and Technology Austria, 2018.
ista: Gschaider-Reichhart E. 2018. Optical and optogenetic control of proliferation
and survival . Institute of Science and Technology Austria.
mla: Gschaider-Reichhart, Eva. Optical and Optogenetic Control of Proliferation
and Survival . Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_913.
short: E. Gschaider-Reichhart, Optical and Optogenetic Control of Proliferation
and Survival , Institute of Science and Technology Austria, 2018.
corr_author: '1'
date_created: 2018-12-11T11:46:22Z
date_published: 2018-01-08T00:00:00Z
date_updated: 2026-04-08T14:11:54Z
day: '08'
ddc:
- '571'
- '570'
degree_awarded: PhD
department:
- _id: HaJa
doi: 10.15479/AT:ISTA:th_913
file:
- access_level: closed
checksum: 697fa72ca36fb1b8ceabc133d58a73e5
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T09:28:03Z
date_updated: 2020-07-14T12:46:24Z
file_id: '6222'
file_name: 2018_THESIS_Gschaider-Reichhart_source.docx
file_size: 7012495
relation: source_file
- access_level: open_access
checksum: 58d7d1e9e58aeb7f061ab686b1d8a48c
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T09:28:03Z
date_updated: 2020-07-14T12:46:24Z
file_id: '6223'
file_name: 2018_THESIS_Gschaider-Reichhart.pdf
file_size: 6355280
relation: main_file
file_date_updated: 2020-07-14T12:46:24Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '107'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7405'
pubrep_id: '913'
related_material:
record:
- id: '1678'
relation: part_of_dissertation
status: public
- id: '1028'
relation: part_of_dissertation
status: public
- id: '1441'
relation: part_of_dissertation
status: public
- id: '2084'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
title: 'Optical and optogenetic control of proliferation and survival '
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2018'
...
---
_id: '616'
abstract:
- lang: eng
text: Social insects protect their colonies from infectious disease through collective
defences that result in social immunity. In ants, workers first try to prevent
infection of colony members. Here, we show that if this fails and a pathogen establishes
an infection, ants employ an efficient multicomponent behaviour − "destructive
disinfection" − to prevent further spread of disease through the colony.
Ants specifically target infected pupae during the pathogen's non-contagious incubation
period, relying on chemical 'sickness cues' emitted by pupae. They then remove
the pupal cocoon, perforate its cuticle and administer antimicrobial poison, which
enters the body and prevents pathogen replication from the inside out. Like the
immune system of a body that specifically targets and eliminates infected cells,
this social immunity measure sacrifices infected brood to stop the pathogen completing
its lifecycle, thus protecting the rest of the colony. Hence, the same principles
of disease defence apply at different levels of biological organisation.
article_number: e32073
article_processing_charge: Yes
author:
- first_name: Christopher
full_name: Pull, Christopher
id: 3C7F4840-F248-11E8-B48F-1D18A9856A87
last_name: Pull
orcid: 0000-0003-1122-3982
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Florian
full_name: Wiesenhofer, Florian
id: 39523C54-F248-11E8-B48F-1D18A9856A87
last_name: Wiesenhofer
- first_name: Anna V
full_name: Grasse, Anna V
id: 406F989C-F248-11E8-B48F-1D18A9856A87
last_name: Grasse
- first_name: Simon
full_name: Tragust, Simon
id: 35A7A418-F248-11E8-B48F-1D18A9856A87
last_name: Tragust
- first_name: Thomas
full_name: Schmitt, Thomas
last_name: Schmitt
- first_name: Mark
full_name: Brown, Mark
last_name: Brown
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Pull C, Ugelvig LV, Wiesenhofer F, et al. Destructive disinfection of infected
brood prevents systemic disease spread in ant colonies. eLife. 2018;7.
doi:10.7554/eLife.32073
apa: Pull, C., Ugelvig, L. V., Wiesenhofer, F., Grasse, A. V., Tragust, S., Schmitt,
T., … Cremer, S. (2018). Destructive disinfection of infected brood prevents systemic
disease spread in ant colonies. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.32073
chicago: Pull, Christopher, Line V Ugelvig, Florian Wiesenhofer, Anna V Grasse,
Simon Tragust, Thomas Schmitt, Mark Brown, and Sylvia Cremer. “Destructive Disinfection
of Infected Brood Prevents Systemic Disease Spread in Ant Colonies.” ELife.
eLife Sciences Publications, 2018. https://doi.org/10.7554/eLife.32073.
ieee: C. Pull et al., “Destructive disinfection of infected brood prevents
systemic disease spread in ant colonies,” eLife, vol. 7. eLife Sciences
Publications, 2018.
ista: Pull C, Ugelvig LV, Wiesenhofer F, Grasse AV, Tragust S, Schmitt T, Brown
M, Cremer S. 2018. Destructive disinfection of infected brood prevents systemic
disease spread in ant colonies. eLife. 7, e32073.
mla: Pull, Christopher, et al. “Destructive Disinfection of Infected Brood Prevents
Systemic Disease Spread in Ant Colonies.” ELife, vol. 7, e32073, eLife
Sciences Publications, 2018, doi:10.7554/eLife.32073.
short: C. Pull, L.V. Ugelvig, F. Wiesenhofer, A.V. Grasse, S. Tragust, T. Schmitt,
M. Brown, S. Cremer, ELife 7 (2018).
corr_author: '1'
date_created: 2018-12-11T11:47:31Z
date_published: 2018-01-09T00:00:00Z
date_updated: 2026-04-08T14:19:10Z
day: '09'
ddc:
- '570'
- '590'
department:
- _id: SyCr
doi: 10.7554/eLife.32073
ec_funded: 1
external_id:
isi:
- '000419601300001'
file:
- access_level: open_access
checksum: 540f941e8d3530a9441e4affd94f07d7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:43Z
date_updated: 2020-07-14T12:47:20Z
file_id: '4832'
file_name: IST-2018-978-v1+1_elife-32073-v1.pdf
file_size: 1435585
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 7'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25DC711C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '243071'
name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society
Effects'
- _id: 25DDF0F0-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '302004'
name: 'Collective disease defence and pathogen detection abilities in ant societies:
a chemo-neuro-immunological approach'
publication: eLife
publication_status: published
publisher: eLife Sciences Publications
publist_id: '7188'
pubrep_id: '978'
quality_controlled: '1'
related_material:
record:
- id: '819'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Destructive disinfection of infected brood prevents systemic disease spread
in ant colonies
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7
year: '2018'
...
---
_id: '87'
abstract:
- lang: eng
text: Using the geodesic distance on the n-dimensional sphere, we study the expected
radius function of the Delaunay mosaic of a random set of points. Specifically,
we consider the partition of the mosaic into intervals of the radius function
and determine the expected number of intervals whose radii are less than or equal
to a given threshold. We find that the expectations are essentially the same as
for the Poisson–Delaunay mosaic in n-dimensional Euclidean space. Assuming the
points are not contained in a hemisphere, the Delaunay mosaic is isomorphic to
the boundary complex of the convex hull in Rn+1, so we also get the expected number
of faces of a random inscribed polytope. As proved in Antonelli et al. [Adv. in
Appl. Probab. 9–12 (1977–1980)], an orthant section of the n-sphere is isometric
to the standard n-simplex equipped with the Fisher information metric. It follows
that the latter space has similar stochastic properties as the n-dimensional Euclidean
space. Our results are therefore relevant in information geometry and in population
genetics.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Anton
full_name: Nikitenko, Anton
id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87
last_name: Nikitenko
orcid: 0000-0002-0659-3201
citation:
ama: Edelsbrunner H, Nikitenko A. Random inscribed polytopes have similar radius
functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 2018;28(5):3215-3238.
doi:10.1214/18-AAP1389
apa: Edelsbrunner, H., & Nikitenko, A. (2018). Random inscribed polytopes have
similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability.
Institute of Mathematical Statistics. https://doi.org/10.1214/18-AAP1389
chicago: Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes
Have Similar Radius Functions as Poisson-Delaunay Mosaics.” Annals of Applied
Probability. Institute of Mathematical Statistics, 2018. https://doi.org/10.1214/18-AAP1389.
ieee: H. Edelsbrunner and A. Nikitenko, “Random inscribed polytopes have similar
radius functions as Poisson-Delaunay mosaics,” Annals of Applied Probability,
vol. 28, no. 5. Institute of Mathematical Statistics, pp. 3215–3238, 2018.
ista: Edelsbrunner H, Nikitenko A. 2018. Random inscribed polytopes have similar
radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 28(5),
3215–3238.
mla: Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have
Similar Radius Functions as Poisson-Delaunay Mosaics.” Annals of Applied Probability,
vol. 28, no. 5, Institute of Mathematical Statistics, 2018, pp. 3215–38, doi:10.1214/18-AAP1389.
short: H. Edelsbrunner, A. Nikitenko, Annals of Applied Probability 28 (2018) 3215–3238.
date_created: 2018-12-11T11:44:33Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2026-04-08T14:19:30Z
day: '01'
department:
- _id: HeEd
doi: 10.1214/18-AAP1389
external_id:
arxiv:
- '1705.02870'
isi:
- '000442893500018'
intvolume: ' 28'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.02870
month: '10'
oa: 1
oa_version: Preprint
page: 3215 - 3238
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: Annals of Applied Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '7967'
quality_controlled: '1'
related_material:
record:
- id: '6287'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Random inscribed polytopes have similar radius functions as Poisson-Delaunay
mosaics
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 28
year: '2018'
...
---
_id: '806'
abstract:
- lang: eng
text: Social insect colonies have evolved many collectively performed adaptations
that reduce the impact of infectious disease and that are expected to maximize
their fitness. This colony-level protection is termed social immunity, and it
enhances the health and survival of the colony. In this review, we address how
social immunity emerges from its mechanistic components to produce colony-level
disease avoidance, resistance, and tolerance. To understand the evolutionary causes
and consequences of social immunity, we highlight the need for studies that evaluate
the effects of social immunity on colony fitness. We discuss the role that host
life history and ecology have on predicted eco-evolutionary dynamics, which differ
among the social insect lineages. Throughout the review, we highlight current
gaps in our knowledge and promising avenues for future research, which we hope
will bring us closer to an integrated understanding of socio-eco-evo-immunology.
article_processing_charge: No
author:
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Christopher
full_name: Pull, Christopher
id: 3C7F4840-F248-11E8-B48F-1D18A9856A87
last_name: Pull
orcid: 0000-0003-1122-3982
- first_name: Matthias
full_name: Fürst, Matthias
id: 393B1196-F248-11E8-B48F-1D18A9856A87
last_name: Fürst
orcid: 0000-0002-3712-925X
citation:
ama: 'Cremer S, Pull C, Fürst M. Social immunity: Emergence and evolution of colony-level
disease protection. Annual Review of Entomology. 2018;63:105-123. doi:10.1146/annurev-ento-020117-043110'
apa: 'Cremer, S., Pull, C., & Fürst, M. (2018). Social immunity: Emergence and
evolution of colony-level disease protection. Annual Review of Entomology.
Annual Reviews. https://doi.org/10.1146/annurev-ento-020117-043110'
chicago: 'Cremer, Sylvia, Christopher Pull, and Matthias Fürst. “Social Immunity:
Emergence and Evolution of Colony-Level Disease Protection.” Annual Review
of Entomology. Annual Reviews, 2018. https://doi.org/10.1146/annurev-ento-020117-043110.'
ieee: 'S. Cremer, C. Pull, and M. Fürst, “Social immunity: Emergence and evolution
of colony-level disease protection,” Annual Review of Entomology, vol.
63. Annual Reviews, pp. 105–123, 2018.'
ista: 'Cremer S, Pull C, Fürst M. 2018. Social immunity: Emergence and evolution
of colony-level disease protection. Annual Review of Entomology. 63, 105–123.'
mla: 'Cremer, Sylvia, et al. “Social Immunity: Emergence and Evolution of Colony-Level
Disease Protection.” Annual Review of Entomology, vol. 63, Annual Reviews,
2018, pp. 105–23, doi:10.1146/annurev-ento-020117-043110.'
short: S. Cremer, C. Pull, M. Fürst, Annual Review of Entomology 63 (2018) 105–123.
corr_author: '1'
date_created: 2018-12-11T11:48:36Z
date_published: 2018-01-07T00:00:00Z
date_updated: 2026-04-08T14:19:10Z
day: '07'
department:
- _id: SyCr
doi: 10.1146/annurev-ento-020117-043110
external_id:
isi:
- '000424633700008'
intvolume: ' 63'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 105 - 123
publication: Annual Review of Entomology
publication_identifier:
issn:
- 1545-4487
publication_status: published
publisher: Annual Reviews
publist_id: '6844'
quality_controlled: '1'
related_material:
record:
- id: '819'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Social immunity: Emergence and evolution of colony-level disease protection'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 63
year: '2018'
...
---
_id: '457'
abstract:
- lang: eng
text: Temperate bacteriophages integrate in bacterial genomes as prophages and represent
an important source of genetic variation for bacterial evolution, frequently transmitting
fitness-augmenting genes such as toxins responsible for virulence of major pathogens.
However, only a fraction of bacteriophage infections are lysogenic and lead to
prophage acquisition, whereas the majority are lytic and kill the infected bacteria.
Unless able to discriminate lytic from lysogenic infections, mechanisms of immunity
to bacteriophages are expected to act as a double-edged sword and increase the
odds of survival at the cost of depriving bacteria of potentially beneficial prophages.
We show that although restriction-modification systems as mechanisms of innate
immunity prevent both lytic and lysogenic infections indiscriminately in individual
bacteria, they increase the number of prophage-acquiring individuals at the population
level. We find that this counterintuitive result is a consequence of phage-host
population dynamics, in which restriction-modification systems delay infection
onset until bacteria reach densities at which the probability of lysogeny increases.
These results underscore the importance of population-level dynamics as a key
factor modulating costs and benefits of immunity to temperate bacteriophages
article_processing_charge: No
author:
- first_name: Maros
full_name: Pleska, Maros
id: 4569785E-F248-11E8-B48F-1D18A9856A87
last_name: Pleska
orcid: 0000-0001-7460-7479
- first_name: Moritz
full_name: Lang, Moritz
id: 29E0800A-F248-11E8-B48F-1D18A9856A87
last_name: Lang
- first_name: Dominik
full_name: Refardt, Dominik
last_name: Refardt
- first_name: Bruce
full_name: Levin, Bruce
last_name: Levin
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Pleska M, Lang M, Refardt D, Levin B, Guet CC. Phage-host population dynamics
promotes prophage acquisition in bacteria with innate immunity. Nature Ecology
and Evolution. 2018;2(2):359-366. doi:10.1038/s41559-017-0424-z
apa: Pleska, M., Lang, M., Refardt, D., Levin, B., & Guet, C. C. (2018). Phage-host
population dynamics promotes prophage acquisition in bacteria with innate immunity.
Nature Ecology and Evolution. Springer Nature. https://doi.org/10.1038/s41559-017-0424-z
chicago: Pleska, Maros, Moritz Lang, Dominik Refardt, Bruce Levin, and Calin C Guet.
“Phage-Host Population Dynamics Promotes Prophage Acquisition in Bacteria with
Innate Immunity.” Nature Ecology and Evolution. Springer Nature, 2018.
https://doi.org/10.1038/s41559-017-0424-z.
ieee: M. Pleska, M. Lang, D. Refardt, B. Levin, and C. C. Guet, “Phage-host population
dynamics promotes prophage acquisition in bacteria with innate immunity,” Nature
Ecology and Evolution, vol. 2, no. 2. Springer Nature, pp. 359–366, 2018.
ista: Pleska M, Lang M, Refardt D, Levin B, Guet CC. 2018. Phage-host population
dynamics promotes prophage acquisition in bacteria with innate immunity. Nature
Ecology and Evolution. 2(2), 359–366.
mla: Pleska, Maros, et al. “Phage-Host Population Dynamics Promotes Prophage Acquisition
in Bacteria with Innate Immunity.” Nature Ecology and Evolution, vol. 2,
no. 2, Springer Nature, 2018, pp. 359–66, doi:10.1038/s41559-017-0424-z.
short: M. Pleska, M. Lang, D. Refardt, B. Levin, C.C. Guet, Nature Ecology and Evolution
2 (2018) 359–366.
corr_author: '1'
date_created: 2018-12-11T11:46:35Z
date_published: 2018-02-01T00:00:00Z
date_updated: 2026-04-08T14:19:43Z
day: '01'
department:
- _id: CaGu
- _id: GaTk
doi: 10.1038/s41559-017-0424-z
ec_funded: 1
external_id:
isi:
- '000426516400027'
intvolume: ' 2'
isi: 1
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 359 - 366
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 251BCBEC-B435-11E9-9278-68D0E5697425
grant_number: RGY0079/2011
name: Multi-Level Conflicts in Evolutionary Dynamics of Restriction-Modification
Systems
- _id: 251D65D8-B435-11E9-9278-68D0E5697425
grant_number: '24210'
name: Effects of Stochasticity on the Function of Restriction-Modi cation Systems
at the Single-Cell Level
publication: Nature Ecology and Evolution
publication_status: published
publisher: Springer Nature
publist_id: '7364'
quality_controlled: '1'
related_material:
record:
- id: '202'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Phage-host population dynamics promotes prophage acquisition in bacteria with
innate immunity
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2
year: '2018'
...
---
_id: '433'
abstract:
- lang: eng
text: 'A thrackle is a graph drawn in the plane so that every pair of its edges
meet exactly once: either at a common end vertex or in a proper crossing. We prove
that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are
defined similarly, except that every pair of edges that do not share a vertex
are allowed to cross an odd number of times. It is also shown that the maximum
number of edges of a quasi-thrackle on n vertices is 3/2(n-1), and that this bound
is best possible for infinitely many values of n.'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: János
full_name: Pach, János
last_name: Pach
citation:
ama: 'Fulek R, Pach J. Thrackles: An improved upper bound. In: Vol 10692. Springer;
2018:160-166. doi:10.1007/978-3-319-73915-1_14'
apa: 'Fulek, R., & Pach, J. (2018). Thrackles: An improved upper bound (Vol.
10692, pp. 160–166). Presented at the GD: Graph Drawing and Network Visualization,
Boston, MA, United States: Springer. https://doi.org/10.1007/978-3-319-73915-1_14'
chicago: 'Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound,”
10692:160–66. Springer, 2018. https://doi.org/10.1007/978-3-319-73915-1_14.'
ieee: 'R. Fulek and J. Pach, “Thrackles: An improved upper bound,” presented at
the GD: Graph Drawing and Network Visualization, Boston, MA, United States, 2018,
vol. 10692, pp. 160–166.'
ista: 'Fulek R, Pach J. 2018. Thrackles: An improved upper bound. GD: Graph Drawing
and Network Visualization, LNCS, vol. 10692, 160–166.'
mla: 'Fulek, Radoslav, and János Pach. Thrackles: An Improved Upper Bound.
Vol. 10692, Springer, 2018, pp. 160–66, doi:10.1007/978-3-319-73915-1_14.'
short: R. Fulek, J. Pach, in:, Springer, 2018, pp. 160–166.
conference:
end_date: 2017-09-27
location: Boston, MA, United States
name: 'GD: Graph Drawing and Network Visualization'
start_date: 201-09-25
corr_author: '1'
date_created: 2018-12-11T11:46:27Z
date_published: 2018-01-21T00:00:00Z
date_updated: 2026-04-16T09:48:11Z
day: '21'
department:
- _id: UlWa
doi: 10.1007/978-3-319-73915-1_14
external_id:
arxiv:
- '1708.08037'
intvolume: ' 10692'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.08037
month: '01'
oa: 1
oa_version: Submitted Version
page: 160 - 166
publication_status: published
publisher: Springer
publist_id: '7390'
quality_controlled: '1'
related_material:
record:
- id: '5857'
relation: later_version
status: public
scopus_import: '1'
status: public
title: 'Thrackles: An improved upper bound'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10692
year: '2018'
...
---
_id: '536'
abstract:
- lang: eng
text: 'We consider the problem of consensus in the challenging classic model. In
this model, the adversary is adaptive; it can choose which processors crash at
any point during the course of the algorithm. Further, communication is via asynchronous
message passing: there is no known upper bound on the time to send a message from
one processor to another, and all messages and coin flips are seen by the adversary.
We describe a new randomized consensus protocol with expected message complexity
O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear
improvement over the best previously known protocol, and within logarithmic factors
of a known Ω(n2) message lower bound. The protocol further ensures that no process
sends more than O(nlog3n) messages in expectation, which is again within logarithmic
factors of optimal. We also present a generalization of the algorithm to an arbitrary
number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach
is to build a message-efficient, resilient mechanism for aggregating individual
processor votes, implementing the message-passing equivalent of a weak shared
coin. Roughly, in our protocol, a processor first announces its votes to small
groups, then propagates them to increasingly larger groups as it generates more
and more votes. To bound the number of messages that an individual process might
have to send or receive, the protocol progressively increases the weight of generated
votes. The main technical challenge is bounding the impact of votes that are still
“in flight” (generated, but not fully propagated) on the final outcome of the
shared coin, especially since such votes might have different weights. We achieve
this by leveraging the structure of the algorithm, and a technical argument based
on martingale concentration bounds. Overall, we show that it is possible to build
an efficient message-passing implementation of a shared coin, and in the process
(almost-optimally) solve the classic consensus problem in the asynchronous message-passing
model.'
article_processing_charge: Yes (via OA deal)
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Valerie
full_name: King, Valerie
last_name: King
- first_name: Jared
full_name: Saia, Jared
last_name: Saia
citation:
ama: Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized
consensus. Distributed Computing. 2018;31(6):489-501. doi:10.1007/s00446-017-0315-1
apa: Alistarh, D.-A., Aspnes, J., King, V., & Saia, J. (2018). Communication-efficient
randomized consensus. Distributed Computing. Springer. https://doi.org/10.1007/s00446-017-0315-1
chicago: Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient
Randomized Consensus.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-017-0315-1.
ieee: D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient
randomized consensus,” Distributed Computing, vol. 31, no. 6. Springer,
pp. 489–501, 2018.
ista: Alistarh D-A, Aspnes J, King V, Saia J. 2018. Communication-efficient randomized
consensus. Distributed Computing. 31(6), 489–501.
mla: Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.”
Distributed Computing, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:10.1007/s00446-017-0315-1.
short: D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018)
489–501.
corr_author: '1'
date_created: 2018-12-11T11:47:01Z
date_published: 2018-11-01T00:00:00Z
date_updated: 2026-04-16T09:53:54Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1007/s00446-017-0315-1
external_id:
isi:
- '000443832300005'
file:
- access_level: open_access
checksum: 69b46e537acdcac745237ddb853fcbb5
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T07:25:51Z
date_updated: 2020-07-14T12:46:38Z
file_id: '5867'
file_name: 2017_DistribComp_Alistarh.pdf
file_size: 595707
relation: main_file
file_date_updated: 2020-07-14T12:46:38Z
has_accepted_license: '1'
intvolume: ' 31'
isi: 1
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 489-501
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Distributed Computing
publication_identifier:
issn:
- 0178-2770
publication_status: published
publisher: Springer
publist_id: '7281'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Communication-efficient randomized consensus
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 31
year: '2018'
...
---
_id: '85'
abstract:
- lang: eng
text: Concurrent accesses to shared data structures must be synchronized to avoid
data races. Coarse-grained synchronization, which locks the entire data structure,
is easy to implement but does not scale. Fine-grained synchronization can scale
well, but can be hard to reason about. Hand-over-hand locking, in which operations
are pipelined as they traverse the data structure, combines fine-grained synchronization
with ease of use. However, the traditional implementation suffers from inherent
overheads. This paper introduces snapshot-based synchronization (SBS), a novel
hand-over-hand locking mechanism. SBS decouples the synchronization state from
the data, significantly improving cache utilization. Further, it relies on guarantees
provided by pipelining to minimize synchronization that requires cross-thread
communication. Snapshot-based synchronization thus scales much better than traditional
hand-over-hand locking, while maintaining the same ease of use.
acknowledgement: Trevor Brown was supported in part by the ISF (grants 2005/17 & 1749/14)
and by a NSERC post-doctoral fellowship.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Eran
full_name: Gilad, Eran
last_name: Gilad
- first_name: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Mark
full_name: Oskin, Mark
last_name: Oskin
- first_name: Yoav
full_name: Etsion, Yoav
last_name: Etsion
citation:
ama: 'Gilad E, Brown TA, Oskin M, Etsion Y. Snapshot based synchronization: A fast
replacement for Hand-over-Hand locking. In: Vol 11014. Springer; 2018:465-479.
doi:10.1007/978-3-319-96983-1_33'
apa: 'Gilad, E., Brown, T. A., Oskin, M., & Etsion, Y. (2018). Snapshot based
synchronization: A fast replacement for Hand-over-Hand locking (Vol. 11014, pp.
465–479). Presented at the Euro-Par: European Conference on Parallel Processing,
Turin, Italy: Springer. https://doi.org/10.1007/978-3-319-96983-1_33'
chicago: 'Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based
Synchronization: A Fast Replacement for Hand-over-Hand Locking,” 11014:465–79.
Springer, 2018. https://doi.org/10.1007/978-3-319-96983-1_33.'
ieee: 'E. Gilad, T. A. Brown, M. Oskin, and Y. Etsion, “Snapshot based synchronization:
A fast replacement for Hand-over-Hand locking,” presented at the Euro-Par: European
Conference on Parallel Processing, Turin, Italy, 2018, vol. 11014, pp. 465–479.'
ista: 'Gilad E, Brown TA, Oskin M, Etsion Y. 2018. Snapshot based synchronization:
A fast replacement for Hand-over-Hand locking. Euro-Par: European Conference on
Parallel Processing, LNCS, vol. 11014, 465–479.'
mla: 'Gilad, Eran, et al. Snapshot Based Synchronization: A Fast Replacement
for Hand-over-Hand Locking. Vol. 11014, Springer, 2018, pp. 465–79, doi:10.1007/978-3-319-96983-1_33.'
short: E. Gilad, T.A. Brown, M. Oskin, Y. Etsion, in:, Springer, 2018, pp. 465–479.
conference:
end_date: 2018-08-31
location: Turin, Italy
name: 'Euro-Par: European Conference on Parallel Processing'
start_date: 2018-08-27
date_created: 2018-12-11T11:44:33Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2026-04-16T09:53:41Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1007/978-3-319-96983-1_33
external_id:
isi:
- '000851042300031'
file:
- access_level: open_access
checksum: 13a3f250be8878405e791b53c19722ad
content_type: application/pdf
creator: dernst
date_created: 2019-02-12T07:40:40Z
date_updated: 2020-07-14T12:48:14Z
file_id: '5954'
file_name: 2018_Brown.pdf
file_size: 665372
relation: main_file
file_date_updated: 2020-07-14T12:48:14Z
has_accepted_license: '1'
intvolume: ' 11014'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Preprint
page: 465 - 479
project:
- _id: 26450934-B435-11E9-9278-68D0E5697425
name: NSERC Postdoctoral fellowship
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '7969'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Snapshot based synchronization: A fast replacement for Hand-over-Hand locking'
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 11014
year: '2018'
...
---
_id: '312'
abstract:
- lang: eng
text: Motivated by biological questions, we study configurations of equal spheres
that neither pack nor cover. Placing their centers on a lattice, we define the
soft density of the configuration by penalizing multiple overlaps. Considering
the 1-parameter family of diagonally distorted 3-dimensional integer lattices,
we show that the soft density is maximized at the FCC lattice.
acknowledgement: This work was partially supported by the DFG Collaborative Research
Center TRR 109, “Discretization in Geometry and Dynamics,” through grant I02979-N35
of the Austrian Science Fund (FWF).
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Mabel
full_name: Iglesias Ham, Mabel
id: 41B58C0C-F248-11E8-B48F-1D18A9856A87
last_name: Iglesias Ham
citation:
ama: Edelsbrunner H, Iglesias Ham M. On the optimality of the FCC lattice for soft
sphere packing. SIAM J Discrete Math. 2018;32(1):750-782. doi:10.1137/16M1097201
apa: Edelsbrunner, H., & Iglesias Ham, M. (2018). On the optimality of the FCC
lattice for soft sphere packing. SIAM J Discrete Math. Society for Industrial
and Applied Mathematics . https://doi.org/10.1137/16M1097201
chicago: Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the
FCC Lattice for Soft Sphere Packing.” SIAM J Discrete Math. Society for
Industrial and Applied Mathematics , 2018. https://doi.org/10.1137/16M1097201.
ieee: H. Edelsbrunner and M. Iglesias Ham, “On the optimality of the FCC lattice
for soft sphere packing,” SIAM J Discrete Math, vol. 32, no. 1. Society
for Industrial and Applied Mathematics , pp. 750–782, 2018.
ista: Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice
for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.
mla: Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC
Lattice for Soft Sphere Packing.” SIAM J Discrete Math, vol. 32, no. 1,
Society for Industrial and Applied Mathematics , 2018, pp. 750–82, doi:10.1137/16M1097201.
short: H. Edelsbrunner, M. Iglesias Ham, SIAM J Discrete Math 32 (2018) 750–782.
date_created: 2018-12-11T11:45:46Z
date_published: 2018-03-29T00:00:00Z
date_updated: 2026-04-16T09:53:02Z
day: '29'
department:
- _id: HeEd
doi: 10.1137/16M1097201
external_id:
isi:
- '000428958900038'
intvolume: ' 32'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://pdfs.semanticscholar.org/d2d5/6da00fbc674e6a8b1bb9d857167e54200dc6.pdf
month: '03'
oa: 1
oa_version: Submitted Version
page: 750 - 782
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: SIAM J Discrete Math
publication_identifier:
issn:
- 0895-4801
publication_status: published
publisher: 'Society for Industrial and Applied Mathematics '
publist_id: '7553'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the optimality of the FCC lattice for soft sphere packing
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 32
year: '2018'
...
---
_id: '140'
abstract:
- lang: eng
text: Reachability analysis is difficult for hybrid automata with affine differential
equations, because the reach set needs to be approximated. Promising abstraction
techniques usually employ interval methods or template polyhedra. Interval methods
account for dense time and guarantee soundness, and there are interval-based tools
that overapproximate affine flowpipes. But interval methods impose bounded and
rigid shapes, which make refinement expensive and fixpoint detection difficult.
Template polyhedra, on the other hand, can be adapted flexibly and can be unbounded,
but sound template refinement for unbounded reachability analysis has been implemented
only for systems with piecewise constant dynamics. We capitalize on the advantages
of both techniques, combining interval arithmetic and template polyhedra, using
the former to abstract time and the latter to abstract space. During a CEGAR loop,
whenever a spurious error trajectory is found, we compute additional space constraints
and split time intervals, and use these space-time interpolants to eliminate the
counterexample. Space-time interpolation offers a lazy, flexible framework for
increasing precision while guaranteeing soundness, both for error avoidance and
fixpoint detection. To the best of out knowledge, this is the first abstraction
refinement scheme for the reachability analysis over unbounded and dense time
of affine hybrid systems, which is both sound and automatic. We demonstrate the
effectiveness of our algorithm with several benchmark examples, which cannot be
handled by other tools.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- 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: 'Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981.
Springer; 2018:468-486. doi:10.1007/978-3-319-96145-3_25'
apa: 'Frehse, G., Giacobbe, M., & Henzinger, T. A. (2018). Space-time interpolants
(Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification,
Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_25'
chicago: Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,”
10981:468–86. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_25.
ieee: 'G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented
at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981,
pp. 468–486.'
ista: 'Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer
Aided Verification, LNCS, vol. 10981, 468–486.'
mla: Frehse, Goran, et al. Space-Time Interpolants. Vol. 10981, Springer,
2018, pp. 468–86, doi:10.1007/978-3-319-96145-3_25.
short: G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.
conference:
end_date: 2018-07-17
location: Oxford, United Kingdom
name: 'CAV: Computer Aided Verification'
start_date: 2018-07-14
date_created: 2018-12-11T11:44:50Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2026-04-16T09:55:04Z
day: '18'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-319-96145-3_25
external_id:
isi:
- '000491481600025'
file:
- access_level: open_access
checksum: 6dca832f575d6b3f0ea9dff56f579142
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:53Z
date_updated: 2020-07-14T12:44:50Z
file_id: '5310'
file_name: IST-2018-1010-v1+1_space-time_interpolants.pdf
file_size: 563710
relation: main_file
file_date_updated: 2020-07-14T12:44:50Z
has_accepted_license: '1'
intvolume: ' 10981'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 468 - 486
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '7783'
pubrep_id: '1010'
quality_controlled: '1'
related_material:
record:
- id: '6894'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Space-time interpolants
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 10981
year: '2018'
...
---
_id: '5788'
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 or payoff of the game. Such
games are central in formal verification since they model the interaction between
a non-terminating system and its environment. We study bidding games in which
the players bid for the right to move the token. Two bidding rules have been defined.
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. While poorman reachability games have been studied before, we present,
for the first time, results on infinite-duration poorman games. A central quantity
in these games is the ratio between the two players’ initial budgets. The questions
we study concern a necessary and sufficient ratio with which a player can achieve
a goal. For reachability objectives, such threshold ratios are known to exist
for both bidding rules. We show that the properties of poorman reachability games
extend to complex qualitative objectives such as parity, similarly to the Richman
case. Our most interesting results concern quantitative poorman games, namely
poorman mean-payoff games, where we construct optimal strategies depending on
the initial ratio, by showing a connection with random-turn based games. The connection
in itself is interesting, because it does not hold for reachability poorman games.
We also solve the complexity problems that arise in poorman bidding games.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: 'Avni G, Henzinger TA, Ibsen-Jensen R. Infinite-duration poorman-bidding games.
In: Vol 11316. Springer; 2018:21-36. doi:10.1007/978-3-030-04612-5_2'
apa: 'Avni, G., Henzinger, T. A., & Ibsen-Jensen, R. (2018). Infinite-duration
poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International
Conference on Web and Internet Economics, WINE, Oxford, UK: Springer. https://doi.org/10.1007/978-3-030-04612-5_2'
chicago: Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration
Poorman-Bidding Games,” 11316:21–36. Springer, 2018. https://doi.org/10.1007/978-3-030-04612-5_2.
ieee: G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding
games,” presented at the 14th International Conference on Web and Internet Economics,
WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.
ista: Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding
games. 14th International Conference on Web and Internet Economics, WINE, LNCS,
vol. 11316, 21–36.
mla: Avni, Guy, et al. Infinite-Duration Poorman-Bidding Games. Vol. 11316,
Springer, 2018, pp. 21–36, doi:10.1007/978-3-030-04612-5_2.
short: G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.
conference:
end_date: 2018-12-17
location: Oxford, UK
name: 14th International Conference on Web and Internet Economics, WINE
start_date: 2018-12-15
date_created: 2018-12-30T22:59:14Z
date_published: 2018-11-21T00:00:00Z
date_updated: 2026-04-16T09:54:39Z
day: '21'
department:
- _id: ToHe
doi: 10.1007/978-3-030-04612-5_2
external_id:
arxiv:
- '1804.04372'
isi:
- '000865933000002'
intvolume: ' 11316'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.04372
month: '11'
oa: 1
oa_version: Preprint
page: 21-36
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication_identifier:
isbn:
- '9783030046118'
issn:
- 0302-9743
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Infinite-duration poorman-bidding games
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 11316
year: '2018'
...
---
_id: '5679'
abstract:
- lang: eng
text: We study the almost-sure termination problem for probabilistic programs. First,
we show that supermartingales with lower bounds on conditional absolute difference
provide a sound approach for the almost-sure termination problem. Moreover, using
this approach we can obtain explicit optimal bounds on tail probabilities of non-termination
within a given number of steps. Second, we present a new approach based on Central
Limit Theorem for the almost-sure termination problem, and show that this approach
can establish almost-sure termination of programs which none of the existing approaches
can handle. Finally, we discuss algorithmic approaches for the two above methods
that lead to automated analysis techniques for almost-sure termination of probabilistic
programs.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Mingzhang
full_name: Huang, Mingzhang
last_name: Huang
- first_name: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Huang M, Fu H, Chatterjee K. New approaches for almost-sure termination of
probabilistic programs. In: Ryu S, ed. Vol 11275. Springer; 2018:181-201. doi:10.1007/978-3-030-02768-1_11'
apa: 'Huang, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure
termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201).
Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS,
Wellington, New Zealand: Springer. https://doi.org/10.1007/978-3-030-02768-1_11'
chicago: Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches
for Almost-Sure Termination of Probabilistic Programs.” edited by Sukyoung Ryu,
11275:181–201. Springer, 2018. https://doi.org/10.1007/978-3-030-02768-1_11.
ieee: M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination
of probabilistic programs,” presented at the 16th Asian Symposium on Programming
Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201.
ista: Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination
of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems,
APLAS, LNCS, vol. 11275, 181–201.
mla: Huang, Mingzhang, et al. New Approaches for Almost-Sure Termination of Probabilistic
Programs. Edited by Sukyoung Ryu, vol. 11275, Springer, 2018, pp. 181–201,
doi:10.1007/978-3-030-02768-1_11.
short: M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201.
conference:
end_date: 2018-12-06
location: Wellington, New Zealand
name: 16th Asian Symposium on Programming Languages and Systems, APLAS
start_date: 2018-12-02
date_created: 2018-12-16T22:59:20Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2026-04-16T09:54:21Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-030-02768-1_11
editor:
- first_name: Sukyoung
full_name: Ryu, Sukyoung
last_name: Ryu
external_id:
arxiv:
- '1806.06683'
isi:
- '000916310900011'
intvolume: ' 11275'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1806.06683
month: '12'
oa: 1
oa_version: Preprint
page: 181-201
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_identifier:
isbn:
- '9783030027674'
issn:
- 0302-9743
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: New approaches for almost-sure termination of probabilistic programs
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 11275
year: '2018'
...
---
_id: '5672'
abstract:
- lang: eng
text: The release of IgM is the first line of an antibody response and precedes
the generation of high affinity IgG in germinal centers. Once secreted by freshly
activated plasmablasts, IgM is released into the efferent lymph of reactive lymph
nodes as early as 3 d after immunization. As pentameric IgM has an enormous size
of 1,000 kD, its diffusibility is low, and one might wonder how it can pass through
the densely lymphocyte-packed environment of a lymph node parenchyma in order
to reach its exit. In this issue of JEM, Thierry et al. show that, in order to
reach the blood stream, IgM molecules take a specific micro-anatomical route via
lymph node conduits.
article_processing_charge: No
author:
- first_name: Anne
full_name: Reversat, Anne
id: 35B76592-F248-11E8-B48F-1D18A9856A87
last_name: Reversat
orcid: 0000-0003-0666-8928
- 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: Reversat A, Sixt MK. IgM’s exit route. Journal of Experimental Medicine.
2018;215(12):2959-2961. doi:10.1084/jem.20181934
apa: Reversat, A., & Sixt, M. K. (2018). IgM’s exit route. Journal of Experimental
Medicine. Rockefeller University Press. https://doi.org/10.1084/jem.20181934
chicago: Reversat, Anne, and Michael K Sixt. “IgM’s Exit Route.” Journal of Experimental
Medicine. Rockefeller University Press, 2018. https://doi.org/10.1084/jem.20181934.
ieee: A. Reversat and M. K. Sixt, “IgM’s exit route,” Journal of Experimental
Medicine, vol. 215, no. 12. Rockefeller University Press, pp. 2959–2961, 2018.
ista: Reversat A, Sixt MK. 2018. IgM’s exit route. Journal of Experimental Medicine.
215(12), 2959–2961.
mla: Reversat, Anne, and Michael K. Sixt. “IgM’s Exit Route.” Journal of Experimental
Medicine, vol. 215, no. 12, Rockefeller University Press, 2018, pp. 2959–61,
doi:10.1084/jem.20181934.
short: A. Reversat, M.K. Sixt, Journal of Experimental Medicine 215 (2018) 2959–2961.
date_created: 2018-12-16T22:59:18Z
date_published: 2018-11-20T00:00:00Z
date_updated: 2026-04-16T09:54:07Z
day: '20'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1084/jem.20181934
external_id:
isi:
- '000451920600002'
file:
- access_level: open_access
checksum: 687beea1d64c213f4cb9e3c29ec11a14
content_type: application/pdf
creator: dernst
date_created: 2019-02-06T08:49:52Z
date_updated: 2020-07-14T12:47:09Z
file_id: '5931'
file_name: 2018_JournalExperMed_Reversat.pdf
file_size: 1216437
relation: main_file
file_date_updated: 2020-07-14T12:47:09Z
has_accepted_license: '1'
intvolume: ' 215'
isi: 1
issue: '12'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '11'
oa: 1
oa_version: Published Version
page: 2959-2961
publication: Journal of Experimental Medicine
publication_identifier:
issn:
- 0022-1007
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: IgM's exit route
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 215
year: '2018'
...
---
_id: '703'
abstract:
- lang: eng
text: We consider the NP-hard problem of MAP-inference for undirected discrete graphical
models. We propose a polynomial time and practically efficient algorithm for finding
a part of its optimal solution. Specifically, our algorithm marks some labels
of the considered graphical model either as (i) optimal, meaning that they belong
to all optimal solutions of the inference problem; (ii) non-optimal if they provably
do not belong to any solution. With access to an exact solver of a linear programming
relaxation to the MAP-inference problem, our algorithm marks the maximal possible
(in a specified sense) number of labels. We also present a version of the algorithm,
which has access to a suboptimal dual solver only and still can ensure the (non-)optimality
for the marked labels, although the overall number of the marked labels may decrease.
We propose an efficient implementation, which runs in time comparable to a single
run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art
results on computational benchmarks from machine learning and computer vision.
article_processing_charge: No
arxiv: 1
author:
- first_name: Alexander
full_name: Shekhovtsov, Alexander
last_name: Shekhovtsov
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Bogdan
full_name: Savchynskyy, Bogdan
last_name: Savchynskyy
citation:
ama: Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative
relaxed inference with graphical models. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884
apa: Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency
via iterative relaxed inference with graphical models. IEEE Transactions on
Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884
chicago: Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum
Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions
on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884.
ieee: A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative
relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis
and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.
ista: Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative
relaxed inference with graphical models. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 40(7), 1668–1682.
mla: Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference
with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.
short: A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern
Analysis and Machine Intelligence 40 (2018) 1668–1682.
corr_author: '1'
date_created: 2018-12-11T11:48:01Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2026-04-16T09:54:52Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/TPAMI.2017.2730884
external_id:
arxiv:
- '1508.07902'
isi:
- '000434294800010'
intvolume: ' 40'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1508.07902
month: '07'
oa: 1
oa_version: Preprint
page: 1668-1682
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
issn:
- 0162-8828
publication_status: published
publisher: IEEE
publist_id: '6992'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Maximum persistency via iterative relaxed inference with graphical models
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 40
year: '2018'
...