@inproceedings{conf/dlt/KarhumakiPM97, title = {A lower bound for a constant in Shallit's conjecture.}, author = {Juhani Karhumäki and Wojciech Plandowski and Filippo Mignosi}, booktitle = {Developments in Language Theory}, crossref = {conf/dlt/1997}, editor = {Symeon Bozapalidis}, pages = {103-118}, publisher = {Aristotle University of Thessaloniki}, url = {http://dblp.uni-trier.de/db/conf/dlt/dlt1997.html#KarhumakiPM97}, year = {1997}, biburl = {http://www.bibsonomy.org/bibtex/220519e76d6f0824ad1a546b5d75ed955/dblp}, description = {dblp}, date = {2008-05-20}, keywords = {dblp } } @inproceedings{conf/stoc/Plandowski06, title = {An efficient algorithm for solving word equations.}, author = {Wojciech Plandowski}, booktitle = {STOC}, crossref = {conf/stoc/2006}, editor = {Jon M. Kleinberg}, pages = {467-476}, publisher = {ACM}, url = {http://dblp.uni-trier.de/db/conf/stoc/stoc2006.html#Plandowski06}, year = {2006}, biburl = {http://www.bibsonomy.org/bibtex/27a22e59be5466bfa7adf4049f601bf50/dblp}, description = {dblp}, ee = {http://doi.acm.org/10.1145/1132516.1132584}, isbn = {1-59593-134-1}, date = {2006-09-28}, keywords = {dblp } } @article{journals/jacm/Plandowski04, title = {Satisfiability of word equations with constants is in PSPACE.}, author = {Wojciech Plandowski}, journal = {J. ACM}, number = {3}, pages = {483-496}, url = {http://dblp.uni-trier.de/db/journals/jacm/jacm51.html#Plandowski04}, volume = {51}, year = {2004}, biburl = {http://www.bibsonomy.org/bibtex/2c923e4c04bfd9c4b940dd706bc1c703f/dblp}, description = {dblp}, ee = {http://doi.acm.org/10.1145/990308.990312}, date = {2006-02-09}, keywords = {dblp } } @inproceedings{conf/icalp/DabrowskiP04, title = {Solving Two-Variable Word Equations (Extended Abstract).}, author = {Robert Dabrowski and Wojciech Plandowski}, booktitle = {ICALP}, crossref = {conf/icalp/2004}, editor = {Josep Díaz and Juhani Karhumäki and Arto Lepistö and Donald Sannella}, pages = {408-419}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, url = {http://dblp.uni-trier.de/db/conf/icalp/icalp2004.html#DabrowskiP04}, volume = {3142}, year = {2004}, biburl = {http://www.bibsonomy.org/bibtex/2c71ead2d5a13222e798802f7a4e25f73/dblp}, description = {dblp}, ee = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3142&spage=408}, isbn = {3-540-22849-7}, date = {2005-08-05}, keywords = {dblp } } @article{journals/tcs/KarhumakiPR05, title = {On the complexity of decidable cases of the commutation problem of languages.}, author = {Juhani Karhumäki and Wojciech Plandowski and Wojciech Rytter}, journal = {Theor. Comput. Sci.}, number = {1-3}, pages = {105-118}, url = {http://dblp.uni-trier.de/db/journals/tcs/tcs337.html#KarhumakiPR05}, volume = {337}, year = {2005}, biburl = {http://www.bibsonomy.org/bibtex/2828a73fb5646026538d32e88c0f2d198/dblp}, description = {dblp}, ee = {http://dx.doi.org/10.1016/j.tcs.2004.03.073}, date = {2005-07-19}, keywords = {dblp } } @article{journals/jct/KarhumakiLP02, title = {Locally Periodic Versus Globally Periodic Infinite Words.}, author = {Juhani Karhumäki and Arto Lepistö and Wojciech Plandowski}, journal = {J. Comb. Theory, Ser. A}, number = {2}, pages = {250-264}, url = {http://dblp.uni-trier.de/db/journals/jct/jcta100.html#KarhumakiLP02}, volume = {100}, year = {2002}, biburl = {http://www.bibsonomy.org/bibtex/21d1b50e95516311dc106eeda7845c540/dblp}, description = {dblp}, ee = {http://dx.doi.org/10.1006/jcta.2002.3292}, date = {2004-06-01}, keywords = {dblp } } @article{journals/ita/IlieP00, title = {Two-variable word equations.}, author = {Lucian Ilie and Wojciech Plandowski}, journal = {ITA}, number = {6}, pages = {467-501}, url = {http://dblp.uni-trier.de/db/journals/ita/ita34.html#IlieP00}, volume = {34}, year = {2000}, biburl = {http://www.bibsonomy.org/bibtex/2b67b748b24042abc2286ac3a105191fb/dblp}, description = {dblp}, ee = {http://dx.doi.org/10.1051/ita:2000126}, date = {2004-02-16}, keywords = {dblp } } @article{journals/njc/KarhumakiPR00, title = {Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata.}, author = {Juhani Karhumäki and Wojciech Plandowski and Wojciech Rytter}, journal = {Nord. J. Comput.}, number = {1}, pages = {1-13}, url = {http://dblp.uni-trier.de/db/journals/njc/njc7.html#KarhumakiPR00}, volume = {7}, year = {2000}, biburl = {http://www.bibsonomy.org/bibtex/249973d84dca8a6f9670c01feed48e2cd/dblp}, description = {dblp}, date = {2004-01-14}, keywords = {dblp } } @inproceedings{conf/dlt/KarhumakiP99, title = {On the complexity of computing the order of repetition of a string.}, author = {Juhani Karhumäki and Wojciech Plandowski}, booktitle = {Developments in Language Theory}, crossref = {conf/dlt/1999}, editor = {Grzegorz Rozenberg and Wolfgang Thomas}, pages = {178-184}, publisher = {World Scientific}, url = {http://dblp.uni-trier.de/db/conf/dlt/dlt1999.html#KarhumakiP99}, year = {1999}, biburl = {http://www.bibsonomy.org/bibtex/225325f3d2fd664796ac3155835e5fabc/dblp}, description = {dblp}, isbn = {981-02-4380-4}, date = {2003-12-17}, keywords = {dblp } } @article{journals/ipl/ColeILPR03, title = {On special families of morphisms related to [delta]-matching and don't care symbols.}, author = {Richard Cole and Costas S. Iliopoulos and Thierry Lecroq and Wojciech Plandowski and Wojciech Rytter}, journal = {Inf. Process. Lett.}, number = {5}, pages = {227-233}, url = {http://dblp.uni-trier.de/db/journals/ipl/ipl85.html#ColeILPR03}, volume = {85}, year = {2003}, biburl = {http://www.bibsonomy.org/bibtex/2232d55ef5f605108677b03b8c0779816/dblp}, description = {dblp}, ee = {http://dx.doi.org/10.1016/S0020-0190(02)00430-1}, date = {2003-11-24}, keywords = {dblp } }