| Parallel merge sort R Cole SIAM Journal on Computing 17 (4), 770-785, 1988 | 1427 | 1988 |
| Deterministic coin tossing with applications to optimal parallel list ranking R Cole, U Vishkin Information and Control 70 (1), 32-53, 1986 | 552 | 1986 |
| Slowing down sorting networks to obtain faster sorting algorithms R Cole Journal of the ACM (JACM) 34 (1), 200-208, 1987 | 413 | 1987 |
| Dictionary matching and indexing with errors and don't cares R Cole, LA Gottlieb, M Lewenstein Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 336 | 2004 |
| Cascading divide-and-conquer: A technique for designing parallel algorithms MJ Atallah, R Cole, MT Goodrich SIAM Journal on Computing 18 (3), 499-532, 1989 | 323 | 1989 |
| Pricing network edges for heterogeneous selfish users R Cole, Y Dodis, T Roughgarden Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 322 | 2003 |
| The sample complexity of revenue maximization R Cole, T Roughgarden Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 316 | 2014 |
| Faster optimal parallel prefix sums and list ranking R Cole, U Vishkin Information and computation 81 (3), 334-352, 1989 | 307 | 1989 |
| Visibility problems for polyhedral terrains R Cole, M Sharir Journal of symbolic Computation 7 (1), 11-30, 1989 | 295 | 1989 |
| Approximate and exact parallel scheduling with applications to list, tree and graph problems R Cole, U Vishkin 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), 478-491, 1986 | 284 | 1986 |
| Edge-coloring bipartite multigraphs in O (E logD) time R Cole, K Ost, S Schirra Combinatorica 21 (1), 5-12, 2001 | 274 | 2001 |
| How much can taxes help selfish routing? R Cole, Y Dodis, T Roughgarden Proceedings of the 4th ACM Conference on Electronic Commerce, 98-107, 2003 | 265 | 2003 |
| On edge coloring bipartite graphs R Cole, J Hopcroft SIAM Journal on Computing 11 (3), 540-546, 1982 | 256 | 1982 |
| Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time R Cole, U Vishkin SIAM Journal on Computing 17 (1), 128-142, 1988 | 246 | 1988 |
| Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms R Cole, U Vishkin Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986 | 244 | 1986 |
| The APRAM: Incorporating asynchrony into the PRAM model R Cole, O Zajicek Proceedings of the first annual ACM symposium on Parallel algorithms and …, 1989 | 241 | 1989 |
| Two simplified algorithms for maintaining order in a list MA Bender, R Cole, ED Demaine, M Farach-Colton, J Zito European symposium on algorithms, 152-164, 2002 | 231 | 2002 |
| On k-hulls and related problems R Cole, M Sharir, CK Yap Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984 | 201 | 1984 |
| Searching and storing similar lists R Cole Journal of Algorithms 7 (2), 202-220, 1986 | 200 | 1986 |
| Convex program duality, Fisher markets, and Nash social welfare R Cole, N Devanur, V Gkatzelis, K Jain, T Mai, VV Vazirani, S Yazdanbod Proceedings of the 2017 ACM Conference on Economics and Computation, 459-460, 2017 | 191 | 2017 |
