Tight bounds for black hole search with scattered agents in synchronous rings - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Jérémie Chalopin, Shantanu Das 0001, Arnaud Labourel, Euripides Markou. Tight bounds for black hole search with scattered agents in synchronous rings. Theoretical Computer Science, 509:70-85, 2013. [doi]

The following publications are possibly variants of this publication:

Tight Bounds for Scattered Black Hole Search in a RingJérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou. sirocco 2011: 186-197 [doi]

Approximation Bounds for Black Hole Search ProblemsRalf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco. opodis 2006: 261-274 [doi]

Approximation bounds for Black Hole Search problemsRalf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco. networks, 52(4):216-226, 2008. [doi]

Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite AutomataEuripides Markou, Michel Paquette. opodis 2012: 239-253 [doi]

Black Hole Search with Finite Automata Scattered in a Synchronous TorusJérémie Chalopin, Shantanu Das 0001, Arnaud Labourel, Euripides Markou. wdag 2011: 432-446 [doi]

Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile AgentsNikos Giachoudis, Maria Kokkou, Euripides Markou. sirocco 2020: 220-236 [doi]

runs on WebDSL