The SCEAS System
| |||||||

## Search the dblp DataBase
Zevi Miller:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough
**Embedding Grids into Hypercubes.**[Citation Graph (0, 0)][DBLP] AWOC, 1988, pp:201-211 [Conf] - Zevi Miller, Ivan Hal Sudborough
**A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs.**[Citation Graph (0, 0)][DBLP] Aegean Workshop on Computing, 1986, pp:252-260 [Conf] - Saïd Bettayeb, Zevi Miller, Tony Peng, Ivan Hal Sudborough
**Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract).**[Citation Graph (0, 0)][DBLP] Canada-France Conference on Parallel and Distributed Computing, 1994, pp:73-80 [Conf] - Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
**Embedding hypercubes into pancake, cycle prefix and substring reversal networks.**[Citation Graph (0, 0)][DBLP] HICSS (2), 1995, pp:537-545 [Conf] - Bin Cong, Zevi Miller, Ivan Hal Sudborough
**Optimum Simulation of Meshes by Small Hypercubes.**[Citation Graph (0, 0)][DBLP] IMYCS, 1990, pp:30-46 [Conf] - Y.-B. Lin, Ivan Hal Sudborough, Zevi Miller, Dan Pritikin, Manley Perkel
**On Mapping Complete Binary Trees into Grids and Extended Grids.**[Citation Graph (0, 0)][DBLP] ISPAN, 1999, pp:242-247 [Conf] - Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough
**Expansion of layouts of complete binary trees into grids.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:3, pp:611-642 [Journal] - Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough
**Embedding Grids into Hypercubes.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1992, v:45, n:3, pp:340-366 [Journal] - Andreas Blass, Frank Harary, Zevi Miller
**Which trees are link graphs?**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1980, v:29, n:3, pp:277-292 [Journal] - Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
**Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1996, v:29, n:6, pp:551-572 [Journal] - Zevi Miller, Ivan Hal Sudborough
**A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1991, v:24, n:1, pp:11-40 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Networks, 2005, v:45, n:3, pp:143-164 [Journal] - Noga Alon, Tao Jiang, Zevi Miller, Dan Pritikin
**Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2003, v:23, n:4, pp:409-433 [Journal] - Zevi Miller, Dan Pritikin
**On randomized greedy matchings.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1997, v:10, n:3, pp:353-383 [Journal] - Zevi Miller
**A Linear Algorithm for Topological Bandwidth in Degree-Three Trees.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1988, v:17, n:5, pp:1018-1035 [Journal] - Ding-Zhu Du, Zevi Miller
**Matroids and Subset Interconnection Design.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1988, v:1, n:4, pp:416-424 [Journal] - Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
**Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1994, v:43, n:1, pp:13-22 [Journal] - Zevi Miller
**Extremal regular graphs for the achromatic number.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:40, n:2-3, pp:235-253 [Journal] - Zevi Miller, Dan Pritikin
**The harmonious coloring number of a graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:93, n:2-3, pp:211-228 [Journal] - Zevi Miller, Dan Pritikin
**Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:131, n:1-3, pp:183-194 [Journal] **Lattice bandwidth of random graphs.**[Citation Graph (, )][DBLP]**A solitaire game played on 2-colored graphs.**[Citation Graph (, )][DBLP]
Search in 0.117secs, Finished in 0.118secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |