( en | de | ru )

 

Disambiguation of "Dobrev, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
Searching for a black hole in arbitrary networks: optimal mobile agent protocols.

, , , and . PODC, page 153-161. ACM, (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.

Ivan Dobrev

Plamen Dobrev

Boris Dobrev

Dobromir Dobrev

Stefan Schwärzler

Graphische Modelle im natürlichsprachlichen Mensch-Maschine-Dialog. TU München, (2010)
 

Other publications of authors with the same name

Weak Coverage of a Rectangular Barrier., , , , , , , , and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 196-208. (2017)On the Complexity of Distributed Wake-Up., , and . CANDAR, page 559-564. IEEE Computer Society, (2016)Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search., , and . ICDCS, page 57. IEEE Computer Society, (2006)Leader Election using Any Sense of Direction.. SIROCCO, page 93-104. Carleton Scientific, (1999)Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes., , and . SIROCCO, page 173-187. Carleton Scientific, (1998)Mobile Search for a Black Hole in an Anonymous Ring., , , and . Algorithmica, 48 (1): 67-90 (2007)Live Exploration of Dynamic Rings., , , and . ICDCS, page 570-579. IEEE Computer Society, (2016)Independent Set with Advice: The Impact of Graph Knowledge - (Extended Abstract)., , and . WAOA, volume 7846 of Lecture Notes in Computer Science, page 2-15. Springer, (2012)How Much Information about the Future Is Needed?, , and . SOFSEM, volume 4910 of Lecture Notes in Computer Science, page 247-258. Springer, (2008)Efficient wakeup in anonymous oriented complete graphs.. SIROCCO, page 79-93. Carleton Scientific, (2000)