Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
A randomized linear-time algorithm for finding minimum spanning trees.
Philip N. Klein
,
Robert Endre Tarjan
Venue
A*
STOC
Year
1994
Proceedings
STOC
DBLP record
conf/stoc/KleinT94 ↗
Browse the full
STOC paper archive
.