- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 34 |      | Jan Holub: Preface. Int. J. Found. Comput. Sci. 23(2): (2012) |
| 2011 | ||
| 33 | | Petr Procházka, Jan Holub: Natural Language Compression per Blocks. CCP 2011: 67-75 |
| 32 | | Jan Holub, Jakub Reznicek, Filip Simek: Lossless Data Compression Testbed: ExCom and Prague Corpus. DCC 2011: 457 |
| 31 | | Petr Procházka, Jan Holub: Block-Oriented Dense Compressor. DCC 2011: 472 |
| 2010 | ||
| 30 | | Tomás Flouri, Jan Holub, Costas S. Iliopoulos, Solon P. Pissis: An algorithm for mapping short reads to a dynamically changing genomic sequence. BIBM 2010: 133-136 |
| 29 | | Branislav Durian, Jan Holub, Hannu Peltola, Jorma Tarhio: Improving practical exact string matching. Inf. Process. Lett. 110(4): 148-152 (2010) |
| 2009 | ||
| 28 |  | Jan Holub, Jan Zdárek: Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31 - September 2, 2009 Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague 2009 |
| 27 | | Branislav Durian, Jan Holub, Hannu Peltola, Jorma Tarhio: Tuning BNDM with q-Grams. ALENEX 2009: 29-37 |
| 26 | | Jan Holub, Stanislav Stekr: On Parallel Implementations of Deterministic Finite Automata. CIAA 2009: 54-64 |
| 25 | | Petr Procházka, Jan Holub: New Word-Based Adaptive Dense Compressors. IWOCA 2009: 420-431 |
| 24 | | Jan Holub: Foreword. Int. J. Found. Comput. Sci. 20(6): 965-966 (2009) |
| 23 | | Jan Holub: Preface. Theor. Comput. Sci. 410(37): 3437 (2009) |
| 2008 | ||
| 22 | | Jan Holub, Jan Zdárek: Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008 Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague 2008 |
| 21 | | Jana Tucková, Jan Holub, Tomás Dubeda: Technical and Phonetic Aspects of Speech Quality Assessment: The Case of Prosody Synthesis. COST 2102 Conference (Prague) 2008: 126-132 |
| 20 | | Martin Fiala, Jan Holub: DCA Using Suffix Arrays. DCC 2008: 516 |
| 19 | | Jan Holub: Foreword. Int. J. Found. Comput. Sci. 19(1): 1-3 (2008) |
| 18 | | Jan Holub, William F. Smyth, Shu Wang: Fast pattern-matching on indeterminate strings. J. Discrete Algorithms 6(1): 37-50 (2008) |
| 2007 | ||
| 17 | | Jan Holub, Jan Zdárek: Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers Springer 2007 |
| 2006 | ||
| 16 | | Jan Holub, Jan Zdárek: Proceedings of the Prague Stringology Conference, Prague, Czech Republic, August 28-30, 2006 Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 2006 |
| 15 | | Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo: Finding Common Motifs with Gaps Using Finite Automata. CIAA 2006: 69-77 |
| 14 | | Jan Holub: Foreword. Int. J. Found. Comput. Sci. 17(6): 1233-1234 (2006) |
| 2005 | ||
| 13 | | Jan Holub, Milan Simánek: Proceedings of the Prague Stringology Conference, Prague, Czech Republic, August 29-31, 2005 Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 2005 |
| 12 | | Jan Holub: Foreword. Int. J. Found. Comput. Sci. 16(6): 1071-1073 (2005) |
| 2004 | ||
| 11 | | Milan Simánek, Jan Holub: Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30 - September 1, 2004 Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University 2004 |
| 10 | | Jan Holub, Josef Vedral: Stochastic testing of ADC - Step-Gauss method. Computer Standards & Interfaces 26(3): 251-257 (2004) |
| 2003 | ||
| 9 | | Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao: Computing Quasi Suffix Arrays. Journal of Automata, Languages and Combinatorics 8(4): 593-606 (2003) |
| 8 | | Jan Holub: Guest Editor's Foreword. Nord. J. Comput. 10(1): 1 (2003) |
| 2002 | ||
| 7 | | Jan Holub, Maxime Crochemore: On the Implementation of Compact DAWG's. CIAA 2002: 289-294 |
| 6 | | Jan Holub: Dynamic Programming - NFA Simulation. CIAA 2002: 295-300 |
| 2001 | ||
| 5 | | Jan Holub: Bit Parallelism - NFA Simulation. CIAA 2001: 149-160 |
| 4 | | Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard: Distributed Pattern Matching Using Finite Automata. Journal of Automata, Languages and Combinatorics 6(2): 191-204 (2001) |
| 2000 | ||
| 3 | | Jan Holub, Borivoj Melichar: Approximate string matching using factor automata. Theor. Comput. Sci. 249(2): 305-311 (2000) |
| 1998 | ||
| 2 | | Jan Holub, Borivoj Melichar: Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. Workshop on Implementing Automata 1998: 92-99 |
| 1996 | ||
| 1 | | Jan Holub: Reduced Nondeterministic Finite Automata for Approximate String Matching. Stringology 1996: 19-27 |
| 1 | Pavlos Antoniou | [15] |
| 2 | Maxime Crochemore | [7] |
| 3 | Tomás Dubeda | [21] |
| 4 | Branislav Durian | [27] [29] |
| 5 | Martin Fiala | [20] |
| 6 | Tomás Flouri | [30] |
| 7 | Frantisek Franek | [9] |
| 8 | Costas S. Iliopoulos | [4] [15] [30] |
| 9 | Borivoj Melichar | [2] [3] [4] [15] |
| 10 | Laurent Mouchard | [4] |
| 11 | Hannu Peltola | [27] [29] |
| 12 | Pierre Peterlongo | [15] |
| 13 | Solon P. Pissis | [30] |
| 14 | Petr Procházka | [25] [31] [33] |
| 15 | Jakub Reznicek | [32] |
| 16 | Milan Simánek | [11] [13] |
| 17 | Filip Simek | [32] |
| 18 | William F. Smyth (Bill Smyth) | [9] [18] |
| 19 | Stanislav Stekr | [26] |
| 20 | Jorma Tarhio | [27] [29] |
| 21 | Jana Tucková | [21] |
| 22 | Josef Vedral | [10] |
| 23 | Shu Wang | [18] |
| 24 | Xiangdong Xiao | [9] |
| 25 | Jan Zdárek | [16] [17] [22] [28] |
Colors in the list of coauthors
Last update Wed May 16 23:21:41 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page