( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees.

, , , и . Theor. Comput. Sci., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Tsai-Yu Jansen

Einfluss der Konversion laparoskopischer Operationen auf Tumorwachstum, hepatische Metastasierung und Tumorangiogenese. Uni Heidelberg, (2010)

Dirk Jansen

Temperaturkorrektur von mit dem Falling-Weight-Deflectometer gemessenen Deflexionen auf Asphaltbefestigungen. Uni Duisburg-Essen, (2009)

Christoph Janello

Wertschöpfung im digitalisierten Buchmarkt. Uni München, (2010)

Richard Janissen

Biomolecular based nano-manipulation with a combined atomic force microscope and single molecule fluorescence setup. Uni Düsseldorf, (2009)

Matthäus Janczyk

Synthese funktionalisierter Trinukleotide und ihre Anwendung bei der Randomisierung. Uni Greifswald, (2009)
 

Другие публикации лиц с тем же именем

Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array., , , и . Stringology, стр. 61-73. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2020)A Full and Linear Index of a Tree for Tree Patterns., , , , и . DCFS, том 8614 из Lecture Notes in Computer Science, стр. 198-209. Springer, (2014)Backward Linearised Tree Pattern Matching., , , и . LATA, том 8977 из Lecture Notes in Computer Science, стр. 599-610. Springer, (2015)Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination., , и . Stringology, стр. 11-22. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2020)On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees., , , и . Theor. Comput. Sci., (2020)Efficient determinization of visibly and height-deterministic pushdown automata., , , и . Comput. Lang. Syst. Struct., (2016)Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression., , , и . SLATE, том 62 из OASIcs, стр. 6:1-6:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A new algorithm for the determinisation of visibly pushdown automata., , , и . FedCSIS, том 5 из Annals of Computer Science and Information Systems, стр. 915-922. IEEE, (2015)Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata., , и . Comput. Sci. Inf. Syst., 9 (3): 1125-1153 (2012)Nonlinear Tree Pattern Pushdown Automata., , и . FedCSIS, стр. 871-878. (2011)