Paper at Combinatorial Pattern Matching (CPM’18): “Non-Overlapping Indexing — Cache Obliviously”

March 25, 2018August 25, 2018 by kulekci

Our paper entitled “Non-Overlapping Indexing — Cache Obliviously” with Sahar Hooshmand, Sharma V. Thankachan, and Paniz Abedin has been accepted to Combinatorial Pattern Matching (CPM) 2018 conference. The proceedings volume of CPM’2018 is available at LIPICS volume 105

M. Oğuzhan Külekci

İstanbul Technical University, Informatics Institute

Paper at Combinatorial Pattern Matching (CPM’18): “Non-Overlapping Indexing — Cache Obliviously”