Author of the publication

Covering Problems for Partial Words and for Indeterminate Strings.

, , , , , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 220-232. Springer, (2014)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Broadcasting algorithms in radio networks with unknown topology., and . J. Algorithms, 60 (2): 115-143 (2006)Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property., , , and . J. Algorithms, 42 (2): 277-303 (2002)Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors., , and . Theor. Comput. Sci., 123 (2): 427-428 (1994)see: TCS 116: 421-429 (1993).On Linear Context-Free Languages and One-Way Multihead Automata.. Inf. Process. Lett., 19 (4): 163-166 (1984)A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata.. Inf. Process. Lett., 31 (2): 103-109 (1989)On Efficient Computations of Costs of Paths on a Grid Graph.. Inf. Process. Lett., 29 (2): 71-74 (1988)On the PVM/MPI Computations of Dynamic Programming Recurrences., , , and . PVM/MPI, volume 1332 of Lecture Notes in Computer Science, page 305-312. Springer, (1997)Algorithms on Compressed Strings and Arrays.. SOFSEM, volume 1725 of Lecture Notes in Computer Science, page 48-65. Springer, (1999)Polynomial-Time Approximation Algorithms for Weighted LCS Problem., , , , and . CPM, volume 6661 of Lecture Notes in Computer Science, page 455-466. Springer, (2011)Syntactic View of Sigma-Tau Generation of Permutations., and . LATA, volume 11417 of Lecture Notes in Computer Science, page 447-459. Springer, (2019)