default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Cole 0001
Richard J. Cole
Person information
- affiliation: New York University, Courant Institute, NY, USA
Other persons with the same name
- Richard Cole 0002 (aka: Richard J. Cole II) — School of Information Technology and Electrical Engineering (ITEE), The University of Queensland, QLD, Australia
- Richard Cole 0003
![[0000-0002-4140-6539]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-4140-6539")
(aka: Richard A. Cole) — University of Bristol, UK
Other persons with a similar name
- Richard L. Cole — Tableau Software
- Richard Stephen Cole — Queen Mary University of London, UK
- Richard T. Cole — Michigan State University, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c82]Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh:
A First Order Method for Linear Programming Parameterized by Circuit Imbalance. IPCO 2024: 57-70- 2023
- [c81]Ishan Agarwal, Richard Cole:
Stable Matching: Choosing Which Proposals to Make. ICALP 2023: 8:1-8:20 - [i31]Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh:
A First Order Method for Linear Programming Parameterized by Circuit Imbalance. CoRR abs/2311.01959 (2023) - 2022
- [i30]Ishan Agarwal, Richard Cole:
Stable Matching: Choosing Which Proposals to Make. CoRR abs/2204.04162 (2022) - 2021
- [j64]Richard Cole, Yixin Tao:
On the existence of Pareto Efficient and envy-free allocations. J. Econ. Theory 193: 105207 (2021) - [j63]Yun Kuen Cheung, Richard Cole, Yixin Tao:
Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup. Math. Program. 190(1): 615-677 (2021) - [j62]Yun Kuen Cheung, Richard J. Cole, Yixin Tao:
Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism. SIAM J. Optim. 31(1): 448-460 (2021) - [c80]Moshe Babaioff, Richard Cole, Jason D. Hartline, Nicole Immorlica, Brendan Lucier:
Non-Quasi-Linear Agents in Quasi-Linear Mechanisms (Extended Abstract). ITCS 2021: 84:1-84:1 - [i29]Ishan Agarwal, Richard Cole, Yixin Tao:
Selecting a Match: Exploration vs Decision. CoRR abs/2106.08033 (2021) - 2020
- [j61]Yun Kuen Cheung, Richard Cole, Nikhil R. Devanur:
Tatonnement beyond gross substitutes? Gradient descent to the rescue. Games Econ. Behav. 123: 295-326 (2020) - [c79]Rediet Abebe, Richard Cole, Vasilis Gkatzelis, Jason D. Hartline:
A Truthful Cardinal Mechanism for One-Sided Matching. SODA 2020: 2096-2113 - [i28]Moshe Babaioff, Richard Cole, Jason D. Hartline, Nicole Immorlica, Brendan Lucier:
Non-quasi-linear Agents in Quasi-linear Mechanisms. CoRR abs/2012.02893 (2020)
2010 – 2019
- 2019
- [i27]Rediet Abebe, Richard Cole, Vasilis Gkatzelis, Jason D. Hartline:
A Truthful Cardinal Mechanism for One-Sided Matching. CoRR abs/1903.07797 (2019) - [i26]Richard Cole, Yixin Tao:
On the Existence of Pareto Efficient and Envy Free Allocations. CoRR abs/1906.07257 (2019) - [i25]Richard Cole, Yixin Tao:
Balancing the Robustness and Convergence of Tatonnement. CoRR abs/1908.00844 (2019) - 2018
- [j60]Richard Cole, Vasilis Gkatzelis:
Approximating the Nash Social Welfare with Indivisible Items. SIAM J. Comput. 47(3): 1211-1236 (2018) - [c78]Yun Kuen Cheung, Richard Cole:
Amortized Analysis of Asynchronous Price Dynamics. ESA 2018: 18:1-18:15 - [c77]Richard Cole, Thanasis Lianeas, Evdokia Nikolova:
When Does Diversity of Agent Preferences Improve Outcomes in Selfish Routing? IJCAI 2018: 173-179 - [c76]Yun Kuen Cheung, Richard Cole, Yixin Tao:
Dynamics of Distributed Updating in Fisher Markets. EC 2018: 351-368 - [i24]Yun Kuen Cheung, Richard Cole, Yixin Tao:
Dynamics of Distributed Updating in Fisher Markets. CoRR abs/1806.04746 (2018) - [i23]Yun Kuen Cheung, Richard Cole:
Amortized Analysis of Asynchronous Price Dynamics. CoRR abs/1806.10952 (2018) - [i22]Richard Cole, Yixin Tao:
An Analysis of Asynchronous Stochastic Accelerated Coordinate Descent. CoRR abs/1808.05156 (2018) - [i21]Yun Kuen Cheung, Richard Cole, Yixin Tao:
(Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup. CoRR abs/1811.03254 (2018) - [i20]Yun Kuen Cheung, Richard Cole, Yixin Tao:
Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism. CoRR abs/1811.05087 (2018) - 2017
- [j59]Richard Cole, Shravas Rao:
Applications of α-Strongly Regular Distributions to Bayesian Auctions. ACM Trans. Economics and Comput. 5(4): 18:1-18:29 (2017) - [j58]Richard Cole, Vijaya Ramachandran:
Resource Oblivious Sorting on Multicores. ACM Trans. Parallel Comput. 3(4): 23:1-23:31 (2017) - [c75]Richard Cole, Nikhil R. Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod:
Convex Program Duality, Fisher Markets, and Nash Social Welfare. EC 2017: 459-460 - [c74]Richard Cole, Vijaya Ramachandran:
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract. SPAA 2017: 351-362 - [i19]Richard Cole, Thanasis Lianeas, Evdokia Nikolova:
When Does Diversity of User Preferences Improve Outcomes in Selfish Routing? CoRR abs/1702.07806 (2017) - [i18]Richard Cole, Vijaya Ramachandran:
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers. CoRR abs/1705.08350 (2017) - 2016
- [c73]Richard Cole, Yixin Tao:
Large Market Games with Near Optimal Efficiency. EC 2016: 791-808 - [i17]Richard Cole, Nikhil R. Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod:
Convex Program Duality, Fisher Markets, and Nash Social Welfare. CoRR abs/1609.06654 (2016) - [i16]Yun Kuen Cheung, Richard Cole:
A Unified Approach to Analyzing Asynchronous Coordinate Descent and Tatonnement. CoRR abs/1612.09171 (2016) - 2015
- [j57]Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein:
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. Algorithmica 72(2): 450-466 (2015) - [j56]Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver:
Decentralized utilitarian mechanisms for scheduling games. Games Econ. Behav. 92: 306-326 (2015) - [j55]Richard Cole, Vasilis Gkatzelis:
Approximating the nash social welfare with indivisible items. SIGecom Exch. 14(1): 84-88 (2015) - [c72]Richard Cole, Vasilis Gkatzelis:
Approximating the Nash Social Welfare with Indivisible Items. STOC 2015: 371-380 - [c71]Richard Cole, Shravas Rao:
Applications of α-Strongly Regular Distributions to Bayesian Auctions. WINE 2015: 244-257 - [i15]Richard Cole, Tim Roughgarden:
The Sample Complexity of Revenue Maximization. CoRR abs/1502.00963 (2015) - [i14]Richard Cole, Vijaya Ramachandran:
Resource Oblivious Sorting on Multicores. CoRR abs/1508.01504 (2015) - [i13]Richard Cole, Yixin Tao:
The Price of Anarchy of Large Walrasian Auctions. CoRR abs/1508.07370 (2015) - [i12]Richard Cole, Shravas Rao:
Applications of α-strongly regular distributions to Bayesian auctions. CoRR abs/1512.02285 (2015) - 2014
- [j54]Richard Cole, Carmit Hazay, Moshe Lewenstein, Dekel Tsur:
Two-Dimensional Parameterized Matching. ACM Trans. Algorithms 11(2): 12:1-12:30 (2014) - [c70]Richard Cole, Howard J. Karloff:
Fast Algorithms for Constructing Maximum Entropy Summary Trees. ICALP (1) 2014: 332-343 - [c69]Richard Cole, Tim Roughgarden:
The sample complexity of revenue maximization. STOC 2014: 243-252 - [i11]Richard Cole, Howard J. Karloff:
Fast Algorithms for Constructing Maximum Entropy Summary Trees. CoRR abs/1404.5660 (2014) - [i10]Yun Kuen Cheung, Richard Cole:
Amortized Analysis on Asynchronous Gradient Descent. CoRR abs/1412.0159 (2014) - 2013
- [c68]Richard Cole, Vasilis Gkatzelis, Gagan Goel:
Positive results for mechanism design without money. AAMAS 2013: 1165-1166 - [c67]Richard Cole, Vijaya Ramachandran:
Analysis of Randomized Work Stealing with False Sharing. IPDPS 2013: 985-998 - [c66]Richard Cole, Vasilis Gkatzelis, Gagan Goel:
Mechanism design for fair division: allocating divisible items without payments. EC 2013: 251-268 - [c65]Yun Kuen Cheung, Richard Cole, Nikhil R. Devanur:
Tatonnement beyond gross substitutes?: gradient descent to the rescue. STOC 2013: 191-200 - [i9]Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein:
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. CoRR abs/1311.1762 (2013) - 2012
- [j53]Richard Cole, Yevgeniy Dodis, Tim Roughgarden:
Bottleneck links, variable demand, and the tragedy of the commons. Networks 60(3): 194-203 (2012) - [c64]Richard Cole, Vijaya Ramachandran:
Efficient Resource Oblivious Algorithms for Multicores with False Sharing. IPDPS 2012: 201-214 - [c63]Richard Cole, Vijaya Ramachandran:
Revisiting the Cache Miss Analysis of Multithreaded Algorithms. LATIN 2012: 172-183 - [c62]Yun Kuen Cheung, Richard Cole, Ashish Rastogi:
Tatonnement in ongoing markets of complementary goods. EC 2012: 337-354 - [i8]Richard Cole, Vasilis Gkatzelis, Gagan Goel:
Truthful Mechanisms for Proportionally Fair Allocations. CoRR abs/1203.4627 (2012) - [i7]Yun Kuen Cheung, Richard Cole, Ashish Rastogi:
Tatonnement in Ongoing Markets of Complementary Goods. CoRR abs/1211.2268 (2012) - [i6]Richard Cole, Vasilis Gkatzelis, Gagan Goel:
Mechanism Design for Fair Division. CoRR abs/1212.1522 (2012) - 2011
- [c61]Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver:
Inner product spaces for MinSum coordination mechanisms. STOC 2011: 539-548 - [i5]Richard Cole, Vijaya Ramachandran:
Efficient Resource Oblivious Algorithms for Multicores. CoRR abs/1103.4071 (2011) - [i4]Richard Cole, Vijaya Ramachandran:
Analysis of Randomized Work Stealing with False Sharing. CoRR abs/1103.4142 (2011) - 2010
- [c60]Richard Cole, Vijaya Ramachandran:
Resource Oblivious Sorting on Multicores. ICALP (1) 2010: 226-237 - [i3]Richard Cole, Vasilis Gkatzelis, Vahab S. Mirrokni:
Coordination Mechanisms for Weighted Sum of Completion Times in Machine Scheduling. CoRR abs/1010.1886 (2010) - [i2]Richard Cole, Lisa Fleischer, Ashish Rastogi:
Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses. CoRR abs/1012.2124 (2010)
2000 – 2009
- 2008
- [j52]Richard Cole, Lukasz Kowalik:
New Linear-Time Algorithms for Edge-Coloring Planar Graphs. Algorithmica 50(3): 351-368 (2008) - [c59]Richard Cole, Shahar Dobzinski, Lisa Fleischer:
Prompt Mechanisms for Online Auctions. SAGT 2008: 170-181 - [c58]Richard Cole, Lisa Fleischer:
Fast-converging tatonnement algorithms for one-time and ongoing market problems. STOC 2008: 315-324 - 2007
- [j51]Richard Cole, Lukasz Kowalik, Riste Skrekovski:
A Generalization of Kotzig's Theorem and Its Application. SIAM J. Discret. Math. 21(1): 93-106 (2007) - [j50]Mihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono:
A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. 382(2): 86-96 (2007) - [i1]Ashish Rastogi, Richard Cole:
Indivisible Markets with Good Approximate EquilibriumPrices. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j49]Richard Cole, Yevgeniy Dodis, Tim Roughgarden:
How much can taxes help selfish routing? J. Comput. Syst. Sci. 72(3): 444-467 (2006) - [c57]Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein:
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. ICALP (1) 2006: 358-369 - [c56]Richard Cole, Yevgeniy Dodis, Tim Roughgarden:
Bottleneck links, variable demand, and the tragedy of the commons. SODA 2006: 668-677 - [c55]Richard Cole, Lee-Ad Gottlieb:
Searching dynamic point sets in spaces with bounded doubling dimension. STOC 2006: 574-583 - 2005
- [j48]Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang:
The Complexity of the Minimum k-Cover Problem. J. Autom. Lang. Comb. 10(5/6): 641-653 (2005) - [j47]Richard Cole, Ramesh Hariharan:
Dynamic LCA Queries on Trees. SIAM J. Comput. 34(4): 894-923 (2005) - [c54]Hiroshi Ishikawa, Davi Geiger, Richard Cole:
Finding Tree Structures by Grouping Symmetries. ICCV 2005: 1132-1139 - [c53]Richard Cole, Dennis E. Shasha, Xiaojian Zhao:
Fast window correlations over uncooperative time series. KDD 2005: 743-749 - 2004
- [j46]Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park:
Parallel two dimensional witness computation. Inf. Comput. 188(1): 20-67 (2004) - [c52]Richard Cole, David C. Kandathil:
The Average Case Analysis of Partition Sorts. ESA 2004: 240-251 - [c51]Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein:
Dictionary matching and indexing with errors and don't cares. STOC 2004: 91-100 - 2003
- [j45]Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
Overlap matching. Inf. Comput. 181(1): 57-74 (2003) - [j44]Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
On special families of morphisms related to [delta]-matching and don't care symbols. Inf. Process. Lett. 85(5): 227-233 (2003) - [j43]Richard Cole, Ramesh Hariharan:
Tree Pattern Matching to Subset Matching in Linear Time. SIAM J. Comput. 32(4): 1056-1066 (2003) - [j42]Richard Cole, Ramesh Hariharan:
Faster Suffix Tree Construction with Missing Suffix Links. SIAM J. Comput. 33(1): 26-42 (2003) - [c50]Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat:
Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003: 929-942 - [c49]Richard Cole, Yevgeniy Dodis, Tim Roughgarden:
How much can taxes help selfish routing? EC 2003: 98-107 - [c48]Richard Cole, Moshe Lewenstein:
Multidimensional matching and fast search in suffix trees. SODA 2003: 851-852 - [c47]Richard Cole, Ramesh Hariharan:
A fast algorithm for computing steiner edge connectivity. STOC 2003: 167-176 - [c46]Richard Cole, Yevgeniy Dodis, Tim Roughgarden:
Pricing network edges for heterogeneous selfish users. STOC 2003: 521-530 - [c45]Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang:
Computing the Minimum k-Cover of a String. Stringology 2003: 51-64 - 2002
- [j41]Richard Cole, Ramesh Hariharan:
Approximate String Matching: A Simpler Faster Algorithm. SIAM J. Comput. 31(6): 1761-1782 (2002) - [c44]Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton:
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. ESA 2002: 139-151 - [c43]Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito:
Two Simplified Algorithms for Maintaining Order in a List. ESA 2002: 152-164 - [c42]Michael A. Bender, Richard Cole, Rajeev Raman:
Exponential Structures for Efficient Cache-Oblivious Algorithms. ICALP 2002: 195-207 - [c41]Richard Cole, Ramesh Hariharan:
Verifying candidate matches in sparse and wildcard matching. STOC 2002: 592-601 - 2001
- [j40]Richard Cole, Kirstin Ost, Stefan Schirra:
Edge-Coloring Bipartite Multigraphs in O(E log D) Time. Comb. 21(1): 5-12 (2001) - [j39]Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman:
On the Benefit of Supporting Virtual Channels in Wormhole Routers. J. Comput. Syst. Sci. 62(1): 152-177 (2001) - [c40]Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
A faster implementation of the Goemans-Williamson clustering algorithm. SODA 2001: 17-25 - [c39]Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
Overlap matching. SODA 2001: 279-288 - [c38]Naila Rahman, Richard Cole, Rajeev Raman:
Optimised Predecessor Data Structures for Internal Memory. WAE 2001: 67-78 - 2000
- [j38]Richard Cole, Bud Mishra, Jeanette P. Schmidt, Alan Siegel:
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences. SIAM J. Comput. 30(1): 1-43 (2000) - [j37]Richard Cole:
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof. SIAM J. Comput. 30(1): 44-85 (2000) - [j36]Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup:
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SIAM J. Comput. 30(5): 1385-1404 (2000) - [c37]Richard Cole, Ramesh Hariharan:
Faster suffix tree construction with missing suffix links. STOC 2000: 407-415
1990 – 1999
- 1999
- [c36]Richard Cole, Ramesh Hariharan:
Dynamic LCA Queries on Trees. SODA 1999: 235-244 - [c35]Richard Cole, Ramesh Hariharan, Piotr Indyk:
Tree Pattern Matching and Subset Matching in Deterministic O(n log3 n)-time. SODA 1999: 245-254 - 1998
- [c34]Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal:
On Balls and Bins with Deletions. RANDOM 1998: 145-158 - [c33]Richard Cole, Ramesh Hariharan:
Approximate String Matching: A Simpler Faster Algorithm. SODA 1998: 463-472 - [c32]Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, Berthold Vöcking:
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. STOC 1998: 378-388 - 1997
- [j35]Richard Cole, Ramesh Hariharan:
Tighter Upper Bounds on the Exact Complexity of String Matching. SIAM J. Comput. 26(3): 803-856 (1997) - [j34]Richard J. Cole, Bruce M. Maggs, Ramesh K. Sitaraman:
Reconfiguring Arrays with Faults Part I: Worst-Case Faults. SIAM J. Comput. 26(6): 1581-1611 (1997) - [c31]Richard Cole, Ramesh Hariharan:
Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time. STOC 1997: 66-75 - 1996
- [j33]Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing:
A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm. Algorithmica 16(6): 569-617 (1996) - [c30]Richard Cole, Ramesh Hariharan:
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SODA 1996: 323-332 - [c29]Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman:
On the Benefit of Supporting Virtual Channels in Wormhole Routers. SPAA 1996: 131-141 - [c28]Richard Cole, Philip N. Klein, Robert Endre Tarjan:
Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling. SPAA 1996: 243-250 - 1995
- [j32]Richard Cole, Ofer Zajicek:
An Asynchronous Parallel Algorithm for Undirected Graph Connectivity. J. Algorithms 18(1): 50-97 (1995) - [j31]Richard Cole, Ofer Zajicek:
The Expected Advantage of Asynchrony. J. Comput. Syst. Sci. 51(2): 286-300 (1995) - [j30]Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick:
Tighter Lower Bounds on the Exact Complexity of String Matching. SIAM J. Comput. 24(1): 30-45 (1995) - [c27]Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman:
Routing on Butterfly Networks with Random Faults. FOCS 1995: 558-570 - 1994
- [j29]Richard Cole, Uzi Vishkin:
On the Detection of Robust Curves. CVGIP Graph. Model. Image Process. 56(3): 189-204 (1994) - [j28]Richard Cole:
Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm. SIAM J. Comput. 23(5): 1075-1091 (1994) - 1993
- [j27]Richard Cole:
Correction: Parallel Merge Sort. SIAM J. Comput. 22(6): 1349 (1993) - [c26]Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter:
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions. FOCS 1993: 248-258 - [c25]Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick:
Which Patterns are Hard to Find? ISTCS 1993: 59-68 - [c24]Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman:
Multi-scale self-simulation: a technique for reconfiguring arrays with faults. STOC 1993: 561-572 - [c23]Richard Cole:
Tolerating Faults in Meshes and Other Networks (Abstract). WADS 1993: 26 - 1992
- [j26]Richard Cole, Michael T. Goodrich:
Optimal Parallel Algorithms for Point-Set and Polygon Problems. Algorithmica 7(1): 3-23 (1992) - [j25]Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan:
Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. Appl. 2(2): 117-133 (1992) - [j24]Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan:
Erratum: Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. Appl. 2(3): 341-343 (1992) - [c22]Richard Cole, Ramesh Hariharan:
Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract). FOCS 1992: 600-609 - 1991
- [j23]Richard Cole, Uzi Vishkin:
Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms. Inf. Comput. 92(1): 1-47 (1991) - [j22]Richard Cole, Alan Siegel:
Report on the Second Workshop on Parallel Algorithms (WOPA). SIGACT News 22(3): 20-23 (1991) - [c21]Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan:
Randomized Parallel Algorithms for Trapezoidal Diagrams. SCG 1991: 152-161 - [c20]Richard Cole:
Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm. SODA 1991: 224-233 - 1990
- [j21]Richard Cole, Ofer Zajicek:
An Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location. J. Parallel Distributed Comput. 8(3): 280-285 (1990) - [c19]Richard Cole, Arvind Raghunathan:
Online Algorithms for Finger Searching (Extended Abstract). FOCS 1990: 480-489 - [c18]Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing:
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). ICALP 1990: 432-445 - [c17]Richard Cole, Ofer Zajicek:
The Expected Advantage of Asynchrony. SPAA 1990: 85-94 - [c16]Richard Cole:
On the Dynamic Finger Conjecture for Splay Trees (Extended Abstract). STOC 1990: 8-17
1980 – 1989
- 1989
- [j20]Richard Cole, Uzi Vishkin:
Faster Optimal Parallel Prefix Sums and List Ranking. Inf. Comput. 81(3): 334-352 (1989) - [j19]Richard Cole, Micha Sharir:
Visibility Problems for Polyhedral Terrains. J. Symb. Comput. 7(1): 11-30 (1989) - [j18]Mikhail J. Atallah, Richard Cole, Michael T. Goodrich:
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. SIAM J. Comput. 18(3): 499-532 (1989) - [j17]Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi:
An Optimal-Time Algorithm for Slope Selection. SIAM J. Comput. 18(4): 792-810 (1989) - [c15]Richard Cole, Ofer Zajicek:
The APRAM: Incorporating Asynchrony into the PRAM Model. SPAA 1989: 169-178 - 1988
- [j16]Richard Cole, Uzi Vishkin:
The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time. Algorithmica 3: 329-346 (1988) - [j15]Richard J. Cole:
An Optimally Efficient Selection Algorithm. Inf. Process. Lett. 26(6): 295-299 (1988) - [j14]Richard Cole, Alan Siegel:
Optimal VLSI circuits for sorting. J. ACM 35(4): 777-809 (1988) - [j13]Richard Cole, Uzi Vishkin:
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. SIAM J. Comput. 17(1): 128-142 (1988) - [j12]Richard Cole:
Parallel Merge Sort. SIAM J. Comput. 17(4): 770-785 (1988) - [c14]Richard Cole, Uzi Vishkin:
Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking. AWOC 1988: 91-100 - [c13]Richard Cole, Michael T. Goodrich:
Optimal Parallel Algorithms for Polygon and Point-Set Problems. SCG 1988: 201-210 - [c12]Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi:
Optimal Slope Selection. ICALP 1988: 133-146 - 1987
- [j11]Richard Cole:
Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1): 200-208 (1987) - [j10]Richard Cole, Chee-Keng Yap:
Shape from Probing. J. Algorithms 8(1): 19-38 (1987) - [j9]Richard Cole, Micha Sharir, Chee-Keng Yap:
On k-Hulls and Related Problems. SIAM J. Comput. 16(1): 61-77 (1987) - [j8]Richard Cole:
Partitioning Point Sets in Arbitrary Dimension. Theor. Comput. Sci. 49: 239-265 (1987) - [c11]Mikhail J. Atallah, Richard Cole, Michael T. Goodrich:
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. FOCS 1987: 151-160 - 1986
- [j7]Bernard Chazelle, Richard Cole, Franco P. Preparata, Chee-Keng Yap:
New Upper Bounds for Neighbor Searching. Inf. Control. 68(1-3): 105-124 (1986) - [j6]Richard Cole, Uzi Vishkin:
Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking. Inf. Control. 70(1): 32-53 (1986) - [j5]Richard Cole:
Searching and Storing Similar Lists. J. Algorithms 7(2): 202-220 (1986) - [c10]Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony:
Geometric Applications of Davenport-Schinzel Sequences. FOCS 1986: 77-86 - [c9]Richard Cole, Uzi Vishkin:
Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems. FOCS 1986: 478-491 - [c8]Richard Cole:
Parallel Merge Sort. FOCS 1986: 511-516 - [c7]Richard Cole, Uzi Vishkin:
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. STOC 1986: 206-219 - 1985
- [j4]Richard Cole, Chee-Keng Yap:
A Parallel Median Algorithm. Inf. Process. Lett. 20(3): 137-139 (1985) - [c6]Richard Cole, Alan Siegel:
On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract). FOCS 1985: 208-221 - [c5]Richard Cole:
Partitioning Point Sets in 4 Dimensions. ICALP 1985: 111-119 - 1984
- [j3]Richard Cole, Chee-Keng Yap:
Geometric Retrieval Problems. Inf. Control. 63(1/2): 39-57 (1984) - [c4]Richard Cole, Alan Siegel:
River Routing Every Which Way, but Loose (Extended Abstract). FOCS 1984: 65-73 - [c3]Richard Cole:
Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms. FOCS 1984: 255-260 - [c2]Richard Cole, Micha Sharir, Chee-Keng Yap:
On k-hulls and Related Problems. STOC 1984: 154-166 - 1983
- [c1]Richard Cole, Chee-Keng Yap:
Geometric Retrieval Problems. FOCS 1983: 112-121 - 1982
- [b1]Richard Cole:
Two Problems in Graph Theory. Cornell University, USA, 1982 - [j2]Richard Cole, John E. Hopcroft:
On Edge Coloring Bipartite Graphs. SIAM J. Comput. 11(3): 540-546 (1982)
1960 – 1969
- 1968
- [j1]Richard Cole:
Definitional Boolean calculi. Notre Dame J. Formal Log. 9(4): 343-350 (1968)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
