Bounds and Algorithms for Joins via Fractional Edge Covers. Grohe, M. In In Search of Elegance in the Theory and Practice of Computation - Essays Dedicated to Peter Buneman, pages 321–338, 2013.
Paper doi bibtex @inproceedings{DBLP:conf/birthday/Grohe13,
author = {Martin Grohe},
title = {Bounds and Algorithms for Joins via Fractional Edge Covers},
booktitle = {In Search of Elegance in the Theory and Practice of Computation -
Essays Dedicated to Peter Buneman},
pages = {321--338},
year = {2013},
crossref = {DBLP:conf/birthday/2013buneman},
url = {https://doi.org/10.1007/978-3-642-41660-6\_17},
doi = {10.1007/978-3-642-41660-6\_17},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Grohe13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":{"_str":"52a13f129eb585cc26001ae4"},"__v":8,"authorIDs":["545720022abc8e9f370000a8","oWamqdovFccHcFdCZ"],"author_short":["Grohe, M."],"bibbaseid":"grohe-boundsandalgorithmsforjoinsviafractionaledgecovers-2013","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Martin"],"propositions":[],"lastnames":["Grohe"],"suffixes":[]}],"title":"Bounds and Algorithms for Joins via Fractional Edge Covers","booktitle":"In Search of Elegance in the Theory and Practice of Computation - Essays Dedicated to Peter Buneman","pages":"321–338","year":"2013","crossref":"DBLP:conf/birthday/2013buneman","url":"https://doi.org/10.1007/978-3-642-41660-6_17","doi":"10.1007/978-3-642-41660-6_17","timestamp":"Tue, 14 May 2019 10:00:52 +0200","biburl":"https://dblp.org/rec/conf/birthday/Grohe13.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/birthday/Grohe13,\n author = {Martin Grohe},\n title = {Bounds and Algorithms for Joins via Fractional Edge Covers},\n booktitle = {In Search of Elegance in the Theory and Practice of Computation -\n Essays Dedicated to Peter Buneman},\n pages = {321--338},\n year = {2013},\n crossref = {DBLP:conf/birthday/2013buneman},\n url = {https://doi.org/10.1007/978-3-642-41660-6\\_17},\n doi = {10.1007/978-3-642-41660-6\\_17},\n timestamp = {Tue, 14 May 2019 10:00:52 +0200},\n biburl = {https://dblp.org/rec/conf/birthday/Grohe13.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Grohe, M."],"key":"DBLP:conf/birthday/Grohe13","id":"DBLP:conf/birthday/Grohe13","bibbaseid":"grohe-boundsandalgorithmsforjoinsviafractionaledgecovers-2013","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-642-41660-6_17"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://dblp.org/pers/tb2/g/Grohe:Martin","downloads":0,"keywords":[],"search_terms":["bounds","algorithms","joins","via","fractional","edge","covers","grohe"],"title":"Bounds and Algorithms for Joins via Fractional Edge Covers","year":2013,"dataSources":["jS7oF7ycnJjCpQRs7"]}