Tamar Eilam

	2011
24		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
23		Tamar Eilam, Michael Elder, Alexander V. Konstantinou, Ed C. Snible: Pattern-based composite application deployment. Integrated Network Management 2011: 217-224
	2008
22		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
21		William Arnold, Tamar Eilam, Michael H. Kalantar, Alexander V. Konstantinou, Alexander Totok: Pattern Based SOA Deployment. ICSOC 2007: 1-12
20		Tamar Eilam, Cyril Gavoille, David Peleg: Average stretch analysis of compact routing schemes. Discrete Applied Mathematics 155(5): 598-610 (2007)
	2006
19		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
18		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
17		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
16		Tamar Eilam, Cyril Gavoille, David Peleg: Compact routing schemes with low stretch factor. J. Algorithms 46(2): 97-114 (2003)
	2002
15		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
14		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)
	2000
13		Tamar Eilam, Shlomo Moran, Shmuel Zaks: Approximation Algorithms for Survivable Optical Networks. DISC 2000: 104-118
12		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
11		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)
10		Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. Theor. Comput. Sci. 247(1-2): 213-228 (2000)
	1999
9		Tamar Eilam, Shlomo Moran, Shmuel Zaks: Lower bounds for linear interval routing. Networks 34(1): 37-46 (1999)
	1998
8		Tamar Eilam, Cyril Gavoille, David Peleg: Compact Routing Schemes with Low Stretch Factor (Extended Abstract). PODC 1998: 11-20
7		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)
	1997
6		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
5		Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks: On the totalk-diameter of connection networks. ISTCS 1997: 96-106
4		Tamar Eilam, Shlomo Moran, Shmuel Zaks: The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. SIROCCO 1997: 99-111
3		Tamar Eilam, Shlomo Moran, Shmuel Zaks: A Simple DFS-Based Algorithm for Linear Interval Routing. WDAG 1997: 37-51
	1996
2		Tamar Eilam, Shlomo Moran, Shmuel Zaks: A Lower Bound for Linear Interval Routing. WDAG 1996: 191-205
	1995
1		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

1	Karen Appleby (Karen Appleby-Hougham)	[15] [17]
2	Yariv Aridor	[11] [12]
3	William Arnold	[21] [22]
4	Ishai Ben-Aroya	[1]
5	Jochen Breh	[17]
6	Gerd Breiter	[17]
7	Harald Daur	[17]
8	Yefim Dinitz	[5] [10]
9	Michael Elder	[23]
10	Michael Factor	[11] [12]
11	Sameh A. Fakhouri	[17]
12	Michele Flammini	[6] [7]
13	Liana L. Fong (Liana Fong)	[15]
14	Cyril Gavoille	[8] [16] [20]
15	Germán S. Goldszmidt	[15]
16	Guerney D. H. Hunt	[17]
17	Deepal Jayasinghe	[24]
18	Michael H. Kalantar	[15] [18] [19] [21] [22]
19	Alexander V. Konstantinou	[18] [19] [21] [22] [23]
20	Tan Lu	[17]
21	Kaoutar El Maghraoui	[19]
22	Alok Meghranjani	[19]
23	Sandra D. Miller	[17]
24	Shlomo Moran	[2] [3] [4] [5] [9] [10] [13] [14]
25	Lily B. Mummert	[17]
26	Giovanni Pacifici	[18]
27	Donald P. Pazel	[15]
28	David Peleg	[8] [16] [20]
29	John A. Pershing	[17]
30	Calton Pu	[24]
31	Assaf Schuster	[1] [11] [12]
32	Ed C. Snible	[23] [24]
33	Malgorzata Steinder	[24]
34	Avi Teperman	[11] [12]
35	Alexander Totok	[21] [22]
36	Hendrik Wagner	[17]
37	Ian Whalley	[24]
38	Shmuel Zaks	[2] [3] [4] [5] [6] [7] [9] [10] [13] [14]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page