Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{bendavid:LIPIcs:2016:6688, author = {Shalev BenDavid}, title = {{The Structure of Promises in Quantum Speedups}}, booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)}, pages = {7:17:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770194}, ISSN = {18688969}, year = {2016}, volume = {61}, editor = {Anne Broadbent}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6688}, URN = {urn:nbn:de:0030drops66882}, doi = {10.4230/LIPIcs.TQC.2016.7}, annote = {Keywords: Quantum computing, quantum query complexity, decision tree complexity, lower bounds, quantum adversary method} }
Keywords:  Quantum computing, quantum query complexity, decision tree complexity, lower bounds, quantum adversary method  
Seminar:  11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)  
Issue Date:  2016  
Date of publication:  13.09.2016 