dblp.uni-trier.dewww.uni-trier.de

Wojciech Plandowski Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
53EEMarek Tomasz Biskup, Wojciech Plandowski: Guaranteed Synchronization of Huffman Codes with Known Position of Decoder. DCC 2009: 33-42
52EEMarkku Laine, Wojciech Plandowski: Word Equations with One Unknown. Developments in Language Theory 2009: 348-359
51EEElena 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)
50EEMarek Tomasz Biskup, Wojciech Plandowski: Shortest synchronizing strings for Huffman codes. Theor. Comput. Sci. 410(38-40): 3925-3941 (2009)
2006
49EEWojciech Plandowski: An efficient algorithm for solving word equations. STOC 2006: 467-476
2005
48EEJuhani 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
47EERobert Dabrowski, Wojciech Plandowski: Solving Two-Variable Word Equations (Extended Abstract). ICALP 2004: 408-419
46EEWojciech Plandowski: Satisfiability of word equations with constants is in PSPACE. J. ACM 51(3): 483-496 (2004)
2003
45EEWojciech Plandowski: Test Sets for Large Families of Languages. Developments in Language Theory 2003: 75-94
44 Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: The complexity of compressing subsegments of images described by finite automata. Discrete Applied Mathematics 125(2-3): 235-254 (2003)
43EERichard 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)
42 Juhani Karhumäki, Ján Manuch, Wojciech Plandowski: A defect theorem for bi-infinite words. Theor. Comput. Sci. 292(1): 237-243 (2003)
2002
41EEMaxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter: Three Heuristics for delta-Matching: delta-BM Algorithms. CPM 2002: 178-189
40EERobert Dabrowski, Wojciech Plandowski: On Word Equations in One Variable. MFCS 2002: 212-220
39EEJuhani Karhumäki, Arto Lepistö, Wojciech Plandowski: Locally Periodic Versus Globally Periodic Infinite Words. J. Comb. Theory, Ser. A 100(2): 250-264 (2002)
38EEPiotr 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)
2001
37EEJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: On the Complexity of Decidable Cases of Commutation Problem for Languages. FCT 2001: 193-203
2000
36EELucian Ilie, Wojciech Plandowski: Two-Variable Word Equations. STACS 2000: 122-132
35EELucian Ilie, Wojciech Plandowski: Two-variable word equations. ITA 34(6): 467-501 (2000)
34EEJuhani Karhumäki, Filippo Mignosi, Wojciech Plandowski: The expressibility of languages and relations by word equations. J. ACM 47(3): 483-505 (2000)
33 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)
32EEBogdan 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)
1999
31EEJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: The Compression of Subsegments of Images Described by Finite Automata. CPM 1999: 186-195
30 Juhani Karhumäki, Wojciech Plandowski: On the complexity of computing the order of repetition of a string. Developments in Language Theory 1999: 178-184
29EEWojciech Plandowski: Satisfiability of Word Equations with Constants is in PSPACE. FOCS 1999: 495-500
28 Wojciech Plandowski, Wojciech Rytter: Complexity of Language Recognition Problems for Compressed Words. Jewels are Forever 1999: 262-272
27EEWojciech Plandowski: Satisfiability of Word Equations with Constants is in NEXPTIME. STOC 1999: 721-725
26EEMaxime 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)
25EEJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: Generalized Factorizations of Words and Their Algorithmic Properties. Theor. Comput. Sci. 218(1): 123-133 (1999)
1998
24EEJuhani Karhumäki, Arto Lepistö, Wojciech Plandowski: Locally Periodic Infinite Words and a Chaotic Behaviour. ICALP 1998: 421-430
23EEWojciech Plandowski, Wojciech Rytter: Application of Lempel-Ziv Encodings to the Solution of Words Equations. ICALP 1998: 731-742
22EEJuhani Karhumäki, Ján Manuch, Wojciech Plandowski: On Defect Effect of Bi-Infinite Words. MFCS 1998: 674-682
1997
21 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
20 Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi: A lower bound for a constant in Shallit's conjecture. Developments in Language Theory 1997: 103-118
19 Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. FCT 1997: 245-256
18EEJuhani Karhumäki, Wojciech Plandowski, Filippo Mignosi: The Expressibility of Languages and Relations by Word Equations. ICALP 1997: 98-109
1996
17 Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter: Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). CPM 1996: 39-49
16EEBogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski: Parallel Alternating-Direction Access Machine. MFCS 1996: 267-278
15EELeszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter: Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). SWAT 1996: 392-403
14EEWojciech Plandowski, Wojciech Rytter, Tomasz Szymacha: Parallel Tree-Contraction and Fibonacci Numbers. Inf. Process. Lett. 59(5): 267-271 (1996)
13EEJuhani Karhumäki, Wojciech Plandowski: On the Size of Independent Systems of Equations in Semigroups. Theor. Comput. Sci. 168(1): 105-119 (1996)
1995
12 Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter: Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling. CPM 1995: 78-89
11EETero Harju, Juhani Karhumäki, Wojciech Plandowski: Compactness of Systems of Equations in Semigroups. ICALP 1995: 444-454
10EEMaxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter: Two-Dimensional Pattern Matching in Linear Time and Small Space. STACS 1995: 181-192
9EEArtur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski: Work-time-optimal parallel algorithms for string problems. STOC 1995: 713-722
8 Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: Polynomial Size Test Sets for Context-Free Languages. J. Comput. Syst. Sci. 50(1): 11-19 (1995)
7EELeszek 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)
1994
6EEWojciech Plandowski: Testing Equivalence of Morphisms on Context-Free Languages. ESA 1994: 460-470
5EEJuhani Karhumäki, Wojciech Plandowski: On the Size of Independent Systems of Equations in Semigroups. MFCS 1994: 443-452
4 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)
1992
3EEJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: Polynomial Size Test Sets for Context-Free Languages. ICALP 1992: 53-64
2EEMaxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter: Speeding Up Two String-Matching Algorithms. STACS 1992: 589-600
1991
1 Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha: Exact Analysis of Three Tree Contraction Algorithms. FCT 1991: 370-379

Coauthor Index

1Piotr Berman [21] [38]
2Marek Tomasz Biskup [50] [53]
3Bogdan S. Chlebus [16] [32]
4Richard Cole [43]
5Maxime Crochemore [2] [4] [10] [26] [41]
6Elena Czeizler (Elena Petre) [51]
7Artur Czumaj [2] [4] [9] [16] [26] [32]
8Robert Dabrowski [40] [47]
9Zvi Galil [9]
10Leszek Gasieniec [2] [4] [7] [9] [10] [12] [15] [16] [17] [26] [32]
11Tero Harju [11]
12Lucian Ilie [35] [36]
13Costas S. Iliopoulos [41] [43]
14Stefan Jarominek [2] [4]
15Juhani Karhumäki [3] [5] [8] [11] [13] [18] [19] [20] [22] [24] [25] [30] [31] [33] [34] [37] [39] [42] [44] [48]
16Marek Karpinski [15] [17] [21] [38]
17Miroslaw Kowaluk [16] [32]
18Markku Laine [52]
19Lawrence L. Larmore [21] [38]
20Thierry Lecroq [2] [4] [26] [41] [43]
21Arto Lepistö [24] [39]
22Ján Manuch [22] [42]
23Filippo Mignosi [18] [20] [34]
24Kunsoo Park [9]
25Wojciech Rytter [1] [2] [3] [4] [7] [8] [10] [12] [14] [15] [17] [19] [21] [23] [25] [26] [28] [31] [33] [37] [38] [41] [43] [44] [48]
26Tomasz Szymacha [1] [14]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)