No. Title Author Year
1 Top Tree Compression of Tries Bille, Philip et al. 2019
2 A Faster Construction of Greedy Consensus Trees Gawrychowski, Pawel et al. 2018
3 A Faster FPTAS for #Knapsack Gawrychowski, Pawel et al. 2018
4 Near-Optimal Distance Emulator for Planar Graphs Chang, Hsien-Chih et al. 2018
5 Dispersion on Trees Gawrychowski, Pawel et al. 2017
6 The Nearest Colored Node in a Tree Gawrychowski, Pawel et al. 2016
7 Improved Bounds for Online Preemptive Matching Epstein, Leah et al. 2013
8 Optimal Packed String Matching Ben-Kiki, Oren et al. 2011
9 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: 9

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