Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
Tight bounds for rumor spreading in graphs of a given conductance.
George Giakkoupis
Venue
A
STACS
Year
2011
Proceedings
STACS
DBLP record
conf/stacs/Giakkoupis11 ↗
Browse the full
STACS paper archive
.