Jan Janousek

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 18

Top Topics

Pattern Matching

Finite Automata

Interface Design

Top Venues

Discret. Appl. Math.

Publications

Jan Janousek, Stepán Plachý
Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching. SOFSEM (2024)
Jan Trávnícek, Tomás Pecka, Robin Oburka, Jan Janousek
Forward linearised tree pattern matching using tree pattern border array. Discret. Appl. Math. 352 (2024)
Václav Blazej, Jan Janousek, Stepán Plachý
On the Smallest Synchronizing Terms of Finite Tree Automata. CIAA (2023)
Eliska Sestáková, Ondrej Guth, Jan Janousek
Inexact tree pattern matching with 1-degree edit distance using finite automata. Discret. Appl. Math. 330 (2023)
Eliska Sestáková, Ondrej Guth, Jan Janousek
Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance. Stringology (2021)
Jan Trávnícek, Robin Oburka, Tomás Pecka, Jan Janousek
Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array. Stringology (2020)
Jan Trávnícek, Jan Janousek, Borivoj Melichar, Loek Cleophas
On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees. Theor. Comput. Sci. (2020)
Tomás Pecka, Jan Trávnícek, Jan Janousek
Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination. Stringology (2020)
Stepán Plachý, Jan Janousek
On Synchronizing Tree Automata and Their Work-Optimal Parallel Run, Usable for Parallel Tree Pattern Matching. SOFSEM (2020)
Pavel Krömer, Jan Janousek, Jan Platos
Random Key Self-Organizing Migrating Algorithm for Permutation Problems. CEC (2019)
Petr Gajdos, Marek Behálek, Jan Janousek, Pavel Krömer
QDSOMA: Towards the Utilization of Quantum Computing within SOMA. CEC (2019)
Eliska Sestáková, Jan Janousek
Automata Approach to XML Data Indexing. Inf. 9 (1) (2018)
Tomás Pecka, Jan Trávnícek, Radomír Polách, Jan Janousek
Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression. SLATE (2018)
Eliska Sestáková, Borivoj Melichar, Jan Janousek
Constrained Approximate Subtree Matching by Finite Automata. Stringology (2018)
Eliska Sestáková, Jan Janousek
Indexing XML Documents Using Tree Paths Automaton. SLATE (2017)
Jan Janousek, Petr Gajdos, Pavel Dohnálek, Michal Radecký
Towards power plant output modelling and optimization using parallel Regression Random Forest. Swarm Evol. Comput. 26 (2016)
Radomír Polách, Jan Trávnícek, Jan Janousek, Borivoj Melichar
Efficient determinization of visibly and height-deterministic pushdown automata. Comput. Lang. Syst. Struct. 46 (2016)
Jan Janousek, Petr Gajdos, Pavel Dohnálek, Michal Radecký
Fast Human Activity Recognition Based on a Massively Parallel Implementation of Random Forest. ACIIDS (2) (2016)
Tomás Cerný, Miroslav Macik, Michael J. Donahoo, Jan Janousek
On distributed concern delivery in user interface design. Comput. Sci. Inf. Syst. 12 (2) (2015)
Jan Trávnícek, Jan Janousek, Borivoj Melichar, Loek G. Cleophas
Backward Linearised Tree Pattern Matching. LATA (2015)
Radomír Polách, Jan Travnicek, Jan Janousek, Borivoj Melichar
A new algorithm for the determinisation of visibly pushdown automata. FedCSIS (2015)
Eliska Sestáková, Jan Janousek
Tree String Path Subsequences Automaton and Its Use for Indexing XML Documents. SLATE (2015)
Jan Janousek, Petr Gajdos, Michal Radecký, Václav Snásel
Gaussian Mixture Model Cluster Forest. ICMLA (2015)
Jan Janousek, Petr Gajdos, Michal Radecký, Václav Snásel
Application of Bio-inspired Methods Within Cluster Forest Algorithm. AECIA (2015)
Sebastián Basterrech, Jan Janousek, Václav Snásel
A Study of Random Neural Network Performance for Supervised Learning Tasks in CUDA. ECC (2) (2014)
Tomás Cerný, Miroslav Macik, Michael J. Donahoo, Jan Janousek
Efficient Description and Cache Performance in Aspect-Oriented User Interface Design. FedCSIS (2014)
Jan Janousek, Borivoj Melichar, Radomír Polách, Martin Poliak, Jan Trávnícek
A Full and Linear Index of a Tree for Tree Patterns. DCFS (2014)
Jan Janousek, Jaroslav Málek
Target Code Selection by Tilling AST with the Use of Tree Pattern Pushdown Automaton. SLATE (2014)
Jan Janousek, Petr Gajdos, Michal Radecký, Václav Snásel
Classification via Nearest Prototype Classifier Utilizing Artificial Bee Colony on CUDA. SOCO-CISIS-ICEUTE (2014)
Jan Janousek, Jan Platos, Václav Snásel
Clustering using artificial bee colony on CUDA. SMC (2014)
Michalis Christou, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis, Jan Zdárek
Tree template matching in unranked ordered trees. J. Discrete Algorithms 20 (2013)
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 (2012)
Jan Travnicek, Jan Janousek, Borivoj Melichar
Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata. Comput. Sci. Inf. Syst. 9 (3) (2012)
Borivoj Melichar, Jan Janousek, Tomás Flouri
Arbology: Trees and pushdown automata. Kybernetika 48 (3) (2012)
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) (2012)
Jan Janousek, Borivoj Melichar, Martin Poliak
Tree compression pushdown automaton. Kybernetika 48 (3) (2012)
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)
Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis
Tree Indexing by Pushdown Automata and Repeats of Subtrees. FedCSIS (2011)
Martin Plicka, Jan Janousek, Borivoj Melichar
Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees. FedCSIS (2011)
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)
Jan Travnicek, Jan Janousek, Borivoj Melichar
Nonlinear Tree Pattern Pushdown Automata. FedCSIS (2011)
Tomás Flouri, Borivoj Melichar, Jan Janousek
Aho-Corasick like multiple subtree matching by pushdown automata. SAC (2010)
Tomás Flouri, Jan Janousek, Borivoj Melichar
Subtree matching by pushdown automata. Comput. Sci. Inf. Syst. 7 (2) (2010)
Jan Janousek, Borivoj Melichar
On regular tree languages and deterministic pushdown automata. Acta Informatica 46 (7) (2009)
Jan Janousek
String Suffix Automata and Subtree Pushdown Automata. Stringology (2009)
Tomás Flouri, Borivoj Melichar, Jan Janousek
Subtree matching by deterministic pushdown automata. IMCSIT (2009)
John Aycock, R. Nigel Horspool, Jan Janousek, Borivoj Melichar
Even faster generalized LR parsing. Acta Informatica 37 (9) (2001)
Jan Janousek, Borivoj Melichar
Formal Translations Described by Translation Grammars with LR(k) Input Grammars. PLILP (1997)
Jan Janousek, Borivoj Melichar
The Output-Store Formal Translator Directed by LR Parsing. SOFSEM (1997)