| Publication | Date of Publication | Type |
|---|
Suffix arrays with a twist
Computing and Informatics | 2023-02-16 | Paper |
Space-efficient Huffman codes revisited
Information Processing Letters | 2022-10-28 | Paper |
Efficient and compact representations of some non-canonical prefix-free codes
Theoretical Computer Science | 2022-02-21 | Paper |
Space-Efficient Huffman Codes Revisited
(available as arXiv preprint) | 2021-08-11 | Paper |
Regular abelian periods and longest common abelian factors on run-length encoded strings
String Processing and Information Retrieval | 2021-02-16 | Paper |
On Abelian Longest Common Factor with and without RLE
Fundamenta Informaticae | 2019-01-17 | Paper |
| Longest common abelian factors and large alphabets | 2018-10-17 | Paper |
New tabulation and sparse dynamic programming based techniques for sequence similarity problems
Discrete Applied Mathematics | 2016-09-12 | Paper |
Tight and simple web graph compression for forward and reverse neighbor queries
Discrete Applied Mathematics | 2015-09-22 | Paper |
A note on the longest common substring with \(k\)-mismatches problem
Information Processing Letters | 2015-05-21 | Paper |
Motif matching using gapped patterns
Theoretical Computer Science | 2014-08-27 | Paper |
Efficient algorithms for the longest common subsequence in \(k\)-length substrings
Information Processing Letters | 2014-07-18 | Paper |
Approximate pattern matching with \(k\)-mismatches in packed text
Information Processing Letters | 2014-04-14 | Paper |
New algorithms for binary jumbled pattern matching
Information Processing Letters | 2014-04-11 | Paper |
Motif matching using gapped patterns
Lecture Notes in Computer Science | 2014-01-17 | Paper |
String matching with inversions and translocations in linear average time (most of the time)
Information Processing Letters | 2013-03-28 | Paper |
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
European Journal of Combinatorics | 2012-11-15 | Paper |
Range mode and range median queries in constant time and sub-quadratic space
Information Processing Letters | 2010-06-16 | Paper |
Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
Information Processing Letters | 2010-03-24 | Paper |
On two variants of the longest increasing subsequence problem
Man-Machine Interactions | 2010-03-05 | Paper |
A general compression algorithm that supports fast searching
Information Processing Letters | 2010-01-29 | Paper |
Fast convolutions and their applications in approximate string matching
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Average-optimal string matching
Journal of Discrete Algorithms | 2009-12-10 | Paper |
Nested Counters in Bit-Parallel String Matching
Language and Automata Theory and Applications | 2009-04-02 | Paper |
EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, kΔ, α)-MATCHING
International Journal of Foundations of Computer Science | 2008-11-03 | Paper |
Efficient Bit-Parallel Algorithms for (δ,α)-Matching
Experimental Algorithms | 2007-09-14 | Paper |
A SIMPLE ALPHABET-INDEPENDENT FM-INDEX
International Journal of Foundations of Computer Science | 2007-02-08 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
Artificial Intelligence and Soft Computing - ICAISC 2004
Lecture Notes in Computer Science | 2005-04-12 | Paper |
