Zevi Miller

Publication Activity (10 Years)

Years Active: 1977-2019
Publications (10 Years): 3

Top Topics

Doubly Stochastic

Top Venues

Des. Codes Cryptogr.

Discret. Appl. Math.

Theor. Comput. Sci.

Publications

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