---
_id: '9416'
abstract:
- lang: eng
  text: 'We study the inductive bias of two-layer ReLU networks trained by gradient
    flow. We identify a class of easy-to-learn (`orthogonally separable'') datasets,
    and characterise the solution that ReLU networks trained on such datasets converge
    to. Irrespective of network width, the solution turns out to be a combination
    of two max-margin classifiers: one corresponding to the positive data subset and
    one corresponding to the negative data subset. The proof is based on the recently
    introduced concept of extremal sectors, for which we prove a number of properties
    in the context of orthogonal separability. In particular, we prove stationarity
    of activation patterns from some time  onwards, which enables a reduction of the
    ReLU network to an ensemble of linear subnetworks.'
article_processing_charge: No
author:
- first_name: Phuong
  full_name: Bui Thi Mai, Phuong
  id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87
  last_name: Bui Thi Mai
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
citation:
  ama: 'Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable
    data. In: <i>9th International Conference on Learning Representations</i>. ; 2021.'
  apa: Phuong, M., &#38; Lampert, C. (2021). The inductive bias of ReLU networks on
    orthogonally separable data. In <i>9th International Conference on Learning Representations</i>.
    Virtual.
  chicago: Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks
    on Orthogonally Separable Data.” In <i>9th International Conference on Learning
    Representations</i>, 2021.
  ieee: M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally
    separable data,” in <i>9th International Conference on Learning Representations</i>,
    Virtual, 2021.
  ista: 'Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally
    separable data. 9th International Conference on Learning Representations. ICLR:
    International Conference on Learning Representations.'
  mla: Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on
    Orthogonally Separable Data.” <i>9th International Conference on Learning Representations</i>,
    2021.
  short: M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations,
    2021.
conference:
  end_date: 2021-05-07
  location: Virtual
  name: 'ICLR: International Conference on Learning Representations'
  start_date: 2021-05-03
corr_author: '1'
date_created: 2021-05-24T11:16:46Z
date_published: 2021-05-01T00:00:00Z
date_updated: 2026-04-08T07:01:16Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ChLa
file:
- access_level: open_access
  checksum: f34ff17017527db5ba6927f817bdd125
  content_type: application/pdf
  creator: bphuong
  date_created: 2021-05-24T11:15:57Z
  date_updated: 2021-05-24T11:15:57Z
  file_id: '9417'
  file_name: iclr2021_conference.pdf
  file_size: 502356
  relation: main_file
file_date_updated: 2021-05-24T11:15:57Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://openreview.net/pdf?id=krz7T0xU9Z_
month: '05'
oa: 1
oa_version: Published Version
publication: 9th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
related_material:
  record:
  - id: '9418'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: The inductive bias of ReLU networks on orthogonally separable data
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10041'
abstract:
- lang: eng
  text: Yao’s garbling scheme is one of the most fundamental cryptographic constructions.
    Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security
    in the selective setting where the adversary chooses the challenge inputs before
    seeing the garbled circuit assuming secure symmetric-key encryption (and hence
    one-way functions). This was followed by results, both positive and negative,
    concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto
    2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility
    argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s
    scheme (where the output mapping is sent in the online phase, together with the
    garbled input) that circumvents this negative result, and proved that it is adaptively
    secure, at least for shallow circuits. In particular, they showed that for the
    class of circuits of depth   δ , the loss in security is at most exponential in   δ
    . The above results all concern the simulation-based notion of security. In this
    work, we show that the upper bound of Jafargholi and Wichs is basically optimal
    in a strong sense. As our main result, we show that there exists a family of Boolean
    circuits, one for each depth  δ∈N , such that any black-box reduction proving
    the adaptive indistinguishability of the natural adaptation of Yao’s scheme from
    any symmetric-key encryption has to lose a factor that is exponential in   δ√
    . Since indistinguishability is a weaker notion than simulation, our bound also
    applies to adaptive simulation. To establish our results, we build on the recent
    approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction
    with oracle separations to prove fine-grained lower bounds on loss in cryptographic
    security.
acknowledgement: We would like to thank the anonymous reviewers of Crypto’21 whose
  detailed comments helped us considerably improve the presentation of the paper.
alternative_title:
- LCNS
article_processing_charge: No
author:
- first_name: Chethan
  full_name: Kamath Hosdurg, Chethan
  id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
  last_name: Kamath Hosdurg
  orcid: 0009-0006-6812-7317
- first_name: Karen
  full_name: Klein, Karen
  id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
  last_name: Klein
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
- first_name: Daniel
  full_name: Wichs, Daniel
  last_name: Wichs
citation:
  ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security
    of Yao’s Garbling. In: <i>41st Annual International Cryptology Conference, Part
    II </i>. Vol 12826. Cham: Springer Nature; 2021:486-515. doi:<a href="https://doi.org/10.1007/978-3-030-84245-1_17">10.1007/978-3-030-84245-1_17</a>'
  apa: 'Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &#38; Wichs, D. (2021). Limits
    on the Adaptive Security of Yao’s Garbling. In <i>41st Annual International Cryptology
    Conference, Part II </i> (Vol. 12826, pp. 486–515). Cham: Springer Nature. <a
    href="https://doi.org/10.1007/978-3-030-84245-1_17">https://doi.org/10.1007/978-3-030-84245-1_17</a>'
  chicago: 'Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel
    Wichs. “Limits on the Adaptive Security of Yao’s Garbling.” In <i>41st Annual
    International Cryptology Conference, Part II </i>, 12826:486–515. Cham: Springer
    Nature, 2021. <a href="https://doi.org/10.1007/978-3-030-84245-1_17">https://doi.org/10.1007/978-3-030-84245-1_17</a>.'
  ieee: C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the
    Adaptive Security of Yao’s Garbling,” in <i>41st Annual International Cryptology
    Conference, Part II </i>, Virtual, 2021, vol. 12826, pp. 486–515.
  ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive
    Security of Yao’s Garbling. 41st Annual International Cryptology Conference, Part
    II . CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.'
  mla: Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.”
    <i>41st Annual International Cryptology Conference, Part II </i>, vol. 12826,
    Springer Nature, 2021, pp. 486–515, doi:<a href="https://doi.org/10.1007/978-3-030-84245-1_17">10.1007/978-3-030-84245-1_17</a>.
  short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International
    Cryptology Conference, Part II , Springer Nature, Cham, 2021, pp. 486–515.
conference:
  end_date: 2021-08-20
  location: Virtual
  name: 'CRYPTO: Annual International Cryptology Conference'
  start_date: 2021-08-16
date_created: 2021-09-23T14:06:15Z
date_published: 2021-08-11T00:00:00Z
date_updated: 2026-04-08T07:01:43Z
day: '11'
department:
- _id: KrPi
doi: 10.1007/978-3-030-84245-1_17
ec_funded: 1
external_id:
  isi:
  - '000696697800017'
intvolume: '     12826'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2021/945
month: '08'
oa: 1
oa_version: Preprint
page: 486-515
place: Cham
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '682815'
  name: Teaching Old Crypto New Tricks
publication: '41st Annual International Cryptology Conference, Part II '
publication_identifier:
  eisbn:
  - 978-3-030-84245-1
  eissn:
  - 1611-3349
  isbn:
  - 978-3-030-84244-4
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '10035'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Limits on the Adaptive Security of Yao’s Garbling
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 12826
year: '2021'
...
---
_id: '10049'
abstract:
- lang: eng
  text: While messaging systems with strong security guarantees are widely used in
    practice, designing a protocol that scales efficiently to large groups and enjoys
    similar security guarantees remains largely open. The two existing proposals to
    date are ART (Cohn-Gordon et al., CCS18) and TreeKEM (IETF, The Messaging Layer
    Security Protocol, draft). TreeKEM is the currently considered candidate by the
    IETF MLS working group, but dynamic group operations (i.e. adding and removing
    users) can cause efficiency issues. In this paper we formalize and analyze a variant
    of TreeKEM which we term Tainted TreeKEM (TTKEM for short). The basic idea underlying
    TTKEM was suggested by Millican (MLS mailing list, February 2018). This version
    is more efficient than TreeKEM for some natural distributions of group operations,
    we quantify this through simulations.Our second contribution is two security proofs
    for TTKEM which establish post compromise and forward secrecy even against adaptive
    attackers. The security loss (to the underlying PKE) in the Random Oracle Model
    is a polynomial factor, and a quasipolynomial one in the Standard Model. Our proofs
    can be adapted to TreeKEM as well. Before our work no security proof for any TreeKEM-like
    protocol establishing tight security against an adversary who can adaptively choose
    the sequence of operations was known. We also are the first to prove (or even
    formalize) active security where the server can arbitrarily deviate from the protocol
    specification. Proving fully active security – where also the users can arbitrarily
    deviate – remains open.
acknowledgement: The first three authors contributed equally to this work. Funded
  by the European Research Council (ERC) under the European Union’s Horizon2020 research
  and innovation programme (682815-TOCNeT). Funded by the European Union’s Horizon
  2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
  No.665385.
article_processing_charge: No
author:
- first_name: Karen
  full_name: Klein, Karen
  id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
  last_name: Klein
- first_name: Guillermo
  full_name: Pascual Perez, Guillermo
  id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87
  last_name: Pascual Perez
  orcid: 0000-0001-8630-415X
- first_name: Michael
  full_name: Walter, Michael
  id: 488F98B0-F248-11E8-B48F-1D18A9856A87
  last_name: Walter
  orcid: 0000-0003-3186-2482
- first_name: Chethan
  full_name: Kamath Hosdurg, Chethan
  id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
  last_name: Kamath Hosdurg
  orcid: 0009-0006-6812-7317
- first_name: Margarita
  full_name: Capretto, Margarita
  last_name: Capretto
- first_name: Miguel
  full_name: Cueto Noval, Miguel
  id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc
  last_name: Cueto Noval
  orcid: 0000-0002-2505-4246
- first_name: Ilia
  full_name: Markov, Ilia
  id: D0CF4148-C985-11E9-8066-0BDEE5697425
  last_name: Markov
- first_name: Michelle X
  full_name: Yeo, Michelle X
  id: 2D82B818-F248-11E8-B48F-1D18A9856A87
  last_name: Yeo
  orcid: 0009-0001-3676-4809
- 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: 'Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM,
    adaptively and actively secure continuous group key agreement. In: <i>2021 IEEE
    Symposium on Security and Privacy </i>. IEEE; 2021:268-284. doi:<a href="https://doi.org/10.1109/sp40001.2021.00035">10.1109/sp40001.2021.00035</a>'
  apa: 'Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M.,
    Cueto Noval, M., … Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively
    and actively secure continuous group key agreement. In <i>2021 IEEE Symposium
    on Security and Privacy </i> (pp. 268–284). San Francisco, CA, United States:
    IEEE. <a href="https://doi.org/10.1109/sp40001.2021.00035">https://doi.org/10.1109/sp40001.2021.00035</a>'
  chicago: 'Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath
    Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo,
    Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively
    and Actively Secure Continuous Group Key Agreement.” In <i>2021 IEEE Symposium
    on Security and Privacy </i>, 268–84. IEEE, 2021. <a href="https://doi.org/10.1109/sp40001.2021.00035">https://doi.org/10.1109/sp40001.2021.00035</a>.'
  ieee: 'K. Klein <i>et al.</i>, “Keep the dirt: tainted TreeKEM, adaptively and actively
    secure continuous group key agreement,” in <i>2021 IEEE Symposium on Security
    and Privacy </i>, San Francisco, CA, United States, 2021, pp. 268–284.'
  ista: 'Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval
    M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM,
    adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium
    on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.'
  mla: 'Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively
    Secure Continuous Group Key Agreement.” <i>2021 IEEE Symposium on Security and
    Privacy </i>, IEEE, 2021, pp. 268–84, doi:<a href="https://doi.org/10.1109/sp40001.2021.00035">10.1109/sp40001.2021.00035</a>.'
  short: K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M.
    Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium
    on Security and Privacy , IEEE, 2021, pp. 268–284.
conference:
  end_date: 2021-05-27
  location: San Francisco, CA, United States
  name: 'SP: Symposium on Security and Privacy'
  start_date: 2021-05-24
corr_author: '1'
date_created: 2021-09-27T13:46:27Z
date_published: 2021-08-26T00:00:00Z
date_updated: 2026-04-08T07:01:44Z
day: '26'
department:
- _id: KrPi
- _id: DaAl
doi: 10.1109/sp40001.2021.00035
ec_funded: 1
external_id:
  isi:
  - '001316065000016'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2019/1489
month: '08'
oa: 1
oa_version: Preprint
page: 268-284
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '682815'
  name: Teaching Old Crypto New Tricks
publication: '2021 IEEE Symposium on Security and Privacy '
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
  record:
  - id: '18088'
    relation: dissertation_contains
    status: public
  - id: '10035'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: 'Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous
  group key agreement'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2021'
...
---
_id: '10048'
abstract:
- lang: eng
  text: "The security of cryptographic primitives and protocols against adversaries
    that are allowed to make adaptive choices (e.g., which parties to corrupt or which
    queries to make) is notoriously difficult to establish. A broad theoretical\r\nframework
    was introduced by Jafargholi et al. [Crypto’17] for this purpose. In this paper
    we initiate the study of lower bounds on loss in adaptive security for certain
    cryptographic protocols considered in the framework. We prove lower\r\nbounds
    that almost match the upper bounds (proven using the framework) for proxy re-encryption,
    prefix-constrained PRFs and generalized selective decryption, a security game
    that captures the security of certain group messaging and\r\nbroadcast encryption
    schemes. Those primitives have in common that their security game involves an
    underlying graph that can be adaptively built by the adversary. Some of our lower
    bounds only apply to a restricted class of black-box reductions which we term
    “oblivious” (the existing upper bounds are of this restricted type), some apply
    to the broader but still restricted class of non-rewinding reductions, while our
    lower bound for proxy re-encryption applies to all black-box reductions. The fact
    that some of our lower bounds seem to crucially rely on obliviousness or at least
    a non-rewinding reduction hints to the exciting possibility that the existing
    upper bounds can be improved by using more sophisticated reductions. Our main
    conceptual contribution is a two-player multi-stage game called the Builder-Pebbler
    Game. We can translate bounds on the winning probabilities for various instantiations
    of this game into cryptographic lower bounds for the above-mentioned primitives
    using oracle separation techniques.\r\n"
article_processing_charge: No
author:
- first_name: Chethan
  full_name: Kamath Hosdurg, Chethan
  id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
  last_name: Kamath Hosdurg
  orcid: 0009-0006-6812-7317
- first_name: Karen
  full_name: Klein, Karen
  id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
  last_name: Klein
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
- first_name: Michael
  full_name: Walter, Michael
  id: 488F98B0-F248-11E8-B48F-1D18A9856A87
  last_name: Walter
  orcid: 0000-0003-3186-2482
citation:
  ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in
    security games on graphs. In: <i>19th Theory of Cryptography Conference 2021</i>.
    International Association for Cryptologic Research; 2021.'
  apa: 'Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &#38; Walter, M. (2021). The
    cost of adaptivity in security games on graphs. In <i>19th Theory of Cryptography
    Conference 2021</i>. Raleigh, NC, United States: International Association for
    Cryptologic Research.'
  chicago: Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael
    Walter. “The Cost of Adaptivity in Security Games on Graphs.” In <i>19th Theory
    of Cryptography Conference 2021</i>. International Association for Cryptologic
    Research, 2021.
  ieee: C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity
    in security games on graphs,” in <i>19th Theory of Cryptography Conference 2021</i>,
    Raleigh, NC, United States, 2021.
  ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity
    in security games on graphs. 19th Theory of Cryptography Conference 2021. TCC:
    Theory of Cryptography Conference.'
  mla: Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on
    Graphs.” <i>19th Theory of Cryptography Conference 2021</i>, International Association
    for Cryptologic Research, 2021.
  short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th Theory of
    Cryptography Conference 2021, International Association for Cryptologic Research,
    2021.
conference:
  end_date: 2021-11-11
  location: Raleigh, NC, United States
  name: 'TCC: Theory of Cryptography Conference'
  start_date: 2021-11-08
date_created: 2021-09-27T12:52:05Z
date_published: 2021-07-08T00:00:00Z
date_updated: 2026-04-08T07:01:43Z
day: '08'
department:
- _id: KrPi
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://ia.cr/2021/059
month: '07'
oa: 1
oa_version: Preprint
publication: 19th Theory of Cryptography Conference 2021
publication_status: published
publisher: International Association for Cryptologic Research
quality_controlled: '1'
related_material:
  record:
  - id: '10410'
    relation: later_version
    status: public
  - id: '10035'
    relation: dissertation_contains
    status: public
status: public
title: The cost of adaptivity in security games on graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10044'
abstract:
- lang: eng
  text: We show that Yao’s garbling scheme is adaptively indistinguishable for the
    class of Boolean circuits of size S and treewidth w with only a S^O(w) loss in
    security. For instance, circuits with constant treewidth are as a result adaptively
    indistinguishable with only a polynomial loss. This (partially) complements a
    negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way
    functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main
    technical contributions, we introduce a new pebble game that abstracts out our
    security reduction and then present a pebbling strategy for this game where the
    number of pebbles used is roughly O(d w log(S)), d being the fan-out of the circuit.
    The design of the strategy relies on separators, a graph-theoretic notion with
    connections to circuit complexity.
acknowledgement: 'We would like to thank Daniel Wichs for helpful discussions on the
  landscape of adaptive security of Yao’s garbling.  '
article_number: 2021/926
article_processing_charge: No
author:
- first_name: Chethan
  full_name: Kamath Hosdurg, Chethan
  id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
  last_name: Kamath Hosdurg
  orcid: 0009-0006-6812-7317
- first_name: Karen
  full_name: Klein, Karen
  id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
  last_name: Klein
- 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: 'Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s
    garbling. In: <i>19th Theory of Cryptography Conference 2021</i>. International
    Association for Cryptologic Research; 2021.'
  apa: 'Kamath Hosdurg, C., Klein, K., &#38; Pietrzak, K. Z. (2021). On treewidth,
    separators and Yao’s garbling. In <i>19th Theory of Cryptography Conference 2021</i>.
    Raleigh, NC, United States: International Association for Cryptologic Research.'
  chicago: Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth,
    Separators and Yao’s Garbling.” In <i>19th Theory of Cryptography Conference 2021</i>.
    International Association for Cryptologic Research, 2021.
  ieee: C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators
    and Yao’s garbling,” in <i>19th Theory of Cryptography Conference 2021</i>, Raleigh,
    NC, United States, 2021.
  ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and
    Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography
    Conference, 2021/926.'
  mla: Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.”
    <i>19th Theory of Cryptography Conference 2021</i>, 2021/926, International Association
    for Cryptologic Research, 2021.
  short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography
    Conference 2021, International Association for Cryptologic Research, 2021.
conference:
  end_date: 2021-11-11
  location: Raleigh, NC, United States
  name: 'TCC: Theory of Cryptography Conference'
  start_date: 2021-11-08
date_created: 2021-09-24T12:01:34Z
date_published: 2021-07-08T00:00:00Z
date_updated: 2026-04-08T07:01:43Z
day: '08'
department:
- _id: KrPi
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2021/926
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '682815'
  name: Teaching Old Crypto New Tricks
publication: 19th Theory of Cryptography Conference 2021
publication_status: published
publisher: International Association for Cryptologic Research
quality_controlled: '1'
related_material:
  record:
  - id: '10409'
    relation: later_version
    status: public
  - id: '10035'
    relation: dissertation_contains
    status: public
status: public
title: On treewidth, separators and Yao's garbling
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10321'
abstract:
- lang: eng
  text: Mosaic analysis with double markers (MADM) technology enables the generation
    of genetic mosaic tissue in mice. MADM enables concomitant fluorescent cell labeling
    and introduction of a mutation of a gene of interest with single-cell resolution.
    This protocol highlights major steps for the generation of genetic mosaic tissue
    and the isolation and processing of respective tissues for downstream histological
    analysis. For complete details on the use and execution of this protocol, please
    refer to Contreras et al. (2021).
acknowledged_ssus:
- _id: Bio
- _id: PreCl
acknowledgement: This research was supported by the Scientific Service Units (SSU)
  at IST Austria through resources provided by the Bioimaging (BIF) and Preclinical
  Facilities (PCF). We particularly thank Mohammad Goudarzi for assistance with photography
  of mouse perfusion and dissection. N.A. received support from FWF Firnberg-Programm
  (T 1031). This work was also supported by IST Austria institutional funds; FWF SFB
  F78 to S.H.; and the European Research Council (ERC) under the European Union’s
  Horizon 2020 research and innovation programme (grant agreement no. 725780 LinPro)
  to S.H.
article_number: '100939'
article_processing_charge: Yes
article_type: original
author:
- first_name: Nicole
  full_name: Amberg, Nicole
  id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87
  last_name: Amberg
  orcid: 0000-0002-3183-8207
- first_name: Simon
  full_name: Hippenmeyer, Simon
  id: 37B36620-F248-11E8-B48F-1D18A9856A87
  last_name: Hippenmeyer
  orcid: 0000-0003-2279-1061
citation:
  ama: Amberg N, Hippenmeyer S. Genetic mosaic dissection of candidate genes in mice
    using mosaic analysis with double markers. <i>STAR Protocols</i>. 2021;2(4). doi:<a
    href="https://doi.org/10.1016/j.xpro.2021.100939">10.1016/j.xpro.2021.100939</a>
  apa: Amberg, N., &#38; Hippenmeyer, S. (2021). Genetic mosaic dissection of candidate
    genes in mice using mosaic analysis with double markers. <i>STAR Protocols</i>.
    Cell Press. <a href="https://doi.org/10.1016/j.xpro.2021.100939">https://doi.org/10.1016/j.xpro.2021.100939</a>
  chicago: Amberg, Nicole, and Simon Hippenmeyer. “Genetic Mosaic Dissection of Candidate
    Genes in Mice Using Mosaic Analysis with Double Markers.” <i>STAR Protocols</i>.
    Cell Press, 2021. <a href="https://doi.org/10.1016/j.xpro.2021.100939">https://doi.org/10.1016/j.xpro.2021.100939</a>.
  ieee: N. Amberg and S. Hippenmeyer, “Genetic mosaic dissection of candidate genes
    in mice using mosaic analysis with double markers,” <i>STAR Protocols</i>, vol.
    2, no. 4. Cell Press, 2021.
  ista: Amberg N, Hippenmeyer S. 2021. Genetic mosaic dissection of candidate genes
    in mice using mosaic analysis with double markers. STAR Protocols. 2(4), 100939.
  mla: Amberg, Nicole, and Simon Hippenmeyer. “Genetic Mosaic Dissection of Candidate
    Genes in Mice Using Mosaic Analysis with Double Markers.” <i>STAR Protocols</i>,
    vol. 2, no. 4, 100939, Cell Press, 2021, doi:<a href="https://doi.org/10.1016/j.xpro.2021.100939">10.1016/j.xpro.2021.100939</a>.
  short: N. Amberg, S. Hippenmeyer, STAR Protocols 2 (2021).
corr_author: '1'
date_created: 2021-11-21T23:01:28Z
date_published: 2021-11-10T00:00:00Z
date_updated: 2025-04-15T08:23:07Z
day: '10'
ddc:
- '573'
department:
- _id: SiHi
doi: 10.1016/j.xpro.2021.100939
ec_funded: 1
file:
- access_level: open_access
  checksum: 9e3f6d06bf583e7a8b6a9e9a60500a28
  content_type: application/pdf
  creator: cchlebak
  date_created: 2021-11-22T08:23:58Z
  date_updated: 2021-11-22T08:23:58Z
  file_id: '10329'
  file_name: 2021_STARProtocols_Amberg.pdf
  file_size: 7309464
  relation: main_file
  success: 1
file_date_updated: 2021-11-22T08:23:58Z
has_accepted_license: '1'
intvolume: '         2'
issue: '4'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '725780'
  name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
- _id: 268F8446-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: T01031
  name: Role of Eed in neural stem cell lineage progression
- _id: 059F6AB4-7A3F-11EA-A408-12923DDC885E
  grant_number: F7805
  name: Stem Cell Modulation in Neural Development and Regeneration/ P05-Molecular
    Mechanisms of Neural Stem Cell Lineage Progression
publication: STAR Protocols
publication_identifier:
  eissn:
  - 2666-1667
publication_status: published
publisher: Cell Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Genetic mosaic dissection of candidate genes in mice using mosaic analysis
  with double markers
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2021'
...
---
_id: '9073'
abstract:
- lang: eng
  text: The sensory and cognitive abilities of the mammalian neocortex are underpinned
    by intricate columnar and laminar circuits formed from an array of diverse neuronal
    populations. One approach to determining how interactions between these circuit
    components give rise to complex behavior is to investigate the rules by which
    cortical circuits are formed and acquire functionality during development. This
    review summarizes recent research on the development of the neocortex, from genetic
    determination in neural stem cells through to the dynamic role that specific neuronal
    populations play in the earliest circuits of neocortex, and how they contribute
    to emergent function and cognition. While many of these endeavors take advantage
    of model systems, consideration will also be given to advances in our understanding
    of activity in nascent human circuits. Such cross-species perspective is imperative
    when investigating the mechanisms underlying the dysfunction of early neocortical
    circuits in neurodevelopmental disorders, so that one can identify targets amenable
    to therapeutic intervention.
acknowledgement: Work in the I.L.H.-O. laboratory was supported by European Research
  Council Grant ERC-2015-CoG 681577 and German Research Foundation Ha 4466/10-1, Ha4466/11-1,
  Ha4466/12-1, SPP 1665, and SFB 936B5. Work in the S.J.B.B. laboratory was supported
  by Biotechnology and Biological Sciences Research Council BB/P003796/1, Medical
  Research Council MR/K004387/1 and MR/T033320/1, Wellcome Trust 215199/Z/19/Z and
  102386/Z/13/Z, and John Fell Fund. Work in the S.H. laboratory was supported by
  European Research Council Grants ERC-2016-CoG 725780 LinPro and FWF SFB F78. This
  work was supported by National Institutes of Health Grant NIMH 1R01MH110553 to N.V.D.M.G.
  Work in the J.A.C. laboratory was supported by the Ludwig Family Foundation, Simons
  Foundation SFARI Research Award, and National Institutes of Health/National Institute
  of Mental Health R01 MH102365 and R01MH113852. The B.V. laboratory was supported
  by Whitehall Foundation 2017-12-73, National Science Foundation 1736028, National
  Institutes of Health, National Institute of General Medical Sciences R01GM134363-01,
  and Halıcıoğlu Data Science Institute Fellowship. This work was supported by the
  University of California San Diego School of Medicine.
article_processing_charge: No
article_type: original
author:
- first_name: Ileana L.
  full_name: Hanganu-Opatz, Ileana L.
  last_name: Hanganu-Opatz
- first_name: Simon J. B.
  full_name: Butt, Simon J. B.
  last_name: Butt
- first_name: Simon
  full_name: Hippenmeyer, Simon
  id: 37B36620-F248-11E8-B48F-1D18A9856A87
  last_name: Hippenmeyer
  orcid: 0000-0003-2279-1061
- first_name: Natalia V.
  full_name: De Marco García, Natalia V.
  last_name: De Marco García
- first_name: Jessica A.
  full_name: Cardin, Jessica A.
  last_name: Cardin
- first_name: Bradley
  full_name: Voytek, Bradley
  last_name: Voytek
- first_name: Alysson R.
  full_name: Muotri, Alysson R.
  last_name: Muotri
citation:
  ama: Hanganu-Opatz IL, Butt SJB, Hippenmeyer S, et al. The logic of developing neocortical
    circuits in health and disease. <i>The Journal of Neuroscience</i>. 2021;41(5):813-822.
    doi:<a href="https://doi.org/10.1523/jneurosci.1655-20.2020">10.1523/jneurosci.1655-20.2020</a>
  apa: Hanganu-Opatz, I. L., Butt, S. J. B., Hippenmeyer, S., De Marco García, N.
    V., Cardin, J. A., Voytek, B., &#38; Muotri, A. R. (2021). The logic of developing
    neocortical circuits in health and disease. <i>The Journal of Neuroscience</i>.
    Society for Neuroscience. <a href="https://doi.org/10.1523/jneurosci.1655-20.2020">https://doi.org/10.1523/jneurosci.1655-20.2020</a>
  chicago: Hanganu-Opatz, Ileana L., Simon J. B. Butt, Simon Hippenmeyer, Natalia
    V. De Marco García, Jessica A. Cardin, Bradley Voytek, and Alysson R. Muotri.
    “The Logic of Developing Neocortical Circuits in Health and Disease.” <i>The Journal
    of Neuroscience</i>. Society for Neuroscience, 2021. <a href="https://doi.org/10.1523/jneurosci.1655-20.2020">https://doi.org/10.1523/jneurosci.1655-20.2020</a>.
  ieee: I. L. Hanganu-Opatz <i>et al.</i>, “The logic of developing neocortical circuits
    in health and disease,” <i>The Journal of Neuroscience</i>, vol. 41, no. 5. Society
    for Neuroscience, pp. 813–822, 2021.
  ista: Hanganu-Opatz IL, Butt SJB, Hippenmeyer S, De Marco García NV, Cardin JA,
    Voytek B, Muotri AR. 2021. The logic of developing neocortical circuits in health
    and disease. The Journal of Neuroscience. 41(5), 813–822.
  mla: Hanganu-Opatz, Ileana L., et al. “The Logic of Developing Neocortical Circuits
    in Health and Disease.” <i>The Journal of Neuroscience</i>, vol. 41, no. 5, Society
    for Neuroscience, 2021, pp. 813–22, doi:<a href="https://doi.org/10.1523/jneurosci.1655-20.2020">10.1523/jneurosci.1655-20.2020</a>.
  short: I.L. Hanganu-Opatz, S.J.B. Butt, S. Hippenmeyer, N.V. De Marco García, J.A.
    Cardin, B. Voytek, A.R. Muotri, The Journal of Neuroscience 41 (2021) 813–822.
date_created: 2021-02-03T12:23:51Z
date_published: 2021-02-03T00:00:00Z
date_updated: 2025-04-15T08:23:06Z
day: '03'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1523/jneurosci.1655-20.2020
ec_funded: 1
external_id:
  isi:
  - '000616763400002'
  pmid:
  - '33431633'
file:
- access_level: open_access
  checksum: 578fd7ed1a0aef74bce61bea2d987b33
  content_type: application/pdf
  creator: dernst
  date_created: 2022-05-27T06:59:55Z
  date_updated: 2022-05-27T06:59:55Z
  file_id: '11414'
  file_name: 2021_JourNeuroscience_Hanganu.pdf
  file_size: 1031150
  relation: main_file
  success: 1
file_date_updated: 2022-05-27T06:59:55Z
has_accepted_license: '1'
intvolume: '        41'
isi: 1
issue: '5'
keyword:
- General Neuroscience
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 813-822
pmid: 1
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '725780'
  name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
- _id: 059F6AB4-7A3F-11EA-A408-12923DDC885E
  grant_number: F7805
  name: Stem Cell Modulation in Neural Development and Regeneration/ P05-Molecular
    Mechanisms of Neural Stem Cell Lineage Progression
publication: The Journal of Neuroscience
publication_identifier:
  eissn:
  - 1529-2401
  issn:
  - 0270-6474
publication_status: published
publisher: Society for Neuroscience
quality_controlled: '1'
scopus_import: '1'
status: public
title: The logic of developing neocortical circuits in health and disease
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 41
year: '2021'
...
---
_id: '10281'
abstract:
- lang: eng
  text: Mutations affecting mTOR or RAS signaling underlie defined syndromes (the
    so-called mTORopathies and RASopathies) with high risk for Autism Spectrum Disorder
    (ASD). These syndromes show a broad variety of somatic phenotypes including cancers,
    skin abnormalities, heart disease and facial dysmorphisms. Less well studied are
    the neuropsychiatric symptoms such as ASD. Here, we assess the relevance of these
    signalopathies in ASD reviewing genetic, human cell model, rodent studies and
    clinical trials. We conclude that signalopathies have an increased liability for
    ASD and that, in particular, ASD individuals with dysmorphic features and intellectual
    disability (ID) have a higher chance for disruptive mutations in RAS- and mTOR-related
    genes. Studies on rodent and human cell models confirm aberrant neuronal development
    as the underlying pathology. Human studies further suggest that multiple hits
    are necessary to induce the respective phenotypes. Recent clinical trials do only
    report improvements for comorbid conditions such as epilepsy or cancer but not
    for behavioral aspects. Animal models show that treatment during early development
    can rescue behavioral phenotypes. Taken together, we suggest investigating the
    differential roles of mTOR and RAS signaling in both human and rodent models,
    and to test drug treatment both during and after neuronal development in the available
    model systems
acknowledgement: 'This review was funded by the IMI2 Initiative under the grant AIMS-2-TRIALS
  No 777394, by the Hessian Ministry for Science and Arts; State of Hesse Ministry
  for Science and Arts: LOEWE-Grant to the CePTER-Consortium (www.uni-frankfurt.de/67689811);
  Research (BMBF) under the grant RAISE-genic No 779282 all to AGC. This work was
  also supported by the European Union’s Horizon 2020 research and innovation program
  (ERC) grant 715508 (REVERSEAUTISM) and by the Austrian Science Fund (FWF) (DK W1232-B24)
  both to G.N. and both BMBF GeNeRARe 01GM1519A and CRC 1080, project B10, of the
  German Research Foundation (DFG) to M.J.S, respectively. We want to thank R. Waltes
  for her support in preparing this manuscript.'
alternative_title:
- Special Issue "From Genes to Therapy in Autism Spectrum Disorder"
article_number: '1746'
article_processing_charge: No
article_type: original
author:
- first_name: Verica
  full_name: Vasic, Verica
  last_name: Vasic
- first_name: Mattson S.O.
  full_name: Jones, Mattson S.O.
  last_name: Jones
- first_name: Denise
  full_name: Haslinger, Denise
  id: 76922BDA-3D3B-11EA-90BD-A44F3DDC885E
  last_name: Haslinger
- first_name: Lisa
  full_name: Knaus, Lisa
  id: 3B2ABCF4-F248-11E8-B48F-1D18A9856A87
  last_name: Knaus
- first_name: Michael J.
  full_name: Schmeisser, Michael J.
  last_name: Schmeisser
- first_name: Gaia
  full_name: Novarino, Gaia
  id: 3E57A680-F248-11E8-B48F-1D18A9856A87
  last_name: Novarino
  orcid: 0000-0002-7673-7178
- first_name: Andreas G.
  full_name: Chiocchetti, Andreas G.
  last_name: Chiocchetti
citation:
  ama: 'Vasic V, Jones MSO, Haslinger D, et al. Translating the role of mtor-and ras-associated
    signalopathies in autism spectrum disorder: Models, mechanisms and treatment.
    <i>Genes</i>. 2021;12(11). doi:<a href="https://doi.org/10.3390/genes12111746">10.3390/genes12111746</a>'
  apa: 'Vasic, V., Jones, M. S. O., Haslinger, D., Knaus, L., Schmeisser, M. J., Novarino,
    G., &#38; Chiocchetti, A. G. (2021). Translating the role of mtor-and ras-associated
    signalopathies in autism spectrum disorder: Models, mechanisms and treatment.
    <i>Genes</i>. MDPI. <a href="https://doi.org/10.3390/genes12111746">https://doi.org/10.3390/genes12111746</a>'
  chicago: 'Vasic, Verica, Mattson S.O. Jones, Denise Haslinger, Lisa Knaus, Michael
    J. Schmeisser, Gaia Novarino, and Andreas G. Chiocchetti. “Translating the Role
    of Mtor-and Ras-Associated Signalopathies in Autism Spectrum Disorder: Models,
    Mechanisms and Treatment.” <i>Genes</i>. MDPI, 2021. <a href="https://doi.org/10.3390/genes12111746">https://doi.org/10.3390/genes12111746</a>.'
  ieee: 'V. Vasic <i>et al.</i>, “Translating the role of mtor-and ras-associated
    signalopathies in autism spectrum disorder: Models, mechanisms and treatment,”
    <i>Genes</i>, vol. 12, no. 11. MDPI, 2021.'
  ista: 'Vasic V, Jones MSO, Haslinger D, Knaus L, Schmeisser MJ, Novarino G, Chiocchetti
    AG. 2021. Translating the role of mtor-and ras-associated signalopathies in autism
    spectrum disorder: Models, mechanisms and treatment. Genes. 12(11), 1746.'
  mla: 'Vasic, Verica, et al. “Translating the Role of Mtor-and Ras-Associated Signalopathies
    in Autism Spectrum Disorder: Models, Mechanisms and Treatment.” <i>Genes</i>,
    vol. 12, no. 11, 1746, MDPI, 2021, doi:<a href="https://doi.org/10.3390/genes12111746">10.3390/genes12111746</a>.'
  short: V. Vasic, M.S.O. Jones, D. Haslinger, L. Knaus, M.J. Schmeisser, G. Novarino,
    A.G. Chiocchetti, Genes 12 (2021).
date_created: 2021-11-14T23:01:24Z
date_published: 2021-10-30T00:00:00Z
date_updated: 2025-04-15T07:29:28Z
day: '30'
ddc:
- '570'
department:
- _id: GaNo
doi: 10.3390/genes12111746
ec_funded: 1
external_id:
  isi:
  - '000834044200002'
file:
- access_level: open_access
  checksum: 256cb832a9c3051c7dc741f6423b8cbd
  content_type: application/pdf
  creator: dernst
  date_created: 2022-05-16T07:02:27Z
  date_updated: 2022-05-16T07:02:27Z
  file_id: '11380'
  file_name: 2021_Genes_Vasic.pdf
  file_size: 1335308
  relation: main_file
  success: 1
file_date_updated: 2022-05-16T07:02:27Z
has_accepted_license: '1'
intvolume: '        12'
isi: 1
issue: '11'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25444568-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '715508'
  name: Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo
    and in vitro Models
- _id: 2548AE96-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: W1232
  name: Molecular Drug Targets
publication: Genes
publication_identifier:
  eissn:
  - 2073-4425
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Translating the role of mtor-and ras-associated signalopathies in autism spectrum
  disorder: Models, mechanisms and treatment'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 12
year: '2021'
...
---
_id: '9928'
abstract:
- lang: eng
  text: There are two elementary superconducting qubit types that derive directly
    from the quantum harmonic oscillator. In one, the inductor is replaced by a nonlinear
    Josephson junction to realize the widely used charge qubits with a compact phase
    variable and a discrete charge wave function. In the other, the junction is added
    in parallel, which gives rise to an extended phase variable, continuous wave functions,
    and a rich energy-level structure due to the loop topology. While the corresponding
    rf superconducting quantum interference device Hamiltonian was introduced as a
    quadratic quasi-one-dimensional potential approximation to describe the fluxonium
    qubit implemented with long Josephson-junction arrays, in this work we implement
    it directly using a linear superinductor formed by a single uninterrupted aluminum
    wire. We present a large variety of qubits, all stemming from the same circuit
    but with drastically different characteristic energy scales. This includes flux
    and fluxonium qubits but also the recently introduced quasicharge qubit with strongly
    enhanced zero-point phase fluctuations and a heavily suppressed flux dispersion.
    The use of a geometric inductor results in high reproducibility of the inductive
    energy as guaranteed by top-down lithography—a key ingredient for intrinsically
    protected superconducting qubits.
acknowledged_ssus:
- _id: NanoFab
- _id: M-Shop
acknowledgement: We thank W. Hughes for analytic and numerical modeling during the
  early stages of this work, J. Koch for discussions and support with the scqubits
  package, R. Sett, P. Zielinski, and L. Drmic for software development, and G. Katsaros
  for equipment support, as well as the MIBA workshop and the Institute of Science
  and Technology Austria nanofabrication facility. We thank I. Pop, S. Deleglise,
  and E. Flurin for discussions. This work was supported by a NOMIS Foundation research
  grant, the Austrian Science Fund (FWF) through BeyondC (F7105), and IST Austria.
  M.P. is the recipient of a Pöttinger scholarship at IST Austria. E.R. is the recipient
  of a DOC fellowship of the Austrian Academy of Sciences at IST Austria.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Matilda
  full_name: Peruzzo, Matilda
  id: 3F920B30-F248-11E8-B48F-1D18A9856A87
  last_name: Peruzzo
  orcid: 0000-0002-3415-4628
- first_name: Farid
  full_name: Hassani, Farid
  id: 2AED110C-F248-11E8-B48F-1D18A9856A87
  last_name: Hassani
  orcid: 0000-0001-6937-5773
- first_name: Gregory
  full_name: Szep, Gregory
  last_name: Szep
- first_name: Andrea
  full_name: Trioni, Andrea
  id: 42F71B44-F248-11E8-B48F-1D18A9856A87
  last_name: Trioni
- first_name: Elena
  full_name: Redchenko, Elena
  id: 2C21D6E8-F248-11E8-B48F-1D18A9856A87
  last_name: Redchenko
- first_name: Martin
  full_name: Zemlicka, Martin
  id: 2DCF8DE6-F248-11E8-B48F-1D18A9856A87
  last_name: Zemlicka
  orcid: 0009-0005-0878-3032
- first_name: Johannes M
  full_name: Fink, Johannes M
  id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
  last_name: Fink
  orcid: 0000-0001-8112-028X
citation:
  ama: 'Peruzzo M, Hassani F, Szep G, et al. Geometric superinductance qubits: Controlling
    phase delocalization across a single Josephson junction. <i>PRX Quantum</i>. 2021;2(4):040341.
    doi:<a href="https://doi.org/10.1103/PRXQuantum.2.040341">10.1103/PRXQuantum.2.040341</a>'
  apa: 'Peruzzo, M., Hassani, F., Szep, G., Trioni, A., Redchenko, E., Zemlicka, M.,
    &#38; Fink, J. M. (2021). Geometric superinductance qubits: Controlling phase
    delocalization across a single Josephson junction. <i>PRX Quantum</i>. American
    Physical Society. <a href="https://doi.org/10.1103/PRXQuantum.2.040341">https://doi.org/10.1103/PRXQuantum.2.040341</a>'
  chicago: 'Peruzzo, Matilda, Farid Hassani, Gregory Szep, Andrea Trioni, Elena Redchenko,
    Martin Zemlicka, and Johannes M Fink. “Geometric Superinductance Qubits: Controlling
    Phase Delocalization across a Single Josephson Junction.” <i>PRX Quantum</i>.
    American Physical Society, 2021. <a href="https://doi.org/10.1103/PRXQuantum.2.040341">https://doi.org/10.1103/PRXQuantum.2.040341</a>.'
  ieee: 'M. Peruzzo <i>et al.</i>, “Geometric superinductance qubits: Controlling
    phase delocalization across a single Josephson junction,” <i>PRX Quantum</i>,
    vol. 2, no. 4. American Physical Society, p. 040341, 2021.'
  ista: 'Peruzzo M, Hassani F, Szep G, Trioni A, Redchenko E, Zemlicka M, Fink JM.
    2021. Geometric superinductance qubits: Controlling phase delocalization across
    a single Josephson junction. PRX Quantum. 2(4), 040341.'
  mla: 'Peruzzo, Matilda, et al. “Geometric Superinductance Qubits: Controlling Phase
    Delocalization across a Single Josephson Junction.” <i>PRX Quantum</i>, vol. 2,
    no. 4, American Physical Society, 2021, p. 040341, doi:<a href="https://doi.org/10.1103/PRXQuantum.2.040341">10.1103/PRXQuantum.2.040341</a>.'
  short: M. Peruzzo, F. Hassani, G. Szep, A. Trioni, E. Redchenko, M. Zemlicka, J.M.
    Fink, PRX Quantum 2 (2021) 040341.
corr_author: '1'
date_created: 2021-08-17T08:14:18Z
date_published: 2021-11-24T00:00:00Z
date_updated: 2026-04-15T06:41:46Z
day: '24'
ddc:
- '530'
department:
- _id: JoFi
- _id: NanoFab
- _id: M-Shop
doi: 10.1103/PRXQuantum.2.040341
ec_funded: 1
external_id:
  arxiv:
  - '2106.05882'
  isi:
  - '000723015100001'
file:
- access_level: open_access
  checksum: 36eb41ea43d8ca22b0efab12419e4eb2
  content_type: application/pdf
  creator: cchlebak
  date_created: 2022-01-18T11:29:33Z
  date_updated: 2022-01-18T11:29:33Z
  file_id: '10641'
  file_name: 2021_PRXQuantum_Peruzzo.pdf
  file_size: 4247422
  relation: main_file
  success: 1
file_date_updated: 2022-01-18T11:29:33Z
has_accepted_license: '1'
intvolume: '         2'
isi: 1
issue: '4'
keyword:
- quantum physics
- mesoscale and nanoscale physics
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '040341'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
- _id: 2622978C-B435-11E9-9278-68D0E5697425
  name: Hybrid Semiconductor - Superconductor Quantum Devices
- _id: bdb108fd-d553-11ed-ba76-83dc74a9864f
  grant_number: F07105
  name: QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration
    of Superconducting Quantum Circuits
publication: PRX Quantum
publication_identifier:
  eissn:
  - 2691-3399
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
  record:
  - id: '13057'
    relation: research_data
    status: public
  - id: '9920'
    relation: dissertation_contains
    status: public
  - id: '17133'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: 'Geometric superinductance qubits: Controlling phase delocalization across
  a single Josephson junction'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2021'
...
---
_id: '13057'
abstract:
- lang: eng
  text: 'This dataset comprises all data shown in the figures of the submitted article
    "Geometric superinductance qubits: Controlling phase delocalization across a single
    Josephson junction". Additional raw data are available from the corresponding
    author on reasonable request.'
article_processing_charge: No
author:
- first_name: Matilda
  full_name: Peruzzo, Matilda
  id: 3F920B30-F248-11E8-B48F-1D18A9856A87
  last_name: Peruzzo
  orcid: 0000-0002-3415-4628
- first_name: Farid
  full_name: Hassani, Farid
  id: 2AED110C-F248-11E8-B48F-1D18A9856A87
  last_name: Hassani
  orcid: 0000-0001-6937-5773
- first_name: Grisha
  full_name: Szep, Grisha
  last_name: Szep
- first_name: Andrea
  full_name: Trioni, Andrea
  id: 42F71B44-F248-11E8-B48F-1D18A9856A87
  last_name: Trioni
- first_name: Elena
  full_name: Redchenko, Elena
  id: 2C21D6E8-F248-11E8-B48F-1D18A9856A87
  last_name: Redchenko
- first_name: Martin
  full_name: Zemlicka, Martin
  id: 2DCF8DE6-F248-11E8-B48F-1D18A9856A87
  last_name: Zemlicka
  orcid: 0009-0005-0878-3032
- first_name: Johannes M
  full_name: Fink, Johannes M
  id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
  last_name: Fink
  orcid: 0000-0001-8112-028X
citation:
  ama: 'Peruzzo M, Hassani F, Szep G, et al. Geometric superinductance qubits: Controlling
    phase delocalization across a single Josephson junction. 2021. doi:<a href="https://doi.org/10.5281/ZENODO.5592103">10.5281/ZENODO.5592103</a>'
  apa: 'Peruzzo, M., Hassani, F., Szep, G., Trioni, A., Redchenko, E., Zemlicka, M.,
    &#38; Fink, J. M. (2021). Geometric superinductance qubits: Controlling phase
    delocalization across a single Josephson junction. Zenodo. <a href="https://doi.org/10.5281/ZENODO.5592103">https://doi.org/10.5281/ZENODO.5592103</a>'
  chicago: 'Peruzzo, Matilda, Farid Hassani, Grisha Szep, Andrea Trioni, Elena Redchenko,
    Martin Zemlicka, and Johannes M Fink. “Geometric Superinductance Qubits: Controlling
    Phase Delocalization across a Single Josephson Junction.” Zenodo, 2021. <a href="https://doi.org/10.5281/ZENODO.5592103">https://doi.org/10.5281/ZENODO.5592103</a>.'
  ieee: 'M. Peruzzo <i>et al.</i>, “Geometric superinductance qubits: Controlling
    phase delocalization across a single Josephson junction.” Zenodo, 2021.'
  ista: 'Peruzzo M, Hassani F, Szep G, Trioni A, Redchenko E, Zemlicka M, Fink JM.
    2021. Geometric superinductance qubits: Controlling phase delocalization across
    a single Josephson junction, Zenodo, <a href="https://doi.org/10.5281/ZENODO.5592103">10.5281/ZENODO.5592103</a>.'
  mla: 'Peruzzo, Matilda, et al. <i>Geometric Superinductance Qubits: Controlling
    Phase Delocalization across a Single Josephson Junction</i>. Zenodo, 2021, doi:<a
    href="https://doi.org/10.5281/ZENODO.5592103">10.5281/ZENODO.5592103</a>.'
  short: M. Peruzzo, F. Hassani, G. Szep, A. Trioni, E. Redchenko, M. Zemlicka, J.M.
    Fink, (2021).
corr_author: '1'
date_created: 2023-05-23T13:42:27Z
date_published: 2021-10-22T00:00:00Z
date_updated: 2026-04-15T06:41:45Z
day: '22'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.5281/ZENODO.5592103
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5281/zenodo.5592104
month: '10'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
  record:
  - id: '9928'
    relation: used_in_publication
    status: public
status: public
title: 'Geometric superinductance qubits: Controlling phase delocalization across
  a single Josephson junction'
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
OA_place: publisher
_id: '9920'
abstract:
- lang: eng
  text: 'This work is concerned with two fascinating circuit quantum electrodynamics
    components, the Josephson junction and the geometric superinductor, and the interesting
    experiments that can be done by combining the two. The Josephson junction has
    revolutionized the field of superconducting circuits as a non-linear dissipation-less
    circuit element and is used in almost all superconducting qubit implementations
    since the 90s. On the other hand, the superinductor is a relatively new circuit
    element introduced as a key component of the fluxonium qubit in 2009. This is
    an inductor with characteristic impedance larger than the resistance quantum and
    self-resonance frequency in the GHz regime. The combination of these two elements
    can occur in two fundamental ways: in parallel and in series. When connected in
    parallel the two create the fluxonium qubit, a loop with large inductance and
    a rich energy spectrum reliant on quantum tunneling. On the other hand placing
    the two elements in series aids with the measurement of the IV curve of a single
    Josephson junction in a high impedance environment. In this limit theory predicts
    that the junction will behave as its dual element: the phase-slip junction. While
    the Josephson junction acts as a non-linear inductor the phase-slip junction has
    the behavior of a non-linear capacitance and can be used to measure new Josephson
    junction phenomena, namely Coulomb blockade of Cooper pairs and phase-locked Bloch
    oscillations. The latter experiment allows for a direct link between frequency
    and current which is an elusive connection in quantum metrology. This work introduces
    the geometric superinductor, a superconducting circuit element where the high
    inductance is due to the geometry rather than the material properties of the superconductor,
    realized from a highly miniaturized superconducting planar coil. These structures
    will be described and characterized as resonators and qubit inductors and progress
    towards the measurement of phase-locked Bloch oscillations will be presented.'
acknowledged_ssus:
- _id: NanoFab
- _id: M-Shop
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Matilda
  full_name: Peruzzo, Matilda
  id: 3F920B30-F248-11E8-B48F-1D18A9856A87
  last_name: Peruzzo
  orcid: 0000-0002-3415-4628
citation:
  ama: Peruzzo M. Geometric superinductors and their applications in circuit quantum
    electrodynamics. 2021. doi:<a href="https://doi.org/10.15479/at:ista:9920">10.15479/at:ista:9920</a>
  apa: Peruzzo, M. (2021). <i>Geometric superinductors and their applications in circuit
    quantum electrodynamics</i>. Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/at:ista:9920">https://doi.org/10.15479/at:ista:9920</a>
  chicago: Peruzzo, Matilda. “Geometric Superinductors and Their Applications in Circuit
    Quantum Electrodynamics.” Institute of Science and Technology Austria, 2021. <a
    href="https://doi.org/10.15479/at:ista:9920">https://doi.org/10.15479/at:ista:9920</a>.
  ieee: M. Peruzzo, “Geometric superinductors and their applications in circuit quantum
    electrodynamics,” Institute of Science and Technology Austria, 2021.
  ista: Peruzzo M. 2021. Geometric superinductors and their applications in circuit
    quantum electrodynamics. Institute of Science and Technology Austria.
  mla: Peruzzo, Matilda. <i>Geometric Superinductors and Their Applications in Circuit
    Quantum Electrodynamics</i>. Institute of Science and Technology Austria, 2021,
    doi:<a href="https://doi.org/10.15479/at:ista:9920">10.15479/at:ista:9920</a>.
  short: M. Peruzzo, Geometric Superinductors and Their Applications in Circuit Quantum
    Electrodynamics, Institute of Science and Technology Austria, 2021.
corr_author: '1'
date_created: 2021-08-16T09:44:09Z
date_published: 2021-08-19T00:00:00Z
date_updated: 2026-04-15T06:43:02Z
day: '19'
ddc:
- '539'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JoFi
doi: 10.15479/at:ista:9920
file:
- access_level: closed
  checksum: 3cd1986efde5121d7581f6fcf9090da8
  content_type: application/x-zip-compressed
  creator: mperuzzo
  date_created: 2021-08-16T09:33:21Z
  date_updated: 2021-09-06T08:39:47Z
  file_id: '9924'
  file_name: GeometricSuperinductorsForCQED.zip
  file_size: 151387283
  relation: source_file
- access_level: open_access
  checksum: 50928c621cdf0775d7a5906b9dc8602c
  content_type: application/pdf
  creator: mperuzzo
  date_created: 2021-08-18T14:20:06Z
  date_updated: 2021-09-06T08:39:47Z
  file_id: '9939'
  file_name: GeometricSuperinductorsAndTheirApplicationsIncQED-1b.pdf
  file_size: 17596344
  relation: main_file
- access_level: closed
  checksum: 37f486aa1b622fe44af00d627ec13f6c
  content_type: application/pdf
  creator: mperuzzo
  date_created: 2021-08-18T14:20:09Z
  date_updated: 2021-09-06T08:39:47Z
  description: Extra copy of the thesis as PDF/A-2b
  file_id: '9940'
  file_name: GeometricSuperinductorsAndTheirApplicationsIncQED-2b.pdf
  file_size: 17592425
  relation: other
file_date_updated: 2021-09-06T08:39:47Z
has_accepted_license: '1'
keyword:
- quantum computing
- superinductor
- quantum metrology
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '149'
publication_identifier:
  isbn:
  - 978-3-99078-013-8
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '9928'
    relation: part_of_dissertation
    status: public
  - id: '8755'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Johannes M
  full_name: Fink, Johannes M
  id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
  last_name: Fink
  orcid: 0000-0001-8112-028X
title: Geometric superinductors and their applications in circuit quantum electrodynamics
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2021'
...
---
_id: '9819'
abstract:
- lang: eng
  text: Photorealistic editing of head portraits is a challenging task as humans are
    very sensitive to inconsistencies in faces. We present an approach for high-quality
    intuitive editing of the camera viewpoint and scene illumination (parameterised
    with an environment map) in a portrait image. This requires our method to capture
    and control the full reflectance field of the person in the image. Most editing
    approaches rely on supervised learning using training data captured with setups
    such as light and camera stages. Such datasets are expensive to acquire, not readily
    available and do not capture all the rich variations of in-the-wild portrait images.
    In addition, most supervised approaches only focus on relighting, and do not allow
    camera viewpoint editing. Thus, they only capture and control a subset of the
    reflectance field. Recently, portrait editing has been demonstrated by operating
    in the generative model space of StyleGAN. While such approaches do not require
    direct supervision, there is a significant loss of quality when compared to the
    supervised approaches. In this paper, we present a method which learns from limited
    supervised training data. The training images only include people in a fixed neutral
    expression with eyes closed, without much hair or background variations. Each
    person is captured under 150 one-light-at-a-time conditions and under 8 camera
    poses. Instead of training directly in the image space, we design a supervised
    problem which learns transformations in the latent space of StyleGAN. This combines
    the best of supervised learning and generative adversarial modeling. We show that
    the StyleGAN prior allows for generalisation to different expressions, hairstyles
    and backgrounds. This produces high-quality photorealistic results for in-the-wild
    images and significantly outperforms existing methods. Our approach can edit the
    illumination and pose simultaneously, and runs at interactive rates.
acknowledgement: This work was supported by the ERC Consolidator Grant 4DReply (770784).
  We also acknowledge support from Technicolor and InterDigital. We thank Tiancheng
  Sun for kindly helping us with the comparisons with Sun et al. [2019].
article_number: '44'
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: B. R.
  full_name: Mallikarjun, B. R.
  last_name: Mallikarjun
- first_name: Ayush
  full_name: Tewari, Ayush
  last_name: Tewari
- first_name: Abdallah
  full_name: Dib, Abdallah
  last_name: Dib
- first_name: Tim
  full_name: Weyrich, Tim
  last_name: Weyrich
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
- first_name: Hans Peter
  full_name: Seidel, Hans Peter
  last_name: Seidel
- first_name: Hanspeter
  full_name: Pfister, Hanspeter
  last_name: Pfister
- first_name: Wojciech
  full_name: Matusik, Wojciech
  last_name: Matusik
- first_name: Louis
  full_name: Chevallier, Louis
  last_name: Chevallier
- first_name: Mohamed A.
  full_name: Elgharib, Mohamed A.
  last_name: Elgharib
- first_name: Christian
  full_name: Theobalt, Christian
  last_name: Theobalt
citation:
  ama: 'Mallikarjun BR, Tewari A, Dib A, et al. PhotoApp: Photorealistic appearance
    editing of head portraits. <i>ACM Transactions on Graphics</i>. 2021;40(4). doi:<a
    href="https://doi.org/10.1145/3450626.3459765">10.1145/3450626.3459765</a>'
  apa: 'Mallikarjun, B. R., Tewari, A., Dib, A., Weyrich, T., Bickel, B., Seidel,
    H. P., … Theobalt, C. (2021). PhotoApp: Photorealistic appearance editing of head
    portraits. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery.
    <a href="https://doi.org/10.1145/3450626.3459765">https://doi.org/10.1145/3450626.3459765</a>'
  chicago: 'Mallikarjun, B. R., Ayush Tewari, Abdallah Dib, Tim Weyrich, Bernd Bickel,
    Hans Peter Seidel, Hanspeter Pfister, et al. “PhotoApp: Photorealistic Appearance
    Editing of Head Portraits.” <i>ACM Transactions on Graphics</i>. Association for
    Computing Machinery, 2021. <a href="https://doi.org/10.1145/3450626.3459765">https://doi.org/10.1145/3450626.3459765</a>.'
  ieee: 'B. R. Mallikarjun <i>et al.</i>, “PhotoApp: Photorealistic appearance editing
    of head portraits,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association
    for Computing Machinery, 2021.'
  ista: 'Mallikarjun BR, Tewari A, Dib A, Weyrich T, Bickel B, Seidel HP, Pfister
    H, Matusik W, Chevallier L, Elgharib MA, Theobalt C. 2021. PhotoApp: Photorealistic
    appearance editing of head portraits. ACM Transactions on Graphics. 40(4), 44.'
  mla: 'Mallikarjun, B. R., et al. “PhotoApp: Photorealistic Appearance Editing of
    Head Portraits.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, 44, Association
    for Computing Machinery, 2021, doi:<a href="https://doi.org/10.1145/3450626.3459765">10.1145/3450626.3459765</a>.'
  short: B.R. Mallikarjun, A. Tewari, A. Dib, T. Weyrich, B. Bickel, H.P. Seidel,
    H. Pfister, W. Matusik, L. Chevallier, M.A. Elgharib, C. Theobalt, ACM Transactions
    on Graphics 40 (2021).
date_created: 2021-08-08T22:01:27Z
date_published: 2021-08-01T00:00:00Z
date_updated: 2026-04-16T08:19:58Z
day: '01'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1145/3450626.3459765
external_id:
  arxiv:
  - '2103.07658'
  isi:
  - '000674930900011'
file:
- access_level: open_access
  checksum: 51b61b7e5c175e2d7ed8fa3b35f7525a
  content_type: application/pdf
  creator: asandaue
  date_created: 2021-08-09T11:41:50Z
  date_updated: 2021-08-09T11:41:50Z
  file_id: '9834'
  file_name: 2021_ACMTransactionsOnGraphics_Mallikarjun.pdf
  file_size: 49840741
  relation: main_file
  success: 1
file_date_updated: 2021-08-09T11:41:50Z
has_accepted_license: '1'
intvolume: '        40'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: ACM Transactions on Graphics
publication_identifier:
  eissn:
  - 1557-7368
  issn:
  - 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'PhotoApp: Photorealistic appearance editing of head portraits'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 40
year: '2021'
...
---
_id: '9005'
abstract:
- lang: eng
  text: Studies on the experimental realization of two-dimensional anyons in terms
    of quasiparticles have been restricted, so far, to only anyons on the plane. It
    is known, however, that the geometry and topology of space can have significant
    effects on quantum statistics for particles moving on it. Here, we have undertaken
    the first step toward realizing the emerging fractional statistics for particles
    restricted to move on the sphere instead of on the plane. We show that such a
    model arises naturally in the context of quantum impurity problems. In particular,
    we demonstrate a setup in which the lowest-energy spectrum of two linear bosonic
    or fermionic molecules immersed in a quantum many-particle environment can coincide
    with the anyonic spectrum on the sphere. This paves the way toward the experimental
    realization of anyons on the sphere using molecular impurities. Furthermore, since
    a change in the alignment of the molecules corresponds to the exchange of the
    particles on the sphere, such a realization reveals a novel type of exclusion
    principle for molecular impurities, which could also be of use as a powerful technique
    to measure the statistics parameter. Finally, our approach opens up a simple numerical
    route to investigate the spectra of many anyons on the sphere. Accordingly, we
    present the spectrum of two anyons on the sphere in the presence of a Dirac monopole
    field.
acknowledgement: "We are grateful to A. Ghazaryan for valuable discussions and also
  thank the anonymous referees for comments. D.L. acknowledges financial support from
  the G¨oran Gustafsson Foundation (grant no. 1804) and LMU Munich. M.L. gratefully
  acknowledges financial support\r\nby the European Research Council (ERC) under the
  European Union’s Horizon 2020 research and innovation programme (grant agreements
  No 801770)."
article_number: '015301'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Morris
  full_name: Brooks, Morris
  id: B7ECF9FC-AA38-11E9-AC9A-0930E6697425
  last_name: Brooks
  orcid: 0000-0002-6249-0928
- first_name: Mikhail
  full_name: Lemeshko, Mikhail
  id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
  last_name: Lemeshko
  orcid: 0000-0002-6990-7802
- first_name: D.
  full_name: Lundholm, D.
  last_name: Lundholm
- first_name: Enderalp
  full_name: Yakaboylu, Enderalp
  id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
  last_name: Yakaboylu
  orcid: 0000-0001-5973-0874
citation:
  ama: Brooks M, Lemeshko M, Lundholm D, Yakaboylu E. Molecular impurities as a realization
    of anyons on the two-sphere. <i>Physical Review Letters</i>. 2021;126(1). doi:<a
    href="https://doi.org/10.1103/PhysRevLett.126.015301">10.1103/PhysRevLett.126.015301</a>
  apa: Brooks, M., Lemeshko, M., Lundholm, D., &#38; Yakaboylu, E. (2021). Molecular
    impurities as a realization of anyons on the two-sphere. <i>Physical Review Letters</i>.
    American Physical Society. <a href="https://doi.org/10.1103/PhysRevLett.126.015301">https://doi.org/10.1103/PhysRevLett.126.015301</a>
  chicago: Brooks, Morris, Mikhail Lemeshko, D. Lundholm, and Enderalp Yakaboylu.
    “Molecular Impurities as a Realization of Anyons on the Two-Sphere.” <i>Physical
    Review Letters</i>. American Physical Society, 2021. <a href="https://doi.org/10.1103/PhysRevLett.126.015301">https://doi.org/10.1103/PhysRevLett.126.015301</a>.
  ieee: M. Brooks, M. Lemeshko, D. Lundholm, and E. Yakaboylu, “Molecular impurities
    as a realization of anyons on the two-sphere,” <i>Physical Review Letters</i>,
    vol. 126, no. 1. American Physical Society, 2021.
  ista: Brooks M, Lemeshko M, Lundholm D, Yakaboylu E. 2021. Molecular impurities
    as a realization of anyons on the two-sphere. Physical Review Letters. 126(1),
    015301.
  mla: Brooks, Morris, et al. “Molecular Impurities as a Realization of Anyons on
    the Two-Sphere.” <i>Physical Review Letters</i>, vol. 126, no. 1, 015301, American
    Physical Society, 2021, doi:<a href="https://doi.org/10.1103/PhysRevLett.126.015301">10.1103/PhysRevLett.126.015301</a>.
  short: M. Brooks, M. Lemeshko, D. Lundholm, E. Yakaboylu, Physical Review Letters
    126 (2021).
date_created: 2021-01-17T23:01:10Z
date_published: 2021-01-08T00:00:00Z
date_updated: 2026-04-16T08:20:53Z
day: '08'
department:
- _id: MiLe
- _id: RoSe
doi: 10.1103/PhysRevLett.126.015301
ec_funded: 1
external_id:
  arxiv:
  - '2009.05948'
  isi:
  - '000606325000003'
  pmid:
  - '33480760'
intvolume: '       126'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2009.05948
month: '01'
oa: 1
oa_version: Preprint
pmid: 1
project:
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '801770'
  name: 'Angulon: physics and applications of a new quasiparticle'
publication: Physical Review Letters
publication_identifier:
  eissn:
  - 1079-7114
  issn:
  - 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
  link:
  - description: News on IST Homepage
    relation: press_release
    url: https://ist.ac.at/en/news/dancing-molecules-and-two-dimensional-particles/
  record:
  - id: '12390'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Molecular impurities as a realization of anyons on the two-sphere
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 126
year: '2021'
...
---
_id: '9470'
abstract:
- lang: eng
  text: A key step in understanding the genetic basis of different evolutionary outcomes
    (e.g., adaptation) is to determine the roles played by different mutation types
    (e.g., SNPs, translocations and inversions). To do this we must simultaneously
    consider different mutation types in an evolutionary framework. Here, we propose
    a research framework that directly utilizes the most important characteristics
    of mutations, their population genetic effects, to determine their relative evolutionary
    significance in a given scenario. We review known population genetic effects of
    different mutation types and show how these may be connected to different evolutionary
    outcomes. We provide examples of how to implement this framework and pinpoint
    areas where more data, theory and synthesis are needed. Linking experimental and
    theoretical approaches to examine different mutation types simultaneously is a
    critical step towards understanding their evolutionary significance.
acknowledgement: We thank the editor, two helpful reviewers, Roger Butlin, Kerstin
  Johannesson, Valentina Peona, Rike Stelkens, Julie Blommaert, Nick Barton, and João
  Alpedrinha for helpful comments that improved the manuscript. The authors acknowledge
  funding from the Swedish Research Council Formas (2017-01597 to AS), the Swedish
  Research Council Vetenskapsrådet (2016-05139 to AS, 2019-04452 to TS) and from the
  European Research Council (ERC) under the European Union’s Horizon 2020 research
  and innovation programme (grant agreement no. 757451 to TS). ELB was funded by a
  Carl Tryggers grant awarded to Tanja Slotte. Anja M. Westram was funded by the European
  Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie
  grant agreement No 797747. Inês Fragata was funded by a Junior Researcher contract
  from FCT (CEECIND/02616/2018).
article_processing_charge: No
author:
- first_name: Emma L.
  full_name: Berdan, Emma L.
  last_name: Berdan
- first_name: Alexandre
  full_name: Blanckaert, Alexandre
  last_name: Blanckaert
- first_name: Tanja
  full_name: Slotte, Tanja
  last_name: Slotte
- first_name: Alexander
  full_name: Suh, Alexander
  last_name: Suh
- first_name: Anja M
  full_name: Westram, Anja M
  id: 3C147470-F248-11E8-B48F-1D18A9856A87
  last_name: Westram
  orcid: 0000-0003-1050-4969
- first_name: Inês
  full_name: Fragata, Inês
  last_name: Fragata
citation:
  ama: 'Berdan EL, Blanckaert A, Slotte T, Suh A, Westram AM, Fragata I. Unboxing
    mutations: Connecting mutation types with evolutionary consequences. <i>Molecular
    Ecology</i>. 2021;30(12):2710-2723. doi:<a href="https://doi.org/10.1111/mec.15936">10.1111/mec.15936</a>'
  apa: 'Berdan, E. L., Blanckaert, A., Slotte, T., Suh, A., Westram, A. M., &#38;
    Fragata, I. (2021). Unboxing mutations: Connecting mutation types with evolutionary
    consequences. <i>Molecular Ecology</i>. Wiley. <a href="https://doi.org/10.1111/mec.15936">https://doi.org/10.1111/mec.15936</a>'
  chicago: 'Berdan, Emma L., Alexandre Blanckaert, Tanja Slotte, Alexander Suh, Anja
    M Westram, and Inês Fragata. “Unboxing Mutations: Connecting Mutation Types with
    Evolutionary Consequences.” <i>Molecular Ecology</i>. Wiley, 2021. <a href="https://doi.org/10.1111/mec.15936">https://doi.org/10.1111/mec.15936</a>.'
  ieee: 'E. L. Berdan, A. Blanckaert, T. Slotte, A. Suh, A. M. Westram, and I. Fragata,
    “Unboxing mutations: Connecting mutation types with evolutionary consequences,”
    <i>Molecular Ecology</i>, vol. 30, no. 12. Wiley, pp. 2710–2723, 2021.'
  ista: 'Berdan EL, Blanckaert A, Slotte T, Suh A, Westram AM, Fragata I. 2021. Unboxing
    mutations: Connecting mutation types with evolutionary consequences. Molecular
    Ecology. 30(12), 2710–2723.'
  mla: 'Berdan, Emma L., et al. “Unboxing Mutations: Connecting Mutation Types with
    Evolutionary Consequences.” <i>Molecular Ecology</i>, vol. 30, no. 12, Wiley,
    2021, pp. 2710–23, doi:<a href="https://doi.org/10.1111/mec.15936">10.1111/mec.15936</a>.'
  short: E.L. Berdan, A. Blanckaert, T. Slotte, A. Suh, A.M. Westram, I. Fragata,
    Molecular Ecology 30 (2021) 2710–2723.
date_created: 2021-06-06T22:01:31Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2026-04-16T08:19:26Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1111/mec.15936
ec_funded: 1
external_id:
  isi:
  - '000652056400001'
file:
- access_level: open_access
  checksum: e6f4731365bde2614b333040a08265d8
  content_type: application/pdf
  creator: kschuh
  date_created: 2021-06-11T15:34:53Z
  date_updated: 2021-06-11T15:34:53Z
  file_id: '9545'
  file_name: 2021_MolecularEcology_Berdan.pdf
  file_size: 1031978
  relation: main_file
  success: 1
file_date_updated: 2021-06-11T15:34:53Z
has_accepted_license: '1'
intvolume: '        30'
isi: 1
issue: '12'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 2710-2723
project:
- _id: 265B41B8-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '797747'
  name: Theoretical and empirical approaches to understanding Parallel Adaptation
publication: Molecular Ecology
publication_identifier:
  eissn:
  - 1365-294X
  issn:
  - 0962-1083
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Unboxing mutations: Connecting mutation types with evolutionary consequences'
tmp:
  image: /images/cc_by_nc.png
  legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
  short: CC BY-NC (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 30
year: '2021'
...
---
_id: '9820'
abstract:
- lang: eng
  text: Material appearance hinges on material reflectance properties but also surface
    geometry and illumination. The unlimited number of potential combinations between
    these factors makes understanding and predicting material appearance a very challenging
    task. In this work, we collect a large-scale dataset of perceptual ratings of
    appearance attributes with more than 215,680 responses for 42,120 distinct combinations
    of material, shape, and illumination. The goal of this dataset is twofold. First,
    we analyze for the first time the effects of illumination and geometry in material
    perception across such a large collection of varied appearances. We connect our
    findings to those of the literature, discussing how previous knowledge generalizes
    across very diverse materials, shapes, and illuminations. Second, we use the collected
    dataset to train a deep learning architecture for predicting perceptual attributes
    that correlate with human judgments. We demonstrate the consistent and robust
    behavior of our predictor in various challenging scenarios, which, for the first
    time, enables estimating perceived material attributes from general 2D images.
    Since our predictor relies on the final appearance in an image, it can compare
    appearance properties across different geometries and illumination conditions.
    Finally, we demonstrate several applications that use our predictor, including
    appearance reproduction using 3D printing, BRDF editing by integrating our predictor
    in a differentiable renderer, illumination design, or material recommendations
    for scene design.
acknowledgement: This project has received funding from the European Union’s Horizon
  2020 research and innovation programme under the Marie Skłodowska-Curie, grant agreement
  Nº 765911 (RealVision) and from the European Research Council (ERC), grant agreement
  Nº 804226 (PERDY).
article_number: '125'
article_processing_charge: No
article_type: original
author:
- first_name: Ana
  full_name: Serrano, Ana
  last_name: Serrano
- first_name: Bin
  full_name: Chen, Bin
  last_name: Chen
- first_name: Chao
  full_name: Wang, Chao
  last_name: Wang
- first_name: Michael
  full_name: Piovarci, Michael
  id: 62E473F4-5C99-11EA-A40E-AF823DDC885E
  last_name: Piovarci
  orcid: 0000-0002-5062-4474
- first_name: Hans Peter
  full_name: Seidel, Hans Peter
  last_name: Seidel
- first_name: Piotr
  full_name: Didyk, Piotr
  last_name: Didyk
- first_name: Karol
  full_name: Myszkowski, Karol
  last_name: Myszkowski
citation:
  ama: 'Serrano A, Chen B, Wang C, et al. The effect of shape and illumination on
    material perception: Model and applications. <i>ACM Transactions on Graphics</i>.
    2021;40(4). doi:<a href="https://doi.org/10.1145/3450626.3459813">10.1145/3450626.3459813</a>'
  apa: 'Serrano, A., Chen, B., Wang, C., Piovarci, M., Seidel, H. P., Didyk, P., &#38;
    Myszkowski, K. (2021). The effect of shape and illumination on material perception:
    Model and applications. <i>ACM Transactions on Graphics</i>. Association for Computing
    Machinery. <a href="https://doi.org/10.1145/3450626.3459813">https://doi.org/10.1145/3450626.3459813</a>'
  chicago: 'Serrano, Ana, Bin Chen, Chao Wang, Michael Piovarci, Hans Peter Seidel,
    Piotr Didyk, and Karol Myszkowski. “The Effect of Shape and Illumination on Material
    Perception: Model and Applications.” <i>ACM Transactions on Graphics</i>. Association
    for Computing Machinery, 2021. <a href="https://doi.org/10.1145/3450626.3459813">https://doi.org/10.1145/3450626.3459813</a>.'
  ieee: 'A. Serrano <i>et al.</i>, “The effect of shape and illumination on material
    perception: Model and applications,” <i>ACM Transactions on Graphics</i>, vol.
    40, no. 4. Association for Computing Machinery, 2021.'
  ista: 'Serrano A, Chen B, Wang C, Piovarci M, Seidel HP, Didyk P, Myszkowski K.
    2021. The effect of shape and illumination on material perception: Model and applications.
    ACM Transactions on Graphics. 40(4), 125.'
  mla: 'Serrano, Ana, et al. “The Effect of Shape and Illumination on Material Perception:
    Model and Applications.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4,
    125, Association for Computing Machinery, 2021, doi:<a href="https://doi.org/10.1145/3450626.3459813">10.1145/3450626.3459813</a>.'
  short: A. Serrano, B. Chen, C. Wang, M. Piovarci, H.P. Seidel, P. Didyk, K. Myszkowski,
    ACM Transactions on Graphics 40 (2021).
date_created: 2021-08-08T22:01:28Z
date_published: 2021-08-01T00:00:00Z
date_updated: 2026-04-16T08:20:28Z
day: '01'
department:
- _id: BeBi
doi: 10.1145/3450626.3459813
external_id:
  isi:
  - '000674930900090'
intvolume: '        40'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://zaguan.unizar.es/record/110704/files/texto_completo.pdf
month: '08'
oa: 1
oa_version: Submitted Version
publication: ACM Transactions on Graphics
publication_identifier:
  eissn:
  - 1557-7368
  issn:
  - 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The effect of shape and illumination on material perception: Model and applications'
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 40
year: '2021'
...
---
_id: '9818'
abstract:
- lang: eng
  text: Triangle mesh-based simulations are able to produce satisfying animations
    of knitted and woven cloth; however, they lack the rich geometric detail of yarn-level
    simulations. Naive texturing approaches do not consider yarn-level physics, while
    full yarn-level simulations may become prohibitively expensive for large garments.
    We propose a method to animate yarn-level cloth geometry on top of an underlying
    deforming mesh in a mechanics-aware fashion. Using triangle strains to interpolate
    precomputed yarn geometry, we are able to reproduce effects such as knit loops
    tightening under stretching. In combination with precomputed mesh animation or
    real-time mesh simulation, our method is able to animate yarn-level cloth in real-time
    at large scales.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "We wish to thank the anonymous reviewers and the members of the
  Visual Computing Group at IST Austria for their valuable feedback. We also thank
  Seddi Labs for providing the garment model with fold-over seams.\r\nThis research
  was supported by the Scientific Service Units (SSU) of IST Austria through resources
  provided by Scientific\r\nComputing. This project has received funding from the
  European Research Council (ERC) under the European Union’s Horizon 2020 research
  and innovation programme under grant agreement No. 638176. Rahul Narain is supported
  by a Pankaj Gupta Young Faculty Fellowship and a gift from Adobe Inc."
article_number: '168'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Georg
  full_name: Sperl, Georg
  id: 4DD40360-F248-11E8-B48F-1D18A9856A87
  last_name: Sperl
- first_name: Rahul
  full_name: Narain, Rahul
  last_name: Narain
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
citation:
  ama: Sperl G, Narain R, Wojtan C. Mechanics-aware deformation of yarn pattern geometry.
    <i>ACM Transactions on Graphics</i>. 2021;40(4). doi:<a href="https://doi.org/10.1145/3450626.3459816">10.1145/3450626.3459816</a>
  apa: Sperl, G., Narain, R., &#38; Wojtan, C. (2021). Mechanics-aware deformation
    of yarn pattern geometry. <i>ACM Transactions on Graphics</i>. Association for
    Computing Machinery. <a href="https://doi.org/10.1145/3450626.3459816">https://doi.org/10.1145/3450626.3459816</a>
  chicago: Sperl, Georg, Rahul Narain, and Chris Wojtan. “Mechanics-Aware Deformation
    of Yarn Pattern Geometry.” <i>ACM Transactions on Graphics</i>. Association for
    Computing Machinery, 2021. <a href="https://doi.org/10.1145/3450626.3459816">https://doi.org/10.1145/3450626.3459816</a>.
  ieee: G. Sperl, R. Narain, and C. Wojtan, “Mechanics-aware deformation of yarn pattern
    geometry,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4. Association for
    Computing Machinery, 2021.
  ista: Sperl G, Narain R, Wojtan C. 2021. Mechanics-aware deformation of yarn pattern
    geometry. ACM Transactions on Graphics. 40(4), 168.
  mla: Sperl, Georg, et al. “Mechanics-Aware Deformation of Yarn Pattern Geometry.”
    <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, 168, Association for Computing
    Machinery, 2021, doi:<a href="https://doi.org/10.1145/3450626.3459816">10.1145/3450626.3459816</a>.
  short: G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 40 (2021).
date_created: 2021-08-08T22:01:27Z
date_published: 2021-08-01T00:00:00Z
date_updated: 2026-04-16T08:21:26Z
day: '01'
department:
- _id: GradSch
- _id: ChWo
doi: 10.1145/3450626.3459816
ec_funded: 1
external_id:
  isi:
  - '000674930900132'
intvolume: '        40'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1145/3450626.3459816
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '638176'
  name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
    Scales'
publication: ACM Transactions on Graphics
publication_identifier:
  eissn:
  - 1557-7368
  issn:
  - 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
  link:
  - description: News on IST Webpage
    relation: press_release
    url: https://ist.ac.at/en/news/knitting-virtual-yarn/
  record:
  - id: '9327'
    relation: software
    status: public
  - id: '12358'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Mechanics-aware deformation of yarn pattern geometry
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 40
year: '2021'
...
---
_id: '9327'
abstract:
- lang: eng
  text: "This archive contains the missing sweater mesh animations and displacement
    models for the code of \"Mechanics-Aware Deformation of Yarn Pattern Geometry\"\r\n\r\nCode
    Repository: https://git.ist.ac.at/gsperl/MADYPG"
author:
- first_name: Georg
  full_name: Sperl, Georg
  id: 4DD40360-F248-11E8-B48F-1D18A9856A87
  last_name: Sperl
- first_name: Rahul
  full_name: Narain, Rahul
  last_name: Narain
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
citation:
  ama: Sperl G, Narain R, Wojtan C. Mechanics-Aware Deformation of Yarn Pattern Geometry
    (Additional Animation/Model Data). 2021. doi:<a href="https://doi.org/10.15479/AT:ISTA:9327">10.15479/AT:ISTA:9327</a>
  apa: Sperl, G., Narain, R., &#38; Wojtan, C. (2021). Mechanics-Aware Deformation
    of Yarn Pattern Geometry (Additional Animation/Model Data). IST Austria. <a href="https://doi.org/10.15479/AT:ISTA:9327">https://doi.org/10.15479/AT:ISTA:9327</a>
  chicago: Sperl, Georg, Rahul Narain, and Chris Wojtan. “Mechanics-Aware Deformation
    of Yarn Pattern Geometry (Additional Animation/Model Data).” IST Austria, 2021.
    <a href="https://doi.org/10.15479/AT:ISTA:9327">https://doi.org/10.15479/AT:ISTA:9327</a>.
  ieee: G. Sperl, R. Narain, and C. Wojtan, “Mechanics-Aware Deformation of Yarn Pattern
    Geometry (Additional Animation/Model Data).” IST Austria, 2021.
  ista: Sperl G, Narain R, Wojtan C. 2021. Mechanics-Aware Deformation of Yarn Pattern
    Geometry (Additional Animation/Model Data), IST Austria, <a href="https://doi.org/10.15479/AT:ISTA:9327">10.15479/AT:ISTA:9327</a>.
  mla: Sperl, Georg, et al. <i>Mechanics-Aware Deformation of Yarn Pattern Geometry
    (Additional Animation/Model Data)</i>. IST Austria, 2021, doi:<a href="https://doi.org/10.15479/AT:ISTA:9327">10.15479/AT:ISTA:9327</a>.
  short: G. Sperl, R. Narain, C. Wojtan, (2021).
date_created: 2021-04-16T14:26:19Z
date_published: 2021-05-01T00:00:00Z
date_updated: 2026-04-16T08:21:25Z
ddc:
- '005'
department:
- _id: GradSch
- _id: ChWo
doi: 10.15479/AT:ISTA:9327
file:
- access_level: open_access
  checksum: 0324cb519273371708743f3282e7c081
  content_type: application/zip
  creator: gsperl
  date_created: 2021-04-16T14:15:12Z
  date_updated: 2021-04-16T14:15:12Z
  file_id: '9328'
  file_name: MADYPG_extra_data.zip
  file_size: 802586232
  relation: main_file
  success: 1
- access_level: open_access
  checksum: 4c224551adf852b136ec21a4e13f0c1b
  content_type: application/gzip
  creator: pub-gitlab-bot
  date_created: 2021-04-26T09:33:44Z
  date_updated: 2021-04-26T09:33:44Z
  file_id: '9353'
  file_name: MADYPG.zip
  file_size: 64962865
  relation: main_file
file_date_updated: 2021-04-26T09:33:44Z
gitlab_commit_id: 6a77e7e22769230ae5f5edaa090fb4b828e57573
gitlab_url: https://git.ist.ac.at/gsperl/MADYPG
has_accepted_license: '1'
license: https://opensource.org/licenses/MIT
month: '05'
oa: 1
publisher: IST Austria
related_material:
  record:
  - id: '9818'
    relation: used_for_analysis_in
    status: public
status: public
title: Mechanics-Aware Deformation of Yarn Pattern Geometry (Additional Animation/Model
  Data)
tmp:
  legal_code_url: https://opensource.org/licenses/MIT
  name: The MIT License
  short: MIT
type: software
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '8793'
abstract:
- lang: eng
  text: We study optimal election sequences for repeatedly selecting a (very) small
    group of leaders among a set of participants (players) with publicly known unique
    ids. In every time slot, every player has to select exactly one player that it
    considers to be the current leader, oblivious to the selection of the other players,
    but with the overarching goal of maximizing a given parameterized global (“social”)
    payoff function in the limit. We consider a quite generic model, where the local
    payoff achieved by a given player depends, weighted by some arbitrary but fixed
    real parameter, on the number of different leaders chosen in a round, the number
    of players that choose the given player as the leader, and whether the chosen
    leader has changed w.r.t. the previous round or not. The social payoff can be
    the maximum, average or minimum local payoff of the players. Possible applications
    include quite diverse examples such as rotating coordinator-based distributed
    algorithms and long-haul formation flying of social birds. Depending on the weights
    and the particular social payoff, optimal sequences can be very different, from
    simple round-robin where all players chose the same leader alternatingly every
    time slot to very exotic patterns, where a small group of leaders (at most 2)
    is elected in every time slot. Moreover, we study the question if and when a single
    player would not benefit w.r.t. its local payoff when deviating from the given
    optimal sequence, i.e., when our optimal sequences are Nash equilibria in the
    restricted strategy space of oblivious strategies. As this is the case for many
    parameterizations of our model, our results reveal that no punishment is needed
    to make it rational for the players to optimize the social payoff.
acknowledgement: "We are grateful to Matthias Függer and Thomas Nowak for having raised
  our interest in the problem studied in this paper.\r\nThis work has been supported
  the Austrian Science Fund (FWF) projects S11405, S11407 (RiSE), and P28182 (ADynNet)."
article_processing_charge: No
article_type: original
author:
- first_name: Martin
  full_name: Zeiner, Martin
  last_name: Zeiner
- first_name: Ulrich
  full_name: Schmid, Ulrich
  last_name: Schmid
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
citation:
  ama: Zeiner M, Schmid U, Chatterjee K. Optimal strategies for selecting coordinators.
    <i>Discrete Applied Mathematics</i>. 2021;289(1):392-415. doi:<a href="https://doi.org/10.1016/j.dam.2020.10.022">10.1016/j.dam.2020.10.022</a>
  apa: Zeiner, M., Schmid, U., &#38; Chatterjee, K. (2021). Optimal strategies for
    selecting coordinators. <i>Discrete Applied Mathematics</i>. Elsevier. <a href="https://doi.org/10.1016/j.dam.2020.10.022">https://doi.org/10.1016/j.dam.2020.10.022</a>
  chicago: Zeiner, Martin, Ulrich Schmid, and Krishnendu Chatterjee. “Optimal Strategies
    for Selecting Coordinators.” <i>Discrete Applied Mathematics</i>. Elsevier, 2021.
    <a href="https://doi.org/10.1016/j.dam.2020.10.022">https://doi.org/10.1016/j.dam.2020.10.022</a>.
  ieee: M. Zeiner, U. Schmid, and K. Chatterjee, “Optimal strategies for selecting
    coordinators,” <i>Discrete Applied Mathematics</i>, vol. 289, no. 1. Elsevier,
    pp. 392–415, 2021.
  ista: Zeiner M, Schmid U, Chatterjee K. 2021. Optimal strategies for selecting coordinators.
    Discrete Applied Mathematics. 289(1), 392–415.
  mla: Zeiner, Martin, et al. “Optimal Strategies for Selecting Coordinators.” <i>Discrete
    Applied Mathematics</i>, vol. 289, no. 1, Elsevier, 2021, pp. 392–415, doi:<a
    href="https://doi.org/10.1016/j.dam.2020.10.022">10.1016/j.dam.2020.10.022</a>.
  short: M. Zeiner, U. Schmid, K. Chatterjee, Discrete Applied Mathematics 289 (2021)
    392–415.
corr_author: '1'
date_created: 2020-11-22T23:01:26Z
date_published: 2021-01-31T00:00:00Z
date_updated: 2026-04-16T09:15:13Z
day: '31'
ddc:
- '510'
department:
- _id: KrCh
doi: 10.1016/j.dam.2020.10.022
external_id:
  isi:
  - '000596823800035'
file:
- access_level: open_access
  checksum: f1039ff5a2d6ca116720efdb84ee9d5e
  content_type: application/pdf
  creator: dernst
  date_created: 2021-02-04T11:28:42Z
  date_updated: 2021-02-04T11:28:42Z
  file_id: '9089'
  file_name: 2021_DiscreteApplMath_Zeiner.pdf
  file_size: 652739
  relation: main_file
  success: 1
file_date_updated: 2021-02-04T11:28:42Z
has_accepted_license: '1'
intvolume: '       289'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 392-415
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11402-N23
  name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11407
  name: Game Theory
publication: Discrete Applied Mathematics
publication_identifier:
  eissn:
  - 1872-6771
  issn:
  - 0166-218X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal strategies for selecting coordinators
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 289
year: '2021'
...
---
_id: '8317'
abstract:
- lang: eng
  text: When can a polyomino piece of paper be folded into a unit cube? Prior work
    studied tree-like polyominoes, but polyominoes with holes remain an intriguing
    open problem. We present sufficient conditions for a polyomino with one or several
    holes to fold into a cube, and conditions under which cube folding is impossible.
    In particular, we show that all but five special “basic” holes guarantee foldability.
acknowledgement: This research was performed in part at the 33rd Bellairs Winter Workshop
  on Computational Geometry. We thank all other participants for a fruitful atmosphere.
  H. Akitaya was supported by NSF CCF-1422311 & 1423615. Z. Masárová was partially
  funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.
article_number: '101700'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Oswin
  full_name: Aichholzer, Oswin
  last_name: Aichholzer
- first_name: Hugo A.
  full_name: Akitaya, Hugo A.
  last_name: Akitaya
- first_name: Kenneth C.
  full_name: Cheung, Kenneth C.
  last_name: Cheung
- first_name: Erik D.
  full_name: Demaine, Erik D.
  last_name: Demaine
- first_name: Martin L.
  full_name: Demaine, Martin L.
  last_name: Demaine
- first_name: Sándor P.
  full_name: Fekete, Sándor P.
  last_name: Fekete
- first_name: Linda
  full_name: Kleist, Linda
  last_name: Kleist
- first_name: Irina
  full_name: Kostitsyna, Irina
  last_name: Kostitsyna
- first_name: Maarten
  full_name: Löffler, Maarten
  last_name: Löffler
- first_name: Zuzana
  full_name: Masárová, Zuzana
  id: 45CFE238-F248-11E8-B48F-1D18A9856A87
  last_name: Masárová
  orcid: 0000-0002-6660-1322
- first_name: Klara
  full_name: Mundilova, Klara
  last_name: Mundilova
- first_name: Christiane
  full_name: Schmidt, Christiane
  last_name: Schmidt
citation:
  ama: 'Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes
    into a cube. <i>Computational Geometry: Theory and Applications</i>. 2021;93.
    doi:<a href="https://doi.org/10.1016/j.comgeo.2020.101700">10.1016/j.comgeo.2020.101700</a>'
  apa: 'Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M.
    L., Fekete, S. P., … Schmidt, C. (2021). Folding polyominoes with holes into a
    cube. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href="https://doi.org/10.1016/j.comgeo.2020.101700">https://doi.org/10.1016/j.comgeo.2020.101700</a>'
  chicago: 'Aichholzer, Oswin, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine,
    Martin L. Demaine, Sándor P. Fekete, Linda Kleist, et al. “Folding Polyominoes
    with Holes into a Cube.” <i>Computational Geometry: Theory and Applications</i>.
    Elsevier, 2021. <a href="https://doi.org/10.1016/j.comgeo.2020.101700">https://doi.org/10.1016/j.comgeo.2020.101700</a>.'
  ieee: 'O. Aichholzer <i>et al.</i>, “Folding polyominoes with holes into a cube,”
    <i>Computational Geometry: Theory and Applications</i>, vol. 93. Elsevier, 2021.'
  ista: 'Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist
    L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2021. Folding
    polyominoes with holes into a cube. Computational Geometry: Theory and Applications.
    93, 101700.'
  mla: 'Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” <i>Computational
    Geometry: Theory and Applications</i>, vol. 93, 101700, Elsevier, 2021, doi:<a
    href="https://doi.org/10.1016/j.comgeo.2020.101700">10.1016/j.comgeo.2020.101700</a>.'
  short: 'O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P.
    Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt,
    Computational Geometry: Theory and Applications 93 (2021).'
corr_author: '1'
date_created: 2020-08-30T22:01:09Z
date_published: 2021-02-01T00:00:00Z
date_updated: 2026-04-16T09:14:31Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.comgeo.2020.101700
external_id:
  arxiv:
  - '1910.09917'
  isi:
  - '000579185100004'
intvolume: '        93'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1910.09917v3
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z00342
  name: Mathematics, Computer Science
publication: 'Computational Geometry: Theory and Applications'
publication_identifier:
  eissn:
  - 1879-081X
  issn:
  - 0925-7721
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
  record:
  - id: '6989'
    relation: shorter_version
    status: public
scopus_import: '1'
status: public
title: Folding polyominoes with holes into a cube
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 93
year: '2021'
...
---
_id: '9826'
abstract:
- lang: eng
  text: "Automated contract tracing aims at supporting manual contact tracing during
    pandemics by alerting users of encounters with infected people. There are currently
    many proposals for protocols (like the “decentralized” DP-3T and PACT or the “centralized”
    ROBERT and DESIRE) to be run on mobile phones, where the basic idea is to regularly
    broadcast (using low energy Bluetooth) some values, and at the same time store
    (a function of) incoming messages broadcasted by users in their proximity. In
    the existing proposals one can trigger false positives on a massive scale by an
    “inverse-Sybil” attack, where a large number of devices (malicious users or hacked
    phones) pretend to be the same user, such that later, just a single person needs
    to be diagnosed (and allowed to upload) to trigger an alert for all users who
    were in proximity to any of this large group of devices.\r\n\r\nWe propose the
    first protocols that do not succumb to such attacks assuming the devices involved
    in the attack do not constantly communicate, which we observe is a necessary assumption.
    The high level idea of the protocols is to derive the values to be broadcasted
    by a hash chain, so that two (or more) devices who want to launch an inverse-Sybil
    attack will not be able to connect their respective chains and thus only one of
    them will be able to upload. Our protocols also achieve security against replay,
    belated replay, and one of them even against relay attacks."
acknowledgement: Guillermo Pascual-Perez and Michelle Yeo were funded by the European
  Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie
  Grant Agreement No. 665385; the remaining contributors to this project have received
  funding from the European Research Council (ERC) under the European Union’s Horizon
  2020 research and innovation programme (682815 - TOCNeT).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Benedikt
  full_name: Auerbach, Benedikt
  id: D33D2B18-E445-11E9-ABB7-15F4E5697425
  last_name: Auerbach
  orcid: 0000-0002-7553-6606
- first_name: Suvradip
  full_name: Chakraborty, Suvradip
  id: B9CD0494-D033-11E9-B219-A439E6697425
  last_name: Chakraborty
- first_name: Karen
  full_name: Klein, Karen
  id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
  last_name: Klein
- first_name: Guillermo
  full_name: Pascual Perez, Guillermo
  id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87
  last_name: Pascual Perez
  orcid: 0000-0001-8630-415X
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
- first_name: Michael
  full_name: Walter, Michael
  id: 488F98B0-F248-11E8-B48F-1D18A9856A87
  last_name: Walter
  orcid: 0000-0003-3186-2482
- first_name: Michelle X
  full_name: Yeo, Michelle X
  id: 2D82B818-F248-11E8-B48F-1D18A9856A87
  last_name: Yeo
  orcid: 0009-0001-3676-4809
citation:
  ama: 'Auerbach B, Chakraborty S, Klein K, et al. Inverse-Sybil attacks in automated
    contact tracing. In: <i>Topics in Cryptology – CT-RSA 2021</i>. Vol 12704. Springer
    Nature; 2021:399-421. doi:<a href="https://doi.org/10.1007/978-3-030-75539-3_17">10.1007/978-3-030-75539-3_17</a>'
  apa: 'Auerbach, B., Chakraborty, S., Klein, K., Pascual Perez, G., Pietrzak, K.
    Z., Walter, M., &#38; Yeo, M. X. (2021). Inverse-Sybil attacks in automated contact
    tracing. In <i>Topics in Cryptology – CT-RSA 2021</i> (Vol. 12704, pp. 399–421).
    Virtual Event: Springer Nature. <a href="https://doi.org/10.1007/978-3-030-75539-3_17">https://doi.org/10.1007/978-3-030-75539-3_17</a>'
  chicago: Auerbach, Benedikt, Suvradip Chakraborty, Karen Klein, Guillermo Pascual
    Perez, Krzysztof Z Pietrzak, Michael Walter, and Michelle X Yeo. “Inverse-Sybil
    Attacks in Automated Contact Tracing.” In <i>Topics in Cryptology – CT-RSA 2021</i>,
    12704:399–421. Springer Nature, 2021. <a href="https://doi.org/10.1007/978-3-030-75539-3_17">https://doi.org/10.1007/978-3-030-75539-3_17</a>.
  ieee: B. Auerbach <i>et al.</i>, “Inverse-Sybil attacks in automated contact tracing,”
    in <i>Topics in Cryptology – CT-RSA 2021</i>, Virtual Event, 2021, vol. 12704,
    pp. 399–421.
  ista: 'Auerbach B, Chakraborty S, Klein K, Pascual Perez G, Pietrzak KZ, Walter
    M, Yeo MX. 2021. Inverse-Sybil attacks in automated contact tracing. Topics in
    Cryptology – CT-RSA 2021. CT-RSA: Cryptographers’ Track at the RSA Conference,
    LNCS, vol. 12704, 399–421.'
  mla: Auerbach, Benedikt, et al. “Inverse-Sybil Attacks in Automated Contact Tracing.”
    <i>Topics in Cryptology – CT-RSA 2021</i>, vol. 12704, Springer Nature, 2021,
    pp. 399–421, doi:<a href="https://doi.org/10.1007/978-3-030-75539-3_17">10.1007/978-3-030-75539-3_17</a>.
  short: B. Auerbach, S. Chakraborty, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M.
    Walter, M.X. Yeo, in:, Topics in Cryptology – CT-RSA 2021, Springer Nature, 2021,
    pp. 399–421.
conference:
  end_date: 2021-05-20
  location: Virtual Event
  name: 'CT-RSA: Cryptographers’ Track at the RSA Conference'
  start_date: 2021-05-17
corr_author: '1'
date_created: 2021-08-08T22:01:30Z
date_published: 2021-05-11T00:00:00Z
date_updated: 2026-04-16T09:28:46Z
day: '11'
department:
- _id: KrPi
- _id: GradSch
doi: 10.1007/978-3-030-75539-3_17
ec_funded: 1
intvolume: '     12704'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2020/670
month: '05'
oa: 1
oa_version: Submitted Version
page: 399-421
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '682815'
  name: Teaching Old Crypto New Tricks
publication: Topics in Cryptology – CT-RSA 2021
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783030755386'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inverse-Sybil attacks in automated contact tracing
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12704
year: '2021'
...
