Author of the publication

Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree.

, , , , and . IFIP TCS, volume 155 of IFIP, page 153-166. Kluwer/Springer, (2004)

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

Death of a monster., and . SIGACT News, 31 (4): 130-133 (2000)Lower bounds on the rotation distance of binary trees., , and . Inf. Process. Lett., 110 (21): 934-938 (2010)On the Height of Height-Balanced Trees., and . IEEE Trans. Computers, 25 (1): 87-91 (1976)On a New Boolean Function with Applications., and . IEEE Trans. Computers, 48 (3): 296-310 (1999)Exploiting Regularities for Boolean Function Synthesis., , , and . Theory Comput. Syst., 39 (4): 485-501 (2006)Two New Applications of Dynamos., and . SIROCCO, volume 13 of Proceedings in Informatics, page 247-258. Carleton Scientific, (2002)The Fermat star of binary trees., and . Inf. Process. Lett., 109 (11): 568-571 (2009)A Preliminary Study of a Diagonal Channel-Routing Model., , and . Algorithmica, 4 (4): 585-597 (1989)Routing in Times Square Mode., , and . Inf. Process. Lett., 35 (1): 41-48 (1990)An Efficient Algorithm for Some Tree Matching Problems., and . Inf. Process. Lett., 39 (1): 51-57 (1991)