Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
The Linear-Array Conjecture in Communication Complexity is False.
Eyal Kushilevitz
,
Nathan Linial
,
Rafail Ostrovsky
Venue
A*
STOC
Year
1996
Proceedings
STOC
DBLP record
conf/stoc/KushilevitzLO96 ↗
Browse the full
STOC paper archive
.