Richard Cole - RankMe

179 papers A* 55A 8B 9Misc 1Journal 95Unranked 10

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Distributed Interview Selection for Stable Matching in Large Random Markets. CoRR Richard Cole, Pranav Jangir
2025	J	`jnl`	Facility Location with Public Locations and Private Doubly-Peaked Costs. CoRR Richard Cole, Pranav Jangir
2025	A*	`conf`	Proportional Response Dynamics in Gross Substitutes Markets. EC Yun Kuen Cheung, Richard Cole, Yixin Tao
2025	J	`jnl`	Proportional Response Dynamics in Gross Substitutes Markets. CoRR Yun Kuen Cheung, Richard Cole, Yixin Tao
2024	B	`conf`	A First Order Method for Linear Programming Parameterized by Circuit Imbalance. IPCO Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh
2023	J	`jnl`	A First Order Method for Linear Programming Parameterized by Circuit Imbalance. CoRR Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh
2023	A*	`conf`	Stable Matching: Choosing Which Proposals to Make. ICALP Ishan Agarwal, Richard Cole
2022	J	`jnl`	Stable Matching: Choosing Which Proposals to Make. CoRR Ishan Agarwal, Richard Cole
2021	J	`jnl`	Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup. Math. Program. Yun Kuen Cheung, Richard Cole, Yixin Tao
2021	A	`conf`	Non-Quasi-Linear Agents in Quasi-Linear Mechanisms (Extended Abstract). ITCS Moshe Babaioff, Richard Cole, Jason D. Hartline, Nicole Immorlica, Brendan Lucier
2021	J	`jnl`	On the existence of Pareto Efficient and envy-free allocations. J. Econ. Theory Richard Cole, Yixin Tao
2021	J	`jnl`	Selecting a Match: Exploration vs Decision. CoRR Ishan Agarwal, Richard Cole, Yixin Tao
2020	A*	`conf`	A Truthful Cardinal Mechanism for One-Sided Matching. SODA Rediet Abebe, Richard Cole, Vasilis Gkatzelis, Jason D. Hartline
2020	J	`jnl`	Non-quasi-linear Agents in Quasi-linear Mechanisms. CoRR Moshe Babaioff, Richard Cole, Jason D. Hartline, Nicole Immorlica, Brendan Lucier
2020	J	`jnl`	Tatonnement beyond gross substitutes? Gradient descent to the rescue. Games Econ. Behav. Yun Kuen Cheung, Richard Cole, Nikhil R. Devanur
2019	J	`jnl`	A Truthful Cardinal Mechanism for One-Sided Matching. CoRR Rediet Abebe, Richard Cole, Vasilis Gkatzelis, Jason D. Hartline
2019	J	`jnl`	Balancing the Robustness and Convergence of Tatonnement. CoRR Richard Cole, Yixin Tao
2019	J	`jnl`	On the Existence of Pareto Efficient and Envy Free Allocations. CoRR Richard Cole, Yixin Tao
2018	J	`jnl`	(Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup. CoRR Yun Kuen Cheung, Richard Cole, Yixin Tao
2018	A	`conf`	Amortized Analysis of Asynchronous Price Dynamics. ESA Yun Kuen Cheung, Richard Cole
2018	J	`jnl`	Amortized Analysis of Asynchronous Price Dynamics. CoRR Yun Kuen Cheung, Richard Cole
2018	J	`jnl`	An Analysis of Asynchronous Stochastic Accelerated Coordinate Descent. CoRR Richard Cole, Yixin Tao
2018	J	`jnl`	Approximating the Nash Social Welfare with Indivisible Items. SIAM J. Comput. Richard Cole, Vasilis Gkatzelis
2018	A*	`conf`	Dynamics of Distributed Updating in Fisher Markets. EC Yun Kuen Cheung, Richard Cole, Yixin Tao
2018	J	`jnl`	Dynamics of Distributed Updating in Fisher Markets. CoRR Yun Kuen Cheung, Richard Cole, Yixin Tao
2018	J	`jnl`	Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism. CoRR Yun Kuen Cheung, Richard Cole, Yixin Tao
2018	A*	`conf`	When Does Diversity of Agent Preferences Improve Outcomes in Selfish Routing? IJCAI Richard Cole, Thanasis Lianeas, Evdokia Nikolova
2017	J	`jnl`	Applications of α-Strongly Regular Distributions to Bayesian Auctions. ACM Trans. Economics and Comput. Richard Cole, Shravas Rao
2017	J	`jnl`	Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers. CoRR Richard Cole, Vijaya Ramachandran
2017	B	`conf`	Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract. SPAA Richard Cole, Vijaya Ramachandran
2017	A*	`conf`	Convex Program Duality, Fisher Markets, and Nash Social Welfare. EC Richard Cole, Nikhil R. Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod
2017	J	`jnl`	Resource Oblivious Sorting on Multicores. ACM Trans. Parallel Comput. Richard Cole, Vijaya Ramachandran
2017	J	`jnl`	When Does Diversity of User Preferences Improve Outcomes in Selfish Routing? CoRR Richard Cole, Thanasis Lianeas, Evdokia Nikolova
2016	J	`jnl`	A Unified Approach to Analyzing Asynchronous Coordinate Descent and Tatonnement. CoRR Yun Kuen Cheung, Richard Cole
2016	J	`jnl`	Convex Program Duality, Fisher Markets, and Nash Social Welfare. CoRR Richard Cole, Nikhil R. Devanur, Vasilis Gkatzelis, Kamal Jain, Tung Mai, Vijay V. Vazirani, Sadra Yazdanbod
2016	A*	`conf`	Large Market Games with Near Optimal Efficiency. EC Richard Cole, Yixin Tao
2015	—	`conf`	Applications of α-Strongly Regular Distributions to Bayesian Auctions. WINE Richard Cole, Shravas Rao
2015	J	`jnl`	Applications of α-strongly regular distributions to Bayesian auctions. CoRR Richard Cole, Shravas Rao
2015	A*	`conf`	Approximating the Nash Social Welfare with Indivisible Items. STOC Richard Cole, Vasilis Gkatzelis
2015	J	`jnl`	Approximating the nash social welfare with indivisible items. SIGecom Exch. Richard Cole, Vasilis Gkatzelis
2015	J	`jnl`	Decentralized utilitarian mechanisms for scheduling games. Games Econ. Behav. Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver
2015	J	`jnl`	Resource Oblivious Sorting on Multicores. CoRR Richard Cole, Vijaya Ramachandran
2015	J	`jnl`	Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. Algorithmica Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
2015	J	`jnl`	The Price of Anarchy of Large Walrasian Auctions. CoRR Richard Cole, Yixin Tao
2015	J	`jnl`	The Sample Complexity of Revenue Maximization. CoRR Richard Cole, Tim Roughgarden
2014	J	`jnl`	Amortized Analysis on Asynchronous Gradient Descent. CoRR Yun Kuen Cheung, Richard Cole
2014	—	`conf`	Fast Algorithms for Constructing Maximum Entropy Summary Trees. ICALP (1) Richard Cole, Howard J. Karloff
2014	J	`jnl`	Fast Algorithms for Constructing Maximum Entropy Summary Trees. CoRR Richard Cole, Howard J. Karloff
2014	A*	`conf`	The sample complexity of revenue maximization. STOC Richard Cole, Tim Roughgarden
2014	J	`jnl`	Two-Dimensional Parameterized Matching. ACM Trans. Algorithms Richard Cole, Carmit Hazay, Moshe Lewenstein, Dekel Tsur
2013	A	`conf`	Analysis of Randomized Work Stealing with False Sharing. IPDPS Richard Cole, Vijaya Ramachandran
2013	A*	`conf`	Mechanism design for fair division: allocating divisible items without payments. EC Richard Cole, Vasilis Gkatzelis, Gagan Goel
2013	A	`conf`	Positive results for mechanism design without money. AAMAS Richard Cole, Vasilis Gkatzelis, Gagan Goel
2013	J	`jnl`	Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. CoRR Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
2013	A*	`conf`	Tatonnement beyond gross substitutes?: gradient descent to the rescue. STOC Yun Kuen Cheung, Richard Cole, Nikhil R. Devanur
2012	J	`jnl`	Bottleneck links, variable demand, and the tragedy of the commons. Networks Richard Cole, Yevgeniy Dodis, Tim Roughgarden
2012	A	`conf`	Efficient Resource Oblivious Algorithms for Multicores with False Sharing. IPDPS Richard Cole, Vijaya Ramachandran
2012	J	`jnl`	Mechanism Design for Fair Division CoRR Richard Cole, Vasilis Gkatzelis, Gagan Goel
2012	B	`conf`	Revisiting the Cache Miss Analysis of Multithreaded Algorithms. LATIN Richard Cole, Vijaya Ramachandran
2012	J	`jnl`	Tatonnement in Ongoing Markets of Complementary Goods CoRR Yun Kuen Cheung, Richard Cole, Ashish Rastogi
2012	A*	`conf`	Tatonnement in ongoing markets of complementary goods. EC Yun Kuen Cheung, Richard Cole, Ashish Rastogi
2012	J	`jnl`	Truthful Mechanisms for Proportionally Fair Allocations CoRR Richard Cole, Vasilis Gkatzelis, Gagan Goel
2011	J	`jnl`	Analysis of Randomized Work Stealing with False Sharing CoRR Richard Cole, Vijaya Ramachandran
2011	J	`jnl`	Efficient Resource Oblivious Algorithms for Multicores CoRR Richard Cole, Vijaya Ramachandran
2011	A*	`conf`	Inner product spaces for MinSum coordination mechanisms. STOC Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver
2010	J	`jnl`	Coordination Mechanisms for Weighted Sum of Completion Times in Machine Scheduling CoRR Richard Cole, Vasilis Gkatzelis, Vahab S. Mirrokni
2010	J	`jnl`	Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses CoRR Richard Cole, Lisa Fleischer, Ashish Rastogi
2010	—	`conf`	Resource Oblivious Sorting on Multicores. ICALP (1) Richard Cole, Vijaya Ramachandran
2008	A*	`conf`	Fast-converging tatonnement algorithms for one-time and ongoing market problems. STOC Richard Cole, Lisa Fleischer
2008	J	`jnl`	New Linear-Time Algorithms for Edge-Coloring Planar Graphs. Algorithmica Richard Cole, Lukasz Kowalik
2008	B	`conf`	Prompt Mechanisms for Online Auctions. SAGT Richard Cole, Shahar Dobzinski, Lisa Fleischer
2007	J	`jnl`	A Generalization of Kotzig's Theorem and Its Application. SIAM J. Discret. Math. Richard Cole, Lukasz Kowalik, Riste Skrekovski
2007	J	`jnl`	A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. Mihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono
2007	J	`jnl`	Indivisible Markets with Good Approximate EquilibriumPrices. Electron. Colloquium Comput. Complex. Ashish Rastogi, Richard Cole
2006	A*	`conf`	Bottleneck links, variable demand, and the tragedy of the commons. SODA Richard Cole, Yevgeniy Dodis, Tim Roughgarden
2006	J	`jnl`	How much can taxes help selfish routing? J. Comput. Syst. Sci. Richard Cole, Yevgeniy Dodis, Tim Roughgarden
2006	A*	`conf`	Searching dynamic point sets in spaces with bounded doubling dimension. STOC Richard Cole, Lee-Ad Gottlieb
2006	—	`conf`	Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. ICALP (1) Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
2005	J	`jnl`	Dynamic LCA Queries on Trees. SIAM J. Comput. Richard Cole, Ramesh Hariharan
2005	A*	`conf`	Fast window correlations over uncooperative time series. KDD Richard Cole, Dennis E. Shasha, Xiaojian Zhao
2005	A*	`conf`	Finding Tree Structures by Grouping Symmetries. ICCV Hiroshi Ishikawa, Davi Geiger, Richard Cole
2005	J	`jnl`	The Complexity of the Minimum k-Cover Problem. J. Autom. Lang. Comb. Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang
2004	A*	`conf`	Dictionary matching and indexing with errors and don't cares. STOC Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein
2004	J	`jnl`	Parallel two dimensional witness computation. Inf. Comput. Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park
2004	A	`conf`	The Average Case Analysis of Partition Sorts. ESA Richard Cole, David C. Kandathil
2003	A*	`conf`	A fast algorithm for computing steiner edge connectivity. STOC Richard Cole, Ramesh Hariharan
2003	Misc	`conf`	Computing the Minimum k-Cover of a String. PSC Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang
2003	J	`jnl`	Faster Suffix Tree Construction with Missing Suffix Links. SIAM J. Comput. Richard Cole, Ramesh Hariharan
2003	A*	`conf`	Function Matching: Algorithms, Applications, and a Lower Bound. ICALP Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
2003	A*	`conf`	How much can taxes help selfish routing? EC Richard Cole, Yevgeniy Dodis, Tim Roughgarden
2003	A*	`conf`	Multidimensional matching and fast search in suffix trees. SODA Richard Cole, Moshe Lewenstein
2003	J	`jnl`	On special families of morphisms related to [delta]-matching and don't care symbols. Inf. Process. Lett. Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
2003	J	`jnl`	Overlap matching. Inf. Comput. Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
2003	A*	`conf`	Pricing network edges for heterogeneous selfish users. STOC Richard Cole, Yevgeniy Dodis, Tim Roughgarden
2003	J	`jnl`	Tree Pattern Matching to Subset Matching in Linear Time. SIAM J. Comput. Richard Cole, Ramesh Hariharan
2002	J	`jnl`	Approximate String Matching: A Simpler Faster Algorithm. SIAM J. Comput. Richard Cole, Ramesh Hariharan
2002	A*	`conf`	Exponential Structures for Efficient Cache-Oblivious Algorithms. ICALP Michael A. Bender, Richard Cole, Rajeev Raman
2002	A	`conf`	Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. ESA Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton
2002	A	`conf`	Two Simplified Algorithms for Maintaining Order in a List. ESA Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito
2002	A*	`conf`	Verifying candidate matches in sparse and wildcard matching. STOC Richard Cole, Ramesh Hariharan
2001	A*	`conf`	A faster implementation of the Goemans-Williamson clustering algorithm. SODA Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
2001	J	`jnl`	Edge-Coloring Bipartite Multigraphs in O(E log D) Time. Comb. Richard Cole, Kirstin Ost, Stefan Schirra
2001	J	`jnl`	On the Benefit of Supporting Virtual Channels in Wormhole Routers. J. Comput. Syst. Sci. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman
2001	—	`conf`	Optimised Predecessor Data Structures for Internal Memory. WAE Naila Rahman, Richard Cole, Rajeev Raman
2001	A*	`conf`	Overlap matching. SODA Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
2000	J	`jnl`	An SIAM J. Comput. Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup
2000	A*	`conf`	Faster suffix tree construction with missing suffix links. STOC Richard Cole, Ramesh Hariharan
2000	J	`jnl`	On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences. SIAM J. Comput. Richard Cole, Bud Mishra, Jeanette P. Schmidt, Alan Siegel
2000	J	`jnl`	On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof. SIAM J. Comput. Richard Cole
1999	A*	`conf`	Dynamic LCA Queries on Trees. SODA Richard Cole, Ramesh Hariharan
1999	A*	`conf`	Tree Pattern Matching and Subset Matching in Deterministic SODA Richard Cole, Ramesh Hariharan, Piotr Indyk
1998	A*	`conf`	Approximate String Matching: A Simpler Faster Algorithm. SODA Richard Cole, Ramesh Hariharan
1998	—	`conf`	On Balls and Bins with Deletions. RANDOM Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal
1998	A*	`conf`	Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. STOC 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
1997	J	`jnl`	Tighter Upper Bounds on the Exact Complexity of String Matching. SIAM J. Comput. Richard Cole, Ramesh Hariharan
1997	A*	`conf`	Tree Pattern Matching and Subset Matching in Randomized O(n log STOC Richard Cole, Ramesh Hariharan
1996	J	`jnl`	A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm. Algorithmica Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
1996	A*	`conf`	An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SODA Richard Cole, Ramesh Hariharan
1996	B	`conf`	Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling. SPAA Richard Cole, Philip N. Klein, Robert Endre Tarjan
1996	B	`conf`	On the Benefit of Supporting Virtual Channels in Wormhole Routers. SPAA Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman
1995	J	`jnl`	An Asynchronous Parallel Algorithm for Undirected Graph Connectivity. J. Algorithms Richard Cole, Ofer Zajicek
1995	A*	`conf`	Routing on Butterfly Networks with Random Faults. FOCS Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman
1995	J	`jnl`	The Expected Advantage of Asynchrony. J. Comput. Syst. Sci. Richard Cole, Ofer Zajicek
1995	J	`jnl`	Tighter Lower Bounds on the Exact Complexity of String Matching. SIAM J. Comput. Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick
1994	J	`jnl`	On the Detection of Robust Curves. CVGIP Graph. Model. Image Process. Richard Cole, Uzi Vishkin
1994	J	`jnl`	Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm. SIAM J. Comput. Richard Cole
1993	J	`jnl`	Correction: Parallel Merge Sort. SIAM J. Comput. Richard Cole
1993	A*	`conf`	Multi-scale self-simulation: a technique for reconfiguring arrays with faults. STOC Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman
1993	A*	`conf`	Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions FOCS Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter
1993	B	`conf`	Tolerating Faults in Meshes and Other Networks (Abstract). WADS Richard Cole
1993	—	`conf`	Which Patterns are Hard to Find? ISTCS Richard Cole, Ramesh Hariharan, Mike Paterson, Uri Zwick
1992	J	`jnl`	Erratum: Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. Appl. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
1992	J	`jnl`	Optimal Parallel Algorithms for Point-Set and Polygon Problems. Algorithmica Richard Cole, Michael T. Goodrich
1992	J	`jnl`	Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. Appl. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
1992	A*	`conf`	Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract) FOCS Richard Cole, Ramesh Hariharan
1991	J	`jnl`	Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms Inf. Comput. Richard Cole, Uzi Vishkin
1991	—	`conf`	Randomized Parallel Algorithms for Trapezoidal Diagrams. SCG Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
1991	J	`jnl`	Report on the Second Workshop on Parallel Algorithms (WOPA). SIGACT News Richard Cole, Alan Siegel
1991	A*	`conf`	Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm. SODA Richard Cole
1990	J	`jnl`	An Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location. J. Parallel Distributed Comput. Richard Cole, Ofer Zajicek
1990	A*	`conf`	Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). ICALP Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
1990	A*	`conf`	On the Dynamic Finger Conjecture for Splay Trees (Extended Abstract) STOC Richard Cole
1990	A*	`conf`	Online Algorithms for Finger Searching (Extended Abstract) FOCS Richard Cole, Arvind Raghunathan
1990	B	`conf`	The Expected Advantage of Asynchrony. SPAA Richard Cole, Ofer Zajicek
1989	J	`jnl`	An Optimal-Time Algorithm for Slope Selection. SIAM J. Comput. Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
1989	J	`jnl`	Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. SIAM J. Comput. Mikhail J. Atallah, Richard Cole, Michael T. Goodrich
1989	J	`jnl`	Faster Optimal Parallel Prefix Sums and List Ranking Inf. Comput. Richard Cole, Uzi Vishkin
1989	B	`conf`	The APRAM: Incorporating Asynchrony into the PRAM Model. SPAA Richard Cole, Ofer Zajicek
1989	J	`jnl`	Visibility Problems for Polyhedral Terrains. J. Symb. Comput. Richard Cole, Micha Sharir
1988	J	`jnl`	Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. SIAM J. Comput. Richard Cole, Uzi Vishkin
1988	—	`conf`	Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking. AWOC Richard Cole, Uzi Vishkin
1988	—	`conf`	Optimal Parallel Algorithms for Polygon and Point-Set Problems. SCG Richard Cole, Michael T. Goodrich
1988	A*	`conf`	Optimal Slope Selection. ICALP Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
1988	J	`jnl`	Optimal VLSI circuits for sorting. J. ACM Richard Cole, Alan Siegel
1988	J	`jnl`	Parallel Merge Sort. SIAM J. Comput. Richard Cole
1988	J	`jnl`	The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time. Algorithmica Richard Cole, Uzi Vishkin
1987	A*	`conf`	Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms FOCS Mikhail J. Atallah, Richard Cole, Michael T. Goodrich
1987	J	`jnl`	On k-Hulls and Related Problems. SIAM J. Comput. Richard Cole, Micha Sharir, Chee-Keng Yap
1987	J	`jnl`	Partitioning Point Sets in Arbitrary Dimension. Theor. Comput. Sci. Richard Cole
1987	J	`jnl`	Shape from Probing. J. Algorithms Richard Cole, Chee-Keng Yap
1987	J	`jnl`	Slowing down sorting networks to obtain faster sorting algorithms. J. ACM Richard Cole
1986	A*	`conf`	Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems FOCS Richard Cole, Uzi Vishkin
1986	J	`jnl`	Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking Inf. Control. Richard Cole, Uzi Vishkin
1986	A*	`conf`	Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms STOC Richard Cole, Uzi Vishkin
1986	A*	`conf`	Geometric Applications of Davenport-Schinzel Sequences FOCS Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony
1986	J	`jnl`	New Upper Bounds for Neighbor Searching Inf. Control. Bernard Chazelle, Richard Cole, Franco P. Preparata, Chee-Keng Yap
1986	A*	`conf`	Parallel Merge Sort FOCS Richard Cole
1986	J	`jnl`	Searching and Storing Similar Lists. J. Algorithms Richard Cole
1985	J	`jnl`	A Parallel Median Algorithm. Inf. Process. Lett. Richard Cole, Chee-Keng Yap
1985	A*	`conf`	On Information Flow and Sorting: New Upper and Lower Bounds for VLSI Circuits (Extended Abstract) FOCS Richard Cole, Alan Siegel
1985	A*	`conf`	Partitioning Point Sets in 4 Dimensions. ICALP Richard Cole
1984	J	`jnl`	Geometric Retrieval Problems Inf. Control. Richard Cole, Chee-Keng Yap
1984	A*	`conf`	On k-hulls and Related Problems STOC Richard Cole, Micha Sharir, Chee-Keng Yap
1984	A*	`conf`	River Routing Every Which Way, but Loose (Extended Abstract) FOCS Richard Cole, Alan Siegel
1984	A*	`conf`	Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms FOCS Richard Cole
1983	A*	`conf`	Geometric Retrieval Problems FOCS Richard Cole, Chee-Keng Yap
1982	J	`jnl`	On Edge Coloring Bipartite Graphs. SIAM J. Comput. Richard Cole, John E. Hopcroft
1982	—	`—`	Two Problems in Graph Theory. Richard Cole
1968	J	`jnl`	Definitional Boolean calculi. Notre Dame J. Formal Log. Richard Cole