Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FOCS
/
Paper
An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n)
Alistair Moffat
,
Tadao Takaoka
Venue
A*
FOCS
Year
1985
Proceedings
FOCS
DBLP record
conf/focs/MoffatT85 ↗
Browse the full
FOCS paper archive
.