BibTeX record: conf/soda/BenderPSS01

download as .bib file

@inproceedings{DBLP:conf/soda/BenderPSS01,
  author    = {Michael A. Bender and
               Giridhar Pemmasani and
               Steven Skiena and
               Pavel Sumazin},
  title     = {Finding least common ancestors in directed acyclic graphs},
  booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
               January 7-9, 2001, Washington, DC, {USA.}},
  year      = {2001},
  pages     = {845--854},
  crossref  = {DBLP:conf/soda/2001},
  url       = {http://dl.acm.org/citation.cfm?id=365411.365795},
  timestamp = {Sat, 25 Oct 2014 15:40:25 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/BenderPSS01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2001,
  editor    = {S. Rao Kosaraju},
  title     = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
               January 7-9, 2001, Washington, DC, {USA}},
  year      = {2001},
  publisher = {{ACM/SIAM}},
  url       = {http://dl.acm.org/citation.cfm?id=365411},
  isbn      = {0-89871-490-7},
  timestamp = {Sat, 25 Oct 2014 15:40:25 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/soda/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}