An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem

This paper achieves O(n3loglogn/logn) time for the all pairs shortest path problem on the conventional RAM model where only arithmetic operations, branching operations, and random accessibility with O(logn) bits are allowed.