---
_id: '12076'
abstract:
- lang: eng
text: We find an asymptotic formula for the number of primitive vectors $(z_1,\ldots,z_4)\in
(\mathbb{Z}_{\neq 0})^4$ such that $z_1,\ldots, z_4$ are all squareful and bounded
by $B$, and $z_1+\cdots + z_4 = 0$. Our result agrees in the power of $B$ and
$\log B$ with the Campana-Manin conjecture of Pieropan, Smeets, Tanimoto and V\'{a}rilly-Alvarado.
article_number: '2104.06966'
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. Sums of four squareful numbers. arXiv. doi:10.48550/arXiv.2104.06966
apa: Shute, A. L. (n.d.). Sums of four squareful numbers. arXiv. https://doi.org/10.48550/arXiv.2104.06966
chicago: Shute, Alec L. “Sums of Four Squareful Numbers.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2104.06966.
ieee: A. L. Shute, “Sums of four squareful numbers,” arXiv. .
ista: Shute AL. Sums of four squareful numbers. arXiv, 2104.06966.
mla: Shute, Alec L. “Sums of Four Squareful Numbers.” ArXiv, 2104.06966,
doi:10.48550/arXiv.2104.06966.
short: A.L. Shute, ArXiv (n.d.).
corr_author: '1'
das_tickbox: '0'
date_created: 2022-09-09T10:42:51Z
date_published: 2021-04-15T00:00:00Z
date_updated: 2026-08-06T11:08:48Z
day: '15'
department:
- _id: TiBr
doi: 10.48550/arXiv.2104.06966
external_id:
arxiv:
- '2104.06966'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2104.06966
month: '04'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '12072'
relation: dissertation_contains
status: public
researchdata_availability: no
status: public
supplementarymaterial: no
title: Sums of four squareful numbers
type: preprint
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2021'
...
---
_id: '9260'
abstract:
- lang: eng
text: We study the density of rational points on a higher-dimensional orbifold (Pn−1,Δ)
when Δ is a Q-divisor involving hyperplanes. This allows us to address a question
of Tanimoto about whether the set of rational points on such an orbifold constitutes
a thin set. Our approach relies on the Hardy–Littlewood circle method to first
study an asymptotic version of Waring’s problem for mixed powers. In doing so
we make crucial use of the recent resolution of the main conjecture in Vinogradov’s
mean value theorem, due to Bourgain–Demeter–Guth and Wooley.
acknowledgement: While working on this paper the authors were both supported by EPSRC
grant EP/P026710/1, and the second author received additional support from the NWO
Veni Grant 016.Veni.192.047. Thanks are due to Marta Pieropan, Arne Smeets and Sho
Tanimoto for useful conversations related to this topic, and to the anonymous referee
for numerous helpful suggestions.
article_processing_charge: No
article_type: original
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Shuntaro
full_name: Yamagishi, Shuntaro
last_name: Yamagishi
citation:
ama: Browning TD, Yamagishi S. Arithmetic of higher-dimensional orbifolds and a
mixed Waring problem. Mathematische Zeitschrift. 2021;299:1071–1101. doi:10.1007/s00209-021-02695-w
apa: Browning, T. D., & Yamagishi, S. (2021). Arithmetic of higher-dimensional
orbifolds and a mixed Waring problem. Mathematische Zeitschrift. Springer
Nature. https://doi.org/10.1007/s00209-021-02695-w
chicago: Browning, Timothy D, and Shuntaro Yamagishi. “Arithmetic of Higher-Dimensional
Orbifolds and a Mixed Waring Problem.” Mathematische Zeitschrift. Springer
Nature, 2021. https://doi.org/10.1007/s00209-021-02695-w.
ieee: T. D. Browning and S. Yamagishi, “Arithmetic of higher-dimensional orbifolds
and a mixed Waring problem,” Mathematische Zeitschrift, vol. 299. Springer
Nature, pp. 1071–1101, 2021.
ista: Browning TD, Yamagishi S. 2021. Arithmetic of higher-dimensional orbifolds
and a mixed Waring problem. Mathematische Zeitschrift. 299, 1071–1101.
mla: Browning, Timothy D., and Shuntaro Yamagishi. “Arithmetic of Higher-Dimensional
Orbifolds and a Mixed Waring Problem.” Mathematische Zeitschrift, vol.
299, Springer Nature, 2021, pp. 1071–1101, doi:10.1007/s00209-021-02695-w.
short: T.D. Browning, S. Yamagishi, Mathematische Zeitschrift 299 (2021) 1071–1101.
das_tickbox: '0'
date_created: 2021-03-21T23:01:21Z
date_published: 2021-03-05T00:00:00Z
date_updated: 2026-08-06T11:14:26Z
day: '05'
ddc:
- '510'
department:
- _id: TiBr
doi: 10.1007/s00209-021-02695-w
external_id:
isi:
- '000625573800002'
file:
- access_level: open_access
checksum: 8ed9f49568806894744096dbbca0ad7b
content_type: application/pdf
creator: dernst
date_created: 2021-03-22T12:41:26Z
date_updated: 2021-03-22T12:41:26Z
file_id: '9279'
file_name: 2021_MathZeitschrift_Browning.pdf
file_size: 492685
relation: main_file
success: 1
file_date_updated: 2021-03-22T12:41:26Z
has_accepted_license: '1'
intvolume: ' 299'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '03'
oa: 1
oa_version: Published Version
page: 1071–1101
project:
- _id: 26A8D266-B435-11E9-9278-68D0E5697425
grant_number: EP-P026710-2
name: Between rational and integral points
publication: Mathematische Zeitschrift
publication_identifier:
eissn:
- 1432-1823
issn:
- 0025-5874
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Arithmetic of higher-dimensional orbifolds and a mixed Waring problem
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 299
year: '2021'
...
---
_id: '10711'
abstract:
- lang: eng
text: In this paper, we investigate the distribution of the maximum of partial sums
of families of m -periodic complex-valued functions satisfying certain conditions.
We obtain precise uniform estimates for the distribution function of this maximum
in a near-optimal range. Our results apply to partial sums of Kloosterman sums
and other families of ℓ -adic trace functions, and are as strong as those obtained
by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular,
we improve on the recent work of the third author for Birch sums. However, unlike
character sums, we are able to construct families of m -periodic complex-valued
functions which satisfy our conditions, but for which the Pólya–Vinogradov inequality
is sharp.
acknowledgement: We would like to thank the anonymous referees for carefully reading
the paper and for their remarks and suggestions.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Pascal
full_name: Autissier, Pascal
last_name: Autissier
- first_name: Dante
full_name: Bonolis, Dante
id: 6A459894-5FDD-11E9-AF35-BB24E6697425
last_name: Bonolis
- first_name: Youness
full_name: Lamzouri, Youness
last_name: Lamzouri
citation:
ama: Autissier P, Bonolis D, Lamzouri Y. The distribution of the maximum of partial
sums of Kloosterman sums and other trace functions. Compositio Mathematica.
2021;157(7):1610-1651. doi:10.1112/s0010437x21007351
apa: Autissier, P., Bonolis, D., & Lamzouri, Y. (2021). The distribution of
the maximum of partial sums of Kloosterman sums and other trace functions. Compositio
Mathematica. Cambridge University Press. https://doi.org/10.1112/s0010437x21007351
chicago: Autissier, Pascal, Dante Bonolis, and Youness Lamzouri. “The Distribution
of the Maximum of Partial Sums of Kloosterman Sums and Other Trace Functions.”
Compositio Mathematica. Cambridge University Press, 2021. https://doi.org/10.1112/s0010437x21007351.
ieee: P. Autissier, D. Bonolis, and Y. Lamzouri, “The distribution of the maximum
of partial sums of Kloosterman sums and other trace functions,” Compositio
Mathematica, vol. 157, no. 7. Cambridge University Press, pp. 1610–1651, 2021.
ista: Autissier P, Bonolis D, Lamzouri Y. 2021. The distribution of the maximum
of partial sums of Kloosterman sums and other trace functions. Compositio Mathematica.
157(7), 1610–1651.
mla: Autissier, Pascal, et al. “The Distribution of the Maximum of Partial Sums
of Kloosterman Sums and Other Trace Functions.” Compositio Mathematica,
vol. 157, no. 7, Cambridge University Press, 2021, pp. 1610–51, doi:10.1112/s0010437x21007351.
short: P. Autissier, D. Bonolis, Y. Lamzouri, Compositio Mathematica 157 (2021)
1610–1651.
corr_author: '1'
das_tickbox: '0'
date_created: 2022-02-01T08:10:43Z
date_published: 2021-06-28T00:00:00Z
date_updated: 2026-08-06T11:13:19Z
day: '28'
department:
- _id: TiBr
doi: 10.1112/s0010437x21007351
external_id:
arxiv:
- '1909.03266'
isi:
- '000667289300001'
intvolume: ' 157'
isi: 1
issue: '7'
keyword:
- Algebra and Number Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.03266
month: '06'
oa: 1
oa_version: Preprint
page: 1610-1651
publication: Compositio Mathematica
publication_identifier:
eissn:
- 1570-5846
issn:
- 0010-437X
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: The distribution of the maximum of partial sums of Kloosterman sums and other
trace functions
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 157
year: '2021'
...
---
_id: '10325'
abstract:
- lang: eng
text: Since the inception of Bitcoin, a plethora of distributed ledgers differing
in design and purpose has been created. While by design, blockchains provide no
means to securely communicate with external systems, numerous attempts towards
trustless cross-chain communication have been proposed over the years. Today,
cross-chain communication (CCC) plays a fundamental role in cryptocurrency exchanges,
scalability efforts via sharding, extension of existing systems through sidechains,
and bootstrapping of new blockchains. Unfortunately, existing proposals are designed
ad-hoc for specific use-cases, making it hard to gain confidence in their correctness
and composability. We provide the first systematic exposition of cross-chain communication
protocols. We formalize the underlying research problem and show that CCC is impossible
without a trusted third party, contrary to common beliefs in the blockchain community.
With this result in mind, we develop a framework to design new and evaluate existing
CCC protocols, focusing on the inherent trust assumptions thereof, and derive
a classification covering the field of cross-chain communication to date. We conclude
by discussing open challenges for CCC research and the implications of interoperability
on the security and privacy of blockchains.
acknowledgement: 'We would like express our gratitude to Georgia Avarikioti, Daniel
Perez and Dominik Harz for helpful comments and feedback on earlier versions of
this manuscript. We also thank Nicholas Stifter, Aljosha Judmayer, Philipp Schindler,
Edgar Weippl, and Alistair Stewart for insightful discussions during the early stages
of this research. We also wish to thank the anonymous reviewers for their valuable
comments that helped improve the presentation of our results. This research was
funded by Bridge 1 858561 SESC; Bridge 1 864738 PR4DLT (all FFG); the Christian
Doppler Laboratory for Security and Quality Improvement in the Production System
Lifecycle (CDL-SQI); the competence center SBA-K1 funded by COMET; Chaincode Labs
through the project SLN: Scalability for the Lightning Network; and by the Austrian
Science Fund (FWF) through the Meitner program (project M-2608). Mustafa Al-Bassam
is funded by a scholarship from the Alan Turing Institute. Alexei Zamyatin conducted
the early stages of this work during his time at SBA Research, and was supported
by a Binance Research Fellowship.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexei
full_name: Zamyatin, Alexei
last_name: Zamyatin
- first_name: Mustafa
full_name: Al-Bassam, Mustafa
last_name: Al-Bassam
- first_name: Dionysis
full_name: Zindros, Dionysis
last_name: Zindros
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
orcid: 0000-0002-8827-3382
- first_name: Pedro
full_name: Moreno-Sanchez, Pedro
last_name: Moreno-Sanchez
- first_name: Aggelos
full_name: Kiayias, Aggelos
last_name: Kiayias
- first_name: William J.
full_name: Knottenbelt, William J.
last_name: Knottenbelt
citation:
ama: 'Zamyatin A, Al-Bassam M, Zindros D, et al. SoK: Communication across distributed
ledgers. In: 25th International Conference on Financial Cryptography and Data
Security. Vol 12675. Springer Nature; 2021:3-36. doi:10.1007/978-3-662-64331-0_1'
apa: 'Zamyatin, A., Al-Bassam, M., Zindros, D., Kokoris Kogias, E., Moreno-Sanchez,
P., Kiayias, A., & Knottenbelt, W. J. (2021). SoK: Communication across distributed
ledgers. In 25th International Conference on Financial Cryptography and Data
Security (Vol. 12675, pp. 3–36). Virtual: Springer Nature. https://doi.org/10.1007/978-3-662-64331-0_1'
chicago: 'Zamyatin, Alexei, Mustafa Al-Bassam, Dionysis Zindros, Eleftherios Kokoris
Kogias, Pedro Moreno-Sanchez, Aggelos Kiayias, and William J. Knottenbelt. “SoK:
Communication across Distributed Ledgers.” In 25th International Conference
on Financial Cryptography and Data Security, 12675:3–36. Springer Nature,
2021. https://doi.org/10.1007/978-3-662-64331-0_1.'
ieee: 'A. Zamyatin et al., “SoK: Communication across distributed ledgers,”
in 25th International Conference on Financial Cryptography and Data Security,
Virtual, 2021, vol. 12675, pp. 3–36.'
ista: 'Zamyatin A, Al-Bassam M, Zindros D, Kokoris Kogias E, Moreno-Sanchez P, Kiayias
A, Knottenbelt WJ. 2021. SoK: Communication across distributed ledgers. 25th International
Conference on Financial Cryptography and Data Security. FC: Financial Cryptography,
LNCS, vol. 12675, 3–36.'
mla: 'Zamyatin, Alexei, et al. “SoK: Communication across Distributed Ledgers.”
25th International Conference on Financial Cryptography and Data Security,
vol. 12675, Springer Nature, 2021, pp. 3–36, doi:10.1007/978-3-662-64331-0_1.'
short: A. Zamyatin, M. Al-Bassam, D. Zindros, E. Kokoris Kogias, P. Moreno-Sanchez,
A. Kiayias, W.J. Knottenbelt, in:, 25th International Conference on Financial
Cryptography and Data Security, Springer Nature, 2021, pp. 3–36.
conference:
end_date: 2021-03-05
location: Virtual
name: 'FC: Financial Cryptography'
start_date: 2021-03-01
cryptoeprintid: 1
date_created: 2021-11-21T23:01:29Z
date_published: 2021-10-23T00:00:00Z
date_updated: 2026-08-11T08:05:29Z
day: '23'
department:
- _id: ElKo
doi: 10.1007/978-3-662-64331-0_1
external_id:
cryptoeprintid:
- 2019/1128
isi:
- '000712016200001'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/1128
month: '10'
oa: 1
oa_version: Preprint
page: 3-36
publication: 25th International Conference on Financial Cryptography and Data Security
publication_identifier:
eisbn:
- 978-3-662-64331-0
eissn:
- 1611-3349
isbn:
- 9-783-6626-4330-3
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '8304'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'SoK: Communication across distributed ledgers'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: '12675 '
year: '2021'
...
---
_id: '10599'
abstract:
- lang: eng
text: A two-part successive syndrome-check decoding of polar codes is proposed with
the first part successively refining the received codeword and the second part
checking its syndrome. A new formulation of the successive-cancellation (SC) decoding
algorithm is presented that allows for successively refining the received codeword
by comparing the log-likelihood ratio value of a frozen bit with its predefined
value. The syndrome of the refined received codeword is then checked for possible
errors. In case there are no errors, the decoding process is terminated. Otherwise,
the decoder continues to refine the received codeword. The proposed method is
extended to the case of SC list (SCL) decoding by terminating the decoding process
when the syndrome of the best candidate in the list indicates no errors. Simulation
results show that the proposed method reduces the time-complexity of SC and SCL
decoders and their fast variants, especially at high signal-to-noise ratios.
acknowledgement: This work is supported in part by ONR grant N00014-18-1-2191. S.
A. Hashemi was supported by a Postdoctoral Fellowship from the Natural Sciences
and Engineering Research Council of Canada (NSERC) and by Huawei. M. Mondelli was
partially supported by the 2019 Lopez-Loreta Prize.
article_processing_charge: No
arxiv: 1
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: John
full_name: Cioffi, John
last_name: Cioffi
- first_name: Andrea
full_name: Goldsmith, Andrea
last_name: Goldsmith
citation:
ama: 'Hashemi SA, Mondelli M, Cioffi J, Goldsmith A. Successive syndrome-check decoding
of polar codes. In: Proceedings of the 55th Asilomar Conference on Signals,
Systems, and Computers. Vol 2021-October. IEEE; 2021:943-947. doi:10.1109/IEEECONF53345.2021.9723394'
apa: 'Hashemi, S. A., Mondelli, M., Cioffi, J., & Goldsmith, A. (2021). Successive
syndrome-check decoding of polar codes. In Proceedings of the 55th Asilomar
Conference on Signals, Systems, and Computers (Vol. 2021–October, pp. 943–947).
Virtual, Pacific Grove, CA, United States: IEEE. https://doi.org/10.1109/IEEECONF53345.2021.9723394'
chicago: Hashemi, Seyyed Ali, Marco Mondelli, John Cioffi, and Andrea Goldsmith.
“Successive Syndrome-Check Decoding of Polar Codes.” In Proceedings of the
55th Asilomar Conference on Signals, Systems, and Computers, 2021–October:943–47.
IEEE, 2021. https://doi.org/10.1109/IEEECONF53345.2021.9723394.
ieee: S. A. Hashemi, M. Mondelli, J. Cioffi, and A. Goldsmith, “Successive syndrome-check
decoding of polar codes,” in Proceedings of the 55th Asilomar Conference on
Signals, Systems, and Computers, Virtual, Pacific Grove, CA, United States,
2021, vol. 2021–October, pp. 943–947.
ista: 'Hashemi SA, Mondelli M, Cioffi J, Goldsmith A. 2021. Successive syndrome-check
decoding of polar codes. Proceedings of the 55th Asilomar Conference on Signals,
Systems, and Computers. ACSSC: Asilomar Conference on Signals, Systems, and Computers
vol. 2021–October, 943–947.'
mla: Hashemi, Seyyed Ali, et al. “Successive Syndrome-Check Decoding of Polar Codes.”
Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers,
vol. 2021–October, IEEE, 2021, pp. 943–47, doi:10.1109/IEEECONF53345.2021.9723394.
short: S.A. Hashemi, M. Mondelli, J. Cioffi, A. Goldsmith, in:, Proceedings of the
55th Asilomar Conference on Signals, Systems, and Computers, IEEE, 2021, pp. 943–947.
conference:
end_date: 2021-11-03
location: Virtual, Pacific Grove, CA, United States
name: 'ACSSC: Asilomar Conference on Signals, Systems, and Computers'
start_date: 2021-10-31
date_created: 2022-01-03T11:39:51Z
date_published: 2021-11-01T00:00:00Z
date_updated: 2026-08-12T06:36:04Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/IEEECONF53345.2021.9723394
external_id:
arxiv:
- '2112.00057'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2112.00057'
month: '11'
oa: 1
oa_version: Preprint
page: 943-947
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: Proceedings of the 55th Asilomar Conference on Signals, Systems, and
Computers
publication_identifier:
isbn:
- '9781665458283'
issn:
- 1058-6393
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Successive syndrome-check decoding of polar codes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2021-October
year: '2021'
...
---
OA_place: repository
OA_type: green
_id: '10597'
abstract:
- lang: eng
text: We thank Emmanuel Abbe and Min Ye for providing us the implementation of RPA
decoding. D. Fathollahi and M. Mondelli are partially supported by the 2019 Lopez-Loreta
Prize. N. Farsad is supported by Discovery Grant from the Natural Sciences and
Engineering Research Council of Canada (NSERC) and Canada Foundation for Innovation
(CFI), John R. Evans Leader Fund. S. A. Hashemi is supported by a Postdoctoral
Fellowship from NSERC.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dorsa
full_name: Fathollahi, Dorsa
id: 712472af-8a7e-11f1-848f-9768b0c2fdf8
last_name: Fathollahi
- first_name: Nariman
full_name: Farsad, Nariman
last_name: Farsad
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Fathollahi D, Farsad N, Hashemi SA, Mondelli M. Sparse multi-decoder recursive
projection aggregation for Reed-Muller codes. In: 2021 IEEE International Symposium
on Information Theory. IEEE; 2021:1082-1087. doi:10.1109/isit45174.2021.9517887'
apa: 'Fathollahi, D., Farsad, N., Hashemi, S. A., & Mondelli, M. (2021). Sparse
multi-decoder recursive projection aggregation for Reed-Muller codes. In 2021
IEEE International Symposium on Information Theory (pp. 1082–1087). Virtual,
Melbourne, Australia: IEEE. https://doi.org/10.1109/isit45174.2021.9517887'
chicago: Fathollahi, Dorsa, Nariman Farsad, Seyyed Ali Hashemi, and Marco Mondelli.
“Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes.”
In 2021 IEEE International Symposium on Information Theory, 1082–87. IEEE,
2021. https://doi.org/10.1109/isit45174.2021.9517887.
ieee: D. Fathollahi, N. Farsad, S. A. Hashemi, and M. Mondelli, “Sparse multi-decoder
recursive projection aggregation for Reed-Muller codes,” in 2021 IEEE International
Symposium on Information Theory, Virtual, Melbourne, Australia, 2021, pp.
1082–1087.
ista: 'Fathollahi D, Farsad N, Hashemi SA, Mondelli M. 2021. Sparse multi-decoder
recursive projection aggregation for Reed-Muller codes. 2021 IEEE International
Symposium on Information Theory. ISIT: International Symposium on Information
Theory, 1082–1087.'
mla: Fathollahi, Dorsa, et al. “Sparse Multi-Decoder Recursive Projection Aggregation
for Reed-Muller Codes.” 2021 IEEE International Symposium on Information Theory,
IEEE, 2021, pp. 1082–87, doi:10.1109/isit45174.2021.9517887.
short: D. Fathollahi, N. Farsad, S.A. Hashemi, M. Mondelli, in:, 2021 IEEE International
Symposium on Information Theory, IEEE, 2021, pp. 1082–1087.
conference:
end_date: 2021-07-20
location: Virtual, Melbourne, Australia
name: 'ISIT: International Symposium on Information Theory'
start_date: 2021-07-12
date_created: 2022-01-03T11:31:26Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2026-08-12T06:36:19Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/isit45174.2021.9517887
external_id:
arxiv:
- '2011.12882'
isi:
- '000701502201029'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2011.12882
month: '09'
oa: 1
oa_version: Preprint
page: 1082-1087
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 2021 IEEE International Symposium on Information Theory
publication_identifier:
eisbn:
- 978-1-5386-8209-8
isbn:
- 978-1-5386-8210-4
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sparse multi-decoder recursive projection aggregation for Reed-Muller codes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10002'
abstract:
- lang: eng
text: 'We present a faster symbolic algorithm for the following central problem
in probabilistic verification: Compute the maximal end-component (MEC) decomposition
of Markov decision processes (MDPs). This problem generalizes the SCC decomposition
problem of graphs and closed recurrent sets of Markov chains. The model of symbolic
algorithms is widely used in formal verification and model-checking, where access
to the input model is restricted to only symbolic operations (e.g., basic set
operations and computation of one-step neighborhood). For an input MDP with n vertices
and m edges, the classical symbolic algorithm from the 1990s for the MEC decomposition
requires O(n2) symbolic operations and O(1) symbolic space. The only other
symbolic algorithm for the MEC decomposition requires O(nm−−√) symbolic operations
and O(m−−√) symbolic space. A main open question is whether the worst-case O(n2) bound
for symbolic operations can be beaten. We present a symbolic algorithm that requires O˜(n1.5) symbolic
operations and O˜(n−−√) symbolic space. Moreover, the parametrization of our
algorithm provides a trade-off between symbolic operations and symbolic space:
for all 0<ϵ≤1/2 the symbolic algorithm requires O˜(n2−ϵ) symbolic operations
and O˜(nϵ) symbolic space ( O˜ hides poly-logarithmic factors). Using our techniques
we present faster algorithms for computing the almost-sure winning regions of ω
-regular objectives for MDPs. We consider the canonical parity objectives for ω
-regular objectives, and for parity objectives with d -priorities we present
an algorithm that computes the almost-sure winning region with O˜(n2−ϵ) symbolic
operations and O˜(nϵ) symbolic space, for all 0<ϵ≤1/2 .'
acknowledgement: The authors are grateful to the anonymous referees for their valuable
comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF)
through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF)
NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For
M. H. the research leading to these results has received funding from the European
Research Council under the European Unions Seventh Framework Programme (FP/2007–2013)
/ ERC Grant Agreement no. 340506.
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvorak, Wolfgang
last_name: Dvorak
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvorak W, Henzinger M, Svozil A. Symbolic time and space tradeoffs
for probabilistic verification. In: Proceedings of the 36th Annual ACM/IEEE
Symposium on Logic in Computer Science. IEEE; 2021:1-13. doi:10.1109/LICS52264.2021.9470739'
apa: 'Chatterjee, K., Dvorak, W., Henzinger, M., & Svozil, A. (2021). Symbolic
time and space tradeoffs for probabilistic verification. 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.9470739'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorak, Monika Henzinger, and Alexander
Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” 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.9470739.
ieee: K. Chatterjee, W. Dvorak, M. Henzinger, and A. Svozil, “Symbolic time and
space tradeoffs for probabilistic verification,” in Proceedings of the 36th
Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021,
pp. 1–13.
ista: 'Chatterjee K, Dvorak W, Henzinger M, Svozil A. 2021. Symbolic time and space
tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE
Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.'
mla: Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic
Verification.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in
Computer Science, IEEE, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470739.
short: K. Chatterjee, W. Dvorak, M. Henzinger, A. Svozil, in:, Proceedings of the
36th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2021, pp. 1–13.
conference:
end_date: 2021-07-02
location: Rome, Italy
name: 'LICS: Logic in Computer Science'
start_date: 2021-06-29
date_created: 2021-09-12T22:01:24Z
date_published: 2021-07-07T00:00:00Z
date_updated: 2026-08-12T06:39:42Z
day: '07'
department:
- _id: KrCh
doi: 10.1109/LICS52264.2021.9470739
ec_funded: 1
external_id:
arxiv:
- '2104.07466'
isi:
- '000947350400089'
isi: 1
keyword:
- Computer science
- Computational modeling
- Markov processes
- Probabilistic logic
- Formal verification
- Game Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2104.07466
month: '07'
oa: 1
oa_version: Preprint
page: 1-13
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_identifier:
eisbn:
- 978-1-6654-4895-6
isbn:
- 978-1-6654-4896-3
issn:
- 1043-6871
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Symbolic time and space tradeoffs for probabilistic verification
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9356'
abstract:
- lang: eng
text: 'In runtime verification, a monitor watches a trace of a system and, if possible,
decides after observing each finite prefix whether or not the unknown infinite
trace satisfies a given specification. We generalize the theory of runtime verification
to monitors that attempt to estimate numerical values of quantitative trace properties
(instead of attempting to conclude boolean values of trace specifications), such
as maximal or average response time along a trace. Quantitative monitors are approximate:
with every finite prefix, they can improve their estimate of the infinite trace''s
unknown property value. Consequently, quantitative monitors can be compared with
regard to a precision-cost trade-off: better approximations of the property value
require more monitor resources, such as states (in the case of finite-state monitors)
or registers, and additional resources yield better approximations. We introduce
a formal framework for quantitative and approximate monitoring, show how it conservatively
generalizes the classical boolean setting for monitoring, and give several precision-cost
trade-offs for monitors. For example, we prove that there are quantitative properties
for which every additional register improves monitoring precision.'
acknowledgement: We thank the anonymous reviewers for their helpful comments. This
research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23
(Wittgenstein Award).
article_number: '9470547'
article_processing_charge: No
arxiv: 1
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Naci E
full_name: Sarac, Naci E
id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425
last_name: Sarac
citation:
ama: 'Henzinger TA, Sarac NE. Quantitative and approximate monitoring. In: 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'
...
---
_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
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
publication: Investigative Ophthalmology & Visual Science
publication_identifier:
eissn:
- 1552-5783
issn:
- 0146-0404
publication_status: published
publisher: Association for Research in Vision and Ophthalmology
quality_controlled: '1'
scopus_import: '1'
status: public
title: Increased susceptibility and intrinsic apoptotic signaling in neurons by induced
HDAC3 expression
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 62
year: '2021'
...
---
_id: '9047'
abstract:
- lang: eng
text: This work analyzes the latency of the simplified successive cancellation (SSC)
decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It
is shown that, unlike conventional successive cancellation decoding, where latency
is linear in the block length, the latency of SSC decoding is sublinear. More
specifically, the latency of SSC decoding is O(N1−1/μ) , where N is the block
length and μ is the scaling exponent of the channel, which captures the speed
of convergence of the rate to capacity. Numerical results demonstrate the tightness
of the bound and show that most of the latency reduction arises from the parallel
decoding of subcodes of rate 0 or 1.
acknowledgement: M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305,
IIS-1741162, and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral
Fellowship from the Natural Sciences and Engineering Research Council of Canada
(NSERC) and by Huawei. The authors would like to thank the anonymous reviewers for
their comments that helped improving the quality of the manuscript.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: John M.
full_name: Cioffi, John M.
last_name: Cioffi
- first_name: Andrea
full_name: Goldsmith, Andrea
last_name: Goldsmith
citation:
ama: Mondelli M, Hashemi SA, Cioffi JM, Goldsmith A. Sublinear latency for simplified
successive cancellation decoding of polar codes. 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: '9817'
abstract:
- lang: eng
text: Elastic bending of initially flat slender elements allows the realization
and economic fabrication of intriguing curved shapes. In this work, we derive
an intuitive but rigorous geometric characterization of the design space of plane
elastic rods with variable stiffness. It enables designers to determine which
shapes are physically viable with active bending by visual inspection alone. Building
on these insights, we propose a method for efficiently designing the geometry
of a flat elastic rod that realizes a target equilibrium curve, which only requires
solving a linear program. We implement this method in an interactive computational
design tool that gives feedback about the feasibility of a design, and computes
the geometry of the structural elements necessary to realize it within an instant.
The tool also offers an iterative optimization routine that improves the fabricability
of a model while modifying it as little as possible. In addition, we use our geometric
characterization to derive an algorithm for analyzing and recovering the stability
of elastic curves that would otherwise snap out of their unstable equilibrium
shapes by buckling. We show the efficacy of our approach by designing and manufacturing
several physical models that are assembled from flat elements.
acknowledgement: "We thank the anonymous reviewers for their generous feedback, and
Michal Piovarči for his help in producing the supplemental video. This project has
received funding from the European Research Council (ERC) under the European Union’s
Horizon 2020 research and innovation programme (grant agreement No 715767).\r\n"
article_number: '126'
article_processing_charge: No
article_type: original
author:
- first_name: Christian
full_name: Hafner, Christian
id: 400429CC-F248-11E8-B48F-1D18A9856A87
last_name: Hafner
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: Hafner C, Bickel B. The design space of plane elastic curves. ACM Transactions
on Graphics. 2021;40(4). doi:10.1145/3450626.3459800
apa: 'Hafner, C., & Bickel, B. (2021). The design space of plane elastic curves.
ACM Transactions on Graphics. Virtual: Association for Computing Machinery.
https://doi.org/10.1145/3450626.3459800'
chicago: Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic
Curves.” ACM Transactions on Graphics. Association for Computing Machinery,
2021. https://doi.org/10.1145/3450626.3459800.
ieee: C. Hafner and B. Bickel, “The design space of plane elastic curves,” ACM
Transactions on Graphics, vol. 40, no. 4. Association for Computing Machinery,
2021.
ista: Hafner C, Bickel B. 2021. The design space of plane elastic curves. ACM Transactions
on Graphics. 40(4), 126.
mla: Hafner, Christian, and Bernd Bickel. “The Design Space of Plane Elastic Curves.”
ACM Transactions on Graphics, vol. 40, no. 4, 126, Association for Computing
Machinery, 2021, doi:10.1145/3450626.3459800.
short: C. Hafner, B. Bickel, ACM Transactions on Graphics 40 (2021).
conference:
end_date: 2021-08-13
location: Virtual
name: 'SIGGRAF: Special Interest Group on Computer Graphics and Interactive Techniques'
start_date: 2021-08-09
date_created: 2021-08-08T22:01:26Z
date_published: 2021-07-19T00:00:00Z
date_updated: 2026-08-17T22:30:05Z
day: '19'
ddc:
- '516'
department:
- _id: BeBi
doi: 10.1145/3450626.3459800
ec_funded: 1
external_id:
isi:
- '000674930900091'
file:
- access_level: open_access
checksum: 7e5d08ce46b0451b3102eacd3d00f85f
content_type: application/pdf
creator: chafner
date_created: 2021-10-18T10:42:15Z
date_updated: 2021-10-18T10:42:15Z
file_id: '10150'
file_name: elastic-curves-paper.pdf
file_size: 17064290
relation: main_file
success: 1
- access_level: open_access
checksum: 0088643478be7c01a703b5b10767348f
content_type: application/pdf
creator: chafner
date_created: 2021-10-18T10:42:22Z
date_updated: 2021-10-18T10:42:22Z
file_id: '10151'
file_name: elastic-curves-supp.pdf
file_size: 547156
relation: supplementary_material
file_date_updated: 2021-10-18T10:42:22Z
has_accepted_license: '1'
intvolume: ' 40'
isi: 1
issue: '4'
keyword:
- Computing methodologies
- shape modeling
- modeling and simulation
- theory of computation
- computational geometry
- mathematics of computing
- mathematical optimization
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
link:
- description: News on IST Website
relation: press_release
url: https://ist.ac.at/en/news/designing-with-elastic-structures/
record:
- id: '12897'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The design space of plane elastic curves
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 40
year: '2021'
...
---
_id: '8602'
abstract:
- lang: eng
text: Collective cell migration offers a rich field of study for non-equilibrium
physics and cellular biology, revealing phenomena such as glassy dynamics, pattern
formation and active turbulence. However, how mechanical and chemical signalling
are integrated at the cellular level to give rise to such collective behaviours
remains unclear. We address this by focusing on the highly conserved phenomenon
of spatiotemporal waves of density and extracellular signal-regulated kinase (ERK)
activation, which appear both in vitro and in vivo during collective cell migration
and wound healing. First, we propose a biophysical theory, backed by mechanical
and optogenetic perturbation experiments, showing that patterns can be quantitatively
explained by a mechanochemical coupling between active cellular tensions and the
mechanosensitive ERK pathway. Next, we demonstrate how this biophysical mechanism
can robustly induce long-ranged order and migration in a desired orientation,
and we determine the theoretically optimal wavelength and period for inducing
maximal migration towards free edges, which fits well with experimentally observed
dynamics. We thereby provide a bridge between the biophysical origin of spatiotemporal
instabilities and the design principles of robust and efficient long-ranged migration.
acknowledgement: We would like to thank G. Tkacik and all of the members of the Hannezo
and Hirashima groups for useful discussions, X. Trepat for help on traction force
microscopy and M. Matsuda for use of the lab facility. E.H. acknowledges grants
from the Austrian Science Fund (FWF) (P 31639) and the European Research Council
(851288). T.H. acknowledges a grant from JST, PRESTO (JPMJPR1949). This project
has received funding from the European Union’s Horizon 2020 research and innovation
programme under the Marie Skłodowska-Curie grant agreement no. 665385 (to D.B.),
from JSPS KAKENHI grant no. 17J02107 (to N.H.) and from the SPIRITS 2018 of Kyoto
University (to E.H. and T.H.).
article_processing_charge: No
article_type: original
author:
- first_name: Daniel R
full_name: Boocock, Daniel R
id: 453AF628-F248-11E8-B48F-1D18A9856A87
last_name: Boocock
orcid: 0000-0002-1585-2631
- first_name: Naoya
full_name: Hino, Naoya
last_name: Hino
- first_name: Natalia
full_name: Ruzickova, Natalia
id: D2761128-D73D-11E9-A1BF-BA0DE6697425
last_name: Ruzickova
- first_name: Tsuyoshi
full_name: Hirashima, Tsuyoshi
last_name: Hirashima
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
citation:
ama: Boocock DR, Hino N, Ruzickova N, Hirashima T, Hannezo EB. Theory of mechanochemical
patterning and optimal migration in cell monolayers. Nature Physics. 2021;17:267-274.
doi:10.1038/s41567-020-01037-7
apa: Boocock, D. R., Hino, N., Ruzickova, N., Hirashima, T., & Hannezo, E. B.
(2021). Theory of mechanochemical patterning and optimal migration in cell monolayers.
Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-020-01037-7
chicago: Boocock, Daniel R, Naoya Hino, Natalia Ruzickova, Tsuyoshi Hirashima, and
Edouard B Hannezo. “Theory of Mechanochemical Patterning and Optimal Migration
in Cell Monolayers.” Nature Physics. Springer Nature, 2021. https://doi.org/10.1038/s41567-020-01037-7.
ieee: D. R. Boocock, N. Hino, N. Ruzickova, T. Hirashima, and E. B. Hannezo, “Theory
of mechanochemical patterning and optimal migration in cell monolayers,” Nature
Physics, vol. 17. Springer Nature, pp. 267–274, 2021.
ista: Boocock DR, Hino N, Ruzickova N, Hirashima T, Hannezo EB. 2021. Theory of
mechanochemical patterning and optimal migration in cell monolayers. Nature Physics.
17, 267–274.
mla: Boocock, Daniel R., et al. “Theory of Mechanochemical Patterning and Optimal
Migration in Cell Monolayers.” Nature Physics, vol. 17, Springer Nature,
2021, pp. 267–74, doi:10.1038/s41567-020-01037-7.
short: D.R. Boocock, N. Hino, N. Ruzickova, T. Hirashima, E.B. Hannezo, Nature Physics
17 (2021) 267–274.
corr_author: '1'
date_created: 2020-10-04T22:01:37Z
date_published: 2021-02-01T00:00:00Z
date_updated: 2026-08-17T22:30:06Z
day: '01'
department:
- _id: EdHa
doi: 10.1038/s41567-020-01037-7
ec_funded: 1
external_id:
isi:
- '000573519500002'
intvolume: ' 17'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2020.05.15.096479
month: '02'
oa: 1
oa_version: Preprint
page: 267-274
project:
- _id: 268294B6-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31639
name: Active mechano-chemical description of the cell cytoskeleton
- _id: 05943252-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '851288'
name: Design Principles of Branching Morphogenesis
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Nature Physics
publication_identifier:
eissn:
- 1745-2481
issn:
- 1745-2473
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/wound-healing-waves/
record:
- id: '12964'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Theory of mechanochemical patterning and optimal migration in cell monolayers
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2021'
...
---
_id: '9429'
abstract:
- lang: eng
text: De novo loss of function mutations in the ubiquitin ligase-encoding gene Cullin3
lead to autism spectrum disorder (ASD). In mouse, constitutive haploinsufficiency
leads to motor coordination deficits as well as ASD-relevant social and cognitive
impairments. However, induction of Cul3 haploinsufficiency later in life does
not lead to ASD-relevant behaviors, pointing to an important role of Cul3 during
a critical developmental window. Here we show that Cul3 is essential to regulate
neuronal migration and, therefore, constitutive Cul3 heterozygous mutant mice
display cortical lamination abnormalities. At the molecular level, we found that
Cul3 controls neuronal migration by tightly regulating the amount of Plastin3
(Pls3), a previously unrecognized player of neural migration. Furthermore, we
found that Pls3 cell-autonomously regulates cell migration by regulating actin
cytoskeleton organization, and its levels are inversely proportional to neural
migration speed. Finally, we provide evidence that cellular phenotypes associated
with autism-linked gene haploinsufficiency can be rescued by transcriptional activation
of the intact allele in vitro, offering a proof of concept for a potential therapeutic
approach for ASDs.
acknowledged_ssus:
- _id: PreCl
acknowledgement: We thank A. Coll Manzano, F. Freeman, M. Ladron de Guevara, and A.
Ç. Yahya for technical assistance, S. Deixler, A. Lepold, and A. Schlerka for the
management of our animal colony, as well as M. Schunn and the Preclinical Facility
team for technical assistance. We thank K. Heesom and her team at the University
of Bristol Proteomics Facility for the proteomics sample preparation, data generation,
and analysis support. We thank Y. B. Simon for kindly providing the plasmid for
lentiviral labeling. Further, we thank M. Sixt for his advice regarding cell migration
and the fruitful discussions. This work was supported by the ISTPlus postdoctoral
fellowship (Grant Agreement No. 754411) to B.B., by the European Union’s Horizon
2020 research and innovation program (ERC) grant 715508 (REVERSEAUTISM), and by
the Austrian Science Fund (FWF) to G.N. (DK W1232-B24 and SFB F7807-B) and to J.G.D
(I3600-B27).
article_number: '3058'
article_processing_charge: No
article_type: original
author:
- first_name: Jasmin
full_name: Morandell, Jasmin
id: 4739D480-F248-11E8-B48F-1D18A9856A87
last_name: Morandell
- first_name: Lena A
full_name: Schwarz, Lena A
id: 29A8453C-F248-11E8-B48F-1D18A9856A87
last_name: Schwarz
- first_name: Bernadette
full_name: Basilico, Bernadette
id: 36035796-5ACA-11E9-A75E-7AF2E5697425
last_name: Basilico
orcid: 0000-0003-1843-3173
- first_name: Saren
full_name: Tasciyan, Saren
id: 4323B49C-F248-11E8-B48F-1D18A9856A87
last_name: Tasciyan
orcid: 0000-0003-1671-393X
- first_name: Georgi A
full_name: Dimchev, Georgi A
id: 38C393BE-F248-11E8-B48F-1D18A9856A87
last_name: Dimchev
orcid: 0000-0001-8370-6161
- first_name: Armel
full_name: Nicolas, Armel
id: 2A103192-F248-11E8-B48F-1D18A9856A87
last_name: Nicolas
- first_name: Christoph M
full_name: Sommer, Christoph M
id: 4DF26D8C-F248-11E8-B48F-1D18A9856A87
last_name: Sommer
orcid: 0000-0003-1216-9105
- first_name: Caroline
full_name: Kreuzinger, Caroline
id: 382077BA-F248-11E8-B48F-1D18A9856A87
last_name: Kreuzinger
- first_name: Christoph
full_name: Dotter, Christoph
id: 4C66542E-F248-11E8-B48F-1D18A9856A87
last_name: Dotter
orcid: 0000-0002-9033-9096
- first_name: Lisa
full_name: Knaus, Lisa
id: 3B2ABCF4-F248-11E8-B48F-1D18A9856A87
last_name: Knaus
- first_name: Zoe
full_name: Dobler, Zoe
id: D23090A2-9057-11EA-883A-A8396FC7A38F
last_name: Dobler
- first_name: Emanuele
full_name: Cacci, Emanuele
last_name: Cacci
- first_name: Florian KM
full_name: Schur, Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: Morandell J, Schwarz LA, Basilico B, et al. Cul3 regulates cytoskeleton protein
homeostasis and cell migration during a critical window of brain development.
Nature Communications. 2021;12(1). doi:10.1038/s41467-021-23123-x
apa: Morandell, J., Schwarz, L. A., Basilico, B., Tasciyan, S., Dimchev, G. A.,
Nicolas, A., … Novarino, G. (2021). Cul3 regulates cytoskeleton protein homeostasis
and cell migration during a critical window of brain development. Nature Communications.
Springer Nature. https://doi.org/10.1038/s41467-021-23123-x
chicago: Morandell, Jasmin, Lena A Schwarz, Bernadette Basilico, Saren Tasciyan,
Georgi A Dimchev, Armel Nicolas, Christoph M Sommer, et al. “Cul3 Regulates Cytoskeleton
Protein Homeostasis and Cell Migration during a Critical Window of Brain Development.”
Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-021-23123-x.
ieee: J. Morandell et al., “Cul3 regulates cytoskeleton protein homeostasis
and cell migration during a critical window of brain development,” Nature Communications,
vol. 12, no. 1. Springer Nature, 2021.
ista: Morandell J, Schwarz LA, Basilico B, Tasciyan S, Dimchev GA, Nicolas A, Sommer
CM, Kreuzinger C, Dotter C, Knaus L, Dobler Z, Cacci E, Schur FK, Danzl JG, Novarino
G. 2021. Cul3 regulates cytoskeleton protein homeostasis and cell migration during
a critical window of brain development. Nature Communications. 12(1), 3058.
mla: Morandell, Jasmin, et al. “Cul3 Regulates Cytoskeleton Protein Homeostasis
and Cell Migration during a Critical Window of Brain Development.” Nature Communications,
vol. 12, no. 1, 3058, Springer Nature, 2021, doi:10.1038/s41467-021-23123-x.
short: J. Morandell, L.A. Schwarz, B. Basilico, S. Tasciyan, G.A. Dimchev, A. Nicolas,
C.M. Sommer, C. Kreuzinger, C. Dotter, L. Knaus, Z. Dobler, E. Cacci, F.K. Schur,
J.G. Danzl, G. Novarino, Nature Communications 12 (2021).
corr_author: '1'
date_created: 2021-05-28T11:49:46Z
date_published: 2021-05-24T00:00:00Z
date_updated: 2026-08-17T22:30:10Z
day: '24'
ddc:
- '572'
department:
- _id: GaNo
- _id: JoDa
- _id: FlSc
- _id: MiSi
- _id: LifeSc
- _id: Bio
doi: 10.1038/s41467-021-23123-x
ec_funded: 1
external_id:
isi:
- '000658769900010'
file:
- access_level: open_access
checksum: 337e0f7959c35ec959984cacdcb472ba
content_type: application/pdf
creator: kschuh
date_created: 2021-05-28T12:39:43Z
date_updated: 2021-05-28T12:39:43Z
file_id: '9430'
file_name: 2021_NatureCommunications_Morandell.pdf
file_size: 9358599
relation: main_file
success: 1
file_date_updated: 2021-05-28T12:39:43Z
has_accepted_license: '1'
intvolume: ' 12'
isi: 1
issue: '1'
keyword:
- General Biochemistry
- Genetics and Molecular Biology
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 25444568-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715508'
name: Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo
and in vitro Models
- _id: 2548AE96-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W1232
name: Molecular Drug Targets
- _id: 05A0D778-7A3F-11EA-A408-12923DDC885E
grant_number: F7807
name: Stem Cell Modulation in Neural Development and Regeneration/ P07-Neural stem
cells in autism and epilepsy
- _id: 265CB4D0-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03600
name: Optical control of synaptic function via adhesion molecules
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: press_release
url: https://ist.ac.at/en/news/defective-gene-slows-down-brain-cells/
record:
- id: '19557'
relation: dissertation_contains
status: public
- id: '7800'
relation: earlier_version
status: public
- id: '12401'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Cul3 regulates cytoskeleton protein homeostasis and cell migration during a
critical window of brain development
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 12
year: '2021'
...