Author:
Elsässer Robert,Sauerwald Thomas
Publisher
Springer Berlin Heidelberg
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Ant-inspired density estimation via random walks;Proceedings of the National Academy of Sciences;2017-09-19
2. Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs;Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures;2017-07-24
3. Ant-Inspired Density Estimation via Random Walks;Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing;2016-07-25
4. The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process;Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing;2016-07-25
5. Better Bounds for Coalescing-Branching Random Walks;Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures;2016-07-11