Mai Thanh

According to our database, Mai Thanh authored at least 6 papers between 1982 and 1989.

Collaborative distances:

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

1989

Optimum combinations of sorting and merging.

Glenn K. Manacher, Tien Dai Bui, Mai Thanh

J. ACM, 1989

1986

Optimal Expected-Time Algorithms for Merging.

Mai Thanh, Vangalur S. Alagar, Tien Dai Bui

J. Algorithms, 1986

1985

Significant Improvements to the Ford-Johnson Algorithm for Sorting.

Tien Dai Bui, Mai Thanh

BIT, 1985

Fast Polynominal Decomposition Algorithms.

Vangalur S. Alagar, Mai Thanh

Proceedings of the EUROCAL '85, 1985

1983

Efficient Algorithms for Merging.

Vangalur S. Alagar, Tien Dai Bui, Mai Thanh

BIT, 1983

1982

An Improvement of the Binary Merge Algorithm.

Mai Thanh, Tien Dai Bui

BIT, 1982