( en | de | ru )

 

Disambiguation of "Rytter, Wojciech"

Author of the publication

copydeleteadd this publication to your clipboard
On the maximal sum of exponents of runs in a string.

, , , , and . J. Discrete Algorithms, (2012)

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.

Manfred Rytter

Wojciech Wojtyna

Wojciech Naworyta

Wojciech Torwinski

Waldemar Wojciech

 

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)Algorithms on Compressed Strings and Arrays.. SOFSEM, volume 1725 of Lecture Notes in Computer Science, page 48-65. Springer, (1999)Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs., , , and . FSTTCS, volume 472 of Lecture Notes in Computer Science, page 204-214. Springer, (1990)Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice., , , and . CIAA, volume 4094 of Lecture Notes in Computer Science, page 90-101. Springer, (2006)Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts., , and . MFCS, volume 1672 of Lecture Notes in Computer Science, page 48-58. Springer, (1999)