From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Time Optimal Algorithms for Black Hole Search in Rings.

B. Balamohan, P. Flocchini, A. Miri, и N. Santoro. COCOA (2), том 6509 из Lecture Notes in Computer Science, стр. 58-71. Springer, (2010)

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.

No persons found for author name Balamohan, Balasingham

Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles.B. Balamohan, S. Dobrev, P. Flocchini, и N. Santoro. SIROCCO, том 7355 из Lecture Notes in Computer Science, стр. 279-290. Springer, (2012)Time Optimal Algorithms for Black Hole Search in Rings.B. Balamohan, P. Flocchini, A. Miri, и N. Santoro. COCOA (2), том 6509 из Lecture Notes in Computer Science, стр. 58-71. Springer, (2010)Improving the Optimal Bounds for Black Hole Search in Rings.B. Balamohan, P. Flocchini, A. Miri, и N. Santoro. SIROCCO, том 6796 из Lecture Notes in Computer Science, стр. 198-209. Springer, (2011)