Wojciech Plandowski

According to our database1, Wojciech Plandowski authored at least 51 papers between 1991 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note).
Theor. Comput. Sci., 2019

On <i>PSPACE</i> generation of a solution set of a word equation and its applications.
Theor. Comput. Sci., 2019

Generalized Word Equations: A New Approach to Data Compresion.
Proceedings of the Data Compression Conference, 2019

2016
Finding all solutions of equations in free groups and monoids with involution.
Inf. Comput., 2016

2015
Complete Characterization of Zero-expressible Functions.
Fundam. Informaticae, 2015

2011
Word Equations with One Unknown.
Int. J. Found. Comput. Sci., 2011

On Word Equations in One Variable.
Algorithmica, 2011

2009
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns.
Theor. Comput. Sci., 2009

Shortest synchronizing strings for Huffman codes.
Theor. Comput. Sci., 2009

Guaranteed Synchronization of Huffman Codes with Known Position of Decoder.
Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

2006
An efficient algorithm for solving word equations.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

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

2004
Satisfiability of word equations with constants is in PSPACE.
J. ACM, 2004

Solving Two-Variable Word Equations (Extended Abstract).
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
A defect theorem for bi-infinite words.
Theor. Comput. Sci., 2003

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

The complexity of compressing subsegments of images described by finite automata.
Discret. Appl. Math., 2003

Test Sets for Large Families of Languages.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Locally Periodic Versus Globally Periodic Infinite Words.
J. Comb. Theory A, 2002

On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts.
J. Comput. Syst. Sci., 2002

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

2000
Algorithms for the parallel alternating direction access machine.
Theor. Comput. Sci., 2000

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

The expressibility of languages and relations by word equations.
J. ACM, 2000

Two-variable word equations.
RAIRO Theor. Informatics Appl., 2000

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

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

Satisfiability of Word Equations with Constants is in NEXPTIME.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

On the complexity of computing the order of repetition of a string.
Proceedings of the Developments in Language Theory, 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
On Defect Effect of Bi-Infinite Words.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Application of Lempel-Ziv Encodings to the Solution of Words Equations.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Locally Periodic Infinite Words and a Chaotic Behaviour.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Compactness of Systems of Equations in Semigroups.
Int. J. Algebra Comput., 1997

Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

A lower bound for a constant in Shallit's conjecture.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996
On the Size of Independent Systems of Equations in Semigroups.
Theor. Comput. Sci., 1996

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

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

Parallel Alternating-Direction Access Machine.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

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

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

Polynomial Size Test Sets for Context-Free Languages.
J. Comput. Syst. Sci., 1995

Work-time-optimal parallel algorithms for string problems.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Two-Dimensional Pattern Matching in Linear Time and Small Space.
Proceedings of the STACS 95, 1995

Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling.
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994
Speeding Up Two String-Matching Algorithms.
Algorithmica, 1994

Testing Equivalence of Morphisms on Context-Free Languages.
Proceedings of the Algorithms, 1994

On the Defect Effect of Many Identities in Free Semigroups.
Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994

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


  Loading...