Zevi Miller

According to our database, Zevi Miller authored at least 38 papers between 1977 and 2019.

Collaborative distances:

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

2019

New lower bounds for permutation arrays using contraction.

Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough

Des. Codes Cryptogr., 2019

2018

Maximizing Hamming Distance in Contraction of Permutation Arrays.

Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough

CoRR, 2018

2017

On the bandwidth of the Kneser graph.

Tao Jiang, Zevi Miller, Derrek Yager

Discret. Appl. Math., 2017

2014

Embedding multidimensional grids into optimal hypercubes.

Zevi Miller, Dan Pritikin, Ivan Hal Sudborough

Theor. Comput. Sci., 2014

2011

Near Optimal Bounds for Steiner Trees in the Hypercube.

Tao Jiang, Zevi Miller, Dan Pritikin

SIAM J. Comput., 2011

2009

Separation numbers of trees.

Tao Jiang, Zevi Miller, Dan Pritikin

Theor. Comput. Sci., 2009

A solitaire game played on 2-colored graphs.

David Craft, Zevi Miller, Dan Pritikin

Discret. Math., 2009

2008

Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs.

Reza Akhtar, Tao Jiang, Zevi Miller

SIAM J. Discret. Math., 2008

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

Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints.

Noga Alon, Tao Jiang, Zevi Miller, Dan Pritikin

Random Struct. Algorithms, 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

1997

On randomized greedy matchings.

Zevi Miller, Dan Pritikin

Random Struct. Algorithms, 1997

1996

Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group.

Zevi Miller, Dan Pritikin, Ivan Hal Sudborough

Math. Syst. Theory, 1996

1995

Embedding hypercubes into pancake, cycle prefix and substring reversal networks.

Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough

Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994

Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group.

Zevi Miller, Dan Pritikin, Ivan Hal Sudborough

IEEE Trans. Computers, 1994

Compressing grids into small hypercubes.

Zevi Miller, Ivan Hal Sudborough

Networks, 1994

Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube.

Zevi Miller, Dan Pritikin

Discret. Math., 1994

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

Zevi Miller, Manley Perkel

Australas. J Comb., 1994

Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract).

Saïd Bettayeb, Zevi Miller, Tony Peng, Ivan Hal Sudborough

Proceedings of the Parallel and Distributed Computing, 1994

1992

The steiner problem in the hypercube.

Zevi Miller, Manley Perkel

Networks, 1992

Embedding Grids into Hypercubes.

Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough

J. Comput. Syst. Sci., 1992

1991

A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs.

Zevi Miller, Ivan Hal Sudborough

Math. Syst. Theory, 1991

The harmonious coloring number of a graph.

Zevi Miller, Dan Pritikin

Discret. Math., 1991

Lattice bandwidth of random graphs.

Colin McDiarmid, Zevi Miller

Discret. Appl. Math., 1991

1990

Optimum Simulation of Meshes by Small Hypercubes.

Bin Cong, Zevi Miller, Ivan Hal Sudborough

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

1989

On the separation number of a graph.

Zevi Miller, Dan Pritikin

Networks, 1989

1988

Matroids and Subset Interconnection Design.

Ding-Zhu Du, Zevi Miller

SIAM J. Discret. Math., 1988

A Linear Algorithm for Topological Bandwidth in Degree-Three Trees.

Zevi Miller

SIAM J. Comput., 1988

1986

A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs.

Zevi Miller, Ivan Hal Sudborough

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings.

Zevi Miller, James B. Orlin

J. Algorithms, 1985

1982

Extremal regular graphs for the achromatic number.

Zevi Miller

Discret. Math., 1982

1981

Chromatic numbers of hypergraphs and coverings of graphs.

Zevi Miller, Heinrich Müller

J. Graph Theory, 1981

On graphs containing a given graph as center.

Fred Buckley, Zevi Miller, Peter J. Slater

J. Graph Theory, 1981

1980

Bigraphs versus digraphs via matrices.

Richard A. Brualdi, Frank Harary, Zevi Miller

J. Graph Theory, 1980

Which trees are link graphs?

Andreas Blass, Frank Harary, Zevi Miller

J. Comb. Theory, Ser. B, 1980

1978

Contractions of graphs: A theorem of ore and an extremal problem.

Zevi Miller

Discret. Math., 1978

1977

The biparticity of a graph.

Frank Harary, Derbiau Hsu, Zevi Miller

J. Graph Theory, 1977