Wojciech Rytter
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
120
Venues
25
Active years
1984–2026
Best venue rank
A*
Where they publish
- BCPM27 papers
- CSPIRE14 papers
- BMFCS13 papers
- ASTACS8 papers
- CLATA8 papers
- BFCT6 papers
- AESA5 papers
- BISAAC4 papers
- A*SODA4 papers
- BSIROCCO3 papers
- CIWOCA3 papers
- BSOFSEM3 papers
- A*ICALP3 papers
- A*FOCS3 papers
- BLATIN3 papers
- NationalCOCOON2 papers
- BWADS2 papers
- CDLT2 papers
- BWALCOM1 paper
- CAlgosensors1 paper
- NationalFUN1 paper
- NationalSGAI1 paper
- BDCC1 paper
- BSPAA1 paper
- BICPR1 paper
Papers
120 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CPM | Improved Bounds on the Maximum Number of Distinct Squares in Circular Words. | Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2025 | MFCS | Counting Distinct Square Substrings in Sublinear Time. | Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2024 | STACS | Approximate Circular Pattern Matching Under Edit Distance. | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2024 | SPIRE | Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. | Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2023 | CPM | Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. | Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2022 | CPM | Linear-Time Computation of Shortest Covers of All Rotations of a String. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2022 | CPM | Rectangular Tile Covers of 2D-Strings. | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2022 | ESA | Approximate Circular Pattern Matching. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2022 | SPIRE | Subsequence Covers of Words. | Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2021 | CPM | Computing Covers of 2D-Strings. | Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2021 | ESA | Hardness of Detecting Abelian and Additive Square Factors in Strings. | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2021 | SPIRE | String Covers of a Tree. | Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | CPM | Counting Distinct Patterns in Internal Dictionary Matching. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | ESA | The Number of Repetitions in 2D-Strings. | Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2020 | SPIRE | Efficient Enumeration of Distinct Factors Using Package Representations. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba |
| 2020 | SPIRE | Internal Quasiperiod Queries. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2020 | WALCOM | Shortest Covers of All Cyclic Shifts of a String. | Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | CPM | Quasi-Linear-Time Algorithm for Longest Common Circular Factor. | Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | FCT | Circular Pattern Matching with k Mismatches. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | ISAAC | Internal Dictionary Matching. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2019 | LATA | Efficient Representation and Counting of Antipower Factors in Words. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2019 | LATA | Syntactic View of Sigma-Tau Generation of Permutations. | Wojciech Rytter, Wiktor Zuba |
| 2019 | SPIRE | Weighted Shortest Common Supersequence Problem Revisited. | Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2018 | CPM | Linear-Time Algorithm for Long LCF with k Mismatches. | Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2018 | LATA | On Periodicity Lemma for Partial Words. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2018 | STACS | String Periods in the Order-Preserving Model. | Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen |
| 2018 | SIROCCO | Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree. | Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter |
| 2018 | SPIRE | Faster Recovery of Approximate Periods over Edit Distance. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba |
| 2017 | Algosensors | Energy-Optimal Broadcast in a Tree with Mobile Agents. | Jerzy Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter |
| 2017 | COCOON | Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. | Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2017 | SIROCCO | Evacuation from a Disc in the Presence of a Faulty Robot. | Jurek Czyzowicz, Konstantinos Georgiou, Maxime Godon, Evangelos Kranakis, Danny Krizanc, Wojciech Rytter, Michal Wlodarczyk |
| 2016 | CPM | Faster Longest Common Extension Queries in Strings over General Alphabets. | Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen |
| 2016 | SIROCCO | Communication Problems for Mobile Agents Exchanging Energy. | Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter |
| 2016 | SPIRE | Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2015 | CPM | String Powers in Trees. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2015 | LATA | Square-Free Words over Partially Commutative Alphabets. | Lukasz Mikulski, Marcin Piatkowski, Wojciech Rytter |
| 2015 | SODA | Internal Pattern Matching Queries in a Text and Applications. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2015 | SPIRE | Efficient Algorithms for Longest Closed Factor Array. | Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen |
| 2015 | SPIRE | Tight Bound for the Number of Distinct Palindromes in a Tree. | Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen |
| 2015 | WADS | Universal Reconstruction of a String. | Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | CPM | Efficient Algorithms for Shortest Partial Seeds in Words. | Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | CPM | Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter |
| 2014 | DLT | Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | ISAAC | Covering Problems for Partial Words and for Indeterminate Strings. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | SPIRE | On the String Consensus Problem and the Manhattan Sequence Consensus Problem. | Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2013 | CPM | Fast Algorithm for Partial Covers in Words. | Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2013 | ESA | Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter |
| 2013 | LATA | Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2013 | STACS | Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter |
| 2013 | SPIRE | Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2012 | CPM | The Maximum Number of Squares in a Tree. | Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen |
| 2012 | FUN | Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric. | Wojciech Rytter, Bartosz Szreder |
| 2012 | ISAAC | Efficient Counting of Square Substrings in a Tree. | Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2012 | SODA | A linear time algorithm for seeds computation. | Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2012 | SPIRE | Efficient Data Structures for the Factor Periodicity Problem. | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2011 | CPM | Efficient Seeds Computation Revisited. | Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen |
| 2011 | CPM | Polynomial-Time Approximation Algorithms for Weighted LCS Problem. | Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2011 | ISAAC | Hamiltonian Paths in the Square of a Tree. | Jakub Radoszewski, Wojciech Rytter |
| 2010 | CPM | Algorithms for Three Versions of the Shortest Common Superstring Problem. | Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | IWOCA | On the Maximal Sum of Exponents of Runsin a String. | Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | LATA | On the Maximal Number of Cubic Runs in a String. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2010 | LATA | Post Correspondence Problem with Partially Commutative Alphabets. | Barbara Klunder, Wojciech Rytter |
| 2010 | SOFSEM | Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
| 2010 | SOFSEM | Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup. | Jakub Radoszewski, Wojciech Rytter |
| 2010 | SPIRE | Extracting Powers and Periods in a String from Its Runs Structure. | Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2009 | IWOCA | LPF Computation Revisited. | Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
| 2009 | IWOCA | On the Maximal Number of Cubic Subwords in a String. | Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2008 | CPM | Matching Integer Intervals by Minimal Sets of Binary Words with don't cares. | Wojciech Fraczak, Wojciech Rytter, Mohammadreza Yazdani |
| 2007 | CPM | Tiling Periodicity. | Juhani Karhumki, Yury Lifshits, Wojciech Rytter |
| 2007 | LATA | Occurrence and Lexicographic Properties of Standard Sturmian Words. | Pawel Baturo, Wojciech Rytter |
| 2006 | DLT | Equivalence of Functions Represented by Simple Context-Free Grammars with Output. | Cdric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter |
| 2006 | MFCS | Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes. | Slawomir Lasota, Wojciech Rytter |
| 2006 | STACS | The Number of Runs in a String: Improved Analysis of the Linear Upper Bound. | Wojciech Rytter |
| 2005 | SGAI | Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees. | Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou |
| 2004 | ICALP | Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input. | Wojciech Rytter |
| 2003 | FOCS | Broadcasting Algorithms in Radio Networks with Unknown Topology. | Artur Czumaj, Wojciech Rytter |
| 2003 | MFCS | Faster Algorithms for | Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter |
| 2002 | CPM | Three Heuristics for delta-Matching: delta-BM Algorithms. | Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter |
| 2002 | CPM | Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. | Wojciech Rytter |
| 2002 | LATIN | On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm. | Wojciech Rytter |
| 2001 | COCOON | A Randomized Algorithm for Gossiping in Radio Networks. | Marek Chrobak, Leszek Gasieniec, Wojciech Rytter |
| 2001 | FCT | On the Complexity of Decidable Cases of Commutation Problem for Languages. | Juhani Karhumki, Wojciech Plandowski, Wojciech Rytter |
| 2001 | MFCS | The k-Median Problem for Directed Trees. | Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter |
| 2000 | FOCS | Fast Broadcasting and Gossiping in Radio Networks. | Marek Chrobak, Leszek Gasieniec, Wojciech Rytter |
| 2000 | SODA | Deterministic broadcasting in unknown radio networks. | Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter |
| 1999 | CPM | The Compression of Subsegments of Images Described by Finite Automata. | Juhani Karhumki, Wojciech Plandowski, Wojciech Rytter |
| 1999 | DCC | Almost Optimal Fully LZW-Compressed Pattern Matching. | Leszek Gasieniec, Wojciech Rytter |
| 1999 | MFCS | Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts. | Leszek Gasieniec, Alan Gibbons, Wojciech Rytter |
| 1999 | SOFSEM | Algorithms on Compressed Strings and Arrays. | Wojciech Rytter |
| 1999 | WADS | Efficient Web Searching Using Temporal Factors. | Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito |
| 1998 | ESA | Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. | Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter |
| 1998 | ICALP | Application of Lempel-Ziv Encodings to the Solution of Words Equations. | Wojciech Plandowski, Wojciech Rytter |
| 1997 | CPM | On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. | Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter |
| 1997 | FCT | Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. | Juhani Karhumki, Wojciech Plandowski, Wojciech Rytter |
| 1996 | CPM | Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). | Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter |
| 1996 | SODA | Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. | Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter |
| 1995 | CPM | Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling. | Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter |
| 1995 | CPM | Pattern-Matching for Strings with Short Descriptions. | Marek Karpinski, Wojciech Rytter, Ayumi Shinohara |
| 1995 | LATIN | On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. | Maxime Crochemore, Wojciech Rytter |
| 1995 | STACS | Two-Dimensional Pattern Matching in Linear Time and Small Space. | Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter |
| 1994 | CPM | An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern. | Marek Karpinski, Wojciech Rytter |
| 1994 | MFCS | On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. | Marek Karpinski, Wojciech Rytter |
| 1993 | FOCS | Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions | Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter |
| 1993 | SPAA | Parallel Construction of Optimal Alphabetic Trees. | Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter |
| 1992 | ICALP | Polynomial Size Test Sets for Context-Free Languages. | Juhani Karhumki, Wojciech Plandowski, Wojciech Rytter |
| 1992 | ICPR | Parallel algorithms for 2D-image recognition. | Wojciech Rytter, Ahmed Saoudi |
| 1992 | LATIN | A Simple Randomized Parallel Algorithm for Maximal | Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter |
| 1992 | MFCS | Parallel Recognition and Ranking of Context-Free Languages. | Klaus-Jrn Lange, Peter Rossmanith, Wojciech Rytter |
| 1992 | STACS | Speeding Up Two String-Matching Algorithms. | Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter |
| 1992 | STACS | Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. | Lawrence L. Larmore, Wojciech Rytter |
| 1991 | FCT | Exact Analysis of Three Tree Contraction Algorithms. | Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha |
| 1991 | MFCS | Efficient Constructions of Test Sets for Regular and Context-Free Languages. | Juhani Karhumki, Wojciech Rytter, Stefan Jarominek |
| 1990 | MFCS | Parallel Construction of Minimal Suffix and Factor Automata. | Maxime Crochemore, Wojciech Rytter |
| 1990 | STACS | Parallel Computations on Strings and Arrays. | Maxime Crochemore, Wojciech Rytter |
| 1989 | MFCS | Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). | Bogdan S. Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha |
| 1989 | MFCS | Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). | Krzysztof Diks, Torben Hagerup, Wojciech Rytter |
| 1987 | FCT | Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs. | Alan Gibbons, Wojciech Rytter |
| 1986 | MFCS | Unique Deciperability for Partially Commutative Alphabet (Extended Abstract). | Marek Chrobak, Wojciech Rytter |
| 1985 | FCT | Parallel time O(log n) recognition of unambiguous CFLs. | Wojciech Rytter |
| 1984 | MFCS | Fast Recognition of Pushdown Automaton and Context-Free Languages. | Wojciech Rytter |