Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
The query complexity of graph isomorphism: bypassing distribution testing lower bounds.
Krzysztof Onak
,
Xiaorui Sun
Venue
A*
STOC
Year
2018
Proceedings
STOC
DBLP record
conf/stoc/OnakS18 ↗
Browse the full
STOC paper archive
.