default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Janousek
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]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: 33-43 (2024)- [c33]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: 326-339 - [i1]Laurent Feuilloley, Jan Janousek, Jan Matyás Kristan, Josef Erik Sedlácek:
Decreasing verification radius in local certification. CoRR abs/2408.10757 (2024) - 2023
- [j15]Eliska Sestáková, Ondrej Guth, Jan Janousek:
Inexact tree pattern matching with 1-degree edit distance using finite automata. Discret. Appl. Math. 330: 78-97 (2023) - [c32]Václav Blazej, Jan Janousek, Stepán Plachý:
On the Smallest Synchronizing Terms of Finite Tree Automata. CIAA 2023: 79-90 - 2021
- [c31]Eliska Sestáková, Ondrej Guth, Jan Janousek:
Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance. Stringology 2021: 1-15 - 2020
- [j14]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. 830-831: 60-90 (2020) - [c30]Stepán Plachý, Jan Janousek:
On Synchronizing Tree Automata and Their Work-Optimal Parallel Run, Usable for Parallel Tree Pattern Matching. SOFSEM 2020: 576-586 - [c29]Tomás Pecka, Jan Trávnícek, Jan Janousek:
Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination. Stringology 2020: 11-22 - [c28]Jan Trávnícek, Robin Oburka, Tomás Pecka, Jan Janousek:
Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array. Stringology 2020: 61-73
2010 – 2019
- 2019
- [c27]Pavel Krömer, Jan Janousek, Jan Platos:
Random Key Self-Organizing Migrating Algorithm for Permutation Problems. CEC 2019: 2878-2885 - [c26]Petr Gajdos, Marek Behálek, Jan Janousek, Pavel Krömer:
QDSOMA: Towards the Utilization of Quantum Computing within SOMA. CEC 2019: 2900-2907 - [e2]Ricardo Rodrigues, Jan Janousek, Luís Ferreira, Luísa Coheur, Fernando Batista, Hugo Gonçalo Oliveira:
8th Symposium on Languages, Applications and Technologies, SLATE 2019, June 27-28, 2019, Coimbra, Portugal. OASIcs 74, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-114-6 [contents] - 2018
- [j13]Eliska Sestáková, Jan Janousek:
Automata Approach to XML Data Indexing. Inf. 9(1): 12 (2018) - [c25]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: 6:1-6:12 - [c24]Eliska Sestáková, Borivoj Melichar, Jan Janousek:
Constrained Approximate Subtree Matching by Finite Automata. Stringology 2018: 79-90 - 2017
- [c23]Eliska Sestáková, Jan Janousek:
Indexing XML Documents Using Tree Paths Automaton. SLATE 2017: 10:1-10:14 - 2016
- [j12]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: 91-105 (2016) - [j11]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: 50-55 (2016) - [c22]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: 169-178 - [e1]Adrian-Horia Dediu, Jan Janousek, Carlos Martín-Vide, Bianca Truthe:
Language and Automata Theory and Applications - 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings. Lecture Notes in Computer Science 9618, Springer 2016, ISBN 978-3-319-29999-0 [contents] - 2015
- [j10]Tomás Cerný, Miroslav Macik, Michael J. Donahoo, Jan Janousek:
On distributed concern delivery in user interface design. Comput. Sci. Inf. Syst. 12(2): 655-681 (2015) - [c21]Jan Janousek, Petr Gajdos, Michal Radecký, Václav Snásel:
Application of Bio-inspired Methods Within Cluster Forest Algorithm. AECIA 2015: 237-247 - [c20]Radomír Polách, Jan Travnicek, Jan Janousek, Borivoj Melichar:
A new algorithm for the determinisation of visibly pushdown automata. FedCSIS 2015: 915-922 - [c19]Jan Janousek, Petr Gajdos, Michal Radecký, Václav Snásel:
Gaussian Mixture Model Cluster Forest. ICMLA 2015: 1019-1023 - [c18]Jan Trávnícek, Jan Janousek, Borivoj Melichar, Loek G. Cleophas:
Backward Linearised Tree Pattern Matching. LATA 2015: 599-610 - [c17]Eliska Sestáková, Jan Janousek:
Tree String Path Subsequences Automaton and Its Use for Indexing XML Documents. SLATE 2015: 171-181 - 2014
- [c16]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: 198-209 - [c15]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: 459-468 - [c14]Tomás Cerný, Miroslav Macik, Michael J. Donahoo, Jan Janousek:
Efficient Description and Cache Performance in Aspect-Oriented User Interface Design. FedCSIS 2014: 1667-1676 - [c13]Jan Janousek, Jaroslav Málek:
Target Code Selection by Tilling AST with the Use of Tree Pattern Pushdown Automaton. SLATE 2014: 159-165 - [c12]Jan Janousek, Jan Platos, Václav Snásel:
Clustering using artificial bee colony on CUDA. SMC 2014: 3803-3807 - [c11]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: 21-30 - 2013
- [j9]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: 51-60 (2013) - 2012
- [j8]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) - [j7]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) - [j6]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) - [j5]Borivoj Melichar, Jan Janousek, Tomás Flouri:
Arbology: Trees and pushdown automata. Kybernetika 48(3): 402-428 (2012) - [j4]Jan Janousek, Borivoj Melichar, Martin Poliak:
Tree compression pushdown automaton. Kybernetika 48(3): 429-452 (2012) - 2011
- [c10]Jan Travnicek, Jan Janousek, Borivoj Melichar:
Nonlinear Tree Pattern Pushdown Automata. FedCSIS 2011: 871-878 - [c9]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 - [c8]Martin Plicka, Jan Janousek, Borivoj Melichar:
Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees. FedCSIS 2011: 903-906 - [c7]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 - [c6]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
- [j3]Tomás Flouri, Jan Janousek, Borivoj Melichar:
Subtree matching by pushdown automata. Comput. Sci. Inf. Syst. 7(2): 331-357 (2010) - [c5]Tomás Flouri, Borivoj Melichar, Jan Janousek:
Aho-Corasick like multiple subtree matching by pushdown automata. SAC 2010: 2157-2158
2000 – 2009
- 2009
- [j2]Jan Janousek, Borivoj Melichar:
On regular tree languages and deterministic pushdown automata. Acta Informatica 46(7): 533-547 (2009) - [c4]Tomás Flouri, Borivoj Melichar, Jan Janousek:
Subtree matching by deterministic pushdown automata. IMCSIT 2009: 659-666 - [c3]Jan Janousek:
String Suffix Automata and Subtree Pushdown Automata. Stringology 2009: 160-172 - 2001
- [j1]John Aycock, R. Nigel Horspool, Jan Janousek, Borivoj Melichar:
Even faster generalized LR parsing. Acta Informatica 37(9): 633-651 (2001)
1990 – 1999
- 1997
- [c2]Jan Janousek, Borivoj Melichar:
Formal Translations Described by Translation Grammars with LR(k) Input Grammars. PLILP 1997: 421-422 - [c1]Jan Janousek, Borivoj Melichar:
The Output-Store Formal Translator Directed by LR Parsing. SOFSEM 1997: 432-439
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 01:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
