Liadan O'Callaghan

According to our database1, Liadan O'Callaghan
  • authored at least 14 papers between 1999 and 2007.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2007
Asymptotic Polynomial-Time Approximation Schemes.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Querying priced information in databases: The conjunctive case.
ACM Trans. Algorithms, 2007

Computing shortest paths with uncertainty.
J. Algorithms, 2007

2004
A k-Median Algorithm with Running Time Independent of Data Size.
Machine Learning, 2004

2003
Clustering Data Streams: Theory and Practice.
IEEE Trans. Knowl. Data Eng., 2003

Better streaming algorithms for clustering problems.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Computing Shortest Paths with Uncertainty.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Representing Graph Metrics with Fewest Edges.
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.
Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

2002
Truth revelation in approximately efficient combinatorial auctions.
J. ACM, 2002

Truth Revelation in Approximately Efficient Combinatorial Auctions
CoRR, 2002

Streaming-Data Algorithms for High-Quality Clustering.
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

2000
Clustering Data Streams.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Truth revelation in approximately efficient combinatorial auctions.
EC, 1999


  Loading...