No. Title Author Year
1 An Almost Optimal Edit Distance Oracle Charalampopoulos, Panagiotis et al. 2021
2 Efficiently Testing Simon’s Congruence Gawrychowski, Paweł et al. 2021
3 Front Matter, Table of Contents, Preface, Conference Organization Gawrychowski, Paweł et al. 2021
4 LIPIcs, Volume 191, CPM 2021, Complete Volume Gawrychowski, Paweł et al. 2021
5 Matching Patterns with Variables Under Hamming Distance Gawrychowski, Paweł et al. 2021
6 A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem Agrawal, Anadi et al. 2020
7 Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs Dudek, Bartłomiej et al. 2020
8 Dynamic Longest Common Substring in Polylogarithmic Time Charalampopoulos, Panagiotis et al. 2020
9 Efficient Labeling for Reachability in Directed Acyclic Graphs Dulęba, Maciej et al. 2020
10 Existential Length Universality Gawrychowski, Paweł et al. 2020
11 Generalised Pattern Matching Revisited Dudek, Bartłomiej et al. 2020
12 Minimum Cut in O(m log² n) Time Gawrychowski, Paweł et al. 2020
13 On Indeterminate Strings Matching Gawrychowski, Paweł et al. 2020
14 On Two Measures of Distance Between Fully-Labelled Trees Bernardini, Giulia et al. 2020
15 Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games Fijalkow, Nathanaël et al. 2020
Current Page :
Number of result pages: 1
Number of documents: 15


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