The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Wojciech Rytter: [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. Wojciech Rytter
    Remarks on the Pyramidal Structure. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:367-376 [Conf]
  3. Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
    A Randomized Algorithm for Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:483-492 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. Marek Karpinski, Wojciech Rytter
    An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:125-135 [Conf]
  8. 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]
  9. 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]
  10. Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
    Pattern-Matching for Strings with Short Descriptions. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:205-214 [Conf]
  11. Wojciech Rytter
    Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:20-31 [Conf]
  12. Leszek Gasieniec, Wojciech Rytter
    Almost Optimal Fully LZW-Compressed Pattern Matching. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1999, pp:316-325 [Conf]
  13. Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
    Equivalence of Functions Represented by Simple Context-Free Grammars with Output. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:71-82 [Conf]
  14. Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
    Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:43-54 [Conf]
  15. Alan Gibbons, Wojciech Rytter
    Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:155-162 [Conf]
  16. 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]
  17. 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]
  18. Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha
    Exact Analysis of Three Tree Contraction Algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:370-379 [Conf]
  19. Wojciech Rytter
    Parallel time O(log n) recognition of unambiguous CFLs. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:380-389 [Conf]
  20. Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
    Fast Broadcasting and Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:575-581 [Conf]
  21. Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter
    Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:248-258 [Conf]
  22. Artur Czumaj, Wojciech Rytter
    Broadcasting Algorithms in Radio Networks with Unknown Topology. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:492-501 [Conf]
  23. Alan Gibbons, Wojciech Rytter
    An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:453-469 [Conf]
  24. Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter
    Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:204-214 [Conf]
  25. 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]
  26. 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]
  27. Wojciech Rytter
    Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:15-27 [Conf]
  28. Maxime Crochemore, Wojciech Rytter
    Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    ICPIA, 1992, pp:100-112 [Conf]
  29. Maxime Crochemore, Wojciech Rytter
    On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:220-229 [Conf]
  30. Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
    A Simple Randomized Parallel Algorithm for Maximal f-Matching. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:165-176 [Conf]
  31. Wojciech Rytter
    On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:196-208 [Conf]
  32. Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
    Faster Algorithms for k-Medians in Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:218-227 [Conf]
  33. Bogdan S. Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha
    Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:185-195 [Conf]
  34. Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
    The k-Median Problem for Directed Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:260-271 [Conf]
  35. Marek Chrobak, Wojciech Rytter
    Unique Deciperability for Partially Commutative Alphabet (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:256-263 [Conf]
  36. Maxime Crochemore, Wojciech Rytter
    Parallel Construction of Minimal Suffix and Factor Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:217-223 [Conf]
  37. Krzysztof Diks, Torben Hagerup, Wojciech Rytter
    Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:207-217 [Conf]
  38. Leszek Gasieniec, Alan Gibbons, Wojciech Rytter
    Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:48-58 [Conf]
  39. Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek
    Efficient Constructions of Test Sets for Regular and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:249-258 [Conf]
  40. Marek Karpinski, Wojciech Rytter
    On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:453-461 [Conf]
  41. Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter
    Parallel Recognition and Ranking of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:24-36 [Conf]
  42. Slawomir Lasota, Wojciech Rytter
    Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:646-657 [Conf]
  43. Wojciech Rytter
    Fast Recognition of Pushdown Automaton and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:507-515 [Conf]
  44. Krzysztof Diks, Wojciech Rytter
    Optimal Parallel Computations for Halin Graphs. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:266-273 [Conf]
  45. Wojciech Rytter
    A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms and Architectures, 1987, pp:138-145 [Conf]
  46. Wojciech Rytter, Raffaele Giancarlo
    Optimal Parallel Parsing of Bracket Languages. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms and Architectures, 1987, pp:146-154 [Conf]
  47. Vassil Alexandrow, Ken Chan, Alan Gibbons, Wojciech Rytter
    On the PVM/MPI Computations of Dynamic Programming Recurrences. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 1997, pp:305-312 [Conf]
  48. Ken J. Chan, Alan Gibbons, Marcelo Pias, Wojciech Rytter
    On the PVM Computations of Transitive Closure and Algebraic Path Problems. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 1998, pp:338-345 [Conf]
  49. Aris Pagourtzis, Igor Potapov, Wojciech Rytter
    PVM Computation of the Transitive Closure: The Dependency Graph Approach. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2001, pp:249-256 [Conf]
  50. Aris Pagourtzis, Igor Potapov, Wojciech Rytter
    Observations on Parallel Computation of Transitive and Max-Closure Problems. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2002, pp:217-225 [Conf]
  51. Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
    Deterministic broadcasting in unknown radio networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:861-870 [Conf]
  52. Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
    Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:36-41 [Conf]
  53. Wojciech Rytter
    Algorithms on Compressed Strings and Arrays. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1999, pp:48-65 [Conf]
  54. Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter
    Parallel Construction of Optimal Alphabetic Trees. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:214-223 [Conf]
  55. 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]
  56. 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]
  57. Maxime Crochemore, Wojciech Rytter
    Parallel Computations on Strings and Arrays. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:109-125 [Conf]
  58. Lawrence L. Larmore, Wojciech Rytter
    Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:121-132 [Conf]
  59. Wojciech Rytter
    The Number of Runs in a String: Improved Analysis of the Linear Upper Bound. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:184-195 [Conf]
  60. Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot
    A First Approach to Finding Common Motifs With Gaps. [Citation Graph (0, 0)][DBLP]
    Stringology, 2004, pp:88-97 [Conf]
  61. Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
    Parallel and Sequential Approximations of Shortest Superstrings. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:95-106 [Conf]
  62. 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]
  63. Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
    Efficient Web Searching Using Temporal Factors. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:294-305 [Conf]
  64. Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
    Prime Normal Form and Equivalence of Simple Grammars. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:78-89 [Conf]
  65. Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter
    Prime Decompositions of Regular Prefix Codes. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:85-94 [Conf]
  66. Wojciech Rytter
    The Structure of Subword Graphs and Suffix Trees of Fibonacci Words. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:250-261 [Conf]
  67. Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
    Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:90-101 [Conf]
  68. 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]
  69. Maxime Crochemore, Wojciech Rytter
    Sqares, Cubes, and Time-Space Efficient String Searching. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:5, pp:405-425 [Journal]
  70. Wojciech Rytter
    The Strong Stability Problem for Stochastic Automata. [Citation Graph (0, 0)][DBLP]
    Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys., 1973, v:21, n:3, pp:- [Journal]
  71. Wojciech Rytter
    The Dimension of Strong Stability of Minimal State Stochastic Automata. [Citation Graph (0, 0)][DBLP]
    Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys., 1973, v:21, n:3, pp:- [Journal]
  72. Alan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter
    Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2003, v:46, n:4, pp:391-400 [Journal]
  73. 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]
  74. Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
    Deterministic broadcasting in ad hoc radio networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2002, v:15, n:1, pp:27-38 [Journal]
  75. Wojciech Rytter
    Functional Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1980, v:3, n:1, pp:37-44 [Journal]
  76. Wojciech Rytter
    The Dimension of Stability of Stochastic Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1974, v:24, n:3, pp:201-211 [Journal]
  77. Wojciech Rytter
    Fast Recognition of Pushdown Automaton and Context-free Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:67, n:1-3, pp:12-22 [Journal]
  78. Wojciech Rytter
    Parallel Time O(log n) Recognition of Unambiguous Context-free Languages [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:73, n:1, pp:75-86 [Journal]
  79. Alan Gibbons, Wojciech Rytter
    Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:81, n:1, pp:32-45 [Journal]
  80. Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter
    Linear-Time Prime Decomposition Of Regular Prefix Codes. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:1019-1032 [Journal]
  81. Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot
    A first approach to finding common motifs with gaps. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1145-1154 [Journal]
  82. Wojciech Rytter, Ahmed Saoudi
    On Parallel Recognition of Two Classes of 2-D Array Patterns. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 1992, v:6, n:2&3, pp:293-299 [Journal]
  83. Marek Chrobak, Wojciech Rytter
    Remarks on String-Matching and One-Way Multihead Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:325-329 [Journal]
  84. 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]
  85. 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]
  86. Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter
    Two-Dimensional Pattern Matching by Sampling. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:4, pp:159-162 [Journal]
  87. Maxime Crochemore, Wojciech Rytter
    Parallel Construction of Minimal Suffix and Factor Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:3, pp:121-128 [Journal]
  88. Maxime Crochemore, Wojciech Rytter
    Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:2, pp:57-60 [Journal]
  89. Alan Gibbons, Amos Israeli, Wojciech Rytter
    Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:1, pp:43-51 [Journal]
  90. Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
    A Simple Randomized Parallel Algorithm for Maximal f-Matchings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:2, pp:83-87 [Journal]
  91. Lawrence L. Larmore, Wojciech Rytter
    An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:1, pp:31-34 [Journal]
  92. 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]
  93. Wojciech Rytter
    On Efficient Computations of Costs of Paths on a Grid Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:2, pp:71-74 [Journal]
  94. Wojciech Rytter
    A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:2, pp:103-109 [Journal]
  95. Peter Rossmanith, Wojciech Rytter
    Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:5, pp:267-272 [Journal]
  96. Wojciech Rytter, Tomasz Szymacha
    Parallel Algorithms for a Class of Graphs Generated Recursively. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:5, pp:225-231 [Journal]
  97. Wojciech Rytter, Ahmed Saoudi
    On the Complexity of the Recognition of Parallel 2D-Image Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:5, pp:225-229 [Journal]
  98. Wojciech Rytter
    An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-Driven Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:2, pp:81-84 [Journal]
  99. Wojciech Rytter
    An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:234-236 [Journal]
  100. Wojciech Rytter
    The Dynamic Simulation of Recursive and Stack Manipulation Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:2, pp:58-63 [Journal]
  101. Wojciech Rytter
    Time Complexity of Languages Recognized by One-Way Multihead Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:142-144 [Journal]
  102. Wojciech Rytter
    A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:145-146 [Journal]
  103. Wojciech Rytter
    A Note on Two-Way Nondeterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:1, pp:5-9 [Journal]
  104. Wojciech Rytter
    Time Complexity of Unambiguous Path Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:3, pp:102-104 [Journal]
  105. Wojciech Rytter
    Time Complexity of Loop-Free Two-Way Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:3, pp:127-129 [Journal]
  106. Wojciech Rytter
    A Simulation Result for Two-Way Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:4, pp:199-202 [Journal]
  107. Wojciech Rytter
    On Linear Context-Free Languages and One-Way Multihead Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:4, pp:163-166 [Journal]
  108. Wojciech Rytter
    The Space Complexity of the Unique Decipherability Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:1, pp:1-3 [Journal]
  109. Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
    Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:2, pp:277-303 [Journal]
  110. Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
    Fast broadcasting and gossiping in radio networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:2, pp:177-189 [Journal]
  111. Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
    Sequential and Parallel Approximation of Shortest Superstrings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:1, pp:74-100 [Journal]
  112. Artur Czumaj, Wojciech Rytter
    Broadcasting algorithms in radio networks with unknown topology. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:60, n:2, pp:115-143 [Journal]
  113. 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]
  114. 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]
  115. Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
    A randomized algorithm for gossiping in radio networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:43, n:2, pp:119-124 [Journal]
  116. Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, T. Tsichlas
    Approximate String Matching with Gaps. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2002, v:9, n:1, pp:54-65 [Journal]
  117. 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]
  118. Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
    An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1997, v:4, n:2, pp:172-186 [Journal]
  119. Marek Karpinski, Wojciech Rytter
    On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:387-397 [Journal]
  120. Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter
    Constant-Time Randomized Parallel String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:4, pp:950-960 [Journal]
  121. Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter
    A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:668-681 [Journal]
  122. Wojciech Rytter
    A Correct Preprocessing Algorithm for Boyer-Moore String-Searching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:509-512 [Journal]
  123. Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
    Prime normal form and equivalence of simple grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:2, pp:124-134 [Journal]
  124. Michal Chytil, Maxime Crochemore, Burkhard Monien, Wojciech Rytter
    On the Parallel Recognition of Unambiguous Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:311-316 [Journal]
  125. Marek Chrobak, Wojciech Rytter
    Two Results on Linear Embeddings of Complete Binary Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:136, n:2, pp:507-526 [Journal]
  126. Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter
    Constant-Space String-Matching in Sublinear Average Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:218, n:1, pp:197-203 [Journal]
  127. Maxime Crochemore, Wojciech Rytter
    On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:403-414 [Journal]
  128. Maxime Crochemore, Wojciech Rytter
    Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:1, pp:59-82 [Journal]
  129. Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
    Efficient web searching using temporal factors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:569-582 [Journal]
  130. Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito
    On polynomial-time approximation algorithms for the variable length scheduling problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:489-495 [Journal]
  131. Krzysztof Diks, Wojciech Rytter
    On Optimal Parallel Computations for Sequences of Brackets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:87, n:2, pp:251-262 [Journal]
  132. 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]
  133. Alan Gibbons, Wojciech Rytter
    On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:48, n:3, pp:329-337 [Journal]
  134. Alan Gibbons, Wojciech Rytter
    Optimally Edge-Colouring Outerplanar Graphs is in NC. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:71, n:3, pp:401-411 [Journal]
  135. 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]
  136. 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]
  137. Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
    Correctness of Constructing Optimal Alphabetic Trees Revisited. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:309-324 [Journal]
  138. Marek Karpinski, Wojciech Rytter
    Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:243-260 [Journal]
  139. Lawrence L. Larmore, Wojciech Rytter
    Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:197, n:1-2, pp:189-201 [Journal]
  140. Burkhard Monien, Wojciech Rytter, Helmut Schäpers
    Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:123, n:2, pp:427-428 [Journal]
  141. Wojciech Rytter
    Application of Lempel-Ziv factorization to the approximation of grammar-based compression. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:211-222 [Journal]
  142. Wojciech Rytter
    On maximal suffixes, constant-space linear-time versions of KMP algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:763-774 [Journal]
  143. Wojciech Rytter
    The structure of subword graphs and suffix trees of Fibonacci words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:2, pp:211-223 [Journal]
  144. Wojciech Rytter
    On the Complexity of Parallel Parsing of General Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:315-321 [Journal]
  145. Wojciech Rytter
    On Efficient Parallel Computations for some Dynamic Programming Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:59, n:, pp:297-307 [Journal]
  146. Wojciech Rytter
    Context-Free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:2, pp:343-352 [Journal]
  147. Wojciech Rytter, Marek Chrobak
    A Characterization of Reversal-Bounded Multipushdown Machine Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:36, n:, pp:341-344 [Journal]
  148. Wojciech Rytter, Raffaele Giancarlo
    Optimal Parallel Parsing of Bracket Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:295-306 [Journal]
  149. Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
    Equivalence of simple functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:42-51 [Journal]
  150. Juhani Karhumäki, Yury Lifshits, Wojciech Rytter
    Tiling Periodicity. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:295-306 [Conf]
  151. Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
    Efficient Computation of Throughput Values of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:203-213 [Conf]
  152. Wojciech Rytter
    The number of runs in a string. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:9, pp:1459-1469 [Journal]

  153. Matching Integer Intervals by Minimal Sets of Binary Words with don't cares. [Citation Graph (, )][DBLP]


  154. Algorithms for Three Versions of the Shortest Common Superstring Problem. [Citation Graph (, )][DBLP]


  155. Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup. [Citation Graph (, )][DBLP]


  156. Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. [Citation Graph (, )][DBLP]


  157. Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. [Citation Graph (, )][DBLP]


  158. Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. [Citation Graph (, )][DBLP]


  159. The Number of Runs in Sturmian Words. [Citation Graph (, )][DBLP]


  160. On the Maximal Number of Cubic Runs in a String. [Citation Graph (, )][DBLP]


  161. Post Correspondence Problem with Partially Commutative Alphabets. [Citation Graph (, )][DBLP]


  162. On the Maximal Number of Cubic Subwords in a String. [Citation Graph (, )][DBLP]


  163. LPF Computation Revisited. [Citation Graph (, )][DBLP]


  164. On the maximal number of highly periodic runs in a string [Citation Graph (, )][DBLP]


  165. On the maximal number of cubic subwords in a string [Citation Graph (, )][DBLP]


  166. On the maximal sum of exponents of runs in a string [Citation Graph (, )][DBLP]


Search in 0.364secs, Finished in 0.371secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002