---
_id: '12288'
abstract:
- lang: eng
text: To understand the function of neuronal circuits, it is crucial to disentangle
the connectivity patterns within the network. However, most tools currently used
to explore connectivity have low throughput, low selectivity, or limited accessibility.
Here, we report the development of an improved packaging system for the production
of the highly neurotropic RVdGenvA-CVS-N2c rabies viral vectors, yielding titers
orders of magnitude higher with no background contamination, at a fraction of
the production time, while preserving the efficiency of transsynaptic labeling.
Along with the production pipeline, we developed suites of ‘starter’ AAV and bicistronic
RVdG-CVS-N2c vectors, enabling retrograde labeling from a wide range of neuronal
populations, tailored for diverse experimental requirements. We demonstrate the
power and flexibility of the new system by uncovering hidden local and distal
inhibitory connections in the mouse hippocampal formation and by imaging the functional
properties of a cortical microcircuit across weeks. Our novel production pipeline
provides a convenient approach to generate new rabies vectors, while our toolkit
flexibly and efficiently expands the current capacity to label, manipulate and
image the neuronal activity of interconnected neuronal circuits in vitro and in
vivo.
acknowledged_ssus:
- _id: Bio
- _id: PreCl
acknowledgement: We thank F Marr for technical assistance, A Murray for RVdG-CVS-N2c
viruses and Neuro2A packaging cell-lines and J Watson for reading the manuscript.
This research was supported by the Scientific Service Units (SSU) of IST-Austria
through resources provided by the Imaging and Optics Facility (IOF) and the Preclinical
Facility (PCF). This project was funded by the European Research Council (ERC) under
the European Union’s Horizon 2020 research and innovation programme (ERC advanced
grant No 692692, PJ, ERC starting grant No 756502, MJ), the Fond zur Förderung der
Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award, PJ), the Human Frontier
Science Program (LT000256/2018-L, AS) and EMBO (ALTF 1098-2017, AS).
article_number: '79848'
article_processing_charge: No
article_type: original
author:
- first_name: Anton L
full_name: Sumser, Anton L
id: 3320A096-F248-11E8-B48F-1D18A9856A87
last_name: Sumser
orcid: 0000-0002-4792-1881
- first_name: Maximilian A
full_name: Jösch, Maximilian A
id: 2BD278E6-F248-11E8-B48F-1D18A9856A87
last_name: Jösch
orcid: 0000-0002-3937-1330
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Yoav
full_name: Ben Simon, Yoav
id: 43DF3136-F248-11E8-B48F-1D18A9856A87
last_name: Ben Simon
citation:
ama: Sumser AL, Jösch MA, Jonas PM, Ben Simon Y. Fast, high-throughput production
of improved rabies viral vectors for specific, efficient and versatile transsynaptic
retrograde labeling. eLife. 2022;11. doi:10.7554/elife.79848
apa: Sumser, A. L., Jösch, M. A., Jonas, P. M., & Ben Simon, Y. (2022). Fast,
high-throughput production of improved rabies viral vectors for specific, efficient
and versatile transsynaptic retrograde labeling. ELife. eLife Sciences
Publications. https://doi.org/10.7554/elife.79848
chicago: Sumser, Anton L, Maximilian A Jösch, Peter M Jonas, and Yoav Ben Simon.
“Fast, High-Throughput Production of Improved Rabies Viral Vectors for Specific,
Efficient and Versatile Transsynaptic Retrograde Labeling.” ELife. eLife
Sciences Publications, 2022. https://doi.org/10.7554/elife.79848.
ieee: A. L. Sumser, M. A. Jösch, P. M. Jonas, and Y. Ben Simon, “Fast, high-throughput
production of improved rabies viral vectors for specific, efficient and versatile
transsynaptic retrograde labeling,” eLife, vol. 11. eLife Sciences Publications,
2022.
ista: Sumser AL, Jösch MA, Jonas PM, Ben Simon Y. 2022. Fast, high-throughput production
of improved rabies viral vectors for specific, efficient and versatile transsynaptic
retrograde labeling. eLife. 11, 79848.
mla: Sumser, Anton L., et al. “Fast, High-Throughput Production of Improved Rabies
Viral Vectors for Specific, Efficient and Versatile Transsynaptic Retrograde Labeling.”
ELife, vol. 11, 79848, eLife Sciences Publications, 2022, doi:10.7554/elife.79848.
short: A.L. Sumser, M.A. Jösch, P.M. Jonas, Y. Ben Simon, ELife 11 (2022).
corr_author: '1'
date_created: 2023-01-16T10:04:15Z
date_published: 2022-09-15T00:00:00Z
date_updated: 2025-04-15T08:29:05Z
day: '15'
ddc:
- '570'
department:
- _id: MaJö
- _id: PeJo
doi: 10.7554/elife.79848
ec_funded: 1
external_id:
isi:
- '000892204300001'
pmid:
- '36040301'
file:
- access_level: open_access
checksum: 5a2a65e3e7225090c3d8199f3bbd7b7b
content_type: application/pdf
creator: dernst
date_created: 2023-01-30T11:50:53Z
date_updated: 2023-01-30T11:50:53Z
file_id: '12463'
file_name: 2022_eLife_Sumser.pdf
file_size: 8506811
relation: main_file
success: 1
file_date_updated: 2023-01-30T11:50:53Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
keyword:
- General Immunology and Microbiology
- General Biochemistry
- Genetics and Molecular Biology
- General Medicine
- General Neuroscience
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glutamatergic synapse
- _id: 2634E9D2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '756502'
name: Circuits of Visual Attention
- _id: 25C5A090-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00312
name: Synaptic communication in neuronal microcircuits
- _id: 266D407A-B435-11E9-9278-68D0E5697425
grant_number: LT000256
name: Neuronal networks of salience and spatial detection in the murine superior
colliculus
- _id: 264FEA02-B435-11E9-9278-68D0E5697425
grant_number: ALTF 1098-2017
name: Connecting sensory with motor processing in the superior colliculus
publication: eLife
publication_identifier:
eissn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fast, high-throughput production of improved rabies viral vectors for specific,
efficient and versatile transsynaptic retrograde labeling
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: 11
year: '2022'
...
---
_id: '12290'
abstract:
- lang: eng
text: We prove local laws, i.e. optimal concentration estimates for arbitrary products
of resolvents of a Wigner random matrix with deterministic matrices in between.
We find that the size of such products heavily depends on whether some of the
deterministic matrices are traceless. Our estimates correctly account for this
dependence and they hold optimally down to the smallest possible spectral scale.
acknowledgement: L. Erdős was supported by ERC Advanced Grant “RMTBeyond” No. 101020331.
D. Schröder was supported by Dr. Max Rössler, the Walter Haefner Foundation and
the ETH Zürich Foundation.
article_processing_charge: No
article_type: original
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Cipolloni G, Erdös L, Schröder DJ. Optimal multi-resolvent local laws for Wigner
matrices. Electronic Journal of Probability. 2022;27:1-38. doi:10.1214/22-ejp838
apa: Cipolloni, G., Erdös, L., & Schröder, D. J. (2022). Optimal multi-resolvent
local laws for Wigner matrices. Electronic Journal of Probability. Institute
of Mathematical Statistics. https://doi.org/10.1214/22-ejp838
chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Optimal Multi-Resolvent
Local Laws for Wigner Matrices.” Electronic Journal of Probability. Institute
of Mathematical Statistics, 2022. https://doi.org/10.1214/22-ejp838.
ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “Optimal multi-resolvent local
laws for Wigner matrices,” Electronic Journal of Probability, vol. 27.
Institute of Mathematical Statistics, pp. 1–38, 2022.
ista: Cipolloni G, Erdös L, Schröder DJ. 2022. Optimal multi-resolvent local laws
for Wigner matrices. Electronic Journal of Probability. 27, 1–38.
mla: Cipolloni, Giorgio, et al. “Optimal Multi-Resolvent Local Laws for Wigner Matrices.”
Electronic Journal of Probability, vol. 27, Institute of Mathematical Statistics,
2022, pp. 1–38, doi:10.1214/22-ejp838.
short: G. Cipolloni, L. Erdös, D.J. Schröder, Electronic Journal of Probability
27 (2022) 1–38.
corr_author: '1'
date_created: 2023-01-16T10:04:38Z
date_published: 2022-09-12T00:00:00Z
date_updated: 2025-04-14T07:57:19Z
day: '12'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1214/22-ejp838
ec_funded: 1
external_id:
isi:
- '000910863700003'
file:
- access_level: open_access
checksum: bb647b48fbdb59361210e425c220cdcb
content_type: application/pdf
creator: dernst
date_created: 2023-01-30T11:59:21Z
date_updated: 2023-01-30T11:59:21Z
file_id: '12464'
file_name: 2022_ElecJournProbability_Cipolloni.pdf
file_size: 502149
relation: main_file
success: 1
file_date_updated: 2023-01-30T11:59:21Z
has_accepted_license: '1'
intvolume: ' 27'
isi: 1
keyword:
- Statistics
- Probability and Uncertainty
- Statistics and Probability
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 1-38
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Electronic Journal of Probability
publication_identifier:
eissn:
- 1083-6489
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal multi-resolvent local laws for Wigner matrices
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: 27
year: '2022'
...
---
_id: '12298'
abstract:
- lang: eng
text: 'Existing committee-based Byzantine state machine replication (SMR) protocols,
typically deployed in production blockchains, face a clear trade-off: (1) they
either achieve linear communication cost in the steady state, but sacrifice liveness
during periods of asynchrony, or (2) they are robust (progress with probability
one) but pay quadratic communication cost. We believe this trade-off is unwarranted
since existing linear protocols still have asymptotic quadratic cost in the worst
case. We design Ditto, a Byzantine SMR protocol that enjoys the best of both worlds:
optimal communication on and off the steady state (linear and quadratic, respectively)
and progress guarantee under asynchrony and DDoS attacks. We achieve this by replacing
the view-synchronization of partially synchronous protocols with an asynchronous
fallback mechanism at no extra asymptotic cost. Specifically, we start from HotStuff,
a state-of-the-art linear protocol, and gradually build Ditto. As a separate contribution
and an intermediate step, we design a 2-chain version of HotStuff, Jolteon, which
leverages a quadratic view-change mechanism to reduce the latency of the standard
3-chain HotStuff. We implement and experimentally evaluate all our systems to
prove that breaking the robustness-efficiency trade-off is in the realm of practicality.'
acknowledgement: We thank our shepherd Aniket Kate and the anonymous reviewers at
FC 2022 for their helpful feedback. This work is supported by the Novi team at Facebook.
We also thank the Novi Research and Engineering teams for valuable feedback, and
in particular Mathieu Baudet, Andrey Chursin, George Danezis, Zekun Li, and Dahlia
Malkhi for discussions that shaped this work.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
- first_name: Alberto
full_name: Sonnino, Alberto
last_name: Sonnino
- first_name: Alexander
full_name: Spiegelman, Alexander
last_name: Spiegelman
- first_name: Zhuolun
full_name: Xiang, Zhuolun
last_name: Xiang
citation:
ama: 'Gelashvili R, Kokoris Kogias E, Sonnino A, Spiegelman A, Xiang Z. Jolteon
and ditto: Network-adaptive efficient consensus with asynchronous fallback. In:
Financial Cryptography and Data Security. Vol 13411. Springer Nature; 2022:296-315.
doi:10.1007/978-3-031-18283-9_14'
apa: 'Gelashvili, R., Kokoris Kogias, E., Sonnino, A., Spiegelman, A., & Xiang,
Z. (2022). Jolteon and ditto: Network-adaptive efficient consensus with asynchronous
fallback. In Financial Cryptography and Data Security (Vol. 13411, pp.
296–315). Radisson Grenada Beach Resort, Grenada: Springer Nature. https://doi.org/10.1007/978-3-031-18283-9_14'
chicago: 'Gelashvili, Rati, Eleftherios Kokoris Kogias, Alberto Sonnino, Alexander
Spiegelman, and Zhuolun Xiang. “Jolteon and Ditto: Network-Adaptive Efficient
Consensus with Asynchronous Fallback.” In Financial Cryptography and Data Security,
13411:296–315. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-18283-9_14.'
ieee: 'R. Gelashvili, E. Kokoris Kogias, A. Sonnino, A. Spiegelman, and Z. Xiang,
“Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback,”
in Financial Cryptography and Data Security, Radisson Grenada Beach Resort,
Grenada, 2022, vol. 13411, pp. 296–315.'
ista: 'Gelashvili R, Kokoris Kogias E, Sonnino A, Spiegelman A, Xiang Z. 2022. Jolteon
and ditto: Network-adaptive efficient consensus with asynchronous fallback. Financial
Cryptography and Data Security. FC: Financial Cryptography, LNCS, vol. 13411,
296–315.'
mla: 'Gelashvili, Rati, et al. “Jolteon and Ditto: Network-Adaptive Efficient Consensus
with Asynchronous Fallback.” Financial Cryptography and Data Security,
vol. 13411, Springer Nature, 2022, pp. 296–315, doi:10.1007/978-3-031-18283-9_14.'
short: R. Gelashvili, E. Kokoris Kogias, A. Sonnino, A. Spiegelman, Z. Xiang, in:,
Financial Cryptography and Data Security, Springer Nature, 2022, pp. 296–315.
conference:
end_date: 2022-05-06
location: Radisson Grenada Beach Resort, Grenada
name: 'FC: Financial Cryptography'
start_date: 2022-05-02
date_created: 2023-01-16T10:05:51Z
date_published: 2022-10-22T00:00:00Z
date_updated: 2025-09-10T09:52:23Z
day: '22'
department:
- _id: ElKo
doi: 10.1007/978-3-031-18283-9_14
external_id:
arxiv:
- '2106.10362'
isi:
- '001423640200014'
intvolume: ' 13411'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2106.10362'
month: '10'
oa: 1
oa_version: Preprint
page: 296-315
publication: Financial Cryptography and Data Security
publication_identifier:
eisbn:
- '9783031182839'
eissn:
- 1611-3349
isbn:
- '9783031182822'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Jolteon and ditto: Network-adaptive efficient consensus with asynchronous
fallback'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 13411
year: '2022'
...
---
_id: '12300'
abstract:
- lang: eng
text: Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems
without a trusted third party and is a building block to decentralized protocols
such as randomness beacons, threshold signatures, and general multiparty computation.
Until recently, DKG protocols have assumed the synchronous model and thus are
vulnerable when their underlying network assumptions do not hold. The recent advancements
in asynchronous DKG protocols are insufficient as they either have poor efficiency
or limited functionality, resulting in a lack of concrete implementations. In
this paper, we present a simple and concretely efficient asynchronous DKG (ADKG)
protocol. In a network of n nodes, our ADKG protocol can tolerate up to t2022 IEEE Symposium on Security and Privacy.
Institute of Electrical and Electronics Engineers; 2022:2518-2534. doi:10.1109/sp46214.2022.9833584'
apa: 'Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris Kogias, E., & Ren,
L. (2022). Practical asynchronous distributed key generation. In 2022 IEEE
Symposium on Security and Privacy (pp. 2518–2534). San Francisco, CA, United
States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/sp46214.2022.9833584'
chicago: Das, Sourav, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Eleftherios Kokoris
Kogias, and Ling Ren. “Practical Asynchronous Distributed Key Generation.” In
2022 IEEE Symposium on Security and Privacy, 2518–34. Institute of Electrical
and Electronics Engineers, 2022. https://doi.org/10.1109/sp46214.2022.9833584.
ieee: S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, and L. Ren, “Practical
asynchronous distributed key generation,” in 2022 IEEE Symposium on Security
and Privacy, San Francisco, CA, United States, 2022, pp. 2518–2534.
ista: 'Das S, Yurek T, Xiang Z, Miller A, Kokoris Kogias E, Ren L. 2022. Practical
asynchronous distributed key generation. 2022 IEEE Symposium on Security and Privacy.
SP: Symposium on Security and Privacy, 2518–2534.'
mla: Das, Sourav, et al. “Practical Asynchronous Distributed Key Generation.” 2022
IEEE Symposium on Security and Privacy, Institute of Electrical and Electronics
Engineers, 2022, pp. 2518–34, doi:10.1109/sp46214.2022.9833584.
short: S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, L. Ren, in:, 2022
IEEE Symposium on Security and Privacy, Institute of Electrical and Electronics
Engineers, 2022, pp. 2518–2534.
conference:
end_date: 2022-05-26
location: San Francisco, CA, United States
name: 'SP: Symposium on Security and Privacy'
start_date: 2022-05-23
date_created: 2023-01-16T10:06:11Z
date_published: 2022-07-27T00:00:00Z
date_updated: 2023-02-16T07:43:53Z
day: '27'
department:
- _id: ElKo
doi: 10.1109/sp46214.2022.9833584
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/1591
month: '07'
oa: 1
oa_version: Preprint
page: 2518-2534
publication: 2022 IEEE Symposium on Security and Privacy
publication_identifier:
eisbn:
- '9781665413169'
eissn:
- 2375-1207
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Practical asynchronous distributed key generation
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12302'
abstract:
- lang: eng
text: 'We propose a novel algorithm to decide the language inclusion between (nondeterministic)
Büchi automata, a PSPACE-complete problem. Our approach, like others before, leverage
a notion of quasiorder to prune the search for a counterexample by discarding
candidates which are subsumed by others for the quasiorder. Discarded candidates
are guaranteed to not compromise the completeness of the algorithm. The novelty
of our work lies in the quasiorder used to discard candidates. We introduce FORQs
(family of right quasiorders) that we obtain by adapting the notion of family
of right congruences put forward by Maler and Staiger in 1993. We define a FORQ-based
inclusion algorithm which we prove correct and instantiate it for a specific FORQ,
called the structural FORQ, induced by the Büchi automaton to the right of the
inclusion sign. The resulting implementation, called FORKLIFT, scales up better
than the state-of-the-art on a variety of benchmarks including benchmarks from
program verification and theorem proving for word combinatorics. Artifact: https://doi.org/10.5281/zenodo.6552870'
acknowledgement: This work was partially funded by the ESF Investing in your future,
the Madrid regional project S2018/TCS-4339 BLOQUES, the Spanish project PGC2018-102210-B-I00
BOSCO, the Ramón y Cajal fellowship RYC-2016-20281, and the ERC grant PR1001ERC02.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Kyveli
full_name: Doveri, Kyveli
last_name: Doveri
- first_name: Pierre
full_name: Ganty, Pierre
last_name: Ganty
- first_name: Nicolas Adrien
full_name: Mazzocchi, Nicolas Adrien
id: b26baa86-3308-11ec-87b0-8990f34baa85
last_name: Mazzocchi
citation:
ama: 'Doveri K, Ganty P, Mazzocchi NA. FORQ-based language inclusion formal testing.
In: Computer Aided Verification. Vol 13372. Springer Nature; 2022:109-129.
doi:10.1007/978-3-031-13188-2_6'
apa: 'Doveri, K., Ganty, P., & Mazzocchi, N. A. (2022). FORQ-based language
inclusion formal testing. In Computer Aided Verification (Vol. 13372, pp.
109–129). Haifa, Israel: Springer Nature. https://doi.org/10.1007/978-3-031-13188-2_6'
chicago: Doveri, Kyveli, Pierre Ganty, and Nicolas Adrien Mazzocchi. “FORQ-Based
Language Inclusion Formal Testing.” In Computer Aided Verification, 13372:109–29.
Springer Nature, 2022. https://doi.org/10.1007/978-3-031-13188-2_6.
ieee: K. Doveri, P. Ganty, and N. A. Mazzocchi, “FORQ-based language inclusion formal
testing,” in Computer Aided Verification, Haifa, Israel, 2022, vol. 13372,
pp. 109–129.
ista: 'Doveri K, Ganty P, Mazzocchi NA. 2022. FORQ-based language inclusion formal
testing. Computer Aided Verification. CAV: Computer Aided Verification, LNCS,
vol. 13372, 109–129.'
mla: Doveri, Kyveli, et al. “FORQ-Based Language Inclusion Formal Testing.” Computer
Aided Verification, vol. 13372, Springer Nature, 2022, pp. 109–29, doi:10.1007/978-3-031-13188-2_6.
short: K. Doveri, P. Ganty, N.A. Mazzocchi, in:, Computer Aided Verification, Springer
Nature, 2022, pp. 109–129.
conference:
end_date: 2022-08-10
location: Haifa, Israel
name: 'CAV: Computer Aided Verification'
start_date: 2022-08-07
date_created: 2023-01-16T10:06:31Z
date_published: 2022-08-06T00:00:00Z
date_updated: 2025-04-14T07:55:56Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-031-13188-2_6
ec_funded: 1
external_id:
arxiv:
- '2207.13549'
isi:
- '000870310500006'
file:
- access_level: open_access
checksum: edc363b1be5447a09063e115c247918a
content_type: application/pdf
creator: dernst
date_created: 2023-01-30T12:51:02Z
date_updated: 2023-01-30T12:51:02Z
file_id: '12465'
file_name: 2022_LNCS_Doveri.pdf
file_size: 497682
relation: main_file
success: 1
file_date_updated: 2023-01-30T12:51:02Z
has_accepted_license: '1'
intvolume: ' 13372'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 109-129
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: Computer Aided Verification
publication_identifier:
eisbn:
- '9783031131882'
eissn:
- 1611-3349
isbn:
- '9783031131875'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: FORQ-based language inclusion formal testing
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 13372
year: '2022'
...
---
_id: '12303'
abstract:
- lang: eng
text: We construct for each choice of a quiver Q, a cohomology theory A, and a poset
P a “loop Grassmannian” GP(Q,A). This generalizes loop Grassmannians of semisimple
groups and the loop Grassmannians of based quadratic forms. The addition of a
“dilation” torus D⊆G2m gives a quantization GPD(Q,A). This construction is motivated
by the program of introducing an inner cohomology theory in algebraic geometry
adequate for the Geometric Langlands program (Mirković, Some extensions of the
notion of loop Grassmannians. Rad Hrvat. Akad. Znan. Umjet. Mat. Znan., the Mardešić
issue. No. 532, 53–74, 2017) and on the construction of affine quantum groups
from generalized cohomology theories (Yang and Zhao, Quiver varieties and elliptic
quantum groups, preprint. arxiv1708.01418).
acknowledgement: I.M. thanks Zhijie Dong for long-term discussions on the material
that entered this work. We thank Misha Finkelberg for pointing out errors in earlier
versions. His advice and his insistence have led to a much better paper. A part
of the writing was done at the conference at IST (Vienna) attended by all coauthors.
We therefore thank the organizers of the conference and the support of ERC Advanced
Grant Arithmetic and Physics of Higgs moduli spaces No. 320593. The work of I.M.
was partially supported by NSF grants. The work of Y.Y. was partially supported
by the Australian Research Council (ARC) via the award DE190101231. The work of
G.Z. was partially supported by ARC via the award DE190101222.
alternative_title:
- Trends in Mathematics
article_processing_charge: No
arxiv: 1
author:
- first_name: Ivan
full_name: Mirković, Ivan
last_name: Mirković
- first_name: Yaping
full_name: Yang, Yaping
last_name: Yang
- first_name: Gufang
full_name: Zhao, Gufang
id: 2BC2AC5E-F248-11E8-B48F-1D18A9856A87
last_name: Zhao
citation:
ama: 'Mirković I, Yang Y, Zhao G. Loop Grassmannians of Quivers and Affine Quantum
Groups. In: Baranovskky V, Guay N, Schedler T, eds. Representation Theory and
Algebraic Geometry. 1st ed. TM. Cham: Springer Nature; Birkhäuser; 2022:347-392.
doi:10.1007/978-3-030-82007-7_8'
apa: 'Mirković, I., Yang, Y., & Zhao, G. (2022). Loop Grassmannians of Quivers
and Affine Quantum Groups. In V. Baranovskky, N. Guay, & T. Schedler (Eds.),
Representation Theory and Algebraic Geometry (1st ed., pp. 347–392). Cham:
Springer Nature; Birkhäuser. https://doi.org/10.1007/978-3-030-82007-7_8'
chicago: 'Mirković, Ivan, Yaping Yang, and Gufang Zhao. “Loop Grassmannians of Quivers
and Affine Quantum Groups.” In Representation Theory and Algebraic Geometry,
edited by Vladimir Baranovskky, Nicolas Guay, and Travis Schedler, 1st ed., 347–92.
TM. Cham: Springer Nature; Birkhäuser, 2022. https://doi.org/10.1007/978-3-030-82007-7_8.'
ieee: 'I. Mirković, Y. Yang, and G. Zhao, “Loop Grassmannians of Quivers and Affine
Quantum Groups,” in Representation Theory and Algebraic Geometry, 1st ed.,
V. Baranovskky, N. Guay, and T. Schedler, Eds. Cham: Springer Nature; Birkhäuser,
2022, pp. 347–392.'
ista: 'Mirković I, Yang Y, Zhao G. 2022.Loop Grassmannians of Quivers and Affine
Quantum Groups. In: Representation Theory and Algebraic Geometry. Trends in Mathematics,
, 347–392.'
mla: Mirković, Ivan, et al. “Loop Grassmannians of Quivers and Affine Quantum Groups.”
Representation Theory and Algebraic Geometry, edited by Vladimir Baranovskky
et al., 1st ed., Springer Nature; Birkhäuser, 2022, pp. 347–92, doi:10.1007/978-3-030-82007-7_8.
short: I. Mirković, Y. Yang, G. Zhao, in:, V. Baranovskky, N. Guay, T. Schedler
(Eds.), Representation Theory and Algebraic Geometry, 1st ed., Springer Nature;
Birkhäuser, Cham, 2022, pp. 347–392.
date_created: 2023-01-16T10:06:41Z
date_published: 2022-06-16T00:00:00Z
date_updated: 2025-04-14T09:12:46Z
day: '16'
department:
- _id: TaHa
doi: 10.1007/978-3-030-82007-7_8
ec_funded: 1
edition: '1'
editor:
- first_name: Vladimir
full_name: Baranovskky, Vladimir
last_name: Baranovskky
- first_name: Nicolas
full_name: Guay, Nicolas
last_name: Guay
- first_name: Travis
full_name: Schedler, Travis
last_name: Schedler
external_id:
arxiv:
- '1810.10095'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1810.10095
month: '06'
oa: 1
oa_version: Preprint
page: 347-392
place: Cham
project:
- _id: 25E549F4-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '320593'
name: Arithmetic and physics of Higgs moduli spaces
publication: Representation Theory and Algebraic Geometry
publication_identifier:
eisbn:
- '9783030820077'
eissn:
- 2297-024X
isbn:
- '9783030820060'
issn:
- 2297-0215
publication_status: published
publisher: Springer Nature; Birkhäuser
quality_controlled: '1'
scopus_import: '1'
series_title: TM
status: public
title: Loop Grassmannians of Quivers and Affine Quantum Groups
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12304'
abstract:
- lang: eng
text: 'We establish sharp criteria for the instantaneous propagation of free boundaries
in solutions to the thin-film equation. The criteria are formulated in terms of
the initial distribution of mass (as opposed to previous almost-optimal results),
reflecting the fact that mass is a locally conserved quantity for the thin-film
equation. In the regime of weak slippage, our criteria are at the same time necessary
and sufficient. The proof of our upper bounds on free boundary propagation is
based on a strategy of “propagation of degeneracy” down to arbitrarily small spatial
scales: We combine estimates on the local mass and estimates on energies to show
that “degeneracy” on a certain space-time cylinder entails “degeneracy” on a spatially
smaller space-time cylinder with the same time horizon. The derivation of our
lower bounds on free boundary propagation is based on a combination of a monotone
quantity and almost optimal estimates established previously by the second author
with a new estimate connecting motion of mass to entropy production.'
acknowledgement: N. De Nitti acknowledges the kind hospitality of IST Austria within
the framework of the ISTernship Summer Program 2018, during which most of the present
article was written. N. DeNitti has received funding by The Austrian Agency for
International Cooperation in Education &Research (OeAD-GmbH) via its financial support
of the ISTernship Summer Program 2018. N.De Nitti would also like to thank Giuseppe
Coclite, Giuseppe Devillanova, Giuseppe Florio, Sebastian Hensel, and Francesco
Maddalena for several helpful conversations on topics related to this work.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nicola
full_name: De Nitti, Nicola
last_name: De Nitti
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
citation:
ama: De Nitti N, Fischer JL. Sharp criteria for the waiting time phenomenon in solutions
to the thin-film equation. Communications in Partial Differential Equations.
2022;47(7):1394-1434. doi:10.1080/03605302.2022.2056702
apa: De Nitti, N., & Fischer, J. L. (2022). Sharp criteria for the waiting time
phenomenon in solutions to the thin-film equation. Communications in Partial
Differential Equations. Taylor & Francis. https://doi.org/10.1080/03605302.2022.2056702
chicago: De Nitti, Nicola, and Julian L Fischer. “Sharp Criteria for the Waiting
Time Phenomenon in Solutions to the Thin-Film Equation.” Communications in
Partial Differential Equations. Taylor & Francis, 2022. https://doi.org/10.1080/03605302.2022.2056702.
ieee: N. De Nitti and J. L. Fischer, “Sharp criteria for the waiting time phenomenon
in solutions to the thin-film equation,” Communications in Partial Differential
Equations, vol. 47, no. 7. Taylor & Francis, pp. 1394–1434, 2022.
ista: De Nitti N, Fischer JL. 2022. Sharp criteria for the waiting time phenomenon
in solutions to the thin-film equation. Communications in Partial Differential
Equations. 47(7), 1394–1434.
mla: De Nitti, Nicola, and Julian L. Fischer. “Sharp Criteria for the Waiting Time
Phenomenon in Solutions to the Thin-Film Equation.” Communications in Partial
Differential Equations, vol. 47, no. 7, Taylor & Francis, 2022, pp. 1394–434,
doi:10.1080/03605302.2022.2056702.
short: N. De Nitti, J.L. Fischer, Communications in Partial Differential Equations
47 (2022) 1394–1434.
corr_author: '1'
date_created: 2023-01-16T10:06:50Z
date_published: 2022-07-01T00:00:00Z
date_updated: 2024-10-09T21:03:57Z
day: '01'
department:
- _id: JuFi
doi: 10.1080/03605302.2022.2056702
external_id:
arxiv:
- '1907.05342'
isi:
- '000805689800001'
intvolume: ' 47'
isi: 1
issue: '7'
keyword:
- Applied Mathematics
- Analysis
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1907.05342'
month: '07'
oa: 1
oa_version: Preprint
page: 1394-1434
publication: Communications in Partial Differential Equations
publication_identifier:
eissn:
- 1532-4133
issn:
- 0360-5302
publication_status: published
publisher: Taylor & Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sharp criteria for the waiting time phenomenon in solutions to the thin-film
equation
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 47
year: '2022'
...
---
_id: '12305'
abstract:
- lang: eng
text: This paper is concerned with the sharp interface limit for the Allen--Cahn
equation with a nonlinear Robin boundary condition in a bounded smooth domain
Ω⊂\R2. We assume that a diffuse interface already has developed and that it is
in contact with the boundary ∂Ω. The boundary condition is designed in such a
way that the limit problem is given by the mean curvature flow with constant α-contact
angle. For α close to 90° we prove a local in time convergence result for well-prepared
initial data for times when a smooth solution to the limit problem exists. Based
on the latter we construct a suitable curvilinear coordinate system and carry
out a rigorous asymptotic expansion for the Allen--Cahn equation with the nonlinear
Robin boundary condition. Moreover, we show a spectral estimate for the corresponding
linearized Allen--Cahn operator and with its aid we derive strong norm estimates
for the difference of the exact and approximate solutions using a Gronwall-type
argument.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Helmut
full_name: Abels, Helmut
last_name: Abels
- first_name: Maximilian
full_name: Moser, Maximilian
id: a60047a9-da77-11eb-85b4-c4dc385ebb8c
last_name: Moser
citation:
ama: Abels H, Moser M. Convergence of the Allen--Cahn equation with a nonlinear
Robin boundary condition to mean curvature flow with contact angle close to 90°.
SIAM Journal on Mathematical Analysis. 2022;54(1):114-172. doi:10.1137/21m1424925
apa: Abels, H., & Moser, M. (2022). Convergence of the Allen--Cahn equation
with a nonlinear Robin boundary condition to mean curvature flow with contact
angle close to 90°. SIAM Journal on Mathematical Analysis. Society for
Industrial and Applied Mathematics. https://doi.org/10.1137/21m1424925
chicago: Abels, Helmut, and Maximilian Moser. “Convergence of the Allen--Cahn Equation
with a Nonlinear Robin Boundary Condition to Mean Curvature Flow with Contact
Angle Close to 90°.” SIAM Journal on Mathematical Analysis. Society for
Industrial and Applied Mathematics, 2022. https://doi.org/10.1137/21m1424925.
ieee: H. Abels and M. Moser, “Convergence of the Allen--Cahn equation with a nonlinear
Robin boundary condition to mean curvature flow with contact angle close to 90°,”
SIAM Journal on Mathematical Analysis, vol. 54, no. 1. Society for Industrial
and Applied Mathematics, pp. 114–172, 2022.
ista: Abels H, Moser M. 2022. Convergence of the Allen--Cahn equation with a nonlinear
Robin boundary condition to mean curvature flow with contact angle close to 90°.
SIAM Journal on Mathematical Analysis. 54(1), 114–172.
mla: Abels, Helmut, and Maximilian Moser. “Convergence of the Allen--Cahn Equation
with a Nonlinear Robin Boundary Condition to Mean Curvature Flow with Contact
Angle Close to 90°.” SIAM Journal on Mathematical Analysis, vol. 54, no.
1, Society for Industrial and Applied Mathematics, 2022, pp. 114–72, doi:10.1137/21m1424925.
short: H. Abels, M. Moser, SIAM Journal on Mathematical Analysis 54 (2022) 114–172.
corr_author: '1'
date_created: 2023-01-16T10:07:00Z
date_published: 2022-01-04T00:00:00Z
date_updated: 2024-10-09T21:03:58Z
day: '04'
department:
- _id: JuFi
doi: 10.1137/21m1424925
external_id:
arxiv:
- '2105.08434'
isi:
- '000762768000004'
intvolume: ' 54'
isi: 1
issue: '1'
keyword:
- Applied Mathematics
- Computational Mathematics
- Analysis
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2105.08434'
month: '01'
oa: 1
oa_version: Preprint
page: 114-172
publication: SIAM Journal on Mathematical Analysis
publication_identifier:
eissn:
- 1095-7154
issn:
- 0036-1410
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition
to mean curvature flow with contact angle close to 90°
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 54
year: '2022'
...
---
_id: '12307'
abstract:
- lang: eng
text: Point-set topology is among the most abstract branches of mathematics in that
it lacks tangible notions of distance, length, magnitude, order, and size. There
is no shape, no geometry, no algebra, and no direction. Everything we are used
to visualizing is gone. In the teaching and learning of mathematics, this can
present a conundrum. Yet, this very property makes point set topology perfect
for teaching and learning abstract mathematical concepts. It clears our minds
of preconceived intuitions and expectations and forces us to think in new and
creative ways. In this paper, we present guided investigations into topology through
questions and thinking strategies that open up fascinating problems. They are
intended for faculty who already teach or are thinking about teaching a class
in topology or abstract mathematical reasoning for undergraduates. They can be
used to build simple to challenging projects in topology, proofs, honors programs,
and research experiences.
article_processing_charge: No
article_type: original
author:
- first_name: Barbara A.
full_name: Shipman, Barbara A.
last_name: Shipman
- first_name: Elizabeth R
full_name: Stephenson, Elizabeth R
id: 2D04F932-F248-11E8-B48F-1D18A9856A87
last_name: Stephenson
orcid: 0000-0002-6862-208X
citation:
ama: Shipman BA, Stephenson ER. Tangible topology through the lens of limits. PRIMUS.
2022;32(5):593-609. doi:10.1080/10511970.2021.1872750
apa: Shipman, B. A., & Stephenson, E. R. (2022). Tangible topology through the
lens of limits. PRIMUS. Taylor & Francis. https://doi.org/10.1080/10511970.2021.1872750
chicago: Shipman, Barbara A., and Elizabeth R Stephenson. “Tangible Topology through
the Lens of Limits.” PRIMUS. Taylor & Francis, 2022. https://doi.org/10.1080/10511970.2021.1872750.
ieee: B. A. Shipman and E. R. Stephenson, “Tangible topology through the lens of
limits,” PRIMUS, vol. 32, no. 5. Taylor & Francis, pp. 593–609, 2022.
ista: Shipman BA, Stephenson ER. 2022. Tangible topology through the lens of limits.
PRIMUS. 32(5), 593–609.
mla: Shipman, Barbara A., and Elizabeth R. Stephenson. “Tangible Topology through
the Lens of Limits.” PRIMUS, vol. 32, no. 5, Taylor & Francis, 2022,
pp. 593–609, doi:10.1080/10511970.2021.1872750.
short: B.A. Shipman, E.R. Stephenson, PRIMUS 32 (2022) 593–609.
corr_author: '1'
date_created: 2023-01-16T10:07:21Z
date_published: 2022-05-28T00:00:00Z
date_updated: 2024-10-09T21:03:58Z
day: '28'
department:
- _id: HeEd
- _id: GradSch
doi: 10.1080/10511970.2021.1872750
intvolume: ' 32'
issue: '5'
keyword:
- Education
- General Mathematics
language:
- iso: eng
month: '05'
oa_version: None
page: 593-609
publication: PRIMUS
publication_identifier:
eissn:
- 1935-4053
issn:
- 1051-1970
publication_status: published
publisher: Taylor & Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tangible topology through the lens of limits
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2022'
...
---
_id: '12332'
abstract:
- lang: eng
text: Activity of sensory neurons is driven not only by external stimuli but also
by feedback signals from higher brain areas. Attention is one particularly important
internal signal whose presumed role is to modulate sensory representations such
that they only encode information currently relevant to the organism at minimal
cost. This hypothesis has, however, not yet been expressed in a normative computational
framework. Here, by building on normative principles of probabilistic inference
and efficient coding, we developed a model of dynamic population coding in the
visual cortex. By continuously adapting the sensory code to changing demands of
the perceptual observer, an attention-like modulation emerges. This modulation
can dramatically reduce the amount of neural activity without deteriorating the
accuracy of task-specific inferences. Our results suggest that a range of seemingly
disparate cortical phenomena such as intrinsic gain modulation, attention-related
tuning modulation, and response variability could be manifestations of the same
underlying principles, which combine efficient sensory coding with optimal probabilistic
inference in dynamic environments.
acknowledgement: "We thank Robbe Goris for generously providing figures from his work
and Ann M. Hermundstad for helpful discussions.\r\nGT & WM were supported by the
Austrian Science Fund Standalone Grant P 34015 \"Efficient Coding with Biophysical
Realism\" (https://pf.fwf.ac.at/) WM was additionally supported by the European
Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No. 754411 (https://ec.europa.eu/research/mariecurieactions/). The
funders had no role in study design, data collection and analysis, decision to publish,
or preparation of the manuscript."
article_processing_charge: No
article_type: original
author:
- first_name: Wiktor F
full_name: Mlynarski, Wiktor F
id: 358A453A-F248-11E8-B48F-1D18A9856A87
last_name: Mlynarski
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: '1'
citation:
ama: Mlynarski WF, Tkačik G. Efficient coding theory of dynamic attentional modulation.
PLoS Biology. 2022;20(12):e3001889. doi:10.1371/journal.pbio.3001889
apa: Mlynarski, W. F., & Tkačik, G. (2022). Efficient coding theory of dynamic
attentional modulation. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.3001889
chicago: Mlynarski, Wiktor F, and Gašper Tkačik. “Efficient Coding Theory of Dynamic
Attentional Modulation.” PLoS Biology. Public Library of Science, 2022.
https://doi.org/10.1371/journal.pbio.3001889.
ieee: W. F. Mlynarski and G. Tkačik, “Efficient coding theory of dynamic attentional
modulation,” PLoS Biology, vol. 20, no. 12. Public Library of Science,
p. e3001889, 2022.
ista: Mlynarski WF, Tkačik G. 2022. Efficient coding theory of dynamic attentional
modulation. PLoS Biology. 20(12), e3001889.
mla: Mlynarski, Wiktor F., and Gašper Tkačik. “Efficient Coding Theory of Dynamic
Attentional Modulation.” PLoS Biology, vol. 20, no. 12, Public Library
of Science, 2022, p. e3001889, doi:10.1371/journal.pbio.3001889.
short: W.F. Mlynarski, G. Tkačik, PLoS Biology 20 (2022) e3001889.
corr_author: '1'
date_created: 2023-01-22T23:00:55Z
date_published: 2022-12-21T00:00:00Z
date_updated: 2025-06-11T13:57:01Z
day: '21'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pbio.3001889
ec_funded: 1
external_id:
isi:
- '000925192000001'
pmid:
- '36542662'
file:
- access_level: open_access
checksum: 5d7f1111a87e5f2c1bf92f8886738894
content_type: application/pdf
creator: dernst
date_created: 2023-01-23T08:46:40Z
date_updated: 2023-01-23T08:46:40Z
file_id: '12337'
file_name: 2022_PloSBiology_Mlynarski.pdf
file_size: 4248838
relation: main_file
success: 1
file_date_updated: 2023-01-23T08:46:40Z
has_accepted_license: '1'
intvolume: ' 20'
isi: 1
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: e3001889
pmid: 1
project:
- _id: 626c45b5-2b32-11ec-9570-e509828c1ba6
grant_number: P34015
name: Efficient coding with biophysical realism
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: PLoS Biology
publication_identifier:
eissn:
- 1545-7885
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient coding theory of dynamic attentional modulation
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: 20
year: '2022'
...
---
_id: '12333'
abstract:
- lang: eng
text: Together, copy-number and point mutations form the basis for most evolutionary
novelty, through the process of gene duplication and divergence. While a plethora
of genomic data reveals the long-term fate of diverging coding sequences and their
cis-regulatory elements, little is known about the early dynamics around the duplication
event itself. In microorganisms, selection for increased gene expression often
drives the expansion of gene copy-number mutations, which serves as a crude adaptation,
prior to divergence through refining point mutations. Using a simple synthetic
genetic reporter system that can distinguish between copy-number and point mutations,
we study their early and transient adaptive dynamics in real time in Escherichia
coli. We find two qualitatively different routes of adaptation, depending on the
level of functional improvement needed. In conditions of high gene expression
demand, the two mutation types occur as a combination. However, under low gene
expression demand, copy-number and point mutations are mutually exclusive; here,
owing to their higher frequency, adaptation is dominated by copy-number mutations,
in a process we term amplification hindrance. Ultimately, due to high reversal
rates and pleiotropic cost, copy-number mutations may not only serve as a crude
and transient adaptation, but also constrain sequence divergence over evolutionary
time scales.
acknowledgement: "We are grateful to N Barton, F Kondrashov, M Lagator, M Pleska,
R Roemhild, D Siekhaus, and G\r\nTkacik for input on the manuscript and to K Tomasek
for help with flow cytometry."
article_number: e82240
article_processing_charge: No
article_type: original
author:
- first_name: Isabella
full_name: Tomanek, Isabella
id: 3981F020-F248-11E8-B48F-1D18A9856A87
last_name: Tomanek
orcid: 0000-0001-6197-363X
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Tomanek I, Guet CC. Adaptation dynamics between copynumber and point mutations.
eLife. 2022;11. doi:10.7554/ELIFE.82240
apa: Tomanek, I., & Guet, C. C. (2022). Adaptation dynamics between copynumber
and point mutations. ELife. eLife Sciences Publications. https://doi.org/10.7554/ELIFE.82240
chicago: Tomanek, Isabella, and Calin C Guet. “Adaptation Dynamics between Copynumber
and Point Mutations.” ELife. eLife Sciences Publications, 2022. https://doi.org/10.7554/ELIFE.82240.
ieee: I. Tomanek and C. C. Guet, “Adaptation dynamics between copynumber and point
mutations,” eLife, vol. 11. eLife Sciences Publications, 2022.
ista: Tomanek I, Guet CC. 2022. Adaptation dynamics between copynumber and point
mutations. eLife. 11, e82240.
mla: Tomanek, Isabella, and Calin C. Guet. “Adaptation Dynamics between Copynumber
and Point Mutations.” ELife, vol. 11, e82240, eLife Sciences Publications,
2022, doi:10.7554/ELIFE.82240.
short: I. Tomanek, C.C. Guet, ELife 11 (2022).
corr_author: '1'
date_created: 2023-01-22T23:00:55Z
date_published: 2022-12-22T00:00:00Z
date_updated: 2025-03-06T14:03:50Z
day: '22'
ddc:
- '570'
department:
- _id: CaGu
doi: 10.7554/ELIFE.82240
external_id:
isi:
- '000912674700001'
pmid:
- '36546673'
file:
- access_level: open_access
checksum: 9321fd5f06ff59d5e2d33daee84b3da1
content_type: application/pdf
creator: dernst
date_created: 2023-01-23T08:56:21Z
date_updated: 2023-01-23T08:56:21Z
file_id: '12338'
file_name: 2022_eLife_Tomanek.pdf
file_size: 8835954
relation: main_file
success: 1
file_date_updated: 2023-01-23T08:56:21Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
publication: eLife
publication_identifier:
eissn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://doi.org/10.5281/zenodo.6974122
record:
- id: '12339'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Adaptation dynamics between copynumber and point mutations
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: 11
year: '2022'
...
---
_id: '12339'
abstract:
- lang: eng
text: 'Copy-number and point mutations form the basis for most evolutionary novelty
through the process of gene duplication and divergence. While a plethora of genomic
sequence data reveals the long-term fate of diverging coding sequences and their
cis-regulatory elements, little is known about the early dynamics around the duplication
event itself. In microorganisms, selection for increased gene expression often
drives the expansion of gene copy-number mutations, which serves as a crude adaptation,
prior to divergence through refining point mutations. Using a simple synthetic
genetic system that allows us to distinguish copy-number and point mutations,
we study their early and transient adaptive dynamics in real-time in Escherichia
coli. We find two qualitatively different routes of adaptation depending on the
level of functional improvement selected for: In conditions of high gene expression
demand, the two types of mutations occur as a combination. Under low gene expression
demand, negative epistasis between the two types of mutations renders them mutually
exclusive. Thus, owing to their higher frequency, adaptation is dominated by copy-number
mutations. Ultimately, due to high rates of reversal and pleiotropic cost, copy-number
mutations may not only serve as a crude and transient adaptation but also constrain
sequence divergence over evolutionary time scales.'
article_processing_charge: No
author:
- first_name: Isabella
full_name: Tomanek, Isabella
id: 3981F020-F248-11E8-B48F-1D18A9856A87
last_name: Tomanek
orcid: 0000-0001-6197-363X
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Tomanek I, Guet CC. Flow cytometry YFP and CFP data and deep sequencing data
of populations evolving in galactose. 2022. doi:10.5061/dryad.rfj6q57ds
apa: Tomanek, I., & Guet, C. C. (2022). Flow cytometry YFP and CFP data and
deep sequencing data of populations evolving in galactose. Dryad. https://doi.org/10.5061/dryad.rfj6q57ds
chicago: Tomanek, Isabella, and Calin C Guet. “Flow Cytometry YFP and CFP Data and
Deep Sequencing Data of Populations Evolving in Galactose.” Dryad, 2022. https://doi.org/10.5061/dryad.rfj6q57ds.
ieee: I. Tomanek and C. C. Guet, “Flow cytometry YFP and CFP data and deep sequencing
data of populations evolving in galactose.” Dryad, 2022.
ista: Tomanek I, Guet CC. 2022. Flow cytometry YFP and CFP data and deep sequencing
data of populations evolving in galactose, Dryad, 10.5061/dryad.rfj6q57ds.
mla: Tomanek, Isabella, and Calin C. Guet. Flow Cytometry YFP and CFP Data and
Deep Sequencing Data of Populations Evolving in Galactose. Dryad, 2022, doi:10.5061/dryad.rfj6q57ds.
short: I. Tomanek, C.C. Guet, (2022).
corr_author: '1'
date_created: 2023-01-23T09:00:37Z
date_published: 2022-12-23T00:00:00Z
date_updated: 2025-03-06T14:03:50Z
day: '23'
ddc:
- '570'
department:
- _id: CaGu
doi: 10.5061/dryad.rfj6q57ds
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.rfj6q57ds
month: '12'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '12333'
relation: used_in_publication
status: public
status: public
title: Flow cytometry YFP and CFP data and deep sequencing data of populations evolving
in galactose
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12432'
abstract:
- lang: eng
text: "We present CertifyHAM, a deterministic algorithm that takes a graph G as
input and either finds a Hamilton cycle of G or outputs that such a cycle does
not exist. If G ∼ G(n, p) and p ≥\r\n100 log n/n then the expected running time
of CertifyHAM is O(n/p) which is best possible. This improves upon previous results
due to Gurevich and Shelah, Thomason and Alon, and\r\nKrivelevich, who proved
analogous results for p being constant, p ≥ 12n −1/3 and p ≥ 70n\r\n−1/2 respectively."
acknowledgement: "This project has received funding from the European Union’s Horizon
2020\r\nresearch and innovation programme under the Marie Skłodowska-Curie grant\r\nagreement
No 101034413"
article_processing_charge: No
author:
- first_name: Michael
full_name: Anastos, Michael
id: 0b2a4358-bb35-11ec-b7b9-e3279b593dbb
last_name: Anastos
citation:
ama: 'Anastos M. Solving the Hamilton cycle problem fast on average. In: 63rd
Annual IEEE Symposium on Foundations of Computer Science. Vol 2022-October.
Institute of Electrical and Electronics Engineers; 2022:919-930. doi:10.1109/FOCS54457.2022.00091'
apa: 'Anastos, M. (2022). Solving the Hamilton cycle problem fast on average. In
63rd Annual IEEE Symposium on Foundations of Computer Science (Vol. 2022–October,
pp. 919–930). Denver, CO, United States: Institute of Electrical and Electronics
Engineers. https://doi.org/10.1109/FOCS54457.2022.00091'
chicago: Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.”
In 63rd Annual IEEE Symposium on Foundations of Computer Science, 2022–October:919–30.
Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/FOCS54457.2022.00091.
ieee: M. Anastos, “Solving the Hamilton cycle problem fast on average,” in 63rd
Annual IEEE Symposium on Foundations of Computer Science, Denver, CO, United
States, 2022, vol. 2022–October, pp. 919–930.
ista: 'Anastos M. 2022. Solving the Hamilton cycle problem fast on average. 63rd
Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of
Computer Science vol. 2022–October, 919–930.'
mla: Anastos, Michael. “Solving the Hamilton Cycle Problem Fast on Average.” 63rd
Annual IEEE Symposium on Foundations of Computer Science, vol. 2022–October,
Institute of Electrical and Electronics Engineers, 2022, pp. 919–30, doi:10.1109/FOCS54457.2022.00091.
short: M. Anastos, in:, 63rd Annual IEEE Symposium on Foundations of Computer Science,
Institute of Electrical and Electronics Engineers, 2022, pp. 919–930.
conference:
end_date: 2022-11-03
location: Denver, CO, United States
name: 'FOCS: Foundations of Computer Science'
start_date: 2022-10-31
corr_author: '1'
date_created: 2023-01-29T23:00:59Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2025-07-10T11:50:26Z
day: '01'
department:
- _id: MaKw
doi: 10.1109/FOCS54457.2022.00091
ec_funded: 1
external_id:
isi:
- '000909382900084'
isi: 1
language:
- iso: eng
month: '12'
oa_version: None
page: 919-930
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 63rd Annual IEEE Symposium on Foundations of Computer Science
publication_identifier:
isbn:
- '9781665455190'
issn:
- 0272-5428
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Solving the Hamilton cycle problem fast on average
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2022-October
year: '2022'
...
---
_id: '12452'
abstract:
- lang: eng
text: Portrait viewpoint and illumination editing is an important problem with several
applications in VR/AR, movies, and photography. Comprehensive knowledge of geometry
and illumination is critical for obtaining photorealistic results. Current methods
are unable to explicitly model in 3D while handing both viewpoint and illumination
editing from a single image. In this paper, we propose VoRF, a novel approach
that can take even a single portrait image as input and relight human heads under
novel illuminations that can be viewed from arbitrary viewpoints. VoRF represents
a human head as a continuous volumetric field and learns a prior model of human
heads using a coordinate-based MLP with separate latent spaces for identity and
illumination. The prior model is learnt in an auto-decoder manner over a diverse
class of head shapes and appearances, allowing VoRF to generalize to novel test
identities from a single input image. Additionally, VoRF has a reflectance MLP
that uses the intermediate features of the prior model for rendering One-Light-at-A-Time
(OLAT) images under novel views. We synthesize novel illuminations by combining
these OLAT images with target environment maps. Qualitative and quantitative evaluations
demonstrate the effectiveness of VoRF for relighting and novel view synthesis
even when applied to unseen subjects under uncontrolled illuminations.
acknowledgement: This work was supported by the ERC Consolidator Grant 4DReply (770784).
article_number: '708'
article_processing_charge: No
author:
- first_name: Pramod
full_name: Rao, Pramod
last_name: Rao
- first_name: Mallikarjun
full_name: B R, Mallikarjun
last_name: B R
- first_name: Gereon
full_name: Fox, Gereon
last_name: Fox
- first_name: Tim
full_name: Weyrich, Tim
last_name: Weyrich
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Hans-Peter
full_name: Seidel, Hans-Peter
last_name: Seidel
- first_name: Hanspeter
full_name: Pfister, Hanspeter
last_name: Pfister
- first_name: Wojciech
full_name: Matusik, Wojciech
last_name: Matusik
- first_name: Ayush
full_name: Tewari, Ayush
last_name: Tewari
- first_name: Christian
full_name: Theobalt, Christian
last_name: Theobalt
- first_name: Mohamed
full_name: Elgharib, Mohamed
last_name: Elgharib
citation:
ama: 'Rao P, B R M, Fox G, et al. VoRF: Volumetric Relightable Faces. In: 33rd
British Machine Vision Conference. British Machine Vision Association and
Society for Pattern Recognition; 2022.'
apa: 'Rao, P., B R, M., Fox, G., Weyrich, T., Bickel, B., Seidel, H.-P., … Elgharib,
M. (2022). VoRF: Volumetric Relightable Faces. In 33rd British Machine Vision
Conference. London, United Kingdom: British Machine Vision Association and
Society for Pattern Recognition.'
chicago: 'Rao, Pramod, Mallikarjun B R, Gereon Fox, Tim Weyrich, Bernd Bickel, Hans-Peter
Seidel, Hanspeter Pfister, et al. “VoRF: Volumetric Relightable Faces.” In 33rd
British Machine Vision Conference. British Machine Vision Association and
Society for Pattern Recognition, 2022.'
ieee: 'P. Rao et al., “VoRF: Volumetric Relightable Faces,” in 33rd British
Machine Vision Conference, London, United Kingdom, 2022.'
ista: 'Rao P, B R M, Fox G, Weyrich T, Bickel B, Seidel H-P, Pfister H, Matusik
W, Tewari A, Theobalt C, Elgharib M. 2022. VoRF: Volumetric Relightable Faces.
33rd British Machine Vision Conference. BMVC: British Machine Vision Conference,
708.'
mla: 'Rao, Pramod, et al. “VoRF: Volumetric Relightable Faces.” 33rd British
Machine Vision Conference, 708, British Machine Vision Association and Society
for Pattern Recognition, 2022.'
short: P. Rao, M. B R, G. Fox, T. Weyrich, B. Bickel, H.-P. Seidel, H. Pfister,
W. Matusik, A. Tewari, C. Theobalt, M. Elgharib, in:, 33rd British Machine Vision
Conference, British Machine Vision Association and Society for Pattern Recognition,
2022.
conference:
end_date: 2022-11-24
location: London, United Kingdom
name: 'BMVC: British Machine Vision Conference'
start_date: 2022-11-21
date_created: 2023-01-30T10:47:06Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2023-10-31T08:40:55Z
day: '01'
ddc:
- '000'
department:
- _id: BeBi
file:
- access_level: open_access
checksum: b60b70bb48700aee709c85a69231821d
content_type: application/pdf
creator: bbickel
date_created: 2023-01-30T10:48:18Z
date_updated: 2023-01-30T10:48:18Z
file_id: '12453'
file_name: vorf_main.pdf
file_size: 5202710
relation: main_file
title: 'VoRF: Volumetric Relightable Faces'
- access_level: open_access
checksum: ce5f4ce66eaaa1590ee5df989fca6f61
content_type: application/pdf
creator: bbickel
date_created: 2023-01-30T10:48:29Z
date_updated: 2023-01-30T10:48:29Z
file_id: '12454'
file_name: vorf_supp.pdf
file_size: 37953188
relation: supplementary_material
title: 'VoRF: Volumetric Relightable Faces – SUPPLEMENTAL MATERIAL –'
- access_level: open_access
checksum: 08aecca434b08fee75ee1efe87943718
content_type: video/mp4
creator: bbickel
date_created: 2023-01-30T10:48:37Z
date_updated: 2023-01-30T10:48:37Z
file_id: '12455'
file_name: video.mp4
file_size: 57855492
relation: supplementary_material
file_date_updated: 2023-01-30T10:48:37Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://bmvc2022.mpi-inf.mpg.de/708/
month: '12'
oa: 1
oa_version: Published Version
publication: 33rd British Machine Vision Conference
publication_status: published
publisher: British Machine Vision Association and Society for Pattern Recognition
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'VoRF: Volumetric Relightable Faces'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12480'
abstract:
- lang: eng
text: 'We consider the problem of estimating a signal from measurements obtained
via a generalized linear model. We focus on estimators based on approximate message
passing (AMP), a family of iterative algorithms with many appealing features:
the performance of AMP in the high-dimensional limit can be succinctly characterized
under suitable model assumptions; AMP can also be tailored to the empirical distribution
of the signal entries, and for a wide class of estimation problems, AMP is conjectured
to be optimal among all polynomial-time algorithms. However, a major issue of
AMP is that in many models (such as phase retrieval), it requires an initialization
correlated with the ground-truth signal and independent from the measurement matrix.
Assuming that such an initialization is available is typically not realistic.
In this paper, we solve this problem by proposing an AMP algorithm initialized
with a spectral estimator. With such an initialization, the standard AMP analysis
fails since the spectral estimator depends in a complicated way on the design
matrix. Our main contribution is a rigorous characterization of the performance
of AMP with spectral initialization in the high-dimensional limit. The key technical
idea is to define and analyze a two-phase artificial AMP algorithm that first
produces the spectral estimator, and then closely approximates the iterates of
the true AMP. We also provide numerical results that demonstrate the validity
of the proposed approach.'
acknowledgement: "The authors would like to thank Andrea Montanari for helpful discussions.\r\nM
Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R Venkataramanan
was partially supported by the Alan Turing Institute under the EPSRC Grant\r\nEP/N510129/1."
article_number: '114003'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Ramji
full_name: Venkataramanan, Ramji
last_name: Venkataramanan
citation:
ama: 'Mondelli M, Venkataramanan R. Approximate message passing with spectral initialization
for generalized linear models. Journal of Statistical Mechanics: Theory and
Experiment. 2022;2022(11). doi:10.1088/1742-5468/ac9828'
apa: 'Mondelli, M., & Venkataramanan, R. (2022). Approximate message passing
with spectral initialization for generalized linear models. Journal of Statistical
Mechanics: Theory and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/ac9828'
chicago: 'Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing
with Spectral Initialization for Generalized Linear Models.” Journal of Statistical
Mechanics: Theory and Experiment. IOP Publishing, 2022. https://doi.org/10.1088/1742-5468/ac9828.'
ieee: 'M. Mondelli and R. Venkataramanan, “Approximate message passing with spectral
initialization for generalized linear models,” Journal of Statistical Mechanics:
Theory and Experiment, vol. 2022, no. 11. IOP Publishing, 2022.'
ista: 'Mondelli M, Venkataramanan R. 2022. Approximate message passing with spectral
initialization for generalized linear models. Journal of Statistical Mechanics:
Theory and Experiment. 2022(11), 114003.'
mla: 'Mondelli, Marco, and Ramji Venkataramanan. “Approximate Message Passing with
Spectral Initialization for Generalized Linear Models.” Journal of Statistical
Mechanics: Theory and Experiment, vol. 2022, no. 11, 114003, IOP Publishing,
2022, doi:10.1088/1742-5468/ac9828.'
short: 'M. Mondelli, R. Venkataramanan, Journal of Statistical Mechanics: Theory
and Experiment 2022 (2022).'
corr_author: '1'
date_created: 2023-02-02T08:31:57Z
date_published: 2022-11-24T00:00:00Z
date_updated: 2025-04-15T07:50:16Z
day: '24'
ddc:
- '510'
- '530'
department:
- _id: MaMo
doi: 10.1088/1742-5468/ac9828
external_id:
isi:
- '000889589900001'
file:
- access_level: open_access
checksum: 01411ffa76d3e380a0446baeb89b1ef7
content_type: application/pdf
creator: dernst
date_created: 2023-02-02T08:35:52Z
date_updated: 2023-02-02T08:35:52Z
file_id: '12481'
file_name: 2022_JourStatisticalMechanics_Mondelli.pdf
file_size: 1729997
relation: main_file
success: 1
file_date_updated: 2023-02-02T08:35:52Z
has_accepted_license: '1'
intvolume: ' 2022'
isi: 1
issue: '11'
keyword:
- Statistics
- Probability and Uncertainty
- Statistics and Probability
- Statistical and Nonlinear Physics
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 'Journal of Statistical Mechanics: Theory and Experiment'
publication_identifier:
issn:
- 1742-5468
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
related_material:
record:
- id: '10598'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Approximate message passing with spectral initialization for generalized linear
models
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: 2022
year: '2022'
...
---
_id: '12495'
abstract:
- lang: eng
text: "Fairness-aware learning aims at constructing classifiers that not only make
accurate predictions, but also do not discriminate against specific groups. It
is a fast-growing area of\r\nmachine learning with far-reaching societal impact.
However, existing fair learning methods\r\nare vulnerable to accidental or malicious
artifacts in the training data, which can cause\r\nthem to unknowingly produce
unfair classifiers. In this work we address the problem of\r\nfair learning from
unreliable training data in the robust multisource setting, where the\r\navailable
training data comes from multiple sources, a fraction of which might not be representative
of the true data distribution. We introduce FLEA, a filtering-based algorithm\r\nthat
identifies and suppresses those data sources that would have a negative impact
on\r\nfairness or accuracy if they were used for training. As such, FLEA is not
a replacement of\r\nprior fairness-aware learning methods but rather an augmentation
that makes any of them\r\nrobust against unreliable training data. We show the
effectiveness of our approach by a\r\ndiverse range of experiments on multiple
datasets. Additionally, we prove formally that\r\n–given enough data– FLEA protects
the learner against corruptions as long as the fraction of\r\naffected data sources
is less than half. Our source code and documentation are available at\r\nhttps://github.com/ISTAustria-CVML/FLEA."
acknowledged_ssus:
- _id: ScienComp
acknowledgement: 'The authors would like to thank Bernd Prach, Elias Frantar, Alexandra
Peste, Mahdi Nikdan, and Peter Súkeník for their helpful feedback. This research
was supported by the Scientific Service Units (SSU) of IST Austria through resources
provided by Scientific Computing (SciComp). This publication was made possible by
an ETH AI Center postdoctoral fellowship granted to Nikola Konstantinov. Eugenia
Iofinova was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. '
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Eugenia B
full_name: Iofinova, Eugenia B
id: f9a17499-f6e0-11ea-865d-fdf9a3f77117
last_name: Iofinova
orcid: 0000-0002-7778-3221
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
orcid: 0009-0009-5204-7621
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Iofinova EB, Konstantinov NH, Lampert C. FLEA: Provably robust fair multisource
learning from unreliable training data. Transactions on Machine Learning Research.
2022.'
apa: 'Iofinova, E. B., Konstantinov, N. H., & Lampert, C. (2022). FLEA: Provably
robust fair multisource learning from unreliable training data. Transactions
on Machine Learning Research. ML Research Press.'
chicago: 'Iofinova, Eugenia B, Nikola H Konstantinov, and Christoph Lampert. “FLEA:
Provably Robust Fair Multisource Learning from Unreliable Training Data.” Transactions
on Machine Learning Research. ML Research Press, 2022.'
ieee: 'E. B. Iofinova, N. H. Konstantinov, and C. Lampert, “FLEA: Provably robust
fair multisource learning from unreliable training data,” Transactions on Machine
Learning Research. ML Research Press, 2022.'
ista: 'Iofinova EB, Konstantinov NH, Lampert C. 2022. FLEA: Provably robust fair
multisource learning from unreliable training data. Transactions on Machine Learning
Research.'
mla: 'Iofinova, Eugenia B., et al. “FLEA: Provably Robust Fair Multisource Learning
from Unreliable Training Data.” Transactions on Machine Learning Research,
ML Research Press, 2022.'
short: E.B. Iofinova, N.H. Konstantinov, C. Lampert, Transactions on Machine Learning
Research (2022).
corr_author: '1'
date_created: 2023-02-02T20:29:57Z
date_published: 2022-12-22T00:00:00Z
date_updated: 2025-12-30T11:04:31Z
day: '22'
ddc:
- '000'
department:
- _id: ChLa
external_id:
arxiv:
- '2106.11732'
file:
- access_level: open_access
checksum: 97c8a8470759cab597abb973ca137a3b
content_type: application/pdf
creator: dernst
date_created: 2023-02-23T10:30:04Z
date_updated: 2023-02-23T10:30:04Z
file_id: '12673'
file_name: 2022_TMLR_Iofinova.pdf
file_size: 1948063
relation: main_file
success: 1
file_date_updated: 2023-02-23T10:30:04Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/forum?id=XsPopigZXV
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A
grant_number: W1260-N35
name: Vienna Graduate School on Computational Optimization
publication: Transactions on Machine Learning Research
publication_identifier:
issn:
- 2835-8856
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
link:
- description: source code
relation: software
url: https://github.com/ISTAustria-CVML/FLEA
status: public
title: 'FLEA: Provably robust fair multisource learning from unreliable training data'
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
year: '2022'
...
---
_id: '12508'
abstract:
- lang: eng
text: "We explore the notion of history-determinism in the context of timed automata
(TA). History-deterministic automata are those in which nondeterminism can be
resolved on the fly, based on the run constructed thus far. History-determinism
is a robust property that admits different game-based characterisations, and history-deterministic
specifications allow for game-based verification without an expensive determinization
step.\r\nWe show yet another characterisation of history-determinism in terms
of fair simulation, at the general level of labelled transition systems: a system
is history-deterministic precisely if and only if it fairly simulates all language
smaller systems.\r\nFor timed automata over infinite timed words it is known that
universality is undecidable for Büchi TA. We show that for history-deterministic
TA with arbitrary parity acceptance, timed universality, inclusion, and synthesis
all remain decidable and are ExpTime-complete.\r\nFor the subclass of TA with
safety or reachability acceptance, we show that checking whether such an automaton
is history-deterministic is decidable (in ExpTime), and history-deterministic
TA with safety acceptance are effectively determinizable without introducing new
automata states."
acknowledgement: "Thomas A. Henzinger: This work was supported in part by the ERC-2020-AdG
101020093.\r\nPatrick Totzke: acknowledges support from the EPSRC, project no. EP/V025848/1.\r\n"
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Karoliina
full_name: Lehtinen, Karoliina
last_name: Lehtinen
- first_name: Patrick
full_name: Totzke, Patrick
last_name: Totzke
citation:
ama: 'Henzinger TA, Lehtinen K, Totzke P. History-deterministic timed automata.
In: 33rd International Conference on Concurrency Theory. Vol 243. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2022:14:1-14:21. doi:10.4230/LIPIcs.CONCUR.2022.14'
apa: 'Henzinger, T. A., Lehtinen, K., & Totzke, P. (2022). History-deterministic
timed automata. In 33rd International Conference on Concurrency Theory
(Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14'
chicago: Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic
Timed Automata.” In 33rd International Conference on Concurrency Theory,
243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14.
ieee: T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed
automata,” in 33rd International Conference on Concurrency Theory, Warsaw,
Poland, 2022, vol. 243, p. 14:1-14:21.
ista: 'Henzinger TA, Lehtinen K, Totzke P. 2022. History-deterministic timed automata.
33rd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency
Theory, LIPIcs, vol. 243, 14:1-14:21.'
mla: Henzinger, Thomas A., et al. “History-Deterministic Timed Automata.” 33rd
International Conference on Concurrency Theory, vol. 243, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21, doi:10.4230/LIPIcs.CONCUR.2022.14.
short: T.A. Henzinger, K. Lehtinen, P. Totzke, in:, 33rd International Conference
on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022,
p. 14:1-14:21.
conference:
end_date: 2022-09-16
location: Warsaw, Poland
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2022-09-13
corr_author: '1'
date_created: 2023-02-05T17:24:23Z
date_published: 2022-09-06T00:00:00Z
date_updated: 2025-09-08T14:35:16Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2022.14
ec_funded: 1
file:
- access_level: open_access
checksum: 9e97e15628f66b2ad77f535bb0327dee
content_type: application/pdf
creator: dernst
date_created: 2023-02-06T09:21:09Z
date_updated: 2023-02-06T09:21:09Z
file_id: '12520'
file_name: 2022_LIPICs_Henzinger2.pdf
file_size: 717940
relation: main_file
success: 1
file_date_updated: 2023-02-06T09:21:09Z
has_accepted_license: '1'
intvolume: ' 243'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 14:1-14:21
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 33rd International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959772464'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '18530'
relation: later_version
status: public
scopus_import: '1'
status: public
title: History-deterministic timed automata
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 243
year: '2022'
...
---
_id: '12509'
abstract:
- lang: eng
text: A graph game is a two-player zero-sum game in which the players move a token
throughout a graph to produce an infinite path, which determines the winner or
payoff of the game. In bidding games, both players have budgets, and in each turn,
we hold an "auction" (bidding) to determine which player moves the token. In this
survey, we consider several bidding mechanisms and their effect on the properties
of the game. Specifically, bidding games, and in particular bidding games of infinite
duration, have an intriguing equivalence with random-turn games in which in each
turn, the player who moves is chosen randomly. We summarize how minor changes
in the bidding mechanism lead to unexpected differences in the equivalence with
random-turn games.
acknowledgement: "Guy Avni: Work partially supported by the Israel Science Foundation,
ISF grant agreement\r\nno 1679/21.\r\nThomas A. Henzinger: This work was supported
in part by the ERC-2020-AdG 101020093.\r\nWe would like to thank all our collaborators
Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný,
Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful
for you as it was for us."
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: 47th
International Symposium on Mathematical Foundations of Computer Science. Vol
241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:10.4230/LIPIcs.MFCS.2022.3'
apa: 'Avni, G., & Henzinger, T. A. (2022). An updated survey of bidding games
on graphs. In 47th International Symposium on Mathematical Foundations of Computer
Science (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2022.3'
chicago: 'Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games
on Graphs.” In 47th International Symposium on Mathematical Foundations of
Computer Science, 241:3:1-3:6. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022. https://doi.org/10.4230/LIPIcs.MFCS.2022.3.'
ieee: G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,”
in 47th International Symposium on Mathematical Foundations of Computer Science,
Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.
ista: 'Avni G, Henzinger TA. 2022. An updated survey of bidding games on graphs.
47th International Symposium on Mathematical Foundations of Computer Science.
MFCS: Mathematical Foundations of Computer ScienceLeibniz International Proceedings
in Informatics (LIPIcs) vol. 241, 3:1-3:6.'
mla: Avni, Guy, and Thomas A. Henzinger. “An Updated Survey of Bidding Games on
Graphs.” 47th International Symposium on Mathematical Foundations of Computer
Science, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022,
p. 3:1-3:6, doi:10.4230/LIPIcs.MFCS.2022.3.
short: G. Avni, T.A. Henzinger, in:, 47th International Symposium on Mathematical
Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
Dagstuhl, Germany, 2022, p. 3:1-3:6.
conference:
end_date: 2022-08-26
location: Vienna, Austria
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2022-08-22
corr_author: '1'
date_created: 2023-02-05T17:26:01Z
date_published: 2022-08-22T00:00:00Z
date_updated: 2025-07-10T11:50:27Z
day: '22'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.MFCS.2022.3
ec_funded: 1
file:
- access_level: open_access
checksum: 1888ec9421622f9526fbec2de035f132
content_type: application/pdf
creator: dernst
date_created: 2023-02-06T09:13:04Z
date_updated: 2023-02-06T09:13:04Z
file_id: '12519'
file_name: 2022_LIPICs_Avni.pdf
file_size: 624586
relation: main_file
success: 1
file_date_updated: 2023-02-06T09:13:04Z
has_accepted_license: '1'
intvolume: ' 241'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 3:1-3:6
place: Dagstuhl, Germany
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 47th International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- '9783959772563'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: An updated survey of bidding games on graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 241
year: '2022'
...
---
_id: '12510'
abstract:
- lang: eng
text: "We introduce a new statistical verification algorithm that formally quantifies
the behavioral robustness of any time-continuous process formulated as a continuous-depth
model. Our algorithm solves a set of global optimization (Go) problems over a
given time horizon to construct a tight enclosure (Tube) of the set of all process
executions starting from a ball of initial states. We call our algorithm GoTube.
Through its construction, GoTube ensures that the bounding tube is conservative
up to a desired probability and up to a desired tightness.\r\n GoTube is implemented
in JAX and optimized to scale to complex continuous-depth neural network models.
Compared to advanced reachability analysis tools for time-continuous neural networks,
GoTube does not accumulate overapproximation errors between time steps and avoids
the infamous wrapping effect inherent in symbolic techniques. We show that GoTube
substantially outperforms state-of-the-art verification tools in terms of the
size of the initial ball, speed, time-horizon, task completion, and scalability
on a large set of experiments.\r\n GoTube is stable and sets the state-of-the-art
in terms of its ability to scale to time horizons well beyond what has been previously
possible."
acknowledgement: SG is funded by the Austrian Science Fund (FWF) project number W1255-N23.
ML and TH are supported in part by FWF under grant Z211-N23 (Wittgenstein Award)
and the ERC-2020-AdG 101020093. SS is supported by NSF awards DCL-2040599, CCF-1918225,
and CPS-1446832. RH and DR are partially supported by Boeing. RG is partially supported
by Horizon-2020 ECSEL Project grant No. 783163 (iDev40).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sophie A.
full_name: Gruenbacher, Sophie A.
last_name: Gruenbacher
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- 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: Scott A.
full_name: Smolka, Scott A.
last_name: Smolka
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Gruenbacher SA, Lechner M, Hasani R, et al. GoTube: Scalable statistical verification
of continuous-depth models. Proceedings of the AAAI Conference on Artificial
Intelligence. 2022;36(6):6755-6764. doi:10.1609/aaai.v36i6.20631'
apa: 'Gruenbacher, S. A., Lechner, M., Hasani, R., Rus, D., Henzinger, T. A., Smolka,
S. A., & Grosu, R. (2022). GoTube: Scalable statistical verification of continuous-depth
models. Proceedings of the AAAI Conference on Artificial Intelligence.
Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i6.20631'
chicago: 'Gruenbacher, Sophie A., Mathias Lechner, Ramin Hasani, Daniela Rus, Thomas
A Henzinger, Scott A. Smolka, and Radu Grosu. “GoTube: Scalable Statistical Verification
of Continuous-Depth Models.” Proceedings of the AAAI Conference on Artificial
Intelligence. Association for the Advancement of Artificial Intelligence,
2022. https://doi.org/10.1609/aaai.v36i6.20631.'
ieee: 'S. A. Gruenbacher et al., “GoTube: Scalable statistical verification
of continuous-depth models,” Proceedings of the AAAI Conference on Artificial
Intelligence, vol. 36, no. 6. Association for the Advancement of Artificial
Intelligence, pp. 6755–6764, 2022.'
ista: 'Gruenbacher SA, Lechner M, Hasani R, Rus D, Henzinger TA, Smolka SA, Grosu
R. 2022. GoTube: Scalable statistical verification of continuous-depth models.
Proceedings of the AAAI Conference on Artificial Intelligence. 36(6), 6755–6764.'
mla: 'Gruenbacher, Sophie A., et al. “GoTube: Scalable Statistical Verification
of Continuous-Depth Models.” Proceedings of the AAAI Conference on Artificial
Intelligence, vol. 36, no. 6, Association for the Advancement of Artificial
Intelligence, 2022, pp. 6755–64, doi:10.1609/aaai.v36i6.20631.'
short: S.A. Gruenbacher, M. Lechner, R. Hasani, D. Rus, T.A. Henzinger, S.A. Smolka,
R. Grosu, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022)
6755–6764.
date_created: 2023-02-05T17:27:42Z
date_published: 2022-06-28T00:00:00Z
date_updated: 2025-04-15T06:26:14Z
day: '28'
department:
- _id: ToHe
doi: 10.1609/aaai.v36i6.20631
ec_funded: 1
external_id:
arxiv:
- '2107.08467'
intvolume: ' 36'
issue: '6'
keyword:
- General Medicine
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2107.08467
month: '06'
oa: 1
oa_version: Preprint
page: 6755-6764
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- '978577358350'
issn:
- 2159-5399
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'GoTube: Scalable statistical verification of continuous-depth models'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2022'
...
---
_id: '12516'
abstract:
- lang: eng
text: "The homogeneous continuous LWE (hCLWE) problem is to distinguish samples
of a specific high-dimensional Gaussian mixture from standard normal samples.
It was shown to be at least as hard as Learning with Errors, but no reduction
in the other direction is currently known.\r\nWe present four new public-key encryption
schemes based on the hardness of hCLWE, with varying tradeoffs between decryption
and security errors, and different discretization techniques. Our schemes yield
a polynomial-time algorithm for solving hCLWE using a Statistical Zero-Knowledge
oracle."
acknowledgement: "We are grateful to Devika Sharma and Luca Trevisan for their insight
and advice and to an anonymous reviewer for helpful comments.\r\n\r\nThis work was
supported by the European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation programme (Grant agreement No. 101019547). The first
author was additionally supported by RGC GRF CUHK14209920 and the fourth author
was additionally supported by ISF grant No. 1399/17, project PROMETHEUS (Grant 780701),
and Cariplo CRYPTONOMEX grant."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Andrej
full_name: Bogdanov, Andrej
last_name: Bogdanov
- first_name: Miguel
full_name: Cueto Noval, Miguel
id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc
last_name: Cueto Noval
orcid: 0000-0002-2505-4246
- first_name: Charlotte
full_name: Hoffmann, Charlotte
id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7
last_name: Hoffmann
orcid: 0000-0003-2027-5549
- first_name: Alon
full_name: Rosen, Alon
last_name: Rosen
citation:
ama: 'Bogdanov A, Cueto Noval M, Hoffmann C, Rosen A. Public-Key Encryption from Homogeneous
CLWE. In: Theory of Cryptography. Vol 13748. Springer Nature; 2022:565-592.
doi:10.1007/978-3-031-22365-5_20'
apa: 'Bogdanov, A., Cueto Noval, M., Hoffmann, C., & Rosen, A. (2022). Public-Key
Encryption from Homogeneous CLWE. In Theory of Cryptography (Vol. 13748,
pp. 565–592). Chicago, IL, United States: Springer Nature. https://doi.org/10.1007/978-3-031-22365-5_20'
chicago: Bogdanov, Andrej, Miguel Cueto Noval, Charlotte Hoffmann, and Alon Rosen.
“Public-Key Encryption from Homogeneous CLWE.” In Theory of Cryptography,
13748:565–92. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-22365-5_20.
ieee: A. Bogdanov, M. Cueto Noval, C. Hoffmann, and A. Rosen, “Public-Key Encryption
from Homogeneous CLWE,” in Theory of Cryptography, Chicago, IL, United
States, 2022, vol. 13748, pp. 565–592.
ista: 'Bogdanov A, Cueto Noval M, Hoffmann C, Rosen A. 2022. Public-Key Encryption
from Homogeneous CLWE. Theory of Cryptography. TCC: Theory of Cryptography, LNCS,
vol. 13748, 565–592.'
mla: Bogdanov, Andrej, et al. “Public-Key Encryption from Homogeneous CLWE.” Theory
of Cryptography, vol. 13748, Springer Nature, 2022, pp. 565–92, doi:10.1007/978-3-031-22365-5_20.
short: A. Bogdanov, M. Cueto Noval, C. Hoffmann, A. Rosen, in:, Theory of Cryptography,
Springer Nature, 2022, pp. 565–592.
conference:
end_date: 2022-11-10
location: Chicago, IL, United States
name: 'TCC: Theory of Cryptography'
start_date: 2022-11-07
corr_author: '1'
date_created: 2023-02-05T23:01:00Z
date_published: 2022-12-21T00:00:00Z
date_updated: 2024-10-09T21:04:05Z
day: '21'
department:
- _id: KrPi
doi: 10.1007/978-3-031-22365-5_20
external_id:
isi:
- '000921318200020'
intvolume: ' 13748'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2022/093
month: '12'
oa: 1
oa_version: Preprint
page: 565-592
publication: Theory of Cryptography
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031223648'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Public-Key Encryption from Homogeneous CLWE
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13748
year: '2022'
...