Author of the publication

The Complexity of Systolic Dissemination of Information in Interconnection Networks.

, , , , and . Canada-France Conference on Parallel and Distributed Computing, volume 805 of Lecture Notes in Computer Science, page 235-249. Springer, (1994)

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

Online Exploration of Rectangular Grids., , , and . CoRR, (2016)Online Graph Coloring Against a Randomized Adversary., , , , , and . Int. J. Found. Comput. Sci., 29 (4): 551-569 (2018)Online Matching in Regular Bipartite Graphs., , , and . Parallel Process. Lett., 28 (2): 1850008:1-1850008:13 (2018)On the Complexity of the Traffic Grooming Problem in Optical Networks., , and . FUN, volume 4475 of Lecture Notes in Computer Science, page 262-271. Springer, (2007)Systolic Gossip in Complete Trees., and . SIROCCO, page 279-291. Carleton Scientific, (1996)Exploring Sparse Graphs with Advice (Extended Abstract)., , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 102-117. Springer, (2018)Optimal Embedding of Complete Binary Trees into Lines and Grids., , , and . J. Parallel Distributed Comput., 49 (1): 40-56 (1998)One Sided Crossing Minimization Is NP-Hard for Sparse Graphs., , and . GD, volume 2265 of Lecture Notes in Computer Science, page 115-123. Springer, (2001)A heuristic for logical data buffer allocation in multicore platforms., , , and . IPCCC, page 1-2. IEEE Computer Society, (2014)On the k-Colouring of Circle-Graphs.. STACS, volume 294 of Lecture Notes in Computer Science, page 61-72. Springer, (1988)