From post

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.

 

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

A Linear-Time Algorithm for Seeds Computation., , , , и . ACM Trans. Algorithms, 16 (2): 27:1-27:23 (2020)Tight Bound for the Number of Distinct Palindromes in a Tree., , , и . CoRR, (2020)On the recognition of context-free languages.. Symposium on Computation Theory, том 208 из Lecture Notes in Computer Science, стр. 318-325. Springer, (1984)Polynomial-Time Approximation Algorithms for Weighted LCS Problem., , , , и . CPM, том 6661 из Lecture Notes in Computer Science, стр. 455-466. Springer, (2011)Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing., , , и . LATA, том 7810 из Lecture Notes in Computer Science, стр. 383-394. Springer, (2013)Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors., , и . Theor. Comput. Sci., 123 (2): 427-428 (1994)see: TCS 116: 421-429 (1993).A Correct Preprocessing Algorithm for Boyer-Moore String-Searching.. SIAM J. Comput., 9 (3): 509-512 (1980)On Linear Context-Free Languages and One-Way Multihead Automata.. Inf. Process. Lett., 19 (4): 163-166 (1984)Two-Dimensional Pattern Matching by Sampling., , и . Inf. Process. Lett., 46 (4): 159-162 (1993)A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata.. Inf. Process. Lett., 31 (2): 103-109 (1989)