Author of the publication

Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks.

, , and . Theor. Comput. Sci., 147 (1&2): 1-18 (1995)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the List Colouring Problem., , and . ASIAN, volume 2550 of Lecture Notes in Computer Science, page 47-56. Springer, (2002)Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks., , and . Electron. Notes Discret. Math., (2010)Scheduling in the presence of processor networks : complexity and approximation., , , and . RAIRO Oper. Res., 46 (1): 1-22 (2012)Optimal Schedules for d-D Grid Graphs with Communication Delays., , and . Parallel Comput., 24 (11): 1653-1664 (1998)AT-Dist: Distributed Localization Method with High Accuracy in Sensor Networks., , and . Stud. Inform. Univ., 6 (1): 14-39 (2008)Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays., , , and . Euro-Par, volume 3648 of Lecture Notes in Computer Science, page 252-261. Springer, (2005)General and Efficient Decentralized Consensus Protocols., , and . WDAG, volume 312 of Lecture Notes in Computer Science, page 41-56. Springer, (1987)Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract)., , and . STACS, volume 1046 of Lecture Notes in Computer Science, page 655-666. Springer, (1996)Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs., , and . IEEE Trans. Parallel Distributed Syst., 9 (7): 679-686 (1998)An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications., , and . Theor. Comput. Sci., 290 (3): 1883-1895 (2003)