Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract)
Kenneth L. Clarkson
Venue
A*
STOC
Year
1984
Proceedings
STOC
DBLP record
conf/stoc/Clarkson84 ↗
Browse the full
STOC paper archive
.