Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Zevi Miller
2010 – today
- 2011
[j22]Tao Jiang, Zevi Miller, Dan Pritikin: Near Optimal Bounds for Steiner Trees in the Hypercube. SIAM J. Comput. 40(5): 1340-1360 (2011)
2000 – 2009
- 2009
- [j21]David Craft, Zevi Miller, Dan Pritikin: A solitaire game played on 2-colored graphs. Discrete Mathematics 309(1): 188-201 (2009)
- [j20]Tao Jiang, Zevi Miller, Dan Pritikin: Separation numbers of trees. Theor. Comput. Sci. 410(38-40): 3769-3781 (2009)
- 2008
- [j19]Reza Akhtar, Tao Jiang, Zevi Miller: Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs. SIAM J. Discrete Math. 22(2): 425-449 (2008)
- 2005
- [j18]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): 143-164 (2005)
- 2003
- [j17]Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough: Expansion of layouts of complete binary trees into grids. Discrete Applied Mathematics 131(3): 611-642 (2003)
- [j16]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): 409-433 (2003)
1990 – 1999
- 1999
- [c6]Y.-B. Lin, Ivan Hal Sudborough, Zevi Miller, Dan Pritikin, Manley Perkel: On Mapping Complete Binary Trees into Grids and Extended Grids. ISPAN 1999: 242-247
- 1997
- [j15]Zevi Miller, Dan Pritikin: On randomized greedy matchings. Random Struct. Algorithms 10(3): 353-383 (1997)
- 1996
- [j14]Zevi Miller, Dan Pritikin, Ivan Hal Sudborough: Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. Mathematical Systems Theory 29(6): 551-572 (1996)
- 1995
- [c5]Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough: Embedding hypercubes into pancake, cycle prefix and substring reversal networks. HICSS (2) 1995: 537-545
- 1994
- [j13]Zevi Miller, Dan Pritikin: Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube. Discrete Mathematics 131(1-3): 183-194 (1994)
- [j12]Zevi Miller, Ivan Hal Sudborough: Compressing grids into small hypercubes. Networks 24(6): 327-357 (1994)
- [j11]Zevi Miller, Dan Pritikin, Ivan Hal Sudborough: Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group. IEEE Trans. Computers 43(1): 13-22 (1994)
- [c4]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: 73-80
- 1992
- [j10]Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough: Embedding Grids into Hypercubes. J. Comput. Syst. Sci. 45(3): 340-366 (1992)
- [j9]
- 1991
- [j8]Colin McDiarmid, Zevi Miller: Lattice bandwidth of random graphs. Discrete Applied Mathematics 30(2-3): 221-227 (1991)
- [j7]Zevi Miller, Dan Pritikin: The harmonious coloring number of a graph. Discrete Mathematics 93(2-3): 211-228 (1991)
- [j6]Zevi Miller, Ivan Hal Sudborough: A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs. Mathematical Systems Theory 24(1): 11-40 (1991)
- 1990
- [c3]Bin Cong, Zevi Miller, Ivan Hal Sudborough: Optimum Simulation of Meshes by Small Hypercubes. IMYCS 1990: 30-46
1980 – 1989
- 1989
- [j5]
- 1988
- [j4]Zevi Miller: A Linear Algorithm for Topological Bandwidth in Degree-Three Trees. SIAM J. Comput. 17(5): 1018-1035 (1988)
- [j3]Ding-Zhu Du, Zevi Miller: Matroids and Subset Interconnection Design. SIAM J. Discrete Math. 1(4): 416-424 (1988)
- [c2]Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough: Embedding Grids into Hypercubes. AWOC 1988: 201-211
- 1986
- [c1]Zevi Miller, Ivan Hal Sudborough: A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs. Aegean Workshop on Computing 1986: 252-260
- 1982
- [j2]Zevi Miller: Extremal regular graphs for the achromatic number. Discrete Mathematics 40(2-3): 235-253 (1982)
- 1980
- [j1]Andreas Blass, Frank Harary, Zevi Miller: Which trees are link graphs? J. Comb. Theory, Ser. B 29(3): 277-292 (1980)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-25 19:58 CET by the dblp team