| Distributed computation in dynamic networks F Kuhn, N Lynch, R Oshman Proceedings of the forty-second ACM symposium on Theory of computing, 513-522, 2010 | 470 | 2010 |
| Dynamic networks: models and algorithms F Kuhn, R Oshman ACM SIGACT News 42 (1), 82-96, 2011 | 267 | 2011 |
| On the power of the congested clique model A Drucker, F Kuhn, R Oshman Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014 | 204 | 2014 |
| Coordinated consensus in dynamic networks F Kuhn, Y Moses, R Oshman Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011 | 139 | 2011 |
| A tight bound for set disjointness in the message-passing model M Braverman, F Ellen, R Oshman, T Pitassi, V Vaikuntanathan 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 668-677, 2013 | 90 | 2013 |
| Broadcasting in unreliable radio networks F Kuhn, N Lynch, C Newport, R Oshman, A Richa Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010 | 61 | 2010 |
| Interactive distributed proofs G Kol, R Oshman, RR Saxena Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 50 | 2018 |
| Three notes on distributed property testing G Even, O Fischer, P Fraigniaud, T Gonen, R Levi, M Medina, ... 31st International Symposium on Distributed Computing (DISC 2017), 2017 | 45 | 2017 |
| Gradient clock synchronization in dynamic networks F Kuhn, T Locher, R Oshman Proceedings of the twenty-first annual symposium on Parallelism in …, 2009 | 45 | 2009 |
| Possibilities and impossibilities for distributed subgraph detection O Fischer, T Gonen, F Kuhn, R Oshman Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 44 | 2018 |
| The communication complexity of distributed task allocation A Drucker, F Kuhn, R Oshman Proceedings of the 2012 ACM symposium on Principles of distributed computing …, 2012 | 38 | 2012 |
| Optimal gradient clock synchronization in dynamic networks F Kuhn, C Lenzen, T Locher, R Oshman Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010 | 38 | 2010 |
| Distributed approximate maximum matching in the CONGEST model M Ahmadi, F Kuhn, R Oshman 32nd International Symposium on Distributed Computing (DISC 2018), 2018 | 34 | 2018 |
| Sublinear-time distributed algorithms for detecting small cliques and even cycles T Eden, N Fiat, O Fischer, F Kuhn, R Oshman Distributed Computing, 1-28, 2022 | 32 | 2022 |
| The skiptrie: low-depth concurrent search without rebalancing R Oshman, N Shavit Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013 | 30 | 2013 |
| The complexity of data aggregation in directed networks F Kuhn, R Oshman International Symposium on Distributed Computing, 416-431, 2011 | 26 | 2011 |
| Lower bounds for subgraph detection in the CONGEST model T Gonen, R Oshman 21st International Conference on Principles of Distributed Systems (OPODIS 2017), 2018 | 20 | 2018 |
| Fast distributed algorithms for girth, cycles and small subgraphs K Censor-Hillel, O Fischer, T Gonen, FL Gall, D Leitersdorf, R Oshman arXiv preprint arXiv:2101.07590, 2021 | 17 | 2021 |
| On distributed Merlin-Arthur decision protocols P Fraigniaud, P Montealegre, R Oshman, I Rapaport, I Todinca International Colloquium on Structural Information and Communication …, 2019 | 17 | 2019 |
| On information complexity in the broadcast model M Braverman, R Oshman Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 17 | 2015 |
