Travelled to:1 × Austria
1 × Czech Republic
1 × Denmark
1 × Finland
1 × Germany
1 × Russia
1 × Spain
1 × Taiwan
2 × USA
3 × France
Collaborated with:J.Czyzowicz W.Fraczak C.Bastien ∅ P.Baturo W.Plandowski M.Piatkowski J.Radoszewski T.Walen T.Kociumaka B.Klunder L.Mikulski J.Karhumäki D.Caucal A.Pelc M.Crochemore C.S.Iliopoulos M.Kubica
Talks about:word (6) grammar (5) simpl (4) free (4) polynomi (3) context (3) number (3) time (3) exponenti (2) algorithm (2)
Person: Wojciech Rytter
DBLP: Rytter:Wojciech
Contributed to:
2015
201420132010
2008200720072006200720062005
2004200219981992Wrote 17 papers:
- LATA-2015-MikulskiPR #commutative #word
- Square-Free Words over Partially Commutative Alphabets (LM, MP, WR), pp. 424–435.
- DLT-2014-KociumakaRRW #standard #word
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word (TK, JR, WR, TW), pp. 215–226.
- LATA-2013-KociumakaRRW #algorithm #linear #testing
- Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing (TK, JR, WR, TW), pp. 383–394.
- LATA-2010-CrochemoreIKRRW #on the #polynomial #string
- On the Maximal Number of Cubic Runs in a String (MC, CSI, MK, JR, WR, TW), pp. 227–238.
- LATA-2010-KlunderR #commutative #problem
- Post Correspondence Problem with Partially Commutative Alphabets (BK, WR), pp. 356–367.
- CIAA-2008-BaturoPR #word
- The Number of Runs in Sturmian Words (PB, MP, WR), pp. 252–261.
- CIAA-2007-CaucalCFR #context-free grammar #performance #throughput
- Efficient Computation of Throughput Values of Context-Free Languages (DC, JC, WF, WR), pp. 203–213.
- LATA-2007-BaturoR #standard #word
- Occurrence and Lexicographic Properties of Standard Sturmian Words (PB, WR), pp. 79–90.
- CIAA-2006-BastienCFR #exponential
- Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice (CB, JC, WF, WR), pp. 90–101.
- CIAA-J-2006-BastienCFR07 #exponential
- Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice (CB, JC, WF, WR), pp. 715–725.
- DLT-2006-BastienCFR #context-free grammar #equivalence
- Equivalence of Functions Represented by Simple Context-Free Grammars with Output (CB, JC, WF, WR), pp. 71–82.
- CIAA-2005-BastienCFR #equivalence #normalisation
- Prime Normal Form and Equivalence of Simple Grammars (CB, JC, WF, WR), pp. 78–89.
- CIAA-2005-Rytter #fibonacci #graph #word
- The Structure of Subword Graphs and Suffix Trees of Fibonacci Words (WR), pp. 250–261.
- ICALP-2004-Rytter #algorithm #encoding #string
- Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input (WR), pp. 15–27.
- CIAA-2002-CzyzowiczFPR
- Prime Decompositions of Regular Prefix Codes (JC, WF, AP, WR), pp. 85–94.
- ICALP-1998-PlandowskiR #encoding #equation #word
- Application of Lempel-Ziv Encodings to the Solution of Words Equations (WP, WR), pp. 731–742.
- ICALP-1992-KarhumakiPR #context-free grammar #polynomial #testing
- Polynomial Size Test Sets for Context-Free Languages (JK, WP, WR), pp. 53–64.