Wojciech Rytter

According to our database1, Wojciech Rytter authored at least 227 papers between 1973 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
On semi-perfect de Bruijn words.
Theor. Comput. Sci., 2018

String Periods in the Order-Preserving Model.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Faster Recovery of Approximate Periods over Edit Distance.
Proceedings of the String Processing and Information Retrieval, 2018

Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree.
Proceedings of the Structural Information and Communication Complexity, 2018

On Periodicity Lemma for Partial Words.
Proceedings of the Language and Automata Theory and Applications, 2018

How Much Different Are Two Words with Different Shortest Periods.
Proceedings of the Artificial Intelligence Applications and Innovations, 2018

Linear-Time Algorithm for Long LCF with k Mismatches.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017
Evacuation from a Disc in the Presence of a Faulty Robot.
Proceedings of the Structural Information and Communication Complexity, 2017

Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Energy-Optimal Broadcast in a Tree with Mobile Agents.
Proceedings of the Algorithms for Sensor Systems, 2017

2016
Squares and Repetitions.
Encyclopedia of Algorithms, 2016

Two fast constructions of compact representations of binary words with given set of periods.
Theor. Comput. Sci., 2016

Order-preserving indexing.
Theor. Comput. Sci., 2016

Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence.
SIAM J. Discrete Math., 2016

On the greedy algorithm for the Shortest Common Superstring problem with reversals.
Inf. Process. Lett., 2016

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.
Proceedings of the String Processing and Information Retrieval, 2016

Communication Problems for Mobile Agents Exchanging Energy.
Proceedings of the Structural Information and Communication Complexity, 2016

Faster Longest Common Extension Queries in Strings over General Alphabets.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Searching for Zimin patterns.
Theor. Comput. Sci., 2015

A note on the longest common compatible prefix problem for partial words.
J. Discrete Algorithms, 2015

Universal Reconstruction of a String.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Tight Bound for the Number of Distinct Palindromes in a Tree.
Proceedings of the String Processing and Information Retrieval, 2015

Efficient Algorithms for Longest Closed Factor Array.
Proceedings of the String Processing and Information Retrieval, 2015

Internal Pattern Matching Queries in a Text and Applications.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Square-Free Words over Partially Commutative Alphabets.
Proceedings of the Language and Automata Theory and Applications, 2015

String Powers in Trees.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
Extracting powers and periods in a word from its runs structure.
Theor. Comput. Sci., 2014

On the String Consensus Problem and the Manhattan Sequence Consensus Problem.
Proceedings of the String Processing and Information Retrieval, 2014

Covering Problems for Partial Words and for Indeterminate Strings.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Efficient Algorithms for Shortest Partial Seeds in Words.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
Efficient seed computation revisited.
Theor. Comput. Sci., 2013

A note on a simple computation of the maximal suffix of a string.
J. Discrete Algorithms, 2013

A linear time algorithm for consecutive permutation pattern matching.
Inf. Process. Lett., 2013

A note on efficient computation of all Abelian periods in a string.
Inf. Process. Lett., 2013

On the maximum number of cubic subwords in a word.
Eur. J. Comb., 2013

Computing the Longest Previous Factor.
Eur. J. Comb., 2013

The Maximal Number of Runs in Standard Sturmian Words.
Electr. J. Comb., 2013

Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.
Proceedings of the String Processing and Information Retrieval, 2013

Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing.
Proceedings of the Language and Automata Theory and Applications, 2013

Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet.
Proceedings of the Algorithms - ESA 2013, 2013

Fast Algorithm for Partial Covers in Words.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012
On the structure of compacted subword graphs of Thue-Morse words and their applications.
J. Discrete Algorithms, 2012

On the maximal sum of exponents of runs in a string.
J. Discrete Algorithms, 2012

Efficient algorithms for three variants of the LPF table.
J. Discrete Algorithms, 2012

The maximal number of cubic runs in a word.
J. Comput. Syst. Sci., 2012

The Number of Cubes in Sturmian Words.
Proceedings of the Prague Stringology Conference 2012, 2012

Efficient Data Structures for the Factor Periodicity Problem.
Proceedings of the String Processing and Information Retrieval, 2012

A linear time algorithm for seeds computation.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Efficient Counting of Square Substrings in a Tree.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

The Maximum Number of Squares in a Tree.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
Computing the Number of Cubic Runs in Standard Sturmian Words.
Proceedings of the Prague Stringology Conference 2011, 2011

Observations On Compressed Pattern-Matching with Ranked Variables in Zimin Words.
Proceedings of the Prague Stringology Conference 2011, 2011

Hamiltonian Paths in the Square of a Tree.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Polynomial-Time Approximation Algorithms for Weighted LCS Problem.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Efficient Seeds Computation Revisited.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010
New Simple Efficient Algorithms Computing Powers and Runs in Strings.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Extracting Powers and Periods in a String from Its Runs Structure.
Proceedings of the String Processing and Information Retrieval, 2010

Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Post Correspondence Problem with Partially Commutative Alphabets.
Proceedings of the Language and Automata Theory and Applications, 2010

On the Maximal Number of Cubic Runs in a String.
Proceedings of the Language and Automata Theory and Applications, 2010

On the Maximal Sum of Exponents of Runsin a String.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Algorithms for Three Versions of the Shortest Common Superstring Problem.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009
Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore.
Theor. Comput. Sci., 2009

Repetitions in strings: Algorithms and combinatorics.
Theor. Comput. Sci., 2009

Compressed string-matching in standard Sturmian words.
Theor. Comput. Sci., 2009

Improved methods for extracting frequent itemsets from interim-support trees.
Softw., Pract. Exper., 2009

Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

On the Maximal Number of Cubic Subwords in a String.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

LPF Computation Revisited.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Squares and Repetitions.
Proceedings of the Encyclopedia of Algorithms, 2008

The Number of Runs in Sturmian Words.
Proceedings of the Implementation and Applications of Automata, 2008

Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

08261 Executive Summary - Structure-Based Compression of Complex Massive Data.
Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

08261 Abstracts Collection - Structure-Based Compression of Complex Massive Data.
Proceedings of the Structure-Based Compression of Complex Massive Data, 22.06., 2008

Matching Integer Intervals by Minimal Sets of Binary Words with don't cares.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007
Parallel Algorithms on Strings.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Equivalence of simple functions.
Theor. Comput. Sci., 2007

The number of runs in a string.
Inf. Comput., 2007

Efficient Computation of Throughput Values of Context-Free Languages.
Proceedings of the Implementation and Application of Automata, 2007

Occurrence and Lexicographic Properties of Standard Sturmian Words.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Tiling Periodicity.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice.
Proceedings of the Implementation and Application of Automata, 2006

The Number of Runs in a String: Improved Analysis of the Linear Upper Bound.
Proceedings of the STACS 2006, 2006

Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Equivalence of Functions Represented by Simple Context-Free Grammars with Output.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
On the complexity of decidable cases of the commutation problem of languages.
Theor. Comput. Sci., 2005

The Structure of Subword Graphs and Suffix Trees of Fibonacci Words.
Proceedings of the Implementation and Application of Automata, 2005

Prime Normal Form and Equivalence of Simple Grammars.
Proceedings of the Implementation and Application of Automata, 2005

2004
Trees with Minimum Weighted Path Length.
Proceedings of the Handbook of Data Structures and Applications., 2004

A First Approach to Finding Common Motifs With Gaps.
Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004

Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
On maximal suffixes, constant-space linear-time versions of KMP algorithm.
Theor. Comput. Sci., 2003

On polynomial-time approximation algorithms for the variable length scheduling problem.
Theor. Comput. Sci., 2003

On special families of morphisms related to [delta]-matching and don't care symbols.
Inf. Process. Lett., 2003

Linear-Time Prime Decomposition Of Regular Prefix Codes.
Int. J. Found. Comput. Sci., 2003

The complexity of compressing subsegments of images described by finite automata.
Discrete Applied Mathematics, 2003

Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique.
Comput. J., 2003

Faster Algorithms for k-Medians in Trees.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Broadcasting Algorithms in Radio Networks with Unknown Topology.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Approximate String Matching with Gaps.
Nord. J. Comput., 2002

Deterministic broadcasting in ad hoc radio networks.
Distributed Computing, 2002

Prime Decompositions of Regular Prefix Codes.
Proceedings of the Implementation and Application of Automata, 2002

Observations on Parallel Computation of Transitive and Max-Closure Problems.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 9th European PVM/MPI Users' Group Meeting, Linz, Austria, September 29, 2002

On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

Three Heuristics for delta-Matching: delta-BM Algorithms.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

Jewels of stringology.
World Scientific, ISBN: 978-981-02-4782-9, 2002

2001
PVM Computation of the Transitive Closure: The Dependency Graph Approach.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2001

The k-Median Problem for Directed Trees.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

On the Complexity of Decidable Cases of Commutation Problem for Languages.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

A Randomized Algorithm for Gossiping in Radio Networks.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata.
Nord. J. Comput., 2000

Deterministic broadcasting in unknown radio networks.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Fast Broadcasting and Gossiping in Radio Networks.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Generalized Factorizations of Words and Their Algorithmic Properties.
Theor. Comput. Sci., 1999

Constant-Space String-Matching in Sublinear Average Time.
Theor. Comput. Sci., 1999

Fast Practical Multi-Pattern Matching.
Inf. Process. Lett., 1999

Efficient Web Searching Using Temporal Factors.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Algorithms on Compressed Strings and Arrays.
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.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Almost Optimal Fully LZW-Compressed Pattern Matching.
Proceedings of the Data Compression Conference, 1999

The Compression of Subsegments of Images Described by Finite Automata.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

Complexity of Language Recognition Problems for Compressed Words.
Proceedings of the Jewels are Forever, 1999

1998
Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages.
Theor. Comput. Sci., 1998

Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns.
Theor. Comput. Sci., 1998

A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching.
SIAM J. Comput., 1998

On the PVM Computations of Transitive Closure and Algebraic Path Problems.
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.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property.
Proceedings of the Algorithms, 1998

1997
Correctness of Constructing Optimal Alphabetic Trees Revisited.
Theor. Comput. Sci., 1997

Constant-Time Randomized Parallel String Matching.
SIAM J. Comput., 1997

An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions.
Nord. J. Comput., 1997

Sequential and Parallel Approximation of Shortest Superstrings.
J. Algorithms, 1997

On the PVM/MPI Computations of Dynamic Programming Recurrences.
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.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1996
Parallel Tree-Contraction and Fibonacci Numbers.
Inf. Process. Lett., 1996

A Simple Randomized Parallel Algorithm for Maximal f-Matchings.
Inf. Process. Lett., 1996

Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract).
Proceedings of the Algorithm Theory, 1996

Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995
Context-Free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm.
Theor. Comput. Sci., 1995

The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching.
Theor. Comput. Sci., 1995

Pattern-Matching for Strings with Short Descriptions
Electronic Colloquium on Computational Complexity (ECCC), 1995

Sqares, Cubes, and Time-Space Efficient String Searching.
Algorithmica, 1995

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

On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

Pattern-Matching for Strings with Short Descriptions.
CPM, 1995

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

1994
Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors.
Theor. Comput. Sci., 1994

On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms.
Theor. Comput. Sci., 1994

Two Results on Linear Embeddings of Complete Binary Trees.
Theor. Comput. Sci., 1994

An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems.
Inf. Process. Lett., 1994

Speeding Up Two String-Matching Algorithms.
Algorithmica, 1994

Parallel and Sequential Approximations of Shortest Superstrings.
Proceedings of the Algorithm Theory, 1994

On a Sublinear Time Parallel Construction of Optimal Binary Search Trees.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

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

1993
Fast recognition of deterministic cfl's with a smaller number of processors.
Theor. Comput. Sci., 1993

Two-Dimensional Pattern Matching by Sampling.
Inf. Process. Lett., 1993

Parallel Construction of Optimal Alphabetic Trees.
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
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's.
Inf. Process. Lett., 1992

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

Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition.
Proceedings of the STACS 92, 1992

Speeding Up Two String-Matching Algorithms.
Proceedings of the STACS 92, 1992

Parallel Recognition and Ranking of Context-Free Languages.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

A Simple Randomized Parallel Algorithm for Maximal f-Matching.
Proceedings of the LATIN '92, 1992

Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms.
Proceedings of the Parallel Image Analysis, Second International Conference, 1992

Polynomial Size Test Sets for Context-Free Languages.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991
On Optimal Parallel Computations for Sequences of Brackets.
Theor. Comput. Sci., 1991

Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays.
Theor. Comput. Sci., 1991

On the Parallel Recognition of Unambiguous Context-Free Languages.
Theor. Comput. Sci., 1991

On the Complexity of the Recognition of Parallel 2D-Image Languages.
Inf. Process. Lett., 1991

Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings.
Inf. Process. Lett., 1991

Efficient Constructions of Test Sets for Regular and Context-Free Languages.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Exact Analysis of Three Tree Contraction Algorithms.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

Analysis of algorithms and data structures.
International computer science series, Addison-Wesley, ISBN: 978-0-201-41693-0, 1991

1990
Optimally Edge-Colouring Outerplanar Graphs is in NC.
Theor. Comput. Sci., 1990

Parallel Computations on Strings and Arrays.
Proceedings of the STACS 90, 1990

Parallel Construction of Minimal Suffix and Factor Automata.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

1989
Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition
Inf. Comput., April, 1989

Parallel Algorithms for a Class of Graphs Generated Recursively.
Inf. Process. Lett., 1989

Optimal Parallel Computations for Halin Graphs.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988
On Efficient Parallel Computations for some Dynamic Programming Problems.
Theor. Comput. Sci., 1988

On Efficient Computations of Costs of Paths on a Grid Graph.
Inf. Process. Lett., 1988

Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs.
Inf. Process. Lett., 1988

Efficient parallel algorithms.
Cambridge University Press, ISBN: 978-0-521-38841-2, 1988

1987
Parallel Time O(log n) Recognition of Unambiguous Context-free Languages
Inf. Comput., April, 1987

Remarks on String-Matching and One-Way Multihead Automata.
Inf. Process. Lett., 1987

Optimal Parallel Parsing of Bracket Languages.
Proceedings of the Parallel Algorithms and Architectures, 1987

A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata.
Proceedings of the Parallel Algorithms and Architectures, 1987

Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs.
Proceedings of the Fundamentals of Computation Theory, 1987

1986
On the Complexity of Parallel Parsing of General Context-Free Languages.
Theor. Comput. Sci., 1986

On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids.
Theor. Comput. Sci., 1986

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

The Space Complexity of the Unique Decipherability Problem.
Inf. Process. Lett., 1986

Unique Deciperability for Partially Commutative Alphabet (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

1985
A Characterization of Reversal-Bounded Multipushdown Machine Languages.
Theor. Comput. Sci., 1985

Fast Recognition of Pushdown Automaton and Context-free Languages
Information and Control, 1985

Parallel time O(log n) recognition of unambiguous CFLs.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
On Linear Context-Free Languages and One-Way Multihead Automata.
Inf. Process. Lett., 1984

On the recognition of context-free languages.
Proceedings of the Computation Theory, 1984

Fast Recognition of Pushdown Automaton and Context-Free Languages.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983
A Simulation Result for Two-Way Pushdown Automata.
Inf. Process. Lett., 1983

Time Complexity of Loop-Free Two-Way Pushdown Automata.
Inf. Process. Lett., 1983

Remarks on the Pyramidal Structure.
Proceedings of the CAAP'83, 1983

1982
Time Complexity of Unambiguous Path Systems.
Inf. Process. Lett., 1982

A Note on Two-Way Nondeterministic Pushdown Automata.
Inf. Process. Lett., 1982

1981
A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata.
Inf. Process. Lett., 1981

Time Complexity of Languages Recognized by One-Way Multihead Pushdown Automata.
Inf. Process. Lett., 1981

The Dynamic Simulation of Recursive and Stack Manipulation Programs.
Inf. Process. Lett., 1981

An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads.
Inf. Process. Lett., 1981

1980
A Correct Preprocessing Algorithm for Boyer-Moore String-Searching.
SIAM J. Comput., 1980

Functional Automata.
Fundam. Inform., 1980

1974
The Dimension of Stability of Stochastic Automata
Information and Control, March, 1974

1973
The Dimension of Strong Stability of Minimal State Stochastic Automata.
Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys., 1973

The Strong Stability Problem for Stochastic Automata.
Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys., 1973


  Loading...