Richard Cole
Affiliations: New York University, Courant Institute, NY, USA
According to our database^{1},
Richard Cole
authored at least 142 papers
between 1968 and 2023.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 1998, "Richard Cole has developed innovative and enabling paradigms, algorithms and methods of analysis: in computational geometry, parallel computing, and string and pattern matching.".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org

on cs.nyu.edu

on dl.acm.org
On csauthors.net:
Bibliography
2023
CoRR, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
2021
Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism.
SIAM J. Optim., 2021
Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup.
Math. Program., 2021
J. Econ. Theory, 2021
CoRR, 2021
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
2020
Games Econ. Behav., 2020
CoRR, 2020
Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, 2020
2019
CoRR, 2019
2018
(Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup.
CoRR, 2018
CoRR, 2018
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
Proceedings of the TwentySeventh International Joint Conference on Artificial Intelligence, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
ACM Trans. Parallel Comput., 2017
ACM Trans. Economics and Comput., 2017
CoRR, 2017
CoRR, 2017
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
2016
CoRR, 2016
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016
2015
SIGecom Exch., 2015
Games Econ. Behav., 2015
CoRR, 2015
Algorithmica, 2015
2014
ACM Trans. Algorithms, 2014
CoRR, 2014
Proceedings of the Symposium on Theory of Computing, 2014
Proceedings of the Automata, Languages, and Programming  41st International Colloquium, 2014
2013
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013
Proceedings of the International conference on Autonomous Agents and MultiAgent Systems, 2013
2012
Networks, 2012
CoRR, 2012
CoRR, 2012
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012
2011
CoRR, 2011
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
2010
Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses
CoRR, 2010
Coordination Mechanisms for Weighted Sum of Completion Times in Machine Scheduling
CoRR, 2010
2008
Algorithmica, 2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008
2007
Theor. Comput. Sci., 2007
SIAM J. Discret. Math., 2007
Electron. Colloquium Comput. Complex., 2007
2006
J. Comput. Syst. Sci., 2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
2005
SIAM J. Comput., 2005
J. Autom. Lang. Comb., 2005
Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005
Proceedings of the 10th IEEE International Conference on Computer Vision (ICCV 2005), 2005
2004
Inf. Comput., 2004
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Proceedings of the Algorithms, 2004
2003
SIAM J. Comput., 2003
SIAM J. Comput., 2003
On special families of morphisms related to [delta]matching and don't care symbols.
Inf. Process. Lett., 2003
Inf. Comput., 2003
Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2003
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
2002
SIAM J. Comput., 2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
Proceedings of the Algorithms, 2002
Proceedings of the Algorithms, 2002
2001
J. Comput. Syst. Sci., 2001
Comb., 2001
Proceedings of the Algorithm Engineering, 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
2000
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log nBlock Sequences.
SIAM J. Comput., 2000
An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.
SIAM J. Comput., 2000
SIAM J. Comput., 2000
1999
Tree Pattern Matching and Subset Matching in Deterministic <i>O</i>(<i>n</i> log<sup>3</sup> <i>n</i>)time.
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999
1998
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998
1997
SIAM J. Comput., 1997
SIAM J. Comput., 1997
Tree Pattern Matching and Subset Matching in Randomized O(n log<sup>3</sup>m) Time.
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
1996
Algorithmica, 1996
Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.
Proceedings of the Seventh Annual ACMSIAM Symposium on Discrete Algorithms, 1996
1995
SIAM J. Comput., 1995
J. Comput. Syst. Sci., 1995
J. Algorithms, 1995
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
1994
SIAM J. Comput., 1994
CVGIP Graph. Model. Image Process., 1994
1993
SIAM J. Comput., 1993
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
Proceedings of the TwentyFifth Annual ACM Symposium on Theory of Computing, 1993
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993
1992
Int. J. Comput. Geom. Appl., 1992
Int. J. Comput. Geom. Appl., 1992
Algorithmica, 1992
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
1991
Approximate Parallel Scheduling. II. Applications to LogarithmicTime Optimal Parallel Graph Algorithms
Inf. Comput., May, 1991
SIGACT News, 1991
1990
An Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location.
J. Parallel Distributed Comput., 1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version).
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
Inf. Comput., June, 1989
SIAM J. Comput., 1989
SIAM J. Comput., 1989
J. Symb. Comput., 1989
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989
1988
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time.
SIAM J. Comput., 1988
SIAM J. Comput., 1988
J. ACM, 1988
Inf. Process. Lett., 1988
The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time.
Algorithmica, 1988
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
Theor. Comput. Sci., 1987
SIAM J. Comput., 1987
J. Algorithms, 1987
J. ACM, 1987
1986
Inf. Control., July, 1986
J. Algorithms, 1986
Inf. Control., 1986
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
1985
Inf. Process. Lett., 1985
Proceedings of the Automata, 1985
On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
1984
Inf. Control., 1984
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1982
Two Problems in Graph Theory.
PhD thesis, 1982
SIAM J. Comput., 1982
1968
Notre Dame J. Formal Log., 1968