BibTeX record conf/alenex/LahotiNT17

download as .bib file

@inproceedings{DBLP:conf/alenex/LahotiNT17,
  author    = {Preethi Lahoti and
               Patrick K. Nicholson and
               Bilyana Taneva},
  title     = {Efficient Set Intersection Counting Algorithm for Text Similarity
               Measures},
  booktitle = {Proceedings of the Ninteenth Workshop on Algorithm Engineering and
               Experiments, {ALENEX} 2017, Barcelona, Spain, Hotel Porta Fira, January
               17-18, 2017.},
  pages     = {146--158},
  year      = {2017},
  crossref  = {DBLP:conf/alenex/2017},
  url       = {https://doi.org/10.1137/1.9781611974768.12},
  doi       = {10.1137/1.9781611974768.12},
  timestamp = {Sat, 19 Oct 2019 20:00:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/alenex/LahotiNT17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alenex/2017,
  editor    = {S{\'{a}}ndor P. Fekete and
               Vijaya Ramachandran},
  title     = {Proceedings of the Ninteenth Workshop on Algorithm Engineering and
               Experiments, {ALENEX} 2017, Barcelona, Spain, Hotel Porta Fira, January
               17-18, 2017},
  publisher = {{SIAM}},
  year      = {2017},
  url       = {https://doi.org/10.1137/1.9781611974768},
  doi       = {10.1137/1.9781611974768},
  isbn      = {978-1-61197-476-8},
  timestamp = {Fri, 19 May 2017 01:26:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/alenex/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics