---
_id: '79'
abstract:
- lang: eng
text: 'Markov Decision Processes (MDPs) are a popular class of models suitable for
solving control decision problems in probabilistic reactive systems. We consider
parametric MDPs (pMDPs) that include parameters in some of the transition probabilities
to account for stochastic uncertainties of the environment such as noise or input
disturbances. We study pMDPs with reachability objectives where the parameter
values are unknown and impossible to measure directly during execution, but there
is a probability distribution known over the parameter values. We study for the
first time computing parameter-independent strategies that are expectation optimal,
i.e., optimize the expected reachability probability under the probability distribution
over the parameters. We present an encoding of our problem to partially observable
MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies
in POMDPs. We evaluate our method experimentally on several benchmarks: a motivating
(repeated) learner model; a series of benchmarks of varying configurations of
a robot moving on a grid; and a consensus protocol.'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Sebastian
full_name: Arming, Sebastian
last_name: Arming
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Joost P
full_name: Katoen, Joost P
id: 4524F760-F248-11E8-B48F-1D18A9856A87
last_name: Katoen
- first_name: Ana
full_name: Sokolova, Ana
last_name: Sokolova
citation:
ama: 'Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. Parameter-independent
strategies for pMDPs via POMDPs. In: Vol 11024. Springer; 2018:53-70. doi:10.1007/978-3-319-99154-2_4'
apa: 'Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A.
(2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp.
53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China:
Springer. https://doi.org/10.1007/978-3-319-99154-2_4'
chicago: Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen,
and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70.
Springer, 2018. https://doi.org/10.1007/978-3-319-99154-2_4.
ieee: 'S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent
strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation
of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.'
ista: 'Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent
strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS,
vol. 11024, 53–70.'
mla: Arming, Sebastian, et al. Parameter-Independent Strategies for PMDPs via
POMDPs. Vol. 11024, Springer, 2018, pp. 53–70, doi:10.1007/978-3-319-99154-2_4.
short: S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer,
2018, pp. 53–70.
conference:
end_date: 2018-09-07
location: Beijing, China
name: 'QEST: Quantitative Evaluation of Systems'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:31Z
date_published: 2018-08-15T00:00:00Z
date_updated: 2023-09-13T09:38:28Z
day: '15'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-99154-2_4
external_id:
arxiv:
- '1806.05126'
isi:
- '000548912200004'
intvolume: ' 11024'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.05126
month: '08'
oa: 1
oa_version: Preprint
page: 53-70
publication_status: published
publisher: Springer
publist_id: '7975'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parameter-independent strategies for pMDPs via POMDPs
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11024
year: '2018'
...
---
_id: '81'
abstract:
- lang: eng
text: We solve the offline monitoring problem for timed propositional temporal logic
(TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider
extends linear temporal logic (LTL) with clock variables and reset quantifiers,
providing a mechanism to specify real-time constraints. We first describe a general
monitoring algorithm based on an exhaustive computation of the set of satisfying
clock assignments as a finite union of zones. We then propose a specialized monitoring
algorithm for the one-variable case using a partition of the time domain based
on the notion of region equivalence, whose complexity is linear in the length
of the signal, thereby generalizing a known result regarding the monitoring of
metric temporal logic (MTL). The region and zone representations of time constraints
are known from timed automata verification and can also be used in the discrete-time
case. Our prototype implementation appears to outperform previous discrete-time
implementations of TPTL monitoring,
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Adrian
full_name: Elgyütt, Adrian
id: 4A2E9DBA-F248-11E8-B48F-1D18A9856A87
last_name: Elgyütt
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- 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: 'Elgyütt A, Ferrere T, Henzinger TA. Monitoring temporal logic with clock variables.
In: Vol 11022. Springer; 2018:53-70. doi:10.1007/978-3-030-00151-3_4'
apa: 'Elgyütt, A., Ferrere, T., & Henzinger, T. A. (2018). Monitoring temporal
logic with clock variables (Vol. 11022, pp. 53–70). Presented at the FORMATS:
Formal Modeling and Analysis of Timed Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-030-00151-3_4'
chicago: Elgyütt, Adrian, Thomas Ferrere, and Thomas A Henzinger. “Monitoring Temporal
Logic with Clock Variables,” 11022:53–70. Springer, 2018. https://doi.org/10.1007/978-3-030-00151-3_4.
ieee: 'A. Elgyütt, T. Ferrere, and T. A. Henzinger, “Monitoring temporal logic with
clock variables,” presented at the FORMATS: Formal Modeling and Analysis of Timed
Systems, Beijing, China, 2018, vol. 11022, pp. 53–70.'
ista: 'Elgyütt A, Ferrere T, Henzinger TA. 2018. Monitoring temporal logic with
clock variables. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS,
vol. 11022, 53–70.'
mla: Elgyütt, Adrian, et al. Monitoring Temporal Logic with Clock Variables.
Vol. 11022, Springer, 2018, pp. 53–70, doi:10.1007/978-3-030-00151-3_4.
short: A. Elgyütt, T. Ferrere, T.A. Henzinger, in:, Springer, 2018, pp. 53–70.
conference:
end_date: 2018-09-06
location: Beijing, China
name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:31Z
date_published: 2018-08-26T00:00:00Z
date_updated: 2025-04-15T06:26:03Z
day: '26'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-00151-3_4
external_id:
isi:
- '000884993200004'
file:
- access_level: open_access
checksum: e5d81c9b50a6bd9d8a2c16953aad7e23
content_type: application/pdf
creator: dernst
date_created: 2020-10-09T06:24:21Z
date_updated: 2020-10-09T06:24:21Z
file_id: '8638'
file_name: 2018_LNCS_Elgyuett.pdf
file_size: 537219
relation: main_file
success: 1
file_date_updated: 2020-10-09T06:24:21Z
has_accepted_license: '1'
intvolume: ' 11022'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 53 - 70
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication_status: published
publisher: Springer
publist_id: '7973'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monitoring temporal logic with clock variables
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11022
year: '2018'
...
---
_id: '8232'
abstract:
- lang: eng
text: 'Anti-epidermal growth factor receptor (EGFR) antibody therapy is used in
EGFR expressing cancers including lung, colon, head and neck, and bladder cancers,
however results have been modest. Near infrared photoimmunotherapy (NIR-PIT) is
a highly selective tumor treatment that employs an antibody-photo-absorber conjugate
which is activated by NIR light. NIR-PIT is in clinical trials in patients with
recurrent head and neck cancers using cetuximab-IR700 as the conjugate. However,
its use has otherwise been restricted to mouse models. This is an effort to explore
larger animal models with NIR-PIT. We describe the use of a recombinant canine
anti-EGFR monoclonal antibody (mAb), can225IgG, conjugated to the photo-absorber,
IR700DX, in three EGFR expressing canine transitional cell carcinoma (TCC) cell
lines as a prelude to possible canine clinical studies. Can225-IR700 conjugate
showed specific binding and cell-specific killing after NIR-PIT on EGFR expressing
cells in vitro. In the in vivo study, can225-IR700 conjugate demonstrated accumulation
of the fluorescent conjugate with high tumor-to-background ratio. Tumor-bearing
mice were separated into 4 groups: (1) no treatment; (2) 100 μg of can225-IR700
i.v. only; (3) NIR light exposure only; (4) 100 μg of can225-IR700 i.v., NIR light
exposure. Tumor growth was significantly inhibited by NIR-PIT treatment compared
with the other groups (p < 0.001), and significantly prolonged survival was achieved
(p < 0.001 vs. other groups) in the treatment groups. In conclusion, NIR-PIT with
can225-IR700 is a promising treatment for canine EGFR-expressing cancers, including
invasive transitional cell carcinoma in pet dogs, that could provide a pathway
to translation to humans.'
article_processing_charge: No
article_type: original
author:
- first_name: Tadanobu
full_name: Nagaya, Tadanobu
last_name: Nagaya
- first_name: Shuhei
full_name: Okuyama, Shuhei
last_name: Okuyama
- first_name: Fusa
full_name: Ogata, Fusa
last_name: Ogata
- first_name: Yasuhiro
full_name: Maruoka, Yasuhiro
last_name: Maruoka
- first_name: Deborah W.
full_name: Knapp, Deborah W.
last_name: Knapp
- first_name: Sophia N.
full_name: Karagiannis, Sophia N.
last_name: Karagiannis
- first_name: Judit
full_name: Fazekas-Singer, Judit
id: 36432834-F248-11E8-B48F-1D18A9856A87
last_name: Fazekas-Singer
orcid: 0000-0002-8777-3502
- first_name: Peter L.
full_name: Choyke, Peter L.
last_name: Choyke
- first_name: Amy K.
full_name: LeBlanc, Amy K.
last_name: LeBlanc
- first_name: Erika
full_name: Jensen-Jarolim, Erika
last_name: Jensen-Jarolim
- first_name: Hisataka
full_name: Kobayashi, Hisataka
last_name: Kobayashi
citation:
ama: Nagaya T, Okuyama S, Ogata F, et al. Near infrared photoimmunotherapy targeting
bladder cancer with a canine anti-epidermal growth factor receptor (EGFR) antibody.
Oncotarget. 2018;9:19026-19038. doi:10.18632/oncotarget.24876
apa: Nagaya, T., Okuyama, S., Ogata, F., Maruoka, Y., Knapp, D. W., Karagiannis,
S. N., … Kobayashi, H. (2018). Near infrared photoimmunotherapy targeting bladder
cancer with a canine anti-epidermal growth factor receptor (EGFR) antibody. Oncotarget.
Impact Journals. https://doi.org/10.18632/oncotarget.24876
chicago: Nagaya, Tadanobu, Shuhei Okuyama, Fusa Ogata, Yasuhiro Maruoka, Deborah
W. Knapp, Sophia N. Karagiannis, Judit Singer, et al. “Near Infrared Photoimmunotherapy
Targeting Bladder Cancer with a Canine Anti-Epidermal Growth Factor Receptor (EGFR)
Antibody.” Oncotarget. Impact Journals, 2018. https://doi.org/10.18632/oncotarget.24876.
ieee: T. Nagaya et al., “Near infrared photoimmunotherapy targeting bladder
cancer with a canine anti-epidermal growth factor receptor (EGFR) antibody,” Oncotarget,
vol. 9. Impact Journals, pp. 19026–19038, 2018.
ista: Nagaya T, Okuyama S, Ogata F, Maruoka Y, Knapp DW, Karagiannis SN, Singer
J, Choyke PL, LeBlanc AK, Jensen-Jarolim E, Kobayashi H. 2018. Near infrared photoimmunotherapy
targeting bladder cancer with a canine anti-epidermal growth factor receptor (EGFR)
antibody. Oncotarget. 9, 19026–19038.
mla: Nagaya, Tadanobu, et al. “Near Infrared Photoimmunotherapy Targeting Bladder
Cancer with a Canine Anti-Epidermal Growth Factor Receptor (EGFR) Antibody.” Oncotarget,
vol. 9, Impact Journals, 2018, pp. 19026–38, doi:10.18632/oncotarget.24876.
short: T. Nagaya, S. Okuyama, F. Ogata, Y. Maruoka, D.W. Knapp, S.N. Karagiannis,
J. Singer, P.L. Choyke, A.K. LeBlanc, E. Jensen-Jarolim, H. Kobayashi, Oncotarget
9 (2018) 19026–19038.
date_created: 2020-08-10T11:52:54Z
date_published: 2018-04-10T00:00:00Z
date_updated: 2021-01-12T08:17:37Z
day: '10'
doi: 10.18632/oncotarget.24876
extern: '1'
intvolume: ' 9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.18632/oncotarget.24876
month: '04'
oa: 1
oa_version: Published Version
page: 19026-19038
publication: Oncotarget
publication_identifier:
eissn:
- 1949-2553
publication_status: published
publisher: Impact Journals
quality_controlled: '1'
status: public
title: Near infrared photoimmunotherapy targeting bladder cancer with a canine anti-epidermal
growth factor receptor (EGFR) antibody
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2018'
...
---
_id: '8262'
abstract:
- lang: eng
text: "Background: The genus Burkholderia consists of species that occupy remarkably
diverse ecological niches. Its best known members are important pathogens, B.
mallei and B. pseudomallei, which cause glanders and melioidosis, respectively.
Burkholderia genomes are unusual due to their multichromosomal organization, generally
comprised of 2-3 chromosomes.\r\n\r\nResults: We performed integrated genomic
analysis of 127 Burkholderia strains. The pan-genome is open with the saturation
to be reached between 86,000 and 88,000 genes. The reconstructed rearrangements
indicate a strong avoidance of intra-replichore inversions that is likely caused
by selection against the transfer of large groups of genes between the leading
and the lagging strands. Translocated genes also tend to retain their position
in the leading or the lagging strand, and this selection is stronger for large
syntenies. Integrated reconstruction of chromosome rearrangements in the context
of strains phylogeny reveals parallel rearrangements that may indicate inversion-based
phase variation and integration of new genomic islands. In particular, we detected
parallel inversions in the second chromosomes of B. pseudomallei with breakpoints
formed by genes encoding membrane components of multidrug resistance complex,
that may be linked to a phase variation mechanism. Two genomic islands, spreading
horizontally between chromosomes, were detected in the B. cepacia group.\r\n\r\nConclusions:
This study demonstrates the power of integrated analysis of pan-genomes, chromosome
rearrangements, and selection regimes. Non-random inversion patterns indicate
selective pressure, inversions are particularly frequent in a recent pathogen
B. mallei, and, together with periods of positive selection at other branches,
may indicate adaptation to new niches. One such adaptation could be a possible
phase variation mechanism in B. pseudomallei."
article_number: '965'
article_processing_charge: No
article_type: original
author:
- first_name: Olga
full_name: Bochkareva, Olga
id: C4558D3C-6102-11E9-A62E-F418E6697425
last_name: Bochkareva
orcid: 0000-0003-1006-6639
- first_name: Elena V.
full_name: Moroz, Elena V.
last_name: Moroz
- first_name: Iakov I.
full_name: Davydov, Iakov I.
last_name: Davydov
- first_name: Mikhail S.
full_name: Gelfand, Mikhail S.
last_name: Gelfand
citation:
ama: Bochkareva O, Moroz EV, Davydov II, Gelfand MS. Genome rearrangements and selection
in multi-chromosome bacteria Burkholderia spp. BMC Genomics. 2018;19. doi:10.1186/s12864-018-5245-1
apa: Bochkareva, O., Moroz, E. V., Davydov, I. I., & Gelfand, M. S. (2018).
Genome rearrangements and selection in multi-chromosome bacteria Burkholderia
spp. BMC Genomics. Springer Nature. https://doi.org/10.1186/s12864-018-5245-1
chicago: Bochkareva, Olga, Elena V. Moroz, Iakov I. Davydov, and Mikhail S. Gelfand.
“Genome Rearrangements and Selection in Multi-Chromosome Bacteria Burkholderia
Spp.” BMC Genomics. Springer Nature, 2018. https://doi.org/10.1186/s12864-018-5245-1.
ieee: O. Bochkareva, E. V. Moroz, I. I. Davydov, and M. S. Gelfand, “Genome rearrangements
and selection in multi-chromosome bacteria Burkholderia spp.,” BMC Genomics,
vol. 19. Springer Nature, 2018.
ista: Bochkareva O, Moroz EV, Davydov II, Gelfand MS. 2018. Genome rearrangements
and selection in multi-chromosome bacteria Burkholderia spp. BMC Genomics. 19,
965.
mla: Bochkareva, Olga, et al. “Genome Rearrangements and Selection in Multi-Chromosome
Bacteria Burkholderia Spp.” BMC Genomics, vol. 19, 965, Springer Nature,
2018, doi:10.1186/s12864-018-5245-1.
short: O. Bochkareva, E.V. Moroz, I.I. Davydov, M.S. Gelfand, BMC Genomics 19 (2018).
date_created: 2020-08-15T11:02:08Z
date_published: 2018-12-27T00:00:00Z
date_updated: 2023-02-23T13:28:52Z
day: '27'
doi: 10.1186/s12864-018-5245-1
extern: '1'
intvolume: ' 19'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1186/s12864-018-5245-1
month: '12'
oa: 1
oa_version: Published Version
publication: BMC Genomics
publication_identifier:
issn:
- 1471-2164
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Genome rearrangements and selection in multi-chromosome bacteria Burkholderia
spp.
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2018'
...
---
_id: '8298'
abstract:
- lang: eng
text: Sharding, or partitioning the system’s state so that different subsets of
participants handle it, is a proven approach to building distributed systems whose
total capacity scales horizontally with the number of participants. Many distributed
ledgers have adopted this approach to increase their performance, however, they
focus on the permissionless setting that assumes the existence of a strong adversary.
In this paper, we deploy channels for permissioned blockchains. Our first contribution
is to adapt sharding on asset-management applications for the permissioned setting,
while preserving liveness and safety even on transactions spanning across-channels.
Our second contribution is to leverage channels as a confidentiality boundary,
enabling different organizations and consortia to preserve their privacy within
their channels and still be part of a bigger collaborative ecosystem. To make
our system concrete we map it on top of Hyperledger Fabric.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Elli
full_name: Androulaki, Elli
last_name: Androulaki
- first_name: Christian
full_name: Cachin, Christian
last_name: Cachin
- first_name: Angelo
full_name: De Caro, Angelo
last_name: De Caro
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
citation:
ama: 'Androulaki E, Cachin C, De Caro A, Kokoris Kogias E. Channels: Horizontal
scaling and confidentiality on permissioned blockchains. In: Computer Security.
Vol 11098. Springer Nature; 2018:111-131. doi:10.1007/978-3-319-99073-6_6'
apa: 'Androulaki, E., Cachin, C., De Caro, A., & Kokoris Kogias, E. (2018).
Channels: Horizontal scaling and confidentiality on permissioned blockchains.
In Computer Security (Vol. 11098, pp. 111–131). Barcelona, Spain: Springer
Nature. https://doi.org/10.1007/978-3-319-99073-6_6'
chicago: 'Androulaki, Elli, Christian Cachin, Angelo De Caro, and Eleftherios Kokoris
Kogias. “Channels: Horizontal Scaling and Confidentiality on Permissioned Blockchains.”
In Computer Security, 11098:111–31. Springer Nature, 2018. https://doi.org/10.1007/978-3-319-99073-6_6.'
ieee: 'E. Androulaki, C. Cachin, A. De Caro, and E. Kokoris Kogias, “Channels: Horizontal
scaling and confidentiality on permissioned blockchains,” in Computer Security,
Barcelona, Spain, 2018, vol. 11098, pp. 111–131.'
ista: 'Androulaki E, Cachin C, De Caro A, Kokoris Kogias E. 2018. Channels: Horizontal
scaling and confidentiality on permissioned blockchains. Computer Security. ESORICS:
European Symposium on Research in Computer Security, LNCS, vol. 11098, 111–131.'
mla: 'Androulaki, Elli, et al. “Channels: Horizontal Scaling and Confidentiality
on Permissioned Blockchains.” Computer Security, vol. 11098, Springer Nature,
2018, pp. 111–31, doi:10.1007/978-3-319-99073-6_6.'
short: E. Androulaki, C. Cachin, A. De Caro, E. Kokoris Kogias, in:, Computer Security,
Springer Nature, 2018, pp. 111–131.
conference:
end_date: 2018-09-07
location: Barcelona, Spain
name: 'ESORICS: European Symposium on Research in Computer Security'
start_date: 2018-09-03
date_created: 2020-08-26T11:47:34Z
date_published: 2018-08-08T00:00:00Z
date_updated: 2021-01-12T08:17:57Z
day: '08'
doi: 10.1007/978-3-319-99073-6_6
extern: '1'
intvolume: ' 11098'
language:
- iso: eng
month: '08'
oa_version: None
page: 111-131
publication: Computer Security
publication_identifier:
eisbn:
- '9783319990736'
isbn:
- '9783319990729'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: 'Channels: Horizontal scaling and confidentiality on permissioned blockchains'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11098
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: '86'
abstract:
- lang: eng
text: Responsiveness—the requirement that every request to a system be eventually
handled—is one of the fundamental liveness properties of a reactive system. Average
response time is a quantitative measure for the responsiveness requirement used
commonly in performance evaluation. We show how average response time can be computed
on state-transition graphs, on Markov chains, and on game graphs. In all three
cases, we give polynomial-time algorithms.
acknowledgement: 'This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein
Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund
(WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland
under grant 2014/15/D/ST6/04543.'
alternative_title:
- LNCS
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
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh
M, Derler P, Sirjani M, eds. Principles of Modeling. Vol 10760. Springer;
2018:143-161. doi:10.1007/978-3-319-95246-8_9'
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average
response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles
of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average
Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia
Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,”
in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani,
Eds. Springer, 2018, pp. 143–161.
ista: 'Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time.
In: Principles of Modeling. LNCS, vol. 10760, 143–161.'
mla: Chatterjee, Krishnendu, et al. “Computing Average Response Time.” Principles
of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018,
pp. 143–61, doi:10.1007/978-3-319-95246-8_9.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani
(Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.
date_created: 2018-12-11T11:44:33Z
date_published: 2018-07-20T00:00:00Z
date_updated: 2025-04-15T06:26:15Z
day: '20'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-95246-8_9
ec_funded: 1
editor:
- first_name: Marten
full_name: Lohstroh, Marten
last_name: Lohstroh
- first_name: Patricia
full_name: Derler, Patricia
last_name: Derler
- first_name: Marjan
full_name: Sirjani, Marjan
last_name: Sirjani
file:
- access_level: open_access
checksum: 9995c6ce6957333baf616fc4f20be597
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T08:22:18Z
date_updated: 2020-07-14T12:48:14Z
file_id: '7053'
file_name: 2018_PrinciplesModeling_Chatterjee.pdf
file_size: 516307
relation: main_file
file_date_updated: 2020-07-14T12:48:14Z
has_accepted_license: '1'
intvolume: ' 10760'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 143 - 161
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Principles of Modeling
publication_status: published
publisher: Springer
publist_id: '7968'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computing average response time
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10760
year: '2018'
...
---
_id: '8618'
abstract:
- lang: eng
text: The reversibly switchable fluorescent proteins (RSFPs) commonly used for RESOLFT
nanoscopy have been developed from fluorescent proteins of the GFP superfamily.
These proteins are bright, but exhibit several drawbacks such as relatively large
size, oxygen-dependence, sensitivity to low pH, and limited switching speed. Therefore,
RSFPs from other origins with improved properties need to be explored. Here, we
report the development of two RSFPs based on the LOV domain of the photoreceptor
protein YtvA from Bacillus subtilis. LOV domains obtain their fluorescence by
association with the abundant cellular cofactor flavin mononucleotide (FMN). Under
illumination with blue and ultraviolet light, they undergo a photocycle, making
these proteins inherently photoswitchable. Our first improved variant, rsLOV1,
can be used for RESOLFT imaging, whereas rsLOV2 proved useful for STED nanoscopy
of living cells with a resolution of down to 50 nm. In addition to their smaller
size compared to GFP-related proteins (17 kDa instead of 27 kDa) and their usability
at low pH, rsLOV1 and rsLOV2 exhibit faster switching kinetics, switching on and
off 3 times faster than rsEGFP2, the fastest-switching RSFP reported to date.
Therefore, LOV-domain-based RSFPs have potential for applications where the switching
speed of GFP-based proteins is limiting.
article_number: '2724'
article_processing_charge: No
article_type: original
author:
- first_name: Carola
full_name: Gregor, Carola
last_name: Gregor
- first_name: Sven C.
full_name: Sidenstein, Sven C.
last_name: Sidenstein
- first_name: Martin
full_name: Andresen, Martin
last_name: Andresen
- first_name: Steffen J.
full_name: Sahl, Steffen J.
last_name: Sahl
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Stefan W.
full_name: Hell, Stefan W.
last_name: Hell
citation:
ama: Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. Novel reversibly
switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from
the bacterial photoreceptor YtvA. Scientific Reports. 2018;8. doi:10.1038/s41598-018-19947-1
apa: Gregor, C., Sidenstein, S. C., Andresen, M., Sahl, S. J., Danzl, J. G., &
Hell, S. W. (2018). Novel reversibly switchable fluorescent proteins for RESOLFT
and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific
Reports. Springer Nature. https://doi.org/10.1038/s41598-018-19947-1
chicago: Gregor, Carola, Sven C. Sidenstein, Martin Andresen, Steffen J. Sahl, Johann
G Danzl, and Stefan W. Hell. “Novel Reversibly Switchable Fluorescent Proteins
for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.”
Scientific Reports. Springer Nature, 2018. https://doi.org/10.1038/s41598-018-19947-1.
ieee: C. Gregor, S. C. Sidenstein, M. Andresen, S. J. Sahl, J. G. Danzl, and S.
W. Hell, “Novel reversibly switchable fluorescent proteins for RESOLFT and STED
nanoscopy engineered from the bacterial photoreceptor YtvA,” Scientific Reports,
vol. 8. Springer Nature, 2018.
ista: Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. 2018. Novel
reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered
from the bacterial photoreceptor YtvA. Scientific Reports. 8, 2724.
mla: Gregor, Carola, et al. “Novel Reversibly Switchable Fluorescent Proteins for
RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.”
Scientific Reports, vol. 8, 2724, Springer Nature, 2018, doi:10.1038/s41598-018-19947-1.
short: C. Gregor, S.C. Sidenstein, M. Andresen, S.J. Sahl, J.G. Danzl, S.W. Hell,
Scientific Reports 8 (2018).
date_created: 2020-10-06T16:33:37Z
date_published: 2018-02-09T00:00:00Z
date_updated: 2024-10-21T06:02:43Z
day: '09'
ddc:
- '570'
department:
- _id: JoDa
doi: 10.1038/s41598-018-19947-1
external_id:
isi:
- '000424630400037'
pmid:
- '29426833'
file:
- access_level: open_access
checksum: e642080fcbde9584c63544f587c74f03
content_type: application/pdf
creator: dernst
date_created: 2020-10-06T16:35:16Z
date_updated: 2020-10-06T16:35:16Z
file_id: '8619'
file_name: 2018_ScientificReports_Gregor.pdf
file_size: 2818077
relation: main_file
success: 1
file_date_updated: 2020-10-06T16:35:16Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
keyword:
- Multidisciplinary
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
pmid: 1
publication: Scientific Reports
publication_identifier:
issn:
- 2045-2322
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy
engineered from the bacterial photoreceptor YtvA
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: 8
year: '2018'
...
---
_id: '9808'
abstract:
- lang: eng
text: Table S4. Counts per Gene per Million Reads Mapped. (XLSX 2751 kb).
article_processing_charge: No
author:
- first_name: Juan
full_name: Higareda Almaraz, Juan
last_name: Higareda Almaraz
- first_name: Michael
full_name: Karbiener, Michael
last_name: Karbiener
- first_name: Maude
full_name: Giroud, Maude
last_name: Giroud
- first_name: Florian
full_name: Pauler, Florian
id: 48EA0138-F248-11E8-B48F-1D18A9856A87
last_name: Pauler
orcid: 0000-0002-7462-0048
- first_name: Teresa
full_name: Gerhalter, Teresa
last_name: Gerhalter
- first_name: Stephan
full_name: Herzig, Stephan
last_name: Herzig
- first_name: Marcel
full_name: Scheideler, Marcel
last_name: Scheideler
citation:
ama: 'Higareda Almaraz J, Karbiener M, Giroud M, et al. Additional file 3: Of Norepinephrine
triggers an immediate-early regulatory network response in primary human white
adipocytes. 2018. doi:10.6084/m9.figshare.7295369.v1'
apa: 'Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T.,
Herzig, S., & Scheideler, M. (2018). Additional file 3: Of Norepinephrine
triggers an immediate-early regulatory network response in primary human white
adipocytes. Springer Nature. https://doi.org/10.6084/m9.figshare.7295369.v1'
chicago: 'Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler,
Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Additional File 3: Of
Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary
Human White Adipocytes.” Springer Nature, 2018. https://doi.org/10.6084/m9.figshare.7295369.v1.'
ieee: 'J. Higareda Almaraz et al., “Additional file 3: Of Norepinephrine
triggers an immediate-early regulatory network response in primary human white
adipocytes.” Springer Nature, 2018.'
ista: 'Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig
S, Scheideler M. 2018. Additional file 3: Of Norepinephrine triggers an immediate-early
regulatory network response in primary human white adipocytes, Springer Nature,
10.6084/m9.figshare.7295369.v1.'
mla: 'Higareda Almaraz, Juan, et al. Additional File 3: Of Norepinephrine Triggers
an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.
Springer Nature, 2018, doi:10.6084/m9.figshare.7295369.v1.'
short: J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S.
Herzig, M. Scheideler, (2018).
date_created: 2021-08-06T12:31:57Z
date_published: 2018-11-03T00:00:00Z
date_updated: 2023-09-13T09:10:47Z
day: '03'
department:
- _id: SiHi
doi: 10.6084/m9.figshare.7295369.v1
main_file_link:
- open_access: '1'
url: https://doi.org/10.6084/m9.figshare.7295369.v1
month: '11'
oa: 1
oa_version: Published Version
publisher: Springer Nature
related_material:
record:
- id: '20'
relation: used_in_publication
status: public
status: public
title: 'Additional file 3: Of Norepinephrine triggers an immediate-early regulatory
network response in primary human white adipocytes'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2018'
...
---
_id: '690'
abstract:
- lang: eng
text: We consider spectral properties and the edge universality of sparse random
matrices, the class of random matrices that includes the adjacency matrices of
the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density
up to the spectral edges. Under a suitable condition on the sparsity, we also
prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations
if a deterministic shift of the spectral edge due to the sparsity is included.
For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom
fluctuations of the second largest eigenvalue when p is much larger than N−2/3
with a deterministic shift of order (Np)−1.
article_number: 543-616
article_processing_charge: No
arxiv: 1
author:
- first_name: Jii
full_name: Lee, Jii
last_name: Lee
- first_name: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices.
Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8
apa: Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse
random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8
chicago: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse
Random Matrices.” Probability Theory and Related Fields. Springer, 2018.
https://doi.org/10.1007/s00440-017-0787-8.
ieee: J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random
matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer,
2018.
ista: Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random
matrices. Probability Theory and Related Fields. 171(1–2), 543–616.
mla: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random
Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616,
Springer, 2018, doi:10.1007/s00440-017-0787-8.
short: J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).
date_created: 2018-12-11T11:47:56Z
date_published: 2018-06-14T00:00:00Z
date_updated: 2025-09-10T14:00:58Z
day: '14'
department:
- _id: LaEr
doi: 10.1007/s00440-017-0787-8
ec_funded: 1
external_id:
arxiv:
- '1605.08767'
isi:
- '000432129600012'
intvolume: ' 171'
isi: 1
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1605.08767
month: '06'
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: Probability Theory and Related Fields
publication_status: published
publisher: Springer
publist_id: '7017'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local law and Tracy–Widom limit for sparse random matrices
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 171
year: '2018'
...
---
_id: '692'
abstract:
- lang: eng
text: We consider families of confocal conics and two pencils of Apollonian circles
having the same foci. We will show that these families of curves generate trivial
3-webs and find the exact formulas describing them.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
citation:
ama: Akopyan A. 3-Webs generated by confocal conics and circles. Geometriae Dedicata.
2018;194(1):55-64. doi:10.1007/s10711-017-0265-6
apa: Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. Geometriae
Dedicata. Springer. https://doi.org/10.1007/s10711-017-0265-6
chicago: Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae
Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0265-6.
ieee: A. Akopyan, “3-Webs generated by confocal conics and circles,” Geometriae
Dedicata, vol. 194, no. 1. Springer, pp. 55–64, 2018.
ista: Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae
Dedicata. 194(1), 55–64.
mla: Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae
Dedicata, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:10.1007/s10711-017-0265-6.
short: A. Akopyan, Geometriae Dedicata 194 (2018) 55–64.
corr_author: '1'
date_created: 2018-12-11T11:47:57Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2025-04-15T06:50:29Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s10711-017-0265-6
ec_funded: 1
external_id:
isi:
- '000431418800004'
file:
- access_level: open_access
checksum: 1febcfc1266486053a069e3425ea3713
content_type: application/pdf
creator: kschuh
date_created: 2020-01-03T11:35:08Z
date_updated: 2020-07-14T12:47:44Z
file_id: '7222'
file_name: 2018_Springer_Akopyan.pdf
file_size: 1140860
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 194'
isi: 1
issue: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 55 - 64
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Geometriae Dedicata
publication_status: published
publisher: Springer
publist_id: '7014'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 3-Webs generated by confocal conics and circles
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: 194
year: '2018'
...
---
_id: '6941'
abstract:
- lang: eng
text: "Bitcoin has become the most successful cryptocurrency ever deployed, and
its most distinctive feature is that it is decentralized. Its underlying protocol
(Nakamoto consensus) achieves this by using proof of work, which has the drawback
that it causes the consumption of vast amounts of energy to maintain the ledger.
Moreover, Bitcoin mining dynamics have become less distributed over time.\r\n\r\nTowards
addressing these issues, we propose SpaceMint, a cryptocurrency based on proofs
of space instead of proofs of work. Miners in SpaceMint dedicate disk space rather
than computation. We argue that SpaceMint’s design solves or alleviates several
of Bitcoin’s issues: most notably, its large energy consumption. SpaceMint also
rewards smaller miners fairly according to their contribution to the network,
thus incentivizing more distributed participation.\r\n\r\nThis paper adapts proof
of space to enable its use in cryptocurrency, studies the attacks that can arise
against a Bitcoin-like blockchain that uses proof of space, and proposes a new
blockchain format and transaction types to address these attacks. Our prototype
shows that initializing 1 TB for mining takes about a day (a one-off setup cost),
and miners spend on average just a fraction of a second per block mined. Finally,
we provide a game-theoretic analysis modeling SpaceMint as an extensive game (the
canonical game-theoretic notion for games that take place over time) and show
that this stylized game satisfies a strong equilibrium notion, thereby arguing
for SpaceMint ’s stability and consensus."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sunoo
full_name: Park, Sunoo
last_name: Park
- first_name: Albert
full_name: Kwon, Albert
last_name: Kwon
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A
cryptocurrency based on proofs of space. In: 22nd International Conference
on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499.
doi:10.1007/978-3-662-58387-6_26'
apa: 'Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., & Pietrzak,
K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd
International Conference on Financial Cryptography and Data Security (Vol.
10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. https://doi.org/10.1007/978-3-662-58387-6_26'
chicago: 'Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen,
and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.”
In 22nd International Conference on Financial Cryptography and Data Security,
10957:480–99. Springer Nature, 2018. https://doi.org/10.1007/978-3-662-58387-6_26.'
ieee: 'S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak,
“SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International
Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao,
2018, vol. 10957, pp. 480–499.'
ista: 'Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint:
A cryptocurrency based on proofs of space. 22nd International Conference on Financial
Cryptography and Data Security. FC: Financial Cryptography and Data Security,
LNCS, vol. 10957, 480–499.'
mla: 'Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.”
22nd International Conference on Financial Cryptography and Data Security,
vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.'
short: S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:,
22nd International Conference on Financial Cryptography and Data Security, Springer
Nature, 2018, pp. 480–499.
conference:
end_date: 2018-03-02
location: Nieuwpoort, Curacao
name: 'FC: Financial Cryptography and Data Security'
start_date: 2018-02-26
date_created: 2019-10-14T06:35:38Z
date_published: 2018-12-07T00:00:00Z
date_updated: 2026-04-16T10:30:49Z
day: '07'
department:
- _id: KrPi
doi: 10.1007/978-3-662-58387-6_26
ec_funded: 1
external_id:
isi:
- '000540656400026'
intvolume: ' 10957'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2015/528
month: '12'
oa: 1
oa_version: Submitted Version
page: 480-499
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 22nd International Conference on Financial Cryptography and Data Security
publication_identifier:
eisbn:
- '9783662583876'
eissn:
- 1611-3349
isbn:
- '9783662583869'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SpaceMint: A cryptocurrency based on proofs of space'
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 10957
year: '2018'
...
---
_id: '70'
abstract:
- lang: eng
text: We consider the totally asymmetric simple exclusion process in a critical
scaling parametrized by a≥0, which creates a shock in the particle density of
order aT−1/3, T the observation time. When starting from step initial data, we
provide bounds on the limiting law which in particular imply that in the double
limit lima→∞limT→∞ one recovers the product limit law and the degeneration of
the correlation length observed at shocks of order 1. This result is shown to
apply to a general last-passage percolation model. We also obtain bounds on the
two-point functions of several airy processes.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Peter
full_name: Nejjar, Peter
id: 4BF426E2-F248-11E8-B48F-1D18A9856A87
last_name: Nejjar
citation:
ama: Nejjar P. Transition to shocks in TASEP and decoupling of last passage times.
Latin American Journal of Probability and Mathematical Statistics. 2018;15(2):1311-1334.
doi:10.30757/ALEA.v15-49
apa: Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage
times. Latin American Journal of Probability and Mathematical Statistics.
Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v15-49
chicago: Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage
Times.” Latin American Journal of Probability and Mathematical Statistics.
Instituto Nacional de Matematica Pura e Aplicada, 2018. https://doi.org/10.30757/ALEA.v15-49.
ieee: P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,”
Latin American Journal of Probability and Mathematical Statistics, vol.
15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018.
ista: Nejjar P. 2018. Transition to shocks in TASEP and decoupling of last passage
times. Latin American Journal of Probability and Mathematical Statistics. 15(2),
1311–1334.
mla: Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage
Times.” Latin American Journal of Probability and Mathematical Statistics,
vol. 15, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2018, pp. 1311–34,
doi:10.30757/ALEA.v15-49.
short: P. Nejjar, Latin American Journal of Probability and Mathematical Statistics
15 (2018) 1311–1334.
date_created: 2018-12-11T11:44:28Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2025-04-14T07:27:49Z
day: '01'
ddc:
- '510'
department:
- _id: LaEr
- _id: JaMa
doi: 10.30757/ALEA.v15-49
ec_funded: 1
external_id:
arxiv:
- '1705.08836'
isi:
- '000460475800022'
file:
- access_level: open_access
checksum: 2ded46aa284a836a8cbb34133a64f1cb
content_type: application/pdf
creator: kschuh
date_created: 2019-02-14T09:44:10Z
date_updated: 2020-07-14T12:47:46Z
file_id: '5981'
file_name: 2018_ALEA_Nejjar.pdf
file_size: 394851
relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 1311-1334
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
publication: Latin American Journal of Probability and Mathematical Statistics
publication_identifier:
issn:
- 1980-0436
publication_status: published
publisher: Instituto Nacional de Matematica Pura e Aplicada
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transition to shocks in TASEP and decoupling of last passage times
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2018'
...
---
_id: '738'
abstract:
- lang: eng
text: 'This paper is devoted to automatic competitive analysis of real-time scheduling
algorithms for firm-deadline tasksets, where only completed tasks con- tribute
some utility to the system. Given such a taskset T , the competitive ratio of
an on-line scheduling algorithm A for T is the worst-case utility ratio of A over
the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative
graph games to address the competitive analysis and competitive synthesis problems.
For the competitive analysis case, given any taskset T and any finite-memory on-
line scheduling algorithm A , we show that the competitive ratio of A in T can
be computed in polynomial time in the size of the state space of A . Our approach
is flexible as it also provides ways to model meaningful constraints on the released
task sequences that determine the competitive ratio. We provide an experimental
study of many well-known on-line scheduling algorithms, which demonstrates the
feasibility of our competitive analysis approach that effectively replaces human
ingenuity (required Preliminary versions of this paper have appeared in Chatterjee
et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu
Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid
s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria),
Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group,
Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time
Syst for finding worst-case scenarios) by computing power. For the competitive
synthesis case, we are just given a taskset T , and the goal is to automatically
synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees
the largest competitive ratio possible for T . We show how the competitive synthesis
problem can be reduced to a two-player graph game with partial information, and
establish that the compu- tational complexity of solving this game is Np -complete.
The competitive synthesis problem is hence in Np in the size of the state space
of the non-deterministic labeled transition system encoding the taskset. Overall,
the proposed framework assists in the selection of suitable scheduling algorithms
for a given taskset, which is in fact the most common situation in real-time systems
design. '
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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Alexander
full_name: Kößler, Alexander
last_name: Kößler
- first_name: Ulrich
full_name: Schmid, Ulrich
last_name: Schmid
citation:
ama: Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis
of real time scheduling with graph games. Real-Time Systems. 2018;54(1):166-207.
doi:10.1007/s11241-017-9293-4
apa: Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated
competitive analysis of real time scheduling with graph games. Real-Time Systems.
Springer. https://doi.org/10.1007/s11241-017-9293-4
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich
Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.”
Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4.
ieee: K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive
analysis of real time scheduling with graph games,” Real-Time Systems,
vol. 54, no. 1. Springer, pp. 166–207, 2018.
ista: Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive
analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.
mla: Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time
Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer,
2018, pp. 166–207, doi:10.1007/s11241-017-9293-4.
short: K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54
(2018) 166–207.
corr_author: '1'
date_created: 2018-12-11T11:48:14Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2025-04-15T08:12:27Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/s11241-017-9293-4
ec_funded: 1
external_id:
isi:
- '000419955500006'
file:
- access_level: open_access
checksum: c2590ef160709d8054cf29ee173f1454
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:14Z
date_updated: 2020-07-14T12:47:56Z
file_id: '5267'
file_name: IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf
file_size: 1163507
relation: main_file
file_date_updated: 2020-07-14T12:47:56Z
has_accepted_license: '1'
intvolume: ' 54'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 166 - 207
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Real-Time Systems
publication_status: published
publisher: Springer
publist_id: '6929'
pubrep_id: '960'
quality_controlled: '1'
related_material:
record:
- id: '2820'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Automated competitive analysis of real time scheduling with 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: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 54
year: '2018'
...
---
_id: '7407'
abstract:
- lang: eng
text: 'Proofs of space (PoS) [Dziembowski et al., CRYPTO''15] are proof systems
where a prover can convince a verifier that he "wastes" disk space. PoS were introduced
as a more ecological and economical replacement for proofs of work which are currently
used to secure blockchains like Bitcoin. In this work we investigate extensions
of PoS which allow the prover to embed useful data into the dedicated space, which
later can be recovered. Our first contribution is a security proof for the original
PoS from CRYPTO''15 in the random oracle model (the original proof only applied
to a restricted class of adversaries which can store a subset of the data an honest
prover would store). When this PoS is instantiated with recent constructions of
maximally depth robust graphs, our proof implies basically optimal security. As
a second contribution we show three different extensions of this PoS where useful
data can be embedded into the space required by the prover. Our security proof
for the PoS extends (non-trivially) to these constructions. We discuss how some
of these variants can be used as proofs of catalytic space (PoCS), a notion we
put forward in this work, and which basically is a PoS where most of the space
required by the prover can be used to backup useful data. Finally we discuss how
one of the extensions is a candidate construction for a proof of replication (PoR),
a proof system recently suggested in the Filecoin whitepaper. '
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical
Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59'
apa: 'Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations
in Theoretical Computer Science Conference (Vol. 124, p. 59:1-59:25). San
Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.59'
chicago: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations
in Theoretical Computer Science Conference, 124:59:1-59:25. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59.
ieee: K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical
Computer Science Conference, San Diego, CA, United States, 2018, vol. 124,
p. 59:1-59:25.
ista: 'Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical
Computer Science Conference. ITCS: Innovations in Theoretical Computer Science,
LIPIcs, vol. 124, 59:1-59:25.'
mla: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in
Theoretical Computer Science Conference, vol. 124, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.
short: K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.
conference:
end_date: 2019-01-12
location: San Diego, CA, United States
name: 'ITCS: Innovations in Theoretical Computer Science'
start_date: 2019-01-10
corr_author: '1'
date_created: 2020-01-30T09:16:05Z
date_published: 2018-12-31T00:00:00Z
date_updated: 2025-07-03T11:55:28Z
day: '31'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.4230/LIPICS.ITCS.2019.59
ec_funded: 1
file:
- access_level: open_access
checksum: 5cebb7f7849a3beda898f697d755dd96
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T08:17:52Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7443'
file_name: 2018_LIPIcs_Pietrzak.pdf
file_size: 822884
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 124'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/194
month: '12'
oa: 1
oa_version: Published Version
page: 59:1-59:25
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 10th Innovations in Theoretical Computer Science Conference
publication_identifier:
isbn:
- 978-3-95977-095-8
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Proofs of catalytic space
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 124
year: '2018'
...
---
_id: '21'
abstract:
- lang: eng
text: Parvalbumin-positive (PV+) GABAergic interneurons in hippocampal microcircuits
are thought to play a key role in several higher network functions, such as feedforward
and feedback inhibition, network oscillations, and pattern separation. Fast lateral
inhibition mediated by GABAergic interneurons may implement a winner-takes-all
mechanism in the hippocampal input layer. However, it is not clear whether the
functional connectivity rules of granule cells (GCs) and interneurons in the dentate
gyrus are consistent with such a mechanism. Using simultaneous patch-clamp recordings
from up to seven GCs and up to four PV+ interneurons in the dentate gyrus, we
find that connectivity is structured in space, synapse-specific, and enriched
in specific disynaptic motifs. In contrast to the neocortex, lateral inhibition
in the dentate gyrus (in which a GC inhibits neighboring GCs via a PV+ interneuron)
is ~ 10-times more abundant than recurrent inhibition (in which a GC inhibits
itself). Thus, unique connectivity rules may enable the dentate gyrus to perform
specific higher-order computations
acknowledgement: This project received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 692692) and the Fond zur Förderung der Wissenschaftlichen Forschung
(Z 312-B27, Wittgenstein award), both to P.J..
article_number: '4605'
article_processing_charge: No
article_type: original
author:
- first_name: 'Claudia '
full_name: 'Espinoza Martinez, Claudia '
id: 31FFEE2E-F248-11E8-B48F-1D18A9856A87
last_name: Espinoza Martinez
orcid: 0000-0003-4710-2082
- first_name: José
full_name: Guzmán, José
id: 30CC5506-F248-11E8-B48F-1D18A9856A87
last_name: Guzmán
orcid: 0000-0003-2209-5242
- first_name: Xiaomin
full_name: Zhang, Xiaomin
id: 423EC9C2-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
orcid: 0000-0003-0256-6529
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. Parvalbumin+ interneurons
obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit
in dentate gyrus. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-06899-3
apa: Espinoza Martinez, C., Guzmán, J., Zhang, X., & Jonas, P. M. (2018). Parvalbumin+
interneurons obey unique connectivity rules and establish a powerful lateral-inhibition
microcircuit in dentate gyrus. Nature Communications. Nature Publishing
Group. https://doi.org/10.1038/s41467-018-06899-3
chicago: Espinoza Martinez, Claudia , José Guzmán, Xiaomin Zhang, and Peter M Jonas.
“Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful
Lateral-Inhibition Microcircuit in Dentate Gyrus.” Nature Communications.
Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-06899-3.
ieee: C. Espinoza Martinez, J. Guzmán, X. Zhang, and P. M. Jonas, “Parvalbumin+
interneurons obey unique connectivity rules and establish a powerful lateral-inhibition
microcircuit in dentate gyrus,” Nature Communications, vol. 9, no. 1. Nature
Publishing Group, 2018.
ista: Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. 2018. Parvalbumin+ interneurons
obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit
in dentate gyrus. Nature Communications. 9(1), 4605.
mla: Espinoza Martinez, Claudia, et al. “Parvalbumin+ Interneurons Obey Unique Connectivity
Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.”
Nature Communications, vol. 9, no. 1, 4605, Nature Publishing Group, 2018,
doi:10.1038/s41467-018-06899-3.
short: C. Espinoza Martinez, J. Guzmán, X. Zhang, P.M. Jonas, Nature Communications
9 (2018).
date_created: 2018-12-11T11:44:12Z
date_published: 2018-11-02T00:00:00Z
date_updated: 2026-07-04T22:30:37Z
day: '02'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1038/s41467-018-06899-3
ec_funded: 1
external_id:
isi:
- '000449069700009'
file:
- access_level: open_access
checksum: 9fe2a63bd95a5067d896c087d07998f3
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T15:41:57Z
date_updated: 2020-07-14T12:45:28Z
file_id: '5715'
file_name: 2018_NatureComm_Espinoza.pdf
file_size: 4651930
relation: main_file
file_date_updated: 2020-07-14T12:45:28Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glutamatergic synapse
- _id: 25C5A090-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00312
name: Synaptic communication in neuronal microcircuits
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '8034'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/lateral-inhibition-keeps-similar-memories-apart/
record:
- id: '6363'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful
lateral-inhibition microcircuit in dentate gyrus
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 9
year: '2018'
...
---
_id: '5816'
abstract:
- lang: eng
text: Solid-state qubit manipulation and read-out fidelities are reaching fault-tolerance,
but quantum error correction requires millions of physical qubits and therefore
a scalable quantum computer architecture. To solve signal-line bandwidth and fan-out
problems, microwave sources required for qubit manipulation might be embedded
close to the qubit chip, typically operating at temperatures below 4 K. Here,
we perform the first low temperature measurements of a 130 nm BiCMOS based SiGe
voltage controlled oscillator at cryogenic temperature. We determined the frequency
and output power dependence on temperature and magnetic field up to 5 T and measured
the temperature influence on its noise performance. The device maintains its full
functionality from 300 K to 4 K. The carrier frequency at 4 K increases by 3%
with respect to the carrier frequency at 300 K, and the output power at 4 K increases
by 10 dB relative to the output power at 300 K. The frequency tuning range of
approximately 20% remains unchanged between 300 K and 4 K. In an in-plane magnetic
field of 5 T, the carrier frequency shifts by only 0.02% compared to the frequency
at zero magnetic field.
article_number: '114701'
article_processing_charge: No
arxiv: 1
author:
- first_name: Arne
full_name: Hollmann, Arne
last_name: Hollmann
- first_name: Daniel
full_name: Jirovec, Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
orcid: 0000-0002-7197-4801
- first_name: Maciej
full_name: Kucharski, Maciej
last_name: Kucharski
- first_name: Dietmar
full_name: Kissinger, Dietmar
last_name: Kissinger
- first_name: Gunter
full_name: Fischer, Gunter
last_name: Fischer
- first_name: Lars R.
full_name: Schreiber, Lars R.
last_name: Schreiber
citation:
ama: Hollmann A, Jirovec D, Kucharski M, Kissinger D, Fischer G, Schreiber LR. 30
GHz-voltage controlled oscillator operating at 4 K. Review of Scientific Instruments.
2018;89(11). doi:10.1063/1.5038258
apa: Hollmann, A., Jirovec, D., Kucharski, M., Kissinger, D., Fischer, G., &
Schreiber, L. R. (2018). 30 GHz-voltage controlled oscillator operating at 4 K.
Review of Scientific Instruments. AIP Publishing. https://doi.org/10.1063/1.5038258
chicago: Hollmann, Arne, Daniel Jirovec, Maciej Kucharski, Dietmar Kissinger, Gunter
Fischer, and Lars R. Schreiber. “30 GHz-Voltage Controlled Oscillator Operating
at 4 K.” Review of Scientific Instruments. AIP Publishing, 2018. https://doi.org/10.1063/1.5038258.
ieee: A. Hollmann, D. Jirovec, M. Kucharski, D. Kissinger, G. Fischer, and L. R.
Schreiber, “30 GHz-voltage controlled oscillator operating at 4 K,” Review
of Scientific Instruments, vol. 89, no. 11. AIP Publishing, 2018.
ista: Hollmann A, Jirovec D, Kucharski M, Kissinger D, Fischer G, Schreiber LR.
2018. 30 GHz-voltage controlled oscillator operating at 4 K. Review of Scientific
Instruments. 89(11), 114701.
mla: Hollmann, Arne, et al. “30 GHz-Voltage Controlled Oscillator Operating at 4
K.” Review of Scientific Instruments, vol. 89, no. 11, 114701, AIP Publishing,
2018, doi:10.1063/1.5038258.
short: A. Hollmann, D. Jirovec, M. Kucharski, D. Kissinger, G. Fischer, L.R. Schreiber,
Review of Scientific Instruments 89 (2018).
date_created: 2019-01-10T14:22:23Z
date_published: 2018-11-01T00:00:00Z
date_updated: 2026-07-04T22:30:44Z
day: '01'
department:
- _id: GeKa
doi: 10.1063/1.5038258
external_id:
arxiv:
- '1804.09522'
isi:
- '000451735700054'
intvolume: ' 89'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.09522
month: '11'
oa: 1
oa_version: Preprint
publication: Review of Scientific Instruments
publication_identifier:
issn:
- 0034-6748
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
related_material:
record:
- id: '10058'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 30 GHz-voltage controlled oscillator operating at 4 K
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 89
year: '2018'
...
---
_id: '323'
abstract:
- lang: eng
text: 'In the here presented thesis, we explore the role of branched actin networks
in cell migration and antigen presentation, the two most relevant processes in
dendritic cell biology. Branched actin networks construct lamellipodial protrusions
at the leading edge of migrating cells. These are typically seen as adhesive structures,
which mediate force transduction to the extracellular matrix that leads to forward
locomotion. We ablated Arp2/3 nucleation promoting factor WAVE in DCs and found
that the resulting cells lack lamellipodial protrusions. Instead, depending on
the maturation state, one or multiple filopodia were formed. By challenging these
cells in a variety of migration assays we found that lamellipodial protrusions
are dispensable for the locomotion of leukocytes and actually dampen the speed
of migration. However, lamellipodia are critically required to negotiate complex
environments that DCs experience while they travel to the next draining lymph
node. Taken together our results suggest that leukocyte lamellipodia have rather
a sensory- than a force transducing function. Furthermore, we show for the first
time structure and dynamics of dendritic cell F-actin at the immunological synapse
with naïve T cells. Dendritic cell F-actin appears as dynamic foci that are nucleated
by the Arp2/3 complex. WAVE ablated dendritic cells show increased membrane tension,
leading to an altered ultrastructure of the immunological synapse and severe T
cell priming defects. These results point towards a previously unappreciated role
of the cellular mechanics of dendritic cells in T cell activation. Additionally,
we present a novel cell culture based system for the differentiation of dendritic
cells from conditionally immortalized hematopoietic precursors. These precursor
cells are genetically tractable via the CRISPR/Cas9 system while they retain their
ability to differentiate into highly migratory dendritic cells and other immune
cells. This will foster the study of all aspects of dendritic cell biology and
beyond. '
acknowledged_ssus:
- _id: NanoFab
- _id: Bio
- _id: PreCl
- _id: EM-Fac
acknowledgement: "First of all I would like to thank Michael Sixt for giving me the
opportunity to work in \r\nhis group and for his support throughout the years. He
is a truly inspiring person and \r\nthe best boss one can imagine. I would
\ also like to thank all current and past \r\nmembers of the Sixt group for
their help and the great working atmosphere in the lab. \r\nIt is a true privilege
to work with such a bright, funny and friendly group of people and \r\nI’m proud
\ that I could be part of it. Furthermore, I would like to say ‘thank
\ you’ to Daria Siekhaus for all the meetings and discussion we had throughout
the years \r\nand to Federica Benvenuti for being part of my committee.
\ I am also grateful to Jack \r\nMerrin in the nanofabrication facility
\ and all the people working in the bioimaging-\r\n, the electron microscopy-
and the preclinical facilities."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Alexander F
full_name: Leithner, Alexander F
id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
last_name: Leithner
orcid: 0000-0002-1073-744X
citation:
ama: Leithner AF. Branched actin networks in dendritic cell biology. 2018. doi:10.15479/AT:ISTA:th_998
apa: Leithner, A. F. (2018). Branched actin networks in dendritic cell biology.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_998
chicago: Leithner, Alexander F. “Branched Actin Networks in Dendritic Cell Biology.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_998.
ieee: A. F. Leithner, “Branched actin networks in dendritic cell biology,” Institute
of Science and Technology Austria, 2018.
ista: Leithner AF. 2018. Branched actin networks in dendritic cell biology. Institute
of Science and Technology Austria.
mla: Leithner, Alexander F. Branched Actin Networks in Dendritic Cell Biology.
Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_998.
short: A.F. Leithner, Branched Actin Networks in Dendritic Cell Biology, Institute
of Science and Technology Austria, 2018.
corr_author: '1'
date_created: 2018-12-11T11:45:49Z
date_published: 2018-04-12T00:00:00Z
date_updated: 2025-09-22T08:27:34Z
day: '12'
ddc:
- '571'
- '599'
- '610'
degree_awarded: PhD
department:
- _id: MiSi
doi: 10.15479/AT:ISTA:th_998
file:
- access_level: closed
checksum: d5e3edbac548c26c1fa43a4b37a54a4c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T09:23:11Z
date_updated: 2021-02-11T23:30:17Z
embargo_to: open_access
file_id: '6219'
file_name: PhD_thesis_AlexLeithner_final_version.docx
file_size: 29027671
relation: source_file
- access_level: open_access
checksum: 071f7476db29e41146824ebd0697cb10
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T09:23:11Z
date_updated: 2021-02-11T11:17:16Z
embargo: 2019-04-15
file_id: '6220'
file_name: PhD_thesis_AlexLeithner.pdf
file_size: 66045341
relation: main_file
file_date_updated: 2021-02-11T23:30:17Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '99'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7542'
pubrep_id: '998'
related_material:
record:
- id: '1321'
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: Branched actin networks in dendritic cell biology
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: '2018'
...
---
_id: '66'
abstract:
- lang: eng
text: 'Crypto-currencies are digital assets designed to work as a medium of exchange,
e.g., Bitcoin, but they are susceptible to attacks (dishonest behavior of participants).
A framework for the analysis of attacks in crypto-currencies requires (a) modeling
of game-theoretic aspects to analyze incentives for deviation from honest behavior;
(b) concurrent interactions between participants; and (c) analysis of long-term
monetary gains. Traditional game-theoretic approaches for the analysis of security
protocols consider either qualitative temporal properties such as safety and termination,
or the very special class of one-shot (stateless) games. However, to analyze general
attacks on protocols for crypto-currencies, both stateful analysis and quantitative
objectives are necessary. In this work our main contributions are as follows:
(a) we show how a class of concurrent mean-payo games, namely ergodic games, can
model various attacks that arise naturally in crypto-currencies; (b) we present
the first practical implementation of algorithms for ergodic games that scales
to model realistic problems for crypto-currencies; and (c) we present experimental
results showing that our framework can handle games with thousands of states and
millions of transitions.'
alternative_title:
- LIPIcs
article_number: '11'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. Ergodic mean-payoff
games for the analysis of attacks in crypto-currencies. In: Vol 118. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.11'
apa: 'Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Velner, Y. (2018).
Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol.
118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11'
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen,
and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,”
Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11.
ieee: 'K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic
mean-payoff games for the analysis of attacks in crypto-currencies,” presented
at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.'
ista: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff
games for the analysis of attacks in crypto-currencies. CONCUR: Conference on
Concurrency Theory, LIPIcs, vol. 118, 11.'
mla: Chatterjee, Krishnendu, et al. Ergodic Mean-Payoff Games for the Analysis
of Attacks in Crypto-Currencies. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.11.
short: K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
conference:
end_date: 2018-09-07
location: Beijing, China
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:27Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2026-07-04T22:31:08Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CONCUR.2018.11
ec_funded: 1
external_id:
arxiv:
- '1806.03108'
file:
- access_level: open_access
checksum: 68a055b1aaa241cc38375083cf832a7d
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:08:00Z
date_updated: 2020-07-14T12:47:34Z
file_id: '5696'
file_name: 2018_CONCUR_Chatterjee.pdf
file_size: 1078309
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
intvolume: ' 118'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
publication_identifier:
isbn:
- 978-3-95977-087-3
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7988'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Ergodic mean-payoff games for the analysis of attacks in crypto-currencies
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 118
year: '2018'
...
---
_id: '311'
abstract:
- lang: eng
text: 'Smart contracts are computer programs that are executed by a network of mutually
distrusting agents, without the need of an external trusted authority. Smart contracts
handle and transfer assets of considerable value (in the form of crypto-currency
like Bitcoin). Hence, it is crucial that their implementation is bug-free. We
identify the utility (or expected payoff) of interacting with such smart contracts
as the basic and canonical quantitative property for such contracts. We present
a framework for such quantitative analysis of smart contracts. Such a formal framework
poses new and novel research challenges in programming languages, as it requires
modeling of game-theoretic aspects to analyze incentives for deviation from honest
behavior and modeling utilities which are not specified as standard temporal properties
such as safety and termination. While game-theoretic incentives have been analyzed
in the security community, their analysis has been restricted to the very special
case of stateless games. However, to analyze smart contracts, stateful analysis
is required as it must account for the different program states of the protocol.
Our main contributions are as follows: we present (i)~a simplified programming
language for smart contracts; (ii)~an automatic translation of the programs to
state-based games; (iii)~an abstraction-refinement approach to solve such games;
and (iv)~experimental results on real-world-inspired smart contracts.'
acknowledgement: 'The research was partially supported by Vienna Science and Technology
Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23
(RiSE/SHiNE), and ERC Starting grant (279307: Graph Games).'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: 'Chatterjee K, Goharshady AK, Velner Y. Quantitative analysis of smart contracts.
In: Vol 10801. Springer; 2018:739-767. doi:10.1007/978-3-319-89884-1_26'
apa: 'Chatterjee, K., Goharshady, A. K., & Velner, Y. (2018). Quantitative analysis
of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European
Symposium on Programming, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89884-1_26'
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative
Analysis of Smart Contracts,” 10801:739–67. Springer, 2018. https://doi.org/10.1007/978-3-319-89884-1_26.
ieee: 'K. Chatterjee, A. K. Goharshady, and Y. Velner, “Quantitative analysis of
smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki,
Greece, 2018, vol. 10801, pp. 739–767.'
ista: 'Chatterjee K, Goharshady AK, Velner Y. 2018. Quantitative analysis of smart
contracts. ESOP: European Symposium on Programming, LNCS, vol. 10801, 739–767.'
mla: Chatterjee, Krishnendu, et al. Quantitative Analysis of Smart Contracts.
Vol. 10801, Springer, 2018, pp. 739–67, doi:10.1007/978-3-319-89884-1_26.
short: K. Chatterjee, A.K. Goharshady, Y. Velner, in:, Springer, 2018, pp. 739–767.
conference:
end_date: 2018-04-19
location: Thessaloniki, Greece
name: 'ESOP: European Symposium on Programming'
start_date: 2018-04-16
date_created: 2018-12-11T11:45:45Z
date_published: 2018-04-01T00:00:00Z
date_updated: 2026-07-04T22:31:08Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-319-89884-1_26
ec_funded: 1
file:
- access_level: open_access
checksum: 9c8a8338c571903b599b6ca93abd2cce
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T15:45:49Z
date_updated: 2020-07-14T12:46:00Z
file_id: '5716'
file_name: 2018_ESOP_Chatterjee.pdf
file_size: 1394993
relation: main_file
file_date_updated: 2020-07-14T12:46:00Z
has_accepted_license: '1'
intvolume: ' 10801'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 739 - 767
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Springer
publist_id: '7554'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Quantitative analysis of smart contracts
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10801
year: '2018'
...