No. Title Author Year
1 An Almost Optimal Edit Distance Oracle Charalampopoulos, Panagiotis et al. 2021
2 Front Matter, Table of Contents, Preface, Conference Organization Gørtz, Inge Li et al. 2020
3 LIPIcs, Volume 161, CPM 2020, Complete Volume Gørtz, Inge Li et al. 2020
4 Minimum Cut in O(m log² n) Time Gawrychowski, Paweł et al. 2020
5 On the Fine-Grained Complexity of Parity Problems Abboud, Amir et al. 2020
6 Top Tree Compression of Tries Bille, Philip et al. 2019
7 A Faster Construction of Greedy Consensus Trees Gawrychowski, Pawel et al. 2018
8 A Faster FPTAS for #Knapsack Gawrychowski, Pawel et al. 2018
9 Near-Optimal Distance Emulator for Planar Graphs Chang, Hsien-Chih et al. 2018
10 Dispersion on Trees Gawrychowski, Pawel et al. 2017
11 The Nearest Colored Node in a Tree Gawrychowski, Pawel et al. 2016
12 Improved Bounds for Online Preemptive Matching Epstein, Leah et al. 2013
13 Optimal Packed String Matching Ben-Kiki, Oren et al. 2011
14 A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression Hermelin, Danny et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 14


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI