BibTeX records: Liadan O'Callaghan

download as .bib file

@incollection{DBLP:books/tf/18/MotwaniOZ18,
  author       = {Rajeev Motwani and
                  Liadan O'Callaghan and
                  An Zhu},
  editor       = {Teofilo F. Gonzalez},
  title        = {Asymptotic Polynomial Time Approximation Schemes},
  booktitle    = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
                  Volume 1: Methologies and Traditional Applications},
  pages        = {173--187},
  publisher    = {Chapman and Hall/CRC},
  year         = {2018},
  url          = {https://doi.org/10.1201/9781351236423-10},
  doi          = {10.1201/9781351236423-10},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/books/tf/18/MotwaniOZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FederMOOP07,
  author       = {Tom{\'{a}}s Feder and
                  Rajeev Motwani and
                  Liadan O'Callaghan and
                  Chris Olston and
                  Rina Panigrahy},
  title        = {Computing shortest paths with uncertainty},
  journal      = {J. Algorithms},
  volume       = {62},
  number       = {1},
  pages        = {1--18},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.jalgor.2004.07.005},
  doi          = {10.1016/J.JALGOR.2004.07.005},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/FederMOOP07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CarmoFKLMOPT07,
  author       = {Renato Carmo and
                  Tom{\'{a}}s Feder and
                  Yoshiharu Kohayakawa and
                  Eduardo Sany Laber and
                  Rajeev Motwani and
                  Liadan O'Callaghan and
                  Rina Panigrahy and
                  Dilys Thomas},
  title        = {Querying priced information in databases: The conjunctive case},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {3},
  number       = {1},
  pages        = {9:1--9:22},
  year         = {2007},
  url          = {https://doi.org/10.1145/1219944.1219955},
  doi          = {10.1145/1219944.1219955},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/CarmoFKLMOPT07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/ZhuMO07,
  author       = {An Zhu and
                  Rajeev Motwani and
                  Liadan O'Callaghan},
  editor       = {Teofilo F. Gonzalez},
  title        = {Asymptotic Polynomial-Time Approximation Schemes},
  booktitle    = {Handbook of Approximation Algorithms and Metaheuristics},
  publisher    = {Chapman and Hall/CRC},
  year         = {2007},
  url          = {https://doi.org/10.1201/9781420010749.ch11},
  doi          = {10.1201/9781420010749.CH11},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/reference/crc/ZhuMO07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/MeyersonOP04,
  author       = {Adam Meyerson and
                  Liadan O'Callaghan and
                  Serge A. Plotkin},
  title        = {A \emph{k}-Median Algorithm with Running Time Independent of Data
                  Size},
  journal      = {Mach. Learn.},
  volume       = {56},
  number       = {1-3},
  pages        = {61--87},
  year         = {2004},
  url          = {https://doi.org/10.1023/B:MACH.0000033115.78247.f0},
  doi          = {10.1023/B:MACH.0000033115.78247.F0},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/MeyersonOP04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/OCallaghan03,
  author       = {Liadan O'Callaghan},
  title        = {Approximation algorithms for clustering streams and large data sets},
  school       = {Stanford University, {USA}},
  year         = {2003},
  url          = {https://searchworks.stanford.edu/view/5585198},
  timestamp    = {Wed, 31 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/us/OCallaghan03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkde/GuhaMMMO03,
  author       = {Sudipto Guha and
                  Adam Meyerson and
                  Nina Mishra and
                  Rajeev Motwani and
                  Liadan O'Callaghan},
  title        = {Clustering Data Streams: Theory and Practice},
  journal      = {{IEEE} Trans. Knowl. Data Eng.},
  volume       = {15},
  number       = {3},
  pages        = {515--528},
  year         = {2003},
  url          = {https://doi.org/10.1109/TKDE.2003.1198387},
  doi          = {10.1109/TKDE.2003.1198387},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tkde/GuhaMMMO03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/BabcockDMO03,
  author       = {Brian Babcock and
                  Mayur Datar and
                  Rajeev Motwani and
                  Liadan O'Callaghan},
  editor       = {Frank Neven and
                  Catriel Beeri and
                  Tova Milo},
  title        = {Maintaining variance and k-medians over data stream windows},
  booktitle    = {Proceedings of the Twenty-Second {ACM} {SIGACT-SIGMOD-SIGART} Symposium
                  on Principles of Database Systems, June 9-12, 2003, San Diego, CA,
                  {USA}},
  pages        = {234--243},
  publisher    = {{ACM}},
  year         = {2003},
  url          = {https://doi.org/10.1145/773153.773176},
  doi          = {10.1145/773153.773176},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/pods/BabcockDMO03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FederMMOP03,
  author       = {Tom{\'{a}}s Feder and
                  Adam Meyerson and
                  Rajeev Motwani and
                  Liadan O'Callaghan and
                  Rina Panigrahy},
  editor       = {Helmut Alt and
                  Michel Habib},
  title        = {Representing Graph Metrics with Fewest Edges},
  booktitle    = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
                  Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2607},
  pages        = {355--366},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/3-540-36494-3\_32},
  doi          = {10.1007/3-540-36494-3\_32},
  timestamp    = {Thu, 14 Oct 2021 10:38:16 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/FederMMOP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FederMOOP03,
  author       = {Tom{\'{a}}s Feder and
                  Rajeev Motwani and
                  Liadan O'Callaghan and
                  Chris Olston and
                  Rina Panigrahy},
  editor       = {Helmut Alt and
                  Michel Habib},
  title        = {Computing Shortest Paths with Uncertainty},
  booktitle    = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
                  Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2607},
  pages        = {367--378},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/3-540-36494-3\_33},
  doi          = {10.1007/3-540-36494-3\_33},
  timestamp    = {Thu, 02 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/FederMOOP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CharikarOP03,
  author       = {Moses Charikar and
                  Liadan O'Callaghan and
                  Rina Panigrahy},
  editor       = {Lawrence L. Larmore and
                  Michel X. Goemans},
  title        = {Better streaming algorithms for clustering problems},
  booktitle    = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
                  June 9-11, 2003, San Diego, CA, {USA}},
  pages        = {30--39},
  publisher    = {{ACM}},
  year         = {2003},
  url          = {https://doi.org/10.1145/780542.780548},
  doi          = {10.1145/780542.780548},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/CharikarOP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LehmannOS02,
  author       = {Daniel Lehmann and
                  Liadan O'Callaghan and
                  Yoav Shoham},
  title        = {Truth revelation in approximately efficient combinatorial auctions},
  journal      = {J. {ACM}},
  volume       = {49},
  number       = {5},
  pages        = {577--602},
  year         = {2002},
  url          = {https://doi.org/10.1145/585265.585266},
  doi          = {10.1145/585265.585266},
  timestamp    = {Fri, 09 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/LehmannOS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/OCallaghanMMMG02,
  author       = {Liadan O'Callaghan and
                  Adam Meyerson and
                  Rajeev Motwani and
                  Nina Mishra and
                  Sudipto Guha},
  editor       = {Rakesh Agrawal and
                  Klaus R. Dittrich},
  title        = {Streaming-Data Algorithms for High-Quality Clustering},
  booktitle    = {Proceedings of the 18th International Conference on Data Engineering,
                  San Jose, CA, USA, February 26 - March 1, 2002},
  pages        = {685--694},
  publisher    = {{IEEE} Computer Society},
  year         = {2002},
  url          = {https://doi.org/10.1109/ICDE.2002.994785},
  doi          = {10.1109/ICDE.2002.994785},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icde/OCallaghanMMMG02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-GT-0202017,
  author       = {Daniel Lehmann and
                  Liadan O'Callaghan and
                  Yoav Shoham},
  title        = {Truth Revelation in Approximately Efficient Combinatorial Auctions},
  journal      = {CoRR},
  volume       = {cs.GT/0202017},
  year         = {2002},
  url          = {https://arxiv.org/abs/cs/0202017},
  timestamp    = {Fri, 10 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/cs-GT-0202017.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuhaMMO00,
  author       = {Sudipto Guha and
                  Nina Mishra and
                  Rajeev Motwani and
                  Liadan O'Callaghan},
  title        = {Clustering Data Streams},
  booktitle    = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
                  12-14 November 2000, Redondo Beach, California, {USA}},
  pages        = {359--366},
  publisher    = {{IEEE} Computer Society},
  year         = {2000},
  url          = {https://doi.org/10.1109/SFCS.2000.892124},
  doi          = {10.1109/SFCS.2000.892124},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/GuhaMMO00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/LehmannOS99,
  author       = {Daniel Lehmann and
                  Liadan O'Callaghan and
                  Yoav Shoham},
  editor       = {Stuart I. Feldman and
                  Michael P. Wellman},
  title        = {Truth revelation in approximately efficient combinatorial auctions},
  booktitle    = {Proceedings of the First {ACM} Conference on Electronic Commerce (EC-99),
                  Denver, CO, USA, November 3-5, 1999},
  pages        = {96--102},
  publisher    = {{ACM}},
  year         = {1999},
  url          = {https://doi.org/10.1145/336992.337016},
  doi          = {10.1145/336992.337016},
  timestamp    = {Fri, 09 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sigecom/LehmannOS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics