Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
The Linear-Array Problem in Communication Complexity Resolved.
Martin Dietzfelbinger
Venue
A*
STOC
Year
1997
Proceedings
STOC
DBLP record
conf/stoc/Dietzfelbinger97 ↗
Browse the full
STOC paper archive
.