Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Szymon Grabowski
2010 – today
- 2013
[j16]Sebastian Deorowicz, Agnieszka Debudaj-Grabysz, Szymon Grabowski: Disk-based k-mer counting on a PC. BMC Bioinformatics 14: 160 (2013)- [j15]Kimmo Fredriksson, Szymon Grabowski: Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching. Eur. J. Comb. 34(1): 38-51 (2013)
- [j14]Emanuele Giaquinta, Szymon Grabowski: New algorithms for binary jumbled pattern matching. Inf. Process. Lett. 113(14-16): 538-542 (2013)
- 2012
- [i5]Emanuele Giaquinta, Szymon Grabowski: New algorithms for binary jumbled pattern matching. CoRR abs/1210.6176 (2012)
- [i4]Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson: Approximate pattern matching with k-mismatches in packed text. CoRR abs/1211.5433 (2012)
- 2011
- [j13]Sebastian Deorowicz, Szymon Grabowski: Compression of DNA sequence reads in FASTQ format. Bioinformatics 27(6): 860-862 (2011)
- [j12]Sebastian Deorowicz, Szymon Grabowski: Robust relative compression of genomes with random access. Bioinformatics 27(21): 2979-2986 (2011)
- [j11]Szymon Grabowski, Simone Faro, Emanuele Giaquinta: String matching with inversions and translocations in linear average time (most of the time). Inf. Process. Lett. 111(11): 516-520 (2011)
- [i3]Szymon Grabowski, Sebastian Deorowicz: Engineering Relative Compression of Genomes. CoRR abs/1103.2351 (2011)
- 2010
- [c13]Szymon Grabowski, Wojciech Bieniecki: Tight and Simple Web Graph Compression. Stringology 2010: 127-137
- [i2]Szymon Grabowski, Wojciech Bieniecki: Tight and simple Web graph compression. CoRR abs/1006.0809 (2010)
- [i1]Szymon Grabowski, Simone Faro, Emanuele Giaquinta: String Matching with Inversions and Translocations in Linear Average Time (Most of the Time). CoRR abs/1012.0280 (2010)
2000 – 2009
- 2009
- [j10]Sebastian Deorowicz, Szymon Grabowski: A hybrid algorithm for the longest common transposition-invariant subsequence problem. Computing and Informatics 28(5): 729-744 (2009)
- [j9]Holger Petersen, Szymon Grabowski: Range mode and range median queries in constant time and sub-quadratic space. Inf. Process. Lett. 109(4): 225-228 (2009)
- [j8]Kimmo Fredriksson, Szymon Grabowski: Average-optimal string matching. J. Discrete Algorithms 7(4): 579-594 (2009)
- [c12]Kimmo Fredriksson, Szymon Grabowski: Fast Convolutions and Their Applications in Approximate String Matching. IWOCA 2009: 254-265
- [c11]Kimmo Fredriksson, Szymon Grabowski: Nested Counters in Bit-Parallel String Matching. LATA 2009: 338-349
- 2008
- [j7]Kimmo Fredriksson, Szymon Grabowski: Efficient Algorithms for (delta, gamma, alpha) and (delta, kDelta, alpha)-Matching. Int. J. Found. Comput. Sci. 19(1): 163-183 (2008)
- [j6]Szymon Grabowski, Kimmo Fredriksson: Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time. Inf. Process. Lett. 105(5): 182-187 (2008)
- [j5]Kimmo Fredriksson, Szymon Grabowski: Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance. Inf. Retr. 11(4): 335-357 (2008)
- [j4]Przemyslaw Skibinski, Szymon Grabowski, Jakub Swacha: Effective asymmetric XML compression. Softw., Pract. Exper. 38(10): 1027-1047 (2008)
- [c10]Przemyslaw Skibinski, Jakub Swacha, Szymon Grabowski: A Highly Efficient XML Compression Scheme for the Web. SOFSEM 2008: 766-777
- [p1]Bartosz Paszkowski, Wojciech Bieniecki, Szymon Grabowski: Preprocessing for Real-Time Handwritten Character Recognition. Computer Recognition Systems 2 2008: 470-476
- 2006
- [j3]Szymon Grabowski, Gonzalo Navarro, Rafal Przywarski, Alejandro Salinger, Veli Mäkinen: A Simple Alphabet-independent Fm-index. Int. J. Found. Comput. Sci. 17(6): 1365-1384 (2006)
- [j2]Kimmo Fredriksson, Szymon Grabowski: A general compression algorithm that supports fast searching. Inf. Process. Lett. 100(6): 226-232 (2006)
- [c9]Kimmo Fredriksson, Szymon Grabowski: Efficient Algorithms for Pattern Matching with General Gaps and Character Classes. SPIRE 2006: 267-278
- [c8]Kimmo Fredriksson, Szymon Grabowski: Efficient algorithms for (delta, gamma, alpha)-matching. Stringology 2006: 29-40
- [c7]Rafal Przywarski, Szymon Grabowski, Gonzalo Navarro, Alejandro Salinger: FM-KZ: An even simpler alphabet-independent FM-index. Stringology 2006: 226-241
- [c6]Kimmo Fredriksson, Szymon Grabowski: Efficient Bit-Parallel Algorithms for (delta, alpha)-Matching. WEA 2006: 170-181
- 2005
- [j1]Przemyslaw Skibinski, Szymon Grabowski, Sebastian Deorowicz: Revisiting dictionary-based compression. Softw., Pract. Exper. 35(15): 1455-1476 (2005)
- [c5]
- [c4]Szymon Grabowski, Veli Mäkinen, Gonzalo Navarro, Alejandro Salinger: A simple alphabet-independent FM-index. Stringology 2005: 231-245
- 2004
- [c3]Przemyslaw Skibinski, Szymon Grabowski: Variable-length contexts for PPM. Data Compression Conference 2004: 409-418
- [c2]Szymon Grabowski: Reducing the Computational Demands for Nearest Centroid Neighborhood Classifiers. ICAISC 2004: 568-573
- [c1]Szymon Grabowski, Veli Mäkinen, Gonzalo Navarro: First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index. SPIRE 2004: 210-211
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-29 01:53 CEST by the dblp team