Richard J. Cole
#37,937
Most Influential Person Now
American computer scientist
Richard J. Cole's AcademicInfluence.com Rankings
Richard J. Colecomputer-science Degrees
Computer Science
#1848
World Rank
#1919
Historical Rank
Computational Linguistics
#1987
World Rank
#2008
Historical Rank
Machine Learning
#3080
World Rank
#3118
Historical Rank
Artificial Intelligence
#3312
World Rank
#3360
Historical Rank
Download Badge
Computer Science
Richard J. Cole's Degrees
- PhD Computer Science Stanford University
- Masters Computer Science Stanford University
- Bachelors Computer Science Stanford University
Similar Degrees You Can Earn
Why Is Richard J. Cole Influential?
(Suggest an Edit or Addition)According to Wikipedia, Richard J. Cole is a Silver Professor of Computer Science at the Courant Institute of Mathematical Sciences, New York University, and works on the Design and Analysis of Computer Algorithms. Research His research areas include algorithmic economic market theory and game theory, string and pattern matching, amortization, parallelism, and network and routing problems. His notable research contributions include an optimal parallel algorithm for sorting in the PRAM model, and an optimal analysis of the Boyer–Moore string-search algorithm.
Richard J. Cole's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Parallel merge sort (1988) (971)
- Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking (2018) (433)
- Slowing down sorting networks to obtain faster sorting algorithms (2015) (298)
- Dictionary matching and indexing with errors and don't cares (2004) (270)
- Pricing network edges for heterogeneous selfish users (2003) (241)
- The sample complexity of revenue maximization (2014) (236)
- Cascading divide-and-conquer: A technique for designing parallel algorithms (1989) (220)
- Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms (1986) (211)
- Edge-Coloring Bipartite Multigraphs in O(E logD) Time (1999) (206)
- Faster Optimal Parallel Prefix Sums and List Ranking (2011) (203)
- How much can taxes help selfish routing? (2003) (199)
- Visibility Problems for Polyhedral Terrains (2018) (196)
- Approximate and exact parallel scheduling with applications to list, tree and graph problems (1986) (193)
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (1988) (188)
- On k-hulls and related problems (1984) (167)
- The APRAM: incorporating asynchrony into the PRAM model (1989) (162)
- Two Simplified Algorithms for Maintaining Order in a List (2002) (157)
- Shape from Probing (2018) (146)
- On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof (2000) (139)
- Dynamic LCA queries on trees (2005) (136)
- Approximating the Nash Social Welfare with Indivisible Items (2015) (136)
- An Optimal-Time Algorithm for Slope Selection (1989) (132)
- Verifying candidate matches in sparse and wildcard matching (2002) (128)
- Convex Program Duality, Fisher Markets, and Nash Social Welfare (2016) (123)
- An O(n log n) algorithm for the maximum agreement subtree problem for binary trees (1996) (118)
- On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences (1995) (114)
- Approximate string matching: a simpler faster algorithm (2002) (112)
- Searching and Storing Similar Lists (2018) (108)
- On Edge Coloring Bipartite Graphs (1980) (106)
- Searching dynamic point sets in spaces with bounded doubling dimension (2006) (91)
- Mechanism design for fair division: allocating divisible items without payments (2012) (84)
- On the dynamic finger conjecture for splay trees (1990) (84)
- An Optimally Efficient Selection Algorithm (1988) (79)
- River Routing Every Which Way, but Loose (Extended Abstract) (1984) (75)
- Tatonnement beyond gross substitutes?: gradient descent to the rescue (2013) (73)
- Tight bounds on the complexity of the Boyer-Moore string matching algorithm (1994) (73)
- The expected advantage of asynchrony (1990) (72)
- Tree pattern matching and subset matching in deterministic O(n log3 n)-time (1999) (72)
- Faster suffix tree construction with missing suffix links (2000) (72)
- Fast-converging tatonnement algorithms for one-time and ongoing market problems (2008) (66)
- Overlap matching (2001) (65)
- Geometric retrieval problems (1986) (65)
- Finding minimum spanning forests in logarithmic time and linear work using random sampling (1996) (62)
- Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions (1993) (62)
- Exponential Structures for Efficient Cache-Oblivious Algorithms (2002) (61)
- Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms (1991) (59)
- Resource Oblivious Sorting on Multicores (2010) (57)
- On Balls and Bins with Deletions (1998) (51)
- Optimal parallel algorithms for polygon and point-set problems (1988) (50)
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time (2011) (49)
- A Parallel Median Algorithm (1985) (48)
- Randomized protocols for low-congestion circuit routing in multistage interconnection networks (1998) (47)
- A unified access bound on comparison-based dynamic dictionaries (2007) (46)
- Function Matching: Algorithms, Applications, and a Lower Bound (2003) (46)
- Optimised Predecessor Data Structures for Internal Memory (2001) (45)
- Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking (1988) (42)
- Inner product spaces for MinSum coordination mechanisms (2010) (42)
- Bottleneck links, variable demand, and the tragedy of the commons (2006) (41)
- Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy (2002) (40)
- Tree pattern matching and subset matching in randomized O(nlog3m) time (1997) (39)
- Decentralized utilitarian mechanisms for scheduling games (2015) (38)
- Randomized parallel algorithms for trapezoidal diagrams (1992) (34)
- A faster implementation of the Goemans-Williamson clustering algorithm (2001) (34)
- Prompt Mechanisms for Online Auctions (2008) (31)
- Tighter Lower Bounds on the Exact Complexity of String Matching (1995) (31)
- Tatonnement in ongoing markets of complementary goods (2012) (28)
- On the benefit of supporting virtual channels in wormhole routers (1996) (28)
- A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees (1994) (28)
- Suffix Trays and Suffix Trists: Structures for Faster Text Indexing (2006) (25)
- Geometric applications of Davenport-Schinzel sequences (1986) (25)
- Two Problems in Graph Theory (1982) (24)
- Multi-scale self-simulation: a technique for reconfiguring arrays with faults (1993) (23)
- A fast algorithm for computing steiner edge connectivity (2003) (23)
- Tighter bounds on the exact complexity of string matching (1992) (23)
- Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version) (1990) (23)
- Reconfiguring Arrays with Faults Part I: Worst-Case Faults (1997) (22)
- Dynamics of Distributed Updating in Fisher Markets (2018) (22)
- Optimal VLSI circuits for sorting (2011) (21)
- Routing on butterfly networks with random faults (1995) (21)
- Positive results for mechanism design without money (2013) (20)
- New Upper Bounds for Neighbor Searching (1986) (20)
- Efficient Resource Oblivious Algorithms for Multicores with False Sharing (2012) (20)
- Merging free tree in parallel for efficient voronoi diagram construction (1990) (20)
- New Linear-Time Algorithms for Edge-Coloring Planar Graphs (2008) (19)
- Tree Pattern Matching to Subset Matching in Linear Time (2003) (19)
- The Complexity of the Minimum k-Cover Problem (2005) (18)
- An Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location (1990) (18)
- Analysis of Randomized Work Stealing with False Sharing (2011) (17)
- Applications of α-Strongly Regular Distributions to Bayesian Auctions (2015) (15)
- Pricing Networks with Selfish Routing (2003) (14)
- Optimal Slope Selection (1988) (14)
- Computing the Minimum k-Cover of a String (2003) (14)
- Non-quasi-linear Agents in Quasi-linear Mechanisms (2020) (14)
- Mechanism Design for Fair Division (2012) (13)
- A Truthful Cardinal Mechanism for One-Sided Matching (2019) (13)
- Amortized Analysis on Asynchronous Gradient Descent (2014) (12)
- A Generalization of Kotzig's Theorem and Its Application (2007) (12)
- On special families of morphisms related to [delta]-matching and don't care symbols (2003) (12)
- On information flow and sorting : New upper and lower bounds for VLSI circuits (1985) (12)
- Efficient Resource Oblivious Algorithms for Multicores (2011) (11)
- Large Market Games with Near Optimal Efficiency (2015) (11)
- Indivisible Markets with Good Approximate EquilibriumPrices (2007) (10)
- Proceedings of the Prague Stringology Conference '03 (2003) (10)
- Partitioning Point Sets in 4 Dimensions (2018) (10)
- Finding tree structures by grouping symmetries (2005) (9)
- Erratum: Randomized parallel algorithms for trapezoidal diagrams (1992) (9)
- Approximating the nash social welfare with indivisible items (2015) (9)
- A nearly optimal deterministic parallel Voronoi diagram algorithm (1996) (9)
- Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses (2010) (9)
- When Does Diversity of User Preferences Improve Outcomes in Selfish Routing? (2017) (9)
- Revisiting the Cache Miss Analysis of Multithreaded Algorithms (2012) (9)
- A Unified Approach to Analyzing Asynchronous Coordinate Descent and Tatonnement (2016) (8)
- Tighter Upper Bounds on the Exact Complexity of String Matching (1997) (8)
- Amortized Analysis of Asynchronous Price Dynamics (2018) (8)
- Fast-Converging Tatonnement Algorithms for the Market Problem (2007) (7)
- Optimal parallel algorithms for point-set and polygon problems (1992) (6)
- Partitioning Point Sets in Arbitrary Dimension (2015) (6)
- Efficient Algorithms for Steiner Edge Connectivity Computation and Gomory-Hu Tree Construction for Unweighted Graphs ∗ (2008) (6)
- Two-Dimensional Parameterized Matching (2014) (6)
- The Price of Anarchy of Large Walrasian Auctions (2015) (5)
- When does the Price of Anarchy tend to 1 in Large Walrasian Auctions and Fisher Markets (2015) (5)
- An Analysis of Asynchronous Stochastic Accelerated Coordinate Descent (2018) (5)
- Which patterns are hard to find (1993) (5)
- Tatonnement beyond gross substitutes? Gradient descent to the rescue (2020) (5)
- The Average Case Analysis of Partition Sorts (2004) (4)
- Balancing the Robustness and Convergence of Tatonnement (2019) (4)
- Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract (2017) (4)
- Randomized Swap Matching in $O(m \log m \log (1999) (4)
- Tight Bounds on the Complexity of the Boyer-Moore Pattern Matching Algorithm (2017) (3)
- ''an Optimal Selection Algorithm'' (1986) (3)
- Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup (2018) (3)
- Fast Algorithms for Constructing Maximum Entropy Summary Trees (2014) (3)
- Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism (2018) (3)
- Multidimensional matching and fast search in suffix trees (2003) (2)
- On the Existence of Pareto Efficient and Envy Free Allocations (2019) (2)
- Coordination Mechanisms for Weighted Sum of Completion Times in Machine Scheduling (2010) (2)
- Applications of $\alpha$-strongly regular distributions to Bayesian auctions (2015) (2)
- Theory and algorithms for modern problems in machine learning and an analysis of markets (2008) (2)
- (Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup (2018) (1)
- Truthfulness, Proportional Fairness, and Efficiency (2012) (1)
- Stable Matching: Choosing Which Proposals to Make (2022) (1)
- Notes on the AKS sorting network, as improved by Paterson (1986) (1)
- On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits Extended Abstract (1985) (1)
- Tighter bounds on the comparison complexity of string matching (1992) (1)
- Selecting a Match: Exploration vs Decision (2021) (1)
- Parallel two dimensional witness computation (2004) (1)
- Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup (2020) (0)
- Proceedings 12th Australasian Workshop on Combinatorial Algorithms (2001) (0)
- Pushdown Automata and Context Free Languages , Part 5 (2008) (0)
- Relations Between δ-Matching and Matching with Don ’ t Care Symbols : δ-distinguishing Morphisms ( Preliminary Version ) (2009) (0)
- Randomized algorithms for trapezoidal decompositions (1991) (0)
- On the Detection of Robust Curves (2018) (0)
- Pricing networks with selfish routing (survey) (2003) (0)
- Truthful Mechanisms for Proportionally Fair Allocations (2012) (0)
- An Asynchronous Parallel Algorithm for Undirected Graph Connectivity (2017) (0)
- Tolerating Faults in Meshes and Other Networks (Abstract) (1993) (0)
- Proceeding of the Annual ACM-SIAM Symposium on Discrete Algorithms: Preface (2005) (0)
- Toward a local, discrete-step tatonnement process for market equilibrium (2005) (0)
- NP Completeness , Part 2 (2008) (0)
- Proximity problems for point sets with low doubling dimension (2009) (0)
- Suffix Trays and Suffix Trists: Structures for Faster Text Indexing (2014) (0)
- An optimal work randomized parallel algorithm for minimum spanning trees (1994) (0)
- The APRAM -- the rounds complexity measure and the explicit costs of synchronization (2011) (0)
- Relations between delta-matching and matching with don't care symbols: Delta distinguishing morphisms (2001) (0)
- Lower Bounds on Communication Complexity in VLSI (2015) (0)
- O C ] 2 5 M ay 2 01 9 Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup (2019) (0)
- [XOK90] T. Hagerup and C. Rub. Optimal Merging and Sorting on the EREW PRAM. Technical Report, Universit/it des Saarlandes, 1989. (2007) (0)
- Ph.D. thesis: Two problems in graph theory (1982) (0)
- Isomorphism of Strongly Regular Graphs (2011) (0)
- Which patterns are hard to find? (String matching) (1993) (0)
- Report on the Second Workshop on Parallel Algorithms (WOPA) (1991) (0)
- Mechanism Design for Fair Division 1 (2014) (0)
This paper list is powered by the following services:
Other Resources About Richard J. Cole
What Schools Are Affiliated With Richard J. Cole?
Richard J. Cole is affiliated with the following schools:
