Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{starikovskaya:LIPIcs:2017:7320, author = {Tatiana Starikovskaya}, title = {{Communication and Streaming Complexity of Approximate Pattern Matching}}, booktitle = {28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)}, pages = {13:113:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770392}, ISSN = {18688969}, year = {2017}, volume = {78}, editor = {Juha K{\"a}rkk{\"a}inen and Jakub Radoszewski and Wojciech Rytter}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7320}, URN = {urn:nbn:de:0030drops73206}, doi = {10.4230/LIPIcs.CPM.2017.13}, annote = {Keywords: approximate pattern matching, edit distance, randomised algorithms, streaming algorithms, communication complexity} }
Keywords:  approximate pattern matching, edit distance, randomised algorithms, streaming algorithms, communication complexity  
Seminar:  28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)  
Issue Date:  2017  
Date of publication:  28.06.2017 