Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
COCOON
/
Paper
Strong I/O Lower Bounds for Binomial and FFT Computation Graphs.
Desh Ranjan
,
John E. Savage
,
Mohammad Zubair
Venue
National
COCOON
Year
2011
Proceedings
COCOON
DBLP record
conf/cocoon/RanjanSZ11 ↗
Browse the full
COCOON paper archive
.