---
_id: '10853'
abstract:
- lang: eng
text: Dynamic Connectivity is a fundamental algorithmic graph problem, motivated
by a wide range of applications to social and communication networks and used
as a building block in various other algorithms, such as the bi-connectivity and
the dynamic minimal spanning tree problems. In brief, we wish to maintain the
connected components of the graph under dynamic edge insertions and deletions.
In the sequential case, the problem has been well-studied from both theoretical
and practical perspectives. However, much less is known about efficient concurrent
solutions to this problem. This is the gap we address in this paper. We start
from one of the classic data structures used to solve this problem, the Euler
Tour Tree. Our first contribution is a non-blocking single-writer implementation
of it. We leverage this data structure to obtain the first truly concurrent generalization
of dynamic connectivity, which preserves the time complexity of its sequential
counterpart, but is also scalable in practice. To achieve this, we rely on three
main techniques. The first is to ensure that connectivity queries, which usually
dominate real-world workloads, are non-blocking. The second non-trivial technique
expands the above idea by making all queries that do not change the connectivity
structure non-blocking. The third ingredient is applying fine-grained locking
for updating the connected components, which allows operations on disjoint components
to occur in parallel. We evaluate the resulting algorithm on various workloads,
executing on both real and synthetic graphs. The results show the efficiency of
each of the proposed optimizations; the most efficient variant improves the performance
of a coarse-grained based implementation on realistic scenarios up to 6x on average
and up to 30x when connectivity queries dominate.
article_processing_charge: No
arxiv: 1
author:
- first_name: Alexander
full_name: Fedorov, Alexander
last_name: Fedorov
- first_name: Nikita
full_name: Koval, Nikita
last_name: Koval
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Fedorov A, Koval N, Alistarh D-A. A scalable concurrent algorithm for dynamic
connectivity. In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms
and Architectures. Association for Computing Machinery; 2021:208-220. doi:10.1145/3409964.3461810'
apa: 'Fedorov, A., Koval, N., & Alistarh, D.-A. (2021). A scalable concurrent
algorithm for dynamic connectivity. In Proceedings of the 33rd ACM Symposium
on Parallelism in Algorithms and Architectures (pp. 208–220). Virtual, Online:
Association for Computing Machinery. https://doi.org/10.1145/3409964.3461810'
chicago: Fedorov, Alexander, Nikita Koval, and Dan-Adrian Alistarh. “A Scalable
Concurrent Algorithm for Dynamic Connectivity.” In Proceedings of the 33rd
ACM Symposium on Parallelism in Algorithms and Architectures, 208–20. Association
for Computing Machinery, 2021. https://doi.org/10.1145/3409964.3461810.
ieee: A. Fedorov, N. Koval, and D.-A. Alistarh, “A scalable concurrent algorithm
for dynamic connectivity,” in Proceedings of the 33rd ACM Symposium on Parallelism
in Algorithms and Architectures, Virtual, Online, 2021, pp. 208–220.
ista: 'Fedorov A, Koval N, Alistarh D-A. 2021. A scalable concurrent algorithm for
dynamic connectivity. Proceedings of the 33rd ACM Symposium on Parallelism in
Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and
Architectures, 208–220.'
mla: Fedorov, Alexander, et al. “A Scalable Concurrent Algorithm for Dynamic Connectivity.”
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures,
Association for Computing Machinery, 2021, pp. 208–20, doi:10.1145/3409964.3461810.
short: A. Fedorov, N. Koval, D.-A. Alistarh, in:, Proceedings of the 33rd ACM Symposium
on Parallelism in Algorithms and Architectures, Association for Computing Machinery,
2021, pp. 208–220.
conference:
end_date: 2021-07-08
location: Virtual, Online
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2021-07-06
date_created: 2022-03-18T08:21:47Z
date_published: 2021-07-01T00:00:00Z
date_updated: 2022-03-18T08:45:46Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3409964.3461810
external_id:
arxiv:
- '2105.08098'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2105.08098
month: '07'
oa: 1
oa_version: Preprint
page: 208-220
publication: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450380706'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: A scalable concurrent algorithm for dynamic connectivity
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10854'
abstract:
- lang: eng
text: "Consider a distributed task where the communication network is fixed but
the local inputs given to the nodes of the distributed system may change over
time. In this work, we explore the following question: if some of the local inputs
change, can an existing solution be updated efficiently, in a dynamic and distributed
manner?\r\nTo address this question, we define the batch dynamic CONGEST model
in which we are given a bandwidth-limited communication network and a dynamic
edge labelling defines the problem input. The task is to maintain a solution to
a graph problem on the labelled graph under batch changes. We investigate, when
a batch of alpha edge label changes arrive, - how much time as a function of alpha
we need to update an existing solution, and - how much information the nodes have
to keep in local memory between batches in order to update the solution quickly.\r\nOur
work lays the foundations for the theory of input-dynamic distributed network
algorithms. We give a general picture of the complexity landscape in this model,
design both universal algorithms and algorithms for concrete problems, and present
a general framework for lower bounds. The diverse time complexity of our model
spans from constant time, through time polynomial in alpha, and to alpha time,
which we show to be enough for any task."
acknowledgement: We thank Jukka Suomela for discussions. We also thank our shepherd
Mohammad Hajiesmaili and the reviewers for their time and suggestions on how to
improve the paper. This project has received funding from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research
and innovation programme under the Marie Skłodowska–Curie grant agreement No. 840605,
from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024,
and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.
article_processing_charge: No
arxiv: 1
author:
- first_name: Klaus-Tycho
full_name: Foerster, Klaus-Tycho
last_name: Foerster
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Ami
full_name: Paz, Ami
last_name: Paz
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed
algorithms for communication networks. In: Abstract Proceedings of the 2021
ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer
Systems. Association for Computing Machinery; 2021:71-72. doi:10.1145/3410220.3453923'
apa: 'Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021).
Input-dynamic distributed algorithms for communication networks. In Abstract
Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement
and Modeling of Computer Systems (pp. 71–72). Virtual, Online: Association
for Computing Machinery. https://doi.org/10.1145/3410220.3453923'
chicago: Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan
Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” In
Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference
on Measurement and Modeling of Computer Systems, 71–72. Association for Computing
Machinery, 2021. https://doi.org/10.1145/3410220.3453923.
ieee: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic
distributed algorithms for communication networks,” in Abstract Proceedings
of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling
of Computer Systems, Virtual, Online, 2021, pp. 71–72.
ista: 'Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic
distributed algorithms for communication networks. Abstract Proceedings of the
2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of
Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling
of Computer Systems, 71–72.'
mla: Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication
Networks.” Abstract Proceedings of the 2021 ACM SIGMETRICS / International
Conference on Measurement and Modeling of Computer Systems, Association for
Computing Machinery, 2021, pp. 71–72, doi:10.1145/3410220.3453923.
short: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract
Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement
and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp.
71–72.
conference:
end_date: 2021-06-18
location: Virtual, Online
name: 'SIGMETRICS: International Conference on Measurement and Modeling of Computer
Systems'
start_date: 2021-06-14
date_created: 2022-03-18T08:48:41Z
date_published: 2021-05-01T00:00:00Z
date_updated: 2025-04-14T13:52:09Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3410220.3453923
ec_funded: 1
external_id:
arxiv:
- '2005.07637'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.07637
month: '05'
oa: 1
oa_version: Preprint
page: 71-72
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
- _id: 26A5D39A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '840605'
name: Coordination in constrained and natural distributed systems
publication: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference
on Measurement and Modeling of Computer Systems
publication_identifier:
isbn:
- '9781450380720'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '10855'
relation: extended_version
status: public
scopus_import: '1'
status: public
title: Input-dynamic distributed algorithms for communication networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10855'
abstract:
- lang: eng
text: 'Consider a distributed task where the communication network is fixed but
the local inputs given to the nodes of the distributed system may change over
time. In this work, we explore the following question: if some of the local inputs
change, can an existing solution be updated efficiently, in a dynamic and distributed
manner? To address this question, we define the batch dynamic \congest model in
which we are given a bandwidth-limited communication network and a dynamic edge
labelling defines the problem input. The task is to maintain a solution to a graph
problem on the labeled graph under batch changes. We investigate, when a batch
of α edge label changes arrive, \beginitemize \item how much time as a function
of α we need to update an existing solution, and \item how much information the
nodes have to keep in local memory between batches in order to update the solution
quickly. \enditemize Our work lays the foundations for the theory of input-dynamic
distributed network algorithms. We give a general picture of the complexity landscape
in this model, design both universal algorithms and algorithms for concrete problems,
and present a general framework for lower bounds. In particular, we derive non-trivial
upper bounds for two selected, contrasting problems: maintaining a minimum spanning
tree and detecting cliques.'
acknowledgement: "We thank Jukka Suomela for discussions. We also thank our shepherd
Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how
to improve the paper. This project\r\nhas received funding from the European Research
Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation
programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon
2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant
agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project
WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE
SCIENCE project P 33775-N."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Klaus-Tycho
full_name: Foerster, Klaus-Tycho
last_name: Foerster
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Ami
full_name: Paz, Ami
last_name: Paz
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed
algorithms for communication networks. Proceedings of the ACM on Measurement
and Analysis of Computing Systems. 2021;5(1):1-33. doi:10.1145/3447384
apa: Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021).
Input-dynamic distributed algorithms for communication networks. Proceedings
of the ACM on Measurement and Analysis of Computing Systems. Association for
Computing Machinery. https://doi.org/10.1145/3447384
chicago: Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan
Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” Proceedings
of the ACM on Measurement and Analysis of Computing Systems. Association for
Computing Machinery, 2021. https://doi.org/10.1145/3447384.
ieee: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic
distributed algorithms for communication networks,” Proceedings of the ACM
on Measurement and Analysis of Computing Systems, vol. 5, no. 1. Association
for Computing Machinery, pp. 1–33, 2021.
ista: Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic
distributed algorithms for communication networks. Proceedings of the ACM on Measurement
and Analysis of Computing Systems. 5(1), 1–33.
mla: Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication
Networks.” Proceedings of the ACM on Measurement and Analysis of Computing
Systems, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33,
doi:10.1145/3447384.
short: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of
the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.
date_created: 2022-03-18T09:10:27Z
date_published: 2021-03-01T00:00:00Z
date_updated: 2025-04-14T13:52:09Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3447384
ec_funded: 1
external_id:
arxiv:
- '2005.07637'
intvolume: ' 5'
issue: '1'
keyword:
- Computer Networks and Communications
- Hardware and Architecture
- Safety
- Risk
- Reliability and Quality
- Computer Science (miscellaneous)
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.07637
month: '03'
oa: 1
oa_version: Preprint
page: 1-33
project:
- _id: 26A5D39A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '840605'
name: Coordination in constrained and natural distributed systems
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the ACM on Measurement and Analysis of Computing Systems
publication_identifier:
issn:
- 2476-1249
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '10854'
relation: shorter_version
status: public
scopus_import: '1'
status: public
title: Input-dynamic distributed algorithms for communication networks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2021'
...
---
_id: '10856'
abstract:
- lang: eng
text: "We study the properties of the maximal volume k-dimensional sections of the
n-dimensional cube [−1, 1]n. We obtain a first order necessary condition for a
k-dimensional subspace to be a local maximizer of the volume of such sections,
which we formulate in a geometric way. We estimate the length of the projection
of a vector of the standard basis of Rn onto a k-dimensional subspace that maximizes
the volume of the intersection. We \x1Cnd the optimal upper bound on the volume
of a planar section of the cube [−1, 1]n , n ≥ 2."
acknowledgement: "The authors acknowledge the support of the grant of the Russian
Government N 075-15-\r\n2019-1926. G.I.was supported also by the SwissNational Science
Foundation grant 200021-179133. The authors are very grateful to the anonymous reviewer
for valuable remarks."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Grigory
full_name: Ivanov, Grigory
id: 87744F66-5C6F-11EA-AFE0-D16B3DDC885E
last_name: Ivanov
- first_name: Igor
full_name: Tsiutsiurupa, Igor
last_name: Tsiutsiurupa
citation:
ama: Ivanov G, Tsiutsiurupa I. On the volume of sections of the cube. Analysis
and Geometry in Metric Spaces. 2021;9(1):1-18. doi:10.1515/agms-2020-0103
apa: Ivanov, G., & Tsiutsiurupa, I. (2021). On the volume of sections of the
cube. Analysis and Geometry in Metric Spaces. De Gruyter. https://doi.org/10.1515/agms-2020-0103
chicago: Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the
Cube.” Analysis and Geometry in Metric Spaces. De Gruyter, 2021. https://doi.org/10.1515/agms-2020-0103.
ieee: G. Ivanov and I. Tsiutsiurupa, “On the volume of sections of the cube,” Analysis
and Geometry in Metric Spaces, vol. 9, no. 1. De Gruyter, pp. 1–18, 2021.
ista: Ivanov G, Tsiutsiurupa I. 2021. On the volume of sections of the cube. Analysis
and Geometry in Metric Spaces. 9(1), 1–18.
mla: Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.”
Analysis and Geometry in Metric Spaces, vol. 9, no. 1, De Gruyter, 2021,
pp. 1–18, doi:10.1515/agms-2020-0103.
short: G. Ivanov, I. Tsiutsiurupa, Analysis and Geometry in Metric Spaces 9 (2021)
1–18.
date_created: 2022-03-18T09:25:14Z
date_published: 2021-01-29T00:00:00Z
date_updated: 2023-08-17T07:07:58Z
day: '29'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1515/agms-2020-0103
external_id:
arxiv:
- '2004.02674'
isi:
- '000734286800001'
file:
- access_level: open_access
checksum: 7e615ac8489f5eae580b6517debfdc53
content_type: application/pdf
creator: dernst
date_created: 2022-03-18T09:31:59Z
date_updated: 2022-03-18T09:31:59Z
file_id: '10857'
file_name: 2021_AnalysisMetricSpaces_Ivanov.pdf
file_size: 789801
relation: main_file
success: 1
file_date_updated: 2022-03-18T09:31:59Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
keyword:
- Applied Mathematics
- Geometry and Topology
- Analysis
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 1-18
publication: Analysis and Geometry in Metric Spaces
publication_identifier:
issn:
- 2299-3274
publication_status: published
publisher: De Gruyter
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the volume of sections of the cube
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: 9
year: '2021'
...
---
_id: '10858'
abstract:
- lang: eng
text: The cost-effective conversion of low-grade heat into electricity using thermoelectric
devices requires developing alternative materials and material processing technologies
able to reduce the currently high device manufacturing costs. In this direction,
thermoelectric materials that do not rely on rare or toxic elements such as tellurium
or lead need to be produced using high-throughput technologies not involving high
temperatures and long processes. Bi2Se3 is an obvious possible Te-free alternative
to Bi2Te3 for ambient temperature thermoelectric applications, but its performance
is still low for practical applications, and additional efforts toward finding
proper dopants are required. Here, we report a scalable method to produce Bi2Se3
nanosheets at low synthesis temperatures. We studied the influence of different
dopants on the thermoelectric properties of this material. Among the elements
tested, we demonstrated that Sn doping resulted in the best performance. Sn incorporation
resulted in a significant improvement to the Bi2Se3 Seebeck coefficient and a
reduction in the thermal conductivity in the direction of the hot-press axis,
resulting in an overall 60% improvement in the thermoelectric figure of merit
of Bi2Se3.
acknowledgement: "M.L., Y.Z., T.Z. and K.X. thank the China Scholarship Council for
their scholarship\r\nsupport. Y.L. acknowledges funding from the European Union’s
Horizon 2020 research and\r\ninnovation program under the Marie Sklodowska-Curie
grant agreement No. 754411. J.L. thanks the ICREA Academia program and projects
MICINN/FEDER RTI2018-093996-B-C31 and G.C. 2017 SGR 128. ICN2 acknowledges funding
from the Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO ENE2017-85087-C3."
article_number: '1827'
article_processing_charge: No
article_type: original
author:
- first_name: Mengyao
full_name: Li, Mengyao
last_name: Li
- first_name: Yu
full_name: Zhang, Yu
last_name: Zhang
- first_name: Ting
full_name: Zhang, Ting
last_name: Zhang
- first_name: Yong
full_name: Zuo, Yong
last_name: Zuo
- first_name: Ke
full_name: Xiao, Ke
last_name: Xiao
- first_name: Jordi
full_name: Arbiol, Jordi
last_name: Arbiol
- first_name: Jordi
full_name: Llorca, Jordi
last_name: Llorca
- first_name: Yu
full_name: Liu, Yu
id: 2A70014E-F248-11E8-B48F-1D18A9856A87
last_name: Liu
orcid: 0000-0001-7313-6740
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Li M, Zhang Y, Zhang T, et al. Enhanced thermoelectric performance of n-type
Bi2Se3 nanosheets through Sn doping. Nanomaterials. 2021;11(7). doi:10.3390/nano11071827
apa: Li, M., Zhang, Y., Zhang, T., Zuo, Y., Xiao, K., Arbiol, J., … Cabot, A. (2021).
Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn doping.
Nanomaterials. MDPI. https://doi.org/10.3390/nano11071827
chicago: Li, Mengyao, Yu Zhang, Ting Zhang, Yong Zuo, Ke Xiao, Jordi Arbiol, Jordi
Llorca, Yu Liu, and Andreu Cabot. “Enhanced Thermoelectric Performance of N-Type
Bi2Se3 Nanosheets through Sn Doping.” Nanomaterials. MDPI, 2021. https://doi.org/10.3390/nano11071827.
ieee: M. Li et al., “Enhanced thermoelectric performance of n-type Bi2Se3
nanosheets through Sn doping,” Nanomaterials, vol. 11, no. 7. MDPI, 2021.
ista: Li M, Zhang Y, Zhang T, Zuo Y, Xiao K, Arbiol J, Llorca J, Liu Y, Cabot A.
2021. Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through
Sn doping. Nanomaterials. 11(7), 1827.
mla: Li, Mengyao, et al. “Enhanced Thermoelectric Performance of N-Type Bi2Se3 Nanosheets
through Sn Doping.” Nanomaterials, vol. 11, no. 7, 1827, MDPI, 2021, doi:10.3390/nano11071827.
short: M. Li, Y. Zhang, T. Zhang, Y. Zuo, K. Xiao, J. Arbiol, J. Llorca, Y. Liu,
A. Cabot, Nanomaterials 11 (2021).
corr_author: '1'
date_created: 2022-03-18T09:45:02Z
date_published: 2021-07-14T00:00:00Z
date_updated: 2025-06-12T06:42:18Z
day: '14'
ddc:
- '540'
department:
- _id: MaIb
doi: 10.3390/nano11071827
ec_funded: 1
external_id:
isi:
- '000676570000001'
pmid:
- '34361214'
file:
- access_level: open_access
checksum: f28a8b5cf80f5605828359bb398463b0
content_type: application/pdf
creator: dernst
date_created: 2022-03-18T09:53:15Z
date_updated: 2022-03-18T09:53:15Z
file_id: '10859'
file_name: 2021_Nanomaterials_Li.pdf
file_size: 4867547
relation: main_file
success: 1
file_date_updated: 2022-03-18T09:53:15Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
issue: '7'
keyword:
- General Materials Science
- General Chemical Engineering
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Nanomaterials
publication_identifier:
issn:
- 2079-4991
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Enhanced thermoelectric performance of n-type Bi2Se3 nanosheets through Sn
doping
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: '2021'
...
---
_id: '10860'
abstract:
- lang: eng
text: A tight frame is the orthogonal projection of some orthonormal basis of Rn
onto Rk. We show that a set of vectors is a tight frame if and only if the set
of all cross products of these vectors is a tight frame. We reformulate a range
of problems on the volume of projections (or sections) of regular polytopes in
terms of tight frames and write a first-order necessary condition for local extrema
of these problems. As applications, we prove new results for the problem of maximization
of the volume of zonotopes.
acknowledgement: The author was supported by the Swiss National Science Foundation
grant 200021_179133. The author acknowledges the financial support from the Ministry
of Education and Science of the Russian Federation in the framework of MegaGrant
no. 075-15-2019-1926.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Grigory
full_name: Ivanov, Grigory
id: 87744F66-5C6F-11EA-AFE0-D16B3DDC885E
last_name: Ivanov
citation:
ama: Ivanov G. Tight frames and related geometric problems. Canadian Mathematical
Bulletin. 2021;64(4):942-963. doi:10.4153/s000843952000096x
apa: Ivanov, G. (2021). Tight frames and related geometric problems. Canadian
Mathematical Bulletin. Canadian Mathematical Society. https://doi.org/10.4153/s000843952000096x
chicago: Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” Canadian
Mathematical Bulletin. Canadian Mathematical Society, 2021. https://doi.org/10.4153/s000843952000096x.
ieee: G. Ivanov, “Tight frames and related geometric problems,” Canadian Mathematical
Bulletin, vol. 64, no. 4. Canadian Mathematical Society, pp. 942–963, 2021.
ista: Ivanov G. 2021. Tight frames and related geometric problems. Canadian Mathematical
Bulletin. 64(4), 942–963.
mla: Ivanov, Grigory. “Tight Frames and Related Geometric Problems.” Canadian
Mathematical Bulletin, vol. 64, no. 4, Canadian Mathematical Society, 2021,
pp. 942–63, doi:10.4153/s000843952000096x.
short: G. Ivanov, Canadian Mathematical Bulletin 64 (2021) 942–963.
corr_author: '1'
date_created: 2022-03-18T09:55:59Z
date_published: 2021-12-18T00:00:00Z
date_updated: 2024-10-09T21:01:50Z
day: '18'
department:
- _id: UlWa
doi: 10.4153/s000843952000096x
external_id:
arxiv:
- '1804.10055'
isi:
- '000730165300021'
intvolume: ' 64'
isi: 1
issue: '4'
keyword:
- General Mathematics
- Tight frame
- Grassmannian
- zonotope
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.10055
month: '12'
oa: 1
oa_version: Preprint
page: 942-963
publication: Canadian Mathematical Bulletin
publication_identifier:
eissn:
- 1496-4287
issn:
- 0008-4395
publication_status: published
publisher: Canadian Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tight frames and related geometric problems
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 64
year: '2021'
...
---
_id: '11052'
abstract:
- lang: eng
text: In order to combat molecular damage, most cellular proteins undergo rapid
turnover. We have previously identified large nuclear protein assemblies that
can persist for years in post-mitotic tissues and are subject to age-related decline.
Here, we report that mitochondria can be long lived in the mouse brain and reveal
that specific mitochondrial proteins have half-lives longer than the average proteome.
These mitochondrial long-lived proteins (mitoLLPs) are core components of the
electron transport chain (ETC) and display increased longevity in respiratory
supercomplexes. We find that COX7C, a mitoLLP that forms a stable contact site
between complexes I and IV, is required for complex IV and supercomplex assembly.
Remarkably, even upon depletion of COX7C transcripts, ETC function is maintained
for days, effectively uncoupling mitochondrial function from ongoing transcription
of its mitoLLPs. Our results suggest that modulating protein longevity within
the ETC is critical for mitochondrial proteome maintenance and the robustness
of mitochondrial function.
article_processing_charge: No
article_type: original
author:
- first_name: Shefali
full_name: Krishna, Shefali
last_name: Krishna
- first_name: Rafael
full_name: Arrojo e Drigo, Rafael
last_name: Arrojo e Drigo
- first_name: Juliana S.
full_name: Capitanio, Juliana S.
last_name: Capitanio
- first_name: Ranjan
full_name: Ramachandra, Ranjan
last_name: Ramachandra
- first_name: Mark
full_name: Ellisman, Mark
last_name: Ellisman
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Krishna S, Arrojo e Drigo R, Capitanio JS, Ramachandra R, Ellisman M, Hetzer
M. Identification of long-lived proteins in the mitochondria reveals increased
stability of the electron transport chain. Developmental Cell. 2021;56(21):P2952-2965.e9.
doi:10.1016/j.devcel.2021.10.008
apa: Krishna, S., Arrojo e Drigo, R., Capitanio, J. S., Ramachandra, R., Ellisman,
M., & Hetzer, M. (2021). Identification of long-lived proteins in the mitochondria
reveals increased stability of the electron transport chain. Developmental
Cell. Elsevier. https://doi.org/10.1016/j.devcel.2021.10.008
chicago: Krishna, Shefali, Rafael Arrojo e Drigo, Juliana S. Capitanio, Ranjan Ramachandra,
Mark Ellisman, and Martin Hetzer. “Identification of Long-Lived Proteins in the
Mitochondria Reveals Increased Stability of the Electron Transport Chain.” Developmental
Cell. Elsevier, 2021. https://doi.org/10.1016/j.devcel.2021.10.008.
ieee: S. Krishna, R. Arrojo e Drigo, J. S. Capitanio, R. Ramachandra, M. Ellisman,
and M. Hetzer, “Identification of long-lived proteins in the mitochondria reveals
increased stability of the electron transport chain,” Developmental Cell,
vol. 56, no. 21. Elsevier, p. P2952–2965.e9, 2021.
ista: Krishna S, Arrojo e Drigo R, Capitanio JS, Ramachandra R, Ellisman M, Hetzer
M. 2021. Identification of long-lived proteins in the mitochondria reveals increased
stability of the electron transport chain. Developmental Cell. 56(21), P2952–2965.e9.
mla: Krishna, Shefali, et al. “Identification of Long-Lived Proteins in the Mitochondria
Reveals Increased Stability of the Electron Transport Chain.” Developmental
Cell, vol. 56, no. 21, Elsevier, 2021, p. P2952–2965.e9, doi:10.1016/j.devcel.2021.10.008.
short: S. Krishna, R. Arrojo e Drigo, J.S. Capitanio, R. Ramachandra, M. Ellisman,
M. Hetzer, Developmental Cell 56 (2021) P2952–2965.e9.
date_created: 2022-04-07T07:43:14Z
date_published: 2021-11-08T00:00:00Z
date_updated: 2025-12-15T10:01:56Z
day: '08'
department:
- _id: MaHe
doi: 10.1016/j.devcel.2021.10.008
extern: '1'
external_id:
pmid:
- '34715012'
intvolume: ' 56'
issue: '21'
keyword:
- Developmental Biology
- Cell Biology
- General Biochemistry
- Genetics and Molecular Biology
- Molecular Biology
language:
- iso: eng
month: '11'
oa_version: None
page: P2952-2965.e9
pmid: 1
publication: Developmental Cell
publication_identifier:
issn:
- 1534-5807
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Identification of long-lived proteins in the mitochondria reveals increased
stability of the electron transport chain
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 56
year: '2021'
...
---
_id: '11436'
abstract:
- lang: eng
text: Asynchronous distributed algorithms are a popular way to reduce synchronization
costs in large-scale optimization, and in particular for neural network training.
However, for nonsmooth and nonconvex objectives, few convergence guarantees exist
beyond cases where closed-form proximal operator solutions are available. As training
most popular deep neural networks corresponds to optimizing nonsmooth and nonconvex
objectives, there is a pressing need for such convergence guarantees. In this
paper, we analyze for the first time the convergence of stochastic asynchronous
optimization for this general class of objectives. In particular, we focus on
stochastic subgradient methods allowing for block variable partitioning, where
the shared model is asynchronously updated by concurrent processes. To this end,
we use a probabilistic model which captures key features of real asynchronous
scheduling between concurrent processes. Under this model, we establish convergence
with probability one to an invariant set for stochastic subgradient methods with
momentum. From a practical perspective, one issue with the family of algorithms
that we consider is that they are not efficiently supported by machine learning
frameworks, which mostly focus on distributed data-parallel strategies. To address
this, we propose a new implementation strategy for shared-memory based training
of deep neural networks for a partitioned but shared model in single- and multi-GPU
settings. Based on this implementation, we achieve on average1.2x speed-up in
comparison to state-of-the-art training methods for popular image classification
tasks, without compromising accuracy.
acknowledgement: Vyacheslav Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16
019/0000765 “Research Center for Informatics. Bapi Chatterjee was supported by the
European Union’s Horizon 2020 research and innovation programme under the Marie
Sklodowska-Curie grant agreement No. 754411 (ISTPlus). Dan Alistarh has received
funding from the European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation programme (grant agreement No 805223 ScaleML).
article_processing_charge: No
arxiv: 1
author:
- first_name: Vyacheslav
full_name: Kungurtsev, Vyacheslav
last_name: Kungurtsev
- first_name: Malcolm
full_name: Egan, Malcolm
last_name: Egan
- first_name: Bapi
full_name: Chatterjee, Bapi
id: 3C41A08A-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-2742-4028
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization
methods for efficient training of deep neural networks with guarantees. In: 35th
AAAI Conference on Artificial Intelligence, AAAI 2021. Vol 35. AAAI Press;
2021:8209-8216.'
apa: 'Kungurtsev, V., Egan, M., Chatterjee, B., & Alistarh, D.-A. (2021). Asynchronous
optimization methods for efficient training of deep neural networks with guarantees.
In 35th AAAI Conference on Artificial Intelligence, AAAI 2021 (Vol. 35,
pp. 8209–8216). Virtual, Online: AAAI Press.'
chicago: Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh.
“Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks
with Guarantees.” In 35th AAAI Conference on Artificial Intelligence, AAAI
2021, 35:8209–16. AAAI Press, 2021.
ieee: V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization
methods for efficient training of deep neural networks with guarantees,” in 35th
AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual, Online, 2021,
vol. 35, no. 9B, pp. 8209–8216.
ista: 'Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. 2021. Asynchronous optimization
methods for efficient training of deep neural networks with guarantees. 35th AAAI
Conference on Artificial Intelligence, AAAI 2021. AAAI: Conference on Artificial
Intelligence vol. 35, 8209–8216.'
mla: Kungurtsev, Vyacheslav, et al. “Asynchronous Optimization Methods for Efficient
Training of Deep Neural Networks with Guarantees.” 35th AAAI Conference on
Artificial Intelligence, AAAI 2021, vol. 35, no. 9B, AAAI Press, 2021, pp.
8209–16.
short: V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference
on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216.
conference:
end_date: 2021-02-09
location: Virtual, Online
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2021-02-02
date_created: 2022-06-05T22:01:52Z
date_published: 2021-05-18T00:00:00Z
date_updated: 2025-04-14T07:43:57Z
day: '18'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '1905.11845'
intvolume: ' 35'
issue: 9B
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1905.11845'
month: '05'
oa: 1
oa_version: Preprint
page: 8209-8216
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 35th AAAI Conference on Artificial Intelligence, AAAI 2021
publication_identifier:
eissn:
- 2374-3468
isbn:
- '9781713835974'
issn:
- 2159-5399
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Asynchronous optimization methods for efficient training of deep neural networks
with guarantees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '11458'
abstract:
- lang: eng
text: 'The increasing computational requirements of deep neural networks (DNNs)
have led to significant interest in obtaining DNN models that are sparse, yet
accurate. Recent work has investigated the even harder case of sparse training,
where the DNN weights are, for as much as possible, already sparse to reduce computational
costs during training. Existing sparse training methods are often empirical and
can have lower accuracy relative to the dense baseline. In this paper, we present
a general approach called Alternating Compressed/DeCompressed (AC/DC) training
of DNNs, demonstrate convergence for a variant of the algorithm, and show that
AC/DC outperforms existing sparse training methods in accuracy at similar computational
budgets; at high sparsity levels, AC/DC even outperforms existing methods that
rely on accurate pre-trained dense models. An important property of AC/DC is that
it allows co-training of dense and sparse models, yielding accurate sparse–dense
model pairs at the end of the training process. This is useful in practice, where
compressed variants may be desirable for deployment in resource-constrained settings
without re-doing the entire training flow, and also provides us with insights
into the accuracy gap between dense and compressed models. The code is available
at: https://github.com/IST-DASLab/ACDC.'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML), and a CNRS PEPS grant. This research was supported
by the Scientific Service Units (SSU) of IST Austria through resources provided
by Scientific Computing (SciComp). We would also like to thank Christoph Lampert
for his feedback on an earlier version of this work, as well as for providing hardware
for the Transformer-XL experiments.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Elena-Alexandra
full_name: Peste, Elena-Alexandra
id: 32D78294-F248-11E8-B48F-1D18A9856A87
last_name: Peste
- 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: Adrian
full_name: Vladu, Adrian
last_name: Vladu
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Krumes A, Iofinova EB, Vladu A, Alistarh D-A. AC/DC: Alternating Compressed/DeCompressed
training of deep neural networks. In: 35th Conference on Neural Information
Processing Systems. Vol 34. Neural Information Processing Systems Foundation;
2021:8557-8570.'
apa: 'Krumes, A., Iofinova, E. B., Vladu, A., & Alistarh, D.-A. (2021). AC/DC:
Alternating Compressed/DeCompressed training of deep neural networks. In 35th
Conference on Neural Information Processing Systems (Vol. 34, pp. 8557–8570).
Virtual, Online: Neural Information Processing Systems Foundation.'
chicago: 'Krumes, Alexandra, Eugenia B Iofinova, Adrian Vladu, and Dan-Adrian Alistarh.
“AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.”
In 35th Conference on Neural Information Processing Systems, 34:8557–70.
Neural Information Processing Systems Foundation, 2021.'
ieee: 'A. Krumes, E. B. Iofinova, A. Vladu, and D.-A. Alistarh, “AC/DC: Alternating
Compressed/DeCompressed training of deep neural networks,” in 35th Conference
on Neural Information Processing Systems, Virtual, Online, 2021, vol. 34,
pp. 8557–8570.'
ista: 'Krumes A, Iofinova EB, Vladu A, Alistarh D-A. 2021. AC/DC: Alternating Compressed/DeCompressed
training of deep neural networks. 35th Conference on Neural Information Processing
Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, vol. 34, 8557–8570.'
mla: 'Krumes, Alexandra, et al. “AC/DC: Alternating Compressed/DeCompressed Training
of Deep Neural Networks.” 35th Conference on Neural Information Processing
Systems, vol. 34, Neural Information Processing Systems Foundation, 2021,
pp. 8557–70.'
short: A. Krumes, E.B. Iofinova, A. Vladu, D.-A. Alistarh, in:, 35th Conference
on Neural Information Processing Systems, Neural Information Processing Systems
Foundation, 2021, pp. 8557–8570.
conference:
end_date: 2021-12-14
location: Virtual, Online
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
corr_author: '1'
date_created: 2022-06-20T12:11:53Z
date_published: 2021-12-06T00:00:00Z
date_updated: 2026-06-18T17:18:20Z
day: '06'
ddc:
- '000'
department:
- _id: GradSch
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2106.12379'
intvolume: ' 34'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2021/file/48000647b315f6f00f913caa757a70b3-Paper.pdf
month: '12'
oa: 1
oa_version: Published Version
page: 8557-8570
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
related_material:
record:
- id: '13074'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'AC/DC: Alternating Compressed/DeCompressed training of deep neural networks'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2021'
...
---
_id: '11463'
abstract:
- lang: eng
text: "Efficiently approximating local curvature information of the loss function
is a key tool for optimization and compression of deep neural networks. Yet, most
existing methods to approximate second-order information have high computational\r\nor
storage costs, which limits their practicality. In this work, we investigate matrix-free,
linear-time approaches for estimating Inverse-Hessian Vector Products (IHVPs)
for the case when the Hessian can be approximated as a sum of rank-one matrices,
as in the classic approximation of the Hessian by the empirical Fisher matrix.
We propose two new algorithms: the first is tailored towards network compression
and can compute the IHVP for dimension d, if the Hessian is given as a sum of
m rank-one matrices, using O(dm2) precomputation, O(dm) cost for computing the
IHVP, and query cost O(m) for any single element of the inverse Hessian. The second
algorithm targets an optimization setting, where we wish to compute the product
between the inverse Hessian, estimated over a sliding window of optimization steps,
and a given gradient direction, as required for preconditioned SGD. We give an
algorithm with cost O(dm + m2) for computing the IHVP and O(dm + m3) for adding
or removing any gradient from the sliding window. These\r\ntwo algorithms yield
state-of-the-art results for network pruning and optimization with lower computational
overhead relative to existing second-order methods. Implementations are available
at [9] and [17]."
acknowledgement: We gratefully acknowledge funding the European Research Council (ERC)
under the European Union’s Horizon 2020 research and innovation programme (grant
agreement No 805223 ScaleML), as well as computational support from Amazon Web Services
(AWS) EC2.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Elias
full_name: Frantar, Elias
id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f
last_name: Frantar
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Frantar E, Kurtic E, Alistarh D-A. M-FAC: Efficient matrix-free approximations
of second-order information. In: 35th Conference on Neural Information Processing
Systems. Vol 34. Neural Information Processing Systems Foundation; 2021:14873-14886.'
apa: 'Frantar, E., Kurtic, E., & Alistarh, D.-A. (2021). M-FAC: Efficient matrix-free
approximations of second-order information. In 35th Conference on Neural Information
Processing Systems (Vol. 34, pp. 14873–14886). Virtual, Online: Neural Information
Processing Systems Foundation.'
chicago: 'Frantar, Elias, Eldar Kurtic, and Dan-Adrian Alistarh. “M-FAC: Efficient
Matrix-Free Approximations of Second-Order Information.” In 35th Conference
on Neural Information Processing Systems, 34:14873–86. Neural Information
Processing Systems Foundation, 2021.'
ieee: 'E. Frantar, E. Kurtic, and D.-A. Alistarh, “M-FAC: Efficient matrix-free
approximations of second-order information,” in 35th Conference on Neural Information
Processing Systems, Virtual, Online, 2021, vol. 34, pp. 14873–14886.'
ista: 'Frantar E, Kurtic E, Alistarh D-A. 2021. M-FAC: Efficient matrix-free approximations
of second-order information. 35th Conference on Neural Information Processing
Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, vol. 34, 14873–14886.'
mla: 'Frantar, Elias, et al. “M-FAC: Efficient Matrix-Free Approximations of Second-Order
Information.” 35th Conference on Neural Information Processing Systems,
vol. 34, Neural Information Processing Systems Foundation, 2021, pp. 14873–86.'
short: E. Frantar, E. Kurtic, D.-A. Alistarh, in:, 35th Conference on Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2021, pp.
14873–14886.
conference:
end_date: 2021-12-14
location: Virtual, Online
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
corr_author: '1'
date_created: 2022-06-26T22:01:35Z
date_published: 2021-12-06T00:00:00Z
date_updated: 2026-06-18T17:18:44Z
day: '06'
ddc:
- '000'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2010.08222'
intvolume: ' 34'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2021/file/7cfd5df443b4eb0d69886a583b33de4c-Paper.pdf
month: '12'
oa: 1
oa_version: Published Version
page: 14873-14886
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'M-FAC: Efficient matrix-free approximations of second-order information'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2021'
...
---
_id: '11464'
abstract:
- lang: eng
text: "We consider a standard distributed optimisation setting where N machines,
each holding a d-dimensional function\r\nfi, aim to jointly minimise the sum of
the functions ∑Ni=1fi(x). This problem arises naturally in large-scale distributed
optimisation, where a standard solution is to apply variants of (stochastic) gradient
descent. We focus on the communication complexity of this problem: our main result
provides the first fully unconditional bounds on total number of bits which need
to be sent and received by the N machines to solve this problem under point-to-point
communication, within a given error-tolerance. Specifically, we show that Ω(Ndlogd/Nε)
total bits need to be communicated between the machines to find an additive ϵ-approximation
to the minimum of ∑Ni=1fi(x). The result holds for both deterministic and randomised
algorithms, and, importantly, requires no assumptions on the algorithm structure.
The lower bound is tight under certain restrictions on parameter values, and is
matched within constant factors for quadratic objectives by a new variant of quantised
gradient descent, which we describe and analyse. Our results bring over tools
from communication complexity to distributed optimisation, which has potential
for further applications."
acknowledgement: We thank the NeurIPS reviewers for insightful comments that helped
us improve the positioning of our results, as well as for pointing out the subsampling
approach for complementing the randomised lower bound. We also thank Foivos Alimisis
and Peter Davies for useful discussions. This project has received funding from
the European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation programme (grant agreement No 805223 ScaleML).
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
citation:
ama: 'Alistarh D-A, Korhonen J. Towards tight communication lower bounds for distributed
optimisation. In: 35th Conference on Neural Information Processing Systems.
Vol 34. Neural Information Processing Systems Foundation; 2021:7254-7266.'
apa: 'Alistarh, D.-A., & Korhonen, J. (2021). Towards tight communication lower
bounds for distributed optimisation. In 35th Conference on Neural Information
Processing Systems (Vol. 34, pp. 7254–7266). Virtual, Online: Neural Information
Processing Systems Foundation.'
chicago: Alistarh, Dan-Adrian, and Janne Korhonen. “Towards Tight Communication
Lower Bounds for Distributed Optimisation.” In 35th Conference on Neural Information
Processing Systems, 34:7254–66. Neural Information Processing Systems Foundation,
2021.
ieee: D.-A. Alistarh and J. Korhonen, “Towards tight communication lower bounds
for distributed optimisation,” in 35th Conference on Neural Information Processing
Systems, Virtual, Online, 2021, vol. 34, pp. 7254–7266.
ista: 'Alistarh D-A, Korhonen J. 2021. Towards tight communication lower bounds
for distributed optimisation. 35th Conference on Neural Information Processing
Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, vol. 34, 7254–7266.'
mla: Alistarh, Dan-Adrian, and Janne Korhonen. “Towards Tight Communication Lower
Bounds for Distributed Optimisation.” 35th Conference on Neural Information
Processing Systems, vol. 34, Neural Information Processing Systems Foundation,
2021, pp. 7254–66.
short: D.-A. Alistarh, J. Korhonen, in:, 35th Conference on Neural Information Processing
Systems, Neural Information Processing Systems Foundation, 2021, pp. 7254–7266.
conference:
end_date: 2021-12-14
location: Virtual, Online
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
corr_author: '1'
date_created: 2022-06-26T22:01:35Z
date_published: 2021-12-06T00:00:00Z
date_updated: 2026-06-18T17:19:18Z
day: '06'
ddc:
- '000'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2010.08222'
intvolume: ' 34'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.neurips.cc/paper/2021/file/3b92d18aa7a6176dd37d372bc2f1eb71-Paper.pdf
month: '12'
oa: 1
oa_version: Published Version
page: 7254-7266
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Towards tight communication lower bounds for distributed optimisation
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2021'
...
---
_id: '12186'
abstract:
- lang: eng
text: Activation of cell-surface and intracellular receptor-mediated immunity results
in rapid transcriptional reprogramming that underpins disease resistance. However,
the mechanisms by which co-activation of both immune systems lead to transcriptional
changes are not clear. Here, we combine RNA-seq and ATAC-seq to define changes
in gene expression and chromatin accessibility. Activation of cell-surface or
intracellular receptor-mediated immunity, or both, increases chromatin accessibility
at induced defence genes. Analysis of ATAC-seq and RNA-seq data combined with
publicly available information on transcription factor DNA-binding motifs enabled
comparison of individual gene regulatory networks activated by cell-surface or
intracellular receptor-mediated immunity, or by both. These results and analyses
reveal overlapping and conserved transcriptional regulatory mechanisms between
the two immune systems.
acknowledgement: "We thank the Gatsby Foundation (UK) for funding to the JDGJ laboratory.
PD acknowledges support from the European Union’s Horizon 2020 Research and Innovation
Program under Marie Skłodowska Curie Actions (grant agreement: 656243) and a Future
Leader Fellowship from the Biotechnology and Biological Sciences Research Council
(BBSRC) (grant agreement: BB/R012172/1). TS, RKS, DM, and JDGJ were supported by
the Gatsby Foundation funding to the\r\nSainsbury Laboratory. NMP and KV were supported
by a BOF grant from Ghent University (grant agreement: BOF24Y2019001901). WG and
RZ were supported by the Scottish Government Rural and Environment Science and Analytical
Services division (RESAS), and RZ also acknowledges the support from a BBSRC Bioinformatics
and Biological Resources Fund (grant agreement: BB/S020160/1).BPMN was supported
by the Norwich Research Park (NRP) Biosciences Doctoral Training Partnership (DTP)
funded by the BBSRC (grant agreement: BB/M011216/1). SH and XF were supported by
a BBSRC Responsive Mode grant (grant agreement: BB/S009620/1) and a European Research
Council Starting grant ‘SexMeth’ (grant agreement: 804981). CL was supported by
Deutsche Forschungsgemeinschaft (grant agreement: LI 2862/4). "
article_processing_charge: No
article_type: original
author:
- first_name: Pingtao
full_name: Ding, Pingtao
last_name: Ding
- first_name: Toshiyuki
full_name: Sakai, Toshiyuki
last_name: Sakai
- first_name: Ram
full_name: Krishna Shrestha, Ram
last_name: Krishna Shrestha
- first_name: Nicolas
full_name: Manosalva Perez, Nicolas
last_name: Manosalva Perez
- first_name: Wenbin
full_name: Guo, Wenbin
last_name: Guo
- first_name: Bruno Pok Man
full_name: Ngou, Bruno Pok Man
last_name: Ngou
- first_name: Shengbo
full_name: He, Shengbo
last_name: He
- first_name: Chang
full_name: Liu, Chang
last_name: Liu
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
- first_name: Runxuan
full_name: Zhang, Runxuan
last_name: Zhang
- first_name: Klaas
full_name: Vandepoele, Klaas
last_name: Vandepoele
- first_name: Dan
full_name: MacLean, Dan
last_name: MacLean
- first_name: Jonathan D G
full_name: Jones, Jonathan D G
last_name: Jones
citation:
ama: Ding P, Sakai T, Krishna Shrestha R, et al. Chromatin accessibility landscapes
activated by cell-surface and intracellular immune receptors. Journal of Experimental
Botany. 2021;72(22):7927-7941. doi:10.1093/jxb/erab373
apa: Ding, P., Sakai, T., Krishna Shrestha, R., Manosalva Perez, N., Guo, W., Ngou,
B. P. M., … Jones, J. D. G. (2021). Chromatin accessibility landscapes activated
by cell-surface and intracellular immune receptors. Journal of Experimental
Botany. Oxford University Press. https://doi.org/10.1093/jxb/erab373
chicago: Ding, Pingtao, Toshiyuki Sakai, Ram Krishna Shrestha, Nicolas Manosalva
Perez, Wenbin Guo, Bruno Pok Man Ngou, Shengbo He, et al. “Chromatin Accessibility
Landscapes Activated by Cell-Surface and Intracellular Immune Receptors.” Journal
of Experimental Botany. Oxford University Press, 2021. https://doi.org/10.1093/jxb/erab373.
ieee: P. Ding et al., “Chromatin accessibility landscapes activated by cell-surface
and intracellular immune receptors,” Journal of Experimental Botany, vol.
72, no. 22. Oxford University Press, pp. 7927–7941, 2021.
ista: Ding P, Sakai T, Krishna Shrestha R, Manosalva Perez N, Guo W, Ngou BPM, He
S, Liu C, Feng X, Zhang R, Vandepoele K, MacLean D, Jones JDG. 2021. Chromatin
accessibility landscapes activated by cell-surface and intracellular immune receptors.
Journal of Experimental Botany. 72(22), 7927–7941.
mla: Ding, Pingtao, et al. “Chromatin Accessibility Landscapes Activated by Cell-Surface
and Intracellular Immune Receptors.” Journal of Experimental Botany, vol.
72, no. 22, Oxford University Press, 2021, pp. 7927–41, doi:10.1093/jxb/erab373.
short: P. Ding, T. Sakai, R. Krishna Shrestha, N. Manosalva Perez, W. Guo, B.P.M.
Ngou, S. He, C. Liu, X. Feng, R. Zhang, K. Vandepoele, D. MacLean, J.D.G. Jones,
Journal of Experimental Botany 72 (2021) 7927–7941.
date_created: 2023-01-16T09:14:35Z
date_published: 2021-08-13T00:00:00Z
date_updated: 2023-05-08T11:01:18Z
day: '13'
department:
- _id: XiFe
doi: 10.1093/jxb/erab373
extern: '1'
external_id:
pmid:
- '34387350'
intvolume: ' 72'
issue: '22'
keyword:
- Plant Science
- Physiology
language:
- iso: eng
month: '08'
oa_version: None
page: 7927-7941
pmid: 1
publication: Journal of Experimental Botany
publication_identifier:
issn:
- 0022-0957
- 1460-2431
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Chromatin accessibility landscapes activated by cell-surface and intracellular
immune receptors
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 72
year: '2021'
...
---
OA_place: repository
OA_type: green
_id: '12187'
abstract:
- lang: eng
text: Genomes of germ cells present an existential vulnerability to organisms because
germ cell mutations will propagate to future generations. Transposable elements
are one source of such mutations. In the small flowering plant Arabidopsis, Long
et al. found that genome methylation in the male germline is directed by small
interfering RNAs (siRNAs) imperfectly transcribed from transposons (see the Perspective
by Mosher). These germline siRNAs silence germline transposons and establish inherited
methylation patterns in sperm, thus maintaining the integrity of the plant genome
across generations.
acknowledgement: 'We thank the John Innes Centre Bioimaging Facility (S. Lopez, E.
Wegel, and K. Findlay) for their assistance with microscopy and the Norwich BioScience
Institute Partnership Computing Infrastructure for Science Group for high-performance
computing resources. Funding: This work was funded by a European Research Council
Starting Grant (“SexMeth” 804981; J.L., J.W., and X.F.), a Sainsbury Charitable
Foundation studentship (J.W.), two Biotechnology and Biological Sciences Research
Council (BBSRC) grants (BBS0096201 and BBP0135111; W.S., M.V., and X.F.), two John
Innes Foundation studentships (B.A. and S.D.), and a BBSRC David Phillips Fellowship
(BBL0250431; H.G. and X.F.). Author contributions: J.L., J.W., and X.F. designed
the study and wrote the manuscript; J.L., W.S., B.A., H.G., and S.D. performed the
experiments; and J.L., J.W., B.A., H.G., S.D., M.V., and X.F. analyzed the data.
Competing interests: The authors declare no competing interests. Data and material
availability: All sequencing data have been deposited in the Gene Expression Omnibus
(GEO) under accession no. GSE161625. Accession nos. of published datasets used in
this study are listed in table S6. Published software used in this study include
Bowtie v1.2.2 (https://doi.org/10.1002/0471250953.bi1107s32), Bismark v0.22.2 (https://doi.org/10.1093/bioinformatics/btr167),
Kallisto v0.43.0 (https://doi.org/10.1038/nbt0816-888d), Shortstack v3.8.5 (https://doi.org/10.1534/g3.116.030452),
and Cutadapt v1.15 (https://doi.org/10.1089/cmb.2017.0096). TrimGalore v0.4.1 and
MarkDuplicates v1.141 are available from https://github.com/FelixKrueger/TrimGalore
and https://github.com/broadinstitute/picard, respectively. All remaining data are
in the main paper or the supplementary materials.'
article_processing_charge: No
article_type: original
author:
- first_name: Jincheng
full_name: Long, Jincheng
last_name: Long
- first_name: James
full_name: Walker, James
last_name: Walker
- first_name: Wenjing
full_name: She, Wenjing
last_name: She
- first_name: Billy
full_name: Aldridge, Billy
last_name: Aldridge
- first_name: Hongbo
full_name: Gao, Hongbo
last_name: Gao
- first_name: Samuel
full_name: Deans, Samuel
last_name: Deans
- first_name: Martin
full_name: Vickers, Martin
last_name: Vickers
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
citation:
ama: Long J, Walker J, She W, et al. Nurse cell-derived small RNAs define paternal
epigenetic inheritance in Arabidopsis. Science. 2021;373(6550). doi:10.1126/science.abh0556
apa: Long, J., Walker, J., She, W., Aldridge, B., Gao, H., Deans, S., … Feng, X.
(2021). Nurse cell-derived small RNAs define paternal epigenetic inheritance in
Arabidopsis. Science. American Association for the Advancement of Science.
https://doi.org/10.1126/science.abh0556
chicago: Long, Jincheng, James Walker, Wenjing She, Billy Aldridge, Hongbo Gao,
Samuel Deans, Martin Vickers, and Xiaoqi Feng. “Nurse Cell-Derived Small RNAs
Define Paternal Epigenetic Inheritance in Arabidopsis.” Science. American
Association for the Advancement of Science, 2021. https://doi.org/10.1126/science.abh0556.
ieee: J. Long et al., “Nurse cell-derived small RNAs define paternal epigenetic
inheritance in Arabidopsis,” Science, vol. 373, no. 6550. American Association
for the Advancement of Science, 2021.
ista: Long J, Walker J, She W, Aldridge B, Gao H, Deans S, Vickers M, Feng X. 2021.
Nurse cell-derived small RNAs define paternal epigenetic inheritance in Arabidopsis.
Science. 373(6550).
mla: Long, Jincheng, et al. “Nurse Cell-Derived Small RNAs Define Paternal Epigenetic
Inheritance in Arabidopsis.” Science, vol. 373, no. 6550, American Association
for the Advancement of Science, 2021, doi:10.1126/science.abh0556.
short: J. Long, J. Walker, W. She, B. Aldridge, H. Gao, S. Deans, M. Vickers, X.
Feng, Science 373 (2021).
date_created: 2023-01-16T09:15:14Z
date_published: 2021-07-02T00:00:00Z
date_updated: 2026-03-19T10:52:21Z
day: '02'
department:
- _id: XiFe
doi: 10.1126/science.abh0556
extern: '1'
external_id:
pmid:
- '34210850'
intvolume: ' 373'
issue: '6550'
keyword:
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2021.01.25.428150
month: '07'
oa: 1
oa_version: Preprint
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nurse cell-derived small RNAs define paternal epigenetic inheritance in Arabidopsis
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 373
year: '2021'
...
---
_id: '12767'
abstract:
- lang: eng
text: "Several problems in planning and reactive synthesis can be reduced to the
analysis of two-player quantitative graph games. Optimization is one form of analysis.
We argue that in many cases it may be better to replace the optimization problem
with the satisficing problem, where instead of searching for optimal solutions,
the goal is to search for solutions that adhere to a given threshold bound.\r\nThis
work defines and investigates the satisficing problem on a two-player graph game
with the discounted-sum cost model. We show that while the satisficing problem
can be solved using numerical methods just like the optimization problem, this
approach does not render compelling benefits over optimization. When the discount
factor is, however, an integer, we present another approach to satisficing, which
is purely based on automata methods. We show that this approach is algorithmically
more performant – both theoretically and empirically – and demonstrates the broader
applicability of satisficing over optimization."
acknowledgement: We thank anonymous reviewers for valuable inputs. This work is supported
in part by NSF grant 2030859 to the CRA for the CIFellows Project, NSF grants IIS-1527668,
CCF-1704883, IIS-1830549, the ERC CoG 863818 (ForM-SMArt), and an award from the
Maryland Procurement Office.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Suguman
full_name: Bansal, Suguman
last_name: Bansal
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Moshe Y.
full_name: Vardi, Moshe Y.
last_name: Vardi
citation:
ama: 'Bansal S, Chatterjee K, Vardi MY. On satisficing in quantitative games. In:
27th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems. Vol 12651. Springer Nature; 2021:20-37. doi:10.1007/978-3-030-72016-2_2'
apa: 'Bansal, S., Chatterjee, K., & Vardi, M. Y. (2021). On satisficing in quantitative
games. In 27th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (Vol. 12651, pp. 20–37). Luxembourg City, Luxembourg:
Springer Nature. https://doi.org/10.1007/978-3-030-72016-2_2'
chicago: Bansal, Suguman, Krishnendu Chatterjee, and Moshe Y. Vardi. “On Satisficing
in Quantitative Games.” In 27th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems, 12651:20–37. Springer Nature,
2021. https://doi.org/10.1007/978-3-030-72016-2_2.
ieee: S. Bansal, K. Chatterjee, and M. Y. Vardi, “On satisficing in quantitative
games,” in 27th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, Luxembourg City, Luxembourg, 2021, vol. 12651, pp.
20–37.
ista: 'Bansal S, Chatterjee K, Vardi MY. 2021. On satisficing in quantitative games.
27th International Conference on Tools and Algorithms for the Construction and
Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis
of Systems, LNCS, vol. 12651, 20–37.'
mla: Bansal, Suguman, et al. “On Satisficing in Quantitative Games.” 27th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems,
vol. 12651, Springer Nature, 2021, pp. 20–37, doi:10.1007/978-3-030-72016-2_2.
short: S. Bansal, K. Chatterjee, M.Y. Vardi, in:, 27th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems, Springer
Nature, 2021, pp. 20–37.
conference:
end_date: 2021-04-01
location: Luxembourg City, Luxembourg
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2021-03-27
date_created: 2023-03-26T22:01:09Z
date_published: 2021-03-21T00:00:00Z
date_updated: 2025-07-10T13:18:02Z
day: '21'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-030-72016-2_2
ec_funded: 1
external_id:
arxiv:
- '2101.02594'
file:
- access_level: open_access
checksum: b020b78b23587ce7610b1aafb4e63438
content_type: application/pdf
creator: dernst
date_created: 2023-03-28T11:00:33Z
date_updated: 2023-03-28T11:00:33Z
file_id: '12777'
file_name: 2021_LNCS_Bansal.pdf
file_size: 747418
relation: main_file
success: 1
file_date_updated: 2023-03-28T11:00:33Z
has_accepted_license: '1'
intvolume: ' 12651'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 20-37
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 27th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030720155'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: On satisficing in quantitative games
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: 12651
year: '2021'
...
---
OA_place: publisher
_id: '12987'
abstract:
- lang: eng
text: Chromosomal inversion polymorphisms, segments of chromosomes that are flipped
in orientation and occur in reversed order in some individuals, have long been
recognized to play an important role in local adaptation. They can reduce recombination
in heterozygous individuals and thus help to maintain sets of locally adapted
alleles. In a wide range of organisms, populations adapted to different habitats
differ in frequency of inversion arrangements. However, getting a full understanding
of the importance of inversions for adaptation requires confirmation of their
influence on traits under divergent selection. Here, we studied a marine snail,
Littorina saxatilis, that has evolved ecotypes adapted to wave exposure or crab
predation. These two types occur in close proximity on different parts of the
shore. Gene flow between them exists in contact zones. However, they exhibit strong
phenotypic divergence in several traits under habitat-specific selection, including
size, shape and behaviour. We used crosses between these ecotypes to identify
genomic regions that explain variation in these traits by using QTL analysis and
variance partitioning across linkage groups. We could show that previously detected
inversion regions contribute to adaptive divergence. Some inversions influenced
multiple traits suggesting that they contain sets of locally adaptive alleles.
Our study also identified regions without known inversions that are important
for phenotypic divergence. Thus, we provide a more complete overview of the importance
of inversions in relation to the remaining genome.
article_processing_charge: No
author:
- first_name: Eva
full_name: Koch, Eva
last_name: Koch
- first_name: Hernán E.
full_name: Morales, Hernán E.
last_name: Morales
- first_name: Jenny
full_name: Larsson, Jenny
last_name: Larsson
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Alan R.
full_name: Lemmon, Alan R.
last_name: Lemmon
- first_name: E. Moriarty
full_name: Lemmon, E. Moriarty
last_name: Lemmon
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
citation:
ama: 'Koch E, Morales HE, Larsson J, et al. Data from: Genetic variation for adaptive
traits is associated with polymorphic inversions in Littorina saxatilis. 2021.
doi:10.5061/DRYAD.ZGMSBCCB4'
apa: 'Koch, E., Morales, H. E., Larsson, J., Westram, A. M., Faria, R., Lemmon,
A. R., … Butlin, R. K. (2021). Data from: Genetic variation for adaptive traits
is associated with polymorphic inversions in Littorina saxatilis. Dryad. https://doi.org/10.5061/DRYAD.ZGMSBCCB4'
chicago: 'Koch, Eva, Hernán E. Morales, Jenny Larsson, Anja M Westram, Rui Faria,
Alan R. Lemmon, E. Moriarty Lemmon, Kerstin Johannesson, and Roger K. Butlin.
“Data from: Genetic Variation for Adaptive Traits Is Associated with Polymorphic
Inversions in Littorina Saxatilis.” Dryad, 2021. https://doi.org/10.5061/DRYAD.ZGMSBCCB4.'
ieee: 'E. Koch et al., “Data from: Genetic variation for adaptive traits
is associated with polymorphic inversions in Littorina saxatilis.” Dryad, 2021.'
ista: 'Koch E, Morales HE, Larsson J, Westram AM, Faria R, Lemmon AR, Lemmon EM,
Johannesson K, Butlin RK. 2021. Data from: Genetic variation for adaptive traits
is associated with polymorphic inversions in Littorina saxatilis, Dryad, 10.5061/DRYAD.ZGMSBCCB4.'
mla: 'Koch, Eva, et al. Data from: Genetic Variation for Adaptive Traits Is Associated
with Polymorphic Inversions in Littorina Saxatilis. Dryad, 2021, doi:10.5061/DRYAD.ZGMSBCCB4.'
short: E. Koch, H.E. Morales, J. Larsson, A.M. Westram, R. Faria, A.R. Lemmon, E.M.
Lemmon, K. Johannesson, R.K. Butlin, (2021).
date_created: 2023-05-16T12:34:09Z
date_published: 2021-04-10T00:00:00Z
date_updated: 2026-04-07T14:01:30Z
day: '10'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.5061/DRYAD.ZGMSBCCB4
has_accepted_license: '1'
license: https://creativecommons.org/publicdomain/zero/1.0/
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.zgmsbccb4
month: '04'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '9394'
relation: used_in_publication
status: public
status: public
title: 'Data from: Genetic variation for adaptive traits is associated with polymorphic
inversions in Littorina saxatilis'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2021'
...
---
_id: '13057'
abstract:
- lang: eng
text: 'This dataset comprises all data shown in the figures of the submitted article
"Geometric superinductance qubits: Controlling phase delocalization across a single
Josephson junction". Additional raw data are available from the corresponding
author on reasonable request.'
article_processing_charge: No
author:
- first_name: Matilda
full_name: Peruzzo, Matilda
id: 3F920B30-F248-11E8-B48F-1D18A9856A87
last_name: Peruzzo
orcid: 0000-0002-3415-4628
- first_name: Farid
full_name: Hassani, Farid
id: 2AED110C-F248-11E8-B48F-1D18A9856A87
last_name: Hassani
orcid: 0000-0001-6937-5773
- first_name: Grisha
full_name: Szep, Grisha
last_name: Szep
- first_name: Andrea
full_name: Trioni, Andrea
id: 42F71B44-F248-11E8-B48F-1D18A9856A87
last_name: Trioni
- first_name: Elena
full_name: Redchenko, Elena
id: 2C21D6E8-F248-11E8-B48F-1D18A9856A87
last_name: Redchenko
- first_name: Martin
full_name: Zemlicka, Martin
id: 2DCF8DE6-F248-11E8-B48F-1D18A9856A87
last_name: Zemlicka
orcid: 0009-0005-0878-3032
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: 'Peruzzo M, Hassani F, Szep G, et al. Geometric superinductance qubits: Controlling
phase delocalization across a single Josephson junction. 2021. doi:10.5281/ZENODO.5592103'
apa: 'Peruzzo, M., Hassani, F., Szep, G., Trioni, A., Redchenko, E., Zemlicka, M.,
& Fink, J. M. (2021). Geometric superinductance qubits: Controlling phase
delocalization across a single Josephson junction. Zenodo. https://doi.org/10.5281/ZENODO.5592103'
chicago: 'Peruzzo, Matilda, Farid Hassani, Grisha Szep, Andrea Trioni, Elena Redchenko,
Martin Zemlicka, and Johannes M Fink. “Geometric Superinductance Qubits: Controlling
Phase Delocalization across a Single Josephson Junction.” Zenodo, 2021. https://doi.org/10.5281/ZENODO.5592103.'
ieee: 'M. Peruzzo et al., “Geometric superinductance qubits: Controlling
phase delocalization across a single Josephson junction.” Zenodo, 2021.'
ista: 'Peruzzo M, Hassani F, Szep G, Trioni A, Redchenko E, Zemlicka M, Fink JM.
2021. Geometric superinductance qubits: Controlling phase delocalization across
a single Josephson junction, Zenodo, 10.5281/ZENODO.5592103.'
mla: 'Peruzzo, Matilda, et al. Geometric Superinductance Qubits: Controlling
Phase Delocalization across a Single Josephson Junction. Zenodo, 2021, doi:10.5281/ZENODO.5592103.'
short: M. Peruzzo, F. Hassani, G. Szep, A. Trioni, E. Redchenko, M. Zemlicka, J.M.
Fink, (2021).
corr_author: '1'
date_created: 2023-05-23T13:42:27Z
date_published: 2021-10-22T00:00:00Z
date_updated: 2026-04-15T06:41:45Z
day: '22'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.5281/ZENODO.5592103
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.5592104
month: '10'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '9928'
relation: used_in_publication
status: public
status: public
title: 'Geometric superinductance qubits: Controlling phase delocalization across
a single Josephson junction'
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '13058'
abstract:
- lang: eng
text: The zip file includes source data used in the main text of the manuscript
"Theory of branching morphogenesis by local interactions and global guidance",
as well as a representative Jupyter notebook to reproduce the main figures. A
sample script for the simulations of branching and annihilating random walks is
also included (Sample_script_for_simulations_of_BARWs.ipynb) to generate exemplary
branched networks under external guidance. A detailed description of the simulation
setup is provided in the supplementary information of the manuscipt.
article_processing_charge: No
author:
- first_name: Mehmet C
full_name: Ucar, Mehmet C
id: 50B2A802-6007-11E9-A42B-EB23E6697425
last_name: Ucar
orcid: 0000-0003-0506-4217
citation:
ama: Ucar MC. Source data for the manuscript “Theory of branching morphogenesis
by local interactions and global guidance.” 2021. doi:10.5281/ZENODO.5257160
apa: Ucar, M. C. (2021). Source data for the manuscript “Theory of branching morphogenesis
by local interactions and global guidance.” Zenodo. https://doi.org/10.5281/ZENODO.5257160
chicago: Ucar, Mehmet C. “Source Data for the Manuscript ‘Theory of Branching Morphogenesis
by Local Interactions and Global Guidance.’” Zenodo, 2021. https://doi.org/10.5281/ZENODO.5257160.
ieee: M. C. Ucar, “Source data for the manuscript ‘Theory of branching morphogenesis
by local interactions and global guidance.’” Zenodo, 2021.
ista: Ucar MC. 2021. Source data for the manuscript ‘Theory of branching morphogenesis
by local interactions and global guidance’, Zenodo, 10.5281/ZENODO.5257160.
mla: Ucar, Mehmet C. Source Data for the Manuscript “Theory of Branching Morphogenesis
by Local Interactions and Global Guidance.” Zenodo, 2021, doi:10.5281/ZENODO.5257160.
short: M.C. Ucar, (2021).
corr_author: '1'
date_created: 2023-05-23T13:46:34Z
date_published: 2021-08-25T00:00:00Z
date_updated: 2025-04-15T06:54:54Z
day: '25'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.5281/ZENODO.5257160
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.5257161
month: '08'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '10402'
relation: used_in_publication
status: public
status: public
title: Source data for the manuscript "Theory of branching morphogenesis by local
interactions and global guidance"
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '13061'
abstract:
- lang: eng
text: Infections early in life can have enduring effects on an organism’s development
and immunity. In this study, we show that this equally applies to developing “superorganisms”
– incipient social insect colonies. When we exposed newly mated Lasius niger ant
queens to a low pathogen dose, their colonies grew more slowly than controls before
winter, but reached similar sizes afterwards. Independent of exposure, queen hibernation
survival improved when the ratio of pupae to workers was small. Queens that reared
fewer pupae before worker emergence exhibited lower pathogen levels, indicating
that high brood rearing efforts interfere with the ability of the queen’s immune
system to suppress pathogen proliferation. Early-life queen pathogen-exposure
also improved the immunocompetence of her worker offspring, as demonstrated by
challenging the workers to the same pathogen a year later. Transgenerational transfer
of the queen’s pathogen experience to her workforce can hence durably reduce the
disease susceptibility of the whole superorganism.
article_processing_charge: No
author:
- first_name: Barbara E
full_name: Casillas Perez, Barbara E
id: 351ED2AA-F248-11E8-B48F-1D18A9856A87
last_name: Casillas Perez
- first_name: Christopher
full_name: Pull, Christopher
id: 3C7F4840-F248-11E8-B48F-1D18A9856A87
last_name: Pull
orcid: 0000-0003-1122-3982
- first_name: Filip
full_name: Naiser, Filip
last_name: Naiser
- first_name: Elisabeth
full_name: Naderlinger, Elisabeth
last_name: Naderlinger
- first_name: Jiri
full_name: Matas, Jiri
last_name: Matas
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Casillas Perez BE, Pull C, Naiser F, Naderlinger E, Matas J, Cremer S. Early
queen infection shapes developmental dynamics and induces long-term disease protection
in incipient ant colonies. 2021. doi:10.5061/DRYAD.7PVMCVDTJ
apa: Casillas Perez, B. E., Pull, C., Naiser, F., Naderlinger, E., Matas, J., &
Cremer, S. (2021). Early queen infection shapes developmental dynamics and induces
long-term disease protection in incipient ant colonies. Dryad. https://doi.org/10.5061/DRYAD.7PVMCVDTJ
chicago: Casillas Perez, Barbara E, Christopher Pull, Filip Naiser, Elisabeth Naderlinger,
Jiri Matas, and Sylvia Cremer. “Early Queen Infection Shapes Developmental Dynamics
and Induces Long-Term Disease Protection in Incipient Ant Colonies.” Dryad, 2021.
https://doi.org/10.5061/DRYAD.7PVMCVDTJ.
ieee: B. E. Casillas Perez, C. Pull, F. Naiser, E. Naderlinger, J. Matas, and S.
Cremer, “Early queen infection shapes developmental dynamics and induces long-term
disease protection in incipient ant colonies.” Dryad, 2021.
ista: Casillas Perez BE, Pull C, Naiser F, Naderlinger E, Matas J, Cremer S. 2021.
Early queen infection shapes developmental dynamics and induces long-term disease
protection in incipient ant colonies, Dryad, 10.5061/DRYAD.7PVMCVDTJ.
mla: Casillas Perez, Barbara E., et al. Early Queen Infection Shapes Developmental
Dynamics and Induces Long-Term Disease Protection in Incipient Ant Colonies.
Dryad, 2021, doi:10.5061/DRYAD.7PVMCVDTJ.
short: B.E. Casillas Perez, C. Pull, F. Naiser, E. Naderlinger, J. Matas, S. Cremer,
(2021).
corr_author: '1'
date_created: 2023-05-23T16:14:35Z
date_published: 2021-10-29T00:00:00Z
date_updated: 2025-04-14T13:55:31Z
day: '29'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.5061/DRYAD.7PVMCVDTJ
ec_funded: 1
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.7pvmcvdtj
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 2649B4DE-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '771402'
name: Epidemics in ant societies on a chip
publisher: Dryad
related_material:
record:
- id: '10284'
relation: used_in_publication
status: public
status: public
title: Early queen infection shapes developmental dynamics and induces long-term disease
protection in incipient ant colonies
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '13062'
abstract:
- lang: eng
text: 'This paper analyzes the conditions for local adaptation in a metapopulation
with infinitely many islands under a model of hard selection, where population
size depends on local fitness. Each island belongs to one of two distinct ecological
niches or habitats. Fitness is influenced by an additive trait which is under
habitat-dependent directional selection. Our analysis is based on the diffusion
approximation and accounts for both genetic drift and demographic stochasticity.
By neglecting linkage disequilibria, it yields the joint distribution of allele
frequencies and population size on each island. We find that under hard selection,
the conditions for local adaptation in a rare habitat are more restrictive for
more polygenic traits: even moderate migration load per locus at very many loci
is sufficient for population sizes to decline. This further reduces the efficacy
of selection at individual loci due to increased drift and because smaller populations
are more prone to swamping due to migration, causing a positive feedback between
increasing maladaptation and declining population sizes. Our analysis also highlights
the importance of demographic stochasticity, which exacerbates the decline in
numbers of maladapted populations, leading to population collapse in the rare
habitat at significantly lower migration than predicted by deterministic arguments.'
article_processing_charge: No
author:
- first_name: Eniko
full_name: Szep, Eniko
id: 485BB5A4-F248-11E8-B48F-1D18A9856A87
last_name: Szep
- first_name: Himani
full_name: Sachdeva, Himani
id: 42377A0A-F248-11E8-B48F-1D18A9856A87
last_name: Sachdeva
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Szep E, Sachdeva H, Barton NH. Supplementary code for: Polygenic local adaptation
in metapopulations: A stochastic eco-evolutionary model. 2021. doi:10.5061/DRYAD.8GTHT76P1'
apa: 'Szep, E., Sachdeva, H., & Barton, N. H. (2021). Supplementary code for:
Polygenic local adaptation in metapopulations: A stochastic eco-evolutionary model.
Dryad. https://doi.org/10.5061/DRYAD.8GTHT76P1'
chicago: 'Szep, Eniko, Himani Sachdeva, and Nicholas H Barton. “Supplementary Code
for: Polygenic Local Adaptation in Metapopulations: A Stochastic Eco-Evolutionary
Model.” Dryad, 2021. https://doi.org/10.5061/DRYAD.8GTHT76P1.'
ieee: 'E. Szep, H. Sachdeva, and N. H. Barton, “Supplementary code for: Polygenic
local adaptation in metapopulations: A stochastic eco-evolutionary model.” Dryad,
2021.'
ista: 'Szep E, Sachdeva H, Barton NH. 2021. Supplementary code for: Polygenic local
adaptation in metapopulations: A stochastic eco-evolutionary model, Dryad, 10.5061/DRYAD.8GTHT76P1.'
mla: 'Szep, Eniko, et al. Supplementary Code for: Polygenic Local Adaptation
in Metapopulations: A Stochastic Eco-Evolutionary Model. Dryad, 2021, doi:10.5061/DRYAD.8GTHT76P1.'
short: E. Szep, H. Sachdeva, N.H. Barton, (2021).
corr_author: '1'
date_created: 2023-05-23T16:17:02Z
date_published: 2021-03-02T00:00:00Z
date_updated: 2025-06-12T06:35:39Z
day: '02'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.5061/DRYAD.8GTHT76P1
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.8gtht76p1
month: '03'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '9252'
relation: used_in_publication
status: public
status: public
title: 'Supplementary code for: Polygenic local adaptation in metapopulations: A stochastic
eco-evolutionary model'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '13063'
abstract:
- lang: eng
text: We develop a Bayesian model (BayesRR-RC) that provides robust SNP-heritability
estimation, an alternative to marker discovery, and accurate genomic prediction,
taking 22 seconds per iteration to estimate 8.4 million SNP-effects and 78 SNP-heritability
parameters in the UK Biobank. We find that only $\leq$ 10\% of the genetic variation
captured for height, body mass index, cardiovascular disease, and type 2 diabetes
is attributable to proximal regulatory regions within 10kb upstream of genes,
while 12-25% is attributed to coding regions, 32-44% to introns, and 22-28% to
distal 10-500kb upstream regions. Up to 24% of all cis and coding regions of each
chromosome are associated with each trait, with over 3,100 independent exonic
and intronic regions and over 5,400 independent regulatory regions having >95%
probability of contributing >0.001% to the genetic variance of these four traits.
Our open-source software (GMRM) provides a scalable alternative to current approaches
for biobank data.
article_processing_charge: No
author:
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
citation:
ama: Robinson MR. Probabilistic inference of the genetic architecture of functional
enrichment of complex traits. 2021. doi:10.5061/dryad.sqv9s4n51
apa: Robinson, M. R. (2021). Probabilistic inference of the genetic architecture
of functional enrichment of complex traits. Dryad. https://doi.org/10.5061/dryad.sqv9s4n51
chicago: Robinson, Matthew Richard. “Probabilistic Inference of the Genetic Architecture
of Functional Enrichment of Complex Traits.” Dryad, 2021. https://doi.org/10.5061/dryad.sqv9s4n51.
ieee: M. R. Robinson, “Probabilistic inference of the genetic architecture of functional
enrichment of complex traits.” Dryad, 2021.
ista: Robinson MR. 2021. Probabilistic inference of the genetic architecture of
functional enrichment of complex traits, Dryad, 10.5061/dryad.sqv9s4n51.
mla: Robinson, Matthew Richard. Probabilistic Inference of the Genetic Architecture
of Functional Enrichment of Complex Traits. Dryad, 2021, doi:10.5061/dryad.sqv9s4n51.
short: M.R. Robinson, (2021).
corr_author: '1'
date_created: 2023-05-23T16:20:16Z
date_published: 2021-11-04T00:00:00Z
date_updated: 2025-06-12T06:54:51Z
day: '04'
ddc:
- '570'
department:
- _id: MaRo
doi: 10.5061/dryad.sqv9s4n51
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.sqv9s4n51
month: '11'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
link:
- relation: software
url: https://github.com/medical-genomics-group/gmrm
record:
- id: '8429'
relation: used_in_publication
status: public
status: public
title: Probabilistic inference of the genetic architecture of functional enrichment
of complex traits
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...