Wojciech Rytter | Academic Influence

Wojciech Rytter's AcademicInfluence.com Rankings

Wojciech Rytter

Computer Science

#1676

World Rank

#1737

Historical Rank

Theoretical Computer Science

#84

World Rank

#84

Historical Rank

Database

#5275

World Rank

#5476

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Wojciech Rytter's Degrees

PhD Computer Science University of Warsaw
Masters Mathematics University of Warsaw

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Wojciech Rytter Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Wojciech Rytter is a Polish computer scientist, a professor of computer science in the automata theory group at the University of Warsaw. His research focuses on the design and analysis of algorithms, and in particular on stringology, the study of algorithms for searching and manipulating text.

(See a Problem?)

Wojciech Rytter's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Text Algorithms (1994) (749)
Efficient parallel algorithms (1988) (454)
On-line construction of suffix trees (2002) (351)
Extracting Powers and Periods in a String from Its Runs Structure (2010) (345)
Jewels of stringology (2002) (310)
Application of Lempel-Ziv factorization to the approximation of grammar-based compression (2002) (303)
On the Maximal Number of Cubic Runs in a String (2010) (271)
Fast broadcasting and gossiping in radio networks (2000) (262)
Broadcasting algorithms in radio networks with unknown topology (2003) (249)
Speeding up two string-matching algorithms (1992) (177)
Deterministic broadcasting in unknown radio networks (2000) (169)
Deterministic broadcasting in ad hoc radio networks (2002) (137)
Jewels of stringology : text algorithms (2002) (124)
Squares, cubes, and time-space efficient string searching (1995) (117)
Efficient algorithms for Lempel-Ziv encoding (1996) (95)
Application of Lempel-Ziv Encodings to the Solution of Words Equations (1998) (88)
Fast parallel algorithms for graph matching problems (1998) (87)
A linear time algorithm for consecutive permutation pattern matching (2013) (80)
An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions (1997) (79)
Fast Practical Multi-Pattern Matching (1999) (79)
The Number of Runs in a String: Improved Analysis of the Linear Upper Bound (2006) (75)
Analysis of algorithms and data structures (1991) (73)
On Efficient Parallel Computations for some Dynamic Programming Problems (1988) (73)
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract) (1996) (66)
Internal Pattern Matching Queries in a Text and Applications (2013) (64)
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions (1993) (62)
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts (1997) (62)
The number of runs in a string (2007) (58)
Approximate String Matching with Gaps (2002) (56)
Pattern-Matching for Strings with Short Descriptions (1995) (56)
Repetitions in strings: Algorithms and combinatorics (2009) (56)
Complexity of Language Recognition Problems for Compressed Words (1999) (55)
Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input (2004) (54)
Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays (1991) (53)
Extracting powers and periods in a word from its runs structure (2014) (52)
A Correct Preprocessing Algorithm for Boyer-Moore String-Searching (1980) (50)
A Linear-Time Algorithm for Seeds Computation (2011) (49)
A randomized algorithm for gossiping in radio networks (2001) (46)
An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications (1986) (45)
Almost-optimal fully LZW-compressed pattern matching (1999) (44)
Fast Recognition of Pushdown Automaton and Context-free Languages (1984) (44)
Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings (1991) (43)
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes (2013) (41)
Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition (1989) (38)
On the recognition of context-free languages (1984) (36)
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet (2013) (36)
Parallel and Sequential Approximations of Shortest Superstrings (1994) (36)
The structure of subword graphs and suffix trees of Fibonacci words (2005) (36)
LPF Computation Revisited (2009) (36)
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract) (1996) (35)
The Complexity of Two-Way Pushdown Automata and Recursive Programs (1985) (34)
Algorithms on Compressed Strings and Arrays (1999) (31)
Efficient Data Structures for the Factor Periodicity Problem (2012) (31)
Faster Longest Common Extension Queries in Strings over General Alphabets (2016) (29)
Parallel Time O(log n) Recognition of Unambiguous Context-free Languages (1987) (28)
Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling (1995) (28)
A first approach to finding common motifs with gaps (2005) (27)
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property (1998) (26)
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (2009) (26)
Order-preserving indexing (2016) (26)
Evacuation from a Disc in the Presence of a Faulty Robot (2017) (25)
Computing the Longest Previous Factor (2013) (24)
Fast algorithms for Abelian periods in words and greatest common divisor queries (2017) (24)
Efficient algorithms for three variants of the LPF table (2012) (23)
Sequential and Parallel Approximation of Shortest Superstrings (1997) (22)
Unique decipherability for partially commutative alphabet (1986) (22)
The maximal number of cubic runs in a word (2012) (22)
The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching (1995) (21)
Fast Algorithm for Partial Covers in Words (2013) (21)
On the maximal sum of exponents of runs in a string (2010) (21)
Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes (2006) (21)
Compressed and fully compressed pattern matching in one and two dimensions (2000) (21)
Linear-Time Prime Decomposition Of Regular Prefix Codes (2003) (21)
A note on efficient computation of all Abelian periods in a string (2012) (20)
On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids (1986) (20)
Two-Dimensional Pattern Matching in Linear Time and Small Space (1995) (19)
The Number of Runs in Sturmian Words (2008) (19)
Optimal Pre x-Free Codes for Unequal Letter Costs and Dynamic Programming with the Monge Property (1998) (19)
Communication Problems for Mobile Agents Exchanging Energy (2016) (19)
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries (2016) (18)
Covering Problems for Partial Words and for Indeterminate Strings (2014) (17)
Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence (2014) (17)
Efficient Seeds Computation Revisited (2011) (17)
On maximal suffixes, constant-space linear-time versions of KMP algorithm (2003) (16)
Linear-Time Algorithm for Long LCF with k Mismatches (2018) (16)
Polynomial-time approximation algorithms for weighted LCS problem (2011) (16)
On the Complexity of Parallel Parsing of General Context-Free Languages (1986) (16)
Faster Algorithms for k-Medians in Trees (2003) (16)
Efficient seed computation revisited (2013) (16)
On the Parallel Recognition of Unambiguous Context-Free Languages (1991) (16)
Periodic Prefixes in Texts (1993) (15)
The Maximum Number of Squares in a Tree (2012) (15)
Constant-Time Randomized Parallel String Matching (1997) (15)
Context-Free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm (1995) (15)
The Space Complexity of the Unique Decipherability Problem (1986) (14)
An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-Driven Languages (1986) (14)
Eecient Algorithms for Lempel-ziv Encoding (1996) (14)
Three Heuristics for delta-Matching: delta-BM Algorithms (2002) (14)
Efficient algorithms for shortest partial seeds in words (2014) (13)
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching (1998) (13)
Testing k-binomial equivalence (2015) (13)
Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata (1997) (13)
Prime normal form and equivalence of simple grammars (2005) (13)
Algorithms for Two Versions of LCS Problem for Indeterminate Strings (2007) (13)
Maximum number of distinct and nonequivalent nonstandard squares in a word (2014) (13)
Parallel Computations on Strings and Arrays (1990) (12)
Efficient web searching using temporal factors (1999) (12)
Parallel time O(log n) recognition of unambiguous CFLs (1985) (12)
On the maximum number of cubic subwords in a word (2013) (12)
Parallel construction of optimal alphabetic trees (1993) (12)
Efficient constructions of test sets for regular and context-free languages (1991) (12)
On special families of morphisms related to [delta]-matching and don't care symbols (2003) (12)
Algorithms for Three Versions of the Shortest Common Superstring Problem (2010) (12)
The k-Median Problem for Directed Trees (2001) (12)
Constant-space string-matching in sublinear average time (1997) (11)
Correctness of Constructing Optimal Alphabetic Trees Revisited (1997) (11)
On Optimal Parallel Computations for Sequences of Brackets (1991) (11)
Polynomial Size Test Sets for Context-Free Languages (1992) (11)
Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs (1988) (11)
On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm (2002) (10)
Efficient Representation and Counting of Antipower Factors in Words (2018) (10)
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words (2009) (10)
Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees (1996) (10)
A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata (1987) (10)
Tight Bound for the Number of Distinct Palindromes in a Tree (2015) (10)
On Efficient Computations of Costs of Paths on a Grid Graph (1988) (10)
Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract) (1989) (10)
Optimal Parallel Parsing of Bracket Languages (1987) (10)
Internal Dictionary Matching (2019) (9)
On the greedy algorithm for the Shortest Common Superstring problem with reversals (2015) (9)
The Maximal Number of Runs in Standard Sturmian Words (2013) (9)
Automata-theoretic approach (2002) (9)
A Note on Two-Way Nondeterministic Pushdown Automata (1982) (9)
Parallel Construction of Minimal Suffix and Factor Automata (1990) (8)
Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors (1993) (8)
String Periods in the Order-Preserving Model (2018) (8)
Optimally Edge-Colouring Outerplanar Graphs is in NC (1990) (8)
The Dynamic Simulation of Recursive and Stack Manipulation Programs (1981) (8)
Tiling Periodicity (2007) (8)
Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's (1992) (8)
Efficient counting of square substrings in a tree (2012) (8)
Searching for Zimin patterns (2014) (8)
Two-Dimensional Pattern Matching by Sampling (1993) (8)
Compressed string-matching in standard Sturmian words (2009) (8)
Three heuristics for δ-matching: δ-BM algorithms (2002) (8)
On the Maximal Number of Cubic Subwords in a String (2009) (8)
Time Complexity of Loop-Free Two-Way Pushdown Automata (1983) (7)
New simple efficient algorithms computing powers and runs in strings (2014) (7)
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique (2003) (7)
Time Complexity of Unambiguous Path Systems (1982) (7)
The Fully Compressed String Matching for Lempel-Ziv Encoding (1995) (7)
Quasi-Linear-Time Algorithm for Longest Common Circular Factor (2019) (7)
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs (1990) (7)
Hamiltonian Paths in the Square of a Tree (2011) (7)
Order-Preserving Suffix Trees and Their Algorithmic Applications (2013) (7)
On a Sublinear Time Parallel Construction of Optimal Binary Search Trees (1994) (7)
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (2015) (7)
Pattern matching for images generated by finite automata (2000) (7)
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts (1999) (7)
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words (2012) (7)
String Powers in Trees (2015) (7)
Computing repetitive structures in indeterminate strings (2008) (7)
An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern (1994) (6)
125 Problems in Text Algorithms (2021) (6)
Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms (1992) (6)
Prime decompositions of regular prefix codes (2002) (6)
An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads (1981) (6)
Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition (1992) (6)
Counting Distinct Patterns in Internal Dictionary Matching (2020) (6)
The Number of Repetitions in 2D-Strings (2020) (5)
A Simulation Result for Two-Way Pushdown Automata (1983) (5)
An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems (1994) (5)
A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata (1981) (5)
Energy-Optimal Broadcast in a Tree with Mobile Agents (2017) (5)
On the structure of compacted subword graphs of Thue-Morse words and their applications (2012) (5)
Circular Pattern Matching with k Mismatches (2019) (5)
A note on the longest common compatible prefix problem for partial words (2013) (5)
On the PVM Computations of Transitive Closure and Algebraic Path Problems (1998) (5)
International Workshop on Combinatorial Algorithms (IWOCA) (2007) (5)
Observations on Parallel Computation of Transitive and Max-Closure Problems (2002) (5)
PVM Computation of the Transitive Closure: The Dependency Graph Approach (2001) (4)
Remarks on String-Matching and One-Way Multihead Automata (1987) (4)
Generalized Factorizations of Words and Their Algorithmic Properties (1999) (4)
The Compression of Subsegments of Images Described by Finite Automata (1999) (4)
Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree (2018) (4)
Unique Deciperability for Partially Commutative Alphabet (Extended Abstract) (1996) (4)
On parallel computations of expressions and straight programs (1990) (4)
Remarks on pebble games on graphs (1987) (4)
Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns (1995) (4)
Two Results on Linear Embeddings of Complete Binary Trees (1994) (4)
Shortest Covers of All Cyclic Shifts of a String (2020) (4)
Efficient Computation of Throughput Values of Context-Free Languages (2007) (4)
Efficient Algorithms for Longest Closed Factor Array (2015) (4)
Occurrence and Lexicographic Properties of Standard Sturmian Words (2007) (3)
The complexity of compressing subsegments of images described by finite automata (2003) (3)
The Dimension of Stability of Stochastic Automata (1974) (3)
On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms (1994) (3)
Exact Analysis of Three Tree Contraction Algorithms (1991) (3)
On the PVM/MPI Computations of Dynamic Programming Recurrences (1997) (3)
Parallel Algorithms for a Class of Graphs Generated Recursively (1989) (3)
On the Complexity of the Recognition of Parallel 2D-Image Languages (1991) (3)
Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract) (1989) (3)
Syntactic View of Sigma-Tau Generation of Permutations (2019) (3)
Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs (1987) (3)
08261 Abstracts Collection - Structure-Based Compression of Complex Massive Data (2008) (3)
On Periodicity Lemma for Partial Words (2018) (3)
Linear-time version of Holub's algorithm for morphic imprimitivity testing (2013) (3)
Trees with Minimum Weighted Path Length (2018) (3)
Parallel Tree-Contraction and Fibonacci Numbers (1996) (2)
Time Complexity of Languages Recognized by One-Way Multihead Pushdown Automata (1981) (2)
Faster Recovery of Approximate Periods over Edit Distance (2018) (2)
Observations On Compressed Pattern-Matching with Ranked Variables in Zimin Words (2013) (2)
Computing Covers of 2D-Strings (2021) (2)
100 exercises in the theory of automata and formal languages (1987) (2)
Internal Quasiperiod Queries (2020) (2)
Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric (2012) (2)
Universal Reconstruction of a String (2015) (2)
Approximate pattern matching (2002) (2)
Functional Automata (1980) (2)
Energy-optimal broadcast and exploration in a tree using mobile agents (2019) (2)
Improved methods for extracting frequent itemsets from interim‐support trees (2009) (2)
A Characterization of Reversal-Bounded Multipushdown Machine Languages (1985) (2)
A Simple Randomized Parallel Algorithm for Maximal f-Matchings (1996) (2)
Faster Algorithms for k-Medians in Trees (Extended Abstract) (2003) (2)
Parallel Recognition and Ranking of Context-Free Languages (1992) (2)
Weighted Shortest Common Supersequence Problem Revisited (2019) (2)
Computing the number of cubic runs in standard Sturmian words (2011) (2)
Parallel algorithms for 2D-image recognition (1992) (2)
Mathematical Foundations of Computer Science 2002 (2002) (2)
E cient Counting of Square Substrings in a Tree (2012) (1)
TCAM representations of intervals of integers encoded by binary trees (2007) (1)
On the Complexity of Decidable Cases of Commutation Problem for Languages (2001) (1)
On semi-perfect de Bruijn words (2018) (1)
Algorithms for Communication Problems for Mobile Agents Exchanging Energy (2015) (1)
Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup (2009) (1)
String Powers in Trees (2017) (1)
Square-Free Words over Partially Commutative Alphabets (2015) (1)
On polynomial-time approximation algorithms for the variable length scheduling problem (2003) (1)
On the complexity of decidable cases of the commutation problem of languages (2005) (1)
Remarks on the Pyramidal Structure (1983) (1)
Linear-Time Computation of Shortest Covers of All Rotations of a String (2022) (1)
Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (2002) (1)
On Parallel Recognition of Two Classes of 2-D Array Patterns (1992) (1)
The Strong Stability Problem for Stochastic Automata (1973) (1)
Efficient enumeration of non-equivalent squares in partial words with few holes (2018) (1)
How Much Different Are Two Words with Different Shortest Periods (2018) (1)
Equivalence of Functions Represented by Simple Context-Free Grammars with Output (2006) (1)
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet (2016) (1)
The Dimension of Strong Stability of Minimal State Stochastic Automata (1973) (1)
Rectangular Tile Covers of 2D-Strings (2022) (1)
String Covers of a Tree (2021) (1)
The k-Median Problem for Directed Trees Extended Abstract (2001) (1)
28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland (2017) (1)
Efficient Enumeration of Distinct Factors Using Package Representations (2020) (1)
On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching (1995) (1)
The Number of Cubes in Sturmian Words (2012) (1)
A Fast Parallel Algorithm for Optimal Edge-Colouring of Outerplanar Graphs (1986) (1)
Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages (1998) (1)
Basic string searching algorithms (2002) (0)
D S ] 1 3 M ar 2 01 9 A Linear Time Algorithm for Seeds Computation (2019) (0)
Fast Algorithm for Partial Covers in Words (2014) (0)
Efficient Data Structures (2021) (0)
Observations on the disjointness problem for rational subsets of free partially commutative monoids (1987) (0)
Relations Between δ-Matching and Matching with Don ’ t Care Symbols : δ-distinguishing Morphisms ( Preliminary Version ) (2009) (0)
On the maximal number of highly periodic runs in a string (2009) (0)
Proceedings 12th Australasian Workshop on Combinatorial Algorithms (2001) (0)
Post Correspondence Problem with Partially Commutative Alphabets (2010) (0)
Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers (2017) (0)
Two-dimensional pattern matching (2002) (0)
Lookin g for a Chall enge ? (2012) (0)
Two fast constructions of compact representations of binary words with given set of periods (2016) (0)
An Improved Pattern-Matching Algorithm for Strings with Short Descriptions (1995) (0)
Text compression techniques (2002) (0)
Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice (2006) (0)
Subsequence Covers of Words (2022) (0)
SOFSEM 2010: Theory and Practice of Computer Science36th Conference on Current Trends in Theory and Practice of Computer Science, (2010) (0)
On the Cyclic Regularities of Strings (2019) (0)
08261 Executive Summary - Structure-Based Compression of Complex Massive Data (2008) (0)
On the String Consensus Problem and the Manhattan Sequence Consensus Problem (2014) (0)
Order-Preserving Indexing (cid:73) (2016) (0)
Equivalence of simple functions (2007) (0)
Parallel text algorithms (2002) (0)
Matching Integer Intervals by Minimal Sets of Binary Words with don't cares (2008) (0)
More on suffix trees (2002) (0)
Constant-space searchings (2002) (0)
D S ] 1 2 Ju l 2 01 1 A Linear Time Algorithm for Seeds Computation ( Full Version ) (2011) (0)
Hardness of Detecting Abelian and Additive Square Factors in Strings (2021) (0)
Two results of complete on linear embeddings binary trees (2001) (0)
Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees (2005) (0)
Combinatorial Pattern Matching, CPM'2002 (2002) (0)
Mathematical foundations of computer science 2002 : 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002 : proceedings (2002) (0)
Preprocessing for basic searchings (2002) (0)
On Linear Context-Free Languages and One-Way Multihead Automata (1984) (0)
Text algorithms related to sorting (2002) (0)
Fast Recognition of Pushdown Automaton Context-free Languages (2005) (0)
Fast parallel algorithms for vertex and edge colouring of Halin graphs (1986) (0)
A CORRECT PREPROCESSING ALGORITHM FOR STRING-SEARCHING (2020) (0)
Proceedings of the 2004 Prague Stringology Conference (PSC'04) (2004) (0)
LECT NOTE COMPUT SCI (2002) (0)
Efficient enumeration of non-equivalent squares in partial words with few holes (2017) (0)
Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore (2009) (0)
A periodicity lemma for partial words (2020) (0)
Parallel Algorithms for ZD-Image Recognit ion (1992) (0)
SOME REMARKS ON DETERMINISTIC MAZURKIEWICZ ALGORITHMS AND LANGUAGES ASSOCIATED WITH THEM (2021) (0)
J 9 2-D Monotone Spatial Indexing Scheme with Optimal Update Time (2005) (0)
Matching by dueling and sampling (2002) (0)
Almost Optimal Sublinear Time Parallel Recognition Algorithms of Three Subclasses of Cfl''s (1995) (0)
Gossiping by energy-constrained mobile agents in tree networks (2021) (0)
Two-dimensional periodicities (2002) (0)
Searching Using Temporal FactorsArtur Czumaj (1999) (0)
Symmetries and repetitions in texts (2002) (0)
On maximal suffices and constant space versions of KMP algorithm (2002) (0)
Relations between delta-matching and matching with don't care symbols: Delta distinguishing morphisms (2001) (0)
The Complexity ofTwo-DimensionalCompressed Pattern (1996) (0)
A Note on E(cid:30)cient Computation of All Abelian Periods in a String (2012) (0)
A Simple Randomized Parallel Algorithm for Maximal f-Matching (1992) (0)
Constant-Space String-Matchingin Sublinear Average Time ( Extended Abstract ) (2019) (0)
Parallel Algorithms on Strings (2007) (0)
Optimal Parallel Computations for Halin Graphs (1989) (0)
Squares and Repetitions (2008) (0)
Compressed String Matching in Standard Sturmian Words 1 (2009) (0)
Structure-Based Compression of Complex Massive Data — Dagstuhl Seminar — (2008) (0)
Approximate Circular Pattern Matching (2022) (0)
A note on a simple computation of the maximal suffix of a string (2013) (0)
Automata theory and complexity (1979) (0)
(note) Correctness of Constructing Optimal Alphabetic Trees Revisited (2011) (0)

This paper list is powered by the following services:

Other Resources About Wojciech Rytter

What Schools Are Affiliated With Wojciech Rytter?

Wojciech Rytter is affiliated with the following schools:

University of Warsaw