Manley Perkel

According to our database, Manley Perkel authored at least 8 papers between 1985 and 2012.

Collaborative distances:

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

2012

Arrangements of k-sets with intersection constraints.

Tao Jiang, Manley Perkel, Dan Pritikin

Eur. J. Comb., 2012

2005

The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem.

Zevi Miller, Dan Pritikin, Manley Perkel, Ivan Hal Sudborough

Networks, 2005

2003

Expansion of layouts of complete binary trees into grids.

Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough

Discret. Appl. Math., 2003

1999

On Mapping Complete Binary Trees into Grids and Extended Grids.

Y.-B. Lin, Ivan Hal Sudborough, Zevi Miller, Dan Pritikin, Manley Perkel

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1994

Representations of graphs modulo <i>n</i>.

Anthony B. Evans, Gerd Fricke, Carl C. Maneri, Terry A. McKee, Manley Perkel

J. Graph Theory, 1994

A stability theorem for the automorphism groups of powers of the n-cube.

Zevi Miller, Manley Perkel

Australas. J Comb., 1994

1992

The steiner problem in the hypercube.

Zevi Miller, Manley Perkel

Networks, 1992

1985

Rank 4 Groups with a 3-Transitive Suborbit.

Manley Perkel

J. Comb. Theory A, 1985