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.
Borivoj Melichar
2010 – today
- 2012
[j14]Jan Travnicek, Jan Janousek, Borivoj Melichar: Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata. Comput. Sci. Inf. Syst. 9(3): 1125-1153 (2012)- [j13]Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis: Computing all subtree repeats in ordered trees. Inf. Process. Lett. 112(24): 958-962 (2012)
- [j12]Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis: Tree template matching in ranked ordered trees by pushdown automata. J. Discrete Algorithms 17: 15-23 (2012)
- 2011
- [j11]Jan Zdárek, Borivoj Melichar: Tree-Based 2D Indexing. Int. J. Found. Comput. Sci. 22(8): 1893-1907 (2011)
- [c37]Jan Travnicek, Jan Janousek, Borivoj Melichar: Nonlinear Tree Pattern Pushdown Automata. FedCSIS 2011: 871-878
- [c36]Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis: Tree Indexing by Pushdown Automata and Repeats of Subtrees. FedCSIS 2011: 899-902
- [c35]Martin Plicka, Jan Janousek, Borivoj Melichar: Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees. FedCSIS 2011: 903-906
- [c34]Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis: Computing All Subtree Repeats in Ordered Ranked Trees. SPIRE 2011: 338-343
- [c33]Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis: Tree Template Matching in Ranked Ordered Trees by Pushdown Automata. CIAA 2011: 273-281
- 2010
- [j10]Tomás Flouri, Jan Janousek, Borivoj Melichar: Subtree matching by pushdown automata. Comput. Sci. Inf. Syst. 7(2): 331-357 (2010)
- [c32]
- [c31]Tomás Flouri, Borivoj Melichar, Jan Janousek: Aho-Corasick like multiple subtree matching by pushdown automata. SAC 2010: 2157-2158
- [c30]
- [c29]
2000 – 2009
- 2009
- [j9]Jan Janousek, Borivoj Melichar: On regular tree languages and deterministic pushdown automata. Acta Inf. 46(7): 533-547 (2009)
- [c28]Tomás Flouri, Borivoj Melichar, Jan Janousek: Subtree matching by deterministic pushdown automata. IMCSIT 2009: 659-666
- 2008
- [c27]
- [c26]
- 2007
- [j8]
- [j7]
- [j6]Martin Simunek, Borivoj Melichar: Borders and Finite Automata. Int. J. Found. Comput. Sci. 18(4): 859-871 (2007)
- [c25]Costas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol: Weighted Degenerated Approximate Pattern Matching. LATA 2007: 285-296
- [c24]Ladislav Vagner, Borivoj Melichar: Formal Translation Directed by Parallel LLP Parsing. SOFSEM (1) 2007: 532-543
- 2006
- [c23]Jan Supol, Borivoj Melichar: A New Approach to Determinisation Using Bit-Parallelism. ICTAC 2006: 228-241
- [c22]Jan Supol, Borivoj Melichar: Two-dimensional bitwise memory matrix: A tool for optimal parallel approximate pattern matching. Stringology 2006: 18-28
- [c21]
- [c20]Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo: Finding Common Motifs with Gaps Using Finite Automata. CIAA 2006: 69-77
- 2005
- [j5]Jan Supol, Borivoj Melichar: Arithmetic coding in parallel. Int. J. Found. Comput. Sci. 16(6): 1207-1217 (2005)
- [c19]
- [c18]Jan Lahoda, Borivoj Melichar: General pattern matching on regular collage system. Stringology 2005: 153-162
- [c17]Jan Zdárek, Borivoj Melichar: On Two-Dimensional Pattern Matching by Finite Automata. CIAA 2005: 329-340
- 2004
- [c16]
- [c15]Tomás Polcar, Borivoj Melichar: Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata. CIAA 2004: 327-328
- 2003
- [j4]Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek: Directed acyclic subsequence graph - Overview. J. Discrete Algorithms 1(3-4): 255-280 (2003)
- [c14]
- [c13]Borivoj Melichar, Tomás Polcar: The Longest Common Subsequence Problem A Finite Automata Approach. CIAA 2003: 294-296
- 2002
- [c12]
- 2001
- [j3]John Aycock, R. Nigel Horspool, Jan Janousek, Borivoj Melichar: Even faster generalized LR parsing. Acta Inf. 37(9): 633-651 (2001)
- [j2]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)
- [c11]
- 2000
- [j1]Jan Holub, Borivoj Melichar: Approximate string matching using factor automata. Theor. Comput. Sci. 249(2): 305-311 (2000)
1990 – 1999
- 1998
- [c10]
- [c9]Jan Holub, Borivoj Melichar: Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. Workshop on Implementing Automata 1998: 92-99
- 1997
- [c8]Jan Janousek, Borivoj Melichar: Formal Translations Described by Translation Grammars with LR(k) Input Grammars. PLILP 1997: 421-422
- [c7]Jan Janousek, Borivoj Melichar: The Output-Store Formal Translator Directed by LR Parsing. SOFSEM 1997: 432-439
- [c6]Borivoj Melichar, Jan Holub: 6D Classification of Pattern Matching Problems. Stringology 1997: 24-32
- 1996
- [c5]Borivoj Melichar: Space Complexity of Linear Time Approximate String Matching. Stringology 1996: 28-36
- 1995
- [c4]
- 1992
- [c3]
- 1991
- [c2]Rieks op den Akker, Borivoj Melichar, Jorma Tarhio: Attribute Evaluation and Parsing. Attribute Grammars, Applications and Systems 1991: 187-214
- [e1]Henk Alblas, Borivoj Melichar (Eds.): Attribute Grammars, Applications and Systems, International Summer School SAGA, Prague, Czechoslovakia, June 4-13, 1991, Proceedings. Lecture Notes in Computer Science 545, Springer 1991, ISBN 3-540-54572-7
- 1990
- [c1]Rieks op den Akker, Borivoj Melichar, Jorma Tarhio: The Hierarchy of LR-Attributed Grammars. WAGA 1990: 13-28
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-10 22:28 CEST by the dblp team