No. Title Author Year
1 Approximating Approximate Pattern Matching Studený, Jan et al. 2019
2 Faster Algorithms for All-Pairs Bounded Min-Cuts Abboud, Amir et al. 2019
3 Hamming Distance Completeness Labib, Karim et al. 2019
4 RLE Edit Distance in Near Optimal Time Clifford, Raphaël et al. 2019
5 A Framework for Searching in Graphs in the Presence of Errors Dereniowski, Dariusz et al. 2018
6 Brief Announcement: Energy Constrained Depth First Search Das, Shantanu et al. 2018
7 Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication Graf, Daniel et al. 2018
8 Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance Gawrychowski, Pawel et al. 2018
9 All-Pairs 2-Reachability in O(n^w log n) Time Georgiadis, Loukas et al. 2017
10 Approximation Strategies for Generalized Binary Search in Weighted Trees Dereniowski, Dariusz et al. 2017
11 Randomized Algorithms for Finding a Majority Element Gawrychowski, Pawel et al. 2016
12 Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams Gawrychowski, Pawel et al. 2016
13 Bounds on the Cover Time of Parallel Rotor Walks Dereniowski, Dariusz et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 13

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