---
_id: '12428'
abstract:
- lang: eng
text: The mammary gland consists of a bilayered epithelial structure with an extensively
branched morphology. The majority of this epithelial tree is laid down during
puberty, during which actively proliferating terminal end buds repeatedly elongate
and bifurcate to form the basic structure of the ductal tree. Mammary ducts consist
of a basal and luminal cell layer with a multitude of identified sub-lineages
within both layers. The understanding of how these different cell lineages are
cooperatively driving branching morphogenesis is a problem of crossing multiple
scales, as this requires information on the macroscopic branched structure of
the gland, as well as data on single-cell dynamics driving the morphogenic program.
Here we describe a method to combine genetic lineage tracing with whole-gland
branching analysis. Quantitative data on the global organ structure can be used
to derive a model for mammary gland branching morphogenesis and provide a backbone
on which the dynamics of individual cell lineages can be simulated and compared
to lineage-tracing approaches. Eventually, these quantitative models and experiments
allow to understand the couplings between the macroscopic shape of the mammary
gland and the underlying single-cell dynamics driving branching morphogenesis.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Colinda L.G.J.
full_name: Scheele, Colinda L.G.J.
last_name: Scheele
citation:
ama: 'Hannezo EB, Scheele CLGJ. A Guide Toward Multi-scale and Quantitative Branching
Analysis in the Mammary Gland. In: Margadant C, ed. Cell Migration in Three
Dimensions. Vol 2608. MIMB. Springer Nature; 2023:183-205. doi:10.1007/978-1-0716-2887-4_12'
apa: Hannezo, E. B., & Scheele, C. L. G. J. (2023). A Guide Toward Multi-scale
and Quantitative Branching Analysis in the Mammary Gland. In C. Margadant (Ed.),
Cell Migration in Three Dimensions (Vol. 2608, pp. 183–205). Springer Nature.
https://doi.org/10.1007/978-1-0716-2887-4_12
chicago: Hannezo, Edouard B, and Colinda L.G.J. Scheele. “A Guide Toward Multi-Scale
and Quantitative Branching Analysis in the Mammary Gland.” In Cell Migration
in Three Dimensions, edited by Coert Margadant, 2608:183–205. MIMB. Springer
Nature, 2023. https://doi.org/10.1007/978-1-0716-2887-4_12.
ieee: E. B. Hannezo and C. L. G. J. Scheele, “A Guide Toward Multi-scale and Quantitative
Branching Analysis in the Mammary Gland,” in Cell Migration in Three Dimensions,
vol. 2608, C. Margadant, Ed. Springer Nature, 2023, pp. 183–205.
ista: 'Hannezo EB, Scheele CLGJ. 2023.A Guide Toward Multi-scale and Quantitative
Branching Analysis in the Mammary Gland. In: Cell Migration in Three Dimensions.
Methods in Molecular Biology, vol. 2608, 183–205.'
mla: Hannezo, Edouard B., and Colinda L. G. J. Scheele. “A Guide Toward Multi-Scale
and Quantitative Branching Analysis in the Mammary Gland.” Cell Migration in
Three Dimensions, edited by Coert Margadant, vol. 2608, Springer Nature, 2023,
pp. 183–205, doi:10.1007/978-1-0716-2887-4_12.
short: E.B. Hannezo, C.L.G.J. Scheele, in:, C. Margadant (Ed.), Cell Migration in
Three Dimensions, Springer Nature, 2023, pp. 183–205.
date_created: 2023-01-29T23:00:58Z
date_published: 2023-01-19T00:00:00Z
date_updated: 2023-02-03T10:58:56Z
day: '19'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.1007/978-1-0716-2887-4_12
editor:
- first_name: Coert
full_name: Margadant, Coert
last_name: Margadant
external_id:
pmid:
- '36653709'
file:
- access_level: open_access
checksum: aec1b8d3ba938ddf9d8fcb777f3c38ee
content_type: application/pdf
creator: dernst
date_created: 2023-02-03T10:56:39Z
date_updated: 2023-02-03T10:56:39Z
file_id: '12500'
file_name: 2023_MIMB_Hannezo.pdf
file_size: 826598
relation: main_file
success: 1
file_date_updated: 2023-02-03T10:56:39Z
has_accepted_license: '1'
intvolume: ' 2608'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 183-205
pmid: 1
publication: Cell Migration in Three Dimensions
publication_identifier:
eisbn:
- '9781071628874'
eissn:
- 1940-6029
isbn:
- '9781071628867'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: MIMB
status: public
title: A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary
Gland
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: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2608
year: '2023'
...
---
_id: '12534'
abstract:
- lang: eng
text: Brownian motion of a mobile impurity in a bath is affected by spin-orbit coupling
(SOC). Here, we discuss a Caldeira-Leggett-type model that can be used to propose
and interpret quantum simulators of this problem in cold Bose gases. First, we
derive a master equation that describes the model and explore it in a one-dimensional
(1D) setting. To validate the standard assumptions needed for our derivation,
we analyze available experimental data without SOC; as a byproduct, this analysis
suggests that the quench dynamics of the impurity is beyond the 1D Bose-polaron
approach at temperatures currently accessible in a cold-atom laboratory—motion
of the impurity is mainly driven by dissipation. For systems with SOC, we demonstrate
that 1D spin-orbit coupling can be gauged out even in the presence of dissipation—the
information about SOC is incorporated in the initial conditions. Observables sensitive
to this information (such as spin densities) can be used to study formation of
steady spin polarization domains during quench dynamics.
acknowledgement: "We thank Rafael Barfknecht for help at the initial stages of this
project; Fabian Brauneis for useful discussions; Miguel A. Garcia-March, Georgios
Koutentakis, and Simeon Mistakidis\r\nfor comments on the paper. M.L. acknowledges
support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON)."
article_number: '013029'
article_processing_charge: No
article_type: original
author:
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: Alberto
full_name: Cappellaro, Alberto
id: 9d13b3cb-30a2-11eb-80dc-f772505e8660
last_name: Cappellaro
orcid: 0000-0001-6110-2359
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Artem
full_name: Volosniev, Artem
id: 37D278BC-F248-11E8-B48F-1D18A9856A87
last_name: Volosniev
orcid: 0000-0003-0393-5525
citation:
ama: Ghazaryan A, Cappellaro A, Lemeshko M, Volosniev A. Dissipative dynamics of
an impurity with spin-orbit coupling. Physical Review Research. 2023;5(1).
doi:10.1103/physrevresearch.5.013029
apa: Ghazaryan, A., Cappellaro, A., Lemeshko, M., & Volosniev, A. (2023). Dissipative
dynamics of an impurity with spin-orbit coupling. Physical Review Research.
American Physical Society. https://doi.org/10.1103/physrevresearch.5.013029
chicago: Ghazaryan, Areg, Alberto Cappellaro, Mikhail Lemeshko, and Artem Volosniev.
“Dissipative Dynamics of an Impurity with Spin-Orbit Coupling.” Physical Review
Research. American Physical Society, 2023. https://doi.org/10.1103/physrevresearch.5.013029.
ieee: A. Ghazaryan, A. Cappellaro, M. Lemeshko, and A. Volosniev, “Dissipative dynamics
of an impurity with spin-orbit coupling,” Physical Review Research, vol.
5, no. 1. American Physical Society, 2023.
ista: Ghazaryan A, Cappellaro A, Lemeshko M, Volosniev A. 2023. Dissipative dynamics
of an impurity with spin-orbit coupling. Physical Review Research. 5(1), 013029.
mla: Ghazaryan, Areg, et al. “Dissipative Dynamics of an Impurity with Spin-Orbit
Coupling.” Physical Review Research, vol. 5, no. 1, 013029, American Physical
Society, 2023, doi:10.1103/physrevresearch.5.013029.
short: A. Ghazaryan, A. Cappellaro, M. Lemeshko, A. Volosniev, Physical Review Research
5 (2023).
date_created: 2023-02-10T09:02:26Z
date_published: 2023-01-20T00:00:00Z
date_updated: 2023-02-20T07:02:00Z
day: '20'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1103/physrevresearch.5.013029
ec_funded: 1
file:
- access_level: open_access
checksum: 6068b62874c0099628a108bb9c5c6bd2
content_type: application/pdf
creator: dernst
date_created: 2023-02-13T10:38:10Z
date_updated: 2023-02-13T10:38:10Z
file_id: '12546'
file_name: 2023_PhysicalReviewResearch_Ghazaryan.pdf
file_size: 865150
relation: main_file
success: 1
file_date_updated: 2023-02-13T10:38:10Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
publication: Physical Review Research
publication_identifier:
issn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dissipative dynamics of an impurity with spin-orbit coupling
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: 5
year: '2023'
...
---
_id: '12158'
abstract:
- lang: eng
text: 'Post-translational histone modifications modulate chromatin activity to affect
gene expression. How chromatin states underlie lineage choice in single cells
is relatively unexplored. We develop sort-assisted single-cell chromatin immunocleavage
(sortChIC) and map active (H3K4me1 and H3K4me3) and repressive (H3K27me3 and H3K9me3)
histone modifications in the mouse bone marrow. During differentiation, hematopoietic
stem and progenitor cells (HSPCs) acquire active chromatin states mediated by
cell-type-specifying transcription factors, which are unique for each lineage.
By contrast, most alterations in repressive marks during differentiation occur
independent of the final cell type. Chromatin trajectory analysis shows that lineage
choice at the chromatin level occurs at the progenitor stage. Joint profiling
of H3K4me1 and H3K9me3 demonstrates that cell types within the myeloid lineage
have distinct active chromatin but share similar myeloid-specific heterochromatin
states. This implies a hierarchical regulation of chromatin during hematopoiesis:
heterochromatin dynamics distinguish differentiation trajectories and lineages,
while euchromatin dynamics reflect cell types within lineages.'
acknowledgement: We thank A. Giladi for sharing mRNA abundance tables of cell types
together with J. van den Berg for critical reading of the manuscript. We thank M.
Bartosovic for sharing method comparison data. pK19pA-MN was a gift from Ulrich
Laemmli (Addgene plasmid 86973, http://n2t.net/addgene:86973; RRID:Addgene_86973).
Figure 8 is adopted from Hematopoiesis (human) diagram by A. Rad and M. Häggström
under CC-BY-SA 3.0 license. This work was supported by European Research Council
Advanced under grant ERC-AdG 742225-IntScOmics and Nederlandse Organisatie voor
Wetenschappelijk Onderzoek (NWO) TOP award NWO-CW 714.016.001. The SNF (P2BSP3-174991),
HFSP (LT000209/2018-L) and Marie Skłodowska-Curie Actions (798573) supported P.Z.
The SNF (P2ELP3_184488) and HFSP (LT000097/2019-L) supported J.Y. and the EMBO LTF
(ALTF 1197–2019) supported V.B. This work is part of the Oncode Institute, which
is partly financed by the Dutch Cancer Society. The funders had no role in study
design, data collection and analysis, decision to publish or preparation of the
manuscript.
article_processing_charge: No
article_type: review
author:
- first_name: Peter
full_name: Zeller, Peter
last_name: Zeller
- first_name: Jake
full_name: Yeung, Jake
id: 123012b2-db30-11eb-b4d8-a35840c0551b
last_name: Yeung
orcid: 0000-0003-1732-1559
- first_name: Helena
full_name: Viñas Gaza, Helena
last_name: Viñas Gaza
- first_name: Buys Anton
full_name: de Barbanson, Buys Anton
last_name: de Barbanson
- first_name: Vivek
full_name: Bhardwaj, Vivek
last_name: Bhardwaj
- first_name: Maria
full_name: Florescu, Maria
last_name: Florescu
- first_name: Reinier
full_name: van der Linden, Reinier
last_name: van der Linden
- first_name: Alexander
full_name: van Oudenaarden, Alexander
last_name: van Oudenaarden
citation:
ama: Zeller P, Yeung J, Viñas Gaza H, et al. Single-cell sortChIC identifies hierarchical
chromatin dynamics during hematopoiesis. Nature Genetics. 2023;55:333-345.
doi:10.1038/s41588-022-01260-3
apa: Zeller, P., Yeung, J., Viñas Gaza, H., de Barbanson, B. A., Bhardwaj, V., Florescu,
M., … van Oudenaarden, A. (2023). Single-cell sortChIC identifies hierarchical
chromatin dynamics during hematopoiesis. Nature Genetics. Springer Nature.
https://doi.org/10.1038/s41588-022-01260-3
chicago: Zeller, Peter, Jake Yeung, Helena Viñas Gaza, Buys Anton de Barbanson,
Vivek Bhardwaj, Maria Florescu, Reinier van der Linden, and Alexander van Oudenaarden.
“Single-Cell SortChIC Identifies Hierarchical Chromatin Dynamics during Hematopoiesis.”
Nature Genetics. Springer Nature, 2023. https://doi.org/10.1038/s41588-022-01260-3.
ieee: P. Zeller et al., “Single-cell sortChIC identifies hierarchical chromatin
dynamics during hematopoiesis,” Nature Genetics, vol. 55. Springer Nature,
pp. 333–345, 2023.
ista: Zeller P, Yeung J, Viñas Gaza H, de Barbanson BA, Bhardwaj V, Florescu M,
van der Linden R, van Oudenaarden A. 2023. Single-cell sortChIC identifies hierarchical
chromatin dynamics during hematopoiesis. Nature Genetics. 55, 333–345.
mla: Zeller, Peter, et al. “Single-Cell SortChIC Identifies Hierarchical Chromatin
Dynamics during Hematopoiesis.” Nature Genetics, vol. 55, Springer Nature,
2023, pp. 333–45, doi:10.1038/s41588-022-01260-3.
short: P. Zeller, J. Yeung, H. Viñas Gaza, B.A. de Barbanson, V. Bhardwaj, M. Florescu,
R. van der Linden, A. van Oudenaarden, Nature Genetics 55 (2023) 333–345.
date_created: 2023-01-12T12:09:09Z
date_published: 2023-02-01T00:00:00Z
date_updated: 2023-02-27T07:48:24Z
day: '01'
ddc:
- '570'
- '000'
department:
- _id: ScienComp
doi: 10.1038/s41588-022-01260-3
file:
- access_level: open_access
checksum: 6fdb8e34fbeea63edd0f2c6c2cc5823e
content_type: application/pdf
creator: dernst
date_created: 2023-02-27T07:46:45Z
date_updated: 2023-02-27T07:46:45Z
file_id: '12688'
file_name: 2023_NatureGenetics_Zeller.pdf
file_size: 21484855
relation: main_file
success: 1
file_date_updated: 2023-02-27T07:46:45Z
has_accepted_license: '1'
intvolume: ' 55'
keyword:
- Genetics
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 333-345
publication: Nature Genetics
publication_identifier:
eissn:
- 1546-1718
issn:
- 1061-4036
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis
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: 55
year: '2023'
...
---
_id: '12676'
abstract:
- lang: eng
text: Turn-based stochastic games (aka simple stochastic games) are two-player zero-sum
games played on directed graphs with probabilistic transitions. The goal of player-max
is to maximize the probability to reach a target state against the adversarial
player-min. These games lie in NP ∩ coNP and are among the rare combinatorial
problems that belong to this complexity class for which the existence of polynomial-time
algorithm is a major open question. While randomized sub-exponential time algorithm
exists, all known deterministic algorithms require exponential time in the worst-case.
An important open question has been whether faster algorithms can be obtained
parametrized by the treewidth of the game graph. Even deterministic sub-exponential
time algorithm for constant treewidth turn-based stochastic games has remain elusive.
In this work our main result is a deterministic algorithm to solve turn-based
stochastic games that, given a game with n states, treewidth at most t, and the
bit-complexity of the probabilistic transition function log D, has running time
O ((tn2 log D)t log n). In particular, our algorithm is quasi-polynomial time
for games with constant or poly-logarithmic treewidth.
acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt)
grant.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Raimundo J
full_name: Saona Urmeneta, Raimundo J
id: BD1DF4C4-D767-11E9-B658-BC13E6697425
last_name: Saona Urmeneta
orcid: 0000-0001-5103-038X
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
citation:
ama: 'Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. Faster algorithm
for turn-based stochastic games with bounded treewidth. In: Proceedings of
the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial
and Applied Mathematics; 2023:4590-4605. doi:10.1137/1.9781611977554.ch173'
apa: 'Chatterjee, K., Meggendorfer, T., Saona Urmeneta, R. J., & Svoboda, J.
(2023). Faster algorithm for turn-based stochastic games with bounded treewidth.
In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
(pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics.
https://doi.org/10.1137/1.9781611977554.ch173'
chicago: Chatterjee, Krishnendu, Tobias Meggendorfer, Raimundo J Saona Urmeneta,
and Jakub Svoboda. “Faster Algorithm for Turn-Based Stochastic Games with Bounded
Treewidth.” In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete
Algorithms, 4590–4605. Society for Industrial and Applied Mathematics, 2023.
https://doi.org/10.1137/1.9781611977554.ch173.
ieee: K. Chatterjee, T. Meggendorfer, R. J. Saona Urmeneta, and J. Svoboda, “Faster
algorithm for turn-based stochastic games with bounded treewidth,” in Proceedings
of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy,
2023, pp. 4590–4605.
ista: 'Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. 2023. Faster
algorithm for turn-based stochastic games with bounded treewidth. Proceedings
of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium
on Discrete Algorithms, 4590–4605.'
mla: Chatterjee, Krishnendu, et al. “Faster Algorithm for Turn-Based Stochastic
Games with Bounded Treewidth.” Proceedings of the 2023 Annual ACM-SIAM Symposium
on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023,
pp. 4590–605, doi:10.1137/1.9781611977554.ch173.
short: K. Chatterjee, T. Meggendorfer, R.J. Saona Urmeneta, J. Svoboda, in:, Proceedings
of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial
and Applied Mathematics, 2023, pp. 4590–4605.
conference:
end_date: 2023-01-25
location: Florence, Italy
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2023-01-22
date_created: 2023-02-24T12:20:47Z
date_published: 2023-02-01T00:00:00Z
date_updated: 2023-02-27T09:01:16Z
day: '01'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1137/1.9781611977554.ch173
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1137/1.9781611977554.ch173
month: '02'
oa: 1
oa_version: Published Version
page: 4590-4605
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- '9781611977554'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
status: public
title: Faster algorithm for turn-based stochastic games with bounded treewidth
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12735'
abstract:
- lang: eng
text: "Asynchronous programming has gained significant popularity over the last
decade: support for this programming pattern is available in many popular languages
via libraries and native language implementations, typically in the form of coroutines
or the async/await construct. Instead of programming via shared memory, this concept
assumes implicit synchronization through message passing. The key data structure
enabling such communication is the rendezvous channel. Roughly, a rendezvous channel
is a blocking queue of size zero, so both send(e) and receive() operations wait
for each other, performing a rendezvous when they meet. To optimize the message
passing pattern, channels are usually equipped with a fixed-size buffer, so sends
do not suspend and put elements into the buffer until its capacity is exceeded.
This primitive is known as a buffered channel.\r\n\r\nThis paper presents a fast
and scalable algorithm for both rendezvous and buffered channels. Similarly to
modern queues, our solution is based on an infinite array with two positional
counters for send(e) and receive() operations, leveraging the unconditional Fetch-And-Add
instruction to update them. Yet, the algorithm requires non-trivial modifications
of this classic pattern, in order to support the full channel semantics, such
as buffering and cancellation of waiting requests. We compare the performance
of our solution to that of the Kotlin implementation, as well as against other
academic proposals, showing up to 9.8× speedup. To showcase its expressiveness
and performance, we also integrated the proposed algorithm into the standard Kotlin
Coroutines library, replacing the previous channel implementations."
article_processing_charge: No
author:
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
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
- first_name: Roman
full_name: Elizarov, Roman
last_name: Elizarov
citation:
ama: 'Koval N, Alistarh D-A, Elizarov R. Fast and scalable channels in Kotlin Coroutines.
In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming. Association for Computing Machinery; 2023:107-118. doi:10.1145/3572848.3577481'
apa: 'Koval, N., Alistarh, D.-A., & Elizarov, R. (2023). Fast and scalable channels
in Kotlin Coroutines. In Proceedings of the ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming (pp. 107–118). Montreal, QC, Canada:
Association for Computing Machinery. https://doi.org/10.1145/3572848.3577481'
chicago: Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Fast and Scalable
Channels in Kotlin Coroutines.” In Proceedings of the ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming, 107–18. Association for
Computing Machinery, 2023. https://doi.org/10.1145/3572848.3577481.
ieee: N. Koval, D.-A. Alistarh, and R. Elizarov, “Fast and scalable channels in
Kotlin Coroutines,” in Proceedings of the ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming, Montreal, QC, Canada, 2023, pp. 107–118.
ista: 'Koval N, Alistarh D-A, Elizarov R. 2023. Fast and scalable channels in Kotlin
Coroutines. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice
of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel
Programming, 107–118.'
mla: Koval, Nikita, et al. “Fast and Scalable Channels in Kotlin Coroutines.” Proceedings
of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,
Association for Computing Machinery, 2023, pp. 107–18, doi:10.1145/3572848.3577481.
short: N. Koval, D.-A. Alistarh, R. Elizarov, in:, Proceedings of the ACM SIGPLAN
Symposium on Principles and Practice of Parallel Programming, Association for
Computing Machinery, 2023, pp. 107–118.
conference:
end_date: 2023-03-01
location: Montreal, QC, Canada
name: 'PPoPP: Sympopsium on Principles and Practice of Parallel Programming'
start_date: 2023-02-25
date_created: 2023-03-19T23:00:58Z
date_published: 2023-02-25T00:00:00Z
date_updated: 2023-03-20T07:29:28Z
day: '25'
department:
- _id: DaAl
doi: 10.1145/3572848.3577481
external_id:
arxiv:
- '2211.04986'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2211.04986
month: '02'
oa: 1
oa_version: Preprint
page: 107-118
publication: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming
publication_identifier:
isbn:
- '9798400700156'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fast and scalable channels in Kotlin Coroutines
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...