Zevi Miller

40 papers Journal 34Unranked 6
YearRankTypeTitle / Venue / Authors
2025 J jnl
Upper Bounds for Chebyshev Permutation Arrays.
Entropy
Sergey Bereg, Zevi Miller, Ivan Hal Sudborough
2019 J jnl
New lower bounds for permutation arrays using contraction.
Des. Codes Cryptogr.
Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
2018 J jnl
Maximizing Hamming Distance in Contraction of Permutation Arrays.
CoRR
Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
2017 J jnl
On the bandwidth of the Kneser graph.
Discret. Appl. Math.
Tao Jiang, Zevi Miller, Derrek Yager
2014 J jnl
Embedding multidimensional grids into optimal hypercubes.
Theor. Comput. Sci.
Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
2011 J jnl
Near Optimal Bounds for Steiner Trees in the Hypercube.
SIAM J. Comput.
Tao Jiang, Zevi Miller, Dan Pritikin
2009 J jnl
A solitaire game played on 2-colored graphs.
Discret. Math.
David Craft, Zevi Miller, Dan Pritikin
2009 J jnl
Separation numbers of trees.
Theor. Comput. Sci.
Tao Jiang, Zevi Miller, Dan Pritikin
2008 J jnl
Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs.
SIAM J. Discret. Math.
Reza Akhtar, Tao Jiang, Zevi Miller
2005 J jnl
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem.
Networks
Zevi Miller, Dan Pritikin, Manley Perkel, Ivan Hal Sudborough
2003 J jnl
Expansion of layouts of complete binary trees into grids.
Discret. Appl. Math.
Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough
2003 J jnl
Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints.
Random Struct. Algorithms
Noga Alon, Tao Jiang, Zevi Miller, Dan Pritikin
1999 — conf
On Mapping Complete Binary Trees into Grids and Extended Grids.
ISPAN
Y.-B. Lin, Ivan Hal Sudborough, Zevi Miller, Dan Pritikin, Manley Perkel
1997 J jnl
On randomized greedy matchings.
Random Struct. Algorithms
Zevi Miller, Dan Pritikin
1996 J jnl
Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group.
Math. Syst. Theory
Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
1995 — conf
Embedding hypercubes into pancake, cycle prefix and substring reversal networks.
HICSS (2)
Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
1994 J jnl
A stability theorem for the automorphism groups of powers of the n-cube.
Australas. J Comb.
Zevi Miller, Manley Perkel
1994 J jnl
Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube.
Discret. Math.
Zevi Miller, Dan Pritikin
1994 J jnl
Compressing grids into small hypercubes.
Networks
Zevi Miller, Ivan Hal Sudborough
1994 — conf
Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract).
Canada-France Conference on Parallel and Distributed Computing
Saïd Bettayeb, Zevi Miller, Tony Peng, Ivan Hal Sudborough
1994 J jnl
Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group.
IEEE Trans. Computers
Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
1992 J jnl
Embedding Grids into Hypercubes.
J. Comput. Syst. Sci.
Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough
1992 J jnl
The steiner problem in the hypercube.
Networks
Zevi Miller, Manley Perkel
1991 J jnl
A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs.
Math. Syst. Theory
Zevi Miller, Ivan Hal Sudborough
1991 J jnl
Lattice bandwidth of random graphs.
Discret. Appl. Math.
Colin McDiarmid, Zevi Miller
1991 J jnl
The harmonious coloring number of a graph.
Discret. Math.
Zevi Miller, Dan Pritikin
1990 — conf
Optimum Simulation of Meshes by Small Hypercubes.
IMYCS
Bin Cong, Zevi Miller, Ivan Hal Sudborough
1989 J jnl
On the separation number of a graph.
Networks
Zevi Miller, Dan Pritikin
1988 J jnl
A Linear Algorithm for Topological Bandwidth in Degree-Three Trees.
SIAM J. Comput.
Zevi Miller
1988 — conf
Embedding Grids into Hypercubes.
AWOC
Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough
1988 J jnl
Matroids and Subset Interconnection Design.
SIAM J. Discret. Math.
Ding-Zhu Du, Zevi Miller
1986 — conf
A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs.
Aegean Workshop on Computing
Zevi Miller, Ivan Hal Sudborough
1985 J jnl
NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings.
J. Algorithms
Zevi Miller, James B. Orlin
1982 J jnl
Extremal regular graphs for the achromatic number.
Discret. Math.
Zevi Miller
1981 J jnl
Chromatic numbers of hypergraphs and coverings of graphs.
J. Graph Theory
Zevi Miller, Heinrich Müller
1981 J jnl
On graphs containing a given graph as center.
J. Graph Theory
Fred Buckley, Zevi Miller, Peter J. Slater
1980 J jnl
Bigraphs versus digraphs via matrices.
J. Graph Theory
Richard A. Brualdi, Frank Harary, Zevi Miller
1980 J jnl
Which trees are link graphs?
J. Comb. Theory B
Andreas Blass, Frank Harary, Zevi Miller
1978 J jnl
Contractions of graphs: A theorem of ore and an extremal problem.
Discret. Math.
Zevi Miller
1977 J jnl
The biparticity of a graph.
J. Graph Theory
Frank Harary, Derbiau Hsu, Zevi Miller