A parallel algorithm for the single-row routing problem without backward moves and interstreet crossings is presented. The algorithm requires O(log N log log N) time with N processors on a concurrent-read-concurrent-write ...