Liadan O'Callaghan

According to our database, Liadan O'Callaghan authored at least 13 papers between 2000 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2018

Asymptotic Polynomial Time Approximation Schemes.

Rajeev Motwani, Liadan O'Callaghan, An Zhu

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2007

Asymptotic Polynomial-Time Approximation Schemes.

An Zhu, Rajeev Motwani, Liadan O'Callaghan

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Querying priced information in databases: The conjunctive case.

Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas

ACM Trans. Algorithms, 2007

Computing shortest paths with uncertainty.

Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy

J. Algorithms, 2007

2004

A <i>k</i>-Median Algorithm with Running Time Independent of Data Size.

Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin

Mach. Learn., 2004

2003

Approximation algorithms for clustering streams and large data sets.

Liadan O'Callaghan

PhD thesis, 2003

Clustering Data Streams: Theory and Practice.

Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan

IEEE Trans. Knowl. Data Eng., 2003

Better streaming algorithms for clustering problems.

Moses Charikar, Liadan O'Callaghan, Rina Panigrahy

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Representing Graph Metrics with Fewest Edges.

Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Maintaining variance and k-medians over data stream windows.

Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan O'Callaghan

Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

2002

Truth revelation in approximately efficient combinatorial auctions.

Daniel Lehmann, Liadan O'Callaghan, Yoav Shoham

J. ACM, 2002

Streaming-Data Algorithms for High-Quality Clustering.

Liadan O'Callaghan, Adam Meyerson, Rajeev Motwani, Nina Mishra, Sudipto Guha

Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

2000

Clustering Data Streams.

Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000