Randomized versus Deterministic Implementations of Concurrent Data Structures

Name: Randomized versus Deterministic Implementations of Concurrent Data Structures
License: Open Access

Alistarh, Dan

DataCite · Datasets · License: Open Access

concurrent algorithms, shared memory, data structures, renaming, randomization, lower bounds, algorithmes concurrents, mémoire partagée

This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗

Record · ID 320087
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.