---
_id: '8013'
article_number: e1007049
article_processing_charge: No
article_type: original
author:
- first_name: Christopher B.
  full_name: Currin, Christopher B.
  last_name: Currin
- first_name: Phumlani N.
  full_name: Khoza, Phumlani N.
  last_name: Khoza
- first_name: Alexander D.
  full_name: Antrobus, Alexander D.
  last_name: Antrobus
- first_name: Peter E.
  full_name: Latham, Peter E.
  last_name: Latham
- first_name: Tim P
  full_name: Vogels, Tim P
  id: CB6FF8D2-008F-11EA-8E08-2637E6697425
  last_name: Vogels
  orcid: 0000-0003-3295-6181
- first_name: Joseph V.
  full_name: Raimondo, Joseph V.
  last_name: Raimondo
citation:
  ama: 'Currin CB, Khoza PN, Antrobus AD, Latham PE, Vogels TP, Raimondo JV. Think:
    Theory for Africa. <i>PLOS Computational Biology</i>. 2019;15(7). doi:<a href="https://doi.org/10.1371/journal.pcbi.1007049">10.1371/journal.pcbi.1007049</a>'
  apa: 'Currin, C. B., Khoza, P. N., Antrobus, A. D., Latham, P. E., Vogels, T. P.,
    &#38; Raimondo, J. V. (2019). Think: Theory for Africa. <i>PLOS Computational
    Biology</i>. Public Library of Science. <a href="https://doi.org/10.1371/journal.pcbi.1007049">https://doi.org/10.1371/journal.pcbi.1007049</a>'
  chicago: 'Currin, Christopher B., Phumlani N. Khoza, Alexander D. Antrobus, Peter
    E. Latham, Tim P Vogels, and Joseph V. Raimondo. “Think: Theory for Africa.” <i>PLOS
    Computational Biology</i>. Public Library of Science, 2019. <a href="https://doi.org/10.1371/journal.pcbi.1007049">https://doi.org/10.1371/journal.pcbi.1007049</a>.'
  ieee: 'C. B. Currin, P. N. Khoza, A. D. Antrobus, P. E. Latham, T. P. Vogels, and
    J. V. Raimondo, “Think: Theory for Africa,” <i>PLOS Computational Biology</i>,
    vol. 15, no. 7. Public Library of Science, 2019.'
  ista: 'Currin CB, Khoza PN, Antrobus AD, Latham PE, Vogels TP, Raimondo JV. 2019.
    Think: Theory for Africa. PLOS Computational Biology. 15(7), e1007049.'
  mla: 'Currin, Christopher B., et al. “Think: Theory for Africa.” <i>PLOS Computational
    Biology</i>, vol. 15, no. 7, e1007049, Public Library of Science, 2019, doi:<a
    href="https://doi.org/10.1371/journal.pcbi.1007049">10.1371/journal.pcbi.1007049</a>.'
  short: C.B. Currin, P.N. Khoza, A.D. Antrobus, P.E. Latham, T.P. Vogels, J.V. Raimondo,
    PLOS Computational Biology 15 (2019).
date_created: 2020-06-25T12:50:39Z
date_published: 2019-07-11T00:00:00Z
date_updated: 2021-01-12T08:16:31Z
day: '11'
ddc:
- '570'
doi: 10.1371/journal.pcbi.1007049
extern: '1'
external_id:
  pmid:
  - '31295253'
file:
- access_level: open_access
  checksum: 723bdfb6ee5c747cbbb32baf01d17fad
  content_type: application/pdf
  creator: cziletti
  date_created: 2020-07-02T12:22:57Z
  date_updated: 2020-07-14T12:48:08Z
  file_id: '8079'
  file_name: 2019_PlosCompBio_Currin.pdf
  file_size: 773969
  relation: main_file
file_date_updated: 2020-07-14T12:48:08Z
has_accepted_license: '1'
intvolume: '        15'
issue: '7'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLOS Computational Biology
publication_identifier:
  issn:
  - 1553-7358
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
status: public
title: 'Think: Theory for Africa'
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: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 15
year: '2019'
...
---
_id: '8014'
abstract:
- lang: eng
  text: 'Working memory, the ability to keep recently accessed information available
    for immediate manipulation, has been proposed to rely on two mechanisms that appear
    difficult to reconcile: self-sustained neural firing, or the opposite—activity-silent
    synaptic traces. Here we review and contrast models of these two mechanisms, and
    then show that both phenomena can co-exist within a unified system in which neurons
    hold information in both activity and synapses. Rapid plasticity in flexibly-coding
    neurons allows features to be bound together into objects, with an important emergent
    property being the focus of attention. One memory item is held by persistent activity
    in an attended or “focused” state, and is thus remembered better than other items.
    Other, previously attended items can remain in memory but in the background, encoded
    in activity-silent synaptic traces. This dual functional architecture provides
    a unified common mechanism accounting for a diversity of perplexing attention
    and memory effects that have been hitherto difficult to explain in a single theoretical
    framework.'
article_processing_charge: No
article_type: original
author:
- first_name: Sanjay G.
  full_name: Manohar, Sanjay G.
  last_name: Manohar
- first_name: Nahid
  full_name: Zokaei, Nahid
  last_name: Zokaei
- first_name: Sean J.
  full_name: Fallon, Sean J.
  last_name: Fallon
- first_name: Tim P
  full_name: Vogels, Tim P
  id: CB6FF8D2-008F-11EA-8E08-2637E6697425
  last_name: Vogels
  orcid: 0000-0003-3295-6181
- first_name: Masud
  full_name: Husain, Masud
  last_name: Husain
citation:
  ama: Manohar SG, Zokaei N, Fallon SJ, Vogels TP, Husain M. Neural mechanisms of
    attending to items in working memory. <i>Neuroscience and Biobehavioral Reviews</i>.
    2019;101:1-12. doi:<a href="https://doi.org/10.1016/j.neubiorev.2019.03.017">10.1016/j.neubiorev.2019.03.017</a>
  apa: Manohar, S. G., Zokaei, N., Fallon, S. J., Vogels, T. P., &#38; Husain, M.
    (2019). Neural mechanisms of attending to items in working memory. <i>Neuroscience
    and Biobehavioral Reviews</i>. Elsevier . <a href="https://doi.org/10.1016/j.neubiorev.2019.03.017">https://doi.org/10.1016/j.neubiorev.2019.03.017</a>
  chicago: Manohar, Sanjay G., Nahid Zokaei, Sean J. Fallon, Tim P Vogels, and Masud
    Husain. “Neural Mechanisms of Attending to Items in Working Memory.” <i>Neuroscience
    and Biobehavioral Reviews</i>. Elsevier , 2019. <a href="https://doi.org/10.1016/j.neubiorev.2019.03.017">https://doi.org/10.1016/j.neubiorev.2019.03.017</a>.
  ieee: S. G. Manohar, N. Zokaei, S. J. Fallon, T. P. Vogels, and M. Husain, “Neural
    mechanisms of attending to items in working memory,” <i>Neuroscience and Biobehavioral
    Reviews</i>, vol. 101. Elsevier , pp. 1–12, 2019.
  ista: Manohar SG, Zokaei N, Fallon SJ, Vogels TP, Husain M. 2019. Neural mechanisms
    of attending to items in working memory. Neuroscience and Biobehavioral Reviews.
    101, 1–12.
  mla: Manohar, Sanjay G., et al. “Neural Mechanisms of Attending to Items in Working
    Memory.” <i>Neuroscience and Biobehavioral Reviews</i>, vol. 101, Elsevier , 2019,
    pp. 1–12, doi:<a href="https://doi.org/10.1016/j.neubiorev.2019.03.017">10.1016/j.neubiorev.2019.03.017</a>.
  short: S.G. Manohar, N. Zokaei, S.J. Fallon, T.P. Vogels, M. Husain, Neuroscience
    and Biobehavioral Reviews 101 (2019) 1–12.
date_created: 2020-06-25T12:52:13Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2021-01-12T08:16:31Z
day: '01'
ddc:
- '570'
doi: 10.1016/j.neubiorev.2019.03.017
extern: '1'
external_id:
  pmid:
  - '30922977'
file:
- access_level: open_access
  checksum: 7b972e3d6f7bb3122c8c5648f44e60ca
  content_type: application/pdf
  creator: cziletti
  date_created: 2020-07-02T13:17:52Z
  date_updated: 2020-07-14T12:48:08Z
  file_id: '8080'
  file_name: 2019_NeurosBiobehavRev_Manohar.pdf
  file_size: 1754418
  relation: main_file
file_date_updated: 2020-07-14T12:48:08Z
has_accepted_license: '1'
intvolume: '       101'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: 'https://doi.org/10.1101/233007 '
month: '06'
oa: 1
oa_version: Published Version
page: 1-12
pmid: 1
publication: Neuroscience and Biobehavioral Reviews
publication_identifier:
  issn:
  - 0149-7634
publication_status: published
publisher: 'Elsevier '
quality_controlled: '1'
status: public
title: Neural mechanisms of attending to items in working memory
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: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 101
year: '2019'
...
---
_id: '8175'
abstract:
- lang: eng
  text: We study edge asymptotics of poissonized Plancherel-type measures on skew
    Young diagrams (integer partitions). These measures can be seen as generalizations
    of those studied by Baik--Deift--Johansson and Baik--Rains in resolving Ulam's
    problem on longest increasing subsequences of random permutations and the last
    passage percolation (corner growth) discrete versions thereof. Moreover they interpolate
    between said measures and the uniform measure on partitions. In the new KPZ-like
    1/3 exponent edge scaling limit with logarithmic corrections, we find new probability
    distributions generalizing the classical Tracy--Widom GUE, GOE and GSE distributions
    from the theory of random matrices.
acknowledgement: "D.B. is especially grateful to Patrik Ferrari for suggesting simplifications
  in Section 3 and\r\nto Alessandra Occelli for suggesting the name for the models
  of Section 2.\r\n"
article_number: '34'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan
  full_name: Betea, Dan
  last_name: Betea
- first_name: Jérémie
  full_name: Bouttier, Jérémie
  last_name: Bouttier
- first_name: Peter
  full_name: Nejjar, Peter
  id: 4BF426E2-F248-11E8-B48F-1D18A9856A87
  last_name: Nejjar
- first_name: Mirjana
  full_name: Vuletíc, Mirjana
  last_name: Vuletíc
citation:
  ama: 'Betea D, Bouttier J, Nejjar P, Vuletíc M. New edge asymptotics of skew Young
    diagrams via free boundaries. In: <i>Proceedings on the 31st International Conference
    on Formal Power Series and Algebraic Combinatorics</i>. Formal Power Series and
    Algebraic Combinatorics; 2019.'
  apa: 'Betea, D., Bouttier, J., Nejjar, P., &#38; Vuletíc, M. (2019). New edge asymptotics
    of skew Young diagrams via free boundaries. In <i>Proceedings on the 31st International
    Conference on Formal Power Series and Algebraic Combinatorics</i>. Ljubljana,
    Slovenia: Formal Power Series and Algebraic Combinatorics.'
  chicago: Betea, Dan, Jérémie Bouttier, Peter Nejjar, and Mirjana Vuletíc. “New Edge
    Asymptotics of Skew Young Diagrams via Free Boundaries.” In <i>Proceedings on
    the 31st International Conference on Formal Power Series and Algebraic Combinatorics</i>.
    Formal Power Series and Algebraic Combinatorics, 2019.
  ieee: D. Betea, J. Bouttier, P. Nejjar, and M. Vuletíc, “New edge asymptotics of
    skew Young diagrams via free boundaries,” in <i>Proceedings on the 31st International
    Conference on Formal Power Series and Algebraic Combinatorics</i>, Ljubljana,
    Slovenia, 2019.
  ista: 'Betea D, Bouttier J, Nejjar P, Vuletíc M. 2019. New edge asymptotics of skew
    Young diagrams via free boundaries. Proceedings on the 31st International Conference
    on Formal Power Series and Algebraic Combinatorics. FPSAC: International Conference
    on Formal Power Series and Algebraic Combinatorics, 34.'
  mla: Betea, Dan, et al. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.”
    <i>Proceedings on the 31st International Conference on Formal Power Series and
    Algebraic Combinatorics</i>, 34, Formal Power Series and Algebraic Combinatorics,
    2019.
  short: D. Betea, J. Bouttier, P. Nejjar, M. Vuletíc, in:, Proceedings on the 31st
    International Conference on Formal Power Series and Algebraic Combinatorics, Formal
    Power Series and Algebraic Combinatorics, 2019.
conference:
  end_date: 2019-07-05
  location: Ljubljana, Slovenia
  name: 'FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics'
  start_date: 2019-07-01
date_created: 2020-07-26T22:01:04Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2021-01-12T08:17:18Z
day: '01'
department:
- _id: LaEr
ec_funded: 1
external_id:
  arxiv:
  - '1902.08750'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1902.08750
month: '07'
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
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '716117'
  name: Optimal Transport and Stochastic Dynamics
publication: Proceedings on the 31st International Conference on Formal Power Series
  and Algebraic Combinatorics
publication_status: published
publisher: Formal Power Series and Algebraic Combinatorics
quality_controlled: '1'
scopus_import: '1'
status: public
title: New edge asymptotics of skew Young diagrams via free boundaries
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8182'
abstract:
- lang: eng
  text: "Suppose that $n\\neq p^k$ and $n\\neq 2p^k$ for all $k$ and all primes $p$.
    We prove that for any Hausdorff compactum $X$ with a free action of the symmetric
    group $\\mathfrak S_n$ there exists an $\\mathfrak S_n$-equivariant map $X \\to\r\n{\\mathbb
    R}^n$ whose image avoids the diagonal $\\{(x,x\\dots,x)\\in {\\mathbb R}^n|x\\in
    {\\mathbb R}\\}$.\r\n  Previously, the special cases of this statement for certain
    $X$ were usually proved using the equivartiant obstruction theory. Such calculations
    are difficult and may become infeasible past the first (primary) obstruction.
    We\r\ntake a different approach which allows us to prove the vanishing of all
    obstructions simultaneously. The essential step in the proof is classifying the
    possible degrees of $\\mathfrak S_n$-equivariant maps from the boundary\r\n$\\partial\\Delta^{n-1}$
    of $(n-1)$-simplex to itself.  Existence of equivariant maps between spaces is
    important for many questions arising from discrete mathematics and geometry, such
    as Kneser's conjecture, the Square Peg conjecture, the Splitting Necklace problem,
    and the Topological Tverberg conjecture, etc. We demonstrate the utility of our
    result  applying it to one such question, a specific instance of envy-free division
    problem."
article_number: '1910.12628'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sergey
  full_name: Avvakumov, Sergey
  id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
  last_name: Avvakumov
  orcid: 0000-0002-7840-5062
- first_name: Sergey
  full_name: Kudrya, Sergey
  id: ecf01965-d252-11ea-95a5-8ada5f6c6a67
  last_name: Kudrya
citation:
  ama: Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping
    degree. <i>arXiv</i>. doi:<a href="https://doi.org/10.48550/arXiv.1910.12628">10.48550/arXiv.1910.12628</a>
  apa: Avvakumov, S., &#38; Kudrya, S. (n.d.). Vanishing of all equivariant obstructions
    and the mapping degree. <i>arXiv</i>. <a href="https://doi.org/10.48550/arXiv.1910.12628">https://doi.org/10.48550/arXiv.1910.12628</a>
  chicago: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions
    and the Mapping Degree.” <i>ArXiv</i>, n.d. <a href="https://doi.org/10.48550/arXiv.1910.12628">https://doi.org/10.48550/arXiv.1910.12628</a>.
  ieee: S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and
    the mapping degree,” <i>arXiv</i>. .
  ista: Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping
    degree. arXiv, 1910.12628.
  mla: Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions
    and the Mapping Degree.” <i>ArXiv</i>, 1910.12628, doi:<a href="https://doi.org/10.48550/arXiv.1910.12628">10.48550/arXiv.1910.12628</a>.
  short: S. Avvakumov, S. Kudrya, ArXiv (n.d.).
corr_author: '1'
date_created: 2020-07-30T10:45:08Z
date_published: 2019-10-28T00:00:00Z
date_updated: 2025-04-14T09:10:06Z
day: '28'
department:
- _id: UlWa
doi: 10.48550/arXiv.1910.12628
external_id:
  arxiv:
  - '1910.12628'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1910.12628
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P31312
  name: Algorithms for Embeddings and Homotopy Theory
publication: arXiv
publication_status: draft
related_material:
  record:
  - id: '11446'
    relation: later_version
    status: public
  - id: '8156'
    relation: dissertation_contains
    status: public
status: public
title: Vanishing of all equivariant obstructions and the mapping degree
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8184'
abstract:
- lang: eng
  text: "Denote by ∆N the N-dimensional simplex. A map f : ∆N → Rd is an almost r-embedding
    if fσ1∩. . .∩fσr = ∅ whenever σ1, . . . , σr are pairwise disjoint faces. A counterexample
    to the topological Tverberg conjecture asserts that if r is not a prime power
    and d ≥ 2r + 1, then there is an almost r-embedding ∆(d+1)(r−1) → Rd. This was
    improved by Blagojevi´c–Frick–Ziegler using a simple construction of higher-dimensional
    counterexamples by taking k-fold join power of lower-dimensional ones. We improve
    this further (for d large compared to r): If r is not a prime power and N := (d+
    1)r−r l\r\nd + 2 r + 1 m−2, then there is an almost r-embedding ∆N → Rd. For the
    r-fold van Kampen–Flores conjecture we also produce counterexamples which are
    stronger than previously known. Our proof is based on generalizations of the Mabillard–Wagner
    theorem on construction of almost r-embeddings from equivariant maps, and of the
    Ozaydin theorem on existence of equivariant maps. "
acknowledgement: We would like to thank F. Frick for helpful discussions
article_number: '1908.08731'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sergey
  full_name: Avvakumov, Sergey
  id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
  last_name: Avvakumov
  orcid: 0000-0002-7840-5062
- first_name: R.
  full_name: Karasev, R.
  last_name: Karasev
- first_name: A.
  full_name: Skopenkov, A.
  last_name: Skopenkov
citation:
  ama: Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological
    Tverberg conjecture. <i>arXiv</i>. doi:<a href="https://doi.org/10.48550/arXiv.1908.08731">10.48550/arXiv.1908.08731</a>
  apa: Avvakumov, S., Karasev, R., &#38; Skopenkov, A. (n.d.). Stronger counterexamples
    to the topological Tverberg conjecture. <i>arXiv</i>. <a href="https://doi.org/10.48550/arXiv.1908.08731">https://doi.org/10.48550/arXiv.1908.08731</a>
  chicago: Avvakumov, Sergey, R. Karasev, and A. Skopenkov. “Stronger Counterexamples
    to the Topological Tverberg Conjecture.” <i>ArXiv</i>, n.d. <a href="https://doi.org/10.48550/arXiv.1908.08731">https://doi.org/10.48550/arXiv.1908.08731</a>.
  ieee: S. Avvakumov, R. Karasev, and A. Skopenkov, “Stronger counterexamples to the
    topological Tverberg conjecture,” <i>arXiv</i>. .
  ista: Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological
    Tverberg conjecture. arXiv, 1908.08731.
  mla: Avvakumov, Sergey, et al. “Stronger Counterexamples to the Topological Tverberg
    Conjecture.” <i>ArXiv</i>, 1908.08731, doi:<a href="https://doi.org/10.48550/arXiv.1908.08731">10.48550/arXiv.1908.08731</a>.
  short: S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).
date_created: 2020-07-30T10:45:34Z
date_published: 2019-08-23T00:00:00Z
date_updated: 2025-04-14T09:10:06Z
day: '23'
department:
- _id: UlWa
doi: 10.48550/arXiv.1908.08731
external_id:
  arxiv:
  - '1908.08731'
  isi:
  - '000986519600004'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1908.08731
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P31312
  name: Algorithms for Embeddings and Homotopy Theory
publication: arXiv
publication_status: draft
related_material:
  record:
  - id: '8156'
    relation: dissertation_contains
    status: public
status: public
title: Stronger counterexamples to the topological Tverberg conjecture
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8185'
abstract:
- lang: eng
  text: "In this paper we study envy-free division problems. The classical approach
    to some of such problems, used by David Gale, reduces to considering continuous
    maps of a simplex to itself and finding sufficient conditions when this map hits
    the center of the simplex. The mere continuity is not sufficient for such a conclusion,
    the usual assumption (for example, in the Knaster--Kuratowski--Mazurkiewicz and
    the Gale theorem) is a certain boundary condition.\r\n  We follow Erel Segal-Halevi,
    Fr\\'ed\\'eric Meunier, and Shira Zerbib, and replace the boundary condition by
    another assumption, which has the economic meaning of possibility for a player
    to prefer an empty part in the segment\r\npartition problem. We solve the problem
    positively when $n$, the number of players that divide the segment, is a prime
    power, and we provide counterexamples for every $n$ which is not a prime power.
    We also provide counterexamples relevant to a wider class of fair or envy-free
    partition problems when $n$ is odd and not a prime power."
article_number: '1907.11183'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sergey
  full_name: Avvakumov, Sergey
  id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
  last_name: Avvakumov
  orcid: 0000-0002-7840-5062
- first_name: Roman
  full_name: Karasev, Roman
  last_name: Karasev
citation:
  ama: Avvakumov S, Karasev R. Envy-free division using mapping degree. <i>arXiv</i>.
    doi:<a href="https://doi.org/10.48550/arXiv.1907.11183">10.48550/arXiv.1907.11183</a>
  apa: Avvakumov, S., &#38; Karasev, R. (n.d.). Envy-free division using mapping degree.
    <i>arXiv</i>. <a href="https://doi.org/10.48550/arXiv.1907.11183">https://doi.org/10.48550/arXiv.1907.11183</a>
  chicago: Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping
    Degree.” <i>ArXiv</i>, n.d. <a href="https://doi.org/10.48550/arXiv.1907.11183">https://doi.org/10.48550/arXiv.1907.11183</a>.
  ieee: S. Avvakumov and R. Karasev, “Envy-free division using mapping degree,” <i>arXiv</i>.
    .
  ista: Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv, 1907.11183.
  mla: Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.”
    <i>ArXiv</i>, 1907.11183, doi:<a href="https://doi.org/10.48550/arXiv.1907.11183">10.48550/arXiv.1907.11183</a>.
  short: S. Avvakumov, R. Karasev, ArXiv (n.d.).
corr_author: '1'
date_created: 2020-07-30T10:45:51Z
date_published: 2019-07-25T00:00:00Z
date_updated: 2025-04-14T09:10:07Z
day: '25'
department:
- _id: UlWa
doi: 10.48550/arXiv.1907.11183
external_id:
  arxiv:
  - '1907.11183'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1907.11183
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P31312
  name: Algorithms for Embeddings and Homotopy Theory
publication: arXiv
publication_status: draft
related_material:
  link:
  - relation: later_version
    url: https://doi.org/10.1112/mtk.12059
  record:
  - id: '8156'
    relation: dissertation_contains
    status: public
status: public
title: Envy-free division using mapping degree
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8227'
article_processing_charge: No
article_type: letter_note
author:
- first_name: Kristina M.
  full_name: Ilieva, Kristina M.
  last_name: Ilieva
- 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: Heather J.
  full_name: Bax, Heather J.
  last_name: Bax
- first_name: Silvia
  full_name: Crescioli, Silvia
  last_name: Crescioli
- first_name: Laura
  full_name: Montero‐Morales, Laura
  last_name: Montero‐Morales
- first_name: Silvia
  full_name: Mele, Silvia
  last_name: Mele
- first_name: Heng Sheng
  full_name: Sow, Heng Sheng
  last_name: Sow
- first_name: Chara
  full_name: Stavraka, Chara
  last_name: Stavraka
- first_name: Debra H.
  full_name: Josephs, Debra H.
  last_name: Josephs
- first_name: James F.
  full_name: Spicer, James F.
  last_name: Spicer
- first_name: Herta
  full_name: Steinkellner, Herta
  last_name: Steinkellner
  orcid: 0000-0003-4823-1505
- first_name: Erika
  full_name: Jensen‐Jarolim, Erika
  last_name: Jensen‐Jarolim
  orcid: 0000-0003-4019-5765
- first_name: Andrew N. J.
  full_name: Tutt, Andrew N. J.
  last_name: Tutt
  orcid: 0000-0001-8715-2901
- first_name: Sophia N.
  full_name: Karagiannis, Sophia N.
  last_name: Karagiannis
  orcid: 0000-0002-4100-7810
citation:
  ama: 'Ilieva KM, Singer J, Bax HJ, et al. AllergoOncology: Expression platform development
    and functional profiling of an anti‐HER2 IgE antibody. <i>Allergy</i>. 2019;74(10):1985-1989.
    doi:<a href="https://doi.org/10.1111/all.13818">10.1111/all.13818</a>'
  apa: 'Ilieva, K. M., Singer, J., Bax, H. J., Crescioli, S., Montero‐Morales, L.,
    Mele, S., … Karagiannis, S. N. (2019). AllergoOncology: Expression platform development
    and functional profiling of an anti‐HER2 IgE antibody. <i>Allergy</i>. Wiley.
    <a href="https://doi.org/10.1111/all.13818">https://doi.org/10.1111/all.13818</a>'
  chicago: 'Ilieva, Kristina M., Judit Singer, Heather J. Bax, Silvia Crescioli, Laura
    Montero‐Morales, Silvia Mele, Heng Sheng Sow, et al. “AllergoOncology: Expression
    Platform Development and Functional Profiling of an Anti‐HER2 IgE Antibody.” <i>Allergy</i>.
    Wiley, 2019. <a href="https://doi.org/10.1111/all.13818">https://doi.org/10.1111/all.13818</a>.'
  ieee: 'K. M. Ilieva <i>et al.</i>, “AllergoOncology: Expression platform development
    and functional profiling of an anti‐HER2 IgE antibody,” <i>Allergy</i>, vol. 74,
    no. 10. Wiley, pp. 1985–1989, 2019.'
  ista: 'Ilieva KM, Singer J, Bax HJ, Crescioli S, Montero‐Morales L, Mele S, Sow
    HS, Stavraka C, Josephs DH, Spicer JF, Steinkellner H, Jensen‐Jarolim E, Tutt
    ANJ, Karagiannis SN. 2019. AllergoOncology: Expression platform development and
    functional profiling of an anti‐HER2 IgE antibody. Allergy. 74(10), 1985–1989.'
  mla: 'Ilieva, Kristina M., et al. “AllergoOncology: Expression Platform Development
    and Functional Profiling of an Anti‐HER2 IgE Antibody.” <i>Allergy</i>, vol. 74,
    no. 10, Wiley, 2019, pp. 1985–89, doi:<a href="https://doi.org/10.1111/all.13818">10.1111/all.13818</a>.'
  short: K.M. Ilieva, J. Singer, H.J. Bax, S. Crescioli, L. Montero‐Morales, S. Mele,
    H.S. Sow, C. Stavraka, D.H. Josephs, J.F. Spicer, H. Steinkellner, E. Jensen‐Jarolim,
    A.N.J. Tutt, S.N. Karagiannis, Allergy 74 (2019) 1985–1989.
date_created: 2020-08-10T11:50:42Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2021-01-12T08:17:35Z
day: '01'
doi: 10.1111/all.13818
extern: '1'
intvolume: '        74'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1111/all.13818
month: '10'
oa: 1
oa_version: Published Version
page: 1985-1989
publication: Allergy
publication_identifier:
  issn:
  - 0105-4538
  - 1398-9995
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: 'AllergoOncology: Expression platform development and functional profiling
  of an anti‐HER2 IgE antibody'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 74
year: '2019'
...
---
_id: '8228'
abstract:
- lang: eng
  text: "Background: Atopics have a lower risk for malignancies, and IgE targeted
    to tumors is superior to IgG in fighting cancer. Whether IgE-mediated innate or
    adaptive immune surveillance can confer protection against tumors remains unclear.\r\nObjective:
    We aimed to investigate the effects of active and passive immunotherapy to the
    tumor-associated antigen HER-2 in three murine models differing in Epsilon-B-cell-receptor
    expression affecting the levels of expressed IgE.\r\nMethods: We compared the
    levels of several serum specific anti-HER-2 antibodies (IgE, IgG1, IgG2a, IgG2b,
    IgA) and the survival rates in low-IgE ΔM1M2 mice lacking the transmembrane/cytoplasmic
    domain of Epsilon-B-cell-receptors expressing reduced IgE levels, high-IgE KN1
    mice expressing chimeric Epsilon-Gamma1-B-cell receptors with 4-6-fold elevated
    serum IgE levels, and wild type (WT) BALB/c. Prior engrafting mice with D2F2/E2
    mammary tumors overexpressing HER-2, mice were vaccinated with HER-2 or vehicle
    control PBS using the Th2-adjuvant Al(OH)3 (active immunotherapy), or treated
    with the murine anti-HER-2 IgG1 antibody 4D5 (passive immunotherapy).\r\nResults:
    Overall, among the three strains of mice, HER-2 vaccination induced significantly
    higher levels of HER-2 specific IgE and IgG1 in high-IgE KN1, while low-IgE ΔM1M2
    mice had higher IgG2a levels. HER-2 vaccination and passive immunotherapy prolonged
    the survival in tumor-grafted WT and low-IgE ΔM1M2 strains compared with treatment
    controls; active vaccination provided the highest benefit. Notably, untreated
    high-IgE KN1 mice displayed the longest survival of all strains, which could not
    be further extended by active or passive immunotherapy.\r\nConclusion: Active
    and passive immunotherapies prolong survival in wild type and low-IgE ΔM1M2 mice
    engrafted with mammary tumors. High-IgE KN1 mice have an innate survival benefit
    following tumor challenge."
article_number: '100044'
article_processing_charge: No
article_type: original
author:
- first_name: Josef
  full_name: Singer, Josef
  last_name: Singer
  orcid: 0000-0002-8701-2412
- first_name: Gertrude
  full_name: Achatz-Straussberger, Gertrude
  last_name: Achatz-Straussberger
- first_name: Anna
  full_name: Bentley-Lukschal, Anna
  last_name: Bentley-Lukschal
- 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: Gernot
  full_name: Achatz, Gernot
  last_name: Achatz
- first_name: Sophia N.
  full_name: Karagiannis, Sophia N.
  last_name: Karagiannis
- first_name: Erika
  full_name: Jensen-Jarolim, Erika
  last_name: Jensen-Jarolim
citation:
  ama: 'Singer J, Achatz-Straussberger G, Bentley-Lukschal A, et al. AllergoOncology:
    High innate IgE levels are decisive for the survival of cancer-bearing mice. <i>World
    Allergy Organization Journal</i>. 2019;12(7). doi:<a href="https://doi.org/10.1016/j.waojou.2019.100044">10.1016/j.waojou.2019.100044</a>'
  apa: 'Singer, J., Achatz-Straussberger, G., Bentley-Lukschal, A., Singer, J., Achatz,
    G., Karagiannis, S. N., &#38; Jensen-Jarolim, E. (2019). AllergoOncology: High
    innate IgE levels are decisive for the survival of cancer-bearing mice. <i>World
    Allergy Organization Journal</i>. Elsevier. <a href="https://doi.org/10.1016/j.waojou.2019.100044">https://doi.org/10.1016/j.waojou.2019.100044</a>'
  chicago: 'Singer, Josef, Gertrude Achatz-Straussberger, Anna Bentley-Lukschal, Judit
    Singer, Gernot Achatz, Sophia N. Karagiannis, and Erika Jensen-Jarolim. “AllergoOncology:
    High Innate IgE Levels Are Decisive for the Survival of Cancer-Bearing Mice.”
    <i>World Allergy Organization Journal</i>. Elsevier, 2019. <a href="https://doi.org/10.1016/j.waojou.2019.100044">https://doi.org/10.1016/j.waojou.2019.100044</a>.'
  ieee: 'J. Singer <i>et al.</i>, “AllergoOncology: High innate IgE levels are decisive
    for the survival of cancer-bearing mice,” <i>World Allergy Organization Journal</i>,
    vol. 12, no. 7. Elsevier, 2019.'
  ista: 'Singer J, Achatz-Straussberger G, Bentley-Lukschal A, Singer J, Achatz G,
    Karagiannis SN, Jensen-Jarolim E. 2019. AllergoOncology: High innate IgE levels
    are decisive for the survival of cancer-bearing mice. World Allergy Organization
    Journal. 12(7), 100044.'
  mla: 'Singer, Josef, et al. “AllergoOncology: High Innate IgE Levels Are Decisive
    for the Survival of Cancer-Bearing Mice.” <i>World Allergy Organization Journal</i>,
    vol. 12, no. 7, 100044, Elsevier, 2019, doi:<a href="https://doi.org/10.1016/j.waojou.2019.100044">10.1016/j.waojou.2019.100044</a>.'
  short: J. Singer, G. Achatz-Straussberger, A. Bentley-Lukschal, J. Singer, G. Achatz,
    S.N. Karagiannis, E. Jensen-Jarolim, World Allergy Organization Journal 12 (2019).
date_created: 2020-08-10T11:50:54Z
date_published: 2019-07-29T00:00:00Z
date_updated: 2021-01-12T08:17:36Z
day: '29'
doi: 10.1016/j.waojou.2019.100044
extern: '1'
intvolume: '        12'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1016/j.waojou.2019.100044
month: '07'
oa: 1
oa_version: Published Version
publication: World Allergy Organization Journal
publication_identifier:
  issn:
  - 1939-4551
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: 'AllergoOncology: High innate IgE levels are decisive for the survival of cancer-bearing
  mice'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2019'
...
---
_id: '8229'
abstract:
- lang: eng
  text: Food proteins may get nitrated by various exogenous or endogenous mechanisms.
    As individuals might get recurrently exposed to nitrated proteins via daily diet,
    we aimed to investigate the effect of repeatedly ingested nitrated food proteins
    on the subsequent immune response in non-allergic and allergic mice using the
    milk allergen beta-lactoglobulin (BLG) as model food protein in a mouse model.
    Evaluating the presence of nitrated proteins in food, we could detect 3-nitrotyrosine
    (3-NT) in extracts of different foods and in stomach content extracts of non-allergic
    mice under physiological conditions. Chemically nitrated BLG (BLGn) exhibited
    enhanced susceptibility to degradation in simulated gastric fluid experiments
    compared to untreated BLG (BLGu). Gavage of BLGn to non-allergic animals increased
    interferon-γ and interleukin-10 release of stimulated spleen cells and led to
    the formation of BLG-specific serum IgA. Allergic mice receiving three oral gavages
    of BLGn had higher levels of mouse mast cell protease-1 (mMCP-1) compared to allergic
    mice receiving BLGu. Regardless of the preceding immune status, non-allergic or
    allergic, repeatedly ingested nitrated food proteins seem to considerably influence
    the subsequent immune response.
article_number: '2463'
article_processing_charge: No
article_type: original
author:
- first_name: Anna S.
  full_name: Ondracek, Anna S.
  last_name: Ondracek
  orcid: 0000-0001-7625-3651
- first_name: Denise
  full_name: Heiden, Denise
  last_name: Heiden
- first_name: Gertie J.
  full_name: Oostingh, Gertie J.
  last_name: Oostingh
- first_name: Elisabeth
  full_name: Fuerst, Elisabeth
  last_name: Fuerst
- 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: Cornelia
  full_name: Bergmayr, Cornelia
  last_name: Bergmayr
- first_name: Johanna
  full_name: Rohrhofer, Johanna
  last_name: Rohrhofer
  orcid: 0000-0002-2783-2099
- first_name: Erika
  full_name: Jensen-Jarolim, Erika
  last_name: Jensen-Jarolim
  orcid: 0000-0003-4019-5765
- first_name: Albert
  full_name: Duschl, Albert
  last_name: Duschl
  orcid: 0000-0002-7034-9860
- first_name: Eva
  full_name: Untersmayr, Eva
  last_name: Untersmayr
  orcid: 0000-0002-1963-499X
citation:
  ama: Ondracek AS, Heiden D, Oostingh GJ, et al. Immune effects of the nitrated food
    allergen beta-lactoglobulin in an experimental food allergy model. <i>Nutrients</i>.
    2019;11(10). doi:<a href="https://doi.org/10.3390/nu11102463">10.3390/nu11102463</a>
  apa: Ondracek, A. S., Heiden, D., Oostingh, G. J., Fuerst, E., Singer, J., Bergmayr,
    C., … Untersmayr, E. (2019). Immune effects of the nitrated food allergen beta-lactoglobulin
    in an experimental food allergy model. <i>Nutrients</i>. MDPI. <a href="https://doi.org/10.3390/nu11102463">https://doi.org/10.3390/nu11102463</a>
  chicago: Ondracek, Anna S., Denise Heiden, Gertie J. Oostingh, Elisabeth Fuerst,
    Judit Singer, Cornelia Bergmayr, Johanna Rohrhofer, Erika Jensen-Jarolim, Albert
    Duschl, and Eva Untersmayr. “Immune Effects of the Nitrated Food Allergen Beta-Lactoglobulin
    in an Experimental Food Allergy Model.” <i>Nutrients</i>. MDPI, 2019. <a href="https://doi.org/10.3390/nu11102463">https://doi.org/10.3390/nu11102463</a>.
  ieee: A. S. Ondracek <i>et al.</i>, “Immune effects of the nitrated food allergen
    beta-lactoglobulin in an experimental food allergy model,” <i>Nutrients</i>, vol.
    11, no. 10. MDPI, 2019.
  ista: Ondracek AS, Heiden D, Oostingh GJ, Fuerst E, Singer J, Bergmayr C, Rohrhofer
    J, Jensen-Jarolim E, Duschl A, Untersmayr E. 2019. Immune effects of the nitrated
    food allergen beta-lactoglobulin in an experimental food allergy model. Nutrients.
    11(10), 2463.
  mla: Ondracek, Anna S., et al. “Immune Effects of the Nitrated Food Allergen Beta-Lactoglobulin
    in an Experimental Food Allergy Model.” <i>Nutrients</i>, vol. 11, no. 10, 2463,
    MDPI, 2019, doi:<a href="https://doi.org/10.3390/nu11102463">10.3390/nu11102463</a>.
  short: A.S. Ondracek, D. Heiden, G.J. Oostingh, E. Fuerst, J. Singer, C. Bergmayr,
    J. Rohrhofer, E. Jensen-Jarolim, A. Duschl, E. Untersmayr, Nutrients 11 (2019).
date_created: 2020-08-10T11:51:04Z
date_published: 2019-10-15T00:00:00Z
date_updated: 2021-01-12T08:17:36Z
day: '15'
doi: 10.3390/nu11102463
extern: '1'
intvolume: '        11'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.3390/nu11102463
month: '10'
oa: 1
oa_version: Published Version
publication: Nutrients
publication_identifier:
  issn:
  - 2072-6643
publication_status: published
publisher: MDPI
quality_controlled: '1'
status: public
title: Immune effects of the nitrated food allergen beta-lactoglobulin in an experimental
  food allergy model
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2019'
...
---
_id: '8263'
abstract:
- lang: eng
  text: "Background: The genus Streptococcus comprises pathogens that strongly influence
    the health of humans and animals. Genome sequencing of multiple Streptococcus
    strains demonstrated high variability in gene content and order even in closely
    related strains of the same species and created a newly emerged object for genomic
    analysis, the pan-genome. Here we analysed the genome evolution of 25 strains
    of Streptococcus suis, 50 strains of Streptococcus pyogenes and 28 strains of
    Streptococcus pneumoniae.\r\n\r\nResults: Fractions of the pan-genome, unique,
    periphery, and universal genes differ in size, functional composition, the level
    of nucleotide substitutions, and predisposition to horizontal gene transfer and
    genomic rearrangements. The density of substitutions in intergenic regions appears
    to be correlated with selection acting on adjacent genes, implying that more conserved
    genes tend to have more conserved regulatory regions.\r\nThe total pan-genome
    of the genus is open, but only due to strain-specific genes, whereas other pan-genome
    fractions reach saturation. We have identified the set of genes with phylogenies
    inconsistent with species and non-conserved location in the chromosome; these
    genes are rare in at least one species and have likely experienced recent horizontal
    transfer between species. The strain-specific fraction is enriched with mobile
    elements and hypothetical proteins, but also contains a number of candidate virulence-related
    genes, so it may have a strong impact on adaptability and pathogenicity.\r\nMapping
    the rearrangements to the phylogenetic tree revealed large parallel inversions
    in all species. A parallel inversion of length 15 kB with breakpoints formed by
    genes encoding surface antigen proteins PhtD and PhtB in S. pneumoniae leads to
    replacement of gene fragments that likely indicates the action of an antigen variation
    mechanism.\r\n\r\nConclusions: Members of genus Streptococcus have a highly dynamic,
    open pan-genome, that potentially confers them with the ability to adapt to changing
    environmental conditions, i.e. antibiotic resistance or transmission between different
    hosts. Hence, integrated analysis of all aspects of genome evolution is important
    for the identification of potential pathogens and design of drugs and vaccines."
article_number: '83'
article_processing_charge: No
article_type: original
author:
- first_name: Pavel V.
  full_name: Shelyakin, Pavel V.
  last_name: Shelyakin
  orcid: 0000-0003-0120-9319
- first_name: Olga
  full_name: Bochkareva, Olga
  id: C4558D3C-6102-11E9-A62E-F418E6697425
  last_name: Bochkareva
  orcid: 0000-0003-1006-6639
- first_name: Anna A.
  full_name: Karan, Anna A.
  last_name: Karan
- first_name: Mikhail S.
  full_name: Gelfand, Mikhail S.
  last_name: Gelfand
citation:
  ama: 'Shelyakin PV, Bochkareva O, Karan AA, Gelfand MS. Micro-evolution of three
    Streptococcus species: Selection, antigenic variation, and horizontal gene inflow.
    <i>BMC Evolutionary Biology</i>. 2019;19. doi:<a href="https://doi.org/10.1186/s12862-019-1403-6">10.1186/s12862-019-1403-6</a>'
  apa: 'Shelyakin, P. V., Bochkareva, O., Karan, A. A., &#38; Gelfand, M. S. (2019).
    Micro-evolution of three Streptococcus species: Selection, antigenic variation,
    and horizontal gene inflow. <i>BMC Evolutionary Biology</i>. Springer Nature.
    <a href="https://doi.org/10.1186/s12862-019-1403-6">https://doi.org/10.1186/s12862-019-1403-6</a>'
  chicago: 'Shelyakin, Pavel V., Olga Bochkareva, Anna A. Karan, and Mikhail S. Gelfand.
    “Micro-Evolution of Three Streptococcus Species: Selection, Antigenic Variation,
    and Horizontal Gene Inflow.” <i>BMC Evolutionary Biology</i>. Springer Nature,
    2019. <a href="https://doi.org/10.1186/s12862-019-1403-6">https://doi.org/10.1186/s12862-019-1403-6</a>.'
  ieee: 'P. V. Shelyakin, O. Bochkareva, A. A. Karan, and M. S. Gelfand, “Micro-evolution
    of three Streptococcus species: Selection, antigenic variation, and horizontal
    gene inflow,” <i>BMC Evolutionary Biology</i>, vol. 19. Springer Nature, 2019.'
  ista: 'Shelyakin PV, Bochkareva O, Karan AA, Gelfand MS. 2019. Micro-evolution of
    three Streptococcus species: Selection, antigenic variation, and horizontal gene
    inflow. BMC Evolutionary Biology. 19, 83.'
  mla: 'Shelyakin, Pavel V., et al. “Micro-Evolution of Three Streptococcus Species:
    Selection, Antigenic Variation, and Horizontal Gene Inflow.” <i>BMC Evolutionary
    Biology</i>, vol. 19, 83, Springer Nature, 2019, doi:<a href="https://doi.org/10.1186/s12862-019-1403-6">10.1186/s12862-019-1403-6</a>.'
  short: P.V. Shelyakin, O. Bochkareva, A.A. Karan, M.S. Gelfand, BMC Evolutionary
    Biology 19 (2019).
date_created: 2020-08-15T11:04:07Z
date_published: 2019-03-27T00:00:00Z
date_updated: 2023-02-23T13:28:54Z
day: '27'
doi: 10.1186/s12862-019-1403-6
extern: '1'
intvolume: '        19'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1186/s12862-019-1403-6
month: '03'
oa: 1
oa_version: Published Version
publication: BMC Evolutionary Biology
publication_identifier:
  issn:
  - 1471-2148
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: 'Micro-evolution of three Streptococcus species: Selection, antigenic variation,
  and horizontal gene inflow'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2019'
...
---
_id: '8281'
abstract:
- lang: eng
  text: We review the history of population genetics, starting with its origins a
    century ago from the synthesis between Mendel and Darwin's ideas, through to the
    recent development of sophisticated schemes of inference from sequence data, based
    on the coalescent. We explain the close relation between the coalescent and a
    diffusion process, which we illustrate by their application to understand spatial
    structure. We summarise the powerful methods available for analysis of multiple
    loci, when linkage equilibrium can be assumed, and then discuss approaches to
    the more challenging case, where associations between alleles require that we
    follow genotype, rather than allele, frequencies. Though we can hardly cover the
    whole of population genetics, we give an overview of the current state of the
    subject, and future challenges to it.
article_processing_charge: No
author:
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
- first_name: Alison
  full_name: Etheridge, Alison
  last_name: Etheridge
citation:
  ama: 'Barton NH, Etheridge A. Mathematical models in population genetics. In: Balding
    D, Moltke I, Marioni J, eds. <i>Handbook of Statistical Genomics</i>. 4th ed.
    Wiley; 2019:115-144. doi:<a href="https://doi.org/10.1002/9781119487845.ch4">10.1002/9781119487845.ch4</a>'
  apa: Barton, N. H., &#38; Etheridge, A. (2019). Mathematical models in population
    genetics. In D. Balding, I. Moltke, &#38; J. Marioni (Eds.), <i>Handbook of statistical
    genomics</i> (4th ed., pp. 115–144). Wiley. <a href="https://doi.org/10.1002/9781119487845.ch4">https://doi.org/10.1002/9781119487845.ch4</a>
  chicago: Barton, Nicholas H, and Alison Etheridge. “Mathematical Models in Population
    Genetics.” In <i>Handbook of Statistical Genomics</i>, edited by David Balding,
    Ida Moltke, and John Marioni, 4th ed., 115–44. Wiley, 2019. <a href="https://doi.org/10.1002/9781119487845.ch4">https://doi.org/10.1002/9781119487845.ch4</a>.
  ieee: N. H. Barton and A. Etheridge, “Mathematical models in population genetics,”
    in <i>Handbook of statistical genomics</i>, 4th ed., D. Balding, I. Moltke, and
    J. Marioni, Eds. Wiley, 2019, pp. 115–144.
  ista: 'Barton NH, Etheridge A. 2019.Mathematical models in population genetics.
    In: Handbook of statistical genomics. , 115–144.'
  mla: Barton, Nicholas H., and Alison Etheridge. “Mathematical Models in Population
    Genetics.” <i>Handbook of Statistical Genomics</i>, edited by David Balding et
    al., 4th ed., Wiley, 2019, pp. 115–44, doi:<a href="https://doi.org/10.1002/9781119487845.ch4">10.1002/9781119487845.ch4</a>.
  short: N.H. Barton, A. Etheridge, in:, D. Balding, I. Moltke, J. Marioni (Eds.),
    Handbook of Statistical Genomics, 4th ed., Wiley, 2019, pp. 115–144.
date_created: 2020-08-21T04:25:39Z
date_published: 2019-07-29T00:00:00Z
date_updated: 2024-10-21T06:02:39Z
day: '29'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1002/9781119487845.ch4
edition: '4'
editor:
- first_name: David
  full_name: Balding, David
  last_name: Balding
- first_name: Ida
  full_name: Moltke, Ida
  last_name: Moltke
- first_name: John
  full_name: Marioni, John
  last_name: Marioni
external_id:
  isi:
  - '000261343000003'
isi: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 115-144
publication: Handbook of statistical genomics
publication_identifier:
  isbn:
  - '9781119429142'
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mathematical models in population genetics
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '8296'
abstract:
- lang: eng
  text: While showing great promise, smart contracts are difficult to program correctly,
    as they need a deep understanding of cryptography and distributed algorithms,
    and offer limited functionality, as they have to be deterministic and cannot operate
    on secret data. In this paper we present Protean, a general-purpose decentralized
    computing platform that addresses these limitations by moving from a monolithic
    execution model, where all participating nodes store all the state and execute
    every computation, to a modular execution-model. Protean employs secure specialized
    modules, called functional units, for building decentralized applications that
    are currently insecure or impossible to implement with smart contracts. Each functional
    unit is a distributed system that provides a special-purpose functionality by
    exposing atomic transactions to the smart-contract developer. Combining these
    transactions into arbitrarily-defined workflows, developers can build a larger
    class of decentralized applications, such as provably-secure and fair lotteries
    or e-voting.
article_processing_charge: No
author:
- first_name: Enis Ceyhun
  full_name: Alp, Enis Ceyhun
  last_name: Alp
- first_name: Eleftherios
  full_name: Kokoris Kogias, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: Kokoris Kogias
- first_name: Georgia
  full_name: Fragkouli, Georgia
  last_name: Fragkouli
- first_name: Bryan
  full_name: Ford, Bryan
  last_name: Ford
citation:
  ama: 'Alp EC, Kokoris Kogias E, Fragkouli G, Ford B. Rethinking general-purpose
    decentralized computing. In: <i>Proceedings of the Workshop on Hot Topics in Operating
    Systems</i>. ACM; 2019:105-112. doi:<a href="https://doi.org/10.1145/3317550.3321448">10.1145/3317550.3321448</a>'
  apa: 'Alp, E. C., Kokoris Kogias, E., Fragkouli, G., &#38; Ford, B. (2019). Rethinking
    general-purpose decentralized computing. In <i>Proceedings of the Workshop on
    Hot Topics in Operating Systems</i> (pp. 105–112). Bertinoro, Italy: ACM. <a href="https://doi.org/10.1145/3317550.3321448">https://doi.org/10.1145/3317550.3321448</a>'
  chicago: Alp, Enis Ceyhun, Eleftherios Kokoris Kogias, Georgia Fragkouli, and Bryan
    Ford. “Rethinking General-Purpose Decentralized Computing.” In <i>Proceedings
    of the Workshop on Hot Topics in Operating Systems</i>, 105–12. ACM, 2019. <a
    href="https://doi.org/10.1145/3317550.3321448">https://doi.org/10.1145/3317550.3321448</a>.
  ieee: E. C. Alp, E. Kokoris Kogias, G. Fragkouli, and B. Ford, “Rethinking general-purpose
    decentralized computing,” in <i>Proceedings of the Workshop on Hot Topics in Operating
    Systems</i>, Bertinoro, Italy, 2019, pp. 105–112.
  ista: 'Alp EC, Kokoris Kogias E, Fragkouli G, Ford B. 2019. Rethinking general-purpose
    decentralized computing. Proceedings of the Workshop on Hot Topics in Operating
    Systems. HotOS: Workshop on Hot Topics in Operating Systems, 105–112.'
  mla: Alp, Enis Ceyhun, et al. “Rethinking General-Purpose Decentralized Computing.”
    <i>Proceedings of the Workshop on Hot Topics in Operating Systems</i>, ACM, 2019,
    pp. 105–12, doi:<a href="https://doi.org/10.1145/3317550.3321448">10.1145/3317550.3321448</a>.
  short: E.C. Alp, E. Kokoris Kogias, G. Fragkouli, B. Ford, in:, Proceedings of the
    Workshop on Hot Topics in Operating Systems, ACM, 2019, pp. 105–112.
conference:
  end_date: 2019-05-15
  location: Bertinoro, Italy
  name: 'HotOS: Workshop on Hot Topics in Operating Systems'
  start_date: 2019-05-13
date_created: 2020-08-26T11:45:45Z
date_published: 2019-05-01T00:00:00Z
date_updated: 2021-01-12T08:17:56Z
day: '01'
doi: 10.1145/3317550.3321448
extern: '1'
language:
- iso: eng
month: '05'
oa_version: None
page: 105-112
publication: Proceedings of the Workshop on Hot Topics in Operating Systems
publication_identifier:
  isbn:
  - '9781450367271'
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rethinking general-purpose decentralized computing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8303'
abstract:
- lang: eng
  text: 'ByzCoin, a promising alternative of Bitcoin, is a scalable consensus protocol
    used as a building block of many research and enterprise-level decentralized systems.
    In this paper, we show that ByzCoin is unsuitable for deployment in an anopen,
    adversarial network and instead introduceMOTOR. MOTORis designed as a secure,
    robust, and scalable consensus suitable for permissionless sharded blockchains.
    MOTORachieves these properties by making four key design choices: (a) it prioritizes
    robustness in adversarial environments while maintaining adequate scalability,
    (b) it employees provably correct cryptography that resists DoS attacks from individual
    nodes, (c) it deploys unpredictable rotating leaders to defend against mildly-adaptive
    adversaries and prevents censorship, and (d) it creates an incentive compatible
    reward mechanism. These choices are materialized as (a) a “rotating subleader”
    communication pattern that balances the scalability needs with the robustness
    requirements under failures, (b) deployment of provable secure BLS multi-signatures,
    (c) use of deterministic thresh-old signatures as a source of randomness and (d)
    careful design of the reward allocation mechanism. We have implemented MOTORand
    compare it withByzCoin. We show that MOTORcan scale similar to ByzCoin with an
    at most2xoverhead whereas it maintains good performance even under high-percentage
    of faults, unlike ByzCoin.'
article_number: 2019/676
article_processing_charge: No
author:
- first_name: Eleftherios
  full_name: Kokoris Kogias, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: Kokoris Kogias
citation:
  ama: Kokoris Kogias E. Robust and scalable consensus for sharded distributed ledgers.
    <i>Cryptology ePrint Archive</i>.
  apa: Kokoris Kogias, E. (n.d.). Robust and scalable consensus for sharded distributed
    ledgers. <i>Cryptology ePrint Archive</i>.
  chicago: Kokoris Kogias, Eleftherios. “Robust and Scalable Consensus for Sharded
    Distributed Ledgers.” <i>Cryptology EPrint Archive</i>, n.d.
  ieee: E. Kokoris Kogias, “Robust and scalable consensus for sharded distributed
    ledgers,” <i>Cryptology ePrint Archive</i>. .
  ista: Kokoris Kogias E. Robust and scalable consensus for sharded distributed ledgers.
    Cryptology ePrint Archive, 2019/676.
  mla: Kokoris Kogias, Eleftherios. “Robust and Scalable Consensus for Sharded Distributed
    Ledgers.” <i>Cryptology EPrint Archive</i>, 2019/676.
  short: E. Kokoris Kogias, Cryptology EPrint Archive (n.d.).
date_created: 2020-08-26T12:13:56Z
date_published: 2019-06-06T00:00:00Z
date_updated: 2021-09-24T12:07:11Z
day: '06'
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2019/676
month: '06'
oa: 1
oa_version: Preprint
publication: Cryptology ePrint Archive
publication_status: submitted
status: public
title: Robust and scalable consensus for sharded distributed ledgers
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2019'
...
---
_id: '8304'
abstract:
- lang: eng
  text: "Enabling secure communication across distributed systems is usually studied
    under the assumption of trust between the different systems and an external adversary
    trying to compromise the messages. With the appearance of distributed ledgers
    or blockchains, numerous protocols have emerged, which attempt to achieve trustless
    communication between distrusting ledgers and participants. Cross-chain communication
    (CCC) thereby plays a fundamental role in cryptocurrency exchanges, sharding,
    bootstrapping of new and feature-extension of existing distributed ledgers. Unfortunately,
    existing proposals are designed ad-hoc for specific use-cases, making it hard
    to gain confidence on their correctness and composability.\r\nWe provide the first
    systematic exposition of protocols for CCC. First, we formalize the underlying
    research problem and show that CCC is impossible without a trusted third party,
    contrary to common beliefs in the blockchain community. We then develop a framework
    to evaluate existing and to design new cross-chain protocols. The framework is
    based on the use case, the trust model, and the security assumptions of interlinked
    blockchains. Finally, we identify security and privacy challenges faced by protocols
    in the cross-chain setting.\r\nThis Systematization of Knowledge (SoK) offers
    a comprehensive guide for designing protocols bridging the numerous distributed
    ledgers available today. It aims to facilitate clearer communication between academia
    and industry in the field."
article_number: 2019/1128
article_processing_charge: No
author:
- first_name: Alexei
  full_name: Zamyatin, Alexei
  last_name: Zamyatin
- first_name: Mustafa
  full_name: Al-Bassam, Mustafa
  last_name: Al-Bassam
- first_name: Dionysis
  full_name: Zindros, Dionysis
  last_name: Zindros
- first_name: Eleftherios
  full_name: Kokoris Kogias, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: Kokoris Kogias
- first_name: Pedro
  full_name: Moreno-Sanchez, Pedro
  last_name: Moreno-Sanchez
- first_name: Aggelos
  full_name: Kiayias, Aggelos
  last_name: Kiayias
- first_name: William J.
  full_name: Knottenbelt, William J.
  last_name: Knottenbelt
citation:
  ama: 'Zamyatin A, Al-Bassam M, Zindros D, et al. SoK: Communication across distributed
    ledgers. <i>Cryptology ePrint Archive</i>.'
  apa: 'Zamyatin, A., Al-Bassam, M., Zindros, D., Kokoris Kogias, E., Moreno-Sanchez,
    P., Kiayias, A., &#38; Knottenbelt, W. J. (n.d.). SoK: Communication across distributed
    ledgers. <i>Cryptology ePrint Archive</i>.'
  chicago: 'Zamyatin, Alexei, Mustafa Al-Bassam, Dionysis Zindros, Eleftherios Kokoris
    Kogias, Pedro Moreno-Sanchez, Aggelos Kiayias, and William J. Knottenbelt. “SoK:
    Communication across Distributed Ledgers.” <i>Cryptology EPrint Archive</i>, n.d.'
  ieee: 'A. Zamyatin <i>et al.</i>, “SoK: Communication across distributed ledgers,”
    <i>Cryptology ePrint Archive</i>. .'
  ista: 'Zamyatin A, Al-Bassam M, Zindros D, Kokoris Kogias E, Moreno-Sanchez P, Kiayias
    A, Knottenbelt WJ. SoK: Communication across distributed ledgers. Cryptology ePrint
    Archive, 2019/1128.'
  mla: 'Zamyatin, Alexei, et al. “SoK: Communication across Distributed Ledgers.”
    <i>Cryptology EPrint Archive</i>, 2019/1128.'
  short: A. Zamyatin, M. Al-Bassam, D. Zindros, E. Kokoris Kogias, P. Moreno-Sanchez,
    A. Kiayias, W.J. Knottenbelt, Cryptology EPrint Archive (n.d.).
date_created: 2020-08-26T12:16:38Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2021-09-24T12:08:14Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: 'https://eprint.iacr.org/2019/1128 '
month: '10'
oa: 1
oa_version: Preprint
publication: Cryptology ePrint Archive
publication_status: submitted
status: public
title: 'SoK: Communication across distributed ledgers'
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2019'
...
---
_id: '8305'
abstract:
- lang: eng
  text: In this paper, we present the first fully asynchronous distributed key generation
    (ADKG) algorithm as well as the first distributed key generation algorithm that
    can create keys with a dual (f,2f+1)−threshold that are necessary for scalable
    consensus (which so far needs a trusted dealer assumption). In order to create
    a DKG with a dual (f,2f+1)− threshold we first answer in the affirmative the open
    question posed by Cachin et al. how to create an AVSS protocol with recovery thresholds
    f+1<k≤2f+1, which is of independent interest. Our High-threshold-AVSS (HAVSS)
    uses an asymmetric bi-variate polynomial, where the secret shared is hidden from
    any set of k nodes but an honest node that did not participate in the sharing
    phase can still recover his share with only n−2f shares, hence be able to contribute
    in the secret reconstruction. Another building block for ADKG is a novel Eventually
    Perfect Common Coin (EPCC) abstraction and protocol that enables the participants
    to create a common coin that might fail to agree at most f+1 times (even if invoked
    a polynomial number of times). Using EPCC we implement an Eventually Efficient
    Asynchronous Binary Agreement (EEABA) in which each instance takes O(n2) bits
    and O(1) rounds in expectation, except for at most f+1 instances which may take
    O(n4) bits and O(n) rounds in total. Using EEABA we construct the first fully
    Asynchronous Distributed Key Generation (ADKG) which has the same overhead and
    expected runtime as the best partially-synchronous DKG (O(n4) words, O(n) rounds).
    As a corollary of our ADKG we can also create the first Validated Asynchronous
    Byzantine Agreement (VABA) in the authenticated setting that does not need a trusted
    dealer to setup threshold signatures of degree n−f. Our VABA has an overhead of
    expected O(n2) words and O(1) time per instance after an initial O(n4) words and
    O(n) time bootstrap via ADKG.
article_number: 2019/1015
article_processing_charge: No
author:
- first_name: Eleftherios
  full_name: KOKORIS KOGIAS, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: KOKORIS KOGIAS
- first_name: Alexander
  full_name: Spiegelman, Alexander
  last_name: Spiegelman
- first_name: Dahlia
  full_name: Malkhi, Dahlia
  last_name: Malkhi
- first_name: Ittai
  full_name: Abraham, Ittai
  last_name: Abraham
citation:
  ama: 'Kokoris Kogias E, Spiegelman A, Malkhi D, Abraham I. Bootstrapping consensus
    without trusted setup: Fully asynchronous distributed key generation. <i>Cryptology
    ePrint Archive</i>.'
  apa: 'Kokoris Kogias, E., Spiegelman, A., Malkhi, D., &#38; Abraham, I. (n.d.).
    Bootstrapping consensus without trusted setup: Fully asynchronous distributed
    key generation. <i>Cryptology ePrint Archive</i>.'
  chicago: 'Kokoris Kogias, Eleftherios, Alexander Spiegelman, Dahlia Malkhi, and
    Ittai Abraham. “Bootstrapping Consensus without Trusted Setup: Fully Asynchronous
    Distributed Key Generation.” <i>Cryptology EPrint Archive</i>, n.d.'
  ieee: 'E. Kokoris Kogias, A. Spiegelman, D. Malkhi, and I. Abraham, “Bootstrapping
    consensus without trusted setup: Fully asynchronous distributed key generation,”
    <i>Cryptology ePrint Archive</i>. .'
  ista: 'Kokoris Kogias E, Spiegelman A, Malkhi D, Abraham I. Bootstrapping consensus
    without trusted setup: Fully asynchronous distributed key generation. Cryptology
    ePrint Archive, 2019/1015.'
  mla: 'Kokoris Kogias, Eleftherios, et al. “Bootstrapping Consensus without Trusted
    Setup: Fully Asynchronous Distributed Key Generation.” <i>Cryptology EPrint Archive</i>,
    2019/1015.'
  short: E. Kokoris Kogias, A. Spiegelman, D. Malkhi, I. Abraham, Cryptology EPrint
    Archive (n.d.).
date_created: 2020-08-26T12:18:00Z
date_published: 2019-09-10T00:00:00Z
date_updated: 2025-01-20T14:08:03Z
day: '10'
department:
- _id: ElKo
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2019/1015
month: '09'
oa: 1
oa_version: Preprint
publication: Cryptology ePrint Archive
publication_status: submitted
status: public
title: 'Bootstrapping consensus without trusted setup: Fully asynchronous distributed
  key generation'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8311'
abstract:
- lang: eng
  text: 'One of the core promises of blockchain technology is that of enabling trustworthy
    data dissemination in a trustless environment. What current blockchain systems
    deliver, however, is slow dissemination of public data, rendering blockchain technology
    unusable in settings where latency, transaction capacity, or data confidentiality
    are important. In this thesis we focus on providing solutions on two of the most
    pressing problems blockchain technology currently faces: scalability and data
    confidentiality. To address the scalability issue, we present OMNILEDGER, a novel
    scale-out distributed ledger that preserves long-term security under permissionless
    operation. It ensures security and correctness by using a bias-resistant public-randomness
    protocol for choosing large, statistically representative shards that process
    transactions, and by introducing an efficient cross-shard commit protocol that
    atomically handles transactions affecting multiple shards. To enable secure sharing
    of confidential data we present CALYPSO, the first fully decentralized, auditable
    access-control framework for secure blockchain-based data sharing which builds
    upon two abstractions. First, on-chain secrets enable collective management of
    (verifiably shared) secrets under a Byzantine adversary where an access-control
    blockchain enforces user-specific access rules and a secret-management cothority
    administers encrypted data. Second, skipchain-based identity and access management
    enables efficient administration of dynamic, sovereign identities and access policies
    and, in particular, permits clients to maintain long-term relationships with respect
    to evolving user identities thanks to the trust-delegating forward links of skipchains.
    In order to build OMNILEDGER and CALYPSO, we first build a set of tools for efficient
    decentralization, which are presented in Part II of this dissertation. These tools
    can be used in decentralized and distributed systems to achieve (1) scalable consensus
    (BYZCOIN), (2) bias- resistant distributed randomness creations (RANDHOUND), and
    (3) relationship-keeping between independently updating communication endpoints
    (SKIPCHAINIAC). Although we use this tools in the scope off this thesis, they
    can be (and already have been) used in a far wider scope.'
article_processing_charge: No
author:
- first_name: Eleftherios
  full_name: Kokoris Kogias, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: Kokoris Kogias
citation:
  ama: Kokoris Kogias E. Secure, confidential blockchains providing high throughput
    and low latency. 2019. doi:<a href="https://doi.org/10.5075/epfl-thesis-7101">10.5075/epfl-thesis-7101</a>
  apa: Kokoris Kogias, E. (2019). <i>Secure, confidential blockchains providing high
    throughput and low latency</i>. École Polytechnique Fédérale de Lausanne. <a href="https://doi.org/10.5075/epfl-thesis-7101">https://doi.org/10.5075/epfl-thesis-7101</a>
  chicago: Kokoris Kogias, Eleftherios. “Secure, Confidential Blockchains Providing
    High Throughput and Low Latency.” École Polytechnique Fédérale de Lausanne, 2019.
    <a href="https://doi.org/10.5075/epfl-thesis-7101">https://doi.org/10.5075/epfl-thesis-7101</a>.
  ieee: E. Kokoris Kogias, “Secure, confidential blockchains providing high throughput
    and low latency,” École Polytechnique Fédérale de Lausanne, 2019.
  ista: Kokoris Kogias E. 2019. Secure, confidential blockchains providing high throughput
    and low latency. École Polytechnique Fédérale de Lausanne.
  mla: Kokoris Kogias, Eleftherios. <i>Secure, Confidential Blockchains Providing
    High Throughput and Low Latency</i>. École Polytechnique Fédérale de Lausanne,
    2019, doi:<a href="https://doi.org/10.5075/epfl-thesis-7101">10.5075/epfl-thesis-7101</a>.
  short: E. Kokoris Kogias, Secure, Confidential Blockchains Providing High Throughput
    and Low Latency, École Polytechnique Fédérale de Lausanne, 2019.
date_created: 2020-08-27T11:22:24Z
date_published: 2019-09-27T00:00:00Z
date_updated: 2021-12-20T15:30:47Z
day: '27'
degree_awarded: PhD
doi: 10.5075/epfl-thesis-7101
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.doi.org/10.5075/epfl-thesis-7101
month: '09'
oa: 1
oa_version: Published Version
page: '244'
publication_status: published
publisher: École Polytechnique Fédérale de Lausanne
status: public
supervisor:
- first_name: Bryan Alexander
  full_name: Ford, Bryan Alexander
  last_name: Ford
title: Secure, confidential blockchains providing high throughput and low latency
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2019'
...
---
_id: '8313'
abstract:
- lang: eng
  text: The present invention concerns a computer-implemented method for secure data
    exchange between a sender (A) and a recipient (B), wherein the method is performed
    by the sender (A) and comprises encrypting data using a symmetric key k, creating
    a write transaction T W , wherein the write transaction T W comprises information
    usable to derive the symmetric key k and an access policy identifying the recipient
    (B) as being allowed to decrypt the encrypted data, providing the recipient (B)
    access to the encrypted data, and sending the write transaction T W to a first
    group of servers (AC) for being stored in a blockchain data structure maintained
    by the first group of servers (AC).
applicant:
- 'École Polytechnique Fédérale De Lausanne '
article_processing_charge: No
author:
- first_name: Bryan
  full_name: Ford, Bryan
  last_name: Ford
- first_name: Linus
  full_name: Gasser, Linus
  last_name: Gasser
- first_name: Eleftherios
  full_name: Kokoris Kogias, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: Kokoris Kogias
- first_name: Philipp
  full_name: Janovic, Philipp
  last_name: Janovic
citation:
  ama: Ford B, Gasser L, Kokoris Kogias E, Janovic P. Methods and systems for secure
    data exchange. 2019.
  apa: Ford, B., Gasser, L., Kokoris Kogias, E., &#38; Janovic, P. (2019). Methods
    and systems for secure data exchange.
  chicago: Ford, Bryan, Linus Gasser, Eleftherios Kokoris Kogias, and Philipp Janovic.
    “Methods and Systems for Secure Data Exchange,” 2019.
  ieee: B. Ford, L. Gasser, E. Kokoris Kogias, and P. Janovic, “Methods and systems
    for secure data exchange.” 2019.
  ista: Ford B, Gasser L, Kokoris Kogias E, Janovic P. 2019. Methods and systems for
    secure data exchange.
  mla: Ford, Bryan, et al. <i>Methods and Systems for Secure Data Exchange</i>. 2019.
  short: B. Ford, L. Gasser, E. Kokoris Kogias, P. Janovic, (2019).
date_created: 2020-08-27T11:24:44Z
date_published: 2019-08-22T00:00:00Z
date_updated: 2022-01-05T14:00:32Z
day: '22'
extern: '1'
ipc: G06F21/62 ; H04L9/08 ; H04L9/32
ipn: WO2019158209 (A1)
main_file_link:
- open_access: '1'
  url: https://patents.google.com/patent/WO2019158209A1
month: '08'
oa: 1
oa_version: Published Version
publication_date: 2019-08-22
status: public
title: Methods and systems for secure data exchange
type: patent
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2019'
...
---
_id: '8314'
abstract:
- lang: eng
  text: "Off-chain protocols (channels) are a promising solution to the scalability
    and privacy challenges of blockchain payments. Current proposals, however, require
    synchrony assumptions to preserve the safety of a channel, leaking to an adversary
    the exact amount of time needed to control the network for a successful attack.
    In this paper, we introduce Brick, the first payment channel that remains secure
    under network asynchrony and concurrently provides correct incentives. The core
    idea is to incorporate the conflict resolution process within the channel by introducing
    a rational committee of external parties, called Wardens. Hence, if a party wants
    to close a channel unilaterally, it can only get the committee's approval for
    the last valid state. Brick provides sub-second latency because it does not employ
    heavy-weight consensus. Instead,\r\nBrick uses consistent broadcast to announce
    updates and close the channel, a light-weight abstraction that is powerful enough
    to preserve safety and liveness to any rational parties. Furthermore, we consider
    permissioned blockchains, where the additional property of auditability might
    be desired for regulatory purposes. We introduce Brick+, an off-chain construction
    that provides auditability on top of Brick without conflicting with its privacy
    guarantees. We formally define the properties our payment channel construction
    should fulfill, and prove that both Brick and Brick+ satisfy them. We also design
    incentives for Brick such that honest and rational behavior aligns. Finally, we
    provide a reference implementation of the smart contracts in Solidity."
article_number: '1905.11360'
article_processing_charge: No
arxiv: 1
author:
- first_name: Georgia
  full_name: Avarikioti, Georgia
  last_name: Avarikioti
- first_name: Eleftherios
  full_name: Kokoris Kogias, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: Kokoris Kogias
- first_name: Roger
  full_name: Wattenhofer, Roger
  last_name: Wattenhofer
- first_name: Dionysis
  full_name: Zindros, Dionysis
  last_name: Zindros
citation:
  ama: 'Avarikioti G, Kokoris Kogias E, Wattenhofer R, Zindros D. Brick: Asynchronous
    payment channels. <i>arXiv</i>. doi:<a href="https://doi.org/10.48550/arXiv.1905.11360">10.48550/arXiv.1905.11360</a>'
  apa: 'Avarikioti, G., Kokoris Kogias, E., Wattenhofer, R., &#38; Zindros, D. (n.d.).
    Brick: Asynchronous payment channels. <i>arXiv</i>. <a href="https://doi.org/10.48550/arXiv.1905.11360">https://doi.org/10.48550/arXiv.1905.11360</a>'
  chicago: 'Avarikioti, Georgia, Eleftherios Kokoris Kogias, Roger Wattenhofer, and
    Dionysis Zindros. “Brick: Asynchronous Payment Channels.” <i>ArXiv</i>, n.d. <a
    href="https://doi.org/10.48550/arXiv.1905.11360">https://doi.org/10.48550/arXiv.1905.11360</a>.'
  ieee: 'G. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, and D. Zindros, “Brick:
    Asynchronous payment channels,” <i>arXiv</i>. .'
  ista: 'Avarikioti G, Kokoris Kogias E, Wattenhofer R, Zindros D. Brick: Asynchronous
    payment channels. arXiv, 1905.11360.'
  mla: 'Avarikioti, Georgia, et al. “Brick: Asynchronous Payment Channels.” <i>ArXiv</i>,
    1905.11360, doi:<a href="https://doi.org/10.48550/arXiv.1905.11360">10.48550/arXiv.1905.11360</a>.'
  short: G. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, D. Zindros, ArXiv (n.d.).
date_created: 2020-08-27T11:36:54Z
date_published: 2019-05-27T00:00:00Z
date_updated: 2025-06-26T11:26:45Z
day: '27'
doi: 10.48550/arXiv.1905.11360
extern: '1'
external_id:
  arxiv:
  - '1905.11360'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1905.11360
month: '05'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: 'Brick: Asynchronous payment channels'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8315'
abstract:
- lang: eng
  text: "Sharding distributed ledgers is the most promising on-chain solution for
    scaling blockchain technology. In this work, we define and analyze the properties
    a sharded distributed ledger should fulfill. More specifically, we show that a
    sharded blockchain cannot be scalable under a fully adaptive adversary, but it
    can scale up to $O(n/\\log n)$ under an epoch-adaptive adversary. This is possible
    only if the distributed ledger creates succinct proofs of the valid state updates
    at the end of each epoch. Our model builds upon and extends the Bitcoin backbone
    protocol by defining consistency and\r\nscalability. Consistency encompasses the
    need for atomic execution of cross-shard transactions to preserve safety, whereas
    scalability encapsulates the speedup a sharded system can gain in comparison to
    a non-sharded system. In\r\norder to show the power of our framework, we analyze
    the most prominent sharded blockchains and either prove their correctness (OmniLedger,
    RapidChain) under our model or pinpoint where they fail to balance the consistency
    and\r\nscalability requirements (Elastico, Monoxide). "
article_number: '1910.10434'
article_processing_charge: No
arxiv: 1
author:
- first_name: Georgia
  full_name: Avarikioti, Georgia
  last_name: Avarikioti
- first_name: Eleftherios
  full_name: Kokoris Kogias, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: Kokoris Kogias
- first_name: Roger
  full_name: Wattenhofer, Roger
  last_name: Wattenhofer
citation:
  ama: 'Avarikioti G, Kokoris Kogias E, Wattenhofer R. Divide and scale: Formalization
    of distributed ledger sharding protocols. <i>arXiv</i>. doi:<a href="https://doi.org/10.48550/arXiv.1910.10434">10.48550/arXiv.1910.10434</a>'
  apa: 'Avarikioti, G., Kokoris Kogias, E., &#38; Wattenhofer, R. (n.d.). Divide and
    scale: Formalization of distributed ledger sharding protocols. <i>arXiv</i>. <a
    href="https://doi.org/10.48550/arXiv.1910.10434">https://doi.org/10.48550/arXiv.1910.10434</a>'
  chicago: 'Avarikioti, Georgia, Eleftherios Kokoris Kogias, and Roger Wattenhofer.
    “Divide and Scale: Formalization of Distributed Ledger Sharding Protocols.” <i>ArXiv</i>,
    n.d. <a href="https://doi.org/10.48550/arXiv.1910.10434">https://doi.org/10.48550/arXiv.1910.10434</a>.'
  ieee: 'G. Avarikioti, E. Kokoris Kogias, and R. Wattenhofer, “Divide and scale:
    Formalization of distributed ledger sharding protocols,” <i>arXiv</i>. .'
  ista: 'Avarikioti G, Kokoris Kogias E, Wattenhofer R. Divide and scale: Formalization
    of distributed ledger sharding protocols. arXiv, 1910.10434.'
  mla: 'Avarikioti, Georgia, et al. “Divide and Scale: Formalization of Distributed
    Ledger Sharding Protocols.” <i>ArXiv</i>, 1910.10434, doi:<a href="https://doi.org/10.48550/arXiv.1910.10434">10.48550/arXiv.1910.10434</a>.'
  short: G. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, ArXiv (n.d.).
date_created: 2020-08-27T11:37:43Z
date_published: 2019-10-23T00:00:00Z
date_updated: 2025-06-26T11:28:33Z
day: '23'
doi: 10.48550/arXiv.1910.10434
extern: '1'
external_id:
  arxiv:
  - '1910.10434'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1910.10434
month: '10'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: 'Divide and scale: Formalization of distributed ledger sharding protocols'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8405'
abstract:
- lang: eng
  text: Atomic-resolution structure determination is crucial for understanding protein
    function. Cryo-EM and NMR spectroscopy both provide structural information, but
    currently cryo-EM does not routinely give access to atomic-level structural data,
    and, generally, NMR structure determination is restricted to small (<30 kDa) proteins.
    We introduce an integrated structure determination approach that simultaneously
    uses NMR and EM data to overcome the limits of each of these methods. The approach
    enables structure determination of the 468 kDa large dodecameric aminopeptidase
    TET2 to a precision and accuracy below 1 Å by combining secondary-structure information
    obtained from near-complete magic-angle-spinning NMR assignments of the 39 kDa-large
    subunits, distance restraints from backbone amides and ILV methyl groups, and
    a 4.1 Å resolution EM map. The resulting structure exceeds current standards of
    NMR and EM structure determination in terms of molecular weight and precision.
    Importantly, the approach is successful even in cases where only medium-resolution
    cryo-EM data are available.
article_number: '2697'
article_processing_charge: No
article_type: original
author:
- first_name: Diego F.
  full_name: Gauto, Diego F.
  last_name: Gauto
- first_name: Leandro F.
  full_name: Estrozi, Leandro F.
  last_name: Estrozi
- first_name: Charles D.
  full_name: Schwieters, Charles D.
  last_name: Schwieters
- first_name: Gregory
  full_name: Effantin, Gregory
  last_name: Effantin
- first_name: Pavel
  full_name: Macek, Pavel
  last_name: Macek
- first_name: Remy
  full_name: Sounier, Remy
  last_name: Sounier
- first_name: Astrid C.
  full_name: Sivertsen, Astrid C.
  last_name: Sivertsen
- first_name: Elena
  full_name: Schmidt, Elena
  last_name: Schmidt
- first_name: Rime
  full_name: Kerfah, Rime
  last_name: Kerfah
- first_name: Guillaume
  full_name: Mas, Guillaume
  last_name: Mas
- first_name: Jacques-Philippe
  full_name: Colletier, Jacques-Philippe
  last_name: Colletier
- first_name: Peter
  full_name: Güntert, Peter
  last_name: Güntert
- first_name: Adrien
  full_name: Favier, Adrien
  last_name: Favier
- first_name: Guy
  full_name: Schoehn, Guy
  last_name: Schoehn
- first_name: Paul
  full_name: Schanda, Paul
  id: 7B541462-FAF6-11E9-A490-E8DFE5697425
  last_name: Schanda
  orcid: 0000-0002-9350-7606
- first_name: Jerome
  full_name: Boisbouvier, Jerome
  last_name: Boisbouvier
citation:
  ama: Gauto DF, Estrozi LF, Schwieters CD, et al. Integrated NMR and cryo-EM atomic-resolution
    structure determination of a half-megadalton enzyme complex. <i>Nature Communications</i>.
    2019;10. doi:<a href="https://doi.org/10.1038/s41467-019-10490-9">10.1038/s41467-019-10490-9</a>
  apa: Gauto, D. F., Estrozi, L. F., Schwieters, C. D., Effantin, G., Macek, P., Sounier,
    R., … Boisbouvier, J. (2019). Integrated NMR and cryo-EM atomic-resolution structure
    determination of a half-megadalton enzyme complex. <i>Nature Communications</i>.
    Springer Nature. <a href="https://doi.org/10.1038/s41467-019-10490-9">https://doi.org/10.1038/s41467-019-10490-9</a>
  chicago: Gauto, Diego F., Leandro F. Estrozi, Charles D. Schwieters, Gregory Effantin,
    Pavel Macek, Remy Sounier, Astrid C. Sivertsen, et al. “Integrated NMR and Cryo-EM
    Atomic-Resolution Structure Determination of a Half-Megadalton Enzyme Complex.”
    <i>Nature Communications</i>. Springer Nature, 2019. <a href="https://doi.org/10.1038/s41467-019-10490-9">https://doi.org/10.1038/s41467-019-10490-9</a>.
  ieee: D. F. Gauto <i>et al.</i>, “Integrated NMR and cryo-EM atomic-resolution structure
    determination of a half-megadalton enzyme complex,” <i>Nature Communications</i>,
    vol. 10. Springer Nature, 2019.
  ista: Gauto DF, Estrozi LF, Schwieters CD, Effantin G, Macek P, Sounier R, Sivertsen
    AC, Schmidt E, Kerfah R, Mas G, Colletier J-P, Güntert P, Favier A, Schoehn G,
    Schanda P, Boisbouvier J. 2019. Integrated NMR and cryo-EM atomic-resolution structure
    determination of a half-megadalton enzyme complex. Nature Communications. 10,
    2697.
  mla: Gauto, Diego F., et al. “Integrated NMR and Cryo-EM Atomic-Resolution Structure
    Determination of a Half-Megadalton Enzyme Complex.” <i>Nature Communications</i>,
    vol. 10, 2697, Springer Nature, 2019, doi:<a href="https://doi.org/10.1038/s41467-019-10490-9">10.1038/s41467-019-10490-9</a>.
  short: D.F. Gauto, L.F. Estrozi, C.D. Schwieters, G. Effantin, P. Macek, R. Sounier,
    A.C. Sivertsen, E. Schmidt, R. Kerfah, G. Mas, J.-P. Colletier, P. Güntert, A.
    Favier, G. Schoehn, P. Schanda, J. Boisbouvier, Nature Communications 10 (2019).
date_created: 2020-09-17T10:28:25Z
date_published: 2019-06-19T00:00:00Z
date_updated: 2021-01-12T08:19:03Z
day: '19'
doi: 10.1038/s41467-019-10490-9
extern: '1'
external_id:
  pmid:
  - '31217444'
intvolume: '        10'
keyword:
- General Biochemistry
- Genetics and Molecular Biology
- General Physics and Astronomy
- General Chemistry
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1038/s41467-019-10490-9
month: '06'
oa: 1
oa_version: Published Version
pmid: 1
publication: Nature Communications
publication_identifier:
  issn:
  - 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Integrated NMR and cryo-EM atomic-resolution structure determination of a half-megadalton
  enzyme complex
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2019'
...
