Richard Cole
Richard Cole
Professor of Computer Science, Courant Institute, New York University
Bestätigte E-Mail-Adresse bei cs.nyu.edu
Titel
Zitiert von
Zitiert von
Jahr
Parallel merge sort
R Cole
SIAM Journal on Computing 17 (4), 770-785, 1988
12861988
Deterministic coin tossing with applications to optimal parallel list ranking
R Cole, U Vishkin
Information and Control 70 (1), 32-53, 1986
4651986
Slowing down sorting networks to obtain faster sorting algorithms
R Cole
Journal of the ACM (JACM) 34 (1), 200-208, 1987
3671987
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
3002004
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
2951989
Faster optimal parallel prefix sums and list ranking
R Cole, U Vishkin
Information and computation 81 (3), 334-352, 1989
2911989
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
2722003
Visibility problems for polyhedral terrains
R Cole, M Sharir
Journal of symbolic Computation 7 (1), 11-30, 1989
2711989
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
2611986
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
2361988
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
2291986
On edge coloring bipartite graphs
R Cole, J Hopcroft
SIAM Journal on Computing 11 (3), 540-546, 1982
2291982
How much can taxes help selfish routing?
R Cole, Y Dodis, T Roughgarden
Journal of Computer and System Sciences 72 (3), 444-467, 2006
2282006
Edge-Coloring Bipartite Multigraphs in O(E logD) Time
R Cole, K Ost, S Schirra
Combinatorica 21 (1), 5-12, 2001
2262001
The APRAM: Incorporating asynchrony into the PRAM model
R Cole, O Zajicek
Proceedings of the first annual ACM symposium on Parallel algorithms and …, 1989
2261989
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
1952002
The sample complexity of revenue maximization
R Cole, T Roughgarden
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
1922014
On k-hulls and related problems
R Cole, M Sharir, CK Yap
Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984
1881984
Searching and storing similar lists
R Cole
Journal of Algorithms 7 (2), 202-220, 1986
1851986
Shape from probing
R Cole, CK Yap
Journal of Algorithms 8 (1), 19-38, 1987
1821987
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20