Liadan O'Callaghan

Artificial Intelligence · 2000–2003

A researcher in the Science corpus: 6 papers; trusts 11 researchers and is trusted by 45 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 18 citations into it; #5,357 of 35,345 by trust here, #6,664 by citations
• Computer Networks and Communications — 18 citations into it; #2,134 of 9,886 by trust here, #2,358 by citations
• Computational Theory and Mathematics — 15 citations into it; #5,991 of 12,182 by trust here, #7,501 by citations
• Organizational Behavior and Human Resource Management — 13 citations into it; #3,796 of 8,741 by trust here, #6,799 by citations
• Signal Processing — 8 citations into it; #981 of 7,572 by trust here, #901 by citations
• Management Science and Operations Research — 5 citations into it; #6,551 of 11,946 by trust here, #4,267 by citations

Whom Liadan O'Callaghan trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Sudipto Guha
2. Kamal Kumar Jain
3. Piotr Indyk
4. Jiawei Han
5. Moses Charikar
6. Adam Meyerson
7. Rajeev Motwani
8. Vijay V. Vazirani
9. Nina Mishra
10. Micheline Kamber

Who trusts Liadan O'Callaghan overall

1. Charu C. Aggarwal
2. Mohamed Medhat Gaber
3. Yixin Chen
4. S. Muthu Muthukrishnan
5. Noam Nisan
6. Dongkuan Xu
7. Arkady B. Zaslavsky
8. Hai-Long Nguyen
9. Jiawei Han
10. Ahmed Ali Abdalla Esmin

Papers from Liadan O'Callaghan's perspective

Ordered by how strongly the researchers Liadan O'Callaghan trusts endorse each paper. Same corpus, a different order for every researcher.

1. Primal-dual approximation algorithms for metric facility location and k-median problems
2. Pattern classification and scene analysis
3. Approximation algorithms for facility location problems
4. Algorithms for Clustering Data
5. Data-streams and histograms (Symposium on the Theory of Computing)
6. Local search heuristic for k-median and facility location problems (Symposium on the Theory of Computing)
7. Space-efficient online computation of quantile summaries
8. Data Mining: Concepts and Techniques
9. Incremental clustering and dynamic information retrieval
10. Near-optimal sparse fourier representations via sampling

Their papers

• Better streaming algorithms for clustering problems (2003) — 313 citations
• Truth revelation in approximately efficient combinatorial auctions (2002) — 800 citations
• Clustering Data Streams: Theory and Practice (2003) — 943 citations
• Maintaining variance and k-medians over data stream windows (2003) — 323 citations
• Streaming-data algorithms for high-quality clustering (2002) — 694 citations
• Clustering data streams (2000) — 903 citations