F. Miller Maley

According to our database, F. Miller Maley authored at least 13 papers between 1985 and 2019.

Collaborative distances:

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

2019

Conveyors for Streaming Many-To-Many Communication.

F. Miller Maley, Jason G. DeVinney

Proceedings of the 9th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, 2019

2005

On the areas of cyclic and semicyclic polygons.

F. Miller Maley, David P. Robbins, Julie Roskies

Adv. Appl. Math., 2005

2000

Symplectic Packings in Cotangent Bundles of Tori.

F. Miller Maley, Jean Mastrangeli, Lisa Traynor

Exp. Math., 2000

1998

Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic.

Robert Lupton, F. Miller Maley, Neal E. Young

J. Algorithms, 1998

1996

Testing Homotopic Routability Under Polygonal Wiring Rules.

F. Miller Maley

Algorithmica, 1996

1993

Parity Conditions in Homotopic Knock-Knee Routing.

Michael Kaufmann, F. Miller Maley

Algorithmica, 1993

1992

Minimum Separation for Single-Layer Channel Routing.

Ronald I. Greenberg, F. Miller Maley

Inf. Process. Lett., 1992

1991

A Generic Algorithm for One-Dimensional Homotopic Compaction.

F. Miller Maley

Algorithmica, 1991

1989

Advances in Homotopic Layout Compaction.

Shaodi Gao, Michael Kaufmann, F. Miller Maley

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Single-layer wire routing and compaction.

F. Miller Maley

Foundations of computing, MIT Press, ISBN: 978-0-262-13250-3, 1989

1987

Single-layer wire routing.

F. Miller Maley

PhD thesis, 1987

An Observation Concerning Constraint-Based Compaction.

F. Miller Maley

Inf. Process. Lett., 1987

1985

Algorithms for Routing and Testing Routability of Planar VLSI Layouts

Charles E. Leiserson, F. Miller Maley

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985