Παραπομπή σε μορφή APA (7η εκδ.)

Klein, P. N., Subramanian, S., & Archives, T. P. S. U. C. (1993). A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs. ftp://wilma.cs.brown.edu/pub/techreports/93/cs93-35.ps.Z.

Παραπομπή σε μορφή Chicago (17η εκδ.)

Klein, Philip N., Sairam Subramanian, και The Pennsylvania State University CiteSeerX Archives. "A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs." Ftp://wilma.cs.brown.edu/pub/techreports/93/cs93-35.ps.Z 1993.

Παραπομπή σε μορφή MLA (9th εκδ.)

Klein, Philip N., et al. "A Linear-Processor Polylog-Time Algorithm for Shortest Paths in Planar Graphs." Ftp://wilma.cs.brown.edu/pub/techreports/93/cs93-35.ps.Z, 1993.