---
_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: Proceedings
of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE;
2021. doi:10.1109/LICS52264.2021.9470547'
apa: 'Henzinger, T. A., & Sarac, N. E. (2021). Quantitative and approximate
monitoring. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in
Computer Science. Online: IEEE. https://doi.org/10.1109/LICS52264.2021.9470547'
chicago: Henzinger, Thomas A, and Naci E Sarac. “Quantitative and Approximate Monitoring.”
In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science.
IEEE, 2021. https://doi.org/10.1109/LICS52264.2021.9470547.
ieee: T. A. Henzinger and N. E. Sarac, “Quantitative and approximate monitoring,”
in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,
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.”
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,
9470547, IEEE, 2021, doi:10.1109/LICS52264.2021.9470547.
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:
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science.
IEEE; 2021:1-13. doi:10.1109/LICS52264.2021.9470595'
apa: 'Chatterjee, K., & Doyen, L. (2021). Stochastic processes with expected
stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
in Computer Science (pp. 1–13). Rome, Italy: IEEE. https://doi.org/10.1109/LICS52264.2021.9470595'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected
Stopping Time.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
in Computer Science, 1–13. IEEE, 2021. https://doi.org/10.1109/LICS52264.2021.9470595.
ieee: K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,”
in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,
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.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
in Computer Science, IEEE, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470595.
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.
IEEE Transactions on Signal Processing. 2021;69:4039-4054. doi:10.1109/TSP.2021.3087899
apa: Gabrielaitis, M. (2021). Fast and accurate amplitude demodulation of wideband
signals. IEEE Transactions on Signal Processing. IEEE. https://doi.org/10.1109/TSP.2021.3087899
chicago: Gabrielaitis, Mantas. “Fast and Accurate Amplitude Demodulation of Wideband
Signals.” IEEE Transactions on Signal Processing. IEEE, 2021. https://doi.org/10.1109/TSP.2021.3087899.
ieee: M. Gabrielaitis, “Fast and accurate amplitude demodulation of wideband signals,”
IEEE Transactions on Signal Processing, 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.” IEEE Transactions on Signal Processing, vol. 69, IEEE, 2021,
pp. 4039–54, doi:10.1109/TSP.2021.3087899.
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: 2021 IEEE International Symposium on Information Theory. IEEE; 2021:2369-2374.
doi:10.1109/ISIT45174.2021.9518153'
apa: 'Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., & Goldsmith,
A. (2021). Parallelism versus latency in simplified successive-cancellation decoding
of polar codes. In 2021 IEEE International Symposium on Information Theory
(pp. 2369–2374). Melbourne, Australia: IEEE. https://doi.org/10.1109/ISIT45174.2021.9518153'
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 2021 IEEE International Symposium on Information
Theory, 2369–74. IEEE, 2021. https://doi.org/10.1109/ISIT45174.2021.9518153.
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 2021 IEEE International Symposium on Information Theory,
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.” 2021 IEEE International Symposium on Information
Theory, IEEE, 2021, pp. 2369–74, doi:10.1109/ISIT45174.2021.9518153.
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. AGU Advances.
2021;2(2). doi:10.1029/2020av000303
apa: 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. American Geophysical Union. https://doi.org/10.1029/2020av000303
chicago: Paschalis, Athanasios, TC Chakraborty, Simone Fatichi, Naika Meili, and
Gabriele Manoli. “Urban Forests as Main Regulator of the Evaporative Cooling Effect
in Cities.” AGU Advances. American Geophysical Union, 2021. https://doi.org/10.1029/2020av000303.
ieee: A. Paschalis, T. Chakraborty, S. Fatichi, N. Meili, and G. Manoli, “Urban
forests as main regulator of the evaporative cooling effect in cities,” AGU
Advances, 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.” AGU Advances, vol. 2, no. 2, e2020AV000303,
American Geophysical Union, 2021, doi:10.1029/2020av000303.
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. Analysis and PDE. 2021;14(7):2079-2100.
doi:10.2140/APDE.2021.14.2079'
apa: 'Leopold, N. K., Rademacher, S. A. E., Schlein, B., & Seiringer, R. (2021).
The Landau–Pekar equations: Adiabatic theorem and accuracy. Analysis and PDE.
Mathematical Sciences Publishers. https://doi.org/10.2140/APDE.2021.14.2079'
chicago: 'Leopold, Nikolai K, Simone Anna Elvira Rademacher, Benjamin Schlein, and
Robert Seiringer. “The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.”
Analysis and PDE. Mathematical Sciences Publishers, 2021. https://doi.org/10.2140/APDE.2021.14.2079.'
ieee: 'N. K. Leopold, S. A. E. Rademacher, B. Schlein, and R. Seiringer, “The Landau–Pekar
equations: Adiabatic theorem and accuracy,” Analysis and PDE, 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.” Analysis and PDE, vol. 14, no. 7, Mathematical Sciences
Publishers, 2021, pp. 2079–100, doi:10.2140/APDE.2021.14.2079.'
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. Development.
2021;148(2). doi:10.1242/dev.176065
apa: Tkačik, G., & Gregor, T. (2021). The many bits of positional information.
Development. Company of Biologists. https://doi.org/10.1242/dev.176065
chicago: Tkačik, Gašper, and Thomas Gregor. “The Many Bits of Positional Information.”
Development. Company of Biologists, 2021. https://doi.org/10.1242/dev.176065.
ieee: G. Tkačik and T. Gregor, “The many bits of positional information,” Development,
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.”
Development, vol. 148, no. 2, dev176065, Company of Biologists, 2021, doi:10.1242/dev.176065.
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.
Development. 2021;148(18). doi:10.1242/dev.196121
apa: Vinter, D. J., Hoppe, C., Minchington, T., Sutcliffe, C., & Ashe, H. L.
(2021). Dynamics of hunchback translation in real-time and at single-mRNA resolution
in the Drosophila embryo. Development. Company of Biologists. https://doi.org/10.1242/dev.196121
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.” Development. Company of Biologists,
2021. https://doi.org/10.1242/dev.196121.
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,” Development, 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.” Development, vol.
148, no. 18, dev196121., Company of Biologists, 2021, doi:10.1242/dev.196121.
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. Investigative Ophthalmology
& Visual Science. 2021;62(10). doi:10.1167/IOVS.62.10.14
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. Investigative Ophthalmology
& Visual Science. Association for Research in Vision and Ophthalmology.
https://doi.org/10.1167/IOVS.62.10.14
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.”
Investigative Ophthalmology & Visual Science. Association for Research
in Vision and Ophthalmology, 2021. https://doi.org/10.1167/IOVS.62.10.14.
ieee: H. M. Schmitt et al., “Increased susceptibility and intrinsic apoptotic
signaling in neurons by induced HDAC3 expression,” Investigative Ophthalmology
& Visual Science, 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 & Visual Science.
62(10), 14.
mla: Schmitt, Heather M., et al. “Increased Susceptibility and Intrinsic Apoptotic
Signaling in Neurons by Induced HDAC3 Expression.” Investigative Ophthalmology
& Visual Science, vol. 62, no. 10, 14, Association for Research in Vision
and Ophthalmology, 2021, doi:10.1167/IOVS.62.10.14.
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 & 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
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. IEEE Transactions on Wireless
Communications. 2021;20(1):18-27. doi:10.1109/TWC.2020.3022922
apa: Mondelli, M., Hashemi, S. A., Cioffi, J. M., & Goldsmith, A. (2021). Sublinear
latency for simplified successive cancellation decoding of polar codes. IEEE
Transactions on Wireless Communications. IEEE. https://doi.org/10.1109/TWC.2020.3022922
chicago: Mondelli, Marco, Seyyed Ali Hashemi, John M. Cioffi, and Andrea Goldsmith.
“Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes.”
IEEE Transactions on Wireless Communications. IEEE, 2021. https://doi.org/10.1109/TWC.2020.3022922.
ieee: M. Mondelli, S. A. Hashemi, J. M. Cioffi, and A. Goldsmith, “Sublinear latency
for simplified successive cancellation decoding of polar codes,” IEEE Transactions
on Wireless Communications, 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.” IEEE Transactions on Wireless Communications,
vol. 20, no. 1, IEEE, 2021, pp. 18–27, doi:10.1109/TWC.2020.3022922.
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. Journal of the ACM. 2021;68(2). doi:10.1145/3446383
apa: Czumaj, A., & Davies, P. (2021). Exploiting spontaneous transmissions for
broadcasting and leader election in radio networks. Journal of the ACM.
ACM. https://doi.org/10.1145/3446383
chicago: Czumaj, Artur, and Peter Davies. “Exploiting Spontaneous Transmissions
for Broadcasting and Leader Election in Radio Networks.” Journal of the ACM.
ACM, 2021. https://doi.org/10.1145/3446383.
ieee: A. Czumaj and P. Davies, “Exploiting spontaneous transmissions for broadcasting
and leader election in radio networks,” Journal of the ACM, 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.” Journal of the ACM,
vol. 68, no. 2, 13, ACM, 2021, doi:10.1145/3446383.
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. Mathematical Models and Methods in Applied
Sciences. 2021;31(11):2165-2212. doi:10.1142/S0218202521500470
apa: 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. World Scientific Publishing. https://doi.org/10.1142/S0218202521500470
chicago: Abbatiello, Anna, Miroslav Bulíček, and Erika Maringová. “On the Dynamic
Slip Boundary Condition for Navier-Stokes-like Problems.” Mathematical Models
and Methods in Applied Sciences. World Scientific Publishing, 2021. https://doi.org/10.1142/S0218202521500470.
ieee: A. Abbatiello, M. Bulíček, and E. Maringová, “On the dynamic slip boundary
condition for Navier-Stokes-like problems,” Mathematical Models and Methods
in Applied Sciences, 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.” Mathematical Models and Methods in Applied Sciences, vol. 31,
no. 11, World Scientific Publishing, 2021, pp. 2165–212, doi:10.1142/S0218202521500470.
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'
...
---
_id: '10005'
abstract:
- lang: eng
text: We study systems of nonlinear partial differential equations of parabolic
type, in which the elliptic operator is replaced by the first-order divergence
operator acting on a flux function, which is related to the spatial gradient of
the unknown through an additional implicit equation. This setting, broad enough
in terms of applications, significantly expands the paradigm of nonlinear parabolic
problems. Formulating four conditions concerning the form of the implicit equation,
we first show that these conditions describe a maximal monotone p-coercive graph.
We then establish the global-in-time and large-data existence of a (weak) solution
and its uniqueness. To this end, we adopt and significantly generalize Minty’s
method of monotone mappings. A unified theory, containing several novel tools,
is developed in a way to be tractable from the point of view of numerical approximations.
acknowledgement: "M. Bulíček and J. Málek acknowledge the support of the project No.
18-12719S financed by the Czech\r\nScience foundation (GAČR). E. Maringová acknowledges
support from Charles University Research program \r\nUNCE/SCI/023, the grant SVV-2020-260583
by the Ministry of Education, Youth and Sports, Czech Republic\r\nand from the Austrian
Science Fund (FWF), grants P30000, W1245, and F65. M. Bulíček and J. Málek are\r\nmembers
of the Nečas Center for Mathematical Modelling.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- 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á
- first_name: Josef
full_name: Málek, Josef
last_name: Málek
citation:
ama: Bulíček M, Maringová E, Málek J. On nonlinear problems of parabolic type with
implicit constitutive equations involving flux. Mathematical Models and Methods
in Applied Sciences. 2021;31(09). doi:10.1142/S0218202521500457
apa: Bulíček, M., Maringová, E., & Málek, J. (2021). On nonlinear problems of
parabolic type with implicit constitutive equations involving flux. Mathematical
Models and Methods in Applied Sciences. World Scientific Publishing. https://doi.org/10.1142/S0218202521500457
chicago: Bulíček, Miroslav, Erika Maringová, and Josef Málek. “On Nonlinear Problems
of Parabolic Type with Implicit Constitutive Equations Involving Flux.” Mathematical
Models and Methods in Applied Sciences. World Scientific Publishing, 2021.
https://doi.org/10.1142/S0218202521500457.
ieee: M. Bulíček, E. Maringová, and J. Málek, “On nonlinear problems of parabolic
type with implicit constitutive equations involving flux,” Mathematical Models
and Methods in Applied Sciences, vol. 31, no. 09. World Scientific Publishing,
2021.
ista: Bulíček M, Maringová E, Málek J. 2021. On nonlinear problems of parabolic
type with implicit constitutive equations involving flux. Mathematical Models
and Methods in Applied Sciences. 31(09).
mla: Bulíček, Miroslav, et al. “On Nonlinear Problems of Parabolic Type with Implicit
Constitutive Equations Involving Flux.” Mathematical Models and Methods in
Applied Sciences, vol. 31, no. 09, World Scientific Publishing, 2021, doi:10.1142/S0218202521500457.
short: M. Bulíček, E. Maringová, J. Málek, Mathematical Models and Methods in Applied
Sciences 31 (2021).
date_created: 2021-09-12T22:01:25Z
date_published: 2021-08-25T00:00:00Z
date_updated: 2026-08-18T07:47:39Z
day: '25'
department:
- _id: JuFi
doi: 10.1142/S0218202521500457
external_id:
arxiv:
- '2009.06917'
isi:
- '000722222900004'
intvolume: ' 31'
isi: 1
issue: '09'
keyword:
- Nonlinear parabolic systems
- implicit constitutive theory
- weak solutions
- existence
- uniqueness
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2009.06917
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
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 nonlinear problems of parabolic type with implicit constitutive equations
involving flux
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2021'
...
---
_id: '10665'
abstract:
- lang: eng
text: "Formal verification of neural networks is an active topic of research, and
recent advances have significantly increased the size of the networks that verification
tools can handle. However, most methods are designed for verification of an idealized
model of the actual network which works over real arithmetic and ignores rounding
imprecisions. This idealization is in stark contrast to network quantization,
which is a technique that trades numerical precision for computational efficiency
and is, therefore, often applied in practice. Neglecting rounding errors of such
low-bit quantized neural networks has been shown to lead to wrong conclusions
about the network’s correctness. Thus, the desired approach for verifying quantized
neural networks would be one that takes these rounding errors\r\ninto account.
In this paper, we show that verifying the bitexact implementation of quantized
neural networks with bitvector specifications is PSPACE-hard, even though verifying
idealized real-valued networks and satisfiability of bit-vector specifications
alone are each in NP. Furthermore, we explore several practical heuristics toward
closing the complexity gap between idealized and bit-exact verification. In particular,
we propose three techniques for making SMT-based verification of quantized neural
networks more scalable. Our experiments demonstrate that our proposed methods
allow a speedup of up to three orders of magnitude over existing approaches."
acknowledgement: "This research was supported in part by the Austrian Science Fund
(FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt),
and the European Union’s Horizon 2020 research and innovation programme under the
Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n"
alternative_title:
- Technical Tracks
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: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural
networks. In: Proceedings of the AAAI Conference on Artificial Intelligence.
Vol 35. AAAI Press; 2021:3787-3795. doi:10.1609/aaai.v35i5.16496'
apa: 'Henzinger, T. A., Lechner, M., & Zikelic, D. (2021). Scalable verification
of quantized neural networks. In Proceedings of the AAAI Conference on Artificial
Intelligence (Vol. 35, pp. 3787–3795). Virtual: AAAI Press. https://doi.org/10.1609/aaai.v35i5.16496'
chicago: Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification
of Quantized Neural Networks.” In Proceedings of the AAAI Conference on Artificial
Intelligence, 35:3787–95. AAAI Press, 2021. https://doi.org/10.1609/aaai.v35i5.16496.
ieee: T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized
neural networks,” in Proceedings of the AAAI Conference on Artificial Intelligence,
Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.
ista: 'Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized
neural networks. Proceedings of the AAAI Conference on Artificial Intelligence.
AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks,
vol. 35, 3787–3795.'
mla: Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.”
Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35,
no. 5A, AAAI Press, 2021, pp. 3787–95, doi:10.1609/aaai.v35i5.16496.
short: T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference
on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
corr_author: '1'
date_created: 2022-01-25T15:15:02Z
date_published: 2021-05-28T00:00:00Z
date_updated: 2026-08-19T09:28:05Z
day: '28'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.1609/aaai.v35i5.16496
ec_funded: 1
external_id:
arxiv:
- '2012.08185'
file:
- access_level: open_access
checksum: 2bc8155b2526a70fba5b7301bc89dbd1
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:41:16Z
date_updated: 2022-01-26T07:41:16Z
file_id: '10684'
file_name: 16496-Article Text-19990-1-2-20210518 (1).pdf
file_size: 137235
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:41:16Z
has_accepted_license: '1'
intvolume: ' 35'
issue: 5A
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/16496
month: '05'
oa: 1
oa_version: Published Version
page: 3787-3795
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _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 AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- 978-1-57735-866-4
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
related_material:
record:
- id: '11362'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Scalable verification of quantized neural networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10671'
abstract:
- lang: eng
text: We introduce a new class of time-continuous recurrent neural network models.
Instead of declaring a learning system’s dynamics by implicit nonlinearities,
we construct networks of linear first-order dynamical systems modulated via nonlinear
interlinked gates. The resulting models represent dynamical systems with varying
(i.e., liquid) time-constants coupled to their hidden state, with outputs being
computed by numerical differential equation solvers. These neural networks exhibit
stable and bounded behavior, yield superior expressivity within the family of
neural ordinary differential equations, and give rise to improved performance
on time-series prediction tasks. To demonstrate these properties, we first take
a theoretical approach to find bounds over their dynamics, and compute their expressive
power by the trajectory length measure in a latent trajectory space. We then conduct
a series of time-series prediction experiments to manifest the approximation capability
of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs.
acknowledgement: "R.H. and D.R. are partially supported by Boeing. R.H. and R.G. were
partially supported by the Horizon-2020 ECSEL\r\nProject grant No. 783163 (iDev40).
M.L. was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23
(Wittgenstein Award). A.A. is supported by the National Science Foundation (NSF)
Graduate Research Fellowship Program. This research work is partially drawn from
the PhD dissertation of R.H."
alternative_title:
- Technical Tracks
article_processing_charge: No
arxiv: 1
author:
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Alexander
full_name: Amini, Alexander
last_name: Amini
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. Liquid time-constant networks.
In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol
35. AAAI Press; 2021:7657-7666. doi:10.1609/aaai.v35i9.16936'
apa: 'Hasani, R., Lechner, M., Amini, A., Rus, D., & Grosu, R. (2021). Liquid
time-constant networks. In Proceedings of the AAAI Conference on Artificial
Intelligence (Vol. 35, pp. 7657–7666). Virtual: AAAI Press. https://doi.org/10.1609/aaai.v35i9.16936'
chicago: Hasani, Ramin, Mathias Lechner, Alexander Amini, Daniela Rus, and Radu
Grosu. “Liquid Time-Constant Networks.” In Proceedings of the AAAI Conference
on Artificial Intelligence, 35:7657–66. AAAI Press, 2021. https://doi.org/10.1609/aaai.v35i9.16936.
ieee: R. Hasani, M. Lechner, A. Amini, D. Rus, and R. Grosu, “Liquid time-constant
networks,” in Proceedings of the AAAI Conference on Artificial Intelligence,
Virtual, 2021, vol. 35, no. 9, pp. 7657–7666.
ista: 'Hasani R, Lechner M, Amini A, Rus D, Grosu R. 2021. Liquid time-constant
networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI:
Association for the Advancement of Artificial Intelligence, Technical Tracks,
vol. 35, 7657–7666.'
mla: Hasani, Ramin, et al. “Liquid Time-Constant Networks.” Proceedings of the
AAAI Conference on Artificial Intelligence, vol. 35, no. 9, AAAI Press, 2021,
pp. 7657–66, doi:10.1609/aaai.v35i9.16936.
short: R. Hasani, M. Lechner, A. Amini, D. Rus, R. Grosu, in:, Proceedings of the
AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 7657–7666.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
corr_author: '1'
date_created: 2022-01-25T15:48:36Z
date_published: 2021-05-28T00:00:00Z
date_updated: 2026-08-19T09:24:30Z
day: '28'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.1609/aaai.v35i9.16936
external_id:
arxiv:
- '2006.04439'
file:
- access_level: open_access
checksum: 0f06995fba06dbcfa7ed965fc66027ff
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:36:03Z
date_updated: 2022-01-26T07:36:03Z
file_id: '10678'
file_name: 16936-Article Text-20430-1-2-20210518 (1).pdf
file_size: 4302669
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:36:03Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/16936
month: '05'
oa: 1
oa_version: Published Version
page: 7657-7666
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 AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- 978-1-57735-866-4
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
status: public
title: Liquid time-constant networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '11436'
abstract:
- lang: eng
text: Asynchronous distributed algorithms are a popular way to reduce synchronization
costs in large-scale optimization, and in particular for neural network training.
However, for nonsmooth and nonconvex objectives, few convergence guarantees exist
beyond cases where closed-form proximal operator solutions are available. As training
most popular deep neural networks corresponds to optimizing nonsmooth and nonconvex
objectives, there is a pressing need for such convergence guarantees. In this
paper, we analyze for the first time the convergence of stochastic asynchronous
optimization for this general class of objectives. In particular, we focus on
stochastic subgradient methods allowing for block variable partitioning, where
the shared model is asynchronously updated by concurrent processes. To this end,
we use a probabilistic model which captures key features of real asynchronous
scheduling between concurrent processes. Under this model, we establish convergence
with probability one to an invariant set for stochastic subgradient methods with
momentum. From a practical perspective, one issue with the family of algorithms
that we consider is that they are not efficiently supported by machine learning
frameworks, which mostly focus on distributed data-parallel strategies. To address
this, we propose a new implementation strategy for shared-memory based training
of deep neural networks for a partitioned but shared model in single- and multi-GPU
settings. Based on this implementation, we achieve on average1.2x speed-up in
comparison to state-of-the-art training methods for popular image classification
tasks, without compromising accuracy.
acknowledgement: Vyacheslav Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16
019/0000765 “Research Center for Informatics. Bapi Chatterjee was supported by the
European Union’s Horizon 2020 research and innovation programme under the Marie
Sklodowska-Curie grant agreement No. 754411 (ISTPlus). Dan Alistarh has received
funding from the European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation programme (grant agreement No 805223 ScaleML).
article_processing_charge: No
arxiv: 1
author:
- first_name: Vyacheslav
full_name: Kungurtsev, Vyacheslav
last_name: Kungurtsev
- first_name: Malcolm
full_name: Egan, Malcolm
last_name: Egan
- first_name: Bapi
full_name: Chatterjee, Bapi
id: 3C41A08A-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-2742-4028
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization
methods for efficient training of deep neural networks with guarantees. In: 35th
AAAI Conference on Artificial Intelligence, AAAI 2021. Vol 35. AAAI Press;
2021:8209-8216. doi:10.1609/aaai.v35i9.16999'
apa: 'Kungurtsev, V., Egan, M., Chatterjee, B., & Alistarh, D.-A. (2021). Asynchronous
optimization methods for efficient training of deep neural networks with guarantees.
In 35th AAAI Conference on Artificial Intelligence, AAAI 2021 (Vol. 35,
pp. 8209–8216). Virtual, Online: AAAI Press. https://doi.org/10.1609/aaai.v35i9.16999'
chicago: Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh.
“Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks
with Guarantees.” In 35th AAAI Conference on Artificial Intelligence, AAAI
2021, 35:8209–16. AAAI Press, 2021. https://doi.org/10.1609/aaai.v35i9.16999.
ieee: V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization
methods for efficient training of deep neural networks with guarantees,” in 35th
AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual, Online, 2021,
vol. 35, no. 9B, pp. 8209–8216.
ista: 'Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. 2021. Asynchronous optimization
methods for efficient training of deep neural networks with guarantees. 35th AAAI
Conference on Artificial Intelligence, AAAI 2021. AAAI: Conference on Artificial
Intelligence vol. 35, 8209–8216.'
mla: Kungurtsev, Vyacheslav, et al. “Asynchronous Optimization Methods for Efficient
Training of Deep Neural Networks with Guarantees.” 35th AAAI Conference on
Artificial Intelligence, AAAI 2021, vol. 35, no. 9B, AAAI Press, 2021, pp.
8209–16, doi:10.1609/aaai.v35i9.16999.
short: V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference
on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216.
conference:
end_date: 2021-02-09
location: Virtual, Online
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2021-02-02
date_created: 2022-06-05T22:01:52Z
date_published: 2021-05-18T00:00:00Z
date_updated: 2026-08-19T09:25:06Z
day: '18'
department:
- _id: DaAl
doi: 10.1609/aaai.v35i9.16999
ec_funded: 1
external_id:
arxiv:
- '1905.11845'
intvolume: ' 35'
issue: 9B
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1905.11845'
month: '05'
oa: 1
oa_version: Preprint
page: 8209-8216
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 35th AAAI Conference on Artificial Intelligence, AAAI 2021
publication_identifier:
eissn:
- 2374-3468
isbn:
- '9781713835974'
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Asynchronous optimization methods for efficient training of deep neural networks
with guarantees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10669'
abstract:
- lang: eng
text: "We show that Neural ODEs, an emerging class of timecontinuous neural networks,
can be verified by solving a set of global-optimization problems. For this purpose,
we introduce Stochastic Lagrangian Reachability (SLR), an\r\nabstraction-based
technique for constructing a tight Reachtube (an over-approximation of the set
of reachable states\r\nover a given time-horizon), and provide stochastic guarantees
in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids
the infamous wrapping effect (accumulation of over-approximation errors) by performing
local optimization steps to expand safe regions instead of repeatedly forward-propagating
them as is done by deterministic reachability methods. To enable fast local optimizations,
we introduce a novel forward-mode adjoint sensitivity method to compute gradients
without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic
convergence rates for SLR."
acknowledgement: "The authors would like to thank the reviewers for their insightful
comments. RH and RG were partially supported by\r\nHorizon-2020 ECSEL Project grant
No. 783163 (iDev40). RH was partially supported by Boeing. ML was supported\r\nin
part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).
SG was funded by FWF\r\nproject W1255-N23. JC was partially supported by NAWA Polish
Returns grant PPN/PPO/2018/1/00029. SS was supported by NSF awards DCL-2040599,
CCF-1918225, and CPS-1446832.\r\n"
alternative_title:
- Technical Tracks
article_processing_charge: No
arxiv: 1
author:
- first_name: Sophie
full_name: Grunbacher, Sophie
last_name: Grunbacher
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Jacek
full_name: Cyranka, Jacek
last_name: Cyranka
- first_name: Scott A
full_name: Smolka, Scott A
last_name: Smolka
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. On the verification
of neural ODEs with stochastic guarantees. In: Proceedings of the AAAI Conference
on Artificial Intelligence. Vol 35. AAAI Press; 2021:11525-11535. doi:10.1609/aaai.v35i13.17372'
apa: 'Grunbacher, S., Hasani, R., Lechner, M., Cyranka, J., Smolka, S. A., &
Grosu, R. (2021). On the verification of neural ODEs with stochastic guarantees.
In Proceedings of the AAAI Conference on Artificial Intelligence (Vol.
35, pp. 11525–11535). Virtual: AAAI Press. https://doi.org/10.1609/aaai.v35i13.17372'
chicago: Grunbacher, Sophie, Ramin Hasani, Mathias Lechner, Jacek Cyranka, Scott
A Smolka, and Radu Grosu. “On the Verification of Neural ODEs with Stochastic
Guarantees.” In Proceedings of the AAAI Conference on Artificial Intelligence,
35:11525–35. AAAI Press, 2021. https://doi.org/10.1609/aaai.v35i13.17372.
ieee: S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S. A. Smolka, and R. Grosu,
“On the verification of neural ODEs with stochastic guarantees,” in Proceedings
of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35,
no. 13, pp. 11525–11535.
ista: 'Grunbacher S, Hasani R, Lechner M, Cyranka J, Smolka SA, Grosu R. 2021. On
the verification of neural ODEs with stochastic guarantees. Proceedings of the
AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement
of Artificial Intelligence, Technical Tracks, vol. 35, 11525–11535.'
mla: Grunbacher, Sophie, et al. “On the Verification of Neural ODEs with Stochastic
Guarantees.” Proceedings of the AAAI Conference on Artificial Intelligence,
vol. 35, no. 13, AAAI Press, 2021, pp. 11525–35, doi:10.1609/aaai.v35i13.17372.
short: S. Grunbacher, R. Hasani, M. Lechner, J. Cyranka, S.A. Smolka, R. Grosu,
in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press,
2021, pp. 11525–11535.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
corr_author: '1'
date_created: 2022-01-25T15:47:20Z
date_published: 2021-05-28T00:00:00Z
date_updated: 2026-08-19T09:29:48Z
day: '28'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.1609/aaai.v35i13.17372
external_id:
arxiv:
- '2012.08863'
file:
- access_level: open_access
checksum: 468d07041e282a1d46ffdae92f709630
content_type: application/pdf
creator: mlechner
date_created: 2022-01-26T07:38:08Z
date_updated: 2022-01-26T07:38:08Z
file_id: '10680'
file_name: 17372-Article Text-20866-1-2-20210518.pdf
file_size: 286906
relation: main_file
success: 1
file_date_updated: 2022-01-26T07:38:08Z
has_accepted_license: '1'
intvolume: ' 35'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/17372
month: '05'
oa: 1
oa_version: Published Version
page: 11525-11535
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 AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- 978-1-57735-866-4
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
status: public
title: On the verification of neural ODEs with stochastic guarantees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
OA_place: publisher
_id: '10429'
abstract:
- lang: eng
text: "The scalability of concurrent data structures and distributed algorithms
strongly depends on\r\nreducing the contention for shared resources and the costs
of synchronization and communication. We show how such cost reductions can be
attained by relaxing the strict consistency conditions required by sequential
implementations. In the first part of the thesis, we consider relaxation in the
context of concurrent data structures. Specifically, in data structures \r\nsuch
as priority queues, imposing strong semantics renders scalability impossible,
since a correct implementation of the remove operation should return only the
element with highest priority. Intuitively, attempting to invoke remove operations
concurrently creates a race condition. This bottleneck can be circumvented by
relaxing semantics of the affected data structure, thus allowing removal of the
elements which are no longer required to have the highest priority. We prove that
the randomized implementations of relaxed data structures provide provable guarantees
on the priority of the removed elements even under concurrency. Additionally,
we show that in some cases the relaxed data structures can be used to scale the
classical algorithms which are usually implemented with the exact ones. In the
second part, we study parallel variants of the stochastic gradient descent (SGD)
algorithm, which distribute computation among the multiple processors, thus reducing
the running time. Unfortunately, in order for standard parallel SGD to succeed,
each processor has to maintain a local copy of the necessary model parameter,
which is identical to the local copies of other processors; the overheads from
this perfect consistency in terms of communication and synchronization can negate
the speedup gained by distributing the computation. We show that the consistency
conditions required by SGD can be relaxed, allowing the algorithm to be more
flexible in terms of tolerating quantized communication, asynchrony, or even crash
faults, while its convergence remains asymptotically the same."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
citation:
ama: Nadiradze G. On achieving scalability through relaxation. 2021. doi:10.15479/at:ista:10429
apa: Nadiradze, G. (2021). On achieving scalability through relaxation. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:10429
chicago: Nadiradze, Giorgi. “On Achieving Scalability through Relaxation.” Institute
of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10429.
ieee: G. Nadiradze, “On achieving scalability through relaxation,” Institute of
Science and Technology Austria, 2021.
ista: Nadiradze G. 2021. On achieving scalability through relaxation. Institute
of Science and Technology Austria.
mla: Nadiradze, Giorgi. On Achieving Scalability through Relaxation. Institute
of Science and Technology Austria, 2021, doi:10.15479/at:ista:10429.
short: G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science
and Technology Austria, 2021.
corr_author: '1'
date_created: 2021-12-08T21:52:28Z
date_published: 2021-12-09T00:00:00Z
date_updated: 2026-08-19T09:30:23Z
day: '09'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: DaAl
doi: 10.15479/at:ista:10429
ec_funded: 1
file:
- access_level: open_access
checksum: 6bf14e9a523387328f016c0689f5e10e
content_type: application/pdf
creator: gnadirad
date_created: 2021-12-09T17:47:49Z
date_updated: 2021-12-09T17:47:49Z
file_id: '10436'
file_name: Thesis_Final_09_12_2021.pdf
file_size: 2370859
relation: main_file
success: 1
- access_level: closed
checksum: 914d6c5ca86bd0add471971a8f4c4341
content_type: application/zip
creator: gnadirad
date_created: 2021-12-09T17:47:49Z
date_updated: 2022-03-28T12:55:12Z
file_id: '10437'
file_name: Thesis_Final_09_12_2021.zip
file_size: 2596924
relation: source_file
file_date_updated: 2022-03-28T12:55:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '132'
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6673'
relation: part_of_dissertation
status: public
- id: '5965'
relation: part_of_dissertation
status: public
- id: '10435'
relation: part_of_dissertation
status: public
- id: '10432'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
title: On achieving scalability through relaxation
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2021'
...
---
_id: '10432'
abstract:
- lang: eng
text: One key element behind the recent progress of machine learning has been the
ability to train machine learning models in large-scale distributed shared-memory
and message-passing environments. Most of these models are trained employing variants
of stochastic gradient descent (SGD) based optimization, but most methods involve
some type of consistency relaxation relative to sequential SGD, to mitigate its
large communication or synchronization costs at scale. In this paper, we introduce
a general consistency condition covering communication-reduced and asynchronous
distributed SGD implementations. Our framework, called elastic consistency, decouples
the system-specific aspects of the implementation from the SGD convergence requirements,
giving a general way to obtain convergence bounds for a wide variety of distributed
SGD methods used in practice. Elastic consistency can be used to re-derive or
improve several previous convergence bounds in message-passing and shared-memory
settings, but also to analyze new models and distribution schemes. As a direct
application, we propose and analyze a new synchronization-avoiding scheduling
scheme for distributed SGD, and show that it can be used to efficiently train
deep convolutional models for image classification.
acknowledgement: "We would like to thank Christopher De Sa for his feedback on an
earlier draft of this paper, as well as the anonymous AAAI reviewers for their useful
comments. This project has received\r\nfunding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML). Bapi\r\nChatterjee was supported by the European
Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie
grant agreement No. 754411 (ISTPlus)."
article_processing_charge: No
arxiv: 1
author:
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
- first_name: Ilia
full_name: Markov, Ilia
id: D0CF4148-C985-11E9-8066-0BDEE5697425
last_name: Markov
- first_name: Bapi
full_name: Chatterjee, Bapi
id: 3C41A08A-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-2742-4028
- first_name: 'Vyacheslav '
full_name: 'Kungurtsev, Vyacheslav '
last_name: Kungurtsev
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency:
A practical consistency model for distributed stochastic gradient descent. In:
Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35.
; 2021:9037-9045. doi:10.1609/aaai.v35i10.17092'
apa: 'Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., & Alistarh,
D.-A. (2021). Elastic consistency: A practical consistency model for distributed
stochastic gradient descent. In Proceedings of the AAAI Conference on Artificial
Intelligence (Vol. 35, pp. 9037–9045). Virtual. https://doi.org/10.1609/aaai.v35i10.17092'
chicago: 'Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev,
and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for
Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference
on Artificial Intelligence, 35:9037–45, 2021. https://doi.org/10.1609/aaai.v35i10.17092.'
ieee: 'G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh,
“Elastic consistency: A practical consistency model for distributed stochastic
gradient descent,” in Proceedings of the AAAI Conference on Artificial Intelligence,
Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.'
ista: 'Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. 2021. Elastic
consistency: A practical consistency model for distributed stochastic gradient
descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI:
Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.'
mla: 'Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model
for Distributed Stochastic Gradient Descent.” Proceedings of the AAAI Conference
on Artificial Intelligence, vol. 35, no. 10, 2021, pp. 9037–45, doi:10.1609/aaai.v35i10.17092.'
short: G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:,
Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
date_created: 2021-12-09T09:21:35Z
date_published: 2021-05-18T00:00:00Z
date_updated: 2026-08-19T09:30:23Z
day: '18'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1609/aaai.v35i10.17092
ec_funded: 1
external_id:
arxiv:
- '2001.05918'
intvolume: ' 35'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/17092
month: '05'
oa: 1
oa_version: Published Version
page: 9037-9045
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_status: published
quality_controlled: '1'
related_material:
record:
- id: '10429'
relation: dissertation_contains
status: public
status: public
title: 'Elastic consistency: A practical consistency model for distributed stochastic
gradient descent'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '12077'
abstract:
- lang: eng
text: "We compare the Manin-type conjecture for Campana points recently formulated\r\nby
Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado with an alternative\r\nprediction
of Browning and Van Valckenborgh in the special case of the orbifold\r\n$(\\mathbb{P}^1,D)$,
where $D =\\frac{1}{2}[0]+\\frac{1}{2}[1]+\\frac{1}{2}[\\infty]$. We find that
the two predicted leading constants do not agree, and we discuss whether thin
sets\r\ncould explain this discrepancy. Motivated by this, we provide a counterexample\r\nto
the Manin-type conjecture for Campana points, by considering orbifolds\r\ncorresponding
to squareful values of binary quadratic forms."
acknowledgement: The author would like to thank Damaris Schindler and Florian Wilsch
for their helpful comments on the heights and Tamagawa measures used in Section
3, together with Marta Pieropan, Sho Tanimoto and Sam Streeter for providing valuable
feedback on an earlier version of this paper, and Tim Browning for many useful comments
and discussions during the development of this work. The author is also grateful
to the anonymous referee for providing many valuable comments and suggestions that
improved the quality of the paper.
article_number: '2104.14946'
article_processing_charge: No
arxiv: 1
author:
- first_name: Alec L
full_name: Shute, Alec L
id: 440EB050-F248-11E8-B48F-1D18A9856A87
last_name: Shute
orcid: 0000-0002-1812-2810
citation:
ama: Shute AL. On the leading constant in the Manin-type conjecture for Campana
points. arXiv. doi:10.48550/arXiv.2104.14946
apa: Shute, A. L. (n.d.). On the leading constant in the Manin-type conjecture for
Campana points. arXiv. https://doi.org/10.48550/arXiv.2104.14946
chicago: Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for
Campana Points.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2104.14946.
ieee: A. L. Shute, “On the leading constant in the Manin-type conjecture for Campana
points,” arXiv. .
ista: Shute AL. On the leading constant in the Manin-type conjecture for Campana
points. arXiv, 2104.14946.
mla: Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana
Points.” ArXiv, 2104.14946, doi:10.48550/arXiv.2104.14946.
short: A.L. Shute, ArXiv (n.d.).
corr_author: '1'
das_tickbox: '0'
date_created: 2022-09-09T10:43:17Z
date_published: 2021-04-30T00:00:00Z
date_updated: 2026-08-19T12:54:58Z
day: '30'
department:
- _id: TiBr
doi: 10.48550/arXiv.2104.14946
external_id:
arxiv:
- '2104.14946'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2104.14946
month: '04'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '12072'
relation: dissertation_contains
status: public
- id: '17058'
relation: later_version
status: public
researchdata_availability: no
status: public
supplementarymaterial: no
title: On the leading constant in the Manin-type conjecture for Campana points
type: preprint
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2021'
...