The following pages link to Wojciech Rytter (Q313971):
Displaying 50 items.
- (Q235236) (redirect page) (← links)
- Polynomial-time approximation algorithms for weighted LCS problem (Q266804) (← links)
- Order-preserving indexing (Q294954) (← links)
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- A linear time algorithm for consecutive permutation pattern matching (Q396621) (← links)
- A note on a simple computation of the maximal suffix of a string (Q396649) (← links)
- On the structure of compacted subword graphs of Thue-Morse words and their applications (Q414440) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- On the maximal sum of exponents of runs in a string (Q450542) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- Computing the number of cubic runs in standard Sturmian words (Q496558) (← links)
- Linear-time version of Holub's algorithm for morphic imprimitivity testing (Q497670) (← links)
- Two fast constructions of compact representations of binary words with given set of periods (Q507396) (← links)
- Efficient indexes for jumbled pattern matching with constant-sized alphabet (Q524375) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- Parallel algorithms for a class of graphs generated recursively (Q582922) (← links)
- Parallel tree-contraction and Fibonacci numbers (Q671622) (← links)
- A simple randomized parallel algorithm for maximal f-matchings (Q672735) (← links)
- Context-free recognition via shortest paths computation: a version of Valiant's algorithm (Q673077) (← links)
- Fast recognition of deterministic cfl's with a smaller number of processors (Q685360) (← links)
- Efficient constructions of test sets for regular and context-free languages (Q685373) (← links)
- Two-dimensional pattern matching by sampling (Q685522) (← links)
- On the parallel recognition of unambiguous context-free languages (Q808269) (← links)
- On the complexity of the recognition of parallel 2D-image languages (Q808271) (← links)
- On optimal parallel computations for sequences of brackets (Q808700) (← links)
- Prime normal form and equivalence of simple grammars (Q860856) (← links)
- The structure of subword graphs and suffix trees of Fibonacci words (Q860864) (← links)
- Equivalence of simple functions (Q880171) (← links)
- On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
- Optimally edge-colouring outerplanar graphs is in NC (Q909461) (← links)
- Parallel construction of minimal suffix and factor automata (Q911778) (← links)
- On special families of morphisms related to \(\delta \)-matching and don't care symbols (Q1007535) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- A characterization of reversal-bounded multipushdown machine languages (Q1058865) (← links)
- On linear context-free languages and one-way multihead automata (Q1061497) (← links)
- An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages (Q1079015) (← links)
- The space complexity of the unique decipherability problem (Q1087017) (← links)
- Optimal parallel parsing of bracket languages (Q1093379) (← links)
- On the complexity of parallel parsing of general context-free languages (Q1095675) (← links)
- Parallel time O(log n) recognition of unambiguous context-free languages (Q1096400) (← links)
- On the decidability of some problems about rational subsets of free partially commutative monoids (Q1099641) (← links)
- Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328) (← links)
- Remarks on string-matching and one-way multihead automata (Q1108049) (← links)
- On efficient parallel computations for some dynamic programming problems (Q1109691) (← links)
- Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages (Q1128670) (← links)
