---
OA_place: publisher
OA_type: free access
_id: '22535'
abstract:
- lang: eng
  text: Flooding impacts are on the rise globally, and concentrated in urban areas.
    Currently, there are no operational systems to forecast flooding at spatial resolutions
    that can facilitate emergency preparedness and response actions mitigating flood
    impacts. We present a framework for real-time flood modeling and uncertainty quantification
    that combines the physics of fluid motion with advances in probabilistic methods.
    The framework overcomes the prohibitive computational demands of high-fidelity
    modeling in real-time by using a probabilistic learning method relying on surrogate
    models that are trained prior to a flood event. This shifts the overwhelming burden
    of computation to the trivial problem of data storage, and enables forecasting
    of both flood hazard and its uncertainty at scales that are vital for time-critical
    decision-making before and during extreme events. The framework has the potential
    to improve flood prediction and analysis and can be extended to other hazard assessments
    requiring intense high-fidelity computations in real-time.
article_number: e2021GL093585
article_processing_charge: No
article_type: letter_note
author:
- first_name: Valeriy Y.
  full_name: Ivanov, Valeriy Y.
  last_name: Ivanov
- first_name: Donghui
  full_name: Xu, Donghui
  last_name: Xu
- first_name: M. Chase
  full_name: Dwelle, M. Chase
  last_name: Dwelle
- first_name: Khachik
  full_name: Sargsyan, Khachik
  last_name: Sargsyan
- first_name: Daniel B.
  full_name: Wright, Daniel B.
  last_name: Wright
- first_name: Nikolaos
  full_name: Katopodes, Nikolaos
  last_name: Katopodes
- first_name: Jongho
  full_name: Kim, Jongho
  last_name: Kim
- first_name: Vinh Ngoc
  full_name: Tran, Vinh Ngoc
  last_name: Tran
- first_name: April
  full_name: Warnock, April
  last_name: Warnock
- first_name: Simone
  full_name: Fatichi, Simone
  id: cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6
  last_name: Fatichi
- first_name: Paolo
  full_name: Burlando, Paolo
  last_name: Burlando
- first_name: Enrica
  full_name: Caporali, Enrica
  last_name: Caporali
- first_name: Pedro
  full_name: Restrepo, Pedro
  last_name: Restrepo
- first_name: Brett F.
  full_name: Sanders, Brett F.
  last_name: Sanders
- first_name: Molly M.
  full_name: Chaney, Molly M.
  last_name: Chaney
- first_name: Ana M. B.
  full_name: Nunes, Ana M. B.
  last_name: Nunes
- first_name: Fernando
  full_name: Nardi, Fernando
  last_name: Nardi
- first_name: Enrique R.
  full_name: Vivoni, Enrique R.
  last_name: Vivoni
- first_name: Erkan
  full_name: Istanbulluoglu, Erkan
  last_name: Istanbulluoglu
- first_name: Gautam
  full_name: Bisht, Gautam
  last_name: Bisht
- first_name: Rafael L.
  full_name: Bras, Rafael L.
  last_name: Bras
citation:
  ama: Ivanov VY, Xu D, Dwelle MC, et al. Breaking down the computational barriers
    to real‐time urban flood forecasting. <i>Geophysical Research Letters</i>. 2021;48(20).
    doi:<a href="https://doi.org/10.1029/2021gl093585">10.1029/2021gl093585</a>
  apa: Ivanov, V. Y., Xu, D., Dwelle, M. C., Sargsyan, K., Wright, D. B., Katopodes,
    N., … Bras, R. L. (2021). Breaking down the computational barriers to real‐time
    urban flood forecasting. <i>Geophysical Research Letters</i>. American Geophysical
    Union. <a href="https://doi.org/10.1029/2021gl093585">https://doi.org/10.1029/2021gl093585</a>
  chicago: Ivanov, Valeriy Y., Donghui Xu, M. Chase Dwelle, Khachik Sargsyan, Daniel
    B. Wright, Nikolaos Katopodes, Jongho Kim, et al. “Breaking down the Computational
    Barriers to Real‐time Urban Flood Forecasting.” <i>Geophysical Research Letters</i>.
    American Geophysical Union, 2021. <a href="https://doi.org/10.1029/2021gl093585">https://doi.org/10.1029/2021gl093585</a>.
  ieee: V. Y. Ivanov <i>et al.</i>, “Breaking down the computational barriers to real‐time
    urban flood forecasting,” <i>Geophysical Research Letters</i>, vol. 48, no. 20.
    American Geophysical Union, 2021.
  ista: Ivanov VY, Xu D, Dwelle MC, Sargsyan K, Wright DB, Katopodes N, Kim J, Tran
    VN, Warnock A, Fatichi S, Burlando P, Caporali E, Restrepo P, Sanders BF, Chaney
    MM, Nunes AMB, Nardi F, Vivoni ER, Istanbulluoglu E, Bisht G, Bras RL. 2021. Breaking
    down the computational barriers to real‐time urban flood forecasting. Geophysical
    Research Letters. 48(20), e2021GL093585.
  mla: Ivanov, Valeriy Y., et al. “Breaking down the Computational Barriers to Real‐time
    Urban Flood Forecasting.” <i>Geophysical Research Letters</i>, vol. 48, no. 20,
    e2021GL093585, American Geophysical Union, 2021, doi:<a href="https://doi.org/10.1029/2021gl093585">10.1029/2021gl093585</a>.
  short: V.Y. Ivanov, D. Xu, M.C. Dwelle, K. Sargsyan, D.B. Wright, N. Katopodes,
    J. Kim, V.N. Tran, A. Warnock, S. Fatichi, P. Burlando, E. Caporali, P. Restrepo,
    B.F. Sanders, M.M. Chaney, A.M.B. Nunes, F. Nardi, E.R. Vivoni, E. Istanbulluoglu,
    G. Bisht, R.L. Bras, Geophysical Research Letters 48 (2021).
das_tickbox: '1'
date_created: 2026-07-27T12:30:24Z
date_published: 2021-10-28T00:00:00Z
date_updated: 2026-08-07T06:50:54Z
day: '28'
doi: 10.1029/2021gl093585
extern: '1'
intvolume: '        48'
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1029/2021GL093585
month: '10'
oa: 1
oa_version: Published Version
publication: Geophysical Research Letters
publication_identifier:
  eissn:
  - 1944-8007
  issn:
  - 0094-8276
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: Breaking down the computational barriers to real‐time urban flood forecasting
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 48
year: '2021'
...
---
OA_place: publisher
OA_type: hybrid
_id: '22566'
abstract:
- lang: eng
  text: Peruvian glaciers are important contributors to dry season runoff for agriculture
    and hydropower, but they are at risk of disappearing due to climate change. We
    applied a physically based, energy balance melt model at five on‐glacier sites
    within the Peruvian Cordilleras Blanca and Vilcanota. Net shortwave radiation
    dominates the energy balance, and despite this flux being higher in the dry season,
    melt rates are lower due to losses from net longwave radiation and the latent
    heat flux. The sensible heat flux is a relatively small contributor to melt energy.
    At three of the sites the wet season snowpack was discontinuous, forming and melting
    within a daily to weekly timescale, and resulting in highly variable melt rates
    closely related to precipitation dynamics. Cold air temperatures due to a strong
    La Niña year at Shallap Glacier (Cordillera Blanca) resulted in a continuous wet
    season snowpack, significantly reducing wet season ablation. Sublimation was most
    important at the highest site in the accumulation zone of the Quelccaya Ice Cap
    (Cordillera Vilcanota), accounting for 81% of ablation, compared to 2%–4% for
    the other sites. Air temperature and precipitation inputs were perturbed to investigate
    the climate sensitivity of the five glaciers. At the lower sites warmer air temperatures
    resulted in a switch from snowfall to rain, so that ablation was increased via
    the decrease in albedo and increase in net shortwave radiation. At the top of
    Quelccaya Ice Cap warming caused melting to replace sublimation so that ablation
    increased nonlinearly with air temperature.
article_number: e2021JD034911
article_processing_charge: No
article_type: original
author:
- first_name: Catriona L.
  full_name: Fyffe, Catriona L.
  last_name: Fyffe
- first_name: Emily
  full_name: Potter, Emily
  last_name: Potter
- first_name: Stefan
  full_name: Fugger, Stefan
  last_name: Fugger
- first_name: Andrew
  full_name: Orr, Andrew
  last_name: Orr
- first_name: Simone
  full_name: Fatichi, Simone
  id: cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6
  last_name: Fatichi
- first_name: Edwin
  full_name: Loarte, Edwin
  last_name: Loarte
- first_name: Katy
  full_name: Medina, Katy
  last_name: Medina
- first_name: Robert Å.
  full_name: Hellström, Robert Å.
  last_name: Hellström
- first_name: Maud
  full_name: Bernat, Maud
  last_name: Bernat
- first_name: Caroline
  full_name: Aubry‐Wake, Caroline
  last_name: Aubry‐Wake
- first_name: Wolfgang
  full_name: Gurgiser, Wolfgang
  last_name: Gurgiser
- first_name: L. Baker
  full_name: Perry, L. Baker
  last_name: Perry
- first_name: Wilson
  full_name: Suarez, Wilson
  last_name: Suarez
- first_name: Duncan J.
  full_name: Quincey, Duncan J.
  last_name: Quincey
- first_name: Francesca
  full_name: Pellicciotti, Francesca
  last_name: Pellicciotti
citation:
  ama: 'Fyffe CL, Potter E, Fugger S, et al. The energy and mass balance of peruvian
    glaciers. <i>Journal of Geophysical Research: Atmospheres</i>. 2021;126(23). doi:<a
    href="https://doi.org/10.1029/2021jd034911">10.1029/2021jd034911</a>'
  apa: 'Fyffe, C. L., Potter, E., Fugger, S., Orr, A., Fatichi, S., Loarte, E., …
    Pellicciotti, F. (2021). The energy and mass balance of peruvian glaciers. <i>Journal
    of Geophysical Research: Atmospheres</i>. American Geophysical Union. <a href="https://doi.org/10.1029/2021jd034911">https://doi.org/10.1029/2021jd034911</a>'
  chicago: 'Fyffe, Catriona L., Emily Potter, Stefan Fugger, Andrew Orr, Simone Fatichi,
    Edwin Loarte, Katy Medina, et al. “The Energy and Mass Balance of Peruvian Glaciers.”
    <i>Journal of Geophysical Research: Atmospheres</i>. American Geophysical Union,
    2021. <a href="https://doi.org/10.1029/2021jd034911">https://doi.org/10.1029/2021jd034911</a>.'
  ieee: 'C. L. Fyffe <i>et al.</i>, “The energy and mass balance of peruvian glaciers,”
    <i>Journal of Geophysical Research: Atmospheres</i>, vol. 126, no. 23. American
    Geophysical Union, 2021.'
  ista: 'Fyffe CL, Potter E, Fugger S, Orr A, Fatichi S, Loarte E, Medina K, Hellström
    RÅ, Bernat M, Aubry‐Wake C, Gurgiser W, Perry LB, Suarez W, Quincey DJ, Pellicciotti
    F. 2021. The energy and mass balance of peruvian glaciers. Journal of Geophysical
    Research: Atmospheres. 126(23), e2021JD034911.'
  mla: 'Fyffe, Catriona L., et al. “The Energy and Mass Balance of Peruvian Glaciers.”
    <i>Journal of Geophysical Research: Atmospheres</i>, vol. 126, no. 23, e2021JD034911,
    American Geophysical Union, 2021, doi:<a href="https://doi.org/10.1029/2021jd034911">10.1029/2021jd034911</a>.'
  short: 'C.L. Fyffe, E. Potter, S. Fugger, A. Orr, S. Fatichi, E. Loarte, K. Medina,
    R.Å. Hellström, M. Bernat, C. Aubry‐Wake, W. Gurgiser, L.B. Perry, W. Suarez,
    D.J. Quincey, F. Pellicciotti, Journal of Geophysical Research: Atmospheres 126
    (2021).'
das_tickbox: '1'
date_created: 2026-07-27T12:30:24Z
date_published: 2021-12-16T00:00:00Z
date_updated: 2026-08-07T08:51:47Z
day: '16'
doi: 10.1029/2021jd034911
extern: '1'
intvolume: '       126'
issue: '23'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1029/2021JD034911
month: '12'
oa: 1
oa_version: Published Version
publication: 'Journal of Geophysical Research: Atmospheres'
publication_identifier:
  eissn:
  - 2169-8996
  issn:
  - 2169-897X
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: The energy and mass balance of peruvian glaciers
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 126
year: '2021'
...
---
OA_place: publisher
OA_type: free access
_id: '22516'
abstract:
- lang: eng
  text: Defining plant hydraulic traits is central to the quantification of ecohydrological
    processes ranging from land-atmosphere interactions, to tree mortality and water-carbon
    budgets. A key plant trait is the xylem specific hydraulic conductivity (Kx),
    that describes the plant's vascular system capacity to transport water. While
    xylem's vessels and tracheids are dead upon maturity, the xylem is neither inert
    nor deadwood, various components of the sapwood and surrounding tissue remaining
    alive and functional. Moreover, the established definition of Kx assumes linear
    relations between water flux and pressure gradient by tacitly considering the
    xylem as a “passive conduit”. Here, we re-examine this notion of an inert xylem
    by systematically characterizing xylem flow in several woody plants using Kx measurements
    under constant and cyclic pressure gradients. Results show a temporal and pressure
    gradient dependence of Kx. Additionally, microscopic features in “living branches”
    are irreversibly modified upon drying of the xylem, thus differentiating the macroscopic
    definition of Kx for living and dead xylem. The findings highlight the picture
    of the xylem as a complex and delicate conductive system whose hydraulic behaviour
    transcends a passive gradient-based flow. The study sheds new light on xylem conceptualization,
    conductivity measurement protocols, in situ long-distance water transport and
    ecosystem modelling.
article_processing_charge: No
article_type: original
author:
- first_name: Sara
  full_name: Bonetti, Sara
  last_name: Bonetti
- first_name: Daniel
  full_name: Breitenstein, Daniel
  last_name: Breitenstein
- first_name: Simone
  full_name: Fatichi, Simone
  id: cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6
  last_name: Fatichi
- first_name: Jean‐Christophe
  full_name: Domec, Jean‐Christophe
  last_name: Domec
- first_name: Dani
  full_name: Or, Dani
  last_name: Or
citation:
  ama: Bonetti S, Breitenstein D, Fatichi S, Domec J, Or D. Persistent decay of fresh
    xylem hydraulic conductivity varies with pressure gradient and marks plant responses
    to injury. <i>Plant, Cell &#38; Environment</i>. 2021;44(2):371-386. doi:<a href="https://doi.org/10.1111/pce.13893">10.1111/pce.13893</a>
  apa: Bonetti, S., Breitenstein, D., Fatichi, S., Domec, J., &#38; Or, D. (2021).
    Persistent decay of fresh xylem hydraulic conductivity varies with pressure gradient
    and marks plant responses to injury. <i>Plant, Cell &#38; Environment</i>. Wiley.
    <a href="https://doi.org/10.1111/pce.13893">https://doi.org/10.1111/pce.13893</a>
  chicago: Bonetti, Sara, Daniel Breitenstein, Simone Fatichi, Jean‐Christophe Domec,
    and Dani Or. “Persistent Decay of Fresh Xylem Hydraulic Conductivity Varies with
    Pressure Gradient and Marks Plant Responses to Injury.” <i>Plant, Cell &#38; Environment</i>.
    Wiley, 2021. <a href="https://doi.org/10.1111/pce.13893">https://doi.org/10.1111/pce.13893</a>.
  ieee: S. Bonetti, D. Breitenstein, S. Fatichi, J. Domec, and D. Or, “Persistent
    decay of fresh xylem hydraulic conductivity varies with pressure gradient and
    marks plant responses to injury,” <i>Plant, Cell &#38; Environment</i>, vol. 44,
    no. 2. Wiley, pp. 371–386, 2021.
  ista: Bonetti S, Breitenstein D, Fatichi S, Domec J, Or D. 2021. Persistent decay
    of fresh xylem hydraulic conductivity varies with pressure gradient and marks
    plant responses to injury. Plant, Cell &#38; Environment. 44(2), 371–386.
  mla: Bonetti, Sara, et al. “Persistent Decay of Fresh Xylem Hydraulic Conductivity
    Varies with Pressure Gradient and Marks Plant Responses to Injury.” <i>Plant,
    Cell &#38; Environment</i>, vol. 44, no. 2, Wiley, 2021, pp. 371–86, doi:<a href="https://doi.org/10.1111/pce.13893">10.1111/pce.13893</a>.
  short: S. Bonetti, D. Breitenstein, S. Fatichi, J. Domec, D. Or, Plant, Cell &#38;
    Environment 44 (2021) 371–386.
das_tickbox: '1'
date_created: 2026-07-27T12:30:24Z
date_published: 2021-02-01T00:00:00Z
date_updated: 2026-08-07T09:06:00Z
day: '01'
doi: 10.1111/pce.13893
extern: '1'
external_id:
  pmid:
  - '32964494 '
intvolume: '        44'
issue: '2'
keyword:
- Plant hydraulic traits
- Plant vascular system
- Sapflow
- Xylem conductivity measurements
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1111/pce.13893
month: '02'
oa: 1
oa_version: Published Version
page: 371-386
pmid: 1
publication: Plant, Cell & Environment
publication_identifier:
  eissn:
  - 1365-3040
  issn:
  - 0140-7791
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Persistent decay of fresh xylem hydraulic conductivity varies with pressure
  gradient and marks plant responses to injury
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 44
year: '2021'
...
---
OA_place: publisher
OA_type: free access
_id: '22498'
abstract:
- lang: eng
  text: Climate change impacts on sediment production and transfer processes on hillslopes
    and through channels are governed by possible changes in precipitation, runoff,
    and air temperature. These hydrological and geomorphological impacts are difficult
    to predict in temperature‐sensitive Alpine environments. In this study, we combined
    a stochastic weather generator model with the most current climate change projections
    to feed a hillslope‐channel sediment cascade model for a major debris‐flow system
    in the Swiss Alps (the Illgraben). This allowed us to quantify climate change
    impacts and their uncertainties on sediment yield and the number of debris flows
    at hourly temporal resolution. We show that projected changes in precipitation
    and air temperature lead to a reduction in both sediment yield (−48%) and debris‐flow
    occurrence (−23%). This change is caused by a decrease in sediment supply from
    hillslopes, which is driven by frost‐weathering. Additionally, we conduct model
    experiments that show the sensitivity of projected changes in sediment yield and
    debris‐flow hazard to basin elevation, with important implications for assessing
    natural hazards and risks in mountain environments. Future changes in hydrological
    and sediment fluxes are characterized by high uncertainty, mainly due to irreducible
    internal climate variability. Therefore, this stochastic uncertainty needs to
    be considered in climate change impact assessments for geomorphic systems.
article_number: e2020JF005739
article_processing_charge: No
article_type: original
author:
- first_name: Jacob
  full_name: Hirschberg, Jacob
  last_name: Hirschberg
- first_name: Simone
  full_name: Fatichi, Simone
  id: cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6
  last_name: Fatichi
- first_name: Georgina L.
  full_name: Bennett, Georgina L.
  last_name: Bennett
- first_name: Brian W.
  full_name: McArdell, Brian W.
  last_name: McArdell
- first_name: Nadav
  full_name: Peleg, Nadav
  last_name: Peleg
- first_name: Stuart N.
  full_name: Lane, Stuart N.
  last_name: Lane
- first_name: Fritz
  full_name: Schlunegger, Fritz
  last_name: Schlunegger
- first_name: Peter
  full_name: Molnar, Peter
  last_name: Molnar
citation:
  ama: 'Hirschberg J, Fatichi S, Bennett GL, et al. Climate change impacts on sediment
    yield and debris‐flow activity in an alpine catchment. <i>Journal of Geophysical
    Research: Earth Surface</i>. 2021;126(1). doi:<a href="https://doi.org/10.1029/2020jf005739">10.1029/2020jf005739</a>'
  apa: 'Hirschberg, J., Fatichi, S., Bennett, G. L., McArdell, B. W., Peleg, N., Lane,
    S. N., … Molnar, P. (2021). Climate change impacts on sediment yield and debris‐flow
    activity in an alpine catchment. <i>Journal of Geophysical Research: Earth Surface</i>.
    American Geophysical Union. <a href="https://doi.org/10.1029/2020jf005739">https://doi.org/10.1029/2020jf005739</a>'
  chicago: 'Hirschberg, Jacob, Simone Fatichi, Georgina L. Bennett, Brian W. McArdell,
    Nadav Peleg, Stuart N. Lane, Fritz Schlunegger, and Peter Molnar. “Climate Change
    Impacts on Sediment Yield and Debris‐flow Activity in an Alpine Catchment.” <i>Journal
    of Geophysical Research: Earth Surface</i>. American Geophysical Union, 2021.
    <a href="https://doi.org/10.1029/2020jf005739">https://doi.org/10.1029/2020jf005739</a>.'
  ieee: 'J. Hirschberg <i>et al.</i>, “Climate change impacts on sediment yield and
    debris‐flow activity in an alpine catchment,” <i>Journal of Geophysical Research:
    Earth Surface</i>, vol. 126, no. 1. American Geophysical Union, 2021.'
  ista: 'Hirschberg J, Fatichi S, Bennett GL, McArdell BW, Peleg N, Lane SN, Schlunegger
    F, Molnar P. 2021. Climate change impacts on sediment yield and debris‐flow activity
    in an alpine catchment. Journal of Geophysical Research: Earth Surface. 126(1),
    e2020JF005739.'
  mla: 'Hirschberg, Jacob, et al. “Climate Change Impacts on Sediment Yield and Debris‐flow
    Activity in an Alpine Catchment.” <i>Journal of Geophysical Research: Earth Surface</i>,
    vol. 126, no. 1, e2020JF005739, American Geophysical Union, 2021, doi:<a href="https://doi.org/10.1029/2020jf005739">10.1029/2020jf005739</a>.'
  short: 'J. Hirschberg, S. Fatichi, G.L. Bennett, B.W. McArdell, N. Peleg, S.N. Lane,
    F. Schlunegger, P. Molnar, Journal of Geophysical Research: Earth Surface 126
    (2021).'
das_tickbox: '1'
date_created: 2026-07-27T12:30:24Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2026-08-07T09:02:32Z
day: '01'
doi: 10.1029/2020jf005739
extern: '1'
intvolume: '       126'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ' https://doi.org/10.1029/2020JF005739'
month: '01'
oa: 1
oa_version: Published Version
publication: 'Journal of Geophysical Research: Earth Surface'
publication_identifier:
  eissn:
  - 2169-9011
  issn:
  - 2169-9003
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: Climate change impacts on sediment yield and debris‐flow activity in an alpine
  catchment
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 126
year: '2021'
...
---
_id: '10325'
abstract:
- lang: eng
  text: Since the inception of Bitcoin, a plethora of distributed ledgers differing
    in design and purpose has been created. While by design, blockchains provide no
    means to securely communicate with external systems, numerous attempts towards
    trustless cross-chain communication have been proposed over the years. Today,
    cross-chain communication (CCC) plays a fundamental role in cryptocurrency exchanges,
    scalability efforts via sharding, extension of existing systems through sidechains,
    and bootstrapping of new blockchains. Unfortunately, existing proposals are designed
    ad-hoc for specific use-cases, making it hard to gain confidence in their correctness
    and composability. We provide the first systematic exposition of cross-chain communication
    protocols. We formalize the underlying research problem and show that CCC is impossible
    without a trusted third party, contrary to common beliefs in the blockchain community.
    With this result in mind, we develop a framework to design new and evaluate existing
    CCC protocols, focusing on the inherent trust assumptions thereof, and derive
    a classification covering the field of cross-chain communication to date. We conclude
    by discussing open challenges for CCC research and the implications of interoperability
    on the security and privacy of blockchains.
acknowledgement: 'We would like express our gratitude to Georgia Avarikioti, Daniel
  Perez and Dominik Harz for helpful comments and feedback on earlier versions of
  this manuscript. We also thank Nicholas Stifter, Aljosha Judmayer, Philipp Schindler,
  Edgar Weippl, and Alistair Stewart for insightful discussions during the early stages
  of this research. We also wish to thank the anonymous reviewers for their valuable
  comments that helped improve the presentation of our results. This research was
  funded by Bridge 1 858561 SESC; Bridge 1 864738 PR4DLT (all FFG); the Christian
  Doppler Laboratory for Security and Quality Improvement in the Production System
  Lifecycle (CDL-SQI); the competence center SBA-K1 funded by COMET; Chaincode Labs
  through the project SLN: Scalability for the Lightning Network; and by the Austrian
  Science Fund (FWF) through the Meitner program (project M-2608). Mustafa Al-Bassam
  is funded by a scholarship from the Alan Turing Institute. Alexei Zamyatin conducted
  the early stages of this work during his time at SBA Research, and was supported
  by a Binance Research Fellowship.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexei
  full_name: Zamyatin, Alexei
  last_name: Zamyatin
- first_name: Mustafa
  full_name: Al-Bassam, Mustafa
  last_name: Al-Bassam
- first_name: Dionysis
  full_name: Zindros, Dionysis
  last_name: Zindros
- first_name: Eleftherios
  full_name: Kokoris Kogias, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: Kokoris Kogias
  orcid: 0000-0002-8827-3382
- first_name: Pedro
  full_name: Moreno-Sanchez, Pedro
  last_name: Moreno-Sanchez
- first_name: Aggelos
  full_name: Kiayias, Aggelos
  last_name: Kiayias
- first_name: William J.
  full_name: Knottenbelt, William J.
  last_name: Knottenbelt
citation:
  ama: 'Zamyatin A, Al-Bassam M, Zindros D, et al. SoK: Communication across distributed
    ledgers. In: <i>25th International Conference on Financial Cryptography and Data
    Security</i>. Vol 12675. Springer Nature; 2021:3-36. doi:<a href="https://doi.org/10.1007/978-3-662-64331-0_1">10.1007/978-3-662-64331-0_1</a>'
  apa: 'Zamyatin, A., Al-Bassam, M., Zindros, D., Kokoris Kogias, E., Moreno-Sanchez,
    P., Kiayias, A., &#38; Knottenbelt, W. J. (2021). SoK: Communication across distributed
    ledgers. In <i>25th International Conference on Financial Cryptography and Data
    Security</i> (Vol. 12675, pp. 3–36). Virtual: Springer Nature. <a href="https://doi.org/10.1007/978-3-662-64331-0_1">https://doi.org/10.1007/978-3-662-64331-0_1</a>'
  chicago: 'Zamyatin, Alexei, Mustafa Al-Bassam, Dionysis Zindros, Eleftherios Kokoris
    Kogias, Pedro Moreno-Sanchez, Aggelos Kiayias, and William J. Knottenbelt. “SoK:
    Communication across Distributed Ledgers.” In <i>25th International Conference
    on Financial Cryptography and Data Security</i>, 12675:3–36. Springer Nature,
    2021. <a href="https://doi.org/10.1007/978-3-662-64331-0_1">https://doi.org/10.1007/978-3-662-64331-0_1</a>.'
  ieee: 'A. Zamyatin <i>et al.</i>, “SoK: Communication across distributed ledgers,”
    in <i>25th International Conference on Financial Cryptography and Data Security</i>,
    Virtual, 2021, vol. 12675, pp. 3–36.'
  ista: 'Zamyatin A, Al-Bassam M, Zindros D, Kokoris Kogias E, Moreno-Sanchez P, Kiayias
    A, Knottenbelt WJ. 2021. SoK: Communication across distributed ledgers. 25th International
    Conference on Financial Cryptography and Data Security. FC: Financial Cryptography,
    LNCS, vol. 12675, 3–36.'
  mla: 'Zamyatin, Alexei, et al. “SoK: Communication across Distributed Ledgers.”
    <i>25th International Conference on Financial Cryptography and Data Security</i>,
    vol. 12675, Springer Nature, 2021, pp. 3–36, doi:<a href="https://doi.org/10.1007/978-3-662-64331-0_1">10.1007/978-3-662-64331-0_1</a>.'
  short: A. Zamyatin, M. Al-Bassam, D. Zindros, E. Kokoris Kogias, P. Moreno-Sanchez,
    A. Kiayias, W.J. Knottenbelt, in:, 25th International Conference on Financial
    Cryptography and Data Security, Springer Nature, 2021, pp. 3–36.
conference:
  end_date: 2021-03-05
  location: Virtual
  name: 'FC: Financial Cryptography'
  start_date: 2021-03-01
cryptoeprintid: 1
date_created: 2021-11-21T23:01:29Z
date_published: 2021-10-23T00:00:00Z
date_updated: 2026-08-11T08:05:29Z
day: '23'
department:
- _id: ElKo
doi: 10.1007/978-3-662-64331-0_1
external_id:
  cryptoeprintid:
  - 2019/1128
  isi:
  - '000712016200001'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2019/1128
month: '10'
oa: 1
oa_version: Preprint
page: 3-36
publication: 25th International Conference on Financial Cryptography and Data Security
publication_identifier:
  eisbn:
  - 978-3-662-64331-0
  eissn:
  - 1611-3349
  isbn:
  - 9-783-6626-4330-3
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '8304'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: 'SoK: Communication across distributed ledgers'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: '12675 '
year: '2021'
...
---
_id: '10599'
abstract:
- lang: eng
  text: A two-part successive syndrome-check decoding of polar codes is proposed with
    the first part successively refining the received codeword and the second part
    checking its syndrome. A new formulation of the successive-cancellation (SC) decoding
    algorithm is presented that allows for successively refining the received codeword
    by comparing the log-likelihood ratio value of a frozen bit with its predefined
    value. The syndrome of the refined received codeword is then checked for possible
    errors. In case there are no errors, the decoding process is terminated. Otherwise,
    the decoder continues to refine the received codeword. The proposed method is
    extended to the case of SC list (SCL) decoding by terminating the decoding process
    when the syndrome of the best candidate in the list indicates no errors. Simulation
    results show that the proposed method reduces the time-complexity of SC and SCL
    decoders and their fast variants, especially at high signal-to-noise ratios.
acknowledgement: This work is supported in part by ONR grant N00014-18-1-2191. S.
  A. Hashemi was supported by a Postdoctoral Fellowship from the Natural Sciences
  and Engineering Research Council of Canada (NSERC) and by Huawei. M. Mondelli was
  partially supported by the 2019 Lopez-Loreta Prize.
article_processing_charge: No
arxiv: 1
author:
- first_name: Seyyed Ali
  full_name: Hashemi, Seyyed Ali
  last_name: Hashemi
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: John
  full_name: Cioffi, John
  last_name: Cioffi
- first_name: Andrea
  full_name: Goldsmith, Andrea
  last_name: Goldsmith
citation:
  ama: 'Hashemi SA, Mondelli M, Cioffi J, Goldsmith A. Successive syndrome-check decoding
    of polar codes. In: <i>Proceedings of the 55th Asilomar Conference on Signals,
    Systems, and Computers</i>. Vol 2021-October. IEEE; 2021:943-947. doi:<a href="https://doi.org/10.1109/IEEECONF53345.2021.9723394">10.1109/IEEECONF53345.2021.9723394</a>'
  apa: 'Hashemi, S. A., Mondelli, M., Cioffi, J., &#38; Goldsmith, A. (2021). Successive
    syndrome-check decoding of polar codes. In <i>Proceedings of the 55th Asilomar
    Conference on Signals, Systems, and Computers</i> (Vol. 2021–October, pp. 943–947).
    Virtual, Pacific Grove, CA, United States: IEEE. <a href="https://doi.org/10.1109/IEEECONF53345.2021.9723394">https://doi.org/10.1109/IEEECONF53345.2021.9723394</a>'
  chicago: Hashemi, Seyyed Ali, Marco Mondelli, John Cioffi, and Andrea Goldsmith.
    “Successive Syndrome-Check Decoding of Polar Codes.” In <i>Proceedings of the
    55th Asilomar Conference on Signals, Systems, and Computers</i>, 2021–October:943–47.
    IEEE, 2021. <a href="https://doi.org/10.1109/IEEECONF53345.2021.9723394">https://doi.org/10.1109/IEEECONF53345.2021.9723394</a>.
  ieee: S. A. Hashemi, M. Mondelli, J. Cioffi, and A. Goldsmith, “Successive syndrome-check
    decoding of polar codes,” in <i>Proceedings of the 55th Asilomar Conference on
    Signals, Systems, and Computers</i>, Virtual, Pacific Grove, CA, United States,
    2021, vol. 2021–October, pp. 943–947.
  ista: 'Hashemi SA, Mondelli M, Cioffi J, Goldsmith A. 2021. Successive syndrome-check
    decoding of polar codes. Proceedings of the 55th Asilomar Conference on Signals,
    Systems, and Computers. ACSSC: Asilomar Conference on Signals, Systems, and Computers
    vol. 2021–October, 943–947.'
  mla: Hashemi, Seyyed Ali, et al. “Successive Syndrome-Check Decoding of Polar Codes.”
    <i>Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers</i>,
    vol. 2021–October, IEEE, 2021, pp. 943–47, doi:<a href="https://doi.org/10.1109/IEEECONF53345.2021.9723394">10.1109/IEEECONF53345.2021.9723394</a>.
  short: S.A. Hashemi, M. Mondelli, J. Cioffi, A. Goldsmith, in:, Proceedings of the
    55th Asilomar Conference on Signals, Systems, and Computers, IEEE, 2021, pp. 943–947.
conference:
  end_date: 2021-11-03
  location: Virtual, Pacific Grove, CA, United States
  name: 'ACSSC: Asilomar Conference on Signals, Systems, and Computers'
  start_date: 2021-10-31
date_created: 2022-01-03T11:39:51Z
date_published: 2021-11-01T00:00:00Z
date_updated: 2026-08-12T06:36:04Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/IEEECONF53345.2021.9723394
external_id:
  arxiv:
  - '2112.00057'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ' https://doi.org/10.48550/arXiv.2112.00057'
month: '11'
oa: 1
oa_version: Preprint
page: 943-947
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
  name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: Proceedings of the 55th Asilomar Conference on Signals, Systems, and
  Computers
publication_identifier:
  isbn:
  - '9781665458283'
  issn:
  - 1058-6393
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Successive syndrome-check decoding of polar codes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2021-October
year: '2021'
...
---
OA_place: repository
OA_type: green
_id: '10597'
abstract:
- lang: eng
  text: We thank Emmanuel Abbe and Min Ye for providing us the implementation of RPA
    decoding. D. Fathollahi and M. Mondelli are partially supported by the 2019 Lopez-Loreta
    Prize. N. Farsad is supported by Discovery Grant from the Natural Sciences and
    Engineering Research Council of Canada (NSERC) and Canada Foundation for Innovation
    (CFI), John R. Evans Leader Fund. S. A. Hashemi is supported by a Postdoctoral
    Fellowship from NSERC.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dorsa
  full_name: Fathollahi, Dorsa
  id: 712472af-8a7e-11f1-848f-9768b0c2fdf8
  last_name: Fathollahi
- first_name: Nariman
  full_name: Farsad, Nariman
  last_name: Farsad
- first_name: Seyyed Ali
  full_name: Hashemi, Seyyed Ali
  last_name: Hashemi
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
citation:
  ama: 'Fathollahi D, Farsad N, Hashemi SA, Mondelli M. Sparse multi-decoder recursive
    projection aggregation for Reed-Muller codes. In: <i>2021 IEEE International Symposium
    on Information Theory</i>. IEEE; 2021:1082-1087. doi:<a href="https://doi.org/10.1109/isit45174.2021.9517887">10.1109/isit45174.2021.9517887</a>'
  apa: 'Fathollahi, D., Farsad, N., Hashemi, S. A., &#38; Mondelli, M. (2021). Sparse
    multi-decoder recursive projection aggregation for Reed-Muller codes. In <i>2021
    IEEE International Symposium on Information Theory</i> (pp. 1082–1087). Virtual,
    Melbourne, Australia: IEEE. <a href="https://doi.org/10.1109/isit45174.2021.9517887">https://doi.org/10.1109/isit45174.2021.9517887</a>'
  chicago: Fathollahi, Dorsa, Nariman Farsad, Seyyed Ali Hashemi, and Marco Mondelli.
    “Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes.”
    In <i>2021 IEEE International Symposium on Information Theory</i>, 1082–87. IEEE,
    2021. <a href="https://doi.org/10.1109/isit45174.2021.9517887">https://doi.org/10.1109/isit45174.2021.9517887</a>.
  ieee: D. Fathollahi, N. Farsad, S. A. Hashemi, and M. Mondelli, “Sparse multi-decoder
    recursive projection aggregation for Reed-Muller codes,” in <i>2021 IEEE International
    Symposium on Information Theory</i>, Virtual, Melbourne, Australia, 2021, pp.
    1082–1087.
  ista: 'Fathollahi D, Farsad N, Hashemi SA, Mondelli M. 2021. Sparse multi-decoder
    recursive projection aggregation for Reed-Muller codes. 2021 IEEE International
    Symposium on Information Theory. ISIT: International Symposium on Information
    Theory, 1082–1087.'
  mla: Fathollahi, Dorsa, et al. “Sparse Multi-Decoder Recursive Projection Aggregation
    for Reed-Muller Codes.” <i>2021 IEEE International Symposium on Information Theory</i>,
    IEEE, 2021, pp. 1082–87, doi:<a href="https://doi.org/10.1109/isit45174.2021.9517887">10.1109/isit45174.2021.9517887</a>.
  short: D. Fathollahi, N. Farsad, S.A. Hashemi, M. Mondelli, in:, 2021 IEEE International
    Symposium on Information Theory, IEEE, 2021, pp. 1082–1087.
conference:
  end_date: 2021-07-20
  location: Virtual, Melbourne, Australia
  name: 'ISIT: International Symposium on Information Theory'
  start_date: 2021-07-12
date_created: 2022-01-03T11:31:26Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2026-08-12T06:36:19Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/isit45174.2021.9517887
external_id:
  arxiv:
  - '2011.12882'
  isi:
  - '000701502201029'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2011.12882
month: '09'
oa: 1
oa_version: Preprint
page: 1082-1087
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
  name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 2021 IEEE International Symposium on Information Theory
publication_identifier:
  eisbn:
  - 978-1-5386-8209-8
  isbn:
  - 978-1-5386-8210-4
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sparse multi-decoder recursive projection aggregation for Reed-Muller codes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10002'
abstract:
- lang: eng
  text: 'We present a faster symbolic algorithm for the following central problem
    in probabilistic verification: Compute the maximal end-component (MEC) decomposition
    of Markov decision processes (MDPs). This problem generalizes the SCC decomposition
    problem of graphs and closed recurrent sets of Markov chains. The model of symbolic
    algorithms is widely used in formal verification and model-checking, where access
    to the input model is restricted to only symbolic operations (e.g., basic set
    operations and computation of one-step neighborhood). For an input MDP with  n  vertices
    and  m  edges, the classical symbolic algorithm from the 1990s for the MEC decomposition
    requires  O(n2)  symbolic operations and  O(1)  symbolic space. The only other
    symbolic algorithm for the MEC decomposition requires  O(nm−−√)  symbolic operations
    and  O(m−−√)  symbolic space. A main open question is whether the worst-case  O(n2)  bound
    for symbolic operations can be beaten. We present a symbolic algorithm that requires  O˜(n1.5)  symbolic
    operations and  O˜(n−−√)  symbolic space. Moreover, the parametrization of our
    algorithm provides a trade-off between symbolic operations and symbolic space:
    for all  0<ϵ≤1/2  the symbolic algorithm requires  O˜(n2−ϵ)  symbolic operations
    and  O˜(nϵ)  symbolic space ( O˜  hides poly-logarithmic factors). Using our techniques
    we present faster algorithms for computing the almost-sure winning regions of  ω
    -regular objectives for MDPs. We consider the canonical parity objectives for  ω
    -regular objectives, and for parity objectives with  d -priorities we present
    an algorithm that computes the almost-sure winning region with  O˜(n2−ϵ)  symbolic
    operations and  O˜(nϵ)  symbolic space, for all  0<ϵ≤1/2 .'
acknowledgement: The authors are grateful to the anonymous referees for their valuable
  comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF)
  through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF)
  NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For
  M. H. the research leading to these results has received funding from the European
  Research Council under the European Unions Seventh Framework Programme (FP/2007–2013)
  / ERC Grant Agreement no. 340506.
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Wolfgang
  full_name: Dvorak, Wolfgang
  last_name: Dvorak
- 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: Alexander
  full_name: Svozil, Alexander
  last_name: Svozil
citation:
  ama: 'Chatterjee K, Dvorak W, Henzinger M, Svozil A. Symbolic time and space tradeoffs
    for probabilistic verification. In: <i>Proceedings of the 36th Annual ACM/IEEE
    Symposium on Logic in Computer Science</i>. IEEE; 2021:1-13. doi:<a href="https://doi.org/10.1109/LICS52264.2021.9470739">10.1109/LICS52264.2021.9470739</a>'
  apa: 'Chatterjee, K., Dvorak, W., Henzinger, M., &#38; Svozil, A. (2021). Symbolic
    time and space tradeoffs for probabilistic verification. In <i>Proceedings of
    the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 1–13).
    Rome, Italy: IEEE. <a href="https://doi.org/10.1109/LICS52264.2021.9470739">https://doi.org/10.1109/LICS52264.2021.9470739</a>'
  chicago: Chatterjee, Krishnendu, Wolfgang Dvorak, Monika Henzinger, and Alexander
    Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In
    <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>,
    1–13. IEEE, 2021. <a href="https://doi.org/10.1109/LICS52264.2021.9470739">https://doi.org/10.1109/LICS52264.2021.9470739</a>.
  ieee: K. Chatterjee, W. Dvorak, M. Henzinger, and A. Svozil, “Symbolic time and
    space tradeoffs for probabilistic verification,” in <i>Proceedings of the 36th
    Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Rome, Italy, 2021,
    pp. 1–13.
  ista: 'Chatterjee K, Dvorak W, Henzinger M, Svozil A. 2021. Symbolic time and space
    tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE
    Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.'
  mla: Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic
    Verification.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in
    Computer Science</i>, IEEE, 2021, pp. 1–13, doi:<a href="https://doi.org/10.1109/LICS52264.2021.9470739">10.1109/LICS52264.2021.9470739</a>.
  short: K. Chatterjee, W. Dvorak, M. Henzinger, A. Svozil, in:, Proceedings of the
    36th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2021, pp. 1–13.
conference:
  end_date: 2021-07-02
  location: Rome, Italy
  name: 'LICS: Logic in Computer Science'
  start_date: 2021-06-29
date_created: 2021-09-12T22:01:24Z
date_published: 2021-07-07T00:00:00Z
date_updated: 2026-08-12T06:39:42Z
day: '07'
department:
- _id: KrCh
doi: 10.1109/LICS52264.2021.9470739
ec_funded: 1
external_id:
  arxiv:
  - '2104.07466'
  isi:
  - '000947350400089'
isi: 1
keyword:
- Computer science
- Computational modeling
- Markov processes
- Probabilistic logic
- Formal verification
- Game Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2104.07466
month: '07'
oa: 1
oa_version: Preprint
page: 1-13
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11407
  name: Game Theory
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
  call_identifier: H2020
  grant_number: '863818'
  name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer
  Science
publication_identifier:
  eisbn:
  - 978-1-6654-4895-6
  isbn:
  - 978-1-6654-4896-3
  issn:
  - 1043-6871
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Symbolic time and space tradeoffs for probabilistic verification
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9356'
abstract:
- lang: eng
  text: 'In runtime verification, a monitor watches a trace of a system and, if possible,
    decides after observing each finite prefix whether or not the unknown infinite
    trace satisfies a given specification. We generalize the theory of runtime verification
    to monitors that attempt to estimate numerical values of quantitative trace properties
    (instead of attempting to conclude boolean values of trace specifications), such
    as maximal or average response time along a trace. Quantitative monitors are approximate:
    with every finite prefix, they can improve their estimate of the infinite trace''s
    unknown property value. Consequently, quantitative monitors can be compared with
    regard to a precision-cost trade-off: better approximations of the property value
    require more monitor resources, such as states (in the case of finite-state monitors)
    or registers, and additional resources yield better approximations. We introduce
    a formal framework for quantitative and approximate monitoring, show how it conservatively
    generalizes the classical boolean setting for monitoring, and give several precision-cost
    trade-offs for monitors. For example, we prove that there are quantitative properties
    for which every additional register improves monitoring precision.'
acknowledgement: We thank the anonymous reviewers for their helpful comments. This
  research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23
  (Wittgenstein Award).
article_number: '9470547'
article_processing_charge: No
arxiv: 1
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. Quantitative and approximate monitoring. In: <i>Proceedings
    of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE;
    2021. doi:<a href="https://doi.org/10.1109/LICS52264.2021.9470547">10.1109/LICS52264.2021.9470547</a>'
  apa: 'Henzinger, T. A., &#38; Sarac, N. E. (2021). Quantitative and approximate
    monitoring. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in
    Computer Science</i>. Online: IEEE. <a href="https://doi.org/10.1109/LICS52264.2021.9470547">https://doi.org/10.1109/LICS52264.2021.9470547</a>'
  chicago: Henzinger, Thomas A, and Naci E Sarac. “Quantitative and Approximate Monitoring.”
    In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>.
    IEEE, 2021. <a href="https://doi.org/10.1109/LICS52264.2021.9470547">https://doi.org/10.1109/LICS52264.2021.9470547</a>.
  ieee: T. A. Henzinger and N. E. Sarac, “Quantitative and approximate monitoring,”
    in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>,
    Online, 2021.
  ista: 'Henzinger TA, Sarac NE. 2021. Quantitative and approximate monitoring. Proceedings
    of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic
    in Computer Science, 9470547.'
  mla: Henzinger, Thomas A., and Naci E. Sarac. “Quantitative and Approximate Monitoring.”
    <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>,
    9470547, IEEE, 2021, doi:<a href="https://doi.org/10.1109/LICS52264.2021.9470547">10.1109/LICS52264.2021.9470547</a>.
  short: T.A. Henzinger, N.E. Sarac, in:, Proceedings of the 36th Annual ACM/IEEE
    Symposium on Logic in Computer Science, IEEE, 2021.
conference:
  end_date: 2021-07-02
  location: Online
  name: 'LICS: Logic in Computer Science'
  start_date: 2021-06-29
date_created: 2021-04-30T17:30:47Z
date_published: 2021-06-29T00:00:00Z
date_updated: 2026-08-12T06:39:11Z
day: '29'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.1109/LICS52264.2021.9470547
external_id:
  arxiv:
  - '2105.08353'
  isi:
  - '000947350400021'
file:
- access_level: open_access
  checksum: 6e4cba3f72775f479c5b1b75d1a4a0c4
  content_type: application/pdf
  creator: esarac
  date_created: 2021-06-16T08:23:54Z
  date_updated: 2021-06-16T08:23:54Z
  file_id: '9557'
  file_name: qam.pdf
  file_size: 641990
  relation: main_file
  success: 1
file_date_updated: 2021-06-16T08:23:54Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
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: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer
  Science
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
  record:
  - id: '20147'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Quantitative and approximate monitoring
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10004'
abstract:
- lang: eng
  text: 'Markov chains are the de facto finite-state model for stochastic dynamical
    systems, and Markov decision processes (MDPs) extend Markov chains by incorporating
    non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization
    criterion is the maximal expected total reward where the MDP stops after T steps,
    which can be computed by a simple dynamic programming algorithm. We consider a
    natural generalization of the problem where the stopping times can be chosen according
    to a probability distribution, such that the expected stopping time is T, to optimize
    the expected total reward. Quite surprisingly we establish inter-reducibility
    of the expected stopping-time problem for Markov chains with the Positivity problem
    (which is related to the well-known Skolem problem), for which establishing either
    decidability or undecidability would be a major breakthrough. Given the hardness
    of the exact problem, we consider the approximate version of the problem: we show
    that it can be solved in exponential time for Markov chains and in exponential
    space for MDPs.'
acknowledgement: We are grateful to the anonymous reviewers of LICS 2021 and of a
  previous version of this paper for insightful comments that helped improving the
  presentation. This research was partially supported by the grant ERC CoG 863818
  (ForM-SMArt).
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Laurent
  full_name: Doyen, Laurent
  last_name: Doyen
citation:
  ama: 'Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In:
    <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>.
    IEEE; 2021:1-13. doi:<a href="https://doi.org/10.1109/LICS52264.2021.9470595">10.1109/LICS52264.2021.9470595</a>'
  apa: 'Chatterjee, K., &#38; Doyen, L. (2021). Stochastic processes with expected
    stopping time. In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
    in Computer Science</i> (pp. 1–13). Rome, Italy: IEEE. <a href="https://doi.org/10.1109/LICS52264.2021.9470595">https://doi.org/10.1109/LICS52264.2021.9470595</a>'
  chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected
    Stopping Time.” In <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
    in Computer Science</i>, 1–13. IEEE, 2021. <a href="https://doi.org/10.1109/LICS52264.2021.9470595">https://doi.org/10.1109/LICS52264.2021.9470595</a>.
  ieee: K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,”
    in <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science</i>,
    Rome, Italy, 2021, pp. 1–13.
  ista: 'Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping
    time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science.
    LICS: Logic in Computer Science, 1–13.'
  mla: Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected
    Stopping Time.” <i>Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
    in Computer Science</i>, IEEE, 2021, pp. 1–13, doi:<a href="https://doi.org/10.1109/LICS52264.2021.9470595">10.1109/LICS52264.2021.9470595</a>.
  short: K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium
    on Logic in Computer Science, IEEE, 2021, pp. 1–13.
conference:
  end_date: 2021-07-02
  location: Rome, Italy
  name: 'LICS: Logic in Computer Science'
  start_date: 2021-06-29
date_created: 2021-09-12T22:01:25Z
date_published: 2021-07-07T00:00:00Z
date_updated: 2026-08-12T06:39:27Z
day: '07'
department:
- _id: KrCh
doi: 10.1109/LICS52264.2021.9470595
ec_funded: 1
external_id:
  arxiv:
  - '2104.07278'
  isi:
  - '000947350400036'
isi: 1
keyword:
- Computer science
- Heuristic algorithms
- Memory management
- Automata
- Markov processes
- Probability distribution
- Complexity theory
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2104.07278
month: '07'
oa: 1
oa_version: Preprint
page: 1-13
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
  call_identifier: H2020
  grant_number: '863818'
  name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer
  Science
publication_identifier:
  eisbn:
  - 978-1-6654-4895-6
  isbn:
  - 978-1-6654-4896-3
  issn:
  - 1043-6871
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
  record:
  - id: '18630'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Stochastic processes with expected stopping time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9828'
abstract:
- lang: eng
  text: Amplitude demodulation is a classical operation used in signal processing.
    For a long time, its effective applications in practice have been limited to narrowband
    signals. In this work, we generalize amplitude demodulation to wideband signals.
    We pose demodulation as a recovery problem of an oversampled corrupted signal
    and introduce special iterative schemes belonging to the family of alternating
    projection algorithms to solve it. Sensibly chosen structural assumptions on the
    demodulation outputs allow us to reveal the high inferential accuracy of the method
    over a rich set of relevant signals. This new approach surpasses current state-of-the-art
    demodulation techniques apt to wideband signals in computational efficiency by
    up to many orders of magnitude with no sacrifice in quality. Such performance
    opens the door for applications of the amplitude demodulation procedure in new
    contexts. In particular, the new method makes online and large-scale offline data
    processing feasible, including the calculation of modulator-carrier pairs in higher
    dimensions and poor sampling conditions, independent of the signal bandwidth.
    We illustrate the utility and specifics of applications of the new method in practice
    by using natural speech and synthetic signals.
acknowledgement: The author thanks his colleagues K. Huszár and G. Tkačik for valuable
  discussions and comments on the manuscript.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Mantas
  full_name: Gabrielaitis, Mantas
  id: 4D5B0CBC-F248-11E8-B48F-1D18A9856A87
  last_name: Gabrielaitis
  orcid: 0000-0002-7758-2016
citation:
  ama: Gabrielaitis M. Fast and accurate amplitude demodulation of wideband signals.
    <i>IEEE Transactions on Signal Processing</i>. 2021;69:4039-4054. doi:<a href="https://doi.org/10.1109/TSP.2021.3087899">10.1109/TSP.2021.3087899</a>
  apa: Gabrielaitis, M. (2021). Fast and accurate amplitude demodulation of wideband
    signals. <i>IEEE Transactions on Signal Processing</i>. IEEE. <a href="https://doi.org/10.1109/TSP.2021.3087899">https://doi.org/10.1109/TSP.2021.3087899</a>
  chicago: Gabrielaitis, Mantas. “Fast and Accurate Amplitude Demodulation of Wideband
    Signals.” <i>IEEE Transactions on Signal Processing</i>. IEEE, 2021. <a href="https://doi.org/10.1109/TSP.2021.3087899">https://doi.org/10.1109/TSP.2021.3087899</a>.
  ieee: M. Gabrielaitis, “Fast and accurate amplitude demodulation of wideband signals,”
    <i>IEEE Transactions on Signal Processing</i>, vol. 69. IEEE, pp. 4039–4054, 2021.
  ista: Gabrielaitis M. 2021. Fast and accurate amplitude demodulation of wideband
    signals. IEEE Transactions on Signal Processing. 69, 4039–4054.
  mla: Gabrielaitis, Mantas. “Fast and Accurate Amplitude Demodulation of Wideband
    Signals.” <i>IEEE Transactions on Signal Processing</i>, vol. 69, IEEE, 2021,
    pp. 4039–54, doi:<a href="https://doi.org/10.1109/TSP.2021.3087899">10.1109/TSP.2021.3087899</a>.
  short: M. Gabrielaitis, IEEE Transactions on Signal Processing 69 (2021) 4039–4054.
corr_author: '1'
date_created: 2021-08-08T22:01:31Z
date_published: 2021-06-09T00:00:00Z
date_updated: 2026-08-12T06:42:41Z
day: '09'
department:
- _id: GaTk
doi: 10.1109/TSP.2021.3087899
external_id:
  arxiv:
  - '2102.04832'
  isi:
  - '000682123900002'
intvolume: '        69'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2102.04832
month: '06'
oa: 1
oa_version: Preprint
page: 4039 - 4054
publication: IEEE Transactions on Signal Processing
publication_identifier:
  eissn:
  - 1941-0476
  issn:
  - 1053-587X
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fast and accurate amplitude demodulation of wideband signals
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 69
year: '2021'
...
---
_id: '10053'
abstract:
- lang: eng
  text: 'This paper characterizes the latency of the simplified successive-cancellation
    (SSC) decoding scheme for polar codes under hardware resource constraints. In
    particular, when the number of processing elements P that can perform SSC decoding
    operations in parallel is limited, as is the case in practice, the latency of
    SSC decoding is O(N1−1 μ+NPlog2log2NP), where N is the block length of the code
    and μ is the scaling exponent of polar codes for the channel. Three direct consequences
    of this bound are presented. First, in a fully-parallel implementation where P=N2
    , the latency of SSC decoding is O(N1−1/μ) , which is sublinear in the block length.
    This recovers a result from an earlier work. Second, in a fully-serial implementation
    where P=1 , the latency of SSC decoding scales as O(Nlog2log2N) . The multiplicative
    constant is also calculated: we show that the latency of SSC decoding when P=1
    is given by (2+o(1))Nlog2log2N . Third, in a semi-parallel implementation, the
    smallest P that gives the same latency as that of the fully-parallel implementation
    is P=N1/μ . The tightness of our bound on SSC decoding latency and the applicability
    of the foregoing results is validated through extensive simulations.'
acknowledgement: "S. A. Hashemi is supported by a Postdoctoral Fellowship from the
  Natural Sciences and Engineering Research Council\r\nof Canada (NSERC) and by Huawei.
  M. Mondelli is partially supported by the 2019 Lopez-Loreta Prize. A. Fazeli and
  A. Vardy were supported in part by the National Science Foundation under Grant CCF-1764104."
article_processing_charge: No
arxiv: 1
author:
- first_name: Seyyed Ali
  full_name: Hashemi, Seyyed Ali
  last_name: Hashemi
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: Arman
  full_name: Fazeli, Arman
  last_name: Fazeli
- first_name: Alexander
  full_name: Vardy, Alexander
  last_name: Vardy
- first_name: John
  full_name: Cioffi, John
  last_name: Cioffi
- first_name: Andrea
  full_name: Goldsmith, Andrea
  last_name: Goldsmith
citation:
  ama: 'Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism
    versus latency in simplified successive-cancellation decoding of polar codes.
    In: <i>2021 IEEE International Symposium on Information Theory</i>. IEEE; 2021:2369-2374.
    doi:<a href="https://doi.org/10.1109/ISIT45174.2021.9518153">10.1109/ISIT45174.2021.9518153</a>'
  apa: 'Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., &#38; Goldsmith,
    A. (2021). Parallelism versus latency in simplified successive-cancellation decoding
    of polar codes. In <i>2021 IEEE International Symposium on Information Theory</i>
    (pp. 2369–2374). Melbourne, Australia: IEEE. <a href="https://doi.org/10.1109/ISIT45174.2021.9518153">https://doi.org/10.1109/ISIT45174.2021.9518153</a>'
  chicago: Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John
    Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation
    Decoding of Polar Codes.” In <i>2021 IEEE International Symposium on Information
    Theory</i>, 2369–74. IEEE, 2021. <a href="https://doi.org/10.1109/ISIT45174.2021.9518153">https://doi.org/10.1109/ISIT45174.2021.9518153</a>.
  ieee: S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith,
    “Parallelism versus latency in simplified successive-cancellation decoding of
    polar codes,” in <i>2021 IEEE International Symposium on Information Theory</i>,
    Melbourne, Australia, 2021, pp. 2369–2374.
  ista: 'Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2021. Parallelism
    versus latency in simplified successive-cancellation decoding of polar codes.
    2021 IEEE International Symposium on Information Theory. ISIT: International Symposium
    on Information Theory, 2369–2374.'
  mla: Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation
    Decoding of Polar Codes.” <i>2021 IEEE International Symposium on Information
    Theory</i>, IEEE, 2021, pp. 2369–74, doi:<a href="https://doi.org/10.1109/ISIT45174.2021.9518153">10.1109/ISIT45174.2021.9518153</a>.
  short: S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith,
    in:, 2021 IEEE International Symposium on Information Theory, IEEE, 2021, pp.
    2369–2374.
conference:
  end_date: 2021-07-20
  location: Melbourne, Australia
  name: 'ISIT: International Symposium on Information Theory'
  start_date: 2021-07-12
date_created: 2021-09-27T14:33:14Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2026-08-12T06:43:01Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/ISIT45174.2021.9518153
external_id:
  arxiv:
  - '2012.13378'
  isi:
  - '000701502202078'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2012.13378
month: '09'
oa: 1
oa_version: Preprint
page: 2369-2374
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
  name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 2021 IEEE International Symposium on Information Theory
publication_identifier:
  eisbn:
  - 978-1-5386-8209-8
  isbn:
  - 978-1-5386-8210-4
  issn:
  - 2157-8095
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
  record:
  - id: '10364'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Parallelism versus latency in simplified successive-cancellation decoding of
  polar codes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '22584'
abstract:
- lang: eng
  text: Higher temperatures in urban areas expose a large fraction of the human population
    to potentially dangerous heat stress. Green spaces are promoted worldwide as local
    and city-scale cooling strategies but the amount, type, and functioning of vegetation
    in cities lack quantification and their interaction with urban climate in different
    settings remains a matter of debate. Here we use state-of-the-art remote sensing
    data from 145 city clusters to disentangle the drivers of surface urban heat islands
    (SUHI) intensity and quantify urban-rural differences in vegetation cover, species
    composition, and evaporative cooling. We show that nighttime SUHIs are affected
    mostly by abiotic factors, while daytime SUHIs are highly correlated with vegetation
    characteristics and the wetness of the background climate. Magnitude and seasonality
    of daytime SUHIs are controlled by urban-rural differences in plant transpiration
    and leaf area, which explain the dependence of SUHIs on wetness conditions. Leaf
    area differences are caused primarily by changes in vegetation type and a loss
    of in-city forested areas, highlighting the importance of maintaining “natural
    reserves” as a sustainable heat mitigation policy.
article_number: e2020AV000303
article_processing_charge: No
article_type: original
author:
- first_name: Athanasios
  full_name: Paschalis, Athanasios
  last_name: Paschalis
- first_name: TC
  full_name: Chakraborty, TC
  last_name: Chakraborty
- first_name: Simone
  full_name: Fatichi, Simone
  id: cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6
  last_name: Fatichi
- first_name: Naika
  full_name: Meili, Naika
  last_name: Meili
- first_name: Gabriele
  full_name: Manoli, Gabriele
  last_name: Manoli
citation:
  ama: Paschalis A, Chakraborty T, Fatichi S, Meili N, Manoli G. Urban forests as
    main regulator of the evaporative cooling effect in cities. <i>AGU Advances</i>.
    2021;2(2). doi:<a href="https://doi.org/10.1029/2020av000303">10.1029/2020av000303</a>
  apa: Paschalis, A., Chakraborty, T., Fatichi, S., Meili, N., &#38; Manoli, G. (2021).
    Urban forests as main regulator of the evaporative cooling effect in cities. <i>AGU
    Advances</i>. American Geophysical Union. <a href="https://doi.org/10.1029/2020av000303">https://doi.org/10.1029/2020av000303</a>
  chicago: Paschalis, Athanasios, TC Chakraborty, Simone Fatichi, Naika Meili, and
    Gabriele Manoli. “Urban Forests as Main Regulator of the Evaporative Cooling Effect
    in Cities.” <i>AGU Advances</i>. American Geophysical Union, 2021. <a href="https://doi.org/10.1029/2020av000303">https://doi.org/10.1029/2020av000303</a>.
  ieee: A. Paschalis, T. Chakraborty, S. Fatichi, N. Meili, and G. Manoli, “Urban
    forests as main regulator of the evaporative cooling effect in cities,” <i>AGU
    Advances</i>, vol. 2, no. 2. American Geophysical Union, 2021.
  ista: Paschalis A, Chakraborty T, Fatichi S, Meili N, Manoli G. 2021. Urban forests
    as main regulator of the evaporative cooling effect in cities. AGU Advances. 2(2),
    e2020AV000303.
  mla: Paschalis, Athanasios, et al. “Urban Forests as Main Regulator of the Evaporative
    Cooling Effect in Cities.” <i>AGU Advances</i>, vol. 2, no. 2, e2020AV000303,
    American Geophysical Union, 2021, doi:<a href="https://doi.org/10.1029/2020av000303">10.1029/2020av000303</a>.
  short: A. Paschalis, T. Chakraborty, S. Fatichi, N. Meili, G. Manoli, AGU Advances
    2 (2021).
das_tickbox: '1'
date_created: 2026-07-27T12:30:25Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2026-08-12T08:20:04Z
day: '01'
doi: 10.1029/2020av000303
extern: '1'
intvolume: '         2'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1029/2020AV000303
month: '06'
oa: 1
oa_version: Published Version
publication: AGU Advances
publication_identifier:
  eissn:
  - 2576-604X
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
status: public
title: Urban forests as main regulator of the evaporative cooling effect in cities
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 2
year: '2021'
...
---
_id: '10738'
abstract:
- lang: eng
  text: We prove an adiabatic theorem for the Landau–Pekar equations. This allows
    us to derive new results on the accuracy of their use as effective equations for
    the time evolution generated by the Fröhlich Hamiltonian with large coupling constant
    α. In particular, we show that the time evolution of Pekar product states with
    coherent phonon field and the electron being trapped by the phonons is well approximated
    by the Landau–Pekar equations until times short compared to α2.
acknowledgement: "N. L. and R. S. gratefully acknowledge financial support by the
  European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research
  and innovation programme (grant\r\nagreement No 694227). B. S. acknowledges support
  from the Swiss National Science Foundation (grant 200020_172623) and from the NCCR
  SwissMAP. N. L. would like to thank\r\nAndreas Deuchert and David Mitrouskas for
  interesting discussions. B. S. and R. S. would\r\nlike to thank Rupert Frank for
  stimulating discussions about the time-evolution of a polaron.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nikolai K
  full_name: Leopold, Nikolai K
  id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
  last_name: Leopold
  orcid: 0000-0002-0495-6822
- first_name: Simone Anna Elvira
  full_name: Rademacher, Simone Anna Elvira
  id: 856966FE-A408-11E9-977E-802DE6697425
  last_name: Rademacher
  orcid: 0000-0001-5059-4466
- first_name: Benjamin
  full_name: Schlein, Benjamin
  last_name: Schlein
- first_name: Robert
  full_name: Seiringer, Robert
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: 'Leopold NK, Rademacher SAE, Schlein B, Seiringer R. The Landau–Pekar equations:
    Adiabatic theorem and accuracy. <i>Analysis and PDE</i>. 2021;14(7):2079-2100.
    doi:<a href="https://doi.org/10.2140/APDE.2021.14.2079">10.2140/APDE.2021.14.2079</a>'
  apa: 'Leopold, N. K., Rademacher, S. A. E., Schlein, B., &#38; Seiringer, R. (2021).
    The Landau–Pekar equations: Adiabatic theorem and accuracy. <i>Analysis and PDE</i>.
    Mathematical Sciences Publishers. <a href="https://doi.org/10.2140/APDE.2021.14.2079">https://doi.org/10.2140/APDE.2021.14.2079</a>'
  chicago: 'Leopold, Nikolai K, Simone Anna Elvira Rademacher, Benjamin Schlein, and
    Robert Seiringer. “The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.”
    <i>Analysis and PDE</i>. Mathematical Sciences Publishers, 2021. <a href="https://doi.org/10.2140/APDE.2021.14.2079">https://doi.org/10.2140/APDE.2021.14.2079</a>.'
  ieee: 'N. K. Leopold, S. A. E. Rademacher, B. Schlein, and R. Seiringer, “The Landau–Pekar
    equations: Adiabatic theorem and accuracy,” <i>Analysis and PDE</i>, vol. 14,
    no. 7. Mathematical Sciences Publishers, pp. 2079–2100, 2021.'
  ista: 'Leopold NK, Rademacher SAE, Schlein B, Seiringer R. 2021. The Landau–Pekar
    equations: Adiabatic theorem and accuracy. Analysis and PDE. 14(7), 2079–2100.'
  mla: 'Leopold, Nikolai K., et al. “The Landau–Pekar Equations: Adiabatic Theorem
    and Accuracy.” <i>Analysis and PDE</i>, vol. 14, no. 7, Mathematical Sciences
    Publishers, 2021, pp. 2079–100, doi:<a href="https://doi.org/10.2140/APDE.2021.14.2079">10.2140/APDE.2021.14.2079</a>.'
  short: N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE
    14 (2021) 2079–2100.
corr_author: '1'
date_created: 2022-02-06T23:01:33Z
date_published: 2021-11-10T00:00:00Z
date_updated: 2026-08-12T08:46:52Z
day: '10'
department:
- _id: RoSe
doi: 10.2140/APDE.2021.14.2079
ec_funded: 1
external_id:
  arxiv:
  - '1904.12532'
  isi:
  - '000733976600004'
intvolume: '        14'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1904.12532
month: '11'
oa: 1
oa_version: Preprint
page: 2079-2100
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '694227'
  name: Analysis of quantum many-body systems
publication: Analysis and PDE
publication_identifier:
  eissn:
  - 1948-206X
  issn:
  - 2157-5045
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The Landau–Pekar equations: Adiabatic theorem and accuracy'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2021'
...
---
_id: '9226'
abstract:
- lang: eng
  text: 'Half a century after Lewis Wolpert''s seminal conceptual advance on how cellular
    fates distribute in space, we provide a brief historical perspective on how the
    concept of positional information emerged and influenced the field of developmental
    biology and beyond. We focus on a modern interpretation of this concept in terms
    of information theory, largely centered on its application to cell specification
    in the early Drosophila embryo. We argue that a true physical variable (position)
    is encoded in local concentrations of patterning molecules, that this mapping
    is stochastic, and that the processes by which positions and corresponding cell
    fates are determined based on these concentrations need to take such stochasticity
    into account. With this approach, we shift the focus from biological mechanisms,
    molecules, genes and pathways to quantitative systems-level questions: where does
    positional information reside, how it is transformed and accessed during development,
    and what fundamental limits it is subject to?'
acknowledgement: This work was supported in part by the National Science Foundation,
  through the Center for the Physics of Biological Function (PHY-1734030), by the
  National Institutes of Health (R01GM097275) and by the Fonds zur Förderung der wissenschaftlichen
  Forschung (FWF P28844). Deposited in PMC for release after 12 months.
article_number: dev176065
article_processing_charge: No
article_type: original
author:
- 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: Thomas
  full_name: Gregor, Thomas
  last_name: Gregor
citation:
  ama: Tkačik G, Gregor T. The many bits of positional information. <i>Development</i>.
    2021;148(2). doi:<a href="https://doi.org/10.1242/dev.176065">10.1242/dev.176065</a>
  apa: Tkačik, G., &#38; Gregor, T. (2021). The many bits of positional information.
    <i>Development</i>. Company of Biologists. <a href="https://doi.org/10.1242/dev.176065">https://doi.org/10.1242/dev.176065</a>
  chicago: Tkačik, Gašper, and Thomas Gregor. “The Many Bits of Positional Information.”
    <i>Development</i>. Company of Biologists, 2021. <a href="https://doi.org/10.1242/dev.176065">https://doi.org/10.1242/dev.176065</a>.
  ieee: G. Tkačik and T. Gregor, “The many bits of positional information,” <i>Development</i>,
    vol. 148, no. 2. Company of Biologists, 2021.
  ista: Tkačik G, Gregor T. 2021. The many bits of positional information. Development.
    148(2), dev176065.
  mla: Tkačik, Gašper, and Thomas Gregor. “The Many Bits of Positional Information.”
    <i>Development</i>, vol. 148, no. 2, dev176065, Company of Biologists, 2021, doi:<a
    href="https://doi.org/10.1242/dev.176065">10.1242/dev.176065</a>.
  short: G. Tkačik, T. Gregor, Development 148 (2021).
date_created: 2021-03-07T23:01:25Z
date_published: 2021-02-01T00:00:00Z
date_updated: 2026-08-12T09:57:53Z
day: '01'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1242/dev.176065
external_id:
  isi:
  - '000613906000007'
  pmid:
  - '33526425'
intvolume: '       148'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1242/dev.176065
month: '02'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 254E9036-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P28844-B27
  name: Biophysics of information processing in gene regulation
publication: Development
publication_identifier:
  eissn:
  - 1477-9129
publication_status: published
publisher: Company of Biologists
quality_controlled: '1'
scopus_import: '1'
status: public
title: The many bits of positional information
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 148
year: '2021'
...
---
_id: '15262'
abstract:
- lang: eng
  text: The Hunchback (Hb) transcription factor is crucial for anterior-posterior
    patterning of the Drosophila embryo. The maternal hb mRNA acts as a paradigm for
    translational regulation due to its repression in the posterior of the embryo.
    However, little is known about the translatability of zygotically transcribed
    hb mRNAs. Here, we adapt the SunTag system, developed for imaging translation
    at single-mRNA resolution in tissue culture cells, to the Drosophila embryo to
    study the translation dynamics of zygotic hb mRNAs. Using single-molecule imaging
    in fixed and live embryos, we provide evidence for translational repression of
    zygotic SunTag-hb mRNAs. Whereas the proportion of SunTag-hb mRNAs translated
    is initially uniform, translation declines from the anterior over time until it
    becomes restricted to a posterior band in the expression domain. We discuss how
    regulated hb mRNA translation may help establish the sharp Hb expression boundary,
    which is a model for precision and noise during developmental patterning. Overall,
    our data show how use of the SunTag method on fixed and live embryos is a powerful
    combination for elucidating spatiotemporal regulation of mRNA translation in Drosophila.
article_number: dev196121.
article_processing_charge: No
article_type: original
author:
- first_name: Daisy J.
  full_name: Vinter, Daisy J.
  last_name: Vinter
- first_name: Caroline
  full_name: Hoppe, Caroline
  last_name: Hoppe
- first_name: Thomas
  full_name: Minchington, Thomas
  id: 7d1648cb-19e9-11eb-8e7a-f8c037fb3e3f
  last_name: Minchington
- first_name: Catherine
  full_name: Sutcliffe, Catherine
  last_name: Sutcliffe
- first_name: Hilary L.
  full_name: Ashe, Hilary L.
  last_name: Ashe
citation:
  ama: Vinter DJ, Hoppe C, Minchington T, Sutcliffe C, Ashe HL. Dynamics of hunchback
    translation in real-time and at single-mRNA resolution in the Drosophila embryo.
    <i>Development</i>. 2021;148(18). doi:<a href="https://doi.org/10.1242/dev.196121">10.1242/dev.196121</a>
  apa: Vinter, D. J., Hoppe, C., Minchington, T., Sutcliffe, C., &#38; Ashe, H. L.
    (2021). Dynamics of hunchback translation in real-time and at single-mRNA resolution
    in the Drosophila embryo. <i>Development</i>. Company of Biologists. <a href="https://doi.org/10.1242/dev.196121">https://doi.org/10.1242/dev.196121</a>
  chicago: Vinter, Daisy J., Caroline Hoppe, Thomas Minchington, Catherine Sutcliffe,
    and Hilary L. Ashe. “Dynamics of Hunchback Translation in Real-Time and at Single-MRNA
    Resolution in the Drosophila Embryo.” <i>Development</i>. Company of Biologists,
    2021. <a href="https://doi.org/10.1242/dev.196121">https://doi.org/10.1242/dev.196121</a>.
  ieee: D. J. Vinter, C. Hoppe, T. Minchington, C. Sutcliffe, and H. L. Ashe, “Dynamics
    of hunchback translation in real-time and at single-mRNA resolution in the Drosophila
    embryo,” <i>Development</i>, vol. 148, no. 18. Company of Biologists, 2021.
  ista: Vinter DJ, Hoppe C, Minchington T, Sutcliffe C, Ashe HL. 2021. Dynamics of
    hunchback translation in real-time and at single-mRNA resolution in the Drosophila
    embryo. Development. 148(18), dev196121.
  mla: Vinter, Daisy J., et al. “Dynamics of Hunchback Translation in Real-Time and
    at Single-MRNA Resolution in the Drosophila Embryo.” <i>Development</i>, vol.
    148, no. 18, dev196121., Company of Biologists, 2021, doi:<a href="https://doi.org/10.1242/dev.196121">10.1242/dev.196121</a>.
  short: D.J. Vinter, C. Hoppe, T. Minchington, C. Sutcliffe, H.L. Ashe, Development
    148 (2021).
date_created: 2024-04-03T07:26:41Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2026-08-12T09:59:03Z
day: '01'
ddc:
- '570'
department:
- _id: AnKi
doi: 10.1242/dev.196121
external_id:
  pmid:
  - '33722899 '
file:
- access_level: open_access
  checksum: 6d0533fe9c712448b3f9feb15e05ec4b
  content_type: application/pdf
  creator: dernst
  date_created: 2024-04-03T13:58:51Z
  date_updated: 2024-04-03T13:58:51Z
  file_id: '15290'
  file_name: 2021_CompanyBiologists_Vinter.pdf
  file_size: 16258500
  relation: main_file
  success: 1
file_date_updated: 2024-04-03T13:58:51Z
has_accepted_license: '1'
intvolume: '       148'
issue: '18'
keyword:
- Developmental Biology
- Molecular Biology
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: Development
publication_identifier:
  eissn:
  - 1477-9129
  issn:
  - 0950-1991
publication_status: published
publisher: Company of Biologists
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamics of hunchback translation in real-time and at single-mRNA resolution
  in the Drosophila embryo
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: 148
year: '2021'
...
---
_id: '10000'
abstract:
- lang: eng
  text: Inhibition or targeted deletion of histone deacetylase 3 (HDAC3) is neuroprotective
    in a variety neurodegenerative conditions, including retinal ganglion cells (RGCs)
    after acute optic nerve damage. Consistent with this, induced HDAC3 expression
    in cultured cells shows selective toxicity to neurons. Despite an established
    role for HDAC3 in neuronal pathology, little is known regarding the mechanism
    of this pathology.
acknowledgement: 'The authors thank Joel Dietz for maintaining the mice used in this
  study, Satoshi Kinoshita and the Translational Research Initiative in Pathology
  Laboratory at the University of Wisconsin-Madison for cutting retinal sections analyzed
  in this study, and Mark Banghart for statistical review of the data analysis. Supported
  by National Eye Institute Grants R01 EY012223 (RWN), R01 EY030123 (RWN), R01 EY029809
  (LWG), R01 EY029809 (LWG) and a Vision Research CORE grant P30 EY016665, NRSA grant
  T32 GM081061, by an unrestricted research grant from Research to Prevent Blindness,
  Inc., and by a University of Wisconsin-Madison Vilas Life Cycle award and the Frederick
  A. Davis Research Chair (RWN). '
article_number: '14'
article_processing_charge: Yes
article_type: original
author:
- first_name: Heather M.
  full_name: Schmitt, Heather M.
  last_name: Schmitt
- first_name: Rachel L.
  full_name: Fehrman, Rachel L.
  last_name: Fehrman
- first_name: Margaret E
  full_name: Maes, Margaret E
  id: 3838F452-F248-11E8-B48F-1D18A9856A87
  last_name: Maes
  orcid: 0000-0001-9642-1085
- first_name: Huan
  full_name: Yang, Huan
  last_name: Yang
- first_name: Lian Wang
  full_name: Guo, Lian Wang
  last_name: Guo
- first_name: Cassandra L.
  full_name: Schlamp, Cassandra L.
  last_name: Schlamp
- first_name: Heather R.
  full_name: Pelzel, Heather R.
  last_name: Pelzel
- first_name: Robert W.
  full_name: Nickells, Robert W.
  last_name: Nickells
citation:
  ama: Schmitt HM, Fehrman RL, Maes ME, et al. Increased susceptibility and intrinsic
    apoptotic signaling in neurons by induced HDAC3 expression. <i>Investigative Ophthalmology
    &#38; Visual Science</i>. 2021;62(10). doi:<a href="https://doi.org/10.1167/IOVS.62.10.14">10.1167/IOVS.62.10.14</a>
  apa: Schmitt, H. M., Fehrman, R. L., Maes, M. E., Yang, H., Guo, L. W., Schlamp,
    C. L., … Nickells, R. W. (2021). Increased susceptibility and intrinsic apoptotic
    signaling in neurons by induced HDAC3 expression. <i>Investigative Ophthalmology
    &#38; Visual Science</i>. Association for Research in Vision and Ophthalmology.
    <a href="https://doi.org/10.1167/IOVS.62.10.14">https://doi.org/10.1167/IOVS.62.10.14</a>
  chicago: Schmitt, Heather M., Rachel L. Fehrman, Margaret E Maes, Huan Yang, Lian
    Wang Guo, Cassandra L. Schlamp, Heather R. Pelzel, and Robert W. Nickells. “Increased
    Susceptibility and Intrinsic Apoptotic Signaling in Neurons by Induced HDAC3 Expression.”
    <i>Investigative Ophthalmology &#38; Visual Science</i>. Association for Research
    in Vision and Ophthalmology, 2021. <a href="https://doi.org/10.1167/IOVS.62.10.14">https://doi.org/10.1167/IOVS.62.10.14</a>.
  ieee: H. M. Schmitt <i>et al.</i>, “Increased susceptibility and intrinsic apoptotic
    signaling in neurons by induced HDAC3 expression,” <i>Investigative Ophthalmology
    &#38; Visual Science</i>, vol. 62, no. 10. Association for Research in Vision
    and Ophthalmology, 2021.
  ista: Schmitt HM, Fehrman RL, Maes ME, Yang H, Guo LW, Schlamp CL, Pelzel HR, Nickells
    RW. 2021. Increased susceptibility and intrinsic apoptotic signaling in neurons
    by induced HDAC3 expression. Investigative Ophthalmology &#38; Visual Science.
    62(10), 14.
  mla: Schmitt, Heather M., et al. “Increased Susceptibility and Intrinsic Apoptotic
    Signaling in Neurons by Induced HDAC3 Expression.” <i>Investigative Ophthalmology
    &#38; Visual Science</i>, vol. 62, no. 10, 14, Association for Research in Vision
    and Ophthalmology, 2021, doi:<a href="https://doi.org/10.1167/IOVS.62.10.14">10.1167/IOVS.62.10.14</a>.
  short: H.M. Schmitt, R.L. Fehrman, M.E. Maes, H. Yang, L.W. Guo, C.L. Schlamp, H.R.
    Pelzel, R.W. Nickells, Investigative Ophthalmology &#38; Visual Science 62 (2021).
date_created: 2021-09-12T22:01:23Z
date_published: 2021-08-16T00:00:00Z
date_updated: 2026-08-12T11:15:05Z
day: '16'
ddc:
- '570'
department:
- _id: SaSi
doi: 10.1167/IOVS.62.10.14
external_id:
  isi:
  - '000695230000014'
  pmid:
  - '34398198'
file:
- access_level: open_access
  checksum: c430967746f653aa1ae84ee617f62b73
  content_type: application/pdf
  creator: dernst
  date_created: 2022-05-13T07:40:15Z
  date_updated: 2022-05-13T07:40:15Z
  file_id: '11369'
  file_name: 2021_IOVS_Schmitt.pdf
  file_size: 19707796
  relation: main_file
  success: 1
file_date_updated: 2022-05-13T07:40:15Z
has_accepted_license: '1'
intvolume: '        62'
isi: 1
issue: '10'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
publication: Investigative Ophthalmology & Visual Science
publication_identifier:
  eissn:
  - 1552-5783
  issn:
  - 0146-0404
publication_status: published
publisher: Association for Research in Vision and Ophthalmology
quality_controlled: '1'
scopus_import: '1'
status: public
title: Increased susceptibility and intrinsic apoptotic signaling in neurons by induced
  HDAC3 expression
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 62
year: '2021'
...
---
_id: '9047'
abstract:
- lang: eng
  text: This work analyzes the latency of the simplified successive cancellation (SSC)
    decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It
    is shown that, unlike conventional successive cancellation decoding, where latency
    is linear in the block length, the latency of SSC decoding is sublinear. More
    specifically, the latency of SSC decoding is O(N1−1/μ) , where N is the block
    length and μ is the scaling exponent of the channel, which captures the speed
    of convergence of the rate to capacity. Numerical results demonstrate the tightness
    of the bound and show that most of the latency reduction arises from the parallel
    decoding of subcodes of rate 0 or 1.
acknowledgement: M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305,
  IIS-1741162, and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral
  Fellowship from the Natural Sciences and Engineering Research Council of Canada
  (NSERC) and by Huawei. The authors would like to thank the anonymous reviewers for
  their comments that helped improving the quality of the manuscript.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: Seyyed Ali
  full_name: Hashemi, Seyyed Ali
  last_name: Hashemi
- first_name: John M.
  full_name: Cioffi, John M.
  last_name: Cioffi
- first_name: Andrea
  full_name: Goldsmith, Andrea
  last_name: Goldsmith
citation:
  ama: Mondelli M, Hashemi SA, Cioffi JM, Goldsmith A. Sublinear latency for simplified
    successive cancellation decoding of polar codes. <i>IEEE Transactions on Wireless
    Communications</i>. 2021;20(1):18-27. doi:<a href="https://doi.org/10.1109/TWC.2020.3022922">10.1109/TWC.2020.3022922</a>
  apa: Mondelli, M., Hashemi, S. A., Cioffi, J. M., &#38; Goldsmith, A. (2021). Sublinear
    latency for simplified successive cancellation decoding of polar codes. <i>IEEE
    Transactions on Wireless Communications</i>. IEEE. <a href="https://doi.org/10.1109/TWC.2020.3022922">https://doi.org/10.1109/TWC.2020.3022922</a>
  chicago: Mondelli, Marco, Seyyed Ali Hashemi, John M. Cioffi, and Andrea Goldsmith.
    “Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes.”
    <i>IEEE Transactions on Wireless Communications</i>. IEEE, 2021. <a href="https://doi.org/10.1109/TWC.2020.3022922">https://doi.org/10.1109/TWC.2020.3022922</a>.
  ieee: M. Mondelli, S. A. Hashemi, J. M. Cioffi, and A. Goldsmith, “Sublinear latency
    for simplified successive cancellation decoding of polar codes,” <i>IEEE Transactions
    on Wireless Communications</i>, vol. 20, no. 1. IEEE, pp. 18–27, 2021.
  ista: Mondelli M, Hashemi SA, Cioffi JM, Goldsmith A. 2021. Sublinear latency for
    simplified successive cancellation decoding of polar codes. IEEE Transactions
    on Wireless Communications. 20(1), 18–27.
  mla: Mondelli, Marco, et al. “Sublinear Latency for Simplified Successive Cancellation
    Decoding of Polar Codes.” <i>IEEE Transactions on Wireless Communications</i>,
    vol. 20, no. 1, IEEE, 2021, pp. 18–27, doi:<a href="https://doi.org/10.1109/TWC.2020.3022922">10.1109/TWC.2020.3022922</a>.
  short: M. Mondelli, S.A. Hashemi, J.M. Cioffi, A. Goldsmith, IEEE Transactions on
    Wireless Communications 20 (2021) 18–27.
corr_author: '1'
date_created: 2021-01-31T23:01:21Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2026-08-12T11:12:22Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/TWC.2020.3022922
external_id:
  arxiv:
  - '1909.04892'
  isi:
  - '000607808800002'
intvolume: '        20'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1909.04892
month: '01'
oa: 1
oa_version: Preprint
page: 18-27
publication: IEEE Transactions on Wireless Communications
publication_identifier:
  eissn:
  - 1558-2248
  issn:
  - 1536-1276
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
  record:
  - id: '8536'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Sublinear latency for simplified successive cancellation decoding of polar
  codes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '2021'
...
---
_id: '15267'
abstract:
- lang: eng
  text: "We study two fundamental communication primitives: broadcasting and leader
    election in the classical model of multi-hop radio networks with unknown topology
    and without collision detection mechanisms. It has been known for almost 20 years
    that in undirected networks with n nodes and diameter D, randomized broadcasting
    requires Ω(D log n/D + log2 n) rounds, assuming that uninformed nodes are not
    allowed to communicate (until they are informed). Only very recently, Haeupler
    and Wajc (PODC'2016) showed that this bound can be improved for the model with
    spontaneous transmissions, providing an O(D log n log log n/log D + logO(1) n)-time
    broadcasting algorithm. In this article, we give a new and faster algorithm that
    completes broadcasting in O(D log n/log D + logO(1) n) time, succeeding with high
    probability. This yields the first optimal O(D)-time broadcasting algorithm whenever
    n is polynomial in D.\r\n\r\nFurthermore, our approach can be applied to design
    a new leader election algorithm that matches the performance of our broadcasting
    algorithm. Previously, all fast randomized leader election algorithms have used
    broadcasting as a subroutine and their complexity has been asymptotically strictly
    larger than the complexity of broadcasting. In particular, the fastest previously
    known randomized leader election algorithm of Ghaffari and Haeupler (SODA'2013)
    requires O(D log n/D min {log log n, log n/D} + logO(1) n)-time, succeeding with
    high probability. Our new algorithm again requires O(D log n/log D + logO(1) n)
    time, also succeeding with high probability."
article_number: '13'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
- first_name: Peter
  full_name: Davies, Peter
  id: 11396234-BB50-11E9-B24C-90FCE5697425
  last_name: Davies
  orcid: 0000-0002-5646-9524
citation:
  ama: Czumaj A, Davies P. Exploiting spontaneous transmissions for broadcasting and
    leader election in radio networks. <i>Journal of the ACM</i>. 2021;68(2). doi:<a
    href="https://doi.org/10.1145/3446383">10.1145/3446383</a>
  apa: Czumaj, A., &#38; Davies, P. (2021). Exploiting spontaneous transmissions for
    broadcasting and leader election in radio networks. <i>Journal of the ACM</i>.
    ACM. <a href="https://doi.org/10.1145/3446383">https://doi.org/10.1145/3446383</a>
  chicago: Czumaj, Artur, and Peter Davies. “Exploiting Spontaneous Transmissions
    for Broadcasting and Leader Election in Radio Networks.” <i>Journal of the ACM</i>.
    ACM, 2021. <a href="https://doi.org/10.1145/3446383">https://doi.org/10.1145/3446383</a>.
  ieee: A. Czumaj and P. Davies, “Exploiting spontaneous transmissions for broadcasting
    and leader election in radio networks,” <i>Journal of the ACM</i>, vol. 68, no.
    2. ACM, 2021.
  ista: Czumaj A, Davies P. 2021. Exploiting spontaneous transmissions for broadcasting
    and leader election in radio networks. Journal of the ACM. 68(2), 13.
  mla: Czumaj, Artur, and Peter Davies. “Exploiting Spontaneous Transmissions for
    Broadcasting and Leader Election in Radio Networks.” <i>Journal of the ACM</i>,
    vol. 68, no. 2, 13, ACM, 2021, doi:<a href="https://doi.org/10.1145/3446383">10.1145/3446383</a>.
  short: A. Czumaj, P. Davies, Journal of the ACM 68 (2021).
date_created: 2024-04-03T07:41:46Z
date_published: 2021-01-28T00:00:00Z
date_updated: 2026-08-12T14:03:54Z
day: '28'
department:
- _id: DaAl
doi: 10.1145/3446383
external_id:
  arxiv:
  - '1703.01859'
intvolume: '        68'
issue: '2'
keyword:
- Artificial Intelligence
- Hardware and Architecture
- Information Systems
- Control and Systems Engineering
- Software
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1703.01859
month: '01'
oa: 1
oa_version: Preprint
publication: Journal of the ACM
publication_identifier:
  eissn:
  - 1557-735X
  issn:
  - 0004-5411
publication_status: published
publisher: ACM
quality_controlled: '1'
status: public
title: Exploiting spontaneous transmissions for broadcasting and leader election in
  radio networks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 68
year: '2021'
...
---
_id: '10575'
abstract:
- lang: eng
  text: The choice of the boundary conditions in mechanical problems has to reflect
    the interaction of the considered material with the surface. Still the assumption
    of the no-slip condition is preferred in order to avoid boundary terms in the
    analysis and slipping effects are usually overlooked. Besides the “static slip
    models”, there are phenomena that are not accurately described by them, e.g. at
    the moment when the slip changes rapidly, the wall shear stress and the slip can
    exhibit a sudden overshoot and subsequent relaxation. When these effects become
    significant, the so-called dynamic slip phenomenon occurs. We develop a mathematical
    analysis of Navier–Stokes-like problems with a dynamic slip boundary condition,
    which requires a proper generalization of the Gelfand triplet and the corresponding
    function space setting.
acknowledgement: The research of A. Abbatiello is supported by Einstein Foundation,
  Berlin. A. Abbatiello is also member of the Italian National Group for the Mathematical
  Physics (GNFM) of INdAM. M. Bulíček acknowledges the support of the project No.
  20-11027X financed by Czech Science Foundation (GACR). M. Bulíček is member of the
  Jindřich Nečas Center for Mathematical Modelling. E. Maringová acknowledges support
  from Charles University Research program UNCE/SCI/023, the grant SVV-2020-260583
  by the Ministry of Education, Youth and Sports, Czech Republic and from the Austrian
  Science Fund (FWF), grants P30000, W1245, and F65.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Anna
  full_name: Abbatiello, Anna
  last_name: Abbatiello
- first_name: Miroslav
  full_name: Bulíček, Miroslav
  last_name: Bulíček
- first_name: Erika
  full_name: Maringová, Erika
  id: dbabca31-66eb-11eb-963a-fb9c22c880b4
  last_name: Maringová
citation:
  ama: Abbatiello A, Bulíček M, Maringová E. On the dynamic slip boundary condition
    for Navier-Stokes-like problems. <i>Mathematical Models and Methods in Applied
    Sciences</i>. 2021;31(11):2165-2212. doi:<a href="https://doi.org/10.1142/S0218202521500470">10.1142/S0218202521500470</a>
  apa: Abbatiello, A., Bulíček, M., &#38; Maringová, E. (2021). On the dynamic slip
    boundary condition for Navier-Stokes-like problems. <i>Mathematical Models and
    Methods in Applied Sciences</i>. World Scientific Publishing. <a href="https://doi.org/10.1142/S0218202521500470">https://doi.org/10.1142/S0218202521500470</a>
  chicago: Abbatiello, Anna, Miroslav Bulíček, and Erika Maringová. “On the Dynamic
    Slip Boundary Condition for Navier-Stokes-like Problems.” <i>Mathematical Models
    and Methods in Applied Sciences</i>. World Scientific Publishing, 2021. <a href="https://doi.org/10.1142/S0218202521500470">https://doi.org/10.1142/S0218202521500470</a>.
  ieee: A. Abbatiello, M. Bulíček, and E. Maringová, “On the dynamic slip boundary
    condition for Navier-Stokes-like problems,” <i>Mathematical Models and Methods
    in Applied Sciences</i>, vol. 31, no. 11. World Scientific Publishing, pp. 2165–2212,
    2021.
  ista: Abbatiello A, Bulíček M, Maringová E. 2021. On the dynamic slip boundary condition
    for Navier-Stokes-like problems. Mathematical Models and Methods in Applied Sciences.
    31(11), 2165–2212.
  mla: Abbatiello, Anna, et al. “On the Dynamic Slip Boundary Condition for Navier-Stokes-like
    Problems.” <i>Mathematical Models and Methods in Applied Sciences</i>, vol. 31,
    no. 11, World Scientific Publishing, 2021, pp. 2165–212, doi:<a href="https://doi.org/10.1142/S0218202521500470">10.1142/S0218202521500470</a>.
  short: A. Abbatiello, M. Bulíček, E. Maringová, Mathematical Models and Methods
    in Applied Sciences 31 (2021) 2165–2212.
date_created: 2021-12-26T23:01:27Z
date_published: 2021-10-13T00:00:00Z
date_updated: 2025-04-15T08:31:30Z
day: '13'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.1142/S0218202521500470
external_id:
  arxiv:
  - '2009.09057'
  isi:
  - '000722309400001'
file:
- access_level: open_access
  checksum: 8c0a9396335f0b70e1f5cbfe450a987a
  content_type: application/pdf
  creator: dernst
  date_created: 2022-05-16T10:55:45Z
  date_updated: 2022-05-16T10:55:45Z
  file_id: '11385'
  file_name: 2021_MathModelsMethods_Abbatiello.pdf
  file_size: 795483
  relation: main_file
  success: 1
file_date_updated: 2022-05-16T10:55:45Z
has_accepted_license: '1'
intvolume: '        31'
isi: 1
issue: '11'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 2165-2212
project:
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
  grant_number: F6504
  name: Taming Complexity in Partial Differential Systems
- _id: 260788DE-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: W1245
  name: Dissipation and dispersion in nonlinear partial differential equations
publication: Mathematical Models and Methods in Applied Sciences
publication_identifier:
  eissn:
  - 1793-6314
  issn:
  - 0218-2025
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the dynamic slip boundary condition for Navier-Stokes-like problems
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 31
year: '2021'
...
