%0 Conference Paper %1 conf/icdt/KrollPS16 %A Kröll, Markus %A Pichler, Reinhard %A Skritek, Sebastian %B ICDT %D 2016 %E Martens, Wim %E Zeume, Thomas %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 22:1-22:18 %T On the Complexity of Enumerating the Answers to Well-designed Pattern Trees. %U http://dblp.uni-trier.de/db/conf/icdt/icdt2016.html#KrollPS16 %V 48 %@ 978-3-95977-002-6

@inproceedings{conf/icdt/KrollPS16, added-at = {2023-08-06T00:00:00.000+0200}, author = {Kröll, Markus and Pichler, Reinhard and Skritek, Sebastian}, biburl = {https://www.bibsonomy.org/bibtex/2f70da04b0136c031689024f70b28362b/dblp}, booktitle = {ICDT}, crossref = {conf/icdt/2016}, editor = {Martens, Wim and Zeume, Thomas}, ee = {https://doi.org/10.4230/LIPIcs.ICDT.2016.22}, interhash = {f9bbae7d65f213219782e14d0c6fda5c}, intrahash = {f70da04b0136c031689024f70b28362b}, isbn = {978-3-95977-002-6}, keywords = {dblp}, pages = {22:1-22:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-10T16:54:39.000+0200}, title = {On the Complexity of Enumerating the Answers to Well-designed Pattern Trees.}, url = {http://dblp.uni-trier.de/db/conf/icdt/icdt2016.html#KrollPS16}, volume = 48, year = 2016 }