---
_id: '7808'
abstract:
- lang: eng
  text: Quantization converts neural networks into low-bit fixed-point computations
    which can be carried out by efficient integer-only hardware, and is standard practice
    for the deployment of neural networks on real-time embedded devices. However,
    like their real-numbered counterpart, quantized networks are not immune to malicious
    misclassification caused by adversarial attacks. We investigate how quantization
    affects a network’s robustness to adversarial attacks, which is a formal verification
    question. We show that neither robustness nor non-robustness are monotonic with
    changing the number of bits for the representation and, also, neither are preserved
    by quantization from a real-numbered network. For this reason, we introduce a
    verification method for quantized neural networks which, using SMT solving over
    bit-vectors, accounts for their exact, bit-precise semantics. We built a tool
    and analyzed the effect of quantization on a classifier for the MNIST dataset.
    We demonstrate that, compared to our method, existing methods for the analysis
    of real-numbered networks often derive false conclusions about their quantizations,
    both when determining robustness and when detecting attacks, and that existing
    methods for quantized networks often miss attacks. Furthermore, we applied our
    method beyond robustness, showing how the number of bits in quantization enlarges
    the gender bias of a predictor for students’ grades.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Mirco
  full_name: Giacobbe, Mirco
  id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
  last_name: Giacobbe
  orcid: 0000-0001-8180-0904
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
- first_name: Mathias
  full_name: Lechner, Mathias
  id: 3DC22916-F248-11E8-B48F-1D18A9856A87
  last_name: Lechner
citation:
  ama: 'Giacobbe M, Henzinger TA, Lechner M. How many bits does it take to quantize
    your neural network? In: <i>International Conference on Tools and Algorithms for
    the Construction and Analysis of Systems</i>. Vol 12079. Springer Nature; 2020:79-97.
    doi:<a href="https://doi.org/10.1007/978-3-030-45237-7_5">10.1007/978-3-030-45237-7_5</a>'
  apa: 'Giacobbe, M., Henzinger, T. A., &#38; Lechner, M. (2020). How many bits does
    it take to quantize your neural network? In <i>International Conference on Tools
    and Algorithms for the Construction and Analysis of Systems</i> (Vol. 12079, pp.
    79–97). Dublin, Ireland: Springer Nature. <a href="https://doi.org/10.1007/978-3-030-45237-7_5">https://doi.org/10.1007/978-3-030-45237-7_5</a>'
  chicago: Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits
    Does It Take to Quantize Your Neural Network?” In <i>International Conference
    on Tools and Algorithms for the Construction and Analysis of Systems</i>, 12079:79–97.
    Springer Nature, 2020. <a href="https://doi.org/10.1007/978-3-030-45237-7_5">https://doi.org/10.1007/978-3-030-45237-7_5</a>.
  ieee: M. Giacobbe, T. A. Henzinger, and M. Lechner, “How many bits does it take
    to quantize your neural network?,” in <i>International Conference on Tools and
    Algorithms for the Construction and Analysis of Systems</i>, Dublin, Ireland,
    2020, vol. 12079, pp. 79–97.
  ista: 'Giacobbe M, Henzinger TA, Lechner M. 2020. How many bits does it take to
    quantize your neural network? International Conference on Tools and Algorithms
    for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for
    the Construction and Analysis of Systems, LNCS, vol. 12079, 79–97.'
  mla: Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural
    Network?” <i>International Conference on Tools and Algorithms for the Construction
    and Analysis of Systems</i>, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:<a
    href="https://doi.org/10.1007/978-3-030-45237-7_5">10.1007/978-3-030-45237-7_5</a>.
  short: M. Giacobbe, T.A. Henzinger, M. Lechner, in:, International Conference on
    Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature,
    2020, pp. 79–97.
conference:
  end_date: 2020-04-30
  location: Dublin, Ireland
  name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
  start_date: 2020-04-25
corr_author: '1'
date_created: 2020-05-10T22:00:49Z
date_published: 2020-04-17T00:00:00Z
date_updated: 2026-04-16T09:46:07Z
day: '17'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-45237-7_5
external_id:
  isi:
  - '001288734300005'
file:
- access_level: open_access
  checksum: f19905a42891fe5ce93d69143fa3f6fb
  content_type: application/pdf
  creator: dernst
  date_created: 2020-05-26T12:48:15Z
  date_updated: 2020-07-14T12:48:03Z
  file_id: '7893'
  file_name: 2020_TACAS_Giacobbe.pdf
  file_size: 2744030
  relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
intvolume: '     12079'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 79-97
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
publication: International Conference on Tools and Algorithms for the Construction
  and Analysis of Systems
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783030452360'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '11362'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: How many bits does it take to quantize your neural network?
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12079
year: '2020'
...
---
_id: '7586'
abstract:
- lang: eng
  text: CLC chloride/proton exchangers may support acidification of endolysosomes
    and raise their luminal Cl− concentration. Disruption of endosomal ClC‐3 causes
    severe neurodegeneration. To assess the importance of ClC‐3 Cl−/H+ exchange, we
    now generate Clcn3unc/unc mice in which ClC‐3 is converted into a Cl− channel.
    Unlike Clcn3−/− mice, Clcn3unc/unc mice appear normal owing to compensation by
    ClC‐4 with which ClC‐3 forms heteromers. ClC‐4 protein levels are strongly reduced
    in Clcn3−/−, but not in Clcn3unc/unc mice because ClC‐3unc binds and stabilizes
    ClC‐4 like wild‐type ClC‐3. Although mice lacking ClC‐4 appear healthy, its absence
    in Clcn3unc/unc/Clcn4−/− mice entails even stronger neurodegeneration than observed
    in Clcn3−/− mice. A fraction of ClC‐3 is found on synaptic vesicles, but miniature
    postsynaptic currents and synaptic vesicle acidification are not affected in Clcn3unc/unc
    or Clcn3−/− mice before neurodegeneration sets in. Both, Cl−/H+‐exchange activity
    and the stabilizing effect on ClC‐4, are central to the biological function of
    ClC‐3.
acknowledgement: "We thank T. Stauber and T. Breiderhoff for cloning expression constructs;
  K. Räbel, S. Hohensee, and C. Backhaus for technical assistance; R. Jahn (MPIbpc,
  Göttingen) for providing the equipment required for SV purification; and A\r\nWoehler
  (MDC, Berlin) for assistance with SV imaging. Supported, in part, by grants from
  the Deutsche Forschungsgemeinschaft (JE164/9-2, SFB740 TP C5, FOR 2625 (JE164/14-1),
  NeuroCure Cluster of Excellence), the European Research Council Advanced Grant CYTOVOLION
  (ERC 294435) and the Prix Louis-Jeantet de Médecine to TJJ, and Peter and Traudl
  Engelhorn fellowship to ZF."
article_number: e103358
article_processing_charge: No
article_type: original
author:
- first_name: Stefanie
  full_name: Weinert, Stefanie
  last_name: Weinert
- first_name: Niclas
  full_name: Gimber, Niclas
  last_name: Gimber
- first_name: Dorothea
  full_name: Deuschel, Dorothea
  last_name: Deuschel
- first_name: Till
  full_name: Stuhlmann, Till
  last_name: Stuhlmann
- first_name: Dmytro
  full_name: Puchkov, Dmytro
  last_name: Puchkov
- first_name: Zohreh
  full_name: Farsi, Zohreh
  last_name: Farsi
- first_name: Carmen F.
  full_name: Ludwig, Carmen F.
  last_name: Ludwig
- first_name: Gaia
  full_name: Novarino, Gaia
  id: 3E57A680-F248-11E8-B48F-1D18A9856A87
  last_name: Novarino
  orcid: 0000-0002-7673-7178
- first_name: Karen I.
  full_name: López-Cayuqueo, Karen I.
  last_name: López-Cayuqueo
- first_name: Rosa
  full_name: Planells-Cases, Rosa
  last_name: Planells-Cases
- first_name: Thomas J.
  full_name: Jentsch, Thomas J.
  last_name: Jentsch
citation:
  ama: Weinert S, Gimber N, Deuschel D, et al. Uncoupling endosomal CLC chloride/proton
    exchange causes severe neurodegeneration. <i>EMBO Journal</i>. 2020;39. doi:<a
    href="https://doi.org/10.15252/embj.2019103358">10.15252/embj.2019103358</a>
  apa: Weinert, S., Gimber, N., Deuschel, D., Stuhlmann, T., Puchkov, D., Farsi, Z.,
    … Jentsch, T. J. (2020). Uncoupling endosomal CLC chloride/proton exchange causes
    severe neurodegeneration. <i>EMBO Journal</i>. EMBO Press. <a href="https://doi.org/10.15252/embj.2019103358">https://doi.org/10.15252/embj.2019103358</a>
  chicago: Weinert, Stefanie, Niclas Gimber, Dorothea Deuschel, Till Stuhlmann, Dmytro
    Puchkov, Zohreh Farsi, Carmen F. Ludwig, et al. “Uncoupling Endosomal CLC Chloride/Proton
    Exchange Causes Severe Neurodegeneration.” <i>EMBO Journal</i>. EMBO Press, 2020.
    <a href="https://doi.org/10.15252/embj.2019103358">https://doi.org/10.15252/embj.2019103358</a>.
  ieee: S. Weinert <i>et al.</i>, “Uncoupling endosomal CLC chloride/proton exchange
    causes severe neurodegeneration,” <i>EMBO Journal</i>, vol. 39. EMBO Press, 2020.
  ista: Weinert S, Gimber N, Deuschel D, Stuhlmann T, Puchkov D, Farsi Z, Ludwig CF,
    Novarino G, López-Cayuqueo KI, Planells-Cases R, Jentsch TJ. 2020. Uncoupling
    endosomal CLC chloride/proton exchange causes severe neurodegeneration. EMBO Journal.
    39, e103358.
  mla: Weinert, Stefanie, et al. “Uncoupling Endosomal CLC Chloride/Proton Exchange
    Causes Severe Neurodegeneration.” <i>EMBO Journal</i>, vol. 39, e103358, EMBO
    Press, 2020, doi:<a href="https://doi.org/10.15252/embj.2019103358">10.15252/embj.2019103358</a>.
  short: S. Weinert, N. Gimber, D. Deuschel, T. Stuhlmann, D. Puchkov, Z. Farsi, C.F.
    Ludwig, G. Novarino, K.I. López-Cayuqueo, R. Planells-Cases, T.J. Jentsch, EMBO
    Journal 39 (2020).
date_created: 2020-03-15T23:00:55Z
date_published: 2020-03-02T00:00:00Z
date_updated: 2026-04-16T09:35:48Z
day: '02'
ddc:
- '570'
department:
- _id: GaNo
doi: 10.15252/embj.2019103358
external_id:
  isi:
  - '000517335000001'
  pmid:
  - '32118314'
file:
- access_level: open_access
  checksum: 82750a7a93e3740decbce8474004111a
  content_type: application/pdf
  creator: dernst
  date_created: 2020-03-23T13:51:11Z
  date_updated: 2020-07-14T12:48:00Z
  file_id: '7615'
  file_name: 2020_EMBO_Weinert.pdf
  file_size: 12243278
  relation: main_file
file_date_updated: 2020-07-14T12:48:00Z
has_accepted_license: '1'
intvolume: '        39'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
publication: EMBO Journal
publication_identifier:
  eissn:
  - 1460-2075
  issn:
  - 0261-4189
publication_status: published
publisher: EMBO Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 39
year: '2020'
...
---
_id: '7966'
abstract:
- lang: eng
  text: "For 1≤m≤n, we consider a natural m-out-of-n multi-instance scenario for a
    public-key encryption (PKE) scheme. An adversary, given n independent instances
    of PKE, wins if he breaks at least m out of the n instances. In this work, we
    are interested in the scaling factor of PKE schemes, SF, which measures how well
    the difficulty of breaking m out of the n instances scales in m. That is, a scaling
    factor SF=ℓ indicates that breaking m out of n instances is at least ℓ times more
    difficult than breaking one single instance. A PKE scheme with small scaling factor
    hence provides an ideal target for mass surveillance. In fact, the Logjam attack
    (CCS 2015) implicitly exploited, among other things, an almost constant scaling
    factor of ElGamal over finite fields (with shared group parameters).\r\n\r\nFor
    Hashed ElGamal over elliptic curves, we use the generic group model to argue that
    the scaling factor depends on the scheme's granularity. In low granularity, meaning
    each public key contains its independent group parameter, the scheme has optimal
    scaling factor SF=m; In medium and high granularity, meaning all public keys share
    the same group parameter, the scheme still has a reasonable scaling factor SF=√m.
    Our findings underline that instantiating ElGamal over elliptic curves should
    be preferred to finite fields in a multi-instance scenario.\r\n\r\nAs our main
    technical contribution, we derive new generic-group lower bounds of Ω(√(mp)) on
    the difficulty of solving both the m-out-of-n Gap Discrete Logarithm and the m-out-of-n
    Gap Computational Diffie-Hellman problem over groups of prime order p, extending
    a recent result by Yun (EUROCRYPT 2015). We establish the lower bound by studying
    the hardness of a related computational problem which we call the search-by-hypersurface
    problem."
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: Federico
  full_name: Giacon, Federico
  last_name: Giacon
- first_name: Eike
  full_name: Kiltz, Eike
  last_name: Kiltz
citation:
  ama: 'Auerbach B, Giacon F, Kiltz E. Everybody’s a target: Scalability in public-key
    encryption. In: <i>Advances in Cryptology – EUROCRYPT 2020</i>. Vol 12107. Springer
    Nature; 2020:475-506. doi:<a href="https://doi.org/10.1007/978-3-030-45727-3_16">10.1007/978-3-030-45727-3_16</a>'
  apa: 'Auerbach, B., Giacon, F., &#38; Kiltz, E. (2020). Everybody’s a target: Scalability
    in public-key encryption. In <i>Advances in Cryptology – EUROCRYPT 2020</i> (Vol.
    12107, pp. 475–506). Springer Nature. <a href="https://doi.org/10.1007/978-3-030-45727-3_16">https://doi.org/10.1007/978-3-030-45727-3_16</a>'
  chicago: 'Auerbach, Benedikt, Federico Giacon, and Eike Kiltz. “Everybody’s a Target:
    Scalability in Public-Key Encryption.” In <i>Advances in Cryptology – EUROCRYPT
    2020</i>, 12107:475–506. Springer Nature, 2020. <a href="https://doi.org/10.1007/978-3-030-45727-3_16">https://doi.org/10.1007/978-3-030-45727-3_16</a>.'
  ieee: 'B. Auerbach, F. Giacon, and E. Kiltz, “Everybody’s a target: Scalability
    in public-key encryption,” in <i>Advances in Cryptology – EUROCRYPT 2020</i>,
    2020, vol. 12107, pp. 475–506.'
  ista: 'Auerbach B, Giacon F, Kiltz E. 2020. Everybody’s a target: Scalability in
    public-key encryption. Advances in Cryptology – EUROCRYPT 2020. EUROCRYPT: Theory
    and Applications of Cryptographic Techniques, LNCS, vol. 12107, 475–506.'
  mla: 'Auerbach, Benedikt, et al. “Everybody’s a Target: Scalability in Public-Key
    Encryption.” <i>Advances in Cryptology – EUROCRYPT 2020</i>, vol. 12107, Springer
    Nature, 2020, pp. 475–506, doi:<a href="https://doi.org/10.1007/978-3-030-45727-3_16">10.1007/978-3-030-45727-3_16</a>.'
  short: B. Auerbach, F. Giacon, E. Kiltz, in:, Advances in Cryptology – EUROCRYPT
    2020, Springer Nature, 2020, pp. 475–506.
conference:
  end_date: 2020-05-15
  name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
  start_date: 2020-05-11
date_created: 2020-06-15T07:13:37Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2026-04-16T10:21:02Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-030-45727-3_16
ec_funded: 1
external_id:
  isi:
  - '000828688000016'
intvolume: '     12107'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2019/364
month: '05'
oa: 1
oa_version: Submitted Version
page: 475-506
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '682815'
  name: Teaching Old Crypto New Tricks
publication: Advances in Cryptology – EUROCRYPT 2020
publication_identifier:
  eisbn:
  - '9783030457273'
  eissn:
  - 1611-3349
  isbn:
  - '9783030457266'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Everybody’s a target: Scalability in public-key encryption'
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12107
year: '2020'
...
---
_id: '8623'
abstract:
- lang: eng
  text: We introduce the monitoring of trace properties under assumptions. An assumption
    limits the space of possible traces that the monitor may encounter. An assumption
    may result from knowledge about the system that is being monitored, about the
    environment, or about another, connected monitor. We define monitorability under
    assumptions and study its theoretical properties. In particular, we show that
    for every assumption A, the boolean combinations of properties that are safe or
    co-safe relative to A are monitorable under A. We give several examples and constructions
    on how an assumption can make a non-monitorable property monitorable, and how
    an assumption can make a monitorable property monitorable with fewer resources,
    such as integer registers.
acknowledgement: This research was supported in part by the Austrian Science Fund
  (FWF) under grant Z211-N23 (Wittgenstein Award).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
- first_name: Naci E
  full_name: Sarac, Naci E
  id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425
  last_name: Sarac
citation:
  ama: 'Henzinger TA, Sarac NE. Monitorability under assumptions. In: <i>Runtime Verification</i>.
    Vol 12399. Springer Nature; 2020:3-18. doi:<a href="https://doi.org/10.1007/978-3-030-60508-7_1">10.1007/978-3-030-60508-7_1</a>'
  apa: 'Henzinger, T. A., &#38; Sarac, N. E. (2020). Monitorability under assumptions.
    In <i>Runtime Verification</i> (Vol. 12399, pp. 3–18). Los Angeles, CA, United
    States: Springer Nature. <a href="https://doi.org/10.1007/978-3-030-60508-7_1">https://doi.org/10.1007/978-3-030-60508-7_1</a>'
  chicago: Henzinger, Thomas A, and Naci E Sarac. “Monitorability under Assumptions.”
    In <i>Runtime Verification</i>, 12399:3–18. Springer Nature, 2020. <a href="https://doi.org/10.1007/978-3-030-60508-7_1">https://doi.org/10.1007/978-3-030-60508-7_1</a>.
  ieee: T. A. Henzinger and N. E. Sarac, “Monitorability under assumptions,” in <i>Runtime
    Verification</i>, Los Angeles, CA, United States, 2020, vol. 12399, pp. 3–18.
  ista: 'Henzinger TA, Sarac NE. 2020. Monitorability under assumptions. Runtime Verification.
    RV: Runtime Verification, LNCS, vol. 12399, 3–18.'
  mla: Henzinger, Thomas A., and Naci E. Sarac. “Monitorability under Assumptions.”
    <i>Runtime Verification</i>, vol. 12399, Springer Nature, 2020, pp. 3–18, doi:<a
    href="https://doi.org/10.1007/978-3-030-60508-7_1">10.1007/978-3-030-60508-7_1</a>.
  short: T.A. Henzinger, N.E. Sarac, in:, Runtime Verification, Springer Nature, 2020,
    pp. 3–18.
conference:
  end_date: 2020-10-09
  location: Los Angeles, CA, United States
  name: 'RV: Runtime Verification'
  start_date: 2020-10-06
date_created: 2020-10-07T15:05:37Z
date_published: 2020-10-02T00:00:00Z
date_updated: 2026-04-16T10:22:01Z
day: '02'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-60508-7_1
external_id:
  isi:
  - '000728160600001'
file:
- access_level: open_access
  checksum: 00661f9b7034f52e18bf24fa552b8194
  content_type: application/pdf
  creator: esarac
  date_created: 2020-10-15T14:28:06Z
  date_updated: 2020-10-15T14:28:06Z
  file_id: '8665'
  file_name: monitorability.pdf
  file_size: 478148
  relation: main_file
  success: 1
file_date_updated: 2020-10-15T14:28:06Z
has_accepted_license: '1'
intvolume: '     12399'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 3-18
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
publication: Runtime Verification
publication_identifier:
  eisbn:
  - '9783030605087'
  eissn:
  - 1611-3349
  isbn:
  - '9783030605070'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monitorability under assumptions
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12399
year: '2020'
...
---
_id: '8732'
abstract:
- lang: eng
  text: 'A simple drawing D(G) of a graph G is one where each pair of edges share
    at most one point: either a common endpoint or a proper crossing. An edge e in
    the complement of G can be inserted into D(G) if there exists a simple drawing
    of   G+e  extending D(G). As a result of Levi’s Enlargement Lemma, if a drawing
    is rectilinear (pseudolinear), that is, the edges can be extended into an arrangement
    of lines (pseudolines), then any edge in the complement of G can be inserted.
    In contrast, we show that it is   NP -complete to decide whether one edge can
    be inserted into a simple drawing. This remains true even if we assume that the
    drawing is pseudocircular, that is, the edges can be extended to an arrangement
    of pseudocircles. On the positive side, we show that, given an arrangement of
    pseudocircles   A  and a pseudosegment   σ , it can be decided in polynomial time
    whether there exists a pseudocircle   Φσ  extending   σ  for which   A∪{Φσ}  is
    again an arrangement of pseudocircles.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alan M
  full_name: Arroyo Guevara, Alan M
  id: 3207FDC6-F248-11E8-B48F-1D18A9856A87
  last_name: Arroyo Guevara
  orcid: 0000-0003-2401-8670
- first_name: Fabian
  full_name: Klute, Fabian
  last_name: Klute
- first_name: Irene
  full_name: Parada, Irene
  last_name: Parada
- first_name: Raimund
  full_name: Seidel, Raimund
  last_name: Seidel
- first_name: Birgit
  full_name: Vogtenhuber, Birgit
  last_name: Vogtenhuber
- first_name: Tilo
  full_name: Wiedera, Tilo
  last_name: Wiedera
citation:
  ama: 'Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T.
    Inserting one edge into a simple drawing is hard. In: <i>Graph-Theoretic Concepts
    in Computer Science</i>. Vol 12301. Springer Nature; 2020:325-338. doi:<a href="https://doi.org/10.1007/978-3-030-60440-0_26">10.1007/978-3-030-60440-0_26</a>'
  apa: 'Arroyo Guevara, A. M., Klute, F., Parada, I., Seidel, R., Vogtenhuber, B.,
    &#38; Wiedera, T. (2020). Inserting one edge into a simple drawing is hard. In
    <i>Graph-Theoretic Concepts in Computer Science</i> (Vol. 12301, pp. 325–338).
    Leeds, United Kingdom: Springer Nature. <a href="https://doi.org/10.1007/978-3-030-60440-0_26">https://doi.org/10.1007/978-3-030-60440-0_26</a>'
  chicago: Arroyo Guevara, Alan M, Fabian Klute, Irene Parada, Raimund Seidel, Birgit
    Vogtenhuber, and Tilo Wiedera. “Inserting One Edge into a Simple Drawing Is Hard.”
    In <i>Graph-Theoretic Concepts in Computer Science</i>, 12301:325–38. Springer
    Nature, 2020. <a href="https://doi.org/10.1007/978-3-030-60440-0_26">https://doi.org/10.1007/978-3-030-60440-0_26</a>.
  ieee: A. M. Arroyo Guevara, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, and
    T. Wiedera, “Inserting one edge into a simple drawing is hard,” in <i>Graph-Theoretic
    Concepts in Computer Science</i>, Leeds, United Kingdom, 2020, vol. 12301, pp.
    325–338.
  ista: 'Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T.
    2020. Inserting one edge into a simple drawing is hard. Graph-Theoretic Concepts
    in Computer Science. WG: Workshop on Graph-Theoretic Concepts in Computer Science,
    LNCS, vol. 12301, 325–338.'
  mla: Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is
    Hard.” <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 12301, Springer
    Nature, 2020, pp. 325–38, doi:<a href="https://doi.org/10.1007/978-3-030-60440-0_26">10.1007/978-3-030-60440-0_26</a>.
  short: A.M. Arroyo Guevara, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, T. Wiedera,
    in:, Graph-Theoretic Concepts in Computer Science, Springer Nature, 2020, pp.
    325–338.
conference:
  end_date: 2020-06-26
  location: Leeds, United Kingdom
  name: 'WG: Workshop on Graph-Theoretic Concepts in Computer Science'
  start_date: 2020-06-24
date_created: 2020-11-06T08:45:03Z
date_published: 2020-10-09T00:00:00Z
date_updated: 2026-04-16T10:22:35Z
day: '09'
department:
- _id: UlWa
doi: 10.1007/978-3-030-60440-0_26
ec_funded: 1
external_id:
  isi:
  - '001299688100026'
intvolume: '     12301'
isi: 1
language:
- iso: eng
month: '10'
oa_version: None
page: 325-338
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: Graph-Theoretic Concepts in Computer Science
publication_identifier:
  eisbn:
  - '9783030604400'
  eissn:
  - 1611-3349
  isbn:
  - '9783030604394'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inserting one edge into a simple drawing is hard
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12301
year: '2020'
...
---
_id: '10865'
abstract:
- lang: eng
  text: "We introduce the notion of Witness Maps as a cryptographic notion of a proof
    system. A Unique Witness Map (UWM) deterministically maps all witnesses for an
    \  NP  statement to a single representative witness, resulting in a computationally
    sound, deterministic-prover, non-interactive witness independent proof system.
    A relaxation of UWM, called Compact Witness Map (CWM), maps all the witnesses
    to a small number of witnesses, resulting in a “lossy” deterministic-prover, non-interactive
    proof-system. We also define a Dual Mode Witness Map (DMWM) which adds an “extractable”
    mode to a CWM.\r\nOur main construction is a DMWM for all   NP  relations, assuming
    sub-exponentially secure indistinguishability obfuscation (  iO ), along with
    standard cryptographic assumptions. The DMWM construction relies on a CWM and
    a new primitive called Cumulative All-Lossy-But-One Trapdoor Functions (C-ALBO-TDF),
    both of which are in turn instantiated based on   iO  and other primitives. Our
    instantiation of a CWM is in fact a UWM; in turn, we show that a UWM implies Witness
    Encryption. Along the way to constructing UWM and C-ALBO-TDF, we also construct,
    from standard assumptions, Puncturable Digital Signatures and a new primitive
    called Cumulative Lossy Trapdoor Functions (C-LTDF). The former improves up on
    a construction of Bellare et al. (Eurocrypt 2016), who relied on sub-exponentially
    secure   iO  and sub-exponentially secure OWF.\r\nAs an application of our constructions,
    we show how to use a DMWM to construct the first leakage and tamper-resilient
    signatures with a deterministic signer, thereby solving a decade old open problem
    posed by Katz and Vaikunthanathan (Asiacrypt 2009), by Boyle, Segev and Wichs
    (Eurocrypt 2011), as well as by Faonio and Venturi (Asiacrypt 2016). Our construction
    achieves the optimal leakage rate of   1−o(1) ."
acknowledgement: We would like to thank the anonymous reviewers of PKC 2019 for their
  useful comments and suggestions. We thank Omer Paneth for pointing out to us the
  connection between Unique Witness Maps (UWM) and Witness encryption (WE). The first
  author would like to acknowledge Pandu Rangan for his involvement during the initial
  discussion phase of the project.
article_processing_charge: No
author:
- first_name: Suvradip
  full_name: Chakraborty, Suvradip
  id: B9CD0494-D033-11E9-B219-A439E6697425
  last_name: Chakraborty
- first_name: Manoj
  full_name: Prabhakaran, Manoj
  last_name: Prabhakaran
- first_name: Daniel
  full_name: Wichs, Daniel
  last_name: Wichs
citation:
  ama: 'Chakraborty S, Prabhakaran M, Wichs D. Witness maps and applications. In:
    Kiayias A, ed. <i>Public-Key Cryptography</i>. Vol 12110. LNCS. Cham: Springer
    Nature; 2020:220-246. doi:<a href="https://doi.org/10.1007/978-3-030-45374-9_8">10.1007/978-3-030-45374-9_8</a>'
  apa: 'Chakraborty, S., Prabhakaran, M., &#38; Wichs, D. (2020). Witness maps and
    applications. In A. Kiayias (Ed.), <i>Public-Key Cryptography</i> (Vol. 12110,
    pp. 220–246). Cham: Springer Nature. <a href="https://doi.org/10.1007/978-3-030-45374-9_8">https://doi.org/10.1007/978-3-030-45374-9_8</a>'
  chicago: 'Chakraborty, Suvradip, Manoj Prabhakaran, and Daniel Wichs. “Witness Maps
    and Applications.” In <i>Public-Key Cryptography</i>, edited by A Kiayias, 12110:220–46.
    LNCS. Cham: Springer Nature, 2020. <a href="https://doi.org/10.1007/978-3-030-45374-9_8">https://doi.org/10.1007/978-3-030-45374-9_8</a>.'
  ieee: 'S. Chakraborty, M. Prabhakaran, and D. Wichs, “Witness maps and applications,”
    in <i>Public-Key Cryptography</i>, vol. 12110, A. Kiayias, Ed. Cham: Springer
    Nature, 2020, pp. 220–246.'
  ista: 'Chakraborty S, Prabhakaran M, Wichs D. 2020.Witness maps and applications.
    In: Public-Key Cryptography. vol. 12110, 220–246.'
  mla: Chakraborty, Suvradip, et al. “Witness Maps and Applications.” <i>Public-Key
    Cryptography</i>, edited by A Kiayias, vol. 12110, Springer Nature, 2020, pp.
    220–46, doi:<a href="https://doi.org/10.1007/978-3-030-45374-9_8">10.1007/978-3-030-45374-9_8</a>.
  short: S. Chakraborty, M. Prabhakaran, D. Wichs, in:, A. Kiayias (Ed.), Public-Key
    Cryptography, Springer Nature, Cham, 2020, pp. 220–246.
corr_author: '1'
date_created: 2022-03-18T11:35:51Z
date_published: 2020-04-29T00:00:00Z
date_updated: 2026-04-16T10:21:31Z
day: '29'
doi: 10.1007/978-3-030-45374-9_8
editor:
- first_name: A
  full_name: Kiayias, A
  last_name: Kiayias
external_id:
  isi:
  - '001299210200008'
intvolume: '     12110'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2020/090
month: '04'
oa: 1
oa_version: Preprint
page: 220-246
place: Cham
publication: Public-Key Cryptography
publication_identifier:
  eisbn:
  - '9783030453749'
  eissn:
  - 1611-3349
  isbn:
  - '9783030453732'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Witness maps and applications
type: book_chapter
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12110
year: '2020'
...
---
_id: '8434'
abstract:
- lang: eng
  text: 'Efficient migration on adhesive surfaces involves the protrusion of lamellipodial
    actin networks and their subsequent stabilization by nascent adhesions. The actin-binding
    protein lamellipodin (Lpd) is thought to play a critical role in lamellipodium
    protrusion, by delivering Ena/VASP proteins onto the growing plus ends of actin
    filaments and by interacting with the WAVE regulatory complex, an activator of
    the Arp2/3 complex, at the leading edge. Using B16-F1 melanoma cell lines, we
    demonstrate that genetic ablation of Lpd compromises protrusion efficiency and
    coincident cell migration without altering essential parameters of lamellipodia,
    including their maximal rate of forward advancement and actin polymerization.
    We also confirmed lamellipodia and migration phenotypes with CRISPR/Cas9-mediated
    Lpd knockout Rat2 fibroblasts, excluding cell type-specific effects. Moreover,
    computer-aided analysis of cell-edge morphodynamics on B16-F1 cell lamellipodia
    revealed that loss of Lpd correlates with reduced temporal protrusion maintenance
    as a prerequisite of nascent adhesion formation. We conclude that Lpd optimizes
    protrusion and nascent adhesion formation by counteracting frequent, chaotic retraction
    and membrane ruffling.This article has an associated First Person interview with
    the first author of the paper. '
acknowledgement: This work was supported in part by Deutsche Forschungsgemeinschaft
  (DFG)[GRK2223/1, RO2414/5-1 (to K.R.), FA350/11-1 (to M.F.) and FA330/11-1 (to J.F.)],as
  well as by intramural funding from the Helmholtz Association (to T.E.B.S. andK.R.).
  G.D. was additionally funded by the Austrian Science Fund (FWF) LiseMeitner Program
  [M-2495]. A.C.H. and M.W. are supported by the Francis CrickInstitute, which receives
  its core funding from Cancer Research UK [FC001209], theMedical Research Council
  [FC001209] and the Wellcome Trust [FC001209]. M.K. issupported by the Biotechnology
  and Biological Sciences Research Council [BB/F011431/1, BB/J000590/1, BB/N000226/1].
  Deposited in PMC for release after 6months.
article_number: jcs239020
article_processing_charge: No
article_type: original
author:
- first_name: Georgi A
  full_name: Dimchev, Georgi A
  id: 38C393BE-F248-11E8-B48F-1D18A9856A87
  last_name: Dimchev
  orcid: 0000-0001-8370-6161
- first_name: Behnam
  full_name: Amiri, Behnam
  last_name: Amiri
- first_name: Ashley C.
  full_name: Humphries, Ashley C.
  last_name: Humphries
- first_name: Matthias
  full_name: Schaks, Matthias
  last_name: Schaks
- first_name: Vanessa
  full_name: Dimchev, Vanessa
  last_name: Dimchev
- first_name: Theresia E. B.
  full_name: Stradal, Theresia E. B.
  last_name: Stradal
- first_name: Jan
  full_name: Faix, Jan
  last_name: Faix
- first_name: Matthias
  full_name: Krause, Matthias
  last_name: Krause
- first_name: Michael
  full_name: Way, Michael
  last_name: Way
- first_name: Martin
  full_name: Falcke, Martin
  last_name: Falcke
- first_name: Klemens
  full_name: Rottner, Klemens
  last_name: Rottner
citation:
  ama: Dimchev GA, Amiri B, Humphries AC, et al. Lamellipodin tunes cell migration
    by stabilizing protrusions and promoting adhesion formation. <i>Journal of Cell
    Science</i>. 2020;133(7). doi:<a href="https://doi.org/10.1242/jcs.239020">10.1242/jcs.239020</a>
  apa: Dimchev, G. A., Amiri, B., Humphries, A. C., Schaks, M., Dimchev, V., Stradal,
    T. E. B., … Rottner, K. (2020). Lamellipodin tunes cell migration by stabilizing
    protrusions and promoting adhesion formation. <i>Journal of Cell Science</i>.
    The Company of Biologists. <a href="https://doi.org/10.1242/jcs.239020">https://doi.org/10.1242/jcs.239020</a>
  chicago: Dimchev, Georgi A, Behnam Amiri, Ashley C. Humphries, Matthias Schaks,
    Vanessa Dimchev, Theresia E. B. Stradal, Jan Faix, et al. “Lamellipodin Tunes
    Cell Migration by Stabilizing Protrusions and Promoting Adhesion Formation.” <i>Journal
    of Cell Science</i>. The Company of Biologists, 2020. <a href="https://doi.org/10.1242/jcs.239020">https://doi.org/10.1242/jcs.239020</a>.
  ieee: G. A. Dimchev <i>et al.</i>, “Lamellipodin tunes cell migration by stabilizing
    protrusions and promoting adhesion formation,” <i>Journal of Cell Science</i>,
    vol. 133, no. 7. The Company of Biologists, 2020.
  ista: Dimchev GA, Amiri B, Humphries AC, Schaks M, Dimchev V, Stradal TEB, Faix
    J, Krause M, Way M, Falcke M, Rottner K. 2020. Lamellipodin tunes cell migration
    by stabilizing protrusions and promoting adhesion formation. Journal of Cell Science.
    133(7), jcs239020.
  mla: Dimchev, Georgi A., et al. “Lamellipodin Tunes Cell Migration by Stabilizing
    Protrusions and Promoting Adhesion Formation.” <i>Journal of Cell Science</i>,
    vol. 133, no. 7, jcs239020, The Company of Biologists, 2020, doi:<a href="https://doi.org/10.1242/jcs.239020">10.1242/jcs.239020</a>.
  short: G.A. Dimchev, B. Amiri, A.C. Humphries, M. Schaks, V. Dimchev, T.E.B. Stradal,
    J. Faix, M. Krause, M. Way, M. Falcke, K. Rottner, Journal of Cell Science 133
    (2020).
date_created: 2020-09-17T14:00:33Z
date_published: 2020-04-09T00:00:00Z
date_updated: 2025-04-15T07:52:13Z
day: '09'
ddc:
- '570'
department:
- _id: FlSc
doi: 10.1242/jcs.239020
external_id:
  isi:
  - '000534387800005'
  pmid:
  - ' 32094266'
file:
- access_level: open_access
  checksum: ba917e551acc4ece2884b751434df9ae
  content_type: application/pdf
  creator: dernst
  date_created: 2020-09-17T14:07:51Z
  date_updated: 2020-10-11T22:30:02Z
  embargo: 2020-10-10
  file_id: '8435'
  file_name: 2020_JournalCellScience_Dimchev.pdf
  file_size: 13493302
  relation: main_file
file_date_updated: 2020-10-11T22:30:02Z
has_accepted_license: '1'
intvolume: '       133'
isi: 1
issue: '7'
keyword:
- Cell Biology
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 2674F658-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: M02495
  name: Protein structure and function in filopodia across scales
publication: Journal of Cell Science
publication_identifier:
  eissn:
  - 1477-9137
  issn:
  - 0021-9533
publication_status: published
publisher: The Company of Biologists
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lamellipodin tunes cell migration by stabilizing protrusions and promoting
  adhesion formation
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 133
year: '2020'
...
---
OA_place: repository
OA_type: green
_id: '8707'
abstract:
- lang: eng
  text: Dynamic changes in the three-dimensional (3D) organization of chromatin are
    associated with central biological processes, such as transcription, replication
    and development. Therefore, the comprehensive identification and quantification
    of these changes is fundamental to understanding of evolutionary and regulatory
    mechanisms. Here, we present Comparison of Hi-C Experiments using Structural Similarity
    (CHESS), an algorithm for the comparison of chromatin contact maps and automatic
    differential feature extraction. We demonstrate the robustness of CHESS to experimental
    variability and showcase its biological applications on (1) interspecies comparisons
    of syntenic regions in human and mouse models; (2) intraspecies identification
    of conformational changes in Zelda-depleted Drosophila embryos; (3) patient-specific
    aberrant chromatin conformation in a diffuse large B-cell lymphoma sample; and
    (4) the systematic identification of chromatin contact differences in high-resolution
    Capture-C data. In summary, CHESS is a computationally efficient method for the
    comparison and classification of changes in chromatin contact data.
acknowledgement: 'Work in the Vaquerizas laboratory is funded by the Max Planck Society,
  the Deutsche Forschungsgemeinschaft (DFG) Priority Programme SPP 2202 ‘Spatial Genome
  Architecture in Development and Disease’ (project no. 422857230 to J.M.V.), the
  DFG Clinical Research Unit CRU326 ‘Male Germ Cells: from Genes to Function’ (project
  no. 329621271 to J.M.V.), the European Union’s Horizon 2020 research and innovation
  programme under the Marie Skłodowska-Curie grant agreement no. 643062—ZENCODE-ITN
  to J.M.V.) and the Medical Research Council in the UK. This research was partially
  funded by the European Union’s H2020 Framework Programme through the European Research
  Council (grant no. 609989 to M.A.M.-R.). We thank the support of the Spanish Ministerio
  de Ciencia, Innovación y Universidades through grant no. BFU2017-85926-P to M.A.M.-R.
  The Centre for Genomic Regulation thanks the support of the Ministerio de Ciencia,
  Innovación y Universidades to the European Molecular Biology Laboratory partnership,
  the ‘Centro de Excelencia Severo Ochoa 2013–2017’, agreement no. SEV-2012-0208,
  the CERCA Programme/Generalitat de Catalunya, Spanish Ministerio de Ciencia, Innovación
  y Universidades through the Instituto de Salud Carlos III, the Generalitat de Catalunya
  through the Departament de Salut and Departament d’Empresa i Coneixement and cofinancing
  by the Spanish Ministerio de Ciencia, Innovación y Universidades with funds from
  the European Regional Development Fund corresponding to the 2014–2020 Smart Growth
  Operating Program. S.G. thanks the support from the Company of Biologists (grant
  no. JCSTF181158) and the European Molecular Biology Organization Short-Term Fellowship
  programme.'
article_processing_charge: No
article_type: original
author:
- first_name: Silvia
  full_name: ' Galan, Silvia'
  last_name: ' Galan'
- first_name: Nick N
  full_name: Machnik, Nick N
  id: 3591A0AA-F248-11E8-B48F-1D18A9856A87
  last_name: Machnik
  orcid: 0000-0001-6617-9742
- first_name: Kai
  full_name: Kruse, Kai
  last_name: Kruse
- first_name: Noelia
  full_name: Díaz, Noelia
  last_name: Díaz
- first_name: Marc A
  full_name: Marti-Renom, Marc A
  last_name: Marti-Renom
- first_name: Juan M
  full_name: Vaquerizas, Juan M
  last_name: Vaquerizas
citation:
  ama: Galan S, Machnik NN, Kruse K, Díaz N, Marti-Renom MA, Vaquerizas JM. CHESS
    enables quantitative comparison of chromatin contact data and automatic feature
    extraction. <i>Nature Genetics</i>. 2020;52:1247-1255. doi:<a href="https://doi.org/10.1038/s41588-020-00712-y">10.1038/s41588-020-00712-y</a>
  apa: Galan, S., Machnik, N. N., Kruse, K., Díaz, N., Marti-Renom, M. A., &#38; Vaquerizas,
    J. M. (2020). CHESS enables quantitative comparison of chromatin contact data
    and automatic feature extraction. <i>Nature Genetics</i>. Springer Nature. <a
    href="https://doi.org/10.1038/s41588-020-00712-y">https://doi.org/10.1038/s41588-020-00712-y</a>
  chicago: Galan, Silvia, Nick N Machnik, Kai Kruse, Noelia Díaz, Marc A Marti-Renom,
    and Juan M Vaquerizas. “CHESS Enables Quantitative Comparison of Chromatin Contact
    Data and Automatic Feature Extraction.” <i>Nature Genetics</i>. Springer Nature,
    2020. <a href="https://doi.org/10.1038/s41588-020-00712-y">https://doi.org/10.1038/s41588-020-00712-y</a>.
  ieee: S.  Galan, N. N. Machnik, K. Kruse, N. Díaz, M. A. Marti-Renom, and J. M.
    Vaquerizas, “CHESS enables quantitative comparison of chromatin contact data and
    automatic feature extraction,” <i>Nature Genetics</i>, vol. 52. Springer Nature,
    pp. 1247–1255, 2020.
  ista: Galan S, Machnik NN, Kruse K, Díaz N, Marti-Renom MA, Vaquerizas JM. 2020.
    CHESS enables quantitative comparison of chromatin contact data and automatic
    feature extraction. Nature Genetics. 52, 1247–1255.
  mla: Galan, Silvia, et al. “CHESS Enables Quantitative Comparison of Chromatin Contact
    Data and Automatic Feature Extraction.” <i>Nature Genetics</i>, vol. 52, Springer
    Nature, 2020, pp. 1247–55, doi:<a href="https://doi.org/10.1038/s41588-020-00712-y">10.1038/s41588-020-00712-y</a>.
  short: S.  Galan, N.N. Machnik, K. Kruse, N. Díaz, M.A. Marti-Renom, J.M. Vaquerizas,
    Nature Genetics 52 (2020) 1247–1255.
date_created: 2020-10-25T23:01:20Z
date_published: 2020-10-19T00:00:00Z
date_updated: 2026-04-28T22:30:26Z
day: '19'
department:
- _id: FyKo
doi: 10.1038/s41588-020-00712-y
external_id:
  isi:
  - '000579693500004'
  pmid:
  - '33077914'
intvolume: '        52'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://pmc.ncbi.nlm.nih.gov/articles/PMC7610641/
month: '10'
oa: 1
oa_version: Submitted Version
page: 1247-1255
pmid: 1
publication: Nature Genetics
publication_identifier:
  eissn:
  - 1546-1718
  issn:
  - 1061-4036
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '18642'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: CHESS enables quantitative comparison of chromatin contact data and automatic
  feature extraction
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2020'
...
---
_id: '8532'
abstract:
- lang: eng
  text: The molecular anatomy of synapses defines their characteristics in transmission
    and plasticity. Precise measurements of the number and distribution of synaptic
    proteins are important for our understanding of synapse heterogeneity within and
    between brain regions. Freeze–fracture replica immunogold electron microscopy
    enables us to analyze them quantitatively on a two-dimensional membrane surface.
    Here, we introduce Darea software, which utilizes deep learning for analysis of
    replica images and demonstrate its usefulness for quick measurements of the pre-
    and postsynaptic areas, density and distribution of gold particles at synapses
    in a reproducible manner. We used Darea for comparing glutamate receptor and calcium
    channel distributions between hippocampal CA3-CA1 spine synapses on apical and
    basal dendrites, which differ in signaling pathways involved in synaptic plasticity.
    We found that apical synapses express a higher density of α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic
    acid (AMPA) receptors and a stronger increase of AMPA receptors with synaptic
    size, while basal synapses show a larger increase in N-methyl-D-aspartate (NMDA)
    receptors with size. Interestingly, AMPA and NMDA receptors are segregated within
    postsynaptic sites and negatively correlated in density among both apical and
    basal synapses. In the presynaptic sites, Cav2.1 voltage-gated calcium channels
    show similar densities in apical and basal synapses with distributions consistent
    with an exclusion zone model of calcium channel-release site topography.
acknowledgement: "This research was funded by Austrian Academy of Sciences, DOC fellowship
  to D.K., European Research\r\nCouncil Advanced Grant 694539 and European Union Human
  Brain Project (HBP) SGA2 785907 to R.S.\r\nWe acknowledge Elena Hollergschwandtner
  for technical support."
article_number: '6737'
article_processing_charge: No
article_type: original
author:
- first_name: David
  full_name: Kleindienst, David
  id: 42E121A4-F248-11E8-B48F-1D18A9856A87
  last_name: Kleindienst
- first_name: Jacqueline-Claire
  full_name: Montanaro-Punzengruber, Jacqueline-Claire
  id: 3786AB44-F248-11E8-B48F-1D18A9856A87
  last_name: Montanaro-Punzengruber
- first_name: Pradeep
  full_name: Bhandari, Pradeep
  id: 45EDD1BC-F248-11E8-B48F-1D18A9856A87
  last_name: Bhandari
  orcid: 0000-0003-0863-4481
- first_name: Matthew J
  full_name: Case, Matthew J
  id: 44B7CA5A-F248-11E8-B48F-1D18A9856A87
  last_name: Case
- first_name: Yugo
  full_name: Fukazawa, Yugo
  last_name: Fukazawa
- first_name: Ryuichi
  full_name: Shigemoto, Ryuichi
  id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
  last_name: Shigemoto
  orcid: 0000-0001-8761-9444
citation:
  ama: Kleindienst D, Montanaro-Punzengruber J-C, Bhandari P, Case MJ, Fukazawa Y,
    Shigemoto R. Deep learning-assisted high-throughput analysis of freeze-fracture
    replica images applied to glutamate receptors and calcium channels at hippocampal
    synapses. <i>International Journal of Molecular Sciences</i>. 2020;21(18). doi:<a
    href="https://doi.org/10.3390/ijms21186737">10.3390/ijms21186737</a>
  apa: Kleindienst, D., Montanaro-Punzengruber, J.-C., Bhandari, P., Case, M. J.,
    Fukazawa, Y., &#38; Shigemoto, R. (2020). Deep learning-assisted high-throughput
    analysis of freeze-fracture replica images applied to glutamate receptors and
    calcium channels at hippocampal synapses. <i>International Journal of Molecular
    Sciences</i>. MDPI. <a href="https://doi.org/10.3390/ijms21186737">https://doi.org/10.3390/ijms21186737</a>
  chicago: Kleindienst, David, Jacqueline-Claire Montanaro-Punzengruber, Pradeep Bhandari,
    Matthew J Case, Yugo Fukazawa, and Ryuichi Shigemoto. “Deep Learning-Assisted
    High-Throughput Analysis of Freeze-Fracture Replica Images Applied to Glutamate
    Receptors and Calcium Channels at Hippocampal Synapses.” <i>International Journal
    of Molecular Sciences</i>. MDPI, 2020. <a href="https://doi.org/10.3390/ijms21186737">https://doi.org/10.3390/ijms21186737</a>.
  ieee: D. Kleindienst, J.-C. Montanaro-Punzengruber, P. Bhandari, M. J. Case, Y.
    Fukazawa, and R. Shigemoto, “Deep learning-assisted high-throughput analysis of
    freeze-fracture replica images applied to glutamate receptors and calcium channels
    at hippocampal synapses,” <i>International Journal of Molecular Sciences</i>,
    vol. 21, no. 18. MDPI, 2020.
  ista: Kleindienst D, Montanaro-Punzengruber J-C, Bhandari P, Case MJ, Fukazawa Y,
    Shigemoto R. 2020. Deep learning-assisted high-throughput analysis of freeze-fracture
    replica images applied to glutamate receptors and calcium channels at hippocampal
    synapses. International Journal of Molecular Sciences. 21(18), 6737.
  mla: Kleindienst, David, et al. “Deep Learning-Assisted High-Throughput Analysis
    of Freeze-Fracture Replica Images Applied to Glutamate Receptors and Calcium Channels
    at Hippocampal Synapses.” <i>International Journal of Molecular Sciences</i>,
    vol. 21, no. 18, 6737, MDPI, 2020, doi:<a href="https://doi.org/10.3390/ijms21186737">10.3390/ijms21186737</a>.
  short: D. Kleindienst, J.-C. Montanaro-Punzengruber, P. Bhandari, M.J. Case, Y.
    Fukazawa, R. Shigemoto, International Journal of Molecular Sciences 21 (2020).
corr_author: '1'
date_created: 2020-09-20T22:01:35Z
date_published: 2020-09-14T00:00:00Z
date_updated: 2026-04-28T22:30:40Z
day: '14'
ddc:
- '570'
department:
- _id: RySh
doi: 10.3390/ijms21186737
ec_funded: 1
external_id:
  isi:
  - '000579945300001'
file:
- access_level: open_access
  checksum: 2e4f62f3cfe945b7391fc3070e5a289f
  content_type: application/pdf
  creator: dernst
  date_created: 2020-09-21T14:08:58Z
  date_updated: 2020-09-21T14:08:58Z
  file_id: '8551'
  file_name: 2020_JournMolecSciences_Kleindienst.pdf
  file_size: 5748456
  relation: main_file
  success: 1
file_date_updated: 2020-09-21T14:08:58Z
has_accepted_license: '1'
intvolume: '        21'
isi: 1
issue: '18'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 25CA28EA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '694539'
  name: 'In situ analysis of single channel subunit composition in neurons: physiological
    implication in synaptic plasticity and behaviour'
- _id: 25D32BC0-B435-11E9-9278-68D0E5697425
  name: Mechanism of formation and maintenance of input side-dependent asymmetry in
    the hippocampus
- _id: 26436750-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '785907'
  name: Human Brain Project Specific Grant Agreement 2
publication: International Journal of Molecular Sciences
publication_identifier:
  eissn:
  - 1422-0067
  issn:
  - 1661-6596
publication_status: published
publisher: MDPI
quality_controlled: '1'
related_material:
  record:
  - id: '9562'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Deep learning-assisted high-throughput analysis of freeze-fracture replica
  images applied to glutamate receptors and calcium channels at hippocampal synapses
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: 21
year: '2020'
...
---
OA_place: publisher
_id: '8657'
abstract:
- lang: eng
  text: "Synthesis of proteins – translation – is a fundamental process of life. Quantitative
    studies anchor translation into the context of bacterial physiology and reveal
    several mathematical relationships, called “growth laws,” which capture physiological
    feedbacks between protein synthesis and cell growth. Growth laws describe the
    dependency of the ribosome abundance as a function of growth rate, which can change
    depending on the growth conditions. Perturbations of translation reveal that bacteria
    employ a compensatory strategy in which the reduced translation capability results
    in increased expression of the translation machinery.\r\nPerturbations of translation
    are achieved in various ways; clinically interesting is the application of translation-targeting
    antibiotics – translation inhibitors. The antibiotic effects on bacterial physiology
    are often poorly understood. Bacterial responses to two or more simultaneously
    applied antibiotics are even more puzzling. The combined antibiotic effect determines
    the type of drug interaction, which ranges from synergy (the effect is stronger
    than expected) to antagonism (the effect is weaker) and suppression (one of the
    drugs loses its potency).\r\nIn the first part of this work, we systematically
    measure the pairwise interaction network for translation inhibitors that interfere
    with different steps in translation. We find that the interactions are surprisingly
    diverse and tend to be more antagonistic. To explore the underlying mechanisms,
    we begin with a minimal biophysical model of combined antibiotic action. We base
    this model on the kinetics of antibiotic uptake and binding together with the
    physiological response described by the growth laws. The biophysical model explains
    some drug interactions, but not all; it specifically fails to predict suppression.\r\nIn
    the second part of this work, we hypothesize that elusive suppressive drug interactions
    result from the interplay between ribosomes halted in different stages of translation.
    To elucidate this putative mechanism of drug interactions between translation
    inhibitors, we generate translation bottlenecks genetically using in- ducible
    control of translation factors that regulate well-defined translation cycle steps.
    These perturbations accurately mimic antibiotic action and drug interactions,
    supporting that the interplay of different translation bottlenecks partially causes
    these interactions.\r\nWe extend this approach by varying two translation bottlenecks
    simultaneously. This approach reveals the suppression of translocation inhibition
    by inhibited translation. We rationalize this effect by modeling dense traffic
    of ribosomes that move on transcripts in a translation factor-mediated manner.
    This model predicts a dissolution of traffic jams caused by inhibited translocation
    when the density of ribosome traffic is reduced by lowered initiation. We base
    this model on the growth laws and quantitative relationships between different
    translation and growth parameters.\r\nIn the final part of this work, we describe
    a set of tools aimed at quantification of physiological and translation parameters.
    We further develop a simple model that directly connects the abundance of a translation
    factor with the growth rate, which allows us to extract physiological parameters
    describing initiation. We demonstrate the development of tools for measuring translation
    rate.\r\nThis thesis showcases how a combination of high-throughput growth rate
    mea- surements, genetics, and modeling can reveal mechanisms of drug interactions.
    Furthermore, by a gradual transition from combinations of antibiotics to precise
    genetic interventions, we demonstrated the equivalency between genetic and chemi-
    cal perturbations of translation. These findings tile the path for quantitative
    studies of antibiotic combinations and illustrate future approaches towards the
    quantitative description of translation."
acknowledged_ssus:
- _id: LifeSc
- _id: M-Shop
acknowledgement: I thank Life Science Facilities for their continuous support with
  providing top-notch laboratory materials, keeping the devices humming, and coordinating
  the repairs and building of custom-designed laboratory equipment with the MIBA Machine
  shop.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Bor
  full_name: Kavcic, Bor
  id: 350F91D2-F248-11E8-B48F-1D18A9856A87
  last_name: Kavcic
  orcid: 0000-0001-6041-254X
citation:
  ama: 'Kavcic B. Perturbations of protein synthesis: from antibiotics to genetics
    and physiology. 2020. doi:<a href="https://doi.org/10.15479/AT:ISTA:8657">10.15479/AT:ISTA:8657</a>'
  apa: 'Kavcic, B. (2020). <i>Perturbations of protein synthesis: from antibiotics
    to genetics and physiology</i>. Institute of Science and Technology Austria. <a
    href="https://doi.org/10.15479/AT:ISTA:8657">https://doi.org/10.15479/AT:ISTA:8657</a>'
  chicago: 'Kavcic, Bor. “Perturbations of Protein Synthesis: From Antibiotics to
    Genetics and Physiology.” Institute of Science and Technology Austria, 2020. <a
    href="https://doi.org/10.15479/AT:ISTA:8657">https://doi.org/10.15479/AT:ISTA:8657</a>.'
  ieee: 'B. Kavcic, “Perturbations of protein synthesis: from antibiotics to genetics
    and physiology,” Institute of Science and Technology Austria, 2020.'
  ista: 'Kavcic B. 2020. Perturbations of protein synthesis: from antibiotics to genetics
    and physiology. Institute of Science and Technology Austria.'
  mla: 'Kavcic, Bor. <i>Perturbations of Protein Synthesis: From Antibiotics to Genetics
    and Physiology</i>. Institute of Science and Technology Austria, 2020, doi:<a
    href="https://doi.org/10.15479/AT:ISTA:8657">10.15479/AT:ISTA:8657</a>.'
  short: 'B. Kavcic, Perturbations of Protein Synthesis: From Antibiotics to Genetics
    and Physiology, Institute of Science and Technology Austria, 2020.'
corr_author: '1'
date_created: 2020-10-13T16:46:14Z
date_published: 2020-10-14T00:00:00Z
date_updated: 2026-04-08T07:27:48Z
day: '14'
ddc:
- '571'
- '530'
- '570'
degree_awarded: PhD
department:
- _id: GaTk
doi: 10.15479/AT:ISTA:8657
file:
- access_level: open_access
  checksum: d708ecd62b6fcc3bc1feb483b8dbe9eb
  content_type: application/pdf
  creator: bkavcic
  date_created: 2020-10-15T06:41:20Z
  date_updated: 2021-10-07T22:30:03Z
  embargo: 2021-10-06
  file_id: '8663'
  file_name: kavcicB_thesis202009.pdf
  file_size: 52636162
  relation: main_file
- access_level: closed
  checksum: bb35f2352a04db19164da609f00501f3
  content_type: application/zip
  creator: bkavcic
  date_created: 2020-10-15T06:41:53Z
  date_updated: 2021-10-07T22:30:03Z
  embargo_to: open_access
  file_id: '8664'
  file_name: 2020b.zip
  file_size: 321681247
  relation: source_file
file_date_updated: 2021-10-07T22:30:03Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '271'
publication_identifier:
  isbn:
  - 978-3-99078-011-4
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '7673'
    relation: part_of_dissertation
    status: public
  - id: '8250'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Gašper
  full_name: Tkačik, Gašper
  id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
  last_name: Tkačik
  orcid: 0000-0002-6699-1455
- first_name: Mark Tobias
  full_name: Bollenbach, Mark Tobias
  id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
  last_name: Bollenbach
  orcid: 0000-0003-4398-476X
title: 'Perturbations of protein synthesis: from antibiotics to genetics and physiology'
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
_id: '8569'
abstract:
- lang: eng
  text: Concerted radial migration of newly born cortical projection neurons, from
    their birthplace to their final target lamina, is a key step in the assembly of
    the cerebral cortex. The cellular and molecular mechanisms regulating the specific
    sequential steps of radial neuronal migration in vivo are however still unclear,
    let alone the effects and interactions with the extracellular environment. In
    any in vivo context, cells will always be exposed to a complex extracellular environment
    consisting of (1) secreted factors acting as potential signaling cues, (2) the
    extracellular matrix, and (3) other cells providing cell–cell interaction through
    receptors and/or direct physical stimuli. Most studies so far have described and
    focused mainly on intrinsic cell-autonomous gene functions in neuronal migration
    but there is accumulating evidence that non-cell-autonomous-, local-, systemic-,
    and/or whole tissue-wide effects substantially contribute to the regulation of
    radial neuronal migration. These non-cell-autonomous effects may differentially
    affect cortical neuron migration in distinct cellular environments. However, the
    cellular and molecular natures of such non-cell-autonomous mechanisms are mostly
    unknown. Furthermore, physical forces due to collective migration and/or community
    effects (i.e., interactions with surrounding cells) may play important roles in
    neocortical projection neuron migration. In this concise review, we first outline
    distinct models of non-cell-autonomous interactions of cortical projection neurons
    along their radial migration trajectory during development. We then summarize
    experimental assays and platforms that can be utilized to visualize and potentially
    probe non-cell-autonomous mechanisms. Lastly, we define key questions to address
    in the future.
acknowledgement: AH was a recipient of a DOC Fellowship (24812) of the Austrian Academy
  of Sciences. This work also received support from IST Austria institutional funds;
  the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework
  Programme (FP7/2007–2013) under REA Grant Agreement No. 618444 to SH.
article_number: '574382'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Andi H
  full_name: Hansen, Andi H
  id: 38853E16-F248-11E8-B48F-1D18A9856A87
  last_name: Hansen
- first_name: Simon
  full_name: Hippenmeyer, Simon
  id: 37B36620-F248-11E8-B48F-1D18A9856A87
  last_name: Hippenmeyer
  orcid: 0000-0003-2279-1061
citation:
  ama: Hansen AH, Hippenmeyer S. Non-cell-autonomous mechanisms in radial projection
    neuron migration in the developing cerebral cortex. <i>Frontiers in Cell and Developmental
    Biology</i>. 2020;8(9). doi:<a href="https://doi.org/10.3389/fcell.2020.574382">10.3389/fcell.2020.574382</a>
  apa: Hansen, A. H., &#38; Hippenmeyer, S. (2020). Non-cell-autonomous mechanisms
    in radial projection neuron migration in the developing cerebral cortex. <i>Frontiers
    in Cell and Developmental Biology</i>. Frontiers. <a href="https://doi.org/10.3389/fcell.2020.574382">https://doi.org/10.3389/fcell.2020.574382</a>
  chicago: Hansen, Andi H, and Simon Hippenmeyer. “Non-Cell-Autonomous Mechanisms
    in Radial Projection Neuron Migration in the Developing Cerebral Cortex.” <i>Frontiers
    in Cell and Developmental Biology</i>. Frontiers, 2020. <a href="https://doi.org/10.3389/fcell.2020.574382">https://doi.org/10.3389/fcell.2020.574382</a>.
  ieee: A. H. Hansen and S. Hippenmeyer, “Non-cell-autonomous mechanisms in radial
    projection neuron migration in the developing cerebral cortex,” <i>Frontiers in
    Cell and Developmental Biology</i>, vol. 8, no. 9. Frontiers, 2020.
  ista: Hansen AH, Hippenmeyer S. 2020. Non-cell-autonomous mechanisms in radial projection
    neuron migration in the developing cerebral cortex. Frontiers in Cell and Developmental
    Biology. 8(9), 574382.
  mla: Hansen, Andi H., and Simon Hippenmeyer. “Non-Cell-Autonomous Mechanisms in
    Radial Projection Neuron Migration in the Developing Cerebral Cortex.” <i>Frontiers
    in Cell and Developmental Biology</i>, vol. 8, no. 9, 574382, Frontiers, 2020,
    doi:<a href="https://doi.org/10.3389/fcell.2020.574382">10.3389/fcell.2020.574382</a>.
  short: A.H. Hansen, S. Hippenmeyer, Frontiers in Cell and Developmental Biology
    8 (2020).
corr_author: '1'
date_created: 2020-09-26T06:11:07Z
date_published: 2020-09-25T00:00:00Z
date_updated: 2026-04-28T22:30:42Z
day: '25'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.3389/fcell.2020.574382
ec_funded: 1
external_id:
  isi:
  - '000577915900001'
  pmid:
  - '33102480'
file:
- access_level: open_access
  checksum: 01f731824194c94c81a5da360d997073
  content_type: application/pdf
  creator: dernst
  date_created: 2020-09-28T13:11:17Z
  date_updated: 2020-09-28T13:11:17Z
  file_id: '8584'
  file_name: 2020_Frontiers_Hansen.pdf
  file_size: 5527139
  relation: main_file
  success: 1
file_date_updated: 2020-09-28T13:11:17Z
has_accepted_license: '1'
intvolume: '         8'
isi: 1
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 2625A13E-B435-11E9-9278-68D0E5697425
  grant_number: '24812'
  name: Molecular mechanisms of radial neuronal migration
- _id: 25D61E48-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '618444'
  name: Molecular Mechanisms of Cerebral Cortex Development
publication: Frontiers in Cell and Developmental Biology
publication_identifier:
  issn:
  - 2296-634X
publication_status: published
publisher: Frontiers
quality_controlled: '1'
related_material:
  record:
  - id: '9962'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Non-cell-autonomous mechanisms in radial projection neuron migration in the
  developing cerebral cortex
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 8
year: '2020'
...
---
OA_place: publisher
_id: '8340'
abstract:
- lang: eng
  text: Mitochondria are sites of oxidative phosphorylation in eukaryotic cells. Oxidative
    phosphorylation operates by a chemiosmotic mechanism made possible by redox-driven
    proton pumping machines which establish a proton motive force across the inner
    mitochondrial membrane. This electrochemical proton gradient is used to drive
    ATP synthesis, which powers the majority of cellular processes such as protein
    synthesis, locomotion and signalling. In this thesis I investigate the structures
    and molecular mechanisms of two inner mitochondrial proton pumping enzymes, respiratory
    complex I and transhydrogenase. I present the first high-resolution structure
    of the full transhydrogenase from any species, and a significantly improved structure
    of complex I. Improving the resolution from 3.3 Å available previously to up to
    2.3 Å in this thesis allowed us to model bound water molecules, crucial in the
    proton pumping mechanism. For both enzymes, up to five cryo-EM datasets with different
    substrates and inhibitors bound were solved to delineate the catalytic cycle and
    understand the proton pumping mechanism. In transhydrogenase, the proton channel
    is gated by reversible detachment of the NADP(H)-binding domain which opens the
    proton channel to the opposite sites of the membrane. In complex I, the proton
    channels are gated by reversible protonation of key glutamate and lysine residues
    and breaking of the water wire connecting the proton pumps with the quinone reduction
    site. The tight coupling between the redox and the proton pumping reactions in
    transhydrogenase is achieved by controlling the NADP(H) exchange which can only
    happen when the NADP(H)-binding domain interacts with the membrane domain. In
    complex I, coupling is achieved by cycling of the whole complex between the closed
    state, in which quinone can get reduced, and the open state, in which NADH can
    induce quinol ejection from the binding pocket. On the basis of these results
    I propose detailed mechanisms for catalytic cycles of transhydrogenase and complex
    I that are consistent with a large amount of previous work. In both enzymes, conformational
    and electrostatic mechanisms contribute to the overall catalytic process. Results
    presented here could be used for better understanding of the human pathologies
    arising from deficiencies of complex I or transhydrogenase and could be used to
    develop novel therapies.
acknowledged_ssus:
- _id: EM-Fac
acknowledgement: 'I acknowledge the support of IST facilities, especially the Electron
  Miscroscopy facility for providing training and resources. Special thanks also go
  to cryo-EM specialists who helped me to collect the data present here: Dr Valentin
  Hodirnau (IST Austria), Dr Tom Heuser (IMBA, Vienna), Dr Rebecca Thompson (Uni.
  of Leeds) and Dr Jirka Nováček (CEITEC). This work has been supported by iNEXT,
  project number 653706, funded by the Horizon 2020 programme of the European Union.
  This project has received funding from the European Union’s Horizon 2020 research
  and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Domen
  full_name: Kampjut, Domen
  id: 37233050-F248-11E8-B48F-1D18A9856A87
  last_name: Kampjut
  orcid: 0000-0002-6018-3422
citation:
  ama: Kampjut D. Molecular mechanisms of mitochondrial redox-coupled proton pumping
    enzymes. 2020. doi:<a href="https://doi.org/10.15479/AT:ISTA:8340">10.15479/AT:ISTA:8340</a>
  apa: Kampjut, D. (2020). <i>Molecular mechanisms of mitochondrial redox-coupled
    proton pumping enzymes</i>. Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:8340">https://doi.org/10.15479/AT:ISTA:8340</a>
  chicago: Kampjut, Domen. “Molecular Mechanisms of Mitochondrial Redox-Coupled Proton
    Pumping Enzymes.” Institute of Science and Technology Austria, 2020. <a href="https://doi.org/10.15479/AT:ISTA:8340">https://doi.org/10.15479/AT:ISTA:8340</a>.
  ieee: D. Kampjut, “Molecular mechanisms of mitochondrial redox-coupled proton pumping
    enzymes,” Institute of Science and Technology Austria, 2020.
  ista: Kampjut D. 2020. Molecular mechanisms of mitochondrial redox-coupled proton
    pumping enzymes. Institute of Science and Technology Austria.
  mla: Kampjut, Domen. <i>Molecular Mechanisms of Mitochondrial Redox-Coupled Proton
    Pumping Enzymes</i>. Institute of Science and Technology Austria, 2020, doi:<a
    href="https://doi.org/10.15479/AT:ISTA:8340">10.15479/AT:ISTA:8340</a>.
  short: D. Kampjut, Molecular Mechanisms of Mitochondrial Redox-Coupled Proton Pumping
    Enzymes, Institute of Science and Technology Austria, 2020.
corr_author: '1'
date_created: 2020-09-07T18:42:23Z
date_published: 2020-09-09T00:00:00Z
date_updated: 2026-04-08T07:43:58Z
day: '09'
ddc:
- '572'
degree_awarded: PhD
department:
- _id: LeSa
doi: 10.15479/AT:ISTA:8340
ec_funded: 1
file:
- access_level: closed
  checksum: dd270baf82121eb4472ad19d77bf227c
  content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
  creator: dkampjut
  date_created: 2020-09-08T13:32:06Z
  date_updated: 2021-09-11T22:30:04Z
  embargo_to: open_access
  file_id: '8345'
  file_name: ThesisFull20200908.docx
  file_size: 166146359
  relation: source_file
- access_level: open_access
  checksum: 82fce6f95ffa47ecc4ebca67ea2cc38c
  content_type: application/pdf
  creator: dernst
  date_created: 2020-09-14T15:02:20Z
  date_updated: 2021-09-11T22:30:04Z
  embargo: 2021-09-10
  file_id: '8393'
  file_name: 2020_Thesis_Kampjut.pdf
  file_size: 13873769
  relation: main_file
file_date_updated: 2021-09-11T22:30:04Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: None
page: '242'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
publication_identifier:
  isbn:
  - 978-3-99078-008-4
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '6848'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Leonid A
  full_name: Sazanov, Leonid A
  id: 338D39FE-F248-11E8-B48F-1D18A9856A87
  last_name: Sazanov
  orcid: 0000-0002-0977-7989
title: Molecular mechanisms of mitochondrial redox-coupled proton pumping enzymes
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
OA_place: publisher
_id: '8620'
abstract:
- lang: eng
  text: "The development of the human brain occurs through a tightly regulated series
    of dynamic and adaptive processes during prenatal and postnatal life. A disruption
    of this strictly orchestrated series of events can lead to a number of neurodevelopmental
    conditions, including Autism Spectrum Disorders (ASDs). ASDs are a very common,
    etiologically and phenotypically heterogeneous group of disorders sharing the
    core symptoms of social interaction and communication deficits and restrictive
    and repetitive interests and behaviors. They are estimated to affect one in 59
    individuals in the U.S. and, over the last three decades, mutations in more than
    a hundred genetic loci have been convincingly linked to ASD pathogenesis. Yet,
    for the vast majority of these ASD-risk genes their role during brain development
    and precise molecular function still remain elusive.\r\nDe novo loss of function
    mutations in the ubiquitin ligase-encoding gene Cullin 3 (CUL3) lead to ASD. In
    the study described here, we used Cul3 mouse models to evaluate the consequences
    of Cul3 mutations in vivo. Our results show that Cul3 heterozygous knockout mice
    exhibit deficits in motor coordination as well as ASD-relevant social and cognitive
    impairments. Cul3+/-, Cul3+/fl Emx1-Cre and Cul3fl/fl Emx1-Cre mutant brains display
    cortical lamination abnormalities due to defective migration of post-mitotic excitatory
    neurons, as well as reduced numbers of excitatory and inhibitory neurons. In line
    with the observed abnormal cortical organization, Cul3 heterozygous deletion is
    associated with decreased spontaneous excitatory and inhibitory activity in the
    cortex. At the molecular level we show that Cul3 regulates cytoskeletal and adhesion
    protein abundance in the mouse embryonic cortex. Abnormal regulation of cytoskeletal
    proteins in Cul3 mutant neural cells results in atypical organization of the actin
    mesh at the cell leading edge. Of note, heterozygous deletion of Cul3 in adult
    mice does not induce the majority of the behavioral defects observed in constitutive
    Cul3 haploinsufficient animals, pointing to a critical time-window for Cul3 deficiency.\r\nIn
    conclusion, our data indicate that Cul3 plays a critical role in the regulation
    of cytoskeletal proteins and neuronal migration. ASD-associated defects and behavioral
    abnormalities are primarily due to dosage sensitive Cul3 functions at early brain
    developmental stages."
acknowledged_ssus:
- _id: Bio
- _id: PreCl
acknowledgement: I would like to especially thank Armel Nicolas from the Proteomics
  and Christoph Sommer from the Bioimaging Facilities for the data analysis, and to
  thank the team of the Preclinical Facility, especially Sabina Deixler, Angela Schlerka,
  Anita Lepold, Mihalea Mihai and Michael Schun for taking care of the mouse line
  maintenance and their great support.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Jasmin
  full_name: Morandell, Jasmin
  id: 4739D480-F248-11E8-B48F-1D18A9856A87
  last_name: Morandell
citation:
  ama: Morandell J. Illuminating the role of Cul3 in autism spectrum disorder pathogenesis.
    2020. doi:<a href="https://doi.org/10.15479/AT:ISTA:8620">10.15479/AT:ISTA:8620</a>
  apa: Morandell, J. (2020). <i>Illuminating the role of Cul3 in autism spectrum disorder
    pathogenesis</i>. Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:8620">https://doi.org/10.15479/AT:ISTA:8620</a>
  chicago: Morandell, Jasmin. “Illuminating the Role of Cul3 in Autism Spectrum Disorder
    Pathogenesis.” Institute of Science and Technology Austria, 2020. <a href="https://doi.org/10.15479/AT:ISTA:8620">https://doi.org/10.15479/AT:ISTA:8620</a>.
  ieee: J. Morandell, “Illuminating the role of Cul3 in autism spectrum disorder pathogenesis,”
    Institute of Science and Technology Austria, 2020.
  ista: Morandell J. 2020. Illuminating the role of Cul3 in autism spectrum disorder
    pathogenesis. Institute of Science and Technology Austria.
  mla: Morandell, Jasmin. <i>Illuminating the Role of Cul3 in Autism Spectrum Disorder
    Pathogenesis</i>. Institute of Science and Technology Austria, 2020, doi:<a href="https://doi.org/10.15479/AT:ISTA:8620">10.15479/AT:ISTA:8620</a>.
  short: J. Morandell, Illuminating the Role of Cul3 in Autism Spectrum Disorder Pathogenesis,
    Institute of Science and Technology Austria, 2020.
corr_author: '1'
date_created: 2020-10-07T14:53:13Z
date_published: 2020-10-12T00:00:00Z
date_updated: 2026-04-14T09:07:16Z
day: '12'
ddc:
- '610'
degree_awarded: PhD
department:
- _id: GaNo
doi: 10.15479/AT:ISTA:8620
file:
- access_level: open_access
  checksum: 7ee83e42de3e5ce2fedb44dff472f75f
  content_type: application/pdf
  creator: jmorande
  date_created: 2020-10-07T14:41:49Z
  date_updated: 2021-10-16T22:30:04Z
  embargo: 2021-10-15
  file_id: '8621'
  file_name: Jasmin_Morandell_Thesis-2020_final.pdf
  file_size: 16155786
  relation: main_file
- access_level: closed
  checksum: 5e0464af453734210ce7aab7b4a92e3a
  content_type: application/x-zip-compressed
  creator: jmorande
  date_created: 2020-10-07T14:45:07Z
  date_updated: 2021-10-16T22:30:04Z
  embargo_to: open_access
  file_id: '8622'
  file_name: Jasmin_Morandell_Thesis-2020_final.zip
  file_size: 24344152
  relation: source_file
file_date_updated: 2021-10-16T22:30:04Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '138'
project:
- _id: 2548AE96-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: W1232
  name: Molecular Drug Targets
- _id: 05A0D778-7A3F-11EA-A408-12923DDC885E
  grant_number: F7807
  name: Stem Cell Modulation in Neural Development and Regeneration/ P07-Neural stem
    cells in autism and epilepsy
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '7800'
    relation: part_of_dissertation
    status: public
  - id: '8131'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Gaia
  full_name: Novarino, Gaia
  id: 3E57A680-F248-11E8-B48F-1D18A9856A87
  last_name: Novarino
  orcid: 0000-0002-7673-7178
title: Illuminating the role of Cul3 in autism spectrum disorder pathogenesis
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...
---
_id: '7810'
abstract:
- lang: eng
  text: "Interprocedural data-flow analyses form an expressive and useful paradigm
    of numerous static analysis applications, such as live variables analysis, alias
    analysis and null pointers analysis. The most widely-used framework for interprocedural
    data-flow analysis is IFDS, which encompasses distributive data-flow functions
    over a finite domain. On-demand data-flow analyses restrict the focus of the analysis
    on specific program locations and data facts. This setting provides a natural
    split between (i) an offline (or preprocessing) phase, where the program is partially
    analyzed and analysis summaries are created, and (ii) an online (or query) phase,
    where analysis queries arrive on demand and the summaries are used to speed up
    answering queries.\r\nIn this work, we consider on-demand IFDS analyses where
    the queries concern program locations of the same procedure (aka same-context
    queries). We exploit the fact that flow graphs of programs have low treewidth
    to develop faster algorithms that are space and time optimal for many common data-flow
    analyses, in both the preprocessing and the query phase. We also use treewidth
    to develop query solutions that are embarrassingly parallelizable, i.e. the total
    work for answering each query is split to a number of threads such that each thread
    performs only a constant amount of work. Finally, we implement a static analyzer
    based on our algorithms, and perform a series of on-demand analysis experiments
    on standard benchmarks. Our experimental results show a drastic speed-up of the
    queries after only a lightweight preprocessing phase, which significantly outperforms
    existing techniques."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
  full_name: Goharshady, Amir Kafshdar
  id: 391365CE-F248-11E8-B48F-1D18A9856A87
  last_name: Goharshady
  orcid: 0000-0003-1702-6584
- first_name: Rasmus
  full_name: Ibsen-Jensen, Rasmus
  id: 3B699956-F248-11E8-B48F-1D18A9856A87
  last_name: Ibsen-Jensen
  orcid: 0000-0003-4783-0389
- first_name: Andreas
  full_name: Pavlogiannis, Andreas
  id: 49704004-F248-11E8-B48F-1D18A9856A87
  last_name: Pavlogiannis
  orcid: 0000-0002-8943-0722
citation:
  ama: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Optimal and perfectly
    parallel algorithms for on-demand data-flow analysis. In: <i>European Symposium
    on Programming</i>. Vol 12075. Springer Nature; 2020:112-140. doi:<a href="https://doi.org/10.1007/978-3-030-44914-8_5">10.1007/978-3-030-44914-8_5</a>'
  apa: 'Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &#38; Pavlogiannis, A.
    (2020). Optimal and perfectly parallel algorithms for on-demand data-flow analysis.
    In <i>European Symposium on Programming</i> (Vol. 12075, pp. 112–140). Dublin,
    Ireland: Springer Nature. <a href="https://doi.org/10.1007/978-3-030-44914-8_5">https://doi.org/10.1007/978-3-030-44914-8_5</a>'
  chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen,
    and Andreas Pavlogiannis. “Optimal and Perfectly Parallel Algorithms for On-Demand
    Data-Flow Analysis.” In <i>European Symposium on Programming</i>, 12075:112–40.
    Springer Nature, 2020. <a href="https://doi.org/10.1007/978-3-030-44914-8_5">https://doi.org/10.1007/978-3-030-44914-8_5</a>.
  ieee: K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal
    and perfectly parallel algorithms for on-demand data-flow analysis,” in <i>European
    Symposium on Programming</i>, Dublin, Ireland, 2020, vol. 12075, pp. 112–140.
  ista: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2020. Optimal
    and perfectly parallel algorithms for on-demand data-flow analysis. European Symposium
    on Programming. ESOP: Programming Languages and Systems, LNCS, vol. 12075, 112–140.'
  mla: Chatterjee, Krishnendu, et al. “Optimal and Perfectly Parallel Algorithms for
    On-Demand Data-Flow Analysis.” <i>European Symposium on Programming</i>, vol.
    12075, Springer Nature, 2020, pp. 112–40, doi:<a href="https://doi.org/10.1007/978-3-030-44914-8_5">10.1007/978-3-030-44914-8_5</a>.
  short: K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, European
    Symposium on Programming, Springer Nature, 2020, pp. 112–140.
conference:
  end_date: 2020-04-30
  location: Dublin, Ireland
  name: 'ESOP: Programming Languages and Systems'
  start_date: 2020-04-25
corr_author: '1'
date_created: 2020-05-10T22:00:50Z
date_published: 2020-04-18T00:00:00Z
date_updated: 2026-04-28T22:31:04Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-030-44914-8_5
external_id:
  isi:
  - '000681656800005'
file:
- access_level: open_access
  checksum: 8618b80f4cf7b39a60e61a6445ad9807
  content_type: application/pdf
  creator: dernst
  date_created: 2020-05-26T13:34:48Z
  date_updated: 2020-07-14T12:48:03Z
  file_id: '7895'
  file_name: 2020_LNCS_Chatterjee.pdf
  file_size: 651250
  relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
intvolume: '     12075'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 112-140
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
  grant_number: ICT15-003
  name: Efficient Algorithms for Computer Aided Verification
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
  name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
    Contracts
- _id: 267066CE-B435-11E9-9278-68D0E5697425
  name: Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies
publication: European Symposium on Programming
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783030449131'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '8934'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Optimal and perfectly parallel algorithms for on-demand data-flow analysis
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12075
year: '2020'
...
---
_id: '8728'
abstract:
- lang: eng
  text: Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are
    two standard formalisms in system analysis. Their main associated quantitative
    objectives are hitting probabilities, discounted sum, and mean payoff. Although
    there are many techniques for computing these objectives in general MCs/MDPs,
    they have not been thoroughly studied in terms of parameterized algorithms, particularly
    when treewidth is used as the parameter. This is in sharp contrast to qualitative
    objectives for MCs, MDPs and graph games, for which treewidth-based algorithms
    yield significant complexity improvements. In this work, we show that treewidth
    can also be used to obtain faster algorithms for the quantitative problems. For
    an MC with n states and m transitions, we show that each of the classical quantitative
    objectives can be computed in   O((n+m)⋅t2)  time, given a tree decomposition
    of the MC with width t. Our results also imply a bound of   O(κ⋅(n+m)⋅t2)  for
    each objective on MDPs, where   κ  is the number of strategy-iteration refinements
    required for the given input and objective. Finally, we make an experimental evaluation
    of our new algorithms on low-treewidth MCs and MDPs obtained from the DaCapo benchmark
    suite. Our experiments show that on low-treewidth MCs and MDPs, our algorithms
    outperform existing well-established methods by one or more orders of magnitude.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ali
  full_name: Asadi, Ali
  last_name: Asadi
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
  full_name: Goharshady, Amir Kafshdar
  id: 391365CE-F248-11E8-B48F-1D18A9856A87
  last_name: Goharshady
  orcid: 0000-0003-1702-6584
- first_name: Kiarash
  full_name: Mohammadi, Kiarash
  last_name: Mohammadi
- first_name: Andreas
  full_name: Pavlogiannis, Andreas
  id: 49704004-F248-11E8-B48F-1D18A9856A87
  last_name: Pavlogiannis
  orcid: 0000-0002-8943-0722
citation:
  ama: 'Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. Faster
    algorithms for quantitative analysis of MCs and MDPs with small treewidth. In:
    <i>Automated Technology for Verification and Analysis</i>. Vol 12302. Springer
    Nature; 2020:253-270. doi:<a href="https://doi.org/10.1007/978-3-030-59152-6_14">10.1007/978-3-030-59152-6_14</a>'
  apa: 'Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., &#38; Pavlogiannis,
    A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small
    treewidth. In <i>Automated Technology for Verification and Analysis</i> (Vol.
    12302, pp. 253–270). Hanoi, Vietnam: Springer Nature. <a href="https://doi.org/10.1007/978-3-030-59152-6_14">https://doi.org/10.1007/978-3-030-59152-6_14</a>'
  chicago: Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi,
    and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs
    and MDPs with Small Treewidth.” In <i>Automated Technology for Verification and
    Analysis</i>, 12302:253–70. Springer Nature, 2020. <a href="https://doi.org/10.1007/978-3-030-59152-6_14">https://doi.org/10.1007/978-3-030-59152-6_14</a>.
  ieee: A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi, and A. Pavlogiannis,
    “Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth,”
    in <i>Automated Technology for Verification and Analysis</i>, Hanoi, Vietnam,
    2020, vol. 12302, pp. 253–270.
  ista: 'Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. 2020.
    Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth.
    Automated Technology for Verification and Analysis. ATVA: Automated Technology
    for Verification and Analysis, LNCS, vol. 12302, 253–270.'
  mla: Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and
    MDPs with Small Treewidth.” <i>Automated Technology for Verification and Analysis</i>,
    vol. 12302, Springer Nature, 2020, pp. 253–70, doi:<a href="https://doi.org/10.1007/978-3-030-59152-6_14">10.1007/978-3-030-59152-6_14</a>.
  short: A. Asadi, K. Chatterjee, A.K. Goharshady, K. Mohammadi, A. Pavlogiannis,
    in:, Automated Technology for Verification and Analysis, Springer Nature, 2020,
    pp. 253–270.
conference:
  end_date: 2020-10-23
  location: Hanoi, Vietnam
  name: 'ATVA: Automated Technology for Verification and Analysis'
  start_date: 2020-10-19
date_created: 2020-11-06T07:30:05Z
date_published: 2020-10-12T00:00:00Z
date_updated: 2026-04-28T22:31:04Z
day: '12'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-030-59152-6_14
external_id:
  isi:
  - '000723555700014'
file:
- access_level: open_access
  checksum: ae83f27e5b189d5abc2e7514f1b7e1b5
  content_type: application/pdf
  creator: dernst
  date_created: 2020-11-06T07:41:03Z
  date_updated: 2020-11-06T07:41:03Z
  file_id: '8729'
  file_name: 2020_LNCS_ATVA_Asadi_accepted.pdf
  file_size: 726648
  relation: main_file
  success: 1
file_date_updated: 2020-11-06T07:41:03Z
has_accepted_license: '1'
intvolume: '     12302'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 253-270
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
  grant_number: ICT15-003
  name: Efficient Algorithms for Computer Aided Verification
- _id: 267066CE-B435-11E9-9278-68D0E5697425
  name: Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies
publication: Automated Technology for Verification and Analysis
publication_identifier:
  eisbn:
  - '9783030591526'
  eissn:
  - 1611-3349
  isbn:
  - '9783030591519'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '8934'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 12302
year: '2020'
...
---
_id: '11505'
abstract:
- lang: eng
  text: "Contact. This paper presents the results obtained with the Multi-Unit Spectroscopic
    Explorer (MUSE) at the ESO Very Large Telescope on the faint end of the Lyman-alpha
    luminosity function (LF) based on deep observations of four lensing clusters.
    The goal of our project is to set strong constraints on the relative contribution
    of the Lyman-alpha emitter (LAE) population to cosmic reionization.\r\n\r\nAims.
    The precise aim of the present study is to further constrain the abundance of
    LAEs by taking advantage of the magnification provided by lensing clusters to
    build a blindly selected sample of galaxies which is less biased than current
    blank field samples in redshift and luminosity. By construction, this sample of
    LAEs is complementary to those built from deep blank fields, whether observed
    by MUSE or by other facilities, and makes it possible to determine the shape of
    the LF at fainter levels, as well as its evolution with redshift.\r\n\r\nMethods.
    We selected a sample of 156 LAEs with redshifts between 2.9 ≤ z ≤ 6.7 and magnification-corrected
    luminosities in the range 39 ≲ log LLyα [erg s−1] ≲43. To properly take into account
    the individual differences in detection conditions between the LAEs when computing
    the LF, including lensing configurations, and spatial and spectral morphologies,
    the non-parametric 1/Vmax method was adopted. The price to pay to benefit from
    magnification is a reduction of the effective volume of the survey, together with
    a more complex analysis procedure to properly determine the effective volume Vmax
    for each galaxy. In this paper we present a complete procedure for the determination
    of the LF based on IFU detections in lensing clusters. This procedure, including
    some new methods for masking, effective volume integration and (individual) completeness
    determinations, has been fully automated when possible, and it can be easily generalized
    to the analysis of IFU observations in blank fields.\r\n\r\nResults. As a result
    of this analysis, the Lyman-alpha LF has been obtained in four different redshift
    bins: 2.9 <  z <  6, 7, 2.9 <  z <  4.0, 4.0 <  z <  5.0, and 5.0 <  z <  6.7
    with constraints down to log LLyα = 40.5. From our data only, no significant evolution
    of LF mean slope can be found. When performing a Schechter analysis also including
    data from the literature to complete the present sample towards the brightest
    luminosities, a steep faint end slope was measured varying from α = −1.69−0.08+0.08
    to α = −1.87−0.12+0.12 between the lowest and the highest redshift bins.\r\n\r\nConclusions.
    The contribution of the LAE population to the star formation rate density at z ∼ 6
    is ≲50% depending on the luminosity limit considered, which is of the same order
    as the Lyman-break galaxy (LBG) contribution. The evolution of the LAE contribution
    with redshift depends on the assumed escape fraction of Lyman-alpha photons, and
    appears to slightly increase with increasing redshift when this fraction is conservatively
    set to one. Depending on the intersection between the LAE/LBG populations, the
    contribution of the observed galaxies to the ionizing flux may suffice to keep
    the universe ionized at z ∼ 6."
acknowledgement: We thank the anonymous referee for their critical review and useful
  suggestions. This work has been carried out thanks to the support of the OCEVU Labex
  (ANR-11-LABX-0060) and the A*MIDEX project (ANR-11-IDEX-0001-02) funded by the “Investissements
  d’Avenir” French government programme managed by the ANR. Partially funded by the
  ERC starting grant CALENDS (JR, VP, BC, JM), the Agence Nationale de la recherche
  bearing the reference ANR-13-BS05-0010-02 (FOGHAR), and the “Programme National
  de Cosmologie and Galaxies” (PNCG) of CNRS/INSU, France. GdV, RP, JR, GM, JM, BC,
  and VP also acknowledge support by the Programa de Cooperacion Cientifica – ECOS
  SUD Program C16U02. NL acknowledges funding from the European Research Council (ERC)
  under the European Union’s Horizon 2020 research and innovation programme (grant
  agreement No 669253), ABD acknowledges support from the ERC advanced grant “Cosmic
  Gas”. LW acknowledges support by the Competitive Fund of the Leibniz Association
  through grant SAW-2015-AIP-2, and TG acknowledges support from the European Research
  Council under grant agreement ERC-stg-757258 (TRIPLE).. Based on observations made
  with ESO Telescopes at the La Silla Paranal Observatory under programme IDs 060.A-9345,
  094.A-0115, 095.A-0181, 096.A-0710, 097.A0269, 100.A-0249, and 294.A-5032. Also
  based on observations obtained with the NASA/ESA Hubble Space Telescope, retrieved
  from the Mikulski Archive for Space Telescopes (MAST) at the Space Telescope Science
  Institute (STScI). STScI is operated by the Association of Universities for Research
  in Astronomy, Inc. under NASA contract NAS 5-26555. This research made use of Astropy,
  a community-developed core Python package for Astronomy (Astropy Collaboration 2013).
  All plots in this paper were created using Matplotlib (Hunter 2007).
article_number: A3
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: G.
  full_name: de La Vieuville, G.
  last_name: de La Vieuville
- first_name: D.
  full_name: Bina, D.
  last_name: Bina
- first_name: R.
  full_name: Pello, R.
  last_name: Pello
- first_name: G.
  full_name: Mahler, G.
  last_name: Mahler
- first_name: J.
  full_name: Richard, J.
  last_name: Richard
- first_name: A. B.
  full_name: Drake, A. B.
  last_name: Drake
- first_name: E. C.
  full_name: Herenz, E. C.
  last_name: Herenz
- first_name: F. E.
  full_name: Bauer, F. E.
  last_name: Bauer
- first_name: B.
  full_name: Clément, B.
  last_name: Clément
- first_name: D.
  full_name: Lagattuta, D.
  last_name: Lagattuta
- first_name: N.
  full_name: Laporte, N.
  last_name: Laporte
- first_name: J.
  full_name: Martinez, J.
  last_name: Martinez
- first_name: V.
  full_name: Patrício, V.
  last_name: Patrício
- first_name: L.
  full_name: Wisotzki, L.
  last_name: Wisotzki
- first_name: J.
  full_name: Zabl, J.
  last_name: Zabl
- first_name: R. J.
  full_name: Bouwens, R. J.
  last_name: Bouwens
- first_name: T.
  full_name: Contini, T.
  last_name: Contini
- first_name: T.
  full_name: Garel, T.
  last_name: Garel
- first_name: B.
  full_name: Guiderdoni, B.
  last_name: Guiderdoni
- first_name: R. A.
  full_name: Marino, R. A.
  last_name: Marino
- first_name: M. V.
  full_name: Maseda, M. V.
  last_name: Maseda
- first_name: Jorryt J
  full_name: Matthee, Jorryt J
  id: 7439a258-f3c0-11ec-9501-9df22fe06720
  last_name: Matthee
  orcid: 0000-0003-2871-127X
- first_name: J.
  full_name: Schaye, J.
  last_name: Schaye
- first_name: G.
  full_name: Soucail, G.
  last_name: Soucail
citation:
  ama: de La Vieuville G, Bina D, Pello R, et al. Faint end of the z ∼ 3–7 luminosity
    function of Lyman-alpha emitters behind lensing clusters observed with MUSE. <i>Astronomy
    &#38; Astrophysics</i>. 2019;628. doi:<a href="https://doi.org/10.1051/0004-6361/201834471">10.1051/0004-6361/201834471</a>
  apa: de La Vieuville, G., Bina, D., Pello, R., Mahler, G., Richard, J., Drake, A.
    B., … Soucail, G. (2019). Faint end of the z ∼ 3–7 luminosity function of Lyman-alpha
    emitters behind lensing clusters observed with MUSE. <i>Astronomy &#38; Astrophysics</i>.
    EDP Sciences. <a href="https://doi.org/10.1051/0004-6361/201834471">https://doi.org/10.1051/0004-6361/201834471</a>
  chicago: La Vieuville, G. de, D. Bina, R. Pello, G. Mahler, J. Richard, A. B. Drake,
    E. C. Herenz, et al. “Faint End of the z ∼ 3–7 Luminosity Function of Lyman-Alpha
    Emitters behind Lensing Clusters Observed with MUSE.” <i>Astronomy &#38; Astrophysics</i>.
    EDP Sciences, 2019. <a href="https://doi.org/10.1051/0004-6361/201834471">https://doi.org/10.1051/0004-6361/201834471</a>.
  ieee: G. de La Vieuville <i>et al.</i>, “Faint end of the z ∼ 3–7 luminosity function
    of Lyman-alpha emitters behind lensing clusters observed with MUSE,” <i>Astronomy
    &#38; Astrophysics</i>, vol. 628. EDP Sciences, 2019.
  ista: de La Vieuville G, Bina D, Pello R, Mahler G, Richard J, Drake AB, Herenz
    EC, Bauer FE, Clément B, Lagattuta D, Laporte N, Martinez J, Patrício V, Wisotzki
    L, Zabl J, Bouwens RJ, Contini T, Garel T, Guiderdoni B, Marino RA, Maseda MV,
    Matthee JJ, Schaye J, Soucail G. 2019. Faint end of the z ∼ 3–7 luminosity function
    of Lyman-alpha emitters behind lensing clusters observed with MUSE. Astronomy
    &#38; Astrophysics. 628, A3.
  mla: de La Vieuville, G., et al. “Faint End of the z ∼ 3–7 Luminosity Function of
    Lyman-Alpha Emitters behind Lensing Clusters Observed with MUSE.” <i>Astronomy
    &#38; Astrophysics</i>, vol. 628, A3, EDP Sciences, 2019, doi:<a href="https://doi.org/10.1051/0004-6361/201834471">10.1051/0004-6361/201834471</a>.
  short: G. de La Vieuville, D. Bina, R. Pello, G. Mahler, J. Richard, A.B. Drake,
    E.C. Herenz, F.E. Bauer, B. Clément, D. Lagattuta, N. Laporte, J. Martinez, V.
    Patrício, L. Wisotzki, J. Zabl, R.J. Bouwens, T. Contini, T. Garel, B. Guiderdoni,
    R.A. Marino, M.V. Maseda, J.J. Matthee, J. Schaye, G. Soucail, Astronomy &#38;
    Astrophysics 628 (2019).
date_created: 2022-07-06T10:09:36Z
date_published: 2019-07-25T00:00:00Z
date_updated: 2022-07-19T09:36:31Z
day: '25'
doi: 10.1051/0004-6361/201834471
extern: '1'
external_id:
  arxiv:
  - '1905.13696'
intvolume: '       628'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'gravitational lensing: strong / galaxies: high-redshift / dark ages'
- reionization
- 'first stars / galaxies: clusters: general / galaxies: luminosity function'
- mass function
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1905.13696
month: '07'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
  eissn:
  - 1432-0746
  issn:
  - 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faint end of the z ∼ 3–7 luminosity function of Lyman-alpha emitters behind
  lensing clusters observed with MUSE
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 628
year: '2019'
...
---
_id: '11514'
abstract:
- lang: eng
  text: We discuss the nature and physical properties of gas-mass selected galaxies
    in the ALMA spectroscopic survey (ASPECS) of the Hubble Ultra Deep Field (HUDF).
    We capitalize on the deep optical integral-field spectroscopy from the Multi Unit
    Spectroscopic Explorer (MUSE) HUDF Survey and multiwavelength data to uniquely
    associate all 16 line emitters, detected in the ALMA data without preselection,
    with rotational transitions of carbon monoxide (CO). We identify 10 as CO(2–1)
    at 1 < z < 2, 5 as CO(3–2) at 2 < z < 3, and 1 as CO(4–3) at z = 3.6. Using the
    MUSE data as a prior, we identify two additional CO(2–1) emitters, increasing
    the total sample size to 18. We infer metallicities consistent with (super-)solar
    for the CO-detected galaxies at z ≤ 1.5, motivating our choice of a Galactic conversion
    factor between CO luminosity and molecular gas mass for these galaxies. Using
    deep Chandra imaging of the HUDF, we determine an X-ray AGN fraction of 20% and
    60% among the CO emitters at z ∼ 1.4 and z ∼ 2.6, respectively. Being a CO-flux-limited
    survey, ASPECS-LP detects molecular gas in galaxies on, above, and below the main
    sequence (MS) at z ∼ 1.4. For stellar masses ≥1010 (1010.5) ${M}_{\odot }$, we
    detect about 40% (50%) of all galaxies in the HUDF at 1 < z < 2 (2 < z < 3). The
    combination of ALMA and MUSE integral-field spectroscopy thus enables an unprecedented
    view of MS galaxies during the peak of galaxy formation.
acknowledgement: "We are grateful to the referee for providing a constructive report.
  L.A.B. wants to thank Madusha L.P. Gunawardhana for her help with platefit. Based
  on observations collected at the European Southern Observatory under ESO programme(s):
  094.A-2089(B), 095.A-0010(A), 096.A-0045(A), and 096.A-0045(B). This paper makes
  use of the following ALMA data: ADS/JAO.ALMA#2016.1.00324.L. ALMA is a partnership
  of ESO (representing its member states), NSF (USA) and NINS (Japan), together with
  NRC (Canada), NSC and ASIAA (Taiwan), and KASI (Republic of Korea), in cooperation
  with the Republic of Chile. The Joint ALMA Observatory is operated by ESO, AUI/NRAO,
  and NAOJ. The National Radio Astronomy Observatory is a facility of the National
  Science Foundation operated under cooperative agreement by Associated Universities,
  Inc.\r\n\r\n\"Este trabajo contó con el apoyo de CONICYT+Programa de Astronomía+
  Fondo CHINA-CONICYT\" J.G-L. acknowledges partial support from ALMA-CONICYT project
  31160033. F.E.B. acknowledges support from CONICYT grant Basal AFB-170002 (FEB),
  and the Ministry of Economy, Development, and Tourism's Millennium Science Initiative
  through grant IC120009, awarded to The Millennium Institute of Astrophysics, MAS
  (FEB). J.B. acknowledges support by Fundação para a Ciência e a Tecnologia (FCT)
  through national funds (UID/FIS/04434/2013) and Investigador FCT contract IF/01654/2014/CP1215/CT0003.,
  and by FEDER through COMPETE2020 (POCI-01-0145-FEDER-007672). T.D-S. acknowledges
  support from ALMA-CONYCIT project 31130005 and FONDECYT project 1151239. J.H. acknowledges
  support of the VIDI research programme with project number 639.042.611, which is
  (partly) financed by the Netherlands Organization for Scientific Research (NWO).
  D.R. acknowledges support from the National Science Foundation under grant No. AST-1614213.
  I.R.S. acknowledges support from the ERC Advanced Grant DUSTYGAL (321334) and STFC
  (ST/P000541/1)\r\n\r\nWork on Gnuastro has been funded by the Japanese MEXT scholarship
  and its Grant-in-Aid for Scientific Research (21244012, 24253003), the ERC advanced
  grant 339659-MUSICOS, European Union's Horizon 2020 research and innovation programme
  under Marie Sklodowska-Curie grant agreement No. 721463 to the SUNDIAL ITN, and
  from the Spanish MINECO under grant No. AYA2016-76219-P."
article_number: '140'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Leindert A.
  full_name: Boogaard, Leindert A.
  last_name: Boogaard
- first_name: Roberto
  full_name: Decarli, Roberto
  last_name: Decarli
- first_name: Jorge
  full_name: González-López, Jorge
  last_name: González-López
- first_name: Paul
  full_name: van der Werf, Paul
  last_name: van der Werf
- first_name: Fabian
  full_name: Walter, Fabian
  last_name: Walter
- first_name: Rychard
  full_name: Bouwens, Rychard
  last_name: Bouwens
- first_name: Manuel
  full_name: Aravena, Manuel
  last_name: Aravena
- first_name: Chris
  full_name: Carilli, Chris
  last_name: Carilli
- first_name: Franz Erik
  full_name: Bauer, Franz Erik
  last_name: Bauer
- first_name: Jarle
  full_name: Brinchmann, Jarle
  last_name: Brinchmann
- first_name: Thierry
  full_name: Contini, Thierry
  last_name: Contini
- first_name: Pierre
  full_name: Cox, Pierre
  last_name: Cox
- first_name: Elisabete
  full_name: da Cunha, Elisabete
  last_name: da Cunha
- first_name: Emanuele
  full_name: Daddi, Emanuele
  last_name: Daddi
- first_name: Tanio
  full_name: Díaz-Santos, Tanio
  last_name: Díaz-Santos
- first_name: Jacqueline
  full_name: Hodge, Jacqueline
  last_name: Hodge
- first_name: Hanae
  full_name: Inami, Hanae
  last_name: Inami
- first_name: Rob
  full_name: Ivison, Rob
  last_name: Ivison
- first_name: Michael
  full_name: Maseda, Michael
  last_name: Maseda
- first_name: Jorryt J
  full_name: Matthee, Jorryt J
  id: 7439a258-f3c0-11ec-9501-9df22fe06720
  last_name: Matthee
  orcid: 0000-0003-2871-127X
- first_name: Pascal
  full_name: Oesch, Pascal
  last_name: Oesch
- first_name: Gergö
  full_name: Popping, Gergö
  last_name: Popping
- first_name: Dominik
  full_name: Riechers, Dominik
  last_name: Riechers
- first_name: Joop
  full_name: Schaye, Joop
  last_name: Schaye
- first_name: Sander
  full_name: Schouws, Sander
  last_name: Schouws
- first_name: Ian
  full_name: Smail, Ian
  last_name: Smail
- first_name: Axel
  full_name: Weiss, Axel
  last_name: Weiss
- first_name: Lutz
  full_name: Wisotzki, Lutz
  last_name: Wisotzki
- first_name: Roland
  full_name: Bacon, Roland
  last_name: Bacon
- first_name: Paulo C.
  full_name: Cortes, Paulo C.
  last_name: Cortes
- first_name: Hans-Walter
  full_name: Rix, Hans-Walter
  last_name: Rix
- first_name: Rachel S.
  full_name: Somerville, Rachel S.
  last_name: Somerville
- first_name: Mark
  full_name: Swinbank, Mark
  last_name: Swinbank
- first_name: Jeff
  full_name: Wagg, Jeff
  last_name: Wagg
citation:
  ama: 'Boogaard LA, Decarli R, González-López J, et al. The ALMA spectroscopic survey
    in the HUDF: Nature and physical properties of gas-mass selected galaxies using
    MUSE spectroscopy. <i>The Astrophysical Journal</i>. 2019;882(2). doi:<a href="https://doi.org/10.3847/1538-4357/ab3102">10.3847/1538-4357/ab3102</a>'
  apa: 'Boogaard, L. A., Decarli, R., González-López, J., van der Werf, P., Walter,
    F., Bouwens, R., … Wagg, J. (2019). The ALMA spectroscopic survey in the HUDF:
    Nature and physical properties of gas-mass selected galaxies using MUSE spectroscopy.
    <i>The Astrophysical Journal</i>. IOP Publishing. <a href="https://doi.org/10.3847/1538-4357/ab3102">https://doi.org/10.3847/1538-4357/ab3102</a>'
  chicago: 'Boogaard, Leindert A., Roberto Decarli, Jorge González-López, Paul van
    der Werf, Fabian Walter, Rychard Bouwens, Manuel Aravena, et al. “The ALMA Spectroscopic
    Survey in the HUDF: Nature and Physical Properties of Gas-Mass Selected Galaxies
    Using MUSE Spectroscopy.” <i>The Astrophysical Journal</i>. IOP Publishing, 2019.
    <a href="https://doi.org/10.3847/1538-4357/ab3102">https://doi.org/10.3847/1538-4357/ab3102</a>.'
  ieee: 'L. A. Boogaard <i>et al.</i>, “The ALMA spectroscopic survey in the HUDF:
    Nature and physical properties of gas-mass selected galaxies using MUSE spectroscopy,”
    <i>The Astrophysical Journal</i>, vol. 882, no. 2. IOP Publishing, 2019.'
  ista: 'Boogaard LA, Decarli R, González-López J, van der Werf P, Walter F, Bouwens
    R, Aravena M, Carilli C, Bauer FE, Brinchmann J, Contini T, Cox P, da Cunha E,
    Daddi E, Díaz-Santos T, Hodge J, Inami H, Ivison R, Maseda M, Matthee JJ, Oesch
    P, Popping G, Riechers D, Schaye J, Schouws S, Smail I, Weiss A, Wisotzki L, Bacon
    R, Cortes PC, Rix H-W, Somerville RS, Swinbank M, Wagg J. 2019. The ALMA spectroscopic
    survey in the HUDF: Nature and physical properties of gas-mass selected galaxies
    using MUSE spectroscopy. The Astrophysical Journal. 882(2), 140.'
  mla: 'Boogaard, Leindert A., et al. “The ALMA Spectroscopic Survey in the HUDF:
    Nature and Physical Properties of Gas-Mass Selected Galaxies Using MUSE Spectroscopy.”
    <i>The Astrophysical Journal</i>, vol. 882, no. 2, 140, IOP Publishing, 2019,
    doi:<a href="https://doi.org/10.3847/1538-4357/ab3102">10.3847/1538-4357/ab3102</a>.'
  short: L.A. Boogaard, R. Decarli, J. González-López, P. van der Werf, F. Walter,
    R. Bouwens, M. Aravena, C. Carilli, F.E. Bauer, J. Brinchmann, T. Contini, P.
    Cox, E. da Cunha, E. Daddi, T. Díaz-Santos, J. Hodge, H. Inami, R. Ivison, M.
    Maseda, J.J. Matthee, P. Oesch, G. Popping, D. Riechers, J. Schaye, S. Schouws,
    I. Smail, A. Weiss, L. Wisotzki, R. Bacon, P.C. Cortes, H.-W. Rix, R.S. Somerville,
    M. Swinbank, J. Wagg, The Astrophysical Journal 882 (2019).
date_created: 2022-07-06T13:31:35Z
date_published: 2019-09-11T00:00:00Z
date_updated: 2022-07-19T09:50:55Z
day: '11'
doi: 10.3847/1538-4357/ab3102
extern: '1'
external_id:
  arxiv:
  - '1903.09167'
intvolume: '       882'
issue: '2'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1903.09167
month: '09'
oa: 1
oa_version: Preprint
publication: The Astrophysical Journal
publication_identifier:
  eissn:
  - 1538-4357
  issn:
  - 0004-637X
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The ALMA spectroscopic survey in the HUDF: Nature and physical properties
  of gas-mass selected galaxies using MUSE spectroscopy'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 882
year: '2019'
...
---
_id: '11535'
abstract:
- lang: eng
  text: We investigate the clustering and halo properties of ∼5000 Ly α-selected emission-line
    galaxies (LAEs) from the Slicing COSMOS 4K (SC4K) and from archival NB497 imaging
    of SA22 split in 15 discrete redshift slices between z ∼ 2.5 and 6. We measure
    clustering lengths of r0 ∼ 3–6 h−1 Mpc and typical halo masses of ∼1011 M⊙ for
    our narrowband-selected LAEs with typical LLy α ∼ 1042–43 erg s−1. The intermediate-band-selected
    LAEs are observed to have r0 ∼ 3.5–15 h−1 Mpc with typical halo masses of ∼1011–12
    M⊙ and typical LLy α ∼ 1043–43.6 erg s−1. We find a strong, redshift-independent
    correlation between halo mass and Ly α luminosity normalized by the characteristic
    Ly α luminosity, L⋆(z). The faintest LAEs (L ∼ 0.1 L⋆(z)) typically identified
    by deep narrowband surveys are found in 1010 M⊙ haloes and the brightest LAEs
    (L ∼ 7 L⋆(z)) are found in ∼5 × 1012 M⊙ haloes. A dependency on the rest-frame
    1500 Å UV luminosity, MUV, is also observed where the halo masses increase from
    1011 to 1013 M⊙ for MUV ∼ −19 to −23.5 mag. Halo mass is also observed to increase
    from 109.8 to 1012 M⊙ for dust-corrected UV star formation rates from ∼0.6 to
    10 M⊙ yr−1 and continues to increase up to 1013 M⊙ in halo mass, where the majority
    of those sources are active galactic nuclei. All the trends we observe are found
    to be redshift independent. Our results reveal that LAEs are the likely progenitors
    of a wide range of galaxies depending on their luminosity, from dwarf-like, to
    Milky Way-type, to bright cluster galaxies. LAEs therefore provide unique insight
    into the early formation and evolution of the galaxies we observe in the local
    Universe.
acknowledgement: We thank the anonymous referee for their useful comments and suggestions
  that helped improve this study. AAK acknowledges that this work was supported by
  NASA Headquarters under the NASA Earth and Space Science Fellowship Program – Grant
  NNX16AO92H. JM acknowledges support from the ETH Zwicky fellowship. RKC acknowledges
  funding from STFC via a studentship. APA acknowledges support from the Fundac¸ao
  para a Ci ˜ encia e a Tecnologia FCT through the fellowship PD/BD/52706/2014 and
  the research grant UID/FIS/04434/2013. JC and SS both acknowledge their support
  from the Lancaster University PhD Fellowship. We have benefited greatly from the
  publicly available programming language PYTHON, including the NUMPY, SCIPY, MATPLOTLIB,
  SCIKIT-LEARN, and ASTROPY packages, as well as the TOPCAT analysis program. The
  SC4K samples used in this paper are all publicly available for use by the community
  (Sobral et al. 2018a). The catalogue is also available on the COSMOS IPAC website
  (https://irsa.ipac.caltech.edu/data/COSMOS/overview.html).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: A A
  full_name: Khostovan, A A
  last_name: Khostovan
- first_name: D
  full_name: Sobral, D
  last_name: Sobral
- first_name: B
  full_name: Mobasher, B
  last_name: Mobasher
- first_name: Jorryt J
  full_name: Matthee, Jorryt J
  id: 7439a258-f3c0-11ec-9501-9df22fe06720
  last_name: Matthee
  orcid: 0000-0003-2871-127X
- first_name: R K
  full_name: Cochrane, R K
  last_name: Cochrane
- first_name: N
  full_name: Chartab, N
  last_name: Chartab
- first_name: M
  full_name: Jafariyazani, M
  last_name: Jafariyazani
- first_name: A
  full_name: Paulino-Afonso, A
  last_name: Paulino-Afonso
- first_name: S
  full_name: Santos, S
  last_name: Santos
- first_name: J
  full_name: Calhau, J
  last_name: Calhau
citation:
  ama: 'Khostovan AA, Sobral D, Mobasher B, et al. The clustering of typical Ly α emitters
    from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities. <i>Monthly
    Notices of the Royal Astronomical Society</i>. 2019;489(1):555-573. doi:<a href="https://doi.org/10.1093/mnras/stz2149">10.1093/mnras/stz2149</a>'
  apa: 'Khostovan, A. A., Sobral, D., Mobasher, B., Matthee, J. J., Cochrane, R. K.,
    Chartab, N., … Calhau, J. (2019). The clustering of typical Ly α emitters from
    z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities. <i>Monthly Notices
    of the Royal Astronomical Society</i>. Oxford University Press. <a href="https://doi.org/10.1093/mnras/stz2149">https://doi.org/10.1093/mnras/stz2149</a>'
  chicago: 'Khostovan, A A, D Sobral, B Mobasher, Jorryt J Matthee, R K Cochrane,
    N Chartab, M Jafariyazani, A Paulino-Afonso, S Santos, and J Calhau. “The Clustering
    of Typical Ly α Emitters from z ∼ 2.5–6: Host Halo Masses Depend on Ly α and UV
    Luminosities.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford
    University Press, 2019. <a href="https://doi.org/10.1093/mnras/stz2149">https://doi.org/10.1093/mnras/stz2149</a>.'
  ieee: 'A. A. Khostovan <i>et al.</i>, “The clustering of typical Ly α emitters from
    z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities,” <i>Monthly Notices
    of the Royal Astronomical Society</i>, vol. 489, no. 1. Oxford University Press,
    pp. 555–573, 2019.'
  ista: 'Khostovan AA, Sobral D, Mobasher B, Matthee JJ, Cochrane RK, Chartab N, Jafariyazani
    M, Paulino-Afonso A, Santos S, Calhau J. 2019. The clustering of typical Ly α emitters
    from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities. Monthly Notices
    of the Royal Astronomical Society. 489(1), 555–573.'
  mla: 'Khostovan, A. A., et al. “The Clustering of Typical Ly α Emitters from z ∼
    2.5–6: Host Halo Masses Depend on Ly α and UV Luminosities.” <i>Monthly Notices
    of the Royal Astronomical Society</i>, vol. 489, no. 1, Oxford University Press,
    2019, pp. 555–73, doi:<a href="https://doi.org/10.1093/mnras/stz2149">10.1093/mnras/stz2149</a>.'
  short: A.A. Khostovan, D. Sobral, B. Mobasher, J.J. Matthee, R.K. Cochrane, N. Chartab,
    M. Jafariyazani, A. Paulino-Afonso, S. Santos, J. Calhau, Monthly Notices of the
    Royal Astronomical Society 489 (2019) 555–573.
date_created: 2022-07-07T13:01:03Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2022-08-19T06:38:42Z
day: '01'
doi: 10.1093/mnras/stz2149
extern: '1'
external_id:
  arxiv:
  - '1811.00556'
intvolume: '       489'
issue: '1'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: evolution'
- 'galaxies: haloes'
- 'galaxies: high-redshift'
- 'galaxies: star formation'
- 'cosmology: observations'
- large-scale structure of Universe
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1811.00556
month: '10'
oa: 1
oa_version: Preprint
page: 555-573
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
  eissn:
  - 1365-2966
  issn:
  - 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend
  on Ly α and UV luminosities'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 489
year: '2019'
...
---
_id: '11616'
abstract:
- lang: eng
  text: We present the discovery of HD 221416 b, the first transiting planet identified
    by the Transiting Exoplanet Survey Satellite (TESS) for which asteroseismology
    of the host star is possible. HD 221416 b (HIP 116158, TOI-197) is a bright (V
    = 8.2 mag), spectroscopically classified subgiant that oscillates with an average
    frequency of about 430 μHz and displays a clear signature of mixed modes. The
    oscillation amplitude confirms that the redder TESS bandpass compared to Kepler
    has a small effect on the oscillations, supporting the expected yield of thousands
    of solar-like oscillators with TESS 2 minute cadence observations. Asteroseismic
    modeling yields a robust determination of the host star radius (R⋆ = 2.943 ± 0.064
    R⊙), mass (M⋆ = 1.212 ± 0.074 M⊙), and age (4.9 ± 1.1 Gyr), and demonstrates that
    it has just started ascending the red-giant branch. Combining asteroseismology
    with transit modeling and radial-velocity observations, we show that the planet
    is a "hot Saturn" (Rp = 9.17 ± 0.33 R⊕) with an orbital period of ∼14.3 days,
    irradiance of F = 343 ± 24 F⊕, and moderate mass (Mp = 60.5 ± 5.7 M⊕) and density
    (ρp = 0.431 ± 0.062 g cm−3). The properties of HD 221416 b show that the host-star
    metallicity–planet mass correlation found in sub-Saturns (4–8 R⊕) does not extend
    to larger radii, indicating that planets in the transition between sub-Saturns
    and Jupiters follow a relatively narrow range of densities. With a density measured
    to ∼15%, HD 221416 b is one of the best characterized Saturn-size planets to date,
    augmenting the small number of known transiting planets around evolved stars and
    demonstrating the power of TESS to characterize exoplanets and their host stars
    using asteroseismology.
acknowledgement: "The authors wish to recognize and acknowledge the very significant
  cultural role and reverence that the summit of Maunakea has always had within the
  indigenous Hawai'ian community. We are most fortunate to have the opportunity to
  conduct observations from this mountain. We thank Andrei Tokovinin for helpful information
  on the Speckle observations obtained with SOAR. D.H. acknowledges support by the
  National Aeronautics and Space Administration through the TESS Guest Investigator
  Program (80NSSC18K1585) and by the National Science Foundation (AST-1717000). A.C.
  acknowledges support by the National Science Foundation under the Graduate Research
  Fellowship Program. W.J.C., W.H.B., A.M., O.J.H., and G.R.D. acknowledge support
  from the Science and Technology Facilities Council and UK Space Agency. H.K. and
  F.G. acknowledge support from the European Social Fund via the Lithuanian Science
  Council grant No. 09.3.3-LMT-K-712-01-0103. Funding for the Stellar Astrophysics
  Centre is provided by The Danish National Research Foundation (grant DNRF106). A.J.
  acknowledges support from FONDECYT project 1171208, CONICYT project BASAL AFB-170002,
  and by the Ministry for the Economy, Development, and Tourism's Programa Iniciativa
  Científica Milenio through grant IC 120009, awarded to the Millennium Institute
  of Astrophysics (MAS). R.B. acknowledges support from FONDECYT Post-doctoral Fellowship
  Project 3180246, and from the Millennium Institute of Astrophysics (MAS). A.M.S.
  is supported by grants ESP2017-82674-R (MINECO) and SGR2017-1131 (AGAUR). R.A.G.
  and L.B. acknowledge the support of the PLATO grant from the CNES. The research
  leading to the presented results has received funding from the European Research
  Council under the European Community's Seventh Framework Programme (FP72007-2013)ERC
  grant agreement No. 338251 (StellarAges). S.M. acknowledges support from the European
  Research Council through the SPIRE grant 647383. This work was also supported by
  FCT (Portugal) through national funds and by FEDER through COMPETE2020 by these
  grants: UID/FIS/04434/2013 and POCI-01-0145-FEDER-007672, PTDC/FIS-AST/30389/2017,
  and POCI-01-0145-FEDER-030389. T.L.C. acknowledges support from the European Union's
  Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie
  grant agreement No. 792848 (PULSATION). E.C. is funded by the European Union's Horizon
  2020 research and innovation program under the Marie Sklodowska-Curie grant agreement
  No. 664931. V.S.A. acknowledges support from the Independent Research Fund Denmark
  (Research grant 7027-00096B). D.S. acknowledges support from the Australian Research
  Council. S.B. acknowledges NASA grant NNX16AI09G and NSF grant AST-1514676. T.R.W.
  acknowledges support from the Australian Research Council through grant DP150100250.
  A.M. acknowledges support from the ERC Consolidator Grant funding scheme (project
  ASTEROCHRONOMETRY, G.A. n. 772293). S.M. acknowledges support from the Ramon y Cajal
  fellowship number RYC-2015-17697. M.S.L. is supported by the Carlsberg Foundation
  (grant agreement No. CF17-0760). A.M. and P.R. acknowledge support from the HBCSE-NIUS
  programme. J.K.T. and J.T. acknowledge that support for this work was provided by
  NASA through Hubble Fellowship grants HST-HF2-51399.001 and HST-HF2-51424.001 awarded
  by the Space Telescope Science Institute, which is operated by the Association of
  Universities for Research in Astronomy, Inc., for NASA, under contract NAS5-26555.
  T.S.R. acknowledges financial support from Premiale 2015 MITiC (PI B. Garilli).
  This project has been supported by the NKFIH K-115709 grant and the Lendület Program
  of the Hungarian Academy of Sciences, project No. LP2018-7/2018.\r\n\r\nBased on
  observations made with the Hertzsprung SONG telescope operated on the Spanish Observatorio
  del Teide on the island of Tenerife by the Aarhus and Copenhagen Universities and
  by the Instituto de Astrofísica de Canarias. Funding for the TESS mission is provided
  by NASA's Science Mission directorate. We acknowledge the use of public TESS Alert
  data from pipelines at the TESS Science Office and at the TESS Science Processing
  Operations Center. This research has made use of the Exoplanet Follow-up Observation
  Program website, which is operated by the California Institute of Technology, under
  contract with the National Aeronautics and Space Administration under the Exoplanet
  Exploration Program. This paper includes data collected by the TESS mission, which
  are publicly available from the Mikulski Archive for Space Telescopes (MAST).\r\n\r\nSoftware:
  Astropy (Astropy Collaboration et al. 2018), Matplotlib (Hunter 2007), DIAMONDS
  (Corsaro & De Ridder 2014), isoclassify (Huber et al. 2017), EXOFASTv2 (Eastman
  2017), ktransit (Barclay 2018)."
article_number: '245'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Daniel
  full_name: Huber, Daniel
  last_name: Huber
- first_name: William J.
  full_name: Chaplin, William J.
  last_name: Chaplin
- first_name: Ashley
  full_name: Chontos, Ashley
  last_name: Chontos
- first_name: Hans
  full_name: Kjeldsen, Hans
  last_name: Kjeldsen
- first_name: Jørgen
  full_name: Christensen-Dalsgaard, Jørgen
  last_name: Christensen-Dalsgaard
- first_name: Timothy R.
  full_name: Bedding, Timothy R.
  last_name: Bedding
- first_name: Warrick
  full_name: Ball, Warrick
  last_name: Ball
- first_name: Rafael
  full_name: Brahm, Rafael
  last_name: Brahm
- first_name: Nestor
  full_name: Espinoza, Nestor
  last_name: Espinoza
- first_name: Thomas
  full_name: Henning, Thomas
  last_name: Henning
- first_name: Andrés
  full_name: Jordán, Andrés
  last_name: Jordán
- first_name: Paula
  full_name: Sarkis, Paula
  last_name: Sarkis
- first_name: Emil
  full_name: Knudstrup, Emil
  last_name: Knudstrup
- first_name: Simon
  full_name: Albrecht, Simon
  last_name: Albrecht
- first_name: Frank
  full_name: Grundahl, Frank
  last_name: Grundahl
- first_name: Mads Fredslund
  full_name: Andersen, Mads Fredslund
  last_name: Andersen
- first_name: Pere L.
  full_name: Pallé, Pere L.
  last_name: Pallé
- first_name: Ian
  full_name: Crossfield, Ian
  last_name: Crossfield
- first_name: Benjamin
  full_name: Fulton, Benjamin
  last_name: Fulton
- first_name: Andrew W.
  full_name: Howard, Andrew W.
  last_name: Howard
- first_name: Howard T.
  full_name: Isaacson, Howard T.
  last_name: Isaacson
- first_name: Lauren M.
  full_name: Weiss, Lauren M.
  last_name: Weiss
- first_name: Rasmus
  full_name: Handberg, Rasmus
  last_name: Handberg
- first_name: Mikkel N.
  full_name: Lund, Mikkel N.
  last_name: Lund
- first_name: Aldo M.
  full_name: Serenelli, Aldo M.
  last_name: Serenelli
- first_name: Jakob
  full_name: Rørsted Mosumgaard, Jakob
  last_name: Rørsted Mosumgaard
- first_name: Amalie
  full_name: Stokholm, Amalie
  last_name: Stokholm
- first_name: Allyson
  full_name: Bieryla, Allyson
  last_name: Bieryla
- first_name: Lars A.
  full_name: Buchhave, Lars A.
  last_name: Buchhave
- first_name: David W.
  full_name: Latham, David W.
  last_name: Latham
- first_name: Samuel N.
  full_name: Quinn, Samuel N.
  last_name: Quinn
- first_name: Eric
  full_name: Gaidos, Eric
  last_name: Gaidos
- first_name: Teruyuki
  full_name: Hirano, Teruyuki
  last_name: Hirano
- first_name: George R.
  full_name: Ricker, George R.
  last_name: Ricker
- first_name: Roland K.
  full_name: Vanderspek, Roland K.
  last_name: Vanderspek
- first_name: Sara
  full_name: Seager, Sara
  last_name: Seager
- first_name: Jon M.
  full_name: Jenkins, Jon M.
  last_name: Jenkins
- first_name: Joshua N.
  full_name: Winn, Joshua N.
  last_name: Winn
- first_name: H. M.
  full_name: Antia, H. M.
  last_name: Antia
- first_name: Thierry
  full_name: Appourchaux, Thierry
  last_name: Appourchaux
- first_name: Sarbani
  full_name: Basu, Sarbani
  last_name: Basu
- first_name: Keaton J.
  full_name: Bell, Keaton J.
  last_name: Bell
- first_name: Othman
  full_name: Benomar, Othman
  last_name: Benomar
- first_name: Alfio
  full_name: Bonanno, Alfio
  last_name: Bonanno
- first_name: Derek L.
  full_name: Buzasi, Derek L.
  last_name: Buzasi
- first_name: Tiago L.
  full_name: Campante, Tiago L.
  last_name: Campante
- first_name: Z.
  full_name: Çelik Orhan, Z.
  last_name: Çelik Orhan
- first_name: Enrico
  full_name: Corsaro, Enrico
  last_name: Corsaro
- first_name: Margarida S.
  full_name: Cunha, Margarida S.
  last_name: Cunha
- first_name: Guy R.
  full_name: Davies, Guy R.
  last_name: Davies
- first_name: Sebastien
  full_name: Deheuvels, Sebastien
  last_name: Deheuvels
- first_name: Samuel K.
  full_name: Grunblatt, Samuel K.
  last_name: Grunblatt
- first_name: Amir
  full_name: Hasanzadeh, Amir
  last_name: Hasanzadeh
- first_name: Maria Pia
  full_name: Di Mauro, Maria Pia
  last_name: Di Mauro
- first_name: Rafael
  full_name: A. García, Rafael
  last_name: A. García
- first_name: Patrick
  full_name: Gaulme, Patrick
  last_name: Gaulme
- first_name: Léo
  full_name: Girardi, Léo
  last_name: Girardi
- first_name: Joyce A.
  full_name: Guzik, Joyce A.
  last_name: Guzik
- first_name: Marc
  full_name: Hon, Marc
  last_name: Hon
- first_name: Chen
  full_name: Jiang, Chen
  last_name: Jiang
- first_name: Thomas
  full_name: Kallinger, Thomas
  last_name: Kallinger
- first_name: Steven D.
  full_name: Kawaler, Steven D.
  last_name: Kawaler
- first_name: James S.
  full_name: Kuszlewicz, James S.
  last_name: Kuszlewicz
- first_name: Yveline
  full_name: Lebreton, Yveline
  last_name: Lebreton
- first_name: Tanda
  full_name: Li, Tanda
  last_name: Li
- first_name: Miles
  full_name: Lucas, Miles
  last_name: Lucas
- first_name: Mia S.
  full_name: Lundkvist, Mia S.
  last_name: Lundkvist
- first_name: Andrew W.
  full_name: Mann, Andrew W.
  last_name: Mann
- first_name: Stéphane
  full_name: Mathis, Stéphane
  last_name: Mathis
- first_name: Savita
  full_name: Mathur, Savita
  last_name: Mathur
- first_name: Anwesh
  full_name: Mazumdar, Anwesh
  last_name: Mazumdar
- first_name: Travis S.
  full_name: Metcalfe, Travis S.
  last_name: Metcalfe
- first_name: Andrea
  full_name: Miglio, Andrea
  last_name: Miglio
- first_name: Mário J. P.
  full_name: F. G. Monteiro, Mário J. P.
  last_name: F. G. Monteiro
- first_name: Benoit
  full_name: Mosser, Benoit
  last_name: Mosser
- first_name: Anthony
  full_name: Noll, Anthony
  last_name: Noll
- first_name: Benard
  full_name: Nsamba, Benard
  last_name: Nsamba
- first_name: Jia Mian
  full_name: Joel Ong, Jia Mian
  last_name: Joel Ong
- first_name: S.
  full_name: Örtel, S.
  last_name: Örtel
- first_name: Filipe
  full_name: Pereira, Filipe
  last_name: Pereira
- first_name: Pritesh
  full_name: Ranadive, Pritesh
  last_name: Ranadive
- first_name: Clara
  full_name: Régulo, Clara
  last_name: Régulo
- first_name: Thaíse S.
  full_name: Rodrigues, Thaíse S.
  last_name: Rodrigues
- first_name: Ian W.
  full_name: Roxburgh, Ian W.
  last_name: Roxburgh
- first_name: Victor Silva
  full_name: Aguirre, Victor Silva
  last_name: Aguirre
- first_name: Barry
  full_name: Smalley, Barry
  last_name: Smalley
- first_name: Mathew
  full_name: Schofield, Mathew
  last_name: Schofield
- first_name: Sérgio G.
  full_name: Sousa, Sérgio G.
  last_name: Sousa
- first_name: Keivan G.
  full_name: Stassun, Keivan G.
  last_name: Stassun
- first_name: Dennis
  full_name: Stello, Dennis
  last_name: Stello
- first_name: Jamie
  full_name: Tayar, Jamie
  last_name: Tayar
- first_name: Timothy R.
  full_name: White, Timothy R.
  last_name: White
- first_name: Kuldeep
  full_name: Verma, Kuldeep
  last_name: Verma
- first_name: Mathieu
  full_name: Vrard, Mathieu
  last_name: Vrard
- first_name: M.
  full_name: Yıldız, M.
  last_name: Yıldız
- first_name: David
  full_name: Baker, David
  last_name: Baker
- first_name: Michaël
  full_name: Bazot, Michaël
  last_name: Bazot
- first_name: Charles
  full_name: Beichmann, Charles
  last_name: Beichmann
- first_name: Christoph
  full_name: Bergmann, Christoph
  last_name: Bergmann
- first_name: Lisa Annabelle
  full_name: Bugnet, Lisa Annabelle
  id: d9edb345-f866-11ec-9b37-d119b5234501
  last_name: Bugnet
  orcid: 0000-0003-0142-4000
- first_name: Bryson
  full_name: Cale, Bryson
  last_name: Cale
- first_name: Roberto
  full_name: Carlino, Roberto
  last_name: Carlino
- first_name: Scott M.
  full_name: Cartwright, Scott M.
  last_name: Cartwright
- first_name: Jessie L.
  full_name: Christiansen, Jessie L.
  last_name: Christiansen
- first_name: David R.
  full_name: Ciardi, David R.
  last_name: Ciardi
- first_name: Orlagh
  full_name: Creevey, Orlagh
  last_name: Creevey
- first_name: Jason A.
  full_name: Dittmann, Jason A.
  last_name: Dittmann
- first_name: Jose-Dias Do
  full_name: Nascimento, Jose-Dias Do
  last_name: Nascimento
- first_name: Vincent Van
  full_name: Eylen, Vincent Van
  last_name: Eylen
- first_name: Gabor
  full_name: Fürész, Gabor
  last_name: Fürész
- first_name: Jonathan
  full_name: Gagné, Jonathan
  last_name: Gagné
- first_name: Peter
  full_name: Gao, Peter
  last_name: Gao
- first_name: Kosmas
  full_name: Gazeas, Kosmas
  last_name: Gazeas
- first_name: Frank
  full_name: Giddens, Frank
  last_name: Giddens
- first_name: Oliver J.
  full_name: Hall, Oliver J.
  last_name: Hall
- first_name: Saskia
  full_name: Hekker, Saskia
  last_name: Hekker
- first_name: Michael J.
  full_name: Ireland, Michael J.
  last_name: Ireland
- first_name: Natasha
  full_name: Latouf, Natasha
  last_name: Latouf
- first_name: Danny
  full_name: LeBrun, Danny
  last_name: LeBrun
- first_name: Alan M.
  full_name: Levine, Alan M.
  last_name: Levine
- first_name: William
  full_name: Matzko, William
  last_name: Matzko
- first_name: Eva
  full_name: Natinsky, Eva
  last_name: Natinsky
- first_name: Emma
  full_name: Page, Emma
  last_name: Page
- first_name: Peter
  full_name: Plavchan, Peter
  last_name: Plavchan
- first_name: Masoud
  full_name: Mansouri-Samani, Masoud
  last_name: Mansouri-Samani
- first_name: Sean
  full_name: McCauliff, Sean
  last_name: McCauliff
- first_name: Susan E.
  full_name: Mullally, Susan E.
  last_name: Mullally
- first_name: Brendan
  full_name: Orenstein, Brendan
  last_name: Orenstein
- first_name: Aylin Garcia
  full_name: Soto, Aylin Garcia
  last_name: Soto
- first_name: Martin
  full_name: Paegert, Martin
  last_name: Paegert
- first_name: Jennifer L.
  full_name: van Saders, Jennifer L.
  last_name: van Saders
- first_name: Chloe
  full_name: Schnaible, Chloe
  last_name: Schnaible
- first_name: David R.
  full_name: Soderblom, David R.
  last_name: Soderblom
- first_name: Róbert
  full_name: Szabó, Róbert
  last_name: Szabó
- first_name: Angelle
  full_name: Tanner, Angelle
  last_name: Tanner
- first_name: C. G.
  full_name: Tinney, C. G.
  last_name: Tinney
- first_name: Johanna
  full_name: Teske, Johanna
  last_name: Teske
- first_name: Alexandra
  full_name: Thomas, Alexandra
  last_name: Thomas
- first_name: Regner
  full_name: Trampedach, Regner
  last_name: Trampedach
- first_name: Duncan
  full_name: Wright, Duncan
  last_name: Wright
- first_name: Thomas T.
  full_name: Yuan, Thomas T.
  last_name: Yuan
- first_name: Farzaneh
  full_name: Zohrabi, Farzaneh
  last_name: Zohrabi
citation:
  ama: Huber D, Chaplin WJ, Chontos A, et al. A hot Saturn orbiting an oscillating
    late subgiant discovered by TESS. <i>The Astronomical Journal</i>. 2019;157(6).
    doi:<a href="https://doi.org/10.3847/1538-3881/ab1488">10.3847/1538-3881/ab1488</a>
  apa: Huber, D., Chaplin, W. J., Chontos, A., Kjeldsen, H., Christensen-Dalsgaard,
    J., Bedding, T. R., … Zohrabi, F. (2019). A hot Saturn orbiting an oscillating
    late subgiant discovered by TESS. <i>The Astronomical Journal</i>. IOP Publishing.
    <a href="https://doi.org/10.3847/1538-3881/ab1488">https://doi.org/10.3847/1538-3881/ab1488</a>
  chicago: Huber, Daniel, William J. Chaplin, Ashley Chontos, Hans Kjeldsen, Jørgen
    Christensen-Dalsgaard, Timothy R. Bedding, Warrick Ball, et al. “A Hot Saturn
    Orbiting an Oscillating Late Subgiant Discovered by TESS.” <i>The Astronomical
    Journal</i>. IOP Publishing, 2019. <a href="https://doi.org/10.3847/1538-3881/ab1488">https://doi.org/10.3847/1538-3881/ab1488</a>.
  ieee: D. Huber <i>et al.</i>, “A hot Saturn orbiting an oscillating late subgiant
    discovered by TESS,” <i>The Astronomical Journal</i>, vol. 157, no. 6. IOP Publishing,
    2019.
  ista: Huber D et al. 2019. A hot Saturn orbiting an oscillating late subgiant discovered
    by TESS. The Astronomical Journal. 157(6), 245.
  mla: Huber, Daniel, et al. “A Hot Saturn Orbiting an Oscillating Late Subgiant Discovered
    by TESS.” <i>The Astronomical Journal</i>, vol. 157, no. 6, 245, IOP Publishing,
    2019, doi:<a href="https://doi.org/10.3847/1538-3881/ab1488">10.3847/1538-3881/ab1488</a>.
  short: D. Huber, W.J. Chaplin, A. Chontos, H. Kjeldsen, J. Christensen-Dalsgaard,
    T.R. Bedding, W. Ball, R. Brahm, N. Espinoza, T. Henning, A. Jordán, P. Sarkis,
    E. Knudstrup, S. Albrecht, F. Grundahl, M.F. Andersen, P.L. Pallé, I. Crossfield,
    B. Fulton, A.W. Howard, H.T. Isaacson, L.M. Weiss, R. Handberg, M.N. Lund, A.M.
    Serenelli, J. Rørsted Mosumgaard, A. Stokholm, A. Bieryla, L.A. Buchhave, D.W.
    Latham, S.N. Quinn, E. Gaidos, T. Hirano, G.R. Ricker, R.K. Vanderspek, S. Seager,
    J.M. Jenkins, J.N. Winn, H.M. Antia, T. Appourchaux, S. Basu, K.J. Bell, O. Benomar,
    A. Bonanno, D.L. Buzasi, T.L. Campante, Z. Çelik Orhan, E. Corsaro, M.S. Cunha,
    G.R. Davies, S. Deheuvels, S.K. Grunblatt, A. Hasanzadeh, M.P. Di Mauro, R. A.
    García, P. Gaulme, L. Girardi, J.A. Guzik, M. Hon, C. Jiang, T. Kallinger, S.D.
    Kawaler, J.S. Kuszlewicz, Y. Lebreton, T. Li, M. Lucas, M.S. Lundkvist, A.W. Mann,
    S. Mathis, S. Mathur, A. Mazumdar, T.S. Metcalfe, A. Miglio, M.J.P. F. G. Monteiro,
    B. Mosser, A. Noll, B. Nsamba, J.M. Joel Ong, S. Örtel, F. Pereira, P. Ranadive,
    C. Régulo, T.S. Rodrigues, I.W. Roxburgh, V.S. Aguirre, B. Smalley, M. Schofield,
    S.G. Sousa, K.G. Stassun, D. Stello, J. Tayar, T.R. White, K. Verma, M. Vrard,
    M. Yıldız, D. Baker, M. Bazot, C. Beichmann, C. Bergmann, L.A. Bugnet, B. Cale,
    R. Carlino, S.M. Cartwright, J.L. Christiansen, D.R. Ciardi, O. Creevey, J.A.
    Dittmann, J.-D.D. Nascimento, V.V. Eylen, G. Fürész, J. Gagné, P. Gao, K. Gazeas,
    F. Giddens, O.J. Hall, S. Hekker, M.J. Ireland, N. Latouf, D. LeBrun, A.M. Levine,
    W. Matzko, E. Natinsky, E. Page, P. Plavchan, M. Mansouri-Samani, S. McCauliff,
    S.E. Mullally, B. Orenstein, A.G. Soto, M. Paegert, J.L. van Saders, C. Schnaible,
    D.R. Soderblom, R. Szabó, A. Tanner, C.G. Tinney, J. Teske, A. Thomas, R. Trampedach,
    D. Wright, T.T. Yuan, F. Zohrabi, The Astronomical Journal 157 (2019).
date_created: 2022-07-18T14:29:07Z
date_published: 2019-05-30T00:00:00Z
date_updated: 2022-08-22T07:38:34Z
day: '30'
doi: 10.3847/1538-3881/ab1488
extern: '1'
external_id:
  arxiv:
  - '1901.01643'
intvolume: '       157'
issue: '6'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1901.01643
month: '05'
oa: 1
oa_version: Preprint
publication: The Astronomical Journal
publication_identifier:
  issn:
  - 0004-6256
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: A hot Saturn orbiting an oscillating late subgiant discovered by TESS
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 157
year: '2019'
...
---
_id: '11826'
abstract:
- lang: eng
  text: "The diameter, radius and eccentricities are natural graph parameters. While
    these problems have been studied extensively, there are no known dynamic algorithms
    for them beyond the ones that follow from trivial recomputation after each update
    or from solving dynamic All-Pairs Shortest Paths (APSP), which is very computationally
    intensive. This is the situation for dynamic approximation algorithms as well,
    and even if only edge insertions or edge deletions need to be supported.\r\nThis
    paper provides a comprehensive study of the dynamic approximation of Diameter,
    Radius and Eccentricities, providing both conditional lower bounds, and new algorithms
    whose bounds are optimal under popular hypotheses in fine-grained complexity.
    Some of the highlights include:\r\n- Under popular hardness hypotheses, there
    can be no significantly better fully dynamic approximation algorithms than recomputing
    the answer after each update, or maintaining full APSP.\r\n- Nearly optimal partially
    dynamic (incremental/decremental) algorithms can be achieved via efficient reductions
    to (incremental/decremental) maintenance of Single-Source Shortest Paths. For
    instance, a nearly (3/2+epsilon)-approximation to Diameter in directed or undirected
    n-vertex, m-edge graphs can be maintained decrementally in total time m^{1+o(1)}sqrt{n}/epsilon^2.
    This nearly matches the static 3/2-approximation algorithm for the problem that
    is known to be conditionally optimal."
alternative_title:
- LIPIcs
article_number: '13'
article_processing_charge: No
arxiv: 1
author:
- first_name: Bertie
  full_name: Ancona, Bertie
  last_name: Ancona
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Liam
  full_name: Roditty, Liam
  last_name: Roditty
- first_name: Virginia Vassilevska
  full_name: Williams, Virginia Vassilevska
  last_name: Williams
- first_name: Nicole
  full_name: Wein, Nicole
  last_name: Wein
citation:
  ama: 'Ancona B, Henzinger M, Roditty L, Williams VV, Wein N. Algorithms and hardness
    for diameter in dynamic graphs. In: <i>46th International Colloquium on Automata,
    Languages, and Programming</i>. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für
    Informatik; 2019. doi:<a href="https://doi.org/10.4230/LIPICS.ICALP.2019.13">10.4230/LIPICS.ICALP.2019.13</a>'
  apa: 'Ancona, B., Henzinger, M., Roditty, L., Williams, V. V., &#38; Wein, N. (2019).
    Algorithms and hardness for diameter in dynamic graphs. In <i>46th International
    Colloquium on Automata, Languages, and Programming</i> (Vol. 132). Patras, Greece:
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPICS.ICALP.2019.13">https://doi.org/10.4230/LIPICS.ICALP.2019.13</a>'
  chicago: Ancona, Bertie, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams,
    and Nicole Wein. “Algorithms and Hardness for Diameter in Dynamic Graphs.” In
    <i>46th International Colloquium on Automata, Languages, and Programming</i>,
    Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href="https://doi.org/10.4230/LIPICS.ICALP.2019.13">https://doi.org/10.4230/LIPICS.ICALP.2019.13</a>.
  ieee: B. Ancona, M. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms
    and hardness for diameter in dynamic graphs,” in <i>46th International Colloquium
    on Automata, Languages, and Programming</i>, Patras, Greece, 2019, vol. 132.
  ista: 'Ancona B, Henzinger M, Roditty L, Williams VV, Wein N. 2019. Algorithms and
    hardness for diameter in dynamic graphs. 46th International Colloquium on Automata,
    Languages, and Programming. ICALP: International Colloquium on Automata, Languages,
    and Programming, LIPIcs, vol. 132, 13.'
  mla: Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.”
    <i>46th International Colloquium on Automata, Languages, and Programming</i>,
    vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a
    href="https://doi.org/10.4230/LIPICS.ICALP.2019.13">10.4230/LIPICS.ICALP.2019.13</a>.
  short: B. Ancona, M. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th International
    Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2019.
conference:
  end_date: 2019-07-12
  location: Patras, Greece
  name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
  start_date: 2019-07-09
date_created: 2022-08-12T08:14:51Z
date_published: 2019-07-04T00:00:00Z
date_updated: 2024-11-06T11:56:23Z
day: '04'
doi: 10.4230/LIPICS.ICALP.2019.13
extern: '1'
external_id:
  arxiv:
  - '811.12527'
intvolume: '       132'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.4230/LIPIcs.ICALP.2019.13
month: '07'
oa: 1
oa_version: Published Version
publication: 46th International Colloquium on Automata, Languages, and Programming
publication_identifier:
  isbn:
  - 978-3-95977-109-2
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithms and hardness for diameter in dynamic graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 132
year: '2019'
...
