Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Tight bounds for single-pass streaming complexity of the set cover problem.
Sepehr Assadi
,
Sanjeev Khanna
,
Yang Li
Venue
A*
STOC
Year
2016
Proceedings
STOC
DBLP record
conf/stoc/AssadiKL16 ↗
Browse the full
STOC paper archive
.