Jan Janousek - RankMe

56 papers B 6C 11Misc 6Journal 20Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	On the Smallest Synchronizing Terms of Finite Tree Automata. Int. J. Found. Comput. Sci. Václav Blazej, Jan Janousek, Stepán Plachý
2025	J	`jnl`	Decreasing verification radius in local certification. Theor. Comput. Sci. Laurent Feuilloley, Jan Janousek, Jan Matyás Kristan, Josef Erik Sedlácek
2025	J	`jnl`	Shortest characteristic factors of a deterministic finite automaton and computing its positive position run by pattern set matching. Acta Informatica Jan Janousek, Stepán Plachý
2024	—	`conf`	Decreasing Verification Radius in Local Certification. ALGOWIN Laurent Feuilloley, Jan Janousek, Jan Matyás Kristan, Josef Erik Sedlácek
2024	J	`jnl`	Decreasing verification radius in local certification. CoRR Laurent Feuilloley, Jan Janousek, Jan Matyás Kristan, Josef Erik Sedlácek
2024	J	`jnl`	Forward linearised tree pattern matching using tree pattern border array. Discret. Appl. Math. Jan Trávnícek, Tomás Pecka, Robin Oburka, Jan Janousek
2024	B	`conf`	Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching. SOFSEM Jan Janousek, Stepán Plachý
2023	J	`jnl`	Inexact tree pattern matching with 1-degree edit distance using finite automata. Discret. Appl. Math. Eliska Sestáková, Ondrej Guth, Jan Janousek
2023	C	`conf`	On the Smallest Synchronizing Terms of Finite Tree Automata. CIAA Václav Blazej, Jan Janousek, Stepán Plachý
2021	Misc	`conf`	Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance. PSC Eliska Sestáková, Ondrej Guth, Jan Janousek
2020	Misc	`conf`	Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination. PSC Tomás Pecka, Jan Trávnícek, Jan Janousek
2020	Misc	`conf`	Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array. PSC Jan Trávnícek, Robin Oburka, Tomás Pecka, Jan Janousek
2020	B	`conf`	On Synchronizing Tree Automata and Their Work-Optimal Parallel Run, Usable for Parallel Tree Pattern Matching. SOFSEM Stepán Plachý, Jan Janousek
2020	J	`jnl`	On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees. Theor. Comput. Sci. Jan Trávnícek, Jan Janousek, Borivoj Melichar, Loek Cleophas
2019	—	`ed.`	8th Symposium on Languages, Applications and Technologies, SLATE 2019, Coimbra, Portugal, June 27-28, 2019 SLATE Ricardo Rodrigues, Jan Janousek, Luís Ferreira, Luísa Coheur, Fernando Batista, Hugo Gonçalo Oliveira
2019	B	`conf`	QDSOMA: Towards the Utilization of Quantum Computing within SOMA. CEC Petr Gajdos, Marek Behálek, Jan Janousek, Pavel Krömer
2019	B	`conf`	Random Key Self-Organizing Migrating Algorithm for Permutation Problems. CEC Pavel Krömer, Jan Janousek, Jan Platos
2018	J	`jnl`	Automata Approach to XML Data Indexing. Inf. Eliska Sestáková, Jan Janousek
2018	Misc	`conf`	Constrained Approximate Subtree Matching by Finite Automata. PSC Eliska Sestáková, Borivoj Melichar, Jan Janousek
2018	—	`conf`	Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression. SLATE Tomás Pecka, Jan Trávnícek, Radomír Polách, Jan Janousek
2017	—	`conf`	Indexing XML Documents Using Tree Paths Automaton. SLATE Eliska Sestáková, Jan Janousek
2016	J	`jnl`	Efficient determinization of visibly and height-deterministic pushdown automata. Comput. Lang. Syst. Struct. Radomír Polách, Jan Trávnícek, Jan Janousek, Borivoj Melichar
2016	—	`conf`	Fast Human Activity Recognition Based on a Massively Parallel Implementation of Random Forest. ACIIDS (2) Jan Janousek, Petr Gajdos, Pavel Dohnálek, Michal Radecký
2016	C	`ed.`	Language and Automata Theory and Applications - 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings LATA Adrian-Horia Dediu, Jan Janousek, Carlos Martín-Vide, Bianca Truthe
2016	J	`jnl`	Towards power plant output modelling and optimization using parallel Regression Random Forest. Swarm Evol. Comput. Jan Janousek, Petr Gajdos, Pavel Dohnálek, Michal Radecký
2015	C	`conf`	A new algorithm for the determinisation of visibly pushdown automata. FedCSIS Radomír Polách, Jan Travnicek, Jan Janousek, Borivoj Melichar
2015	—	`conf`	Application of Bio-inspired Methods Within Cluster Forest Algorithm. AECIA Jan Janousek, Petr Gajdos, Michal Radecký, Václav Snásel
2015	C	`conf`	Backward Linearised Tree Pattern Matching. LATA Jan Trávnícek, Jan Janousek, Borivoj Melichar, Loek G. Cleophas
2015	C	`conf`	Gaussian Mixture Model Cluster Forest. ICMLA Jan Janousek, Petr Gajdos, Michal Radecký, Václav Snásel
2015	J	`jnl`	On distributed concern delivery in user interface design. Comput. Sci. Inf. Syst. Tomás Cerný, Miroslav Macik, Michael J. Donahoo, Jan Janousek
2015	—	`conf`	Tree String Path Subsequences Automaton and Its Use for Indexing XML Documents. SLATE Eliska Sestáková, Jan Janousek
2014	—	`conf`	A Full and Linear Index of a Tree for Tree Patterns. DCFS Jan Janousek, Borivoj Melichar, Radomír Polách, Martin Poliak, Jan Trávnícek
2014	—	`conf`	A Study of Random Neural Network Performance for Supervised Learning Tasks in CUDA. ECC (2) Sebastián Basterrech, Jan Janousek, Václav Snásel
2014	—	`conf`	Classification via Nearest Prototype Classifier Utilizing Artificial Bee Colony on CUDA. SOCO-CISIS-ICEUTE Jan Janousek, Petr Gajdos, Michal Radecký, Václav Snásel
2014	B	`conf`	Clustering using artificial bee colony on CUDA. SMC Jan Janousek, Jan Platos, Václav Snásel
2014	C	`conf`	Efficient Description and Cache Performance in Aspect-Oriented User Interface Design. FedCSIS Tomás Cerný, Miroslav Macik, Michael J. Donahoo, Jan Janousek
2014	—	`conf`	Target Code Selection by Tilling AST with the Use of Tree Pattern Pushdown Automaton. SLATE Jan Janousek, Jaroslav Málek
2013	J	`jnl`	Tree template matching in unranked ordered trees. J. Discrete Algorithms Michalis Christou, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis, Jan Zdárek
2012	J	`jnl`	Arbology: Trees and pushdown automata. Kybernetika Borivoj Melichar, Jan Janousek, Tomás Flouri
2012	J	`jnl`	Computing all subtree repeats in ordered trees. Inf. Process. Lett. Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
2012	J	`jnl`	Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata. Comput. Sci. Inf. Syst. Jan Travnicek, Jan Janousek, Borivoj Melichar
2012	J	`jnl`	Tree compression pushdown automaton. Kybernetika Jan Janousek, Borivoj Melichar, Martin Poliak
2012	J	`jnl`	Tree template matching in ranked ordered trees by pushdown automata. J. Discrete Algorithms Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
2011	C	`conf`	Computing All Subtree Repeats in Ordered Ranked Trees. SPIRE Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
2011	C	`conf`	Nonlinear Tree Pattern Pushdown Automata. FedCSIS Jan Travnicek, Jan Janousek, Borivoj Melichar
2011	C	`conf`	Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees. FedCSIS Martin Plicka, Jan Janousek, Borivoj Melichar
2011	C	`conf`	Tree Indexing by Pushdown Automata and Repeats of Subtrees. FedCSIS Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis
2011	C	`conf`	Tree Template Matching in Ranked Ordered Trees by Pushdown Automata. CIAA Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis
2010	Misc	`conf`	Aho-Corasick like multiple subtree matching by pushdown automata. SAC Tomás Flouri, Borivoj Melichar, Jan Janousek
2010	J	`jnl`	Subtree matching by pushdown automata. Comput. Sci. Inf. Syst. Tomás Flouri, Jan Janousek, Borivoj Melichar
2009	J	`jnl`	On regular tree languages and deterministic pushdown automata. Acta Informatica Jan Janousek, Borivoj Melichar
2009	Misc	`conf`	String Suffix Automata and Subtree Pushdown Automata. PSC Jan Janousek
2009	—	`conf`	Subtree matching by deterministic pushdown automata. IMCSIT Tomás Flouri, Borivoj Melichar, Jan Janousek
2001	J	`jnl`	Even faster generalized LR parsing. Acta Informatica John Aycock, R. Nigel Horspool, Jan Janousek, Borivoj Melichar
1997	—	`conf`	Formal Translations Described by Translation Grammars with LR(k) Input Grammars. PLILP Jan Janousek, Borivoj Melichar
1997	B	`conf`	The Output-Store Formal Translator Directed by LR Parsing. SOFSEM Jan Janousek, Borivoj Melichar