The invasiveness of off-line memory checking

DOI10.1145/509907.509981zbMath1192.68225OpenAlexW2014289648MaRDI QIDQ3579241

Miklós Ajtai

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.509981

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information storage and retrieval of data (68P20) Randomized algorithms (68W20)

This page was built for publication: The invasiveness of off-line memory checking