default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWojciech Plandowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j27]Wojciech Plandowski:
On PSPACE generation of a solution set of a word equation and its applications. Theor. Comput. Sci. 792: 20-61 (2019)- [j26]Wojciech Plandowski, Aleksy Schubert
:
On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note). Theor. Comput. Sci. 792: 62-68 (2019) - [c35]Michal Kutwin, Wojciech Plandowski, Artur Zaroda:
Generalized Word Equations: A New Approach to Data Compresion. DCC 2019: 585 - 2016
- [j25]Volker Diekert, Artur Jez, Wojciech Plandowski:
Finding all solutions of equations in free groups and monoids with involution. Inf. Comput. 251: 263-286 (2016) - 2015
- [j24]Robert Dabrowski, Wojciech Plandowski:
Complete Characterization of Zero-expressible Functions. Fundam. Informaticae 138(3): 339-350 (2015) - 2014
- [c34]Volker Diekert, Artur Jez, Wojciech Plandowski:
Finding All Solutions of Equations in Free Groups and Monoids with Involution. CSR 2014: 1-15 - [i1]Volker Diekert, Artur Jez, Wojciech Plandowski:
Finding All Solutions of Equations in Free Groups and Monoids with Involution. CoRR abs/1405.5133 (2014) - 2011
- [j23]Robert Dabrowski, Wojciech Plandowski:
On Word Equations in One Variable. Algorithmica 60(4): 819-828 (2011) - [j22]Markku Laine, Wojciech Plandowski:
Word Equations with One Unknown. Int. J. Found. Comput. Sci. 22(2): 345-375 (2011)
2000 – 2009
- 2009
- [j21]Elena Czeizler, Wojciech Plandowski:
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns. Theor. Comput. Sci. 410(30-32): 2889-2909 (2009) - [j20]Marek Tomasz Biskup, Wojciech Plandowski:
Shortest synchronizing strings for Huffman codes. Theor. Comput. Sci. 410(38-40): 3925-3941 (2009) - [c33]Marek Tomasz Biskup, Wojciech Plandowski:
Guaranteed Synchronization of Huffman Codes with Known Position of Decoder. DCC 2009: 33-42 - [c32]Markku Laine, Wojciech Plandowski:
Word Equations with One Unknown. Developments in Language Theory 2009: 348-359 - 2006
- [c31]Wojciech Plandowski:
An efficient algorithm for solving word equations. STOC 2006: 467-476 - 2005
- [j19]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
On the complexity of decidable cases of the commutation problem of languages. Theor. Comput. Sci. 337(1-3): 105-118 (2005) - 2004
- [j18]Wojciech Plandowski:
Satisfiability of word equations with constants is in PSPACE. J. ACM 51(3): 483-496 (2004) - [c30]Robert Dabrowski, Wojciech Plandowski:
Solving Two-Variable Word Equations (Extended Abstract). ICALP 2004: 408-419 - 2003
- [j17]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
The complexity of compressing subsegments of images described by finite automata. Discret. Appl. Math. 125(2-3): 235-254 (2003) - [j16]Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
On special families of morphisms related to [delta]-matching and don't care symbols. Inf. Process. Lett. 85(5): 227-233 (2003) - [j15]Juhani Karhumäki, Ján Manuch, Wojciech Plandowski:
A defect theorem for bi-infinite words. Theor. Comput. Sci. 292(1): 237-243 (2003) - [c29]Wojciech Plandowski:
Test Sets for Large Families of Languages. Developments in Language Theory 2003: 75-94 - 2002
- [j14]Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. J. Comput. Syst. Sci. 65(2): 332-350 (2002) - [j13]Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski:
Locally Periodic Versus Globally Periodic Infinite Words. J. Comb. Theory A 100(2): 250-264 (2002) - [c28]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
Three Heuristics for delta-Matching: delta-BM Algorithms. CPM 2002: 178-189 - [c27]Robert Dabrowski, Wojciech Plandowski:
On Word Equations in One Variable. MFCS 2002: 212-220 - 2001
- [c26]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Decidable Cases of Commutation Problem for Languages. FCT 2001: 193-203 - 2000
- [j12]Lucian Ilie, Wojciech Plandowski:
Two-variable word equations. RAIRO Theor. Informatics Appl. 34(6): 467-501 (2000) - [j11]Juhani Karhumäki, Filippo Mignosi, Wojciech Plandowski:
The expressibility of languages and relations by word equations. J. ACM 47(3): 483-505 (2000) - [j10]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata. Nord. J. Comput. 7(1): 1-13 (2000) - [j9]Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski:
Algorithms for the parallel alternating direction access machine. Theor. Comput. Sci. 245(2): 151-173 (2000) - [c25]Lucian Ilie, Wojciech Plandowski:
Two-Variable Word Equations. STACS 2000: 122-132
1990 – 1999
- 1999
- [j8]Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
Fast Practical Multi-Pattern Matching. Inf. Process. Lett. 71(3-4): 107-113 (1999) - [j7]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Generalized Factorizations of Words and Their Algorithmic Properties. Theor. Comput. Sci. 218(1): 123-133 (1999) - [c24]Wojciech Plandowski, Wojciech Rytter:
Complexity of Language Recognition Problems for Compressed Words. Jewels are Forever 1999: 262-272 - [c23]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
The Compression of Subsegments of Images Described by Finite Automata. CPM 1999: 186-195 - [c22]Juhani Karhumäki, Wojciech Plandowski:
On the complexity of computing the order of repetition of a string. Developments in Language Theory 1999: 178-184 - [c21]Wojciech Plandowski:
Satisfiability of Word Equations with Constants is in PSPACE. FOCS 1999: 495-500 - [c20]Wojciech Plandowski:
Satisfiability of Word Equations with Constants is in NEXPTIME. STOC 1999: 721-725 - 1998
- [c19]Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski:
Locally Periodic Infinite Words and a Chaotic Behaviour. ICALP 1998: 421-430 - [c18]Wojciech Plandowski, Wojciech Rytter:
Application of Lempel-Ziv Encodings to the Solution of Words Equations. ICALP 1998: 731-742 - [c17]Juhani Karhumäki, Ján Manuch, Wojciech Plandowski:
On Defect Effect of Bi-Infinite Words. MFCS 1998: 674-682 - 1997
- [j6]Tero Harju, Juhani Karhumäki, Wojciech Plandowski:
Compactness of Systems of Equations in Semigroups. Int. J. Algebra Comput. 7(4): 457-470 (1997) - [c16]Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. CPM 1997: 40-51 - [c15]Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi:
A lower bound for a constant in Shallit's conjecture. Developments in Language Theory 1997: 103-118 - [c14]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. FCT 1997: 245-256 - [c13]Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi:
The Expressibility of Languages and Relations by Word Equations. ICALP 1997: 98-109 - 1996
- [j5]Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha:
Parallel Tree-Contraction and Fibonacci Numbers. Inf. Process. Lett. 59(5): 267-271 (1996) - [j4]Juhani Karhumäki, Wojciech Plandowski:
On the Size of Independent Systems of Equations in Semigroups. Theor. Comput. Sci. 168(1): 105-119 (1996) - [c12]Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter:
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). CPM 1996: 39-49 - [c11]Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski:
Parallel Alternating-Direction Access Machine. MFCS 1996: 267-278 - [c10]Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter:
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). SWAT 1996: 392-403 - 1995
- [j3]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Polynomial Size Test Sets for Context-Free Languages. J. Comput. Syst. Sci. 50(1): 11-19 (1995) - [j2]Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter:
The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching. Theor. Comput. Sci. 147(1&2): 19-30 (1995) - [c9]Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter:
Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling. CPM 1995: 78-89 - [c8]Tero Harju, Juhani Karhumäki, Wojciech Plandowski:
Compactness of Systems of Equations in Semigroups. ICALP 1995: 444-454 - [c7]Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter:
Two-Dimensional Pattern Matching in Linear Time and Small Space. STACS 1995: 181-192 - [c6]Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski:
Work-time-optimal parallel algorithms for string problems. STOC 1995: 713-722 - 1994
- [j1]Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
Speeding Up Two String-Matching Algorithms. Algorithmica 12(4/5): 247-267 (1994) - [c5]Wojciech Plandowski:
Testing Equivalence of Morphisms on Context-Free Languages. ESA 1994: 460-470 - [c4]Juhani Karhumäki, Wojciech Plandowski:
On the Size of Independent Systems of Equations in Semigroups. MFCS 1994: 443-452 - [p1]Juhani Karhumäki, Wojciech Plandowski:
On the Defect Effect of Many Identities in Free Semigroups. Mathematical Aspects of Natural and Formal Languages 1994: 225-232 - 1992
- [c3]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Polynomial Size Test Sets for Context-Free Languages. ICALP 1992: 53-64 - [c2]Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter:
Speeding Up Two String-Matching Algorithms. STACS 1992: 589-600 - 1991
- [c1]Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha:
Exact Analysis of Three Tree Contraction Algorithms. FCT 1991: 370-379
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
