Mark T. Noga

According to our database, Mark T. Noga authored at least 8 papers between 1980 and 1989.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

1989

ParcBench: a benchmark for shared-memory architectures.

Neil J. Gunther, Mark T. Noga

SIGARCH Comput. Archit. News, 1989

1987

Sorting in Parallel by Double Distributive Partitioning.

Mark T. Noga

BIT, 1987

1985

Sorting in Linear Expected Time.

Mark T. Noga, Donald C. S. Allison

BIT, 1985

1984

Fast geometric algorithms.

Mark T. Noga

PhD thesis, 1984

The L₁ Travelling Salesman Problem.

Donald C. S. Allison, Mark T. Noga

Inf. Process. Lett., 1984

Some Performance Tests of Convex Hull Algorithms.

Donald C. S. Allison, Mark T. Noga

BIT, 1984

1982

USORT: An Efficient Hybrid of Distributed Partitioning Sorting.

Donald C. S. Allison, Mark T. Noga

BIT, 1982

1980

Selection by Distributive Partitioning.

Donald C. S. Allison, Mark T. Noga

Inf. Process. Lett., 1980