Szymon Grabowski

From MaRDI portal
Revision as of 08:50, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:313773

Available identifiers

zbMath Open grabowski.szymonDBLP68/1552WikidataQ58059554 ScholiaQ58059554MaRDI QIDQ313773

List of research outcomes





PublicationDate of PublicationType
Suffix arrays with a twist2023-02-16Paper
Space-efficient Huffman codes revisited2022-10-28Paper
Efficient and compact representations of some non-canonical prefix-free codes2022-02-21Paper
Space-Efficient Huffman Codes Revisited2021-08-11Paper
Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings2021-02-16Paper
On Abelian Longest Common Factor with and without RLE2019-01-17Paper
Longest common abelian factors and large alphabets2018-10-17Paper
New tabulation and sparse dynamic programming based techniques for sequence similarity problems2016-09-12Paper
Tight and simple web graph compression for forward and reverse neighbor queries2015-09-22Paper
A note on the longest common substring with \(k\)-mismatches problem2015-05-21Paper
Motif matching using gapped patterns2014-08-27Paper
Efficient algorithms for the longest common subsequence in \(k\)-length substrings2014-07-18Paper
Approximate pattern matching with \(k\)-mismatches in packed text2014-04-14Paper
New algorithms for binary jumbled pattern matching2014-04-11Paper
Motif Matching Using Gapped Patterns2014-01-17Paper
String matching with inversions and translocations in linear average time (most of the time)2013-03-28Paper
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching2012-11-15Paper
Range mode and range median queries in constant time and sub-quadratic space2010-06-16Paper
Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time2010-03-24Paper
On Two Variants of the Longest Increasing Subsequence Problem2010-03-05Paper
A general compression algorithm that supports fast searching2010-01-29Paper
Fast Convolutions and Their Applications in Approximate String Matching2009-12-11Paper
Average-optimal string matching2009-12-10Paper
Nested Counters in Bit-Parallel String Matching2009-04-02Paper
EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, kΔ, α)-MATCHING2008-11-03Paper
Efficient Bit-Parallel Algorithms for (δ,α)-Matching2007-09-14Paper
A SIMPLE ALPHABET-INDEPENDENT FM-INDEX2007-02-08Paper
String Processing and Information Retrieval2006-10-24Paper
Artificial Intelligence and Soft Computing - ICAISC 20042005-04-12Paper

Research outcomes over time

This page was built for person: Szymon Grabowski