The following pages link to Panagiotis Charalampopoulos (Q1642717):
Displaying 40 items.
- How to answer a small batch of RMQs or LCA queries in practice (Q1642718) (← links)
- Optimal computation of avoided words (Q1708407) (← links)
- On-line weighted pattern matching (Q1740646) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Property suffix array with applications (Q2294694) (← links)
- On overabundant words and their application to biological sequence analysis (Q2326388) (← links)
- Palindromic decompositions with gaps and errors (Q2399364) (← links)
- Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
- Repetition Detection in a Dynamic String (Q5075738) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Optimal Computation of Overabundant Words (Q5111793) (← links)
- Longest Common Prefixes with k-Mismatches and Applications (Q5127201) (← links)
- Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788) (← links)
- Longest Common Factor After One Edit Operation (Q5150915) (← links)
- Almost optimal distance oracles for planar graphs (Q5212755) (← links)
- Exact Distance Oracles for Planar Graphs with Failing Vertices (Q5236314) (← links)
- Palindromic Decompositions with Gaps and Errors (Q5384622) (← links)
- (Q5874434) (← links)
- Dynamic String Alignment. (Q5874435) (← links)
- Unary Words Have the Smallest Levenshtein k-Neighbourhoods (Q5874436) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- (Q5874500) (← links)
- (Q5875583) (← links)
- Faster algorithms for 1-mappability of a sequence (Q5915892) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- Circular pattern matching with \(k\) mismatches (Q5918999) (← links)
- Circular pattern matching with \(k\) mismatches (Q5919356) (← links)
- Faster algorithms for 1-mappability of a sequence (Q5919433) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5920146) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5971176) (← links)
- (Q6075918) (← links)
- (Q6098776) (← links)
- (Q6098782) (← links)
- (Q6187833) (← links)
- Longest palindromic substring in sublinear time (Q6496849) (← links)
