Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
PODC
/
Paper
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems.
Will Rosenbaum
,
Jukka Suomela
Venue
A*
PODC
Year
2020
Proceedings
PODC
DBLP record
conf/podc/RosenbaumS20 ↗
Browse the full
PODC paper archive
.