---
_id: '12330'
abstract:
- lang: eng
text: 'The design and implementation of efficient concurrent data structures has
seen significant attention. However, most of this work has focused on concurrent
data structures providing good worst-case guarantees, although, in real workloads,
objects are often accessed at different rates. Efficient distribution-adaptive
data structures, such as splay-trees, are known in the sequential case; however,
they often are hard to translate efficiently to the concurrent case. We investigate
distribution-adaptive concurrent data structures, and propose a new design called
the splay-list. At a high level, the splay-list is similar to a standard skip-list,
with the key distinction that the height of each element adapts dynamically to
its access rate: popular elements “move up,” whereas rarely-accessed elements
decrease in height. We show that the splay-list provides order-optimal amortized
complexity bounds for a subset of operations, while being amenable to efficient
concurrent implementation. Experiments show that the splay-list can leverage distribution-adaptivity
for performance, and can outperform the only previously-known distribution-adaptive
concurrent design in certain workloads.'
article_processing_charge: No
article_type: original
author:
- first_name: Vitalii
full_name: Aksenov, Vitalii
id: 2980135A-F248-11E8-B48F-1D18A9856A87
last_name: Aksenov
- 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: Alexandra
full_name: Drozdova, Alexandra
last_name: Drozdova
- first_name: Amirkeivan
full_name: Mohtashami, Amirkeivan
last_name: Mohtashami
citation:
ama: 'Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive
concurrent skip-list. Distributed Computing. 2023;36:395-418. doi:10.1007/s00446-022-00441-x'
apa: 'Aksenov, V., Alistarh, D.-A., Drozdova, A., & Mohtashami, A. (2023). The
splay-list: A distribution-adaptive concurrent skip-list. Distributed Computing.
Springer Nature. https://doi.org/10.1007/s00446-022-00441-x'
chicago: 'Aksenov, Vitalii, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan
Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” Distributed
Computing. Springer Nature, 2023. https://doi.org/10.1007/s00446-022-00441-x.'
ieee: 'V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list:
A distribution-adaptive concurrent skip-list,” Distributed Computing, vol.
36. Springer Nature, pp. 395–418, 2023.'
ista: 'Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2023. The splay-list:
A distribution-adaptive concurrent skip-list. Distributed Computing. 36, 395–418.'
mla: 'Aksenov, Vitalii, et al. “The Splay-List: A Distribution-Adaptive Concurrent
Skip-List.” Distributed Computing, vol. 36, Springer Nature, 2023, pp.
395–418, doi:10.1007/s00446-022-00441-x.'
short: V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, Distributed Computing
36 (2023) 395–418.
date_created: 2023-01-22T23:00:55Z
date_published: 2023-09-01T00:00:00Z
date_updated: 2023-08-14T12:54:32Z
day: '01'
department:
- _id: DaAl
doi: 10.1007/s00446-022-00441-x
external_id:
arxiv:
- '2008.01009'
isi:
- '000913424000001'
intvolume: ' 36'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2008.01009
month: '09'
oa: 1
oa_version: Preprint
page: 395-418
publication: Distributed Computing
publication_identifier:
eissn:
- 1432-0452
issn:
- 0178-2770
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The splay-list: A distribution-adaptive concurrent skip-list'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2023'
...
---
_id: '12159'
abstract:
- lang: eng
text: The term “haplotype block” is commonly used in the developing field of haplotype-based
inference methods. We argue that the term should be defined based on the structure
of the Ancestral Recombination Graph (ARG), which contains complete information
on the ancestry of a sample. We use simulated examples to demonstrate key features
of the relationship between haplotype blocks and ancestral structure, emphasizing
the stochasticity of the processes that generate them. Even the simplest cases
of neutrality or of a “hard” selective sweep produce a rich structure, often missed
by commonly used statistics. We highlight a number of novel methods for inferring
haplotype structure, based on the full ARG, or on a sequence of trees, and illustrate
how they can be used to define haplotype blocks using an empirical data set. While
the advent of new, computationally efficient methods makes it possible to apply
these concepts broadly, they (and additional new methods) could benefit from adding
features to explore haplotype blocks, as we define them. Understanding and applying
the concept of the haplotype block will be essential to fully exploit long and
linked-read sequencing technologies.
acknowledgement: 'We thank the Barton group for useful discussion and feedback during
the writing of this article. Comments from Roger Butlin, Molly Schumer''s Group,
the tskit development team, editors and three reviewers greatly improved the manuscript.
Funding was provided by SCAS (Natural Sciences Programme, Knut and Alice Wallenberg
Foundation), an FWF Wittgenstein grant (PT1001Z211), an FWF standalone grant (grant
P 32166), and an ERC Advanced Grant. YFC was supported by the Max Planck Society
and an ERC Proof of Concept Grant #101069216 (HAPLOTAGGING).'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Daria
full_name: Shipilina, Daria
id: 428A94B0-F248-11E8-B48F-1D18A9856A87
last_name: Shipilina
orcid: 0000-0002-1145-9226
- first_name: Arka
full_name: Pal, Arka
id: 6AAB2240-CA9A-11E9-9C1A-D9D1E5697425
last_name: Pal
orcid: 0000-0002-4530-8469
- first_name: Sean
full_name: Stankowski, Sean
id: 43161670-5719-11EA-8025-FABC3DDC885E
last_name: Stankowski
- first_name: Yingguang Frank
full_name: Chan, Yingguang Frank
last_name: Chan
- 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: Shipilina D, Pal A, Stankowski S, Chan YF, Barton NH. On the origin and structure
of haplotype blocks. Molecular Ecology. 2023;32(6):1441-1457. doi:10.1111/mec.16793
apa: Shipilina, D., Pal, A., Stankowski, S., Chan, Y. F., & Barton, N. H. (2023).
On the origin and structure of haplotype blocks. Molecular Ecology. Wiley.
https://doi.org/10.1111/mec.16793
chicago: Shipilina, Daria, Arka Pal, Sean Stankowski, Yingguang Frank Chan, and
Nicholas H Barton. “On the Origin and Structure of Haplotype Blocks.” Molecular
Ecology. Wiley, 2023. https://doi.org/10.1111/mec.16793.
ieee: D. Shipilina, A. Pal, S. Stankowski, Y. F. Chan, and N. H. Barton, “On the
origin and structure of haplotype blocks,” Molecular Ecology, vol. 32,
no. 6. Wiley, pp. 1441–1457, 2023.
ista: Shipilina D, Pal A, Stankowski S, Chan YF, Barton NH. 2023. On the origin
and structure of haplotype blocks. Molecular Ecology. 32(6), 1441–1457.
mla: Shipilina, Daria, et al. “On the Origin and Structure of Haplotype Blocks.”
Molecular Ecology, vol. 32, no. 6, Wiley, 2023, pp. 1441–57, doi:10.1111/mec.16793.
short: D. Shipilina, A. Pal, S. Stankowski, Y.F. Chan, N.H. Barton, Molecular Ecology
32 (2023) 1441–1457.
date_created: 2023-01-12T12:09:17Z
date_published: 2023-03-01T00:00:00Z
date_updated: 2023-08-16T08:18:47Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1111/mec.16793
external_id:
isi:
- '000900762000001'
pmid:
- '36433653'
file:
- access_level: open_access
checksum: b10e0f8fa3dc4d72aaf77a557200978a
content_type: application/pdf
creator: dernst
date_created: 2023-08-16T08:15:41Z
date_updated: 2023-08-16T08:15:41Z
file_id: '14062'
file_name: 2023_MolecularEcology_Shipilina.pdf
file_size: 7144607
relation: main_file
success: 1
file_date_updated: 2023-08-16T08:15:41Z
has_accepted_license: '1'
intvolume: ' 32'
isi: 1
issue: '6'
keyword:
- Genetics
- Ecology
- Evolution
- Behavior and Systematics
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 1441-1457
pmid: 1
project:
- _id: 05959E1C-7A3F-11EA-A408-12923DDC885E
grant_number: P32166
name: The maintenance of alternative adaptive peaks in snapdragons
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: bd6958e0-d553-11ed-ba76-86eba6a76c00
grant_number: '101055327'
name: Understanding the evolution of continuous genomes
publication: Molecular Ecology
publication_identifier:
eissn:
- 1365-294X
issn:
- 0962-1083
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the origin and structure of haplotype blocks
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: 32
year: '2023'
...
---
_id: '12114'
abstract:
- lang: eng
text: 'Probing the dynamics of aromatic side chains provides important insights
into the behavior of a protein because flips of aromatic rings in a protein’s
hydrophobic core report on breathing motion involving a large part of the protein.
Inherently invisible to crystallography, aromatic motions have been primarily
studied by solution NMR. The question how packing of proteins in crystals affects
ring flips has, thus, remained largely unexplored. Here we apply magic-angle spinning
NMR, advanced phenylalanine 1H-13C/2H isotope labeling and MD simulation to a
protein in three different crystal packing environments to shed light onto possible
impact of packing on ring flips. The flips of the two Phe residues in ubiquitin,
both surface exposed, appear remarkably conserved in the different crystal forms,
even though the intermolecular packing is quite different: Phe4 flips on a ca.
10–20 ns time scale, and Phe45 are broadened in all crystals, presumably due to
µs motion. Our findings suggest that intramolecular influences are more important
for ring flips than intermolecular (packing) effects.'
acknowledgement: The NMR platform in Grenoble is part of the Grenoble Instruct-ERIC
center (ISBG; UAR 3518 CNRS-CEA-UGA-EMBL) within the Grenoble Partnership for Structural
Biology (PSB), supported by FRISBI (ANR-10-INBS-0005-02) and GRAL, financed within
the University Grenoble Alpes graduate school (Ecoles Universitaires de Recherche)
CBH-EUR-GS (ANR-17-EURE-0003). This work was supported by the European Research
Council (StG-2012-311318-ProtDyn2Function to P.S.) and used the platforms of the
Grenoble Instruct Center (ISBG; UMS 3518 CNRS-CEA-UJF-EMBL) with support from FRISBI
(ANR-10-INSB-05–02) and GRAL (ANR-10-LABX-49–01) within the Grenoble Partnership
for Structural Biology (PSB). We would like to thank Sergei Izmailov for developing
and maintaining the pyxmolpp2 library. N.R.S. acknowledges support from St. Petersburg
State University in a form of the grant 92425251 and the access to the MRR, MCT
and CAMR resource centers. P.S. thanks Malcolm Levitt for pointing out the fact
that “tensor asymmetry” is better called “tensor biaxiality”.
article_number: '100079'
article_processing_charge: No
article_type: original
author:
- first_name: Diego F.
full_name: Gauto, Diego F.
last_name: Gauto
- first_name: Olga O.
full_name: Lebedenko, Olga O.
last_name: Lebedenko
- first_name: Lea Marie
full_name: Becker, Lea Marie
id: 36336939-eb97-11eb-a6c2-c83f1214ca79
last_name: Becker
orcid: 0000-0002-6401-5151
- first_name: Isabel
full_name: Ayala, Isabel
last_name: Ayala
- first_name: Roman
full_name: Lichtenecker, Roman
last_name: Lichtenecker
- first_name: Nikolai R.
full_name: Skrynnikov, Nikolai R.
last_name: Skrynnikov
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
citation:
ama: 'Gauto DF, Lebedenko OO, Becker LM, et al. Aromatic ring flips in differently
packed ubiquitin protein crystals from MAS NMR and MD. Journal of Structural
Biology: X. 2023;7. doi:10.1016/j.yjsbx.2022.100079'
apa: 'Gauto, D. F., Lebedenko, O. O., Becker, L. M., Ayala, I., Lichtenecker, R.,
Skrynnikov, N. R., & Schanda, P. (2023). Aromatic ring flips in differently
packed ubiquitin protein crystals from MAS NMR and MD. Journal of Structural
Biology: X. Elsevier. https://doi.org/10.1016/j.yjsbx.2022.100079'
chicago: 'Gauto, Diego F., Olga O. Lebedenko, Lea Marie Becker, Isabel Ayala, Roman
Lichtenecker, Nikolai R. Skrynnikov, and Paul Schanda. “Aromatic Ring Flips in
Differently Packed Ubiquitin Protein Crystals from MAS NMR and MD.” Journal
of Structural Biology: X. Elsevier, 2023. https://doi.org/10.1016/j.yjsbx.2022.100079.'
ieee: 'D. F. Gauto et al., “Aromatic ring flips in differently packed ubiquitin
protein crystals from MAS NMR and MD,” Journal of Structural Biology: X,
vol. 7. Elsevier, 2023.'
ista: 'Gauto DF, Lebedenko OO, Becker LM, Ayala I, Lichtenecker R, Skrynnikov NR,
Schanda P. 2023. Aromatic ring flips in differently packed ubiquitin protein crystals
from MAS NMR and MD. Journal of Structural Biology: X. 7, 100079.'
mla: 'Gauto, Diego F., et al. “Aromatic Ring Flips in Differently Packed Ubiquitin
Protein Crystals from MAS NMR and MD.” Journal of Structural Biology: X,
vol. 7, 100079, Elsevier, 2023, doi:10.1016/j.yjsbx.2022.100079.'
short: 'D.F. Gauto, O.O. Lebedenko, L.M. Becker, I. Ayala, R. Lichtenecker, N.R.
Skrynnikov, P. Schanda, Journal of Structural Biology: X 7 (2023).'
date_created: 2023-01-12T11:55:38Z
date_published: 2023-01-01T00:00:00Z
date_updated: 2023-08-16T09:37:25Z
day: '01'
ddc:
- '570'
department:
- _id: PaSc
doi: 10.1016/j.yjsbx.2022.100079
external_id:
pmid:
- '36578472'
file:
- access_level: open_access
checksum: b4b1c10a31018aafe053b7d55a470e54
content_type: application/pdf
creator: dernst
date_created: 2023-08-16T09:36:28Z
date_updated: 2023-08-16T09:36:28Z
file_id: '14064'
file_name: 2023_JourStrucBiologyX_Gauto.pdf
file_size: 5132322
relation: main_file
success: 1
file_date_updated: 2023-08-16T09:36:28Z
has_accepted_license: '1'
intvolume: ' 7'
keyword:
- Structural Biology
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '01'
oa: 1
oa_version: Published Version
pmid: 1
publication: 'Journal of Structural Biology: X'
publication_identifier:
issn:
- 2590-1524
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Aromatic ring flips in differently packed ubiquitin protein crystals from MAS
NMR and MD
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2023'
...
---
_id: '12163'
abstract:
- lang: eng
text: Small GTPases play essential roles in the organization of eukaryotic cells.
In recent years, it has become clear that their intracellular functions result
from intricate biochemical networks of the GTPase and their regulators that dynamically
bind to a membrane surface. Due to the inherent complexities of their interactions,
however, revealing the underlying mechanisms of action is often difficult to achieve
from in vivo studies. This review summarizes in vitro reconstitution approaches
developed to obtain a better mechanistic understanding of how small GTPase activities
are regulated in space and time.
acknowledgement: The authors acknowledge support from IST Austria and helpful comments
from the anonymous reviewers that helped to improve this manuscript. We apologize
to the authors of primary literature and outstanding research not cited here due
to space restraints.
article_processing_charge: Yes (via OA deal)
article_type: review
author:
- first_name: Martin
full_name: Loose, Martin
id: 462D4284-F248-11E8-B48F-1D18A9856A87
last_name: Loose
orcid: 0000-0001-7309-9724
- first_name: Albert
full_name: Auer, Albert
id: 3018E8C2-F248-11E8-B48F-1D18A9856A87
last_name: Auer
orcid: 0000-0002-3580-2906
- first_name: Gabriel
full_name: Brognara, Gabriel
id: D96FFDA0-A884-11E9-9968-DC26E6697425
last_name: Brognara
- first_name: Hanifatul R
full_name: Budiman, Hanifatul R
id: 55380f95-15b2-11ec-abd3-aff8e230696b
last_name: Budiman
- first_name: Lukasz M
full_name: Kowalski, Lukasz M
id: e3a512e2-4bbe-11eb-a68a-e3857a7844c2
last_name: Kowalski
- first_name: Ivana
full_name: Matijevic, Ivana
id: 83c17ce3-15b2-11ec-abd3-f486545870bd
last_name: Matijevic
citation:
ama: Loose M, Auer A, Brognara G, Budiman HR, Kowalski LM, Matijevic I. In vitro
reconstitution of small GTPase regulation. FEBS Letters. 2023;597(6):762-777.
doi:10.1002/1873-3468.14540
apa: Loose, M., Auer, A., Brognara, G., Budiman, H. R., Kowalski, L. M., & Matijevic,
I. (2023). In vitro reconstitution of small GTPase regulation. FEBS Letters.
Wiley. https://doi.org/10.1002/1873-3468.14540
chicago: Loose, Martin, Albert Auer, Gabriel Brognara, Hanifatul R Budiman, Lukasz
M Kowalski, and Ivana Matijevic. “In Vitro Reconstitution of Small GTPase Regulation.”
FEBS Letters. Wiley, 2023. https://doi.org/10.1002/1873-3468.14540.
ieee: M. Loose, A. Auer, G. Brognara, H. R. Budiman, L. M. Kowalski, and I. Matijevic,
“In vitro reconstitution of small GTPase regulation,” FEBS Letters, vol.
597, no. 6. Wiley, pp. 762–777, 2023.
ista: Loose M, Auer A, Brognara G, Budiman HR, Kowalski LM, Matijevic I. 2023. In
vitro reconstitution of small GTPase regulation. FEBS Letters. 597(6), 762–777.
mla: Loose, Martin, et al. “In Vitro Reconstitution of Small GTPase Regulation.”
FEBS Letters, vol. 597, no. 6, Wiley, 2023, pp. 762–77, doi:10.1002/1873-3468.14540.
short: M. Loose, A. Auer, G. Brognara, H.R. Budiman, L.M. Kowalski, I. Matijevic,
FEBS Letters 597 (2023) 762–777.
date_created: 2023-01-12T12:09:58Z
date_published: 2023-03-01T00:00:00Z
date_updated: 2023-08-16T08:32:29Z
day: '01'
ddc:
- '570'
department:
- _id: MaLo
doi: 10.1002/1873-3468.14540
external_id:
isi:
- '000891573000001'
pmid:
- '36448231'
file:
- access_level: open_access
checksum: 7492244d3f9c5faa1347ef03f6e5bc84
content_type: application/pdf
creator: dernst
date_created: 2023-08-16T08:31:04Z
date_updated: 2023-08-16T08:31:04Z
file_id: '14063'
file_name: 2023_FEBSLetters_Loose.pdf
file_size: 3148143
relation: main_file
success: 1
file_date_updated: 2023-08-16T08:31:04Z
has_accepted_license: '1'
intvolume: ' 597'
isi: 1
issue: '6'
keyword:
- Cell Biology
- Genetics
- Molecular Biology
- Biochemistry
- Structural Biology
- Biophysics
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 762-777
pmid: 1
publication: FEBS Letters
publication_identifier:
eissn:
- 1873-3468
issn:
- 0014-5793
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: In vitro reconstitution of small GTPase regulation
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 597
year: '2023'
...
---
_id: '12164'
abstract:
- lang: eng
text: 'A shared-memory counter is a widely-used and well-studied concurrent object.
It supports two operations: An Inc operation that increases its value by 1 and
a Read operation that returns its current value. In Jayanti et al (SIAM J Comput,
30(2), 2000), Jayanti, Tan and Toueg proved a linear lower bound on the worst-case
step complexity of obstruction-free implementations, from read-write registers,
of a large class of shared objects that includes counters. The lower bound leaves
open the question of finding counter implementations with sub-linear amortized
step complexity. In this work, we address this gap. We show that n-process, wait-free
and linearizable counters can be implemented from read-write registers with O(log2n)
amortized step complexity. This is the first counter algorithm from read-write
registers that provides sub-linear amortized step complexity in executions of
arbitrary length. Since a logarithmic lower bound on the amortized step complexity
of obstruction-free counter implementations exists, our upper bound is within
a logarithmic factor of the optimal. The worst-case step complexity of the construction
remains linear, which is optimal. This is obtained thanks to a new max register
construction with O(logn) amortized step complexity in executions of arbitrary
length in which the value stored in the register does not grow too quickly. We
then leverage an existing counter algorithm by Aspnes, Attiya and Censor-Hillel
[1] in which we “plug” our max register implementation to show that it remains
linearizable while achieving O(log2n) amortized step complexity.'
acknowledgement: A preliminary version of this work appeared in DISC’19. Mirza Ahad
Baig, Alessia Milani and Corentin Travers are supported by ANR projects Descartes
and FREDDA. Mirza Ahad Baig is supported by UMI Relax. Danny Hendler is supported
by the Israel Science Foundation (Grants 380/18 and 1425/22).
article_processing_charge: No
article_type: original
author:
- first_name: Mirza Ahad
full_name: Baig, Mirza Ahad
id: 3EDE6DE4-AA5A-11E9-986D-341CE6697425
last_name: Baig
- first_name: Danny
full_name: Hendler, Danny
last_name: Hendler
- first_name: Alessia
full_name: Milani, Alessia
last_name: Milani
- first_name: Corentin
full_name: Travers, Corentin
last_name: Travers
citation:
ama: Baig MA, Hendler D, Milani A, Travers C. Long-lived counters with polylogarithmic
amortized step complexity. Distributed Computing. 2023;36:29-43. doi:10.1007/s00446-022-00439-5
apa: Baig, M. A., Hendler, D., Milani, A., & Travers, C. (2023). Long-lived
counters with polylogarithmic amortized step complexity. Distributed Computing.
Springer Nature. https://doi.org/10.1007/s00446-022-00439-5
chicago: Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers.
“Long-Lived Counters with Polylogarithmic Amortized Step Complexity.” Distributed
Computing. Springer Nature, 2023. https://doi.org/10.1007/s00446-022-00439-5.
ieee: M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived counters with
polylogarithmic amortized step complexity,” Distributed Computing, vol.
36. Springer Nature, pp. 29–43, 2023.
ista: Baig MA, Hendler D, Milani A, Travers C. 2023. Long-lived counters with polylogarithmic
amortized step complexity. Distributed Computing. 36, 29–43.
mla: Baig, Mirza Ahad, et al. “Long-Lived Counters with Polylogarithmic Amortized
Step Complexity.” Distributed Computing, vol. 36, Springer Nature, 2023,
pp. 29–43, doi:10.1007/s00446-022-00439-5.
short: M.A. Baig, D. Hendler, A. Milani, C. Travers, Distributed Computing 36 (2023)
29–43.
date_created: 2023-01-12T12:10:08Z
date_published: 2023-03-01T00:00:00Z
date_updated: 2023-08-16T08:39:36Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/s00446-022-00439-5
external_id:
isi:
- '000890138700001'
intvolume: ' 36'
isi: 1
keyword:
- Computational Theory and Mathematics
- Computer Networks and Communications
- Hardware and Architecture
- Theoretical Computer Science
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://drops.dagstuhl.de/opus/volltexte/2019/11310/
month: '03'
oa: 1
oa_version: Preprint
page: 29-43
publication: Distributed Computing
publication_identifier:
eissn:
- 1432-0452
issn:
- 0178-2770
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Long-lived counters with polylogarithmic amortized step complexity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2023'
...