The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wojciech Plandowski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wojciech Plandowski, Wojciech Rytter
    Complexity of Language Recognition Problems for Compressed Words. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:262-272 [Conf]
  2. Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Three Heuristics for delta-Matching: delta-BM Algorithms. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:178-189 [Conf]
  3. Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
    On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. [Citation Graph (0, 0)][DBLP]
    CPM, 1997, pp:40-51 [Conf]
  4. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
    The Compression of Subsegments of Images Described by Finite Automata. [Citation Graph (0, 0)][DBLP]
    CPM, 1999, pp:186-195 [Conf]
  5. Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
    Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:39-49 [Conf]
  6. Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
    Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:78-89 [Conf]
  7. Juhani Karhumäki, Wojciech Plandowski
    On the complexity of computing the order of repetition of a string. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:178-184 [Conf]
  8. Wojciech Plandowski
    Test Sets for Large Families of Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:75-94 [Conf]
  9. Wojciech Plandowski
    Testing Equivalence of Morphisms on Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:460-470 [Conf]
  10. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
    On the Complexity of Decidable Cases of Commutation Problem for Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:193-203 [Conf]
  11. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
    Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:245-256 [Conf]
  12. Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha
    Exact Analysis of Three Tree Contraction Algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:370-379 [Conf]
  13. Wojciech Plandowski
    Satisfiability of Word Equations with Constants is in PSPACE. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:495-500 [Conf]
  14. Robert Dabrowski, Wojciech Plandowski
    Solving Two-Variable Word Equations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:408-419 [Conf]
  15. Tero Harju, Juhani Karhumäki, Wojciech Plandowski
    Compactness of Systems of Equations in Semigroups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:444-454 [Conf]
  16. Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski
    Locally Periodic Infinite Words and a Chaotic Behaviour. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:421-430 [Conf]
  17. Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi
    The Expressibility of Languages and Relations by Word Equations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:98-109 [Conf]
  18. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
    Polynomial Size Test Sets for Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:53-64 [Conf]
  19. Wojciech Plandowski, Wojciech Rytter
    Application of Lempel-Ziv Encodings to the Solution of Words Equations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:731-742 [Conf]
  20. Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
    Parallel Alternating-Direction Access Machine. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:267-278 [Conf]
  21. Robert Dabrowski, Wojciech Plandowski
    On Word Equations in One Variable. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:212-220 [Conf]
  22. Juhani Karhumäki, Ján Manuch, Wojciech Plandowski
    On Defect Effect of Bi-Infinite Words. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:674-682 [Conf]
  23. Juhani Karhumäki, Wojciech Plandowski
    On the Size of Independent Systems of Equations in Semigroups. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:443-452 [Conf]
  24. Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
    Two-Dimensional Pattern Matching in Linear Time and Small Space. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:181-192 [Conf]
  25. Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter
    Speeding Up Two String-Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:589-600 [Conf]
  26. Lucian Ilie, Wojciech Plandowski
    Two-Variable Word Equations. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:122-132 [Conf]
  27. Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski
    Work-time-optimal parallel algorithms for string problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:713-722 [Conf]
  28. Wojciech Plandowski
    An efficient algorithm for solving word equations. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:467-476 [Conf]
  29. Wojciech Plandowski
    Satisfiability of Word Equations with Constants is in NEXPTIME. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:721-725 [Conf]
  30. Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
    Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:392-403 [Conf]
  31. Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Speeding Up Two String-Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:4/5, pp:247-267 [Journal]
  32. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
    The complexity of compressing subsegments of images described by finite automata. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:125, n:2-3, pp:235-254 [Journal]
  33. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:5, pp:227-233 [Journal]
  34. Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Fast Practical Multi-Pattern Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:3-4, pp:107-113 [Journal]
  35. Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha
    Parallel Tree-Contraction and Fibonacci Numbers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:5, pp:267-271 [Journal]
  36. Lucian Ilie, Wojciech Plandowski
    Two-variable word equations. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:6, pp:467-501 [Journal]
  37. Juhani Karhumäki, Filippo Mignosi, Wojciech Plandowski
    The expressibility of languages and relations by word equations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:3, pp:483-505 [Journal]
  38. Wojciech Plandowski
    Satisfiability of word equations with constants is in PSPACE. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:3, pp:483-496 [Journal]
  39. Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
    On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:2, pp:332-350 [Journal]
  40. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
    Polynomial Size Test Sets for Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:1, pp:11-19 [Journal]
  41. Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski
    Locally Periodic Versus Globally Periodic Infinite Words. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:100, n:2, pp:250-264 [Journal]
  42. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
    Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:1, pp:1-13 [Journal]
  43. Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
    Algorithms for the parallel alternating direction access machine. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:245, n:2, pp:151-173 [Journal]
  44. Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
    The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:19-30 [Journal]
  45. Juhani Karhumäki, Ján Manuch, Wojciech Plandowski
    A defect theorem for bi-infinite words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:237-243 [Journal]
  46. Juhani Karhumäki, Wojciech Plandowski
    On the Size of Independent Systems of Equations in Semigroups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:168, n:1, pp:105-119 [Journal]
  47. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
    On the complexity of decidable cases of the commutation problem of languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:105-118 [Journal]
  48. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
    Generalized Factorizations of Words and Their Algorithmic Properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:218, n:1, pp:123-133 [Journal]

  49. Guaranteed Synchronization of Huffman Codes with Known Position of Decoder. [Citation Graph (, )][DBLP]


  50. A lower bound for a constant in Shallit's conjecture. [Citation Graph (, )][DBLP]


  51. Word Equations with One Unknown. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002