Efficient algorithms for persistent transactional memory
- DOI
- 10.1145/3437801.3441586
- Published
- 2021-02-17
- Container
- Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
- Publisher
- ACM
- Open access
- unknown
Credibility signals
uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- supportingDOI registered: A matching record was returned by Crossref.
- supportingDOI resolves: A matching record was returned by Crossref.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
Cite this work
BibTeX
@article{allodium:10.1145/3437801.3441586,
title = {Efficient algorithms for persistent transactional memory},
author = {Pedro Ramalhete and Andreia Correia and Pascal Felber},
year = {2021},
journal = {Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
doi = {10.1145/3437801.3441586},
url = {https://doi.org/10.1145/3437801.3441586}
}RIS
TY - JOUR TI - Efficient algorithms for persistent transactional memory AU - Pedro Ramalhete AU - Andreia Correia AU - Pascal Felber PY - 2021 JO - Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming DO - 10.1145/3437801.3441586 UR - https://doi.org/10.1145/3437801.3441586 ER -
APA
Ramalhete, P., Correia, A., & Felber, P. (2021). Efficient algorithms for persistent transactional memory. Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. https://doi.org/10.1145/3437801.3441586
Source records
- crossref · retrieved 2026-09-26T00:14:51.658Z