Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{watson:LIPIcs:2017:7598, author = {Thomas Watson}, title = {{Communication Complexity of Statistical Distance}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {49:149:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770446}, ISSN = {18688969}, year = {2017}, volume = {81}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7598}, URN = {urn:nbn:de:0030drops75984}, doi = {10.4230/LIPIcs.APPROXRANDOM.2017.49}, annote = {Keywords: Communication, complexity, statistical, distance} }
Keywords:  Communication, complexity, statistical, distance  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)  
Issue Date:  2017  
Date of publication:  31.07.2017 