Wojciech Rytter - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix ArraysMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen. sofsem 2010: 296-307 [doi]

Extracting Powers and Periods in a String from Its Runs StructureMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. spire 2010: 258-269 [doi]

On the Maximal Number of Cubic Runs in a StringMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. LATA 2010: 227-238 [doi]

Algorithms for Three Versions of the Shortest Common Superstring ProblemMaxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. cpm 2010: 299-309 [doi]

On the Maximal Sum of Exponents of Runsin a StringMaxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. iwoca 2011: 10-19 [doi]

Tiling PeriodicityJuhani Karhumäki, Yury Lifshits, Wojciech Rytter. dmtcs, 12(2):237-248, 2010. [doi]

Post Correspondence Problem with Partially Commutative AlphabetsBarbara Klunder, Wojciech Rytter. LATA 2010: 356-367 [doi]

Efficient Testing of Equivalence of Words in a Free Idempotent SemigroupJakub Radoszewski, Wojciech Rytter. sofsem 2010: 663-671 [doi]

2009

Compressed string-matching in standard Sturmian wordsPawel Baturo, Wojciech Rytter. TCS, 410(30-32):2804-2810, 2009. [doi]

Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian WordsPawel Baturo, Marcin Piatkowski, Wojciech Rytter. ijfcs, 20(6):1005-1023, 2009. [doi]

Improved methods for extracting frequent itemsets from interim-support treesFrans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou. SPE, 39(6):551-571, 2009. [doi]

LPF Computation RevisitedMaxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen. iwoca 2009: 158-169 [doi]

Repetitions in strings: Algorithms and combinatoricsMaxime Crochemore, Lucian Ilie, Wojciech Rytter. TCS, 410(50):5227-5235, 2009. [doi]

Foreword: Special issue in honor of the 60th birthday of Prof. Maxime CrochemoreCostas S. Iliopoulos, Wojciech Rytter. TCS, 410(43):4293-4294, 2009. [doi]

On the Maximal Number of Cubic Subwords in a StringMarcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. iwoca 2009: 345-355 [doi]

Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian WordsMarcin Piatkowski, Wojciech Rytter. stringology 2009: 237-248 [doi]

2008

The Number of Runs in Sturmian WordsPawel Baturo, Marcin Piatkowski, Wojciech Rytter. wia 2008: 252-261 [doi]

Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian WordsPawel Baturo, Marcin Piatkowski, Wojciech Rytter. stringology 2008: 193-207 [doi]

Matching Integer Intervals by Minimal Sets of Binary Words with don t caresWojciech Fraczak, Wojciech Rytter, Mohammadreza Yazdani. cpm 2008: 217-229 [doi]

2007

2006

Prime normal form and equivalence of simple grammarsCédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter. TCS, 363(2):124-134, 2006. [doi]

Equivalence of Functions Represented by Simple Context-Free Grammars with OutputCédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter. dlt 2006: 71-82 [doi]

Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in PracticeCédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter. wia 2006: 90-101 [doi]

Broadcasting algorithms in radio networks with unknown topologyArtur Czumaj, Wojciech Rytter. jal, 60(2):115-143, 2006. [doi]

Faster Algorithm for Bisimulation Equivalence of Normed Context-Free ProcessesSlawomir Lasota, Wojciech Rytter. mfcs 2006: 646-657 [doi]

The Number of Runs in a String: Improved Analysis of the Linear Upper BoundWojciech Rytter. STACS 2006: 184-195 [doi]

The structure of subword graphs and suffix trees of Fibonacci wordsWojciech Rytter. TCS, 363(2):211-223, 2006. [doi]

2005

2004

A randomized algorithm for gossiping in radio networksMarek Chrobak, Leszek Gasieniec, Wojciech Rytter. networks, 43(2):119-124, 2004. [doi]

A First Approach to Finding Common Motifs With GapsCostas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot. stringology 2004: 88-97 [doi]

Grammar Compression, LZ-Encodings, and String Algorithms with Implicit InputWojciech Rytter. icalp 2004: 15-27 [doi]

2003

Faster Algorithms for ::::k::::-Medians in TreesRobert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter. mfcs 2003: 218-227 [doi]

On special families of morphisms related to [delta]-matching and don t care symbolsRichard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter. ipl, 85(5):227-233, 2003. [doi]

On polynomial-time approximation algorithms for the variable length scheduling problemArtur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito. TCS, 302(1-3):489-495, 2003. [doi]

Broadcasting Algorithms in Radio Networks with Unknown TopologyArtur Czumaj, Wojciech Rytter. focs 2003: 492-501 [doi]

Linear-Time Prime Decomposition Of Regular Prefix CodesJurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter. ijfcs, 14(6):1019-1032, 2003. [doi]

Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition TechniqueAlan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter. cj, 46(4):391-400, 2003. [doi]

The complexity of compressing subsegments of images described by finite automataJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter. DAM, 125(2-3):235-254, 2003.

On maximal suffixes, constant-space linear-time versions of KMP algorithmWojciech Rytter. TCS, 1-3(299):763-774, 2003. [doi]

Application of Lempel-Ziv factorization to the approximation of grammar-based compressionWojciech Rytter. TCS, 302(1-3):211-222, 2003. [doi]

2002

On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional TextsPiotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter. jcss, 65(2):332-350, 2002. [doi]

Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge PropertyPhillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter. jal, 42(2):277-303, 2002. [doi]

Deterministic broadcasting in ad hoc radio networksBogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter. dc, 15(1):27-38, 2002. [doi]

Fast broadcasting and gossiping in radio networksMarek Chrobak, Leszek Gasieniec, Wojciech Rytter. jal, 43(2):177-189, 2002. [doi]

Approximate String Matching with GapsMaxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, T. Tsichlas. njc, 9(1):54-65, 2002.

Three Heuristics for delta-Matching: delta-BM AlgorithmsMaxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter. cpm 2002: 178-189 [doi]

Jewels of stringologyMaxime Crochemore, Wojciech Rytter. World Scientific, 2002.

Prime Decompositions of Regular Prefix CodesJurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter. wia 2003: 85-94 [doi]

Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, ProceedingsKrzysztof Diks, Wojciech Rytter, editors, Volume 2420 of Lecture Notes in Computer Science, Springer, 2002.

Observations on Parallel Computation of Transitive and Max-Closure ProblemsAris Pagourtzis, Igor Potapov, Wojciech Rytter. pvm 2002: 217-225 [doi]

On Maximal Suffices and Constant-Space Linear-Time Versions of KMP AlgorithmWojciech Rytter. latin 2002: 196-208 [doi]

Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based CompressionWojciech Rytter. cpm 2002: 20-31 [doi]

2001

2000

Deterministic broadcasting in unknown radio networksBogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter. soda 2000: 861-870 [doi]

Fast Broadcasting and Gossiping in Radio NetworksMarek Chrobak, Leszek Gasieniec, Wojciech Rytter. focs 2000: 575-581

Pattern-Matching Problems for Two-Dimensional Images Described by Finite AutomataJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter. njc, 7(1):1-13, 2000.

1999

Constant-Space String-Matching in Sublinear Average TimeMaxime Crochemore, Leszek Gasieniec, Wojciech Rytter. TCS, 218(1):197-203, 1999. [doi]

Fast Practical Multi-Pattern MatchingMaxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter. ipl, 71(3-4):107-113, 1999. [doi]

Efficient Web Searching Using Temporal FactorsArtur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito. wads 1999: 294-305 [doi]

Efficiency of Fast Parallel Pattern Searching in Highly Compressed TextsLeszek Gasieniec, Alan Gibbons, Wojciech Rytter. mfcs 1999: 48-58

Almost Optimal Fully LZW-Compressed Pattern MatchingLeszek Gasieniec, Wojciech Rytter. dcc 1999: 316-325 [doi]

The Compression of Subsegments of Images Described by Finite AutomataJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter. cpm 1999: 186-195 [doi]

Generalized Factorizations of Words and Their Algorithmic PropertiesJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter. TCS, 218(1):123-133, 1999. [doi]

Complexity of Language Recognition Problems for Compressed WordsWojciech Plandowski, Wojciech Rytter. BIRTHDAY 1999: 262-272

Algorithms on Compressed Strings and ArraysWojciech Rytter. sofsem 1999: 48-65 [doi]

1998

Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge PropertyPhillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter. esa 1998: 43-54 [doi]

On the PVM Computations of Transitive Closure and Algebraic Path ProblemsKen J. Chan, Alan Gibbons, Marcelo Pias, Wojciech Rytter. pvm 1998: 338-345 [doi]

A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern MatchingMaxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter. siamcomp, 27(3):668-681, 1998.

On a Sublinear Time Parallel Construction of Optimal Binary Search TreesMarek Karpinski, Wojciech Rytter. ppl, 8(3):387-397, 1998.

Alphabet-Independent Optimal Parallel Search for Three-Dimensional PatternsMarek Karpinski, Wojciech Rytter. TCS, 205(1-2):243-260, 1998. [doi]

Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free LanguagesLawrence L. Larmore, Wojciech Rytter. TCS, 197(1-2):189-201, 1998. [doi]

Application of Lempel-Ziv Encodings to the Solution of Words EquationsWojciech Plandowski, Wojciech Rytter. icalp 1998: 731-742 [doi]

1997

On the PVM/MPI Computations of Dynamic Programming RecurrencesVassil Alexandrow, Ken Chan, Alan Gibbons, Wojciech Rytter. pvm 1997: 305-312

On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional TextsPiotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter. cpm 1997: 40-51

Constant-Time Randomized Parallel String MatchingMaxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter. siamcomp, 26(4):950-960, 1997.

Sequential and Parallel Approximation of Shortest SuperstringsArtur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter. jal, 23(1):74-100, 1997.

Pattern-Matching Problems for 2-Dimensional Images Described by Finite AutomataJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter. fct 1997: 245-256

Correctness of Constructing Optimal Alphabetic Trees RevisitedMarek Karpinski, Lawrence L. Larmore, Wojciech Rytter. TCS, 180(1-2):309-324, 1997. [doi]

An Efficient Pattern-Matching Algorithm for Strings with Short DescriptionsMarek Karpinski, Wojciech Rytter, Ayumi Shinohara. njc, 4(2):172-186, 1997.

1996

1995

Sqares, Cubes, and Time-Space Efficient String SearchingMaxime Crochemore, Wojciech Rytter. algorithmica, 13(5):405-425, 1995.

Constant-Space String Matching with Smaller Number of Comparisons: Sequential SamplingLeszek Gasieniec, Wojciech Plandowski, Wojciech Rytter. cpm 1995: 78-89

Context-Free Recognition via Shortest Paths Computation: A Version of Valiant s AlgorithmWojciech Rytter. TCS, 143(2):343-352, 1995. [doi]

PreviousNext