| 2024 | IPCO | A First Order Method for Linear Programming Parameterized by Circuit Imbalance. | Richard Cole, Christoph Hertrich, Yixin Tao, Lszl A. Vgh |
| 2023 | CHI | Imagine That! Imaginative Suggestibility Affects Presence in Virtual Reality. | Crescent Jicol, Christopher Clarke, Emilia Tor, Hiu Lam Yip, Jinha Yoon, Chris Bevan, Hugh Bowden, Elisa Brann, Kirsten Cater, Richard Cole, Quinton Deeley, Esther Eidinow, Eamonn O'Neill, Christof Lutteroth, Michael J. Proulx |
| 2023 | ICALP | Stable Matching: Choosing Which Proposals to Make. | Ishan Agarwal, Richard Cole |
| 2020 | SODA | A Truthful Cardinal Mechanism for One-Sided Matching. | Rediet Abebe, Richard Cole, Vasilis Gkatzelis, Jason D. Hartline |
| 2018 | ESA | Amortized Analysis of Asynchronous Price Dynamics. | Yun Kuen Cheung, Richard Cole |
| 2018 | IJCAI | When Does Diversity of Agent Preferences Improve Outcomes in Selfish Routing? | Richard Cole, Thanasis Lianeas, Evdokia Nikolova |
| 2017 | SPAA | Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract. | Richard Cole, Vijaya Ramachandran |
| 2015 | STOC | Approximating the Nash Social Welfare with Indivisible Items. | Richard Cole, Vasilis Gkatzelis |
| 2014 | ICALP | Fast Algorithms for Constructing Maximum Entropy Summary Trees. | Richard Cole, Howard J. Karloff |
| 2014 | STOC | The sample complexity of revenue maximization. | Richard Cole, Tim Roughgarden |
| 2013 | STOC | Tatonnement beyond gross substitutes?: gradient descent to the rescue. | Yun Kuen Cheung, Richard Cole, Nikhil R. Devanur |
| 2012 | LATIN | Revisiting the Cache Miss Analysis of Multithreaded Algorithms. | Richard Cole, Vijaya Ramachandran |
| 2011 | STOC | Inner product spaces for MinSum coordination mechanisms. | Richard Cole, Jos R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver |
| 2010 | ICALP | Resource Oblivious Sorting on Multicores. | Richard Cole, Vijaya Ramachandran |
| 2008 | STOC | Fast-converging tatonnement algorithms for one-time and ongoing market problems. | Richard Cole, Lisa Fleischer |
| 2008 | SAGT | Prompt Mechanisms for Online Auctions. | Richard Cole, Shahar Dobzinski, Lisa Fleischer |
| 2006 | ICALP | Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. | Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein |
| 2006 | ICFCA | Automated Layout of Small Lattices Using Layer Diagrams. | Richard Cole, Jon Ducrou, Peter W. Eklund |
| 2006 | SODA | Bottleneck links, variable demand, and the tragedy of the commons. | Richard Cole, Yevgeniy Dodis, Tim Roughgarden |
| 2006 | STOC | Searching dynamic point sets in spaces with bounded doubling dimension. | Richard Cole, Lee-Ad Gottlieb |
| 2005 | ICCV | Finding Tree Structures by Grouping Symmetries. | Hiroshi Ishikawa, Davi Geiger, Richard Cole |
| 2005 | ICFCA | Navigation Spaces for the Conceptual Analysis of Software Structure. | Richard Cole, Peter Becker |
| 2005 | KDD | Fast window correlations over uncooperative time series. | Richard Cole, Dennis E. Shasha, Xiaojian Zhao |
| 2004 | ESA | The Average Case Analysis of Partition Sorts. | Richard Cole, David C. Kandathil |
| 2004 | STOC | Dictionary matching and indexing with errors and don't cares. | Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein |
| 2003 | ICALP | Function Matching: Algorithms, Applications, and a Lower Bound. | Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat |
| 2003 | SODA | Multidimensional matching and fast search in suffix trees. | Richard Cole, Moshe Lewenstein |
| 2003 | STOC | Pricing network edges for heterogeneous selfish users. | Richard Cole, Yevgeniy Dodis, Tim Roughgarden |
| 2003 | STOC | A fast algorithm for computing steiner edge connectivity. | Richard Cole, Ramesh Hariharan |
| 2003 | SEKE | Conceptual Analysis of Software Structure. | Richard Cole, Thomas Tilley |
| 2002 | ESA | Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. | Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton |
| 2002 | ESA | Two Simplified Algorithms for Maintaining Order in a List. | Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito |
| 2002 | ICALP | Exponential Structures for Efficient Cache-Oblivious Algorithms. | Michael A. Bender, Richard Cole, Rajeev Raman |
| 2002 | STOC | Verifying candidate matches in sparse and wildcard matching. | Richard Cole, Ramesh Hariharan |
| 2001 | SODA | Overlap matching. | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
| 2001 | SODA | A faster implementation of the Goemans-Williamson clustering algorithm. | Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
| 2000 | ICCS | CEM - A Conceptual Email Manager. | Richard Cole, Gerd Stumme |
| 2000 | STOC | Faster suffix tree construction with missing suffix links. | Richard Cole, Ramesh Hariharan |
| 1999 | SODA | Dynamic LCA Queries on Trees. | Richard Cole, Ramesh Hariharan |
| 1999 | SODA | Tree Pattern Matching and Subset Matching in Deterministic | Richard Cole, Ramesh Hariharan, Piotr Indyk |
| 1998 | SODA | Approximate String Matching: A Simpler Faster Algorithm. | Richard Cole, Ramesh Hariharan |
| 1998 | STOC | Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. | Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andra W. Richa, Klaus Schrder, Ramesh K. Sitaraman, Berthold Vcking |
| 1997 | STOC | Tree Pattern Matching and Subset Matching in Randomized O(n log | Richard Cole, Ramesh Hariharan |
| 1996 | SODA | An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. | Richard Cole, Ramesh Hariharan |
| 1996 | SPAA | Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling. | Richard Cole, Philip N. Klein, Robert Endre Tarjan |
| 1996 | SPAA | On the Benefit of Supporting Virtual Channels in Wormhole Routers. | Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman |
| 1995 | FOCS | Routing on Butterfly Networks with Random Faults. | Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman |
| 1993 | FOCS | Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions | Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter |
| 1993 | STOC | Multi-scale self-simulation: a technique for reconfiguring arrays with faults. | Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman |
| 1993 | WADS | Tolerating Faults in Meshes and Other Networks (Abstract). | Richard Cole |
| 1992 | FOCS | Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract) | Richard Cole, Ramesh Hariharan |
| 1991 | SODA | Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm. | Richard Cole |
| 1990 | FOCS | Online Algorithms for Finger Searching (Extended Abstract) | Richard Cole, Arvind Raghunathan |
| 1990 | ICALP | Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). | Richard Cole, Michael T. Goodrich, Colm 'Dnlaing |
| 1990 | STOC | On the Dynamic Finger Conjecture for Splay Trees (Extended Abstract) | Richard Cole |
| 1990 | SPAA | The Expected Advantage of Asynchrony. | Richard Cole, Ofer Zajicek |
| 1989 | SPAA | The APRAM: Incorporating Asynchrony into the PRAM Model. | Richard Cole, Ofer Zajicek |
| 1988 | ICALP | Optimal Slope Selection. | Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerdi |
| 1987 | FOCS | Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms | Mikhail J. Atallah, Richard Cole, Michael T. Goodrich |
| 1986 | FOCS | Parallel Merge Sort | Richard Cole |
| 1986 | FOCS | Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems | Richard Cole, Uzi Vishkin |
| 1986 | FOCS | Geometric Applications of Davenport-Schinzel Sequences | Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony |
| 1986 | STOC | Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms | Richard Cole, Uzi Vishkin |
| 1985 | FOCS | On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract) | Richard Cole, Alan Siegel |
| 1985 | ICALP | Partitioning Point Sets in 4 Dimensions. | Richard Cole |
| 1984 | FOCS | Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms | Richard Cole |
| 1984 | FOCS | River Routing Every Which Way, but Loose (Extended Abstract) | Richard Cole, Alan Siegel |
| 1984 | STOC | On k-hulls and Related Problems | Richard Cole, Micha Sharir, Chee-Keng Yap |
| 1983 | FOCS | Geometric Retrieval Problems | Richard Cole, Chee-Keng Yap |