The following publications are possibly variants of this publication:
- A Simpler Algorithm for the All Pairs Shortest Path Problem with ::::O::::(::::n:::::::2:::log::::n::::) Expected TimeTadao Takaoka, Mashitoh Hashim. cocoa 2010: 195-206 [doi]
- An All Pairs Shortest Path Algorithm with Expected Time O(n² log n)Alistair Moffat, Tadao Takaoka. SICOMP, 16(6):1023-1031, 1987.
- An O(::::n:::::::3:::loglog::::n::::/log::::n::::) time algorithm for the all-pairs shortest path problemTadao Takaoka. ipl, 96(5):155-161, 2005. [doi]
- A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected timeTadao Takaoka. jco, 25(2):326-337, 2013. [doi]
- An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance ProblemTadao Takaoka, Alistair Moffat. mfcs 1980: 643-655
- 2n) time algorithm for all pairs shortest pathsYijie Han, Tadao Takaoka. jda, 38:9-19, 2016. [doi]