On the complexity of linearizability
From MaRDI portal
Publication:2218465
DOI10.1007/s00607-018-0596-7zbMath1459.68083arXiv1410.5000OpenAlexW2794155582MaRDI QIDQ2218465
Publication date: 15 January 2021
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.5000
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Uses Software
Cites Work