Marilyn G. Andrews

According to our database, Marilyn G. Andrews authored at least 4 papers between 1995 and 2000.

Collaborative distances:

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

2000

The SPEED platform for programmable bearer channel processing.

Marilyn G. Andrews, Charles C. Byers, Prudence T. Zacarias Kapauan, Trent R. Nanke, John L. Shepherd

Bell Labs Tech. J., 2000

Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems.

Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee

Algorithmica, 2000

1995

Parallel Algorithms on Circular-arc Graphs.

Marilyn G. Andrews, D. T. Lee

Comput. Geom., 1995

Parallel algorithms for maximum matching in interval graphs.

Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee

Proceedings of IPPS '95, 1995