Deterministic network exploration by a single agent with Byzantine tokens-Reference-Cited by-同舟云学术

Deterministic network exploration by a single agent with Byzantine tokens

Published:2012-06 Issue:12 Volume:112 Page:467-470
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Dieudonné Yoann,Pelc Andrzej

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference22 articles.

1. Exploring unknown environments;Albers;SIAM J. Comput.,2000

2. Tree exploration with logarithmic memory;Ambuehl;ACM Trans. Algorithms,2011

3. B. Awerbuch, M. Betke, R. Rivest, M. Singh, Piecemeal graph learning by a mobile robot, in: Proc. 8th Conf. on Comput. Learning Theory, 1995, pp. 321–328.

4. M.A. Bender, A. Fernandez, D. Ron, A. Sahai, S. Vadhan, The power of a pebble: exploring and mapping directed graphs, in: Proc. STOC 1998, pp. 269–278.

5. M.A. Bender, D. Slonim, The power of team exploration: Two robots can learn unlabeled directed graphs, in: Proc. FOCS 1994, pp. 75–85.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots;Theoretical Computer Science;2021-10

2. How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults;Lecture Notes in Computer Science;2017

3. Exploration of Faulty Hamiltonian Graphs;International Journal of Foundations of Computer Science;2016-11

4. Rendezvous in networks in spite of delay faults;Distributed Computing;2015-11-25

5. A Single Agent Exploration in Unknown Undirected Graphs with Whiteboards;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2015