Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Optimal query complexity bounds for finding graphs.
Sung-Soon Choi
,
Jeong Han Kim
Venue
A*
STOC
Year
2008
Proceedings
STOC
DBLP record
conf/stoc/ChoiK08 ↗
Browse the full
STOC paper archive
.