%0 Conference Paper %1 conf/icdt/KoutrisBS16 %A Koutris, Paraschos %A Beame, Paul %A Suciu, Dan %B ICDT %D 2016 %E Martens, Wim %E Zeume, Thomas %I Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik %K dblp %P 8:1-8:18 %T Worst-Case Optimal Algorithms for Parallel Query Processing. %U http://dblp.uni-trier.de/db/conf/icdt/icdt2016.html#KoutrisBS16 %V 48 %@ 978-3-95977-002-6

@inproceedings{conf/icdt/KoutrisBS16, added-at = {2018-08-23T00:00:00.000+0200}, author = {Koutris, Paraschos and Beame, Paul and Suciu, Dan}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/28ccd01374ab49e348b1f0ae63453733a/dblp}, booktitle = {ICDT}, crossref = {conf/icdt/2016}, editor = {Martens, Wim and Zeume, Thomas}, ee = {https://doi.org/10.4230/LIPIcs.ICDT.2016.8}, interhash = {316839ba0b4dc62ccf8541de4130f93b}, intrahash = {8ccd01374ab49e348b1f0ae63453733a}, isbn = {978-3-95977-002-6}, keywords = {dblp}, pages = {8:1-8:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, series = {LIPIcs}, timestamp = {2019-09-27T16:43:03.000+0200}, title = {Worst-Case Optimal Algorithms for Parallel Query Processing.}, url = {http://dblp.uni-trier.de/db/conf/icdt/icdt2016.html#KoutrisBS16}, volume = 48, year = 2016 }