Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n)
Peter A. Bloniarz
Venue
A*
STOC
Year
1980
Proceedings
STOC
DBLP record
conf/stoc/Bloniarz80 ↗
Browse the full
STOC paper archive
.