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.
Tamar Eilam
2010 – today
- 2012
[c16]F'bio Oliveira, Tamar Eilam, Michael H. Kalantar, Florian Rosenberg: Semantically-Rich Composition of Virtual Images. IEEE CLOUD 2012: 277-284- 2011
- [c15]Deepal Jayasinghe, Calton Pu, Tamar Eilam, Malgorzata Steinder, Ian Whalley, Ed C. Snible: Improving Performance and Availability of Services Hosted on IaaS Clouds with Structural Constraint-Aware Virtual Machine Placement. IEEE SCC 2011: 72-79
- [c14]Tamar Eilam, Michael Elder, Alexander V. Konstantinou, Ed C. Snible: Pattern-based composite application deployment. Integrated Network Management 2011: 217-224
2000 – 2009
- 2008
- [c13]William Arnold, Tamar Eilam, Michael H. Kalantar, Alexander V. Konstantinou, Alexander Totok: Automatic Realization of SOA Deployment Patterns in Distributed Environments. ICSOC 2008: 162-179
- 2007
- [j9]Tamar Eilam, Cyril Gavoille, David Peleg: Average stretch analysis of compact routing schemes. Discrete Applied Mathematics 155(5): 598-610 (2007)
- [c12]William Arnold, Tamar Eilam, Michael H. Kalantar, Alexander V. Konstantinou, Alexander Totok: Pattern Based SOA Deployment. ICSOC 2007: 1-12
- 2006
- [c11]Kaoutar El Maghraoui, Alok Meghranjani, Tamar Eilam, Michael H. Kalantar, Alexander V. Konstantinou: Model Driven Provisioning: Bridging the Gap Between Declarative Object Models and Procedural Provisioning Tools. Middleware 2006: 404-423
- 2005
- [c10]Tamar Eilam, Michael H. Kalantar, Alexander V. Konstantinou, Giovanni Pacifici: Reducing the complexity of application deployment in large data centers. Integrated Network Management 2005: 221-234
- 2004
- [j8]Tamar Eilam, Karen Appleby, Jochen Breh, Gerd Breiter, Harald Daur, Sameh A. Fakhouri, Guerney D. H. Hunt, Tan Lu, Sandra D. Miller, Lily B. Mummert, John A. Pershing, Hendrik Wagner: Using a utility computing framework to develop utility systems. IBM Systems Journal 43(1): 97-120 (2004)
- 2003
- [j7]Tamar Eilam, Cyril Gavoille, David Peleg: Compact routing schemes with low stretch factor. J. Algorithms 46(2): 97-114 (2003)
- 2002
- [j6]Tamar Eilam, Shlomo Moran, Shmuel Zaks: The complexity of the characterization of networks supporting shortest-path interval routing. Theor. Comput. Sci. 289(1): 85-104 (2002)
- [c9]Donald P. Pazel, Tamar Eilam, Liana L. Fong, Michael H. Kalantar, Karen Appleby, Germán S. Goldszmidt: Neptune: A Dynamic Resource Allocation and Planning System for a Cluster Computing Utility. CCGRID 2002: 57-64
- 2000
- [j5]Yariv Aridor, Michael Factor, Avi Teperman, Tamar Eilam, Assaf Schuster: Transparently Obtaining Scalability for Java Applications on a Cluster. J. Parallel Distrib. Comput. 60(10): 1159-1193 (2000)
- [j4]Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. Theor. Comput. Sci. 247(1-2): 213-228 (2000)
- [c8]Yariv Aridor, Michael Factor, Avi Teperman, Tamar Eilam, Assaf Schuster: A high performance cluster JVM presenting a pure single system image. Java Grande 2000: 168-177
- [c7]Tamar Eilam, Shlomo Moran, Shmuel Zaks: Approximation Algorithms for Survivable Optical Networks. DISC 2000: 104-118
1990 – 1999
- 1999
- [j3]Tamar Eilam, Shlomo Moran, Shmuel Zaks: Lower bounds for linear interval routing. Networks 34(1): 37-46 (1999)
- 1998
- [j2]Tamar Eilam, Michele Flammini, Shmuel Zaks: A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load. Parallel Processing Letters 8(2): 207-220 (1998)
- [c6]Tamar Eilam, Cyril Gavoille, David Peleg: Compact Routing Schemes with Low Stretch Factor (Extended Abstract). PODC 1998: 11-20
- 1997
- [c5]Tamar Eilam, Michele Flammini, Shmuel Zaks: A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract). ICALP 1997: 527-537
- [c4]Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. ISTCS 1997: 96-106
- [c3]Tamar Eilam, Shlomo Moran, Shmuel Zaks: The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. SIROCCO 1997: 99-111
- [c2]Tamar Eilam, Shlomo Moran, Shmuel Zaks: A Simple DFS-Based Algorithm for Linear Interval Routing. WDAG 1997: 37-51
- 1996
- [c1]Tamar Eilam, Shlomo Moran, Shmuel Zaks: A Lower Bound for Linear Interval Routing. WDAG 1996: 191-205
- 1995
- [j1]Ishai Ben-Aroya, Tamar Eilam, Assaf Schuster: Greedy Hot-Potato Routing on the Two-Dimensional Mesh. Distributed Computing 9(1): 3-19 (1995)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:08 CET by the dblp team