Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Size-Time Complexity of Boolean Networks for Prefix Computations
Gianfranco Bilardi
,
Franco P. Preparata
Venue
A*
STOC
Year
1987
Proceedings
STOC
DBLP record
conf/stoc/BilardiP87 ↗
Browse the full
STOC paper archive
.