A 2n−2 step algorithm for routing in ann ×n array with constant-size queues T. LeightonF. MakedonI. G. Tollis OriginalPaper Pages: 291 - 304
Balancing minimum spanning trees and shortest-path trees S. KhullerB. RaghavachariN. Young OriginalPaper Pages: 305 - 321
An efficient parallel algorithm for shortest paths in planar layered digraphs S. SubramanianR. TamassiaJ. S. Vitter OriginalPaper Pages: 322 - 339
Finding all periods and initial palindromes of a string in parallel D. BreslauerZ. Galil OriginalPaper Pages: 355 - 366