Παρακολούθηση
Richard Cole
Richard Cole
Professor of Computer Science, Courant Institute, New York University
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα cs.nyu.edu
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Parallel merge sort
R Cole
SIAM Journal on Computing 17 (4), 770-785, 1988
14071988
Deterministic coin tossing with applications to optimal parallel list ranking
R Cole, U Vishkin
Information and Control 70 (1), 32-53, 1986
5341986
Slowing down sorting networks to obtain faster sorting algorithms
R Cole
Journal of the ACM (JACM) 34 (1), 200-208, 1987
4021987
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
3292004
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
3191989
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
3162003
Faster optimal parallel prefix sums and list ranking
R Cole, U Vishkin
Information and computation 81 (3), 334-352, 1989
3001989
The sample complexity of revenue maximization
R Cole, T Roughgarden
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
2972014
Visibility problems for polyhedral terrains
R Cole, M Sharir
Journal of symbolic Computation 7 (1), 11-30, 1989
2921989
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
2811986
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
2612003
Edge-coloring bipartite multigraphs in O (E logD) time
R Cole, K Ost, S Schirra
Combinatorica 21 (1), 5-12, 2001
2612001
On edge coloring bipartite graphs
R Cole, J Hopcroft
SIAM Journal on Computing 11 (3), 540-546, 1982
2451982
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
2441988
The APRAM: Incorporating asynchrony into the PRAM model
R Cole, O Zajicek
Proceedings of the first annual ACM symposium on Parallel algorithms and …, 1989
2421989
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
2391986
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
2212002
Searching and storing similar lists
R Cole
Journal of Algorithms 7 (2), 202-220, 1986
2051986
On k-hulls and related problems
R Cole, M Sharir, CK Yap
Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984
1991984
Shape from probing
R Cole, CK Yap
Journal of Algorithms 8 (1), 19-38, 1987
1901987
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20