Yijie Han. Achieving O(n:::3:::/log n) Time for All Pairs Shortest Paths by Using a Smaller Table. In David Jeff Jackson, editor, 21st International Conference on Computers and Their Applications, CATA-2006, Seattle, Washington, USA, March 23-25, 2006, Proceedings. pages 36-37, ISCA, 2006.
@inproceedings{Han06:15,
title = {Achieving O(n:::3:::/log n) Time for All Pairs Shortest Paths by Using a Smaller Table},
author = {Yijie Han},
year = {2006},
researchr = {https://researchr.org/publication/Han06%3A15},
cites = {0},
citedby = {0},
pages = {36-37},
booktitle = {21st International Conference on Computers and Their Applications, CATA-2006, Seattle, Washington, USA, March 23-25, 2006, Proceedings},
editor = {David Jeff Jackson},
publisher = {ISCA},
isbn = {1-880843-58-7},
}