Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
PODC
/
Paper
Upper bound on the complexity of solving hard renaming.
Hagit Attiya
,
Armando Castaeda
,
Maurice Herlihy
,
Ami Paz
Venue
A*
PODC
Year
2013
Proceedings
PODC
DBLP record
conf/podc/AttiyaCHP13 ↗
Browse the full
PODC paper archive
.