Σπυράκης, Π. Γ., & Τσακαλίδης, Α. (1991). An all pairs shortest algorithm taking 0 (n2 logn/loglogn) time on the average [C.T.I. Technical Report] TR 91.01.2. Computer Technology Institute Computer Science and Engineering Department, Patras University Courant Institute of Mathematical Sciences, U.S.A. Ινστιτούτο Τεχνολογίας Υπολογιστών.
Chicago Style (17th ed.) CitationΣπυράκης, Παύλος Γ., and Αθανάσιος Τσακαλίδης. An All Pairs Shortest Algorithm Taking 0 (n2 Logn/loglogn) Time on the Average [C.T.I. Technical Report] TR 91.01.2. [Patras Greece] Patras Greece New York Πάτρα Ελλάδα: Computer Technology Institute Computer Science and Engineering Department, Patras University Courant Institute of Mathematical Sciences, U.S.A. Ινστιτούτο Τεχνολογίας Υπολογιστών, 1991.
MLA (8th ed.) CitationΣπυράκης, Παύλος Γ., and Αθανάσιος Τσακαλίδης. An All Pairs Shortest Algorithm Taking 0 (n2 Logn/loglogn) Time on the Average [C.T.I. Technical Report] TR 91.01.2. Computer Technology Institute Computer Science and Engineering Department, Patras University Courant Institute of Mathematical Sciences, U.S.A. Ινστιτούτο Τεχνολογίας Υπολογιστών, 1991.