Journal of the ACM Bibliography

Selected papers that cite this one

• Miklos Ajtai and Nimrod Megiddo. A deterministic poly(log log n)-time n-processor algorithm for linear programming in fixed dimension. SIAM Journal on Computing, 25(6):1171-1195, December 1996.

• Hannah Bast and Torben Hagerup. Fast parallel space allocation, estimation and integer sorting. Information and Computation, 123(1):72-110, 15 November 1995.

Selected references

• Allan Borodin, Joachim von zur Gathen, and John Hopcroft. Fast parallel matrix and gcd computations. Information and Control, 52(3):241-256, March 1982.

• Kenneth L. Clarkson. A Las Vegas algorithm for linear programming when the dimension is small. In 29th Annual Symposium on Foundations of Computer Science, pages 452-456, White Plains, New York, 24-26 October 1988. IEEE.

• Nimrod Megiddo. Linear programming in linear time when the dimension is fixed. Journal of the ACM, 31(1):114-127, January 1984.

• Rüdiger Reischuk. A fast probabilistic parallel sorting algorithm. In 22nd Annual Symposium on Foundations of Computer Science, pages 212-219, Nashville, Tennessee, 28-30 October 1981. IEEE.

Shortcuts: