"Upper bound on the complexity of solving hard renaming."

Hagit Attiya et al. (2013)

Details and statistics

DOI: 10.1145/2484239.2484251

access: closed

type: Conference or Workshop Paper

metadata version: 2022-10-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics