| Algebraic methods in the congested clique K Censor-Hillel, P Kaski, JH Korhonen, C Lenzen, A Paz, J Suomela Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 130 | 2015 |
| Smaller cuts, higher lower bounds A Abboud, K Censor-Hillel, S Khoury, A Paz ACM Transactions on Algorithms (TALG) 17 (4), 1-40, 2021 | 116* | 2021 |
| Rumor spreading with no dependence on conductance K Censor-Hillel, B Haeupler, J Kelner, P Maymounkov SIAM Journal on Computing 46 (1), 58-79, 2017 | 95* | 2017 |
| Tight bounds for asynchronous randomized consensus H Attiya, K Censor Journal of the ACM (JACM) 55 (5), 1-26, 2008 | 82 | 2008 |
| Derandomizing local distributed algorithms under bandwidth restrictions K Censor-Hillel, M Parter, G Schwartzman Distributed Computing 33 (3-4), 349-366, 2020 | 76 | 2020 |
| Polylogarithmic concurrent data structures from monotone circuits J Aspnes, H Attiya, K Censor-Hillel Journal of the ACM (JACM) 59 (1), 1-24, 2012 | 71* | 2012 |
| Fast distributed algorithms for testing graph properties K Censor-Hillel, E Fischer, G Schwartzman, Y Vasudev Distributed Computing 32, 41-57, 2019 | 56 | 2019 |
| Distributed connectivity decomposition K Censor-Hillel, M Ghaffari, F Kuhn Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014 | 55 | 2014 |
| Fast information spreading in graphs with large weak conductance K Censor-Hillel, H Shachnai SIAM Journal on Computing 41 (6), 1451-1465, 2012 | 53 | 2012 |
| Are lock-free concurrent algorithms practically wait-free? D Alistarh, K Censor-Hillel, N Shavit Journal of the ACM (JACM) 63 (4), 1-20, 2016 | 51 | 2016 |
| Optimal dynamic distributed MIS K Censor-Hillel, E Haramaty, Z Karnin Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 51 | 2016 |
| A distributed (2+ ε)-approximation for vertex cover in o (log δ/ε log log δ) rounds R Bar-Yehuda, K Censor-Hillel, G Schwartzman Journal of the ACM (JACM) 64 (3), 1-11, 2017 | 50 | 2017 |
| Lower bounds for randomized consensus under a weak adversary H Attiya, K Censor Proceedings of the twenty-seventh ACM symposium on Principles of distributed …, 2008 | 50 | 2008 |
| Fast approximate shortest paths in the congested clique K Censor-Hillel, M Dory, JH Korhonen, D Leitersdorf Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 47 | 2019 |
| Partial information spreading with application to distributed maximum coverage K Censor Hillel, H Shachnai Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010 | 47 | 2010 |
| Help! K Censor-Hillel, E Petrank, S Timnat Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 45 | 2015 |
| Distributed approximation of maximum independent set and maximum matching R Bar-Yehuda, K Censor-Hillel, M Ghaffari, G Schwartzman Proceedings of the ACM Symposium on Principles of Distributed Computing, 165-174, 2017 | 44 | 2017 |
| Structuring unreliable radio networks K Censor-Hillel, S Gilbert, F Kuhn, N Lynch, C Newport Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011 | 42 | 2011 |
| Optimal-time adaptive strong renaming, with applications to counting D Alistarh, J Aspnes, K Censor-Hillel, S Gilbert, M Zadimoghaddam Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011 | 41 | 2011 |
| Approximate proof-labeling schemes K Censor-Hillel, A Paz, M Perry Theoretical Computer Science 811, 112-124, 2020 | 39 | 2020 |
James AspnesYale UniversityVerified email at yale.edu
