default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWojciech Rytter
Person information
- affiliation: University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j140]Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Pattern Matching Queries in a Text and Applications. SIAM J. Comput. 53(5): 1524-1577 (2024)- [c149]Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Faster Algorithms for Ranking/Unranking Bordered and Unbordered Words. SPIRE 2024: 257-271 - [c148]Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching Under Edit Distance. STACS 2024: 24:1-24:22 - [i42]Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching under Edit Distance. CoRR abs/2402.14550 (2024) - 2023
- [j139]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. Electron. J. Comb. 30(2) (2023) - [c147]Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Linear-Time Computation of Cyclic Roots and Cyclic Covers of a String. CPM 2023: 15:1-15:15 - 2022
- [j138]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A periodicity lemma for partial words. Inf. Comput. 283: 104677 (2022) - [j137]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Efficient representation and counting of antipower factors in words. Inf. Comput. 286: 104779 (2022) - [c146]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Linear-Time Computation of Shortest Covers of All Rotations of a String. CPM 2022: 22:1-22:15 - [c145]Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Rectangular Tile Covers of 2D-Strings. CPM 2022: 23:1-23:14 - [c144]Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching. ESA 2022: 35:1-35:19 - [c143]Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Subsequence Covers of Words. SPIRE 2022: 3-15 - [i41]Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching. CoRR abs/2208.08915 (2022) - 2021
- [j136]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Dictionary Matching. Algorithmica 83(7): 2142-2169 (2021) - [j135]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular pattern matching with k mismatches. J. Comput. Syst. Sci. 115: 73-85 (2021) - [j134]Jurek Czyzowicz, Dariusz Dereniowski, Robert Ostrowski, Wojciech Rytter:
Gossiping by energy-constrained mobile agents in tree networks. Theor. Comput. Sci. 861: 45-65 (2021) - [j133]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Shortest covers of all cyclic shifts of a string. Theor. Comput. Sci. 866: 70-81 (2021) - [j132]Wojciech Rytter, Wiktor Zuba:
Syntactic view of sigma-tau generation of permutations. Theor. Comput. Sci. 882: 49-62 (2021) - [c142]Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Computing Covers of 2D-Strings. CPM 2021: 12:1-12:20 - [c141]Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Hardness of Detecting Abelian and Additive Square Factors in Strings. ESA 2021: 77:1-77:19 - [c140]Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
String Covers of a Tree. SPIRE 2021: 68-82 - [i40]Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Hardness of Detecting Abelian and Additive Square Factors in Strings. CoRR abs/2107.09206 (2021) - 2020
- [j131]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String periods in the order-preserving model. Inf. Comput. 270 (2020) - [j130]Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A Linear-Time Algorithm for Seeds Computation. ACM Trans. Algorithms 16(2): 27:1-27:23 (2020) - [j129]Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Universal reconstruction of a string. Theor. Comput. Sci. 812: 174-186 (2020) - [c139]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Counting Distinct Patterns in Internal Dictionary Matching. CPM 2020: 8:1-8:15 - [c138]Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
The Number of Repetitions in 2D-Strings. ESA 2020: 32:1-32:18 - [c137]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Internal Quasiperiod Queries. SPIRE 2020: 60-75 - [c136]Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Efficient Enumeration of Distinct Factors Using Package Representations. SPIRE 2020: 247-261 - [c135]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Shortest Covers of All Cyclic Shifts of a String. WALCOM 2020: 69-80 - [i39]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Counting Distinct Patterns in Internal Dictionary Matching. CoRR abs/2005.05681 (2020) - [i38]Panagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
The Number of Repetitions in 2D-Strings. CoRR abs/2006.15999 (2020) - [i37]Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Internal Quasiperiod Queries. CoRR abs/2007.13471 (2020) - [i36]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. CoRR abs/2008.13209 (2020)
2010 – 2019
- 2019
- [j128]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. 37(2): 501-522 (2019) - [j127]Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Energy-optimal broadcast and exploration in a tree using mobile agents. Theor. Comput. Sci. 795: 362-374 (2019) - [c134]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM 2019: 25:1-25:14 - [c133]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular Pattern Matching with k Mismatches. FCT 2019: 213-228 - [c132]Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson:
On the Cyclic Regularities of Strings. AIAI (Workshops) 2019: 219-224 - [c131]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Dictionary Matching. ISAAC 2019: 22:1-22:17 - [c130]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Efficient Representation and Counting of Antipower Factors in Words. LATA 2019: 421-433 - [c129]Wojciech Rytter, Wiktor Zuba:
Syntactic View of Sigma-Tau Generation of Permutations. LATA 2019: 447-459 - [c128]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Weighted Shortest Common Supersequence Problem Revisited. SPIRE 2019: 221-238 - [i35]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CoRR abs/1901.11305 (2019) - [i34]Wojciech Rytter, Wiktor Zuba:
Syntactic View of Sigma-Tau Generation of Permutations. CoRR abs/1903.10701 (2019) - [i33]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular Pattern Matching with k Mismatches. CoRR abs/1907.01815 (2019) - [i32]Oluwole I. Ajala, Miznah Alshammary, Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Bruce W. Watson:
On the cyclic regularities of strings. CoRR abs/1908.01664 (2019) - [i31]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Weighted Shortest Common Supersequence Problem Revisited. CoRR abs/1909.11433 (2019) - [i30]Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Dictionary Matching. CoRR abs/1909.11577 (2019) - 2018
- [j126]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the string consensus problem and the Manhattan sequence consensus problem. Theor. Comput. Sci. 710: 126-138 (2018) - [j125]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient algorithms for shortest partial seeds in words. Theor. Comput. Sci. 710: 139-147 (2018) - [j124]Damian Repke, Wojciech Rytter:
On semi-perfect de Bruijn words. Theor. Comput. Sci. 720: 55-63 (2018) - [c127]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Algorithm for Long LCF with k Mismatches. CPM 2018: 23:1-23:16 - [c126]Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) 2018: 168-178 - [c125]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On Periodicity Lemma for Partial Words. LATA 2018: 232-244 - [c124]Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree. SIROCCO 2018: 209-225 - [c123]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Faster Recovery of Approximate Periods over Edit Distance. SPIRE 2018: 233-240 - [c122]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String Periods in the Order-Preserving Model. STACS 2018: 38:1-38:16 - [i29]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On Periodicity Lemma for Partial Words. CoRR abs/1801.01096 (2018) - [i28]Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen:
String Periods in the Order-Preserving Model. CoRR abs/1801.01404 (2018) - [i27]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Algorithm for Long LCF with k Mismatches. CoRR abs/1802.06369 (2018) - [i26]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Faster Recovery of Approximate Periods over Edit Distance. CoRR abs/1807.10483 (2018) - [i25]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Efficient Representation and Counting of Antipower Factors in Words. CoRR abs/1812.08101 (2018) - 2017
- [j123]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. Algorithmica 77(4): 1194-1215 (2017) - [j122]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
String Powers in Trees. Algorithmica 79(3): 814-834 (2017) - [j121]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Fast algorithms for Abelian periods in words and greatest common divisor queries. J. Comput. Syst. Sci. 84: 205-218 (2017) - [j120]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. 698: 25-39 (2017) - [c121]Jerzy Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Energy-Optimal Broadcast in a Tree with Mobile Agents. ALGOSENSORS 2017: 98-113 - [c120]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON 2017: 99-111 - [c119]Jurek Czyzowicz, Konstantinos Georgiou, Maxime Godon, Evangelos Kranakis, Danny Krizanc, Wojciech Rytter, Michal Wlodarczyk:
Evacuation from a Disc in the Presence of a Faulty Robot. SIROCCO 2017: 158-173 - [e3]Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter:
28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland. LIPIcs 78, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-039-2 [contents] - 2016
- [j119]Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Polynomial-time approximation algorithms for weighted LCS problem. Discret. Appl. Math. 204: 38-48 (2016) - [j118]Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the greedy algorithm for the Shortest Common Superstring problem with reversals. Inf. Process. Lett. 116(3): 245-251 (2016) - [j117]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. SIAM J. Discret. Math. 30(4): 2027-2046 (2016) - [j116]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-preserving indexing. Theor. Comput. Sci. 638: 122-135 (2016) - [j115]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum number of distinct and nonequivalent nonstandard squares in a word. Theor. Comput. Sci. 648: 84-95 (2016) - [j114]Wojciech Rytter:
Two fast constructions of compact representations of binary words with given set of periods. Theor. Comput. Sci. 656: 180-187 (2016) - [c118]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Faster Longest Common Extension Queries in Strings over General Alphabets. CPM 2016: 5:1-5:13 - [c117]Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Communication Problems for Mobile Agents Exchanging Energy. SIROCCO 2016: 275-288 - [c116]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE 2016: 22-34 - [r4]Maxime Crochemore, Wojciech Rytter:
Squares and Repetitions. Encyclopedia of Algorithms 2016: 2056-2060 - [i24]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Faster Longest Common Extension Queries in Strings over General Alphabets. CoRR abs/1602.00447 (2016) - [i23]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. CoRR abs/1604.02238 (2016) - [i22]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR abs/1606.08275 (2016) - 2015
- [j113]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. Algorithmica 73(1): 217-233 (2015) - [j112]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms 34: 49-53 (2015) - [j111]Wojciech Rytter, Arseny M. Shur:
Searching for Zimin patterns. Theor. Comput. Sci. 571: 50-57 (2015) - [j110]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-time version of Holub's algorithm for morphic imprimitivity testing. Theor. Comput. Sci. 602: 7-21 (2015) - [c115]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
String Powers in Trees. CPM 2015: 284-294 - [c114]Lukasz Mikulski, Marcin Piatkowski, Wojciech Rytter:
Square-Free Words over Partially Commutative Alphabets. LATA 2015: 424-435 - [c113]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Internal Pattern Matching Queries in a Text and Applications. SODA 2015: 532-551 - [c112]Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen:
Efficient Algorithms for Longest Closed Factor Array. SPIRE 2015: 95-102 - [c111]Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. SPIRE 2015: 270-276 - [c110]Pawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Universal Reconstruction of a String. WADS 2015: 386-397 - [i21]Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki, Florin Manea, Wojciech Rytter:
Testing k-binomial equivalence. CoRR abs/1509.00622 (2015) - [i20]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. CoRR abs/1510.02637 (2015) - [i19]Jerzy Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Algorithms for Communication Problems for Mobile Agents Exchanging Energy. CoRR abs/1511.05987 (2015) - [i18]Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals. CoRR abs/1511.08431 (2015) - 2014
- [j109]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen:
New simple efficient algorithms computing powers and runs in strings. Discret. Appl. Math. 163: 258-267 (2014) - [j108]Marcin Piatkowski, Wojciech Rytter:
Computing the number of cubic runs in standard Sturmian words. Discret. Appl. Math. 163: 361-372 (2014) - [j107]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. 521: 29-41 (2014) - [j106]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient counting of square substrings in a tree. Theor. Comput. Sci. 544: 60-73 (2014) - [c109]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Algorithms for Shortest Partial Seeds in Words. CPM 2014: 192-201 - [c108]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence. CPM 2014: 202-211 - [c107]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. Developments in Language Theory 2014: 215-226 - [c106]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering Problems for Partial Words and for Indeterminate Strings. ISAAC 2014: 220-232 - [c105]Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. SPIRE 2014: 244-255 - [i17]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Solon P. Pissis, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. CoRR abs/1401.0163 (2014) - [i16]Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the String Consensus Problem and the Manhattan Sequence Consensus Problem. CoRR abs/1407.6144 (2014) - [i15]Wojciech Rytter, Arseny M. Shur:
On Searching Zimin Patterns. CoRR abs/1409.8235 (2014) - [i14]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Covering Problems for Partial Words and for Indeterminate Strings. CoRR abs/1412.3696 (2014) - 2013
- [j105]Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
The Maximal Number of Runs in Standard Sturmian Words. Electron. J. Comb. 20(1): 13 (2013) - [j104]Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Computing the Longest Previous Factor. Eur. J. Comb. 34(1): 15-26 (2013) - [j103]Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximum number of cubic subwords in a word. Eur. J. Comb. 34(1): 27-37 (2013) - [j102]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. 113(3): 74-77 (2013) - [j101]Marcin Kubica, Tomasz Kulczynski, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A linear time algorithm for consecutive permutation pattern matching. Inf. Process. Lett. 113(12): 430-433 (2013) - [j100]Zbigniew Adamczyk, Wojciech Rytter:
A note on a simple computation of the maximal suffix of a string. J. Discrete Algorithms 20: 61-64 (2013) - [j99]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient seed computation revisited. Theor. Comput. Sci. 483: 171-181 (2013) - [c104]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. CPM 2013: 177-188 - [c103]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet. ESA 2013: 625-636 - [c102]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing. LATA 2013: 383-394 - [c101]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE 2013: 84-95 - [c100]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter:
Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries. STACS 2013: 245-256 - [i13]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Suffix Trees and Their Algorithmic Applications. CoRR abs/1303.6872 (2013) - [i12]Radoslaw Glowinski, Wojciech Rytter:
Compressed Pattern-Matching with Ranked Variables in Zimin Words. CoRR abs/1307.1560 (2013) - [i11]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Optimal Data Structure for Internal Pattern Matching Queries in a Text and Applications. CoRR abs/1311.6235 (2013) - [i10]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A Note on the Longest Common Compatible Prefix Problem for Partial Words. CoRR abs/1312.2381 (2013) - 2012
- [j98]Marcin Piatkowski, Wojciech Rytter:
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. Int. J. Found. Comput. Sci. 23(2): 303-321 (2012) - [j97]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
The maximal number of cubic runs in a word. J. Comput. Syst. Sci. 78(6): 1828-1836 (2012) - [j96]Jakub Radoszewski, Wojciech Rytter:
On the structure of compacted subword graphs of Thue-Morse words and their applications. J. Discrete Algorithms 11: 15-24 (2012) - [j95]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Efficient algorithms for three variants of the LPF table. J. Discrete Algorithms 11: 51-61 (2012) - [j94]Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal sum of exponents of runs in a string. J. Discrete Algorithms 14: 29-36 (2012) - [c99]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
The Maximum Number of Squares in a Tree. CPM 2012: 27-40 - [c98]Wojciech Rytter, Bartosz Szreder:
Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric. FUN 2012: 346-356 - [c97]Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Counting of Square Substrings in a Tree. ISAAC 2012: 207-216 - [c96]Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A linear time algorithm for seeds computation. SODA 2012: 1095-1112 - [c95]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Data Structures for the Factor Periodicity Problem. SPIRE 2012: 284-294 - [c94]Marcin Piatkowski, Wojciech Rytter:
The Number of Cubes in Sturmian Words. Stringology 2012: 89-102 - [i9]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen:
A Note on Efficient Computation of All Abelian Periods in a String. CoRR abs/1208.3313 (2012) - 2011
- [c93]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient Seeds Computation Revisited. CPM 2011: 350-363 - [c92]Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Polynomial-Time Approximation Algorithms for Weighted LCS Problem. CPM 2011: 455-466 - [c91]Jakub Radoszewski, Wojciech Rytter:
Hamiltonian Paths in the Square of a Tree. ISAAC 2011: 90-99 - [c90]Marcin Piatkowski, Wojciech Rytter:
Computing the Number of Cubic Runs in Standard Sturmian Words. Stringology 2011: 106-120 - [c89]Radoslaw Glowinski, Wojciech Rytter:
Observations On Compressed Pattern-Matching with Ranked Variables in Zimin Words. Stringology 2011: 162-172 - [i8]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient Seeds Computation Revisited. CoRR abs/1104.3153 (2011) - [i7]Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A Linear Time Algorithm for Seeds Computation. CoRR abs/1107.2422 (2011) - 2010
- [j93]Juhani Karhumäki, Yury Lifshits, Wojciech Rytter:
Tiling Periodicity. Discret. Math. Theor. Comput. Sci. 12(2): 237-248 (2010) - [c88]Maxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM 2010: 299-309 - [c87]Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Maximal Sum of Exponents of Runsin a String. IWOCA 2010: 10-19 - [c86]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Maximal Number of Cubic Runs in a String. LATA 2010: 227-238 - [c85]Barbara Klunder, Wojciech Rytter:
Post Correspondence Problem with Partially Commutative Alphabets. LATA 2010: 356-367 - [c84]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. SOFSEM 2010: 296-307 - [c83]Jakub Radoszewski, Wojciech Rytter:
Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup. SOFSEM 2010: 663-671 - [c82]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Extracting Powers and Periods in a String from Its Runs Structure. SPIRE 2010: 258-269 - [c81]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen:
New Simple Efficient Algorithms Computing Powers and Runs in Strings. Stringology 2010: 138-149 - [i6]Maxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal sum of exponents of runs in a string. CoRR abs/1003.4866 (2010)
2000 – 2009
- 2009
- [j92]Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. Int. J. Found. Comput. Sci. 20(6): 1005-1023 (2009) - [j91]Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou:
Improved methods for extracting frequent itemsets from interim-support trees. Softw. Pract. Exp. 39(6): 551-571 (2009) - [j90]Pawel Baturo, Wojciech Rytter:
Compressed string-matching in standard Sturmian words. Theor. Comput. Sci. 410(30-32): 2804-2810 (2009) - [j89]Costas S. Iliopoulos, Wojciech Rytter:
Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore. Theor. Comput. Sci. 410(43): 4293-4294 (2009) - [j88]Maxime Crochemore, Lucian Ilie, Wojciech Rytter:
Repetitions in strings: Algorithms and combinatorics. Theor. Comput. Sci. 410(50): 5227-5235 (2009) - [c80]Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen:
LPF Computation Revisited. IWOCA 2009: 158-169 - [c79]Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Maximal Number of Cubic Subwords in a String. IWOCA 2009: 345-355 - [c78]Marcin Piatkowski, Wojciech Rytter:
Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words. Stringology 2009: 237-248 - [i5]Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal number of highly periodic runs in a string. CoRR abs/0907.2157 (2009) - [i4]Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the maximal number of cubic subwords in a string. CoRR abs/0911.1370 (2009) - 2008
- [c77]Wojciech Fraczak, Wojciech Rytter, Mohammadreza Yazdani:
Matching Integer Intervals by Minimal Sets of Binary Words with don't cares. CPM 2008: 217-229 - [c76]Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. Stringology 2008: 193-207 - [c75]Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
The Number of Runs in Sturmian Words. CIAA 2008: 252-261 - [e2]Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter:
Structure-Based Compression of Complex Massive Data, 22.06. - 27.06.2008. Dagstuhl Seminar Proceedings 08261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [r3]Maxime Crochemore, Wojciech Rytter:
Squares and Repetitions. Encyclopedia of Algorithms 2008 - [i3]Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter:
08261 Abstracts Collection - Structure-Based Compression of Complex Massive Data. Structure-Based Compression of Complex Massive Data 2008 - [i2]Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter:
08261 Executive Summary - Structure-Based Compression of Complex Massive Data. Structure-Based Compression of Complex Massive Data 2008 - 2007
- [j87]Wojciech Rytter:
The number of runs in a string. Inf. Comput. 205(9): 1459-1469 (2007) - [j86]Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice. Int. J. Found. Comput. Sci. 18(4): 715-725 (2007) - [j85]Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Equivalence of simple functions. Theor. Comput. Sci. 376(1-2): 42-51 (2007) - [c74]Juhani Karhumäki, Yury Lifshits, Wojciech Rytter:
Tiling Periodicity. CPM 2007: 295-306 - [c73]Pawel Baturo, Wojciech Rytter:
Occurrence and Lexicographic Properties of Standard Sturmian Words. LATA 2007: 79-90 - [c72]Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Efficient Computation of Throughput Values of Context-Free Languages. CIAA 2007: 203-213 - [r2]Wojciech Rytter:
Parallel Algorithms on Strings. Handbook of Parallel Computing 2007 - 2006
- [j84]Artur Czumaj, Wojciech Rytter:
Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2): 115-143 (2006) - [j83]Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Prime normal form and equivalence of simple grammars. Theor. Comput. Sci. 363(2): 124-134 (2006) - [j82]Wojciech Rytter:
The structure of subword graphs and suffix trees of Fibonacci words. Theor. Comput. Sci. 363(2): 211-223 (2006) - [c71]Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Equivalence of Functions Represented by Simple Context-Free Grammars with Output. Developments in Language Theory 2006: 71-82 - [c70]Slawomir Lasota, Wojciech Rytter:
Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes. MFCS 2006: 646-657 - [c69]Wojciech Rytter:
The Number of Runs in a String: Improved Analysis of the Linear Upper Bound. STACS 2006: 184-195 - [c68]Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice. CIAA 2006: 90-101 - 2005
- [j81]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. Int. J. Found. Comput. Sci. 16(6): 1145-1154 (2005) - [j80]Juhani 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) - [c67]Frans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou:
Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees. SGAI Conf. 2005: 263-276 - [c66]Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Prime Normal Form and Equivalence of Simple Grammars. CIAA 2005: 78-89 - [c65]Wojciech Rytter:
The Structure of Subword Graphs and Suffix Trees of Fibonacci Words. CIAA 2005: 250-261 - 2004
- [j79]Marek Chrobak, Leszek Gasieniec, Wojciech Rytter:
A randomized algorithm for gossiping in radio networks. Networks 43(2): 119-124 (2004) - [c64]Wojciech Rytter:
Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input. ICALP 2004: 15-27 - [c63]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. Stringology 2004: 88-97 - [r1]Wojciech Rytter:
Trees with Minimum Weighted Path Length. Handbook of Data Structures and Applications 2004 - 2003
- [j78]Alan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter:
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. Comput. J. 46(4): 391-400 (2003) - [j77]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
The complexity of compressing subsegments of images described by finite automata. Discret. Appl. Math. 125(2-3): 235-254 (2003) - [j76]Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter:
Linear-Time Prime Decomposition Of Regular Prefix Codes. Int. J. Found. Comput. Sci. 14(6): 1019-1032 (2003) - [j75]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. Inf. Process. Lett. 85(5): 227-233 (2003) - [j74]Wojciech Rytter:
On maximal suffixes, constant-space linear-time versions of KMP algorithm. Theor. Comput. Sci. 299(1-3): 763-774 (2003) - [j73]Wojciech Rytter:
Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1-3): 211-222 (2003) - [j72]Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito:
On polynomial-time approximation algorithms for the variable length scheduling problem. Theor. Comput. Sci. 302(1-3): 489-495 (2003) - [c62]Artur Czumaj, Wojciech Rytter:
Broadcasting Algorithms in Radio Networks with Unknown Topology. FOCS 2003: 492-501 - [c61]Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter:
Faster Algorithms for k-Medians in Trees. MFCS 2003: 218-227 - 2002
- [b4]Maxime Crochemore, Wojciech Rytter:
Jewels of stringology. World Scientific 2002, ISBN 978-981-02-4782-9, pp. I-X, 1-310 - [j71]Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter:
Deterministic broadcasting in ad hoc radio networks. Distributed Comput. 15(1): 27-38 (2002) - [j70]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. J. Algorithms 42(2): 277-303 (2002) - [j69]Marek Chrobak, Leszek Gasieniec, Wojciech Rytter:
Fast broadcasting and gossiping in radio networks. J. Algorithms 43(2): 177-189 (2002) - [j68]Piotr 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) - [j67]Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, Kostas Tsichlas:
Approximate String Matching with Gaps. Nord. J. Comput. 9(1): 54-65 (2002) - [c60]Wojciech Rytter:
Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. CPM 2002: 20-31 - [c59]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
Three Heuristics for delta-Matching: delta-BM Algorithms. CPM 2002: 178-189 - [c58]Wojciech Rytter:
On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm. LATIN 2002: 196-208 - [c57]Aris Pagourtzis, Igor Potapov, Wojciech Rytter:
Observations on Parallel Computation of Transitive and Max-Closure Problems. PVM/MPI 2002: 217-225 - [c56]Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter:
Prime Decompositions of Regular Prefix Codes. CIAA 2002: 85-94 - [e1]Krzysztof Diks, Wojciech Rytter:
Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings. Lecture Notes in Computer Science 2420, Springer 2002, ISBN 3-540-44040-2 [contents] - 2001
- [j66]Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito:
Efficient web searching using temporal factors. Theor. Comput. Sci. 262(1): 569-582 (2001) - [c55]Marek Chrobak, Leszek Gasieniec, Wojciech Rytter:
A Randomized Algorithm for Gossiping in Radio Networks. COCOON 2001: 483-492 - [c54]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Decidable Cases of Commutation Problem for Languages. FCT 2001: 193-203 - [c53]Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter:
The k-Median Problem for Directed Trees. MFCS 2001: 260-271 - [c52]Aris Pagourtzis, Igor Potapov, Wojciech Rytter:
PVM Computation of the Transitive Closure: The Dependency Graph Approach. PVM/MPI 2001: 249-256 - 2000
- [j65]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) - [j64]Wojciech Rytter:
Compressed and fully compressed pattern matching in one and two dimensions. Proc. IEEE 88(11): 1769-1778 (2000) - [c51]Marek Chrobak, Leszek Gasieniec, Wojciech Rytter:
Fast Broadcasting and Gossiping in Radio Networks. FOCS 2000: 575-581 - [c50]Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter:
Deterministic broadcasting in unknown radio networks. SODA 2000: 861-870
1990 – 1999
- 1999
- [j63]Maxime 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) - [j62]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Generalized Factorizations of Words and Their Algorithmic Properties. Theor. Comput. Sci. 218(1): 123-133 (1999) - [j61]Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter:
Constant-Space String-Matching in Sublinear Average Time. Theor. Comput. Sci. 218(1): 197-203 (1999) - [c49]Wojciech Plandowski, Wojciech Rytter:
Complexity of Language Recognition Problems for Compressed Words. Jewels are Forever 1999: 262-272 - [c48]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
The Compression of Subsegments of Images Described by Finite Automata. CPM 1999: 186-195 - [c47]Leszek Gasieniec, Wojciech Rytter:
Almost Optimal Fully LZW-Compressed Pattern Matching. Data Compression Conference 1999: 316-325 - [c46]Leszek Gasieniec, Alan Gibbons, Wojciech Rytter:
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts. MFCS 1999: 48-58 - [c45]Wojciech Rytter:
Algorithms on Compressed Strings and Arrays. SOFSEM 1999: 48-65 - [c44]Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito:
Efficient Web Searching Using Temporal Factors. WADS 1999: 294-305 - 1998
- [j60]Marek Karpinski, Wojciech Rytter:
On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. Parallel Process. Lett. 8(3): 387-397 (1998) - [j59]Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter:
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. SIAM J. Comput. 27(3): 668-681 (1998) - [j58]Lawrence L. Larmore, Wojciech Rytter:
Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages. Theor. Comput. Sci. 197(1-2): 189-201 (1998) - [j57]Marek Karpinski, Wojciech Rytter:
Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns. Theor. Comput. Sci. 205(1-2): 243-260 (1998) - [c43]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. ESA 1998: 43-54 - [c42]Wojciech Plandowski, Wojciech Rytter:
Application of Lempel-Ziv Encodings to the Solution of Words Equations. ICALP 1998: 731-742 - [c41]Ken J. Chan, Alan Gibbons, Marcelo Pias, Wojciech Rytter:
On the PVM Computations of Transitive Closure and Algebraic Path Problems. PVM/MPI 1998: 338-345 - 1997
- [j56]Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter:
Sequential and Parallel Approximation of Shortest Superstrings. J. Algorithms 23(1): 74-100 (1997) - [j55]Marek Karpinski, Wojciech Rytter, Ayumi Shinohara:
An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. Nord. J. Comput. 4(2): 172-186 (1997) - [j54]Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter:
Constant-Time Randomized Parallel String Matching. SIAM J. Comput. 26(4): 950-960 (1997) - [j53]Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter:
Correctness of Constructing Optimal Alphabetic Trees Revisited. Theor. Comput. Sci. 180(1-2): 309-324 (1997) - [c40]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 - [c39]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. FCT 1997: 245-256 - [c38]Vassil Alexandrow, Ken Chan, Alan Gibbons, Wojciech Rytter:
On the PVM/MPI Computations of Dynamic Programming Recurrences. PVM/MPI 1997: 305-312 - [c37]Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter:
Constant-space string-matching in sublinear average time. SEQUENCES 1997: 230-239 - 1996
- [j52]Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter:
A Simple Randomized Parallel Algorithm for Maximal f-Matchings. Inf. Process. Lett. 57(2): 83-87 (1996) - [j51]Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha:
Parallel Tree-Contraction and Fibonacci Numbers. Inf. Process. Lett. 59(5): 267-271 (1996) - [c36]Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter:
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). CPM 1996: 39-49 - [c35]Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter:
Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. SODA 1996: 36-41 - [c34]Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter:
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). SWAT 1996: 392-403 - 1995
- [j50]Maxime Crochemore, Wojciech Rytter:
Squares, Cubes, and Time-Space Efficient String Searching. Algorithmica 13(5): 405-425 (1995) - [j49]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Polynomial Size Test Sets for Context-Free Languages. J. Comput. Syst. Sci. 50(1): 11-19 (1995) - [j48]Wojciech Rytter:
Context-Free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm. Theor. Comput. Sci. 143(2): 343-352 (1995) - [j47]Leszek 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) - [c33]Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter:
Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling. CPM 1995: 78-89 - [c32]Marek Karpinski, Wojciech Rytter, Ayumi Shinohara:
Pattern-Matching for Strings with Short Descriptions. CPM 1995: 205-214 - [c31]Maxime Crochemore, Wojciech Rytter:
On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. LATIN 1995: 220-229 - [c30]Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter:
Two-Dimensional Pattern Matching in Linear Time and Small Space. STACS 1995: 181-192 - [i1]Marek Karpinski, Wojciech Rytter, Ayumi Shinohara:
Pattern-Matching for Strings with Short Descriptions. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [b3]Maxime Crochemore, Wojciech Rytter:
Text Algorithms. Oxford University Press 1994, ISBN 0-19-508609-0 - [j46]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) - [j45]Lawrence L. Larmore, Wojciech Rytter:
An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. Inf. Process. Lett. 52(1): 31-34 (1994) - [j44]Burkhard Monien, Wojciech Rytter, Helmut Schäpers:
Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors. Theor. Comput. Sci. 123(2): 427-428 (1994) - [j43]Maxime Crochemore, Wojciech Rytter:
On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. Theor. Comput. Sci. 132(2): 403-414 (1994) - [j42]Marek Chrobak, Wojciech Rytter:
Two Results on Linear Embeddings of Complete Binary Trees. Theor. Comput. Sci. 136(2): 507-526 (1994) - [c29]Marek Karpinski, Wojciech Rytter:
An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern. CPM 1994: 125-135 - [c28]Marek Karpinski, Wojciech Rytter:
On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. MFCS 1994: 453-461 - [c27]Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter:
Parallel and Sequential Approximations of Shortest Superstrings. SWAT 1994: 95-106 - 1993
- [j41]Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter:
Two-Dimensional Pattern Matching by Sampling. Inf. Process. Lett. 46(4): 159-162 (1993) - [j40]Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek:
Efficient constructions of test sets for regular and context-free languages. Theor. Comput. Sci. 116(2): 305-316 (1993) - [j39]Burkhard Monien, Wojciech Rytter, Leopold Schäpers:
Fast recognition of deterministic cfl's with a smaller number of processors. Theor. Comput. Sci. 116(2): 421-429 (1993) - [c26]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. FOCS 1993: 248-258 - [c25]Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter:
Parallel Construction of Optimal Alphabetic Trees. SPAA 1993: 214-223 - 1992
- [j38]Wojciech Rytter, Ahmed Saoudi:
On Parallel Recognition of Two Classes of 2-D Array Patterns. Int. J. Pattern Recognit. Artif. Intell. 6(2&3): 293-299 (1992) - [j37]Peter Rossmanith, Wojciech Rytter:
Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's. Inf. Process. Lett. 44(5): 267-272 (1992) - [c24]Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Polynomial Size Test Sets for Context-Free Languages. ICALP 1992: 53-64 - [c23]Maxime Crochemore, Wojciech Rytter:
Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. ICPIA 1992: 100-112 - [c22]Wojciech Rytter, Ahmed Saoudi:
Parallel algorithms for 2D-image recognition. ICPR (4) 1992: 115-118 - [c21]Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter:
A Simple Randomized Parallel Algorithm for Maximal f-Matching. LATIN 1992: 165-176 - [c20]Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter:
Parallel Recognition and Ranking of Context-Free Languages. MFCS 1992: 24-36 - [c19]Lawrence L. Larmore, Wojciech Rytter:
Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. STACS 1992: 121-132 - [c18]Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter:
Speeding Up Two String-Matching Algorithms. STACS 1992: 589-600 - 1991
- [b2]Lech Banachowski, Antoni Kreczmar, Wojciech Rytter:
Analysis of algorithms and data structures. International computer science series, Addison-Wesley 1991, ISBN 978-0-201-41693-0, pp. I-XII, 1-300 - [j36]Maxime Crochemore, Wojciech Rytter:
Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings. Inf. Process. Lett. 38(2): 57-60 (1991) - [j35]Wojciech Rytter, Ahmed Saoudi:
On the Complexity of the Recognition of Parallel 2D-Image Languages. Inf. Process. Lett. 38(5): 225-229 (1991) - [j34]Michal Chytil, Maxime Crochemore, Burkhard Monien, Wojciech Rytter:
On the Parallel Recognition of Unambiguous Context-Free Languages. Theor. Comput. Sci. 81(2): 311-316 (1991) - [j33]Krzysztof Diks, Wojciech Rytter:
On Optimal Parallel Computations for Sequences of Brackets. Theor. Comput. Sci. 87(2): 251-262 (1991) - [j32]Maxime Crochemore, Wojciech Rytter:
Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays. Theor. Comput. Sci. 88(1): 59-82 (1991) - [c17]Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha:
Exact Analysis of Three Tree Contraction Algorithms. FCT 1991: 370-379 - [c16]Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek:
Efficient Constructions of Test Sets for Regular and Context-Free Languages. MFCS 1991: 249-258 - 1990
- [j31]Maxime Crochemore, Wojciech Rytter:
Parallel Construction of Minimal Suffix and Factor Automata. Inf. Process. Lett. 35(3): 121-128 (1990) - [j30]Alan Gibbons, Wojciech Rytter:
Optimally Edge-Colouring Outerplanar Graphs is in NC. Theor. Comput. Sci. 71(3): 401-411 (1990) - [c15]Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter:
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. FSTTCS 1990: 204-214 - [c14]Maxime Crochemore, Wojciech Rytter:
Parallel Construction of Minimal Suffix and Factor Automata. MFCS 1990: 217-223 - [c13]Maxime Crochemore, Wojciech Rytter:
Parallel Computations on Strings and Arrays. STACS 1990: 109-125
1980 – 1989
- 1989
- [j29]Alan Gibbons, Wojciech Rytter:
Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition. Inf. Comput. 81(1): 32-45 (1989) - [j28]Wojciech Rytter, Tomasz Szymacha:
Parallel Algorithms for a Class of Graphs Generated Recursively. Inf. Process. Lett. 30(5): 225-231 (1989) - [j27]Wojciech Rytter:
A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata. Inf. Process. Lett. 31(2): 103-109 (1989) - [c12]Bogdan S. Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha:
Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). MFCS 1989: 185-195 - [c11]Krzysztof Diks, Torben Hagerup, Wojciech Rytter:
Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). MFCS 1989: 207-217 - [c10]Krzysztof Diks, Wojciech Rytter:
Optimal Parallel Computations for Halin Graphs. Optimal Algorithms 1989: 266-273 - 1988
- [b1]Alan Gibbons, Wojciech Rytter:
Efficient parallel algorithms. Cambridge University Press 1988, ISBN 978-0-521-38841-2, pp. I-VIII, 1-259 - [j26]Alan Gibbons, Amos Israeli, Wojciech Rytter:
Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs. Inf. Process. Lett. 27(1): 43-51 (1988) - [j25]Wojciech Rytter:
On Efficient Computations of Costs of Paths on a Grid Graph. Inf. Process. Lett. 29(2): 71-74 (1988) - [j24]Wojciech Rytter:
On Efficient Parallel Computations for some Dynamic Programming Problems. Theor. Comput. Sci. 59: 297-307 (1988) - 1987
- [j23]Wojciech Rytter:
Parallel Time O(log n) Recognition of Unambiguous Context-free Languages. Inf. Comput. 73(1): 75-86 (1987) - [j22]Marek Chrobak, Wojciech Rytter:
Remarks on String-Matching and One-Way Multihead Automata. Inf. Process. Lett. 24(5): 325-329 (1987) - [j21]Wojciech Rytter, Raffaele Giancarlo:
Optimal Parallel Parsing of Bracket Languages. Theor. Comput. Sci. 53: 295-306 (1987) - [c9]Alan Gibbons, Wojciech Rytter:
Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs. FCT 1987: 155-162 - [c8]Wojciech Rytter:
A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata. Parallel Algorithms and Architectures 1987: 138-145 - [c7]Wojciech Rytter, Raffaele Giancarlo:
Optimal Parallel Parsing of Bracket Languages. Parallel Algorithms and Architectures 1987: 146-154 - 1986
- [j20]Wojciech Rytter:
The Space Complexity of the Unique Decipherability Problem. Inf. Process. Lett. 23(1): 1-3 (1986) - [j19]Wojciech Rytter:
An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-Driven Languages. Inf. Process. Lett. 23(2): 81-84 (1986) - [j18]Wojciech Rytter:
On the Complexity of Parallel Parsing of General Context-Free Languages. Theor. Comput. Sci. 47(3): 315-321 (1986) - [j17]Alan Gibbons, Wojciech Rytter:
On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids. Theor. Comput. Sci. 48(3): 329-337 (1986) - [c6]Alan Gibbons, Wojciech Rytter:
An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications. FSTTCS 1986: 453-469 - [c5]Marek Chrobak, Wojciech Rytter:
Unique Deciperability for Partially Commutative Alphabet (Extended Abstract). MFCS 1986: 256-263 - 1985
- [j16]Wojciech Rytter:
Fast Recognition of Pushdown Automaton and Context-free Languages. Inf. Control. 67(1-3): 12-22 (1985) - [j15]Wojciech Rytter, Marek Chrobak:
A Characterization of Reversal-Bounded Multipushdown Machine Languages. Theor. Comput. Sci. 36: 341-344 (1985) - [c4]Wojciech Rytter:
Parallel time O(log n) recognition of unambiguous CFLs. FCT 1985: 380-389 - 1984
- [j14]Wojciech Rytter:
On Linear Context-Free Languages and One-Way Multihead Automata. Inf. Process. Lett. 19(4): 163-166 (1984) - [c3]Wojciech Rytter:
Fast Recognition of Pushdown Automaton and Context-Free Languages. MFCS 1984: 507-515 - [c2]Wojciech Rytter:
On the recognition of context-free languages. Symposium on Computation Theory 1984: 318-325 - 1983
- [j13]Wojciech Rytter:
Time Complexity of Loop-Free Two-Way Pushdown Automata. Inf. Process. Lett. 16(3): 127-129 (1983) - [j12]Wojciech Rytter:
A Simulation Result for Two-Way Pushdown Automata. Inf. Process. Lett. 16(4): 199-202 (1983) - [c1]Wojciech Rytter:
Remarks on the Pyramidal Structure. CAAP 1983: 367-376 - 1982
- [j11]Wojciech Rytter:
A Note on Two-Way Nondeterministic Pushdown Automata. Inf. Process. Lett. 15(1): 5-9 (1982) - [j10]Wojciech Rytter:
Time Complexity of Unambiguous Path Systems. Inf. Process. Lett. 15(3): 102-104 (1982) - 1981
- [j9]Wojciech Rytter:
An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads. Inf. Process. Lett. 12(5): 234-236 (1981) - [j8]Wojciech Rytter:
The Dynamic Simulation of Recursive and Stack Manipulation Programs. Inf. Process. Lett. 13(2): 58-63 (1981) - [j7]Wojciech Rytter:
Time Complexity of Languages Recognized by One-Way Multihead Pushdown Automata. Inf. Process. Lett. 13(4/5): 142-144 (1981) - [j6]Wojciech Rytter:
A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata. Inf. Process. Lett. 13(4/5): 145-146 (1981) - 1980
- [j5]Wojciech Rytter:
Functional Automata. Fundam. Informaticae 3(1): 37-44 (1980) - [j4]Wojciech Rytter:
A Correct Preprocessing Algorithm for Boyer-Moore String-Searching. SIAM J. Comput. 9(3): 509-512 (1980)
1970 – 1979
- 1974
- [j3]Wojciech Rytter:
The Dimension of Stability of Stochastic Automata. Inf. Control. 24(3): 201-211 (1974) - 1973
- [j2]Wojciech Rytter:
The Strong Stability Problem for Stochastic Automata. Bull. Acad. Pol. des Sci. Ser. Sci. Math. Astron. Phys. 21(3) (1973) - [j1]Wojciech Rytter:
The Dimension of Strong Stability of Minimal State Stochastic Automata. Bull. Acad. Pol. des Sci. Ser. Sci. Math. Astron. Phys. 21(3) (1973)
Coauthor Index
[c146] [j133] [c137] [c135] [i37] [j128] [c134] [i35] [c127] [c126] [i27] [j120] [c120] [j116] [c116] [r4] [i22] [j112] [j109] [j107] [c106] [i14] [j104] [j102] [j99] [c101] [i13] [i10] [j97] [j95] [j94] [c99] [i9] [c93] [i8] [c88] [c87] [c86] [c84] [c82] [c81] [i6] [j88] [c80] [i5] [r3] [b4] [j67] [c59] [j63] [j61] [j59] [j54] [c37] [j50] [c31] [c30] [b3] [j46] [j43] [j41] [c26] [c23] [c18] [j36] [j34] [j32] [j31] [c14] [c13]
Jurek Czyzowicz
aka: Jerzy Czyzowicz
aka: Jerzy Czyzowicz
[c147] [c146] [j133] [c137] [c135] [i37] [j128] [c134] [c132] [i35] [i32] [c127] [c126] [i27] [j120] [c120] [j116] [c116] [i22] [j112] [j109] [j107] [c106] [i14] [j104] [j102] [j99] [c101] [i13] [i10] [j97] [j95] [c99] [i9] [c93] [i8] [c88] [c86] [c84] [c82] [c81] [j89] [c80] [i5] [j81] [c63] [j75] [j67] [c59]
[j140] [j139] [c147] [j138] [j137] [c144] [i41] [j136] [j135] [j131] [j130] [j129] [c139] [c136] [i39] [i36] [j128] [c134] [c133] [c131] [c130] [c128] [i35] [i33] [i31] [i30] [j126] [j125] [c127] [c126] [c125] [c123] [c122] [i29] [i28] [i27] [i26] [i25] [j123] [j122] [j121] [j120] [c120] [j118] [j117] [j116] [j115] [c118] [c116] [i24] [i23] [i22] [j113] [j112] [j110] [c115] [c113] [c112] [c111] [c110] [i20] [i18] [j106] [c109] [c108] [c107] [c106] [c105] [i17] [i16] [i14] [j102] [c104] [c103] [c102] [c101] [c100] [i13] [i11] [i10] [c99] [c97] [c96] [c95] [i9] [i7]
[j140] [c149] [c148] [i42] [c147] [j138] [j137] [c146] [c145] [c144] [c143] [i41] [j136] [j135] [j133] [c142] [c141] [c140] [i40] [j131] [j130] [j129] [c139] [c138] [c137] [c136] [c135] [i39] [i38] [i37] [j128] [c134] [c133] [c132] [c131] [c130] [c128] [i35] [i33] [i32] [i31] [i30] [j126] [j125] [c127] [c126] [c125] [c123] [c122] [i29] [i28] [i27] [i26] [i25] [j123] [j122] [j121] [j120] [c120] [e3] [j119] [j118] [j117] [j116] [j115] [c116] [i23] [i22] [j113] [j112] [j110] [c115] [c113] [c112] [c110] [i20] [i18] [j109] [j107] [j106] [c109] [c108] [c107] [c106] [c105] [i17] [i16] [i14] [j103] [j102] [j101] [j99] [c104] [c103] [c102] [c101] [c100] [i13] [i11] [i10] [j97] [j96] [j94] [c99] [c97] [c96] [c95] [i9] [c93] [c92] [c91] [i8] [i7] [c88] [c87] [c86] [c83] [c82] [c81] [i6] [c79] [i5] [i4]
[j140] [c149] [c148] [i42] [j139] [c147] [j138] [j137] [c146] [c145] [c144] [c143] [i41] [j136] [j135] [j133] [c142] [c141] [c140] [i40] [j131] [j130] [j129] [c139] [c138] [c137] [c136] [c135] [i39] [i38] [i37] [i36] [j128] [c134] [c133] [c131] [c130] [c128] [i35] [i33] [i31] [i30] [j126] [j125] [c127] [c126] [c125] [c123] [c122] [i29] [i28] [i27] [i26] [i25] [j122] [j120] [c120] [j119] [j118] [j116] [j115] [c118] [c116] [i24] [i23] [i22] [j113] [j112] [j110] [c115] [c113] [c112] [c111] [c110] [i18] [j109] [j107] [j106] [c109] [c107] [c106] [c105] [i17] [i16] [i14] [j104] [j103] [j102] [j101] [j99] [c104] [c102] [c101] [i13] [i11] [i10] [j97] [j95] [j94] [c99] [c97] [c96] [c95] [i9] [c93] [c92] [i8] [i7] [c88] [c87] [c86] [c84] [c82] [c81] [i6] [c80] [c79] [i5] [i4]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
