| 2011 |
|---|
| 13 | Improving Performance and Availability of Services Hosted on IaaS Clouds with Structural Constraint-Aware Virtual Machine Placement. Deepal Jayasinghe, Calton Pu, Tamar Eilam, Malgorzata Steinder, Ian Whalley, Ed C. Snible. IEEE SCC 2011, 72-79. Web SearchBibTeXDownload |
| 2002 |
|---|
| 12 | Neptune: A Dynamic Resource Allocation and Planning System for a Cluster Computing Utility. Donald P. Pazel, Tamar Eilam, Liana L. Fong, Michael H. Kalantar, Karen Appleby, Germán S. Goldszmidt. CCGRID 2002, 57-64. Web SearchBibTeXDownload |
| 11 | The complexity of the characterization of networks supporting shortest-path interval routing. Tamar Eilam, Shlomo Moran, Shmuel Zaks. Theor. Comput. Sci. (289): 85-104 (2002). Web SearchBibTeXDownload |
| 2000 |
|---|
| 10 | Approximation Algorithms for Survivable Optical Networks. Tamar Eilam, Shlomo Moran, Shmuel Zaks. DISC 2000, 104-118. Web SearchBibTeXDownload |
| 9 | A high performance cluster JVM presenting a pure single system image. Yariv Aridor, Michael Factor, Avi Teperman, Tamar Eilam, Assaf Schuster. Java Grande 2000, 168-177. Web SearchBibTeXDownload |
| 8 | Transparently Obtaining Scalability for Java Applications on a Cluster. Yariv Aridor, Michael Factor, Avi Teperman, Tamar Eilam, Assaf Schuster. J. Parallel Distrib. Comput. (60): 1159-1193 (2000). Web SearchBibTeXDownload |
| 7 | On the totalk-diameter of connection networks. Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks. Theor. Comput. Sci. (247): 213-228 (2000). Web SearchBibTeXDownload |
| 1999 |
|---|
| 6 | Lower bounds for linear interval routing. Tamar Eilam, Shlomo Moran, Shmuel Zaks. Networks (34): 37-46 (1999). Web SearchBibTeXDownload |
| 1997 |
|---|
| 5 | On the totalk-diameter of connection networks. Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks. ISTCS 1997, 96-106. Web SearchBibTeXDownload |
| 4 | The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. Tamar Eilam, Shlomo Moran, Shmuel Zaks. SIROCCO 1997, 99-111. Web SearchBibTeX |
| 3 | A Simple DFS-Based Algorithm for Linear Interval Routing. Tamar Eilam, Shlomo Moran, Shmuel Zaks. WDAG 1997, 37-51. Web SearchBibTeXDownload |
| 1996 |
|---|
| 2 | A Lower Bound for Linear Interval Routing. Tamar Eilam, Shlomo Moran, Shmuel Zaks. WDAG 1996, 191-205. Web SearchBibTeXDownload |
| 1995 |
|---|
| 1 | Greedy Hot-Potato Routing on the Two-Dimensional Mesh. Ishai Ben-Aroya, Tamar Eilam, Assaf Schuster. Distributed Computing (9): 3-19 (1995). Web SearchBibTeXDownload |
