A. G. Deczky

  • Citations Per Year
Learn More
Parallel algorithm for single row routing problem without backward moves and interstreet crossings is presented. The algorithm requires O(logA/ log log A/) time with N processors on a concurrent read concurrent write shared memory model or alternatively O(log N) time with ,V processors on a concurrent read exclusive write shared memory model. The algorithm(More)
  • 1