Author:
Chalopin Jérémie,Das Shantanu,Labourel Arnaud,Markou Euripides
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Chalopin, J., Das, S., Labourel, A., Markou, E.: Tight bounds for black hole search with scattered agents in synchronous rings. ArXiv Preprint (arXiv:1104.5076v1) (2011)
2. Lecture Notes in Computer Science;J. Chalopin,2007
3. Lecture Notes in Computer Science;C. Cooper,2006
4. Lecture Notes in Computer Science;J. Czyzowicz,2010
5. Czyzowicz, J., Kowalski, D., Markou, E., Pelc, A.: Complexity of searching for a black hole. Fundamenta Informaticae 71(2,3), 229–242 (2006)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献