Author of the publication

Black Hole Search by Mobile Agents in Hypercubes and Related Networks.

, , , , , and . OPODIS, volume 3 of Studia Informatica Universalis, page 169-180. Suger, Saint-Denis, rue Catulienne, France, (2002)

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

Validity test for Floyd's operator-precedence parsing algorithms is polynomial in time.. Kybernetika, 17 (5): 368-379 (1981)Yet Another Modular Technique for Efficient Leader Election., and . SOFSEM, volume 1521 of Lecture Notes in Computer Science, page 312-321. Springer, (1998)On Efficiency of Interval Routing Algorithms.. MFCS, volume 324 of Lecture Notes in Computer Science, page 492-500. Springer, (1988)Efficient Tree Pattern Unification.. SOFSEM, volume 1175 of Lecture Notes in Computer Science, page 417-424. Springer, (1996)Preface.. Theor. Comput. Sci., 286 (1): 1 (2002)The complexity of shortest path and dilation bounded interval routing., , and . Theor. Comput. Sci., 234 (1-2): 85-107 (2000)A Note on the Efficiency of an Interval Routing Algorithm., and . Comput. J., 34 (5): 475-476 (1991)Size Complexity of Context-free Languages.. Elektronische Informationsverarbeitung und Kybernetik, 11 (4-6): 296-299 (1975)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)