| Algebraic methods in the congested clique K Censor-Hillel, P Kaski, JH Korhonen, C Lenzen, A Paz, J Suomela Distributed Computing 32 (6), 461-478, 2019 | 87 | 2019 |
| 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 | 81* | 2017 |
| Tight bounds for asynchronous randomized consensus H Attiya, K Censor Journal of the ACM (JACM) 55 (5), 1-26, 2008 | 65 | 2008 |
| Polylogarithmic concurrent data structures from monotone circuits J Aspnes, H Attiya, K Censor-Hillel Journal of the ACM (JACM) 59 (1), 1-24, 2012 | 56* | 2012 |
| Near-linear lower bounds for distributed distance computations, even in sparse networks A Abboud, K Censor-Hillel, S Khoury International Symposium on Distributed Computing, 29-42, 2016 | 50 | 2016 |
| Fast information spreading in graphs with large weak conductance K Censor-Hillel, H Shachnai SIAM Journal on Computing 41 (6), 1451-1465, 2012 | 47 | 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 | 41 | 2016 |
| Lower bounds for randomized consensus under a weak adversary H Attiya, K Censor-Hillel SIAM Journal on Computing 39 (8), 3885-3904, 2010 | 41 | 2010 |
| Distributed connectivity decomposition K Censor-Hillel, M Ghaffari, F Kuhn Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014 | 40 | 2014 |
| Structuring unreliable radio networks K Censor-Hillel, S Gilbert, F Kuhn, N Lynch, C Newport Distributed Computing 27 (1), 1-19, 2014 | 39 | 2014 |
| 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 | 37 | 2011 |
| Fast distributed algorithms for testing graph properties K Censor-Hillel, E Fischer, G Schwartzman, Y Vasudev Distributed Computing 32 (1), 41-57, 2019 | 35 | 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 | 32 | 2010 |
| Approximate shared-memory counting despite a strong adversary J Aspnes, K Censor ACM Transactions on Algorithms (TALG) 6 (2), 1-23, 2010 | 32 | 2010 |
| 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 | 31 | 2017 |
| Optimal dynamic distributed MIS K Censor-Hillel, E Haramaty, Z Karnin Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 31 | 2016 |
| Quadratic and near-quadratic lower bounds for the CONGEST model K Censor-Hillel, S Khoury, A Paz arXiv preprint arXiv:1705.05646, 2017 | 30 | 2017 |
| A new perspective on vertex connectivity K Censor-Hillel, M Ghaffari, F Kuhn Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 29 | 2014 |
| Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. K Censor-Hillel, M Parter, G Schwartzman DISC, 11:1-11:16, 2017 | 27 | 2017 |
| Tight bounds for asynchronous renaming D Alistarh, J Aspnes, K Censor-Hillel, S Gilbert, R Guerraoui Journal of the ACM (JACM) 61 (3), 1-51, 2014 | 25 | 2014 |
James AspnesYale UniversityVerified email at yale.edu
