Mordechai Shalom Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMordechai Shalom: Shmuel Zaks - The Mathematician, Computer Scientist and Personality. DISC 2009: 7
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks: Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS 2009: 1-12
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichele Flammini, Mordechai Shalom, Shmuel Zaks: On minimizing the number of ADMs in a general topology optical network. Discrete Applied Mathematics 157(12): 2701-2717 (2009)
2008
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLViacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. DISC 2008: 63-77
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichele 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
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLViacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. SIROCCO 2008: 221-233
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichele 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)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the traffic grooming problem. J. Discrete Algorithms 6(3): 472-479 (2008)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichele 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
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMordechai Shalom, Prudence W. H. Wong, Shmuel Zaks: Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks. DISC 2007: 435-449
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMordechai Shalom, Walter Unger, Shmuel Zaks: On the Complexity of the Traffic Grooming Problem in Optical Networks. FUN 2007: 262-271
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLViacheslav Chernoy, Mordechai Shalom, Shmuel Zaks: On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. SSS 2007: 114-123
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStefania 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
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMordechai 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)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichele 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)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMordechai 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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichele Flammini, Mordechai Shalom, Shmuel Zaks: On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. CAAN 2006: 72-85
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichele Flammini, Mordechai Shalom, Shmuel Zaks: On Minimizing the Number of ADMs in a General Topology Optical Network. DISC 2006: 459-473
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the Traffic Grooming Problem in Tree and Star Networks. WG 2006: 147-158
2005
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks: Approximating the Traffic Grooming Problem. ISAAC 2005: 915-924
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMordechai Shalom, Shmuel Zaks: Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. SIROCCO 2005: 277-291
2004
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMordechai Shalom, Shmuel Zaks: A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. BROADNETS 2004: 254-262

Coauthor Index

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

Copyright © Fri Nov 27 15:43:12 2009 by Michael Ley (ley@uni-trier.de)