CPM

23:54

CPM2020 - "Chaining with Overlaps Revisited"

27:03

CPM2020 - "Finding the Anticover of a String"

1:01:27

CPM2020 - "Fine-Grained Complexity on Strings"

19:31

CPM2020 - "Time-Space Tradeoffs for Finding a Long Common Substring"

21:35

CPM2020 - "On Indeterminate Strings Matching"

22:04

CPM2020 - "Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions"

46:36

CPM2020 - "Efficient Fine-grained Algorithms"

22:35

CPM2020 - "DAWGs for parameterized matching: online construction and related indexing structures"

7:38

CPM2020 - "Efficient tree-structured categorical retrieval"

21:26

CPM2020 - "Dynamic String Alignment"

21:03

CPM2020 - "String Sanitization under Edit Distance"

13:50

CPM2020 - "Unary Words Have the Smallest Levenshtein k-Neighbourhoods"

23:53

CPM2020 - "Approximating Text-to-Pattern distance via dimensionality reduction"

19:50

CPM2020 - "Faster Binary Mean Computation Under Dynamic Time Warping"

1:00:14

CPM2020 - "Algebraic algorithms for finding patterns in graphs"

29:01

CPM2020 - "Locally Consistent Parsing for Text Indexing in Small Space"

16:28

CPM2020 - "On Two Measures of Distance between Fully-Labelled Trees"

22:23

CPM2020 - "Double String Tandem Repeats"

23:20

CPM2020 - "String Factorizations under Various Collision Constraints"

24:30

CPM2020 - "The Streaming k-Mismatch Problem: Tradeoffs between Space and Total Time"

25:03

CPM2020 - "In-Place Bijective Burrows Wheeler Transformations"

19:32

CPM2020 - "Longest Common Subsequence on Weighted Sequences"

29:07

CPM2020 - String synchronizing sets: Sublinear-time BWT construction and optimal LCE data structure

24:19

CPM2020 - "Compressed Orthogonal Search on Suffix Arrays with applications to Range LCP"

24:33

CPM2020 - "k-Approximate Quasiperiodicity under Hamming and Edit Distance"

20:29

CPM2020 - "Text Indexing and Searching in Sublinear Time"

25:14

CPM2020 - "FM-Index Reveals the Reverse Suffix Array"

29:15

CPM2020 - "Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms"

19:52

CPM2020 - "Approximating longest common substring with k mismatches: Theory and practice"

21:40

CPM2020 - "Parameterized Algorithms for Matrix Completion With Radius Constraints"

30:16

CPM2020 - "Computing Quartet Distance is Equivalent to Counting 4-Cycles"

20:06

CPM2020 - "Counting Distinct Patterns in Internal Dictionary Matching"