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]
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. [Citation Graph (, )][DBLP]
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. [Citation Graph (, )][DBLP]
Minimizing total busy time in parallel scheduling with application to optical networks. [Citation Graph (, )][DBLP]
On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. [Citation Graph (, )][DBLP]
On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology. [Citation Graph (, )][DBLP]
Traffic Grooming in Star Networks via Matching Techniques. [Citation Graph (, )][DBLP]
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. [Citation Graph (, )][DBLP]
Shmuel Zaks - The Mathematician, Computer Scientist and Personality. [Citation Graph (, )][DBLP]
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. [Citation Graph (, )][DBLP]
Selfishness, collusion and power of local search for the ADMs minimization problem. [Citation Graph (, )][DBLP]
On minimizing the number of ADMs in a general topology optical network. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs
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