default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiadan O'Callaghan
Person information
- affiliation: Stanford University, Department of Computer Science, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2003
[b1]Liadan O'Callaghan:
Approximation algorithms for clustering streams and large data sets. Stanford University, USA, 2003
Journal Articles
- 2007
- [j5]Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy:
Computing shortest paths with uncertainty. J. Algorithms 62(1): 1-18 (2007) - [j4]Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas:
Querying priced information in databases: The conjunctive case. ACM Trans. Algorithms 3(1): 9:1-9:22 (2007) - 2004
- [j3]Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin:
A k-Median Algorithm with Running Time Independent of Data Size. Mach. Learn. 56(1-3): 61-87 (2004) - 2003
- [j2]Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan:
Clustering Data Streams: Theory and Practice. IEEE Trans. Knowl. Data Eng. 15(3): 515-528 (2003) - 2002
- [j1]Daniel Lehmann, Liadan O'Callaghan, Yoav Shoham:
Truth revelation in approximately efficient combinatorial auctions. J. ACM 49(5): 577-602 (2002)
Conference and Workshop Papers
- 2003
- [c7]Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan O'Callaghan:
Maintaining variance and k-medians over data stream windows. PODS 2003: 234-243 - [c6]Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy:
Representing Graph Metrics with Fewest Edges. STACS 2003: 355-366 - [c5]Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy:
Computing Shortest Paths with Uncertainty. STACS 2003: 367-378 - [c4]Moses Charikar
, Liadan O'Callaghan, Rina Panigrahy:
Better streaming algorithms for clustering problems. STOC 2003: 30-39 - 2002
- [c3]Liadan O'Callaghan, Adam Meyerson, Rajeev Motwani, Nina Mishra, Sudipto Guha:
Streaming-Data Algorithms for High-Quality Clustering. ICDE 2002: 685-694 - 2000
- [c2]Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan:
Clustering Data Streams. FOCS 2000: 359-366 - 1999
- [c1]Daniel Lehmann, Liadan O'Callaghan, Yoav Shoham:
Truth revelation in approximately efficient combinatorial auctions. EC 1999: 96-102
Parts in Books or Collections
- 2018
- [p1]Rajeev Motwani, Liadan O'Callaghan, An Zhu:
Asymptotic Polynomial Time Approximation Schemes. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 173-187
Reference Works
- 2007
- [r1]An Zhu, Rajeev Motwani, Liadan O'Callaghan:
Asymptotic Polynomial-Time Approximation Schemes. Handbook of Approximation Algorithms and Metaheuristics 2007
Informal and Other Publications
- 2002
- [i1]Daniel Lehmann, Liadan O'Callaghan, Yoav Shoham:
Truth Revelation in Approximately Efficient Combinatorial Auctions. CoRR cs.GT/0202017 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
