The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan Holub: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jan Holub
    Reduced Nondeterministic Finite Automata for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    Stringology, 1996, pp:19-27 [Conf]
  2. Jan Holub, Borivoj Melichar
    Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1998, pp:92-99 [Conf]
  3. Jan Holub
    Bit Parallelism - NFA Simulation. [Citation Graph (0, 0)][DBLP]
    CIAA, 2001, pp:149-160 [Conf]
  4. Jan Holub
    Dynamic Programming - NFA Simulation. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:295-300 [Conf]
  5. Jan Holub, Maxime Crochemore
    On the Implementation of Compact DAWG's. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:289-294 [Conf]
  6. Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo
    Finding Common Motifs with Gaps Using Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:69-77 [Conf]
  7. Jan Holub
    Foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1071-1073 [Journal]
  8. Jan Holub
    Foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1233-1234 [Journal]
  9. Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard
    Distributed Pattern Matching Using Finite Automata. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:2, pp:191-204 [Journal]
  10. Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao
    Computing Quasi Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:4, pp:593-606 [Journal]
  11. Jan Holub
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:1, pp:1- [Journal]
  12. Jan Holub, Borivoj Melichar
    Approximate string matching using factor automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:249, n:2, pp:305-311 [Journal]

  13. Tuning BNDM with q-Grams. [Citation Graph (, )][DBLP]


  14. Technical and Phonetic Aspects of Speech Quality Assessment: The Case of Prosody Synthesis. [Citation Graph (, )][DBLP]


  15. DCA Using Suffix Arrays. [Citation Graph (, )][DBLP]


  16. On Parallel Implementations of Deterministic Finite Automata. [Citation Graph (, )][DBLP]


  17. New Word-Based Adaptive Dense Compressors. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002