Richard Cole

Publication Activity (10 Years)

Years Active: 1968-2023
Publications (10 Years): 40

Top Venues

CoRR

STOC

Games Econ. Behav.

Publications

Richard Cole, Christoph Hertrich, Yixin Tao, László A. Végh
A First Order Method for Linear Programming Parameterized by Circuit Imbalance. CoRR (2023)
Ishan Agarwal, Richard Cole
Stable Matching: Choosing Which Proposals to Make. ICALP (2023)
Ishan Agarwal, Richard Cole
Stable Matching: Choosing Which Proposals to Make. CoRR (2022)
Richard Cole, Yixin Tao
On the existence of Pareto Efficient and envy-free allocations. J. Econ. Theory 193 (2021)
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) (2021)
Moshe Babaioff, Richard Cole, Jason D. Hartline, Nicole Immorlica, Brendan Lucier
Non-Quasi-Linear Agents in Quasi-Linear Mechanisms (Extended Abstract). ITCS (2021)
Ishan Agarwal, Richard Cole, Yixin Tao
Selecting a Match: Exploration vs Decision. CoRR (2021)
Rediet Abebe, Richard Cole, Vasilis Gkatzelis, Jason D. Hartline
A Truthful Cardinal Mechanism for One-Sided Matching. SODA (2020)
Yun Kuen Cheung, Richard Cole, Nikhil R. Devanur
Tatonnement beyond gross substitutes? Gradient descent to the rescue. Games Econ. Behav. 123 (2020)
Moshe Babaioff, Richard Cole, Jason D. Hartline, Nicole Immorlica, Brendan Lucier
Non-quasi-linear Agents in Quasi-linear Mechanisms. CoRR (2020)
Richard Cole, Yixin Tao
On the Existence of Pareto Efficient and Envy Free Allocations. CoRR (2019)
Rediet Abebe, Richard Cole, Vasilis Gkatzelis, Jason D. Hartline
A Truthful Cardinal Mechanism for One-Sided Matching. CoRR (2019)
Richard Cole, Yixin Tao
Balancing the Robustness and Convergence of Tatonnement. CoRR (2019)
Yun Kuen Cheung, Richard Cole
Amortized Analysis of Asynchronous Price Dynamics. CoRR (2018)
Richard Cole, Yixin Tao
An Analysis of Asynchronous Stochastic Accelerated Coordinate Descent. CoRR (2018)
Richard Cole, Thanasis Lianeas, Evdokia Nikolova
When Does Diversity of Agent Preferences Improve Outcomes in Selfish Routing? IJCAI (2018)
Richard Cole, Vasilis Gkatzelis
Approximating the Nash Social Welfare with Indivisible Items. SIAM J. Comput. 47 (3) (2018)
Yun Kuen Cheung, Richard Cole, Yixin Tao
(Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup. CoRR (2018)
Yun Kuen Cheung, Richard Cole, Yixin Tao
Dynamics of Distributed Updating in Fisher Markets. EC (2018)
Yun Kuen Cheung, Richard Cole, Yixin Tao
Dynamics of Distributed Updating in Fisher Markets. CoRR (2018)
Yun Kuen Cheung, Richard Cole
Amortized Analysis of Asynchronous Price Dynamics. ESA (2018)
Yun Kuen Cheung, Richard Cole, Yixin Tao
Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism. CoRR (2018)
Richard Cole, Vijaya Ramachandran
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract. SPAA (2017)
Richard Cole, Thanasis Lianeas, Evdokia Nikolova
When Does Diversity of User Preferences Improve Outcomes in Selfish Routing? CoRR (2017)
Richard Cole, Vijaya Ramachandran
Resource Oblivious Sorting on Multicores. ACM Trans. Parallel Comput. 3 (4) (2017)
Richard Cole, Shravas Rao
Applications of α-Strongly Regular Distributions to Bayesian Auctions. ACM Trans. Economics and Comput. 5 (4) (2017)
Richard Cole, Vijaya Ramachandran
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers. CoRR (2017)
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)
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 (2016)
Richard Cole, Yixin Tao
Large Market Games with Near Optimal Efficiency. EC (2016)
Yun Kuen Cheung, Richard Cole
A Unified Approach to Analyzing Asynchronous Coordinate Descent and Tatonnement. CoRR (2016)
Richard Cole, Yixin Tao
The Price of Anarchy of Large Walrasian Auctions. CoRR (2015)
Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. Algorithmica 72 (2) (2015)
Richard Cole, Vasilis Gkatzelis
Approximating the nash social welfare with indivisible items. SIGecom Exch. 14 (1) (2015)
Richard Cole, Shravas Rao
Applications of α-Strongly Regular Distributions to Bayesian Auctions. WINE (2015)
Richard Cole, Vijaya Ramachandran
Resource Oblivious Sorting on Multicores. CoRR (2015)
Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver
Decentralized utilitarian mechanisms for scheduling games. Games Econ. Behav. 92 (2015)
Richard Cole, Vasilis Gkatzelis
Approximating the Nash Social Welfare with Indivisible Items. STOC (2015)
Richard Cole, Shravas Rao
Applications of α-strongly regular distributions to Bayesian auctions. CoRR (2015)
Richard Cole, Tim Roughgarden
The Sample Complexity of Revenue Maximization. CoRR (2015)
Yun Kuen Cheung, Richard Cole
Amortized Analysis on Asynchronous Gradient Descent. CoRR (2014)
Richard Cole, Carmit Hazay, Moshe Lewenstein, Dekel Tsur
Two-Dimensional Parameterized Matching. ACM Trans. Algorithms 11 (2) (2014)
Richard Cole, Howard J. Karloff
Fast Algorithms for Constructing Maximum Entropy Summary Trees. ICALP (1) (2014)
Richard Cole, Tim Roughgarden
The sample complexity of revenue maximization. STOC (2014)
Richard Cole, Howard J. Karloff
Fast Algorithms for Constructing Maximum Entropy Summary Trees. CoRR (2014)
Yun Kuen Cheung, Richard Cole, Nikhil R. Devanur
Tatonnement beyond gross substitutes?: gradient descent to the rescue. STOC (2013)
Richard Cole, Vasilis Gkatzelis, Gagan Goel
Positive results for mechanism design without money. AAMAS (2013)
Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. CoRR (2013)
Richard Cole, Vijaya Ramachandran
Analysis of Randomized Work Stealing with False Sharing. IPDPS (2013)
Richard Cole, Vasilis Gkatzelis, Gagan Goel
Mechanism design for fair division: allocating divisible items without payments. EC (2013)
Yun Kuen Cheung, Richard Cole, Ashish Rastogi
Tatonnement in ongoing markets of complementary goods. EC (2012)
Yun Kuen Cheung, Richard Cole, Ashish Rastogi
Tatonnement in Ongoing Markets of Complementary Goods CoRR (2012)
Richard Cole, Vasilis Gkatzelis, Gagan Goel
Truthful Mechanisms for Proportionally Fair Allocations CoRR (2012)
Richard Cole, Vasilis Gkatzelis, Gagan Goel
Mechanism Design for Fair Division CoRR (2012)
Richard Cole, Vijaya Ramachandran
Revisiting the Cache Miss Analysis of Multithreaded Algorithms. LATIN (2012)
Richard Cole, Vijaya Ramachandran
Efficient Resource Oblivious Algorithms for Multicores with False Sharing. IPDPS (2012)
Richard Cole, Yevgeniy Dodis, Tim Roughgarden
Bottleneck links, variable demand, and the tragedy of the commons. Networks 60 (3) (2012)
Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver
Inner product spaces for MinSum coordination mechanisms. STOC (2011)
Richard Cole, Vijaya Ramachandran
Analysis of Randomized Work Stealing with False Sharing CoRR (2011)
Richard Cole, Vijaya Ramachandran
Efficient Resource Oblivious Algorithms for Multicores CoRR (2011)
Richard Cole, Vasilis Gkatzelis, Vahab S. Mirrokni
Coordination Mechanisms for Weighted Sum of Completion Times in Machine Scheduling CoRR (2010)
Richard Cole, Vijaya Ramachandran
Resource Oblivious Sorting on Multicores. ICALP (1) (2010)
Richard Cole, Lisa Fleischer, Ashish Rastogi
Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses CoRR (2010)
Richard Cole, Shahar Dobzinski, Lisa Fleischer
Prompt Mechanisms for Online Auctions. SAGT (2008)
Richard Cole, Lukasz Kowalik
New Linear-Time Algorithms for Edge-Coloring Planar Graphs. Algorithmica 50 (3) (2008)
Richard Cole, Lisa Fleischer
Fast-converging tatonnement algorithms for one-time and ongoing market problems. STOC (2008)
Mihai Badoiu, Richard Cole, Erik D. Demaine, John Iacono
A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. 382 (2) (2007)
Richard Cole, Lukasz Kowalik, Riste Skrekovski
A Generalization of Kotzig's Theorem and Its Application. SIAM J. Discret. Math. 21 (1) (2007)
Ashish Rastogi, Richard Cole
Indivisible Markets with Good Approximate EquilibriumPrices. Electron. Colloquium Comput. Complex. 14 (017) (2007)
Richard Cole, Lee-Ad Gottlieb
Searching dynamic point sets in spaces with bounded doubling dimension. STOC (2006)
Richard Cole, Yevgeniy Dodis, Tim Roughgarden
How much can taxes help selfish routing? J. Comput. Syst. Sci. 72 (3) (2006)
Richard Cole, Yevgeniy Dodis, Tim Roughgarden
Bottleneck links, variable demand, and the tragedy of the commons. SODA (2006)
Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. ICALP (1) (2006)
Richard Cole, Ramesh Hariharan
Dynamic LCA Queries on Trees. SIAM J. Comput. 34 (4) (2005)
Hiroshi Ishikawa, Davi Geiger, Richard Cole
Finding Tree Structures by Grouping Symmetries. ICCV (2005)
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) (2005)
Richard Cole, Dennis E. Shasha, Xiaojian Zhao
Fast window correlations over uncooperative time series. KDD (2005)
Richard Cole, David C. Kandathil
The Average Case Analysis of Partition Sorts. ESA (2004)
Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park
Parallel two dimensional witness computation. Inf. Comput. 188 (1) (2004)
Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein
Dictionary matching and indexing with errors and don't cares. STOC (2004)
Richard Cole, Ramesh Hariharan
A fast algorithm for computing steiner edge connectivity. STOC (2003)
Richard Cole, Ramesh Hariharan
Faster Suffix Tree Construction with Missing Suffix Links. SIAM J. Comput. 33 (1) (2003)
Richard Cole, Ramesh Hariharan
Tree Pattern Matching to Subset Matching in Linear Time. SIAM J. Comput. 32 (4) (2003)
Richard Cole, Moshe Lewenstein
Multidimensional matching and fast search in suffix trees. SODA (2003)
Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
Overlap matching. Inf. Comput. 181 (1) (2003)
Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
Function Matching: Algorithms, Applications, and a Lower Bound. ICALP (2003)
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) (2003)
Richard Cole, Yevgeniy Dodis, Tim Roughgarden
Pricing network edges for heterogeneous selfish users. STOC (2003)
Richard Cole, Yevgeniy Dodis, Tim Roughgarden
How much can taxes help selfish routing? EC (2003)
Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang
Computing the Minimum k-Cover of a String. Stringology (2003)
Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito
Two Simplified Algorithms for Maintaining Order in a List. ESA (2002)
Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. ESA (2002)
Richard Cole, Ramesh Hariharan
Approximate String Matching: A Simpler Faster Algorithm. SIAM J. Comput. 31 (6) (2002)
Richard Cole, Ramesh Hariharan
Verifying candidate matches in sparse and wildcard matching. STOC (2002)
Michael A. Bender, Richard Cole, Rajeev Raman
Exponential Structures for Efficient Cache-Oblivious Algorithms. ICALP (2002)
Richard Cole, Kirstin Ost, Stefan Schirra
Edge-Coloring Bipartite Multigraphs in O(E log D) Time. Comb. 21 (1) (2001)
Naila Rahman, Richard Cole, Rajeev Raman
Optimised Predecessor Data Structures for Internal Memory. WAE (2001)
Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman
On the Benefit of Supporting Virtual Channels in Wormhole Routers. J. Comput. Syst. Sci. 62 (1) (2001)
Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
Overlap matching. SODA (2001)
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
A faster implementation of the Goemans-Williamson clustering algorithm. SODA (2001)

Richard Cole.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Richard Cole