The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mordechai Shalom: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mordechai Shalom, Shmuel Zaks
    A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs in SONET Rings. [Citation Graph (0, 0)][DBLP]
    BROADNETS, 2004, pp:254-262 [Conf]
  2. Michele Flammini, Mordechai Shalom, Shmuel Zaks
    On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. [Citation Graph (0, 0)][DBLP]
    CAAN, 2006, pp:72-85 [Conf]
  3. Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
    Approximating the Traffic Grooming Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:915-924 [Conf]
  4. Mordechai Shalom, Shmuel Zaks
    Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:277-291 [Conf]
  5. Michele Flammini, Mordechai Shalom, Shmuel Zaks
    On Minimizing the Number of ADMs in a General Topology Optical Network. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:459-473 [Conf]
  6. Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
    Approximating the Traffic Grooming Problem in Tree and Star Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:147-158 [Conf]
  7. Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
    On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
    SSS, 2007, pp:114-123 [Conf]
  8. Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
    Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:435-449 [Conf]
  9. Mordechai Shalom, Walter Unger, Shmuel Zaks
    On the Complexity of the Traffic Grooming Problem in Optical Networks. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:262-271 [Conf]
  10. Michele Flammini, Mordechai Shalom, Shmuel Zaks
    On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:4, pp:448-455 [Journal]
  11. Mordechai Shalom, Shmuel Zaks
    Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:2-3, pp:250-262 [Journal]

  12. Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. [Citation Graph (, )][DBLP]


  13. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. [Citation Graph (, )][DBLP]


  14. Minimizing total busy time in parallel scheduling with application to optical networks. [Citation Graph (, )][DBLP]


  15. On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. [Citation Graph (, )][DBLP]


  16. On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology. [Citation Graph (, )][DBLP]


  17. Traffic Grooming in Star Networks via Matching Techniques. [Citation Graph (, )][DBLP]


  18. A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. [Citation Graph (, )][DBLP]


  19. Shmuel Zaks - The Mathematician, Computer Scientist and Personality. [Citation Graph (, )][DBLP]


  20. Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. [Citation Graph (, )][DBLP]


  21. Selfishness, collusion and power of local search for the ADMs minimization problem. [Citation Graph (, )][DBLP]


  22. On minimizing the number of ADMs in a general topology optical network. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002