Author of the publication

Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes.

, , and . SIROCCO, page 173-187. Carleton Scientific, (1998)

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

Time and Space Bounds in Producing Certain Partial Orders.. MFCS, volume 88 of Lecture Notes in Computer Science, page 539-551. Springer, (1980)On Time-Space Trade-Offs in Dynamic Graph Pebbling., and . MFCS, volume 711 of Lecture Notes in Computer Science, page 671-681. Springer, (1993)On the Lower Bound for Minimum Comparison Selection., and . MFCS, volume 45 of Lecture Notes in Computer Science, page 495-502. Springer, (1976)Yet Another Modular Technique for Efficient Leader Election., and . SOFSEM, volume 1521 of Lecture Notes in Computer Science, page 312-321. Springer, (1998)Efficient Tree Pattern Unification.. SOFSEM, volume 1175 of Lecture Notes in Computer Science, page 417-424. Springer, (1996)On Efficiency of Interval Routing Algorithms.. MFCS, volume 324 of Lecture Notes in Computer Science, page 492-500. Springer, (1988)Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks., and . SIROCCO, volume 13 of Proceedings in Informatics, page 237-245. Carleton Scientific, (2002)On Immunity and Catastrophic Indices of Graphs., and . SIROCCO, volume 8 of Proceedings in Informatics, page 231-242. Carleton Scientific, (2001)Linear Broadcasting and N loglog N Election in Unoriented Hypercubes., and . SIROCCO, page 53-68. Carleton Scientific, (1997)On time versus size for monotone dynamic monopolies in regular topologies., , , , and . J. Discrete Algorithms, 1 (2): 129-150 (2003)