Author Info
Name
Affiliation
Papers
WOJCIECH RYTTER
Department of Mathematics, Informatics and Mechanics, University of Warsaw, ul. Banacha 2, 02-097 Warsaw, Poland and Department of Math. and Informatics, Copernicus University, ul. Chopina 12/18, ...
29
Collaborators
Citations 
PageRank 
42
130
17.13
Referers 
Referees 
References 
182
198
179
Search Limit
100198
Title
Citations
PageRank
Year
Shortest Covers Of All Cyclic Shifts Of A String00.342021
Gossiping By Energy-Constrained Mobile Agents In Tree Networks00.342021
Circular pattern matching with k mismatches00.342021
Internal Dictionary Matching00.342021
Syntactic View Of Sigma-Tau Generation Of Permutations00.342021
Hardness of Detecting Abelian and Additive Square Factors in Strings.00.342021
The Number of Repetitions in 2D-Strings00.342020
Internal Dictionary Matching.00.342019
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes.00.342019
On semi-perfect de Bruijn words.00.342018
String periods in the order-preserving model.00.342018
Extracting powers and periods in a word from its runs structure160.672014
On the maximum number of cubic subwords in a word30.492013
A note on efficient computation of all Abelian periods in a string70.612013
Efficient seed computation revisited20.382013
The maximal number of cubic runs in a word10.352012
New simple efficient algorithms computing powers and runs in strings.30.402010
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions341.651993
On the complexity of the recognition of parallel 2D-image languages20.361991
On optimal parallel computations for sequences of brackets20.381991
Parallel construction of minimal suffix and factor automata20.431990
Optimal parallel computations for Halin graphs00.341989
On efficient computations of costs of paths on a grid graph50.911988
A note on optimal parallel transformations of regular expressions to nondeterministic finite automata40.701987
An optimal parallel algorithm for dynamic expression evaluation and its applications241.881986
An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages70.961986
On the Complexity of Parallel Parsing of General Context-free Languages91.491986
The space complexity of the unique decipherability problem60.681986
A Characterization Of Reversal-Bounded Multipushdown Machine Languages30.731985