Mordechai Shalom

2008
19	EE	Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. DISC 2008: 63-77
18	EE	Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. Euro-Par 2008: 920-929
17	EE	Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. SIROCCO 2008: 221-233
16	EE	Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Selfishness, collusion and power of local search for the ADMs minimization problem. Computer Networks 52(9): 1721-1731 (2008)
15	EE	Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the traffic grooming problem. J. Discrete Algorithms 6(3): 472-479 (2008)
14	EE	Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the traffic grooming problem in tree and star networks. J. Parallel Distrib. Comput. 68(7): 939-948 (2008)
2007
13	EE	Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks: Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks. DISC 2007: 435-449
12	EE	Mordechai Shalom, Walter Unger, Shmuel Zaks: On the Complexity of the Traffic Grooming Problem in Optical Networks. FUN 2007: 262-271
11	EE	Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. SSS 2007: 114-123
10	EE	Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. WINE 2007: 404-411
9	EE	Mordechai Shalom, Shmuel Zaks: A 10/7 + epsilon approximation for minimizing the number of ADMs in SONET rings. IEEE/ACM Trans. Netw. 15(6): 1593-1602 (2007)
8	EE	Michele Flammini, Mordechai Shalom, Shmuel Zaks: On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. J. Parallel Distrib. Comput. 67(4): 448-455 (2007)
7	EE	Mordechai Shalom, Shmuel Zaks: Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem. Theor. Comput. Sci. 384(2-3): 250-262 (2007)
2006
6	EE	Michele Flammini, Mordechai Shalom, Shmuel Zaks: On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. CAAN 2006: 72-85
5	EE	Michele Flammini, Mordechai Shalom, Shmuel Zaks: On Minimizing the Number of ADMs in a General Topology Optical Network. DISC 2006: 459-473
4	EE	Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the Traffic Grooming Problem in Tree and Star Networks. WG 2006: 147-158
2005
3	EE	Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the Traffic Grooming Problem. ISAAC 2005: 915-924
2	EE	Mordechai Shalom, Shmuel Zaks: Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. SIROCCO 2005: 277-291
2004
1	EE	Mordechai Shalom, Shmuel Zaks: A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. BROADNETS 2004: 254-262

Coauthor Index

1	Viacheslav Chernoy	[11] [17] [19]
2	Michele Flammini	[3] [4] [5] [6] [8] [10] [14] [15] [16] [18]
3	Stefania Di Giannantonio	[10]
4	Gianpiero Monaco	[4] [10] [14] [16] [18]
5	Luca Moscardelli	[3] [4] [10] [14] [15] [16] [18]
6	Walter Unger	[12]
7	Prudence W. H. Wong	[13]
8	Shmuel Zaks	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19]