On the Complexity of Enumerating the Answers to Well-designed Pattern Trees (bibtex)
by Markus Kröll, Reinhard Pichler, Sebastian Skritek
Reference:
On the Complexity of Enumerating the Answers to Well-designed Pattern TreesMarkus Kröll, Reinhard Pichler, Sebastian Skritek19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016 (Wim Martens, Thomas Zeume, eds.), volume 48 of LIPIcs, pages 22:1–22:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Bibtex Entry:
@inproceedings{DBLP:conf/icdt/KrollPS16,
  author    = {Markus Kr{\"{o}}ll and
               Reinhard Pichler and
               Sebastian Skritek},
  editor    = {Wim Martens and
               Thomas Zeume},
  title     = {On the Complexity of Enumerating the Answers to Well-designed Pattern
               Trees},
  booktitle = {19th International Conference on Database Theory, {ICDT} 2016, Bordeaux,
               France, March 15-18, 2016},
  series    = {LIPIcs},
  volume    = {48},
  pages     = {22:1--22:18},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2016},
  url       = {http://doai.io/10.4230/LIPIcs.ICDT.2016.22},
  doi       = {10.4230/LIPIcs.ICDT.2016.22},
  timestamp = {Tue, 23 May 2017 01:12:16 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icdt/KrollPS16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
Powered by bibtexbrowser