Author:
Benjamini Itai,Shinkar Igor,Tsur Gilad
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Sorting Networks on Restricted Topologies;SOFSEM 2019: Theory and Practice of Computer Science;2019
2. Collision-free network exploration;Journal of Computer and System Sciences;2017-06
3. New Results on Routing via Matchings on Graphs;Fundamentals of Computation Theory;2017
4. A Tight Upper Bound on Acquaintance Time of Graphs;Graphs and Combinatorics;2016-04-02
5. Acquaintance Time of Random Graphs Near Connectivity Threshold;SIAM Journal on Discrete Mathematics;2016-01