Wojciech Rytter

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Three Heuristics for delta-Matching: delta-BM Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

Jewels of stringology.

[BibT_eX]

[DOI]

World Scientific, ISBN: 978-981-02-4782-9, 2002

2001

Efficient web searching using temporal factors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

PVM Computation of the Transitive Closure: The Dependency Graph Approach.

[BibT_eX]

[DOI]

Aris Pagourtzis

Igor Potapov

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2001

The k-Median Problem for Directed Trees.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000

Compressed and fully compressed pattern matching in one and two dimensions.

[BibT_eX]

[DOI]

Proc. IEEE, 2000

Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata.

[BibT_eX]

Nord. J. Comput., 2000

Deterministic broadcasting in unknown radio networks.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Generalized Factorizations of Words and Their Algorithmic Properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Constant-Space String-Matching in Sublinear Average Time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Fast Practical Multi-Pattern Matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Algorithms on Compressed Strings and Arrays.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Almost Optimal Fully LZW-Compressed Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1999

The Compression of Subsegments of Images Described by Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

Complexity of Language Recognition Problems for Compressed Words.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1998

Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

On a Sublinear Time Parallel Construction of Optimal Binary Search Trees.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1998

On the PVM Computations of Transitive Closure and Algebraic Path Problems.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 1998

Application of Lempel-Ziv Encodings to the Solution of Words Equations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Correctness of Constructing Optimal Alphabetic Trees Revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Constant-Time Randomized Parallel String Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions.

[BibT_eX]

Ayumi Shinohara

Nord. J. Comput., 1997

Sequential and Parallel Approximation of Shortest Superstrings.

[BibT_eX]

[DOI]

J. Algorithms, 1997

On the PVM/MPI Computations of Dynamic Programming Recurrences.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 1997

Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996

Parallel Tree-Contraction and Fibonacci Numbers.

[BibT_eX]

[DOI]

Tomasz Szymacha

Inf. Process. Lett., 1996

A Simple Randomized Parallel Algorithm for Maximal f-Matchings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1996

Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995

Context-Free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Polynomial Size Test Sets for Context-Free Languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Pattern-Matching for Strings with Short Descriptions

[BibT_eX]

[DOI]

Ayumi Shinohara

Electron. Colloquium Comput. Complex., 1995

Squares, Cubes, and Time-Space Efficient String Searching.

[BibT_eX]

[DOI]

Algorithmica, 1995

Two-Dimensional Pattern Matching in Linear Time and Small Space.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the LATIN '95: Theoretical Informatics, 1995

Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994

Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors.

[BibT_eX]

Burkhard Monien

Helmut Schäpers

Theor. Comput. Sci., 1994

On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Two Results on Linear Embeddings of Complete Binary Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Speeding Up Two String-Matching Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 1994

Parallel and Sequential Approximations of Shortest Superstrings.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

Text Algorithms

[BibT_eX]

[DOI]

Oxford University Press, ISBN: 0-19-508609-0, 1994

1993

Fast recognition of deterministic cfl's with a smaller number of processors.

[BibT_eX]

[DOI]

Burkhard Monien

Leopold Schäpers

Theor. Comput. Sci., 1993

Efficient constructions of test sets for regular and context-free languages.

[BibT_eX]

[DOI]

Stefan Jarominek

Theor. Comput. Sci., 1993

Two-Dimensional Pattern Matching by Sampling.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

Parallel Construction of Optimal Alphabetic Trees.

[BibT_eX]

[DOI]

Teresa M. Przytycka

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's.

[BibT_eX]

[DOI]

Peter Rossmanith

Inf. Process. Lett., 1992

On Parallel Recognition of Two Classes of 2-D Array Patterns.

[BibT_eX]

[DOI]

Ahmed Saoudi

Int. J. Pattern Recognit. Artif. Intell., 1992

Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition.

[BibT_eX]

[DOI]

Proceedings of the STACS 92, 1992

Parallel Recognition and Ranking of Context-Free Languages.

[BibT_eX]

[DOI]

Klaus-Jörn Lange

Peter Rossmanith

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

A Simple Randomized Parallel Algorithm for Maximal f-Matching.

[BibT_eX]

[DOI]

Proceedings of the LATIN '92, 1992

Parallel algorithms for 2D-image recognition.

[BibT_eX]

[DOI]

Ahmed Saoudi

Proceedings of the 11th IAPR International Conference on Pattern Recognition, 1992

Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Parallel Image Analysis, Second International Conference, 1992

1991

On Optimal Parallel Computations for Sequences of Brackets.

[BibT_eX]

[DOI]

Krzysztof Diks

Theor. Comput. Sci., 1991

Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

On the Parallel Recognition of Unambiguous Context-Free Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

On the Complexity of the Recognition of Parallel 2D-Image Languages.

[BibT_eX]

[DOI]

Ahmed Saoudi

Inf. Process. Lett., 1991

Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Exact Analysis of Three Tree Contraction Algorithms.

[BibT_eX]

[DOI]

Tomasz Szymacha

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

Analysis of algorithms and data structures.

[BibT_eX]

Lech Banachowski

Antoni Kreczmar

International computer science series, Addison-Wesley, ISBN: 978-0-201-41693-0, 1991

1990

Optimally Edge-Colouring Outerplanar Graphs is in NC.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Parallel Construction of Minimal Suffix and Factor Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

Parallel Computations on Strings and Arrays.

[BibT_eX]

[DOI]

Proceedings of the STACS 90, 1990

Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

1989

Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition

[BibT_eX]

[DOI]

Inf. Comput., April, 1989

Parallel Algorithms for a Class of Graphs Generated Recursively.

[BibT_eX]

[DOI]

Tomasz Szymacha

Inf. Process. Lett., 1989

A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Optimal Parallel Computations for Halin Graphs.

[BibT_eX]

[DOI]

Krzysztof Diks

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Krzysztof Diks

Torben Hagerup

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

On Efficient Parallel Computations for some Dynamic Programming Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

On Efficient Computations of Costs of Paths on a Grid Graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs.

[BibT_eX]

[DOI]

Amos Israeli

Inf. Process. Lett., 1988

Efficient parallel algorithms.

[BibT_eX]

Cambridge University Press, ISBN: 978-0-521-38841-2, 1988

1987

Parallel Time O(log n) Recognition of Unambiguous Context-free Languages

[BibT_eX]

[DOI]

Inf. Comput., April, 1987

Optimal Parallel Parsing of Bracket Languages.

[BibT_eX]

[DOI]

Raffaele Giancarlo

Theor. Comput. Sci., 1987

Remarks on String-Matching and One-Way Multihead Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1987

1986

On the Complexity of Parallel Parsing of General Context-Free Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-Driven Languages.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

The Space Complexity of the Unique Decipherability Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

Unique Deciperability for Partially Commutative Alphabet (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

1985

A Characterization of Reversal-Bounded Multipushdown Machine Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Fast Recognition of Pushdown Automaton and Context-free Languages

[BibT_eX]

[DOI]

Inf. Control., 1985

Parallel time O(log n) recognition of unambiguous CFLs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1985

1984

On Linear Context-Free Languages and One-Way Multihead Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

On the recognition of context-free languages.

[BibT_eX]

[DOI]

Proceedings of the Computation Theory, 1984

1983

A Simulation Result for Two-Way Pushdown Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

Time Complexity of Loop-Free Two-Way Pushdown Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

Remarks on the Pyramidal Structure.

[BibT_eX]

[DOI]

Proceedings of the CAAP'83, 1983

1982

Time Complexity of Unambiguous Path Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

A Note on Two-Way Nondeterministic Pushdown Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

1981

A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Time Complexity of Languages Recognized by One-Way Multihead Pushdown Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

The Dynamic Simulation of Recursive and Stack Manipulation Programs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

1980

A Correct Preprocessing Algorithm for Boyer-Moore String-Searching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1980

Functional Automata.

[BibT_eX]

Fundam. Informaticae, 1980

1974

The Dimension of Stability of Stochastic Automata

[BibT_eX]

[DOI]

Inf. Control., March, 1974

1973

The Dimension of Strong Stability of Minimal State Stochastic Automata.

[BibT_eX]

Bull. Acad. Pol. des Sci. Ser. Sci. Math. Astron. Phys., 1973

The Strong Stability Problem for Stochastic Automata.

[BibT_eX]