default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZevi Miller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j32]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): 2105-2128 (2019)- 2018
- [i1]Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Maximizing Hamming Distance in Contraction of Permutation Arrays. CoRR abs/1804.03768 (2018) - 2017
- [j31]Tao Jiang, Zevi Miller, Derrek Yager:
On the bandwidth of the Kneser graph. Discret. Appl. Math. 227: 84-94 (2017) - 2014
- [j30]Zevi Miller, Dan Pritikin, Ivan Hal Sudborough:
Embedding multidimensional grids into optimal hypercubes. Theor. Comput. Sci. 552: 52-82 (2014) - 2011
- [j29]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
- [j28]David Craft, Zevi Miller, Dan Pritikin:
A solitaire game played on 2-colored graphs. Discret. Math. 309(1): 188-201 (2009) - [j27]Tao Jiang, Zevi Miller, Dan Pritikin:
Separation numbers of trees. Theor. Comput. Sci. 410(38-40): 3769-3781 (2009) - 2008
- [j26]Reza Akhtar, Tao Jiang, Zevi Miller:
Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs. SIAM J. Discret. Math. 22(2): 425-449 (2008) - 2005
- [j25]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
- [j24]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): 611-642 (2003) - [j23]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
- [j22]Zevi Miller, Dan Pritikin:
On randomized greedy matchings. Random Struct. Algorithms 10(3): 353-383 (1997) - 1996
- [j21]Zevi Miller, Dan Pritikin, Ivan Hal Sudborough:
Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. Math. Syst. 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
- [j20]Zevi Miller, Manley Perkel:
A stability theorem for the automorphism groups of powers of the n-cube. Australas. J Comb. 10: 17-28 (1994) - [j19]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): 183-194 (1994) - [j18]Zevi Miller, Ivan Hal Sudborough:
Compressing grids into small hypercubes. Networks 24(6): 327-357 (1994) - [j17]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
- [j16]Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough:
Embedding Grids into Hypercubes. J. Comput. Syst. Sci. 45(3): 340-366 (1992) - [j15]Zevi Miller, Manley Perkel:
The steiner problem in the hypercube. Networks 22(1): 1-19 (1992) - 1991
- [j14]Colin McDiarmid, Zevi Miller:
Lattice bandwidth of random graphs. Discret. Appl. Math. 30(2-3): 221-227 (1991) - [j13]Zevi Miller, Dan Pritikin:
The harmonious coloring number of a graph. Discret. Math. 93(2-3): 211-228 (1991) - [j12]Zevi Miller, Ivan Hal Sudborough:
A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs. Math. Syst. 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
- [j11]Zevi Miller, Dan Pritikin:
On the separation number of a graph. Networks 19(6): 651-666 (1989) - 1988
- [j10]Zevi Miller:
A Linear Algorithm for Topological Bandwidth in Degree-Three Trees. SIAM J. Comput. 17(5): 1018-1035 (1988) - [j9]Ding-Zhu Du, Zevi Miller:
Matroids and Subset Interconnection Design. SIAM J. Discret. 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 - 1985
- [j8]Zevi Miller, James B. Orlin:
NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings. J. Algorithms 6(1): 10-16 (1985) - 1982
- [j7]Zevi Miller:
Extremal regular graphs for the achromatic number. Discret. Math. 40(2-3): 235-253 (1982) - 1981
- [j6]Zevi Miller, Heinrich Müller:
Chromatic numbers of hypergraphs and coverings of graphs. J. Graph Theory 5(3): 299-305 (1981) - [j5]Fred Buckley, Zevi Miller, Peter J. Slater:
On graphs containing a given graph as center. J. Graph Theory 5(4): 427-434 (1981) - 1980
- [j4]Andreas Blass, Frank Harary, Zevi Miller:
Which trees are link graphs? J. Comb. Theory B 29(3): 277-292 (1980) - [j3]Richard A. Brualdi, Frank Harary, Zevi Miller:
Bigraphs versus digraphs via matrices. J. Graph Theory 4(1): 51-73 (1980)
1970 – 1979
- 1978
- [j2]Zevi Miller:
Contractions of graphs: A theorem of ore and an extremal problem. Discret. Math. 21(3): 261-272 (1978) - 1977
- [j1]Frank Harary, Derbiau Hsu, Zevi Miller:
The biparticity of a graph. J. Graph Theory 1(2): 131-133 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
