dblp.uni-trier.dewww.uni-trier.de

Wojciech Rytter Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
162EEMaxime 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)
161EEFrans Coenen, Paul H. Leng, Aris Pagourtzis, Wojciech Rytter, Dora Souliou: Improved methods for extracting frequent itemsets from interim-support trees. Softw., Pract. Exper. 39(6): 551-571 (2009)
160EEPawel Baturo, Wojciech Rytter: Compressed string-matching in standard Sturmian words. Theor. Comput. Sci. 410(30-32): 2804-2810 (2009)
2008
159EEPawel Baturo, Marcin Piatkowski, Wojciech Rytter: The Number of Runs in Sturmian Words. CIAA 2008: 252-261
158EEWojciech Fraczak, Wojciech Rytter, Mohammadreza Yazdani: Matching Integer Intervals by Minimal Sets of Binary Words with don't cares. CPM 2008: 217-229
157EEMaxime Crochemore, Wojciech Rytter: Squares and Repetitions. Encyclopedia of Algorithms 2008
2007
156EEDidier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Efficient Computation of Throughput Values of Context-Free Languages. CIAA 2007: 203-213
155EEJuhani Karhumäki, Yury Lifshits, Wojciech Rytter: Tiling Periodicity. CPM 2007: 295-306
154EEWojciech Rytter: The number of runs in a string. Inf. Comput. 205(9): 1459-1469 (2007)
153EECé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)
152EECédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Equivalence of simple functions. Theor. Comput. Sci. 376(1-2): 42-51 (2007)
2006
151EECédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice. CIAA 2006: 90-101
150EECé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
149EESlawomir Lasota, Wojciech Rytter: Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes. MFCS 2006: 646-657
148EEWojciech Rytter: The Number of Runs in a String: Improved Analysis of the Linear Upper Bound. STACS 2006: 184-195
147EEArtur Czumaj, Wojciech Rytter: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2): 115-143 (2006)
146EECédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Prime normal form and equivalence of simple grammars. Theor. Comput. Sci. 363(2): 124-134 (2006)
145EEWojciech Rytter: The structure of subword graphs and suffix trees of Fibonacci words. Theor. Comput. Sci. 363(2): 211-223 (2006)
2005
144EEWojciech Rytter: The Structure of Subword Graphs and Suffix Trees of Fibonacci Words. CIAA 2005: 250-261
143EECédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter: Prime Normal Form and Equivalence of Simple Grammars. CIAA 2005: 78-89
142EECostas 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)
141EEJuhani 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)
2004
140EEWojciech Rytter: Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input. ICALP 2004: 15-27
139EECostas 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
138EEMarek Chrobak, Leszek Gasieniec, Wojciech Rytter: A randomized algorithm for gossiping in radio networks. Networks 43(2): 119-124 (2004)
2003
137EEArtur Czumaj, Wojciech Rytter: Broadcasting Algorithms in Radio Networks with Unknown Topology. FOCS 2003: 492-501
136EERobert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter: Faster Algorithms for k-Medians in Trees. MFCS 2003: 218-227
135EEAlan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter: Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. Comput. J. 46(4): 391-400 (2003)
134 Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: The complexity of compressing subsegments of images described by finite automata. Discrete Applied Mathematics 125(2-3): 235-254 (2003)
133EERichard 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)
132EEJurek 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)
131EEWojciech Rytter: On maximal suffixes, constant-space linear-time versions of KMP algorithm. Theor. Comput. Sci. 1-3(299): 763-774 (2003)
130EEWojciech Rytter: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1-3): 211-222 (2003)
129EEArtur 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)
2002
128 Krzysztof Diks, Wojciech Rytter: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings Springer 2002
127EEJurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter: Prime Decompositions of Regular Prefix Codes. CIAA 2002: 85-94
126EEMaxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter: Three Heuristics for delta-Matching: delta-BM Algorithms. CPM 2002: 178-189
125EEWojciech Rytter: Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. CPM 2002: 20-31
124EEWojciech Rytter: On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm. LATIN 2002: 196-208
123EEAris Pagourtzis, Igor Potapov, Wojciech Rytter: Observations on Parallel Computation of Transitive and Max-Closure Problems. PVM/MPI 2002: 217-225
122EEBogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter: Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15(1): 27-38 (2002)
121EEPhillip 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)
120EEMarek Chrobak, Leszek Gasieniec, Wojciech Rytter: Fast broadcasting and gossiping in radio networks. J. Algorithms 43(2): 177-189 (2002)
119EEPiotr 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)
118 Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, T. Tsichlas: Approximate String Matching with Gaps. Nord. J. Comput. 9(1): 54-65 (2002)
2001
117EEMarek Chrobak, Leszek Gasieniec, Wojciech Rytter: A Randomized Algorithm for Gossiping in Radio Networks. COCOON 2001: 483-492
116EEJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: On the Complexity of Decidable Cases of Commutation Problem for Languages. FCT 2001: 193-203
115EEMarek Chrobak, Lawrence L. Larmore, Wojciech Rytter: The k-Median Problem for Directed Trees. MFCS 2001: 260-271
114EEAris Pagourtzis, Igor Potapov, Wojciech Rytter: PVM Computation of the Transitive Closure: The Dependency Graph Approach. PVM/MPI 2001: 249-256
113EEArtur 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)
2000
112 Marek Chrobak, Leszek Gasieniec, Wojciech Rytter: Fast Broadcasting and Gossiping in Radio Networks. FOCS 2000: 575-581
111EEBogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter: Deterministic broadcasting in unknown radio networks. SODA 2000: 861-870
110 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)
1999
109EEJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: The Compression of Subsegments of Images Described by Finite Automata. CPM 1999: 186-195
108EELeszek Gasieniec, Wojciech Rytter: Almost Optimal Fully LZW-Compressed Pattern Matching. Data Compression Conference 1999: 316-325
107 Wojciech Plandowski, Wojciech Rytter: Complexity of Language Recognition Problems for Compressed Words. Jewels are Forever 1999: 262-272
106EELeszek Gasieniec, Alan Gibbons, Wojciech Rytter: Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts. MFCS 1999: 48-58
105EEWojciech Rytter: Algorithms on Compressed Strings and Arrays. SOFSEM 1999: 48-65
104EEArtur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito: Efficient Web Searching Using Temporal Factors. WADS 1999: 294-305
103EEMaxime 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)
102EEJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: Generalized Factorizations of Words and Their Algorithmic Properties. Theor. Comput. Sci. 218(1): 123-133 (1999)
101EEMaxime Crochemore, Leszek Gasieniec, Wojciech Rytter: Constant-Space String-Matching in Sublinear Average Time. Theor. Comput. Sci. 218(1): 197-203 (1999)
1998
100EEPhillip 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
99EEWojciech Plandowski, Wojciech Rytter: Application of Lempel-Ziv Encodings to the Solution of Words Equations. ICALP 1998: 731-742
98EEKen J. Chan, Alan Gibbons, Marcelo Pias, Wojciech Rytter: On the PVM Computations of Transitive Closure and Algebraic Path Problems. PVM/MPI 1998: 338-345
97 Marek Karpinski, Wojciech Rytter: On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. Parallel Processing Letters 8(3): 387-397 (1998)
96 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)
95EELawrence 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)
94EEMarek Karpinski, Wojciech Rytter: Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns. Theor. Comput. Sci. 205(1-2): 243-260 (1998)
1997
93 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
92 Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. FCT 1997: 245-256
91 Vassil Alexandrow, Ken Chan, Alan Gibbons, Wojciech Rytter: On the PVM/MPI Computations of Dynamic Programming Recurrences. PVM/MPI 1997: 305-312
90 Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter: Sequential and Parallel Approximation of Shortest Superstrings. J. Algorithms 23(1): 74-100 (1997)
89 Marek Karpinski, Wojciech Rytter, Ayumi Shinohara: An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. Nord. J. Comput. 4(2): 172-186 (1997)
88 Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter: Constant-Time Randomized Parallel String Matching. SIAM J. Comput. 26(4): 950-960 (1997)
87EEMarek Karpinski, Lawrence L. Larmore, Wojciech Rytter: Correctness of Constructing Optimal Alphabetic Trees Revisited. Theor. Comput. Sci. 180(1-2): 309-324 (1997)
1996
86 Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter: Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). CPM 1996: 39-49
85 Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter: Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. SODA 1996: 36-41
84EELeszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter: Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). SWAT 1996: 392-403
83EEOscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter: A Simple Randomized Parallel Algorithm for Maximal f-Matchings. Inf. Process. Lett. 57(2): 83-87 (1996)
82EEWojciech Plandowski, Wojciech Rytter, Tomasz Szymacha: Parallel Tree-Contraction and Fibonacci Numbers. Inf. Process. Lett. 59(5): 267-271 (1996)
1995
81 Marek Karpinski, Wojciech Rytter, Ayumi Shinohara: Pattern-Matching for Strings with Short Descriptions. CPM 1995: 205-214
80 Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter: Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling. CPM 1995: 78-89
79 Maxime Crochemore, Wojciech Rytter: On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. LATIN 1995: 220-229
78EEMaxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter: Two-Dimensional Pattern Matching in Linear Time and Small Space. STACS 1995: 181-192
77 Maxime Crochemore, Wojciech Rytter: Sqares, Cubes, and Time-Space Efficient String Searching. Algorithmica 13(5): 405-425 (1995)
76EEMarek Karpinski, Wojciech Rytter, Ayumi Shinohara: Pattern-Matching for Strings with Short Descriptions Electronic Colloquium on Computational Complexity (ECCC) 2(22): (1995)
75 Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: Polynomial Size Test Sets for Context-Free Languages. J. Comput. Syst. Sci. 50(1): 11-19 (1995)
74EEWojciech Rytter: Context-Free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm. Theor. Comput. Sci. 143(2): 343-352 (1995)
73EELeszek 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)
1994
72 Maxime Crochemore, Wojciech Rytter: Text Algorithms Oxford University Press 1994
71 Marek Karpinski, Wojciech Rytter: An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern. CPM 1994: 125-135
70EEMarek Karpinski, Wojciech Rytter: On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. MFCS 1994: 453-461
69EEArtur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter: Parallel and Sequential Approximations of Shortest Superstrings. SWAT 1994: 95-106
68 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)
67 Lawrence L. Larmore, Wojciech Rytter: An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. Inf. Process. Lett. 52(1): 31-34 (1994)
66 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)
65 Maxime Crochemore, Wojciech Rytter: On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. Theor. Comput. Sci. 132(2): 403-414 (1994)
64 Marek Chrobak, Wojciech Rytter: Two Results on Linear Embeddings of Complete Binary Trees. Theor. Comput. Sci. 136(2): 507-526 (1994)
1993
63 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
62EELawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter: Parallel Construction of Optimal Alphabetic Trees. SPAA 1993: 214-223
61 Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter: Two-Dimensional Pattern Matching by Sampling. Inf. Process. Lett. 46(4): 159-162 (1993)
1992
60EEJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter: Polynomial Size Test Sets for Context-Free Languages. ICALP 1992: 53-64
59 Maxime Crochemore, Wojciech Rytter: Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms. ICPIA 1992: 100-112
58 Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter: A Simple Randomized Parallel Algorithm for Maximal f-Matching. LATIN 1992: 165-176
57EEKlaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter: Parallel Recognition and Ranking of Context-Free Languages. MFCS 1992: 24-36
56EELawrence L. Larmore, Wojciech Rytter: Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. STACS 1992: 121-132
55EEMaxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter: Speeding Up Two String-Matching Algorithms. STACS 1992: 589-600
54 Wojciech Rytter, Ahmed Saoudi: On Parallel Recognition of Two Classes of 2-D Array Patterns. IJPRAI 6(2&3): 293-299 (1992)
53 Peter Rossmanith, Wojciech Rytter: Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's. Inf. Process. Lett. 44(5): 267-272 (1992)
1991
52 Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha: Exact Analysis of Three Tree Contraction Algorithms. FCT 1991: 370-379
51EEJuhani Karhumäki, Wojciech Rytter, Stefan Jarominek: Efficient Constructions of Test Sets for Regular and Context-Free Languages. MFCS 1991: 249-258
50 Maxime Crochemore, Wojciech Rytter: Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings. Inf. Process. Lett. 38(2): 57-60 (1991)
49 Wojciech Rytter, Ahmed Saoudi: On the Complexity of the Recognition of Parallel 2D-Image Languages. Inf. Process. Lett. 38(5): 225-229 (1991)
48 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)
47 Krzysztof Diks, Wojciech Rytter: On Optimal Parallel Computations for Sequences of Brackets. Theor. Comput. Sci. 87(2): 251-262 (1991)
46 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)
1990
45EEChristos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter: Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. FSTTCS 1990: 204-214
44EEMaxime Crochemore, Wojciech Rytter: Parallel Construction of Minimal Suffix and Factor Automata. MFCS 1990: 217-223
43EEMaxime Crochemore, Wojciech Rytter: Parallel Computations on Strings and Arrays. STACS 1990: 109-125
42 Maxime Crochemore, Wojciech Rytter: Parallel Construction of Minimal Suffix and Factor Automata. Inf. Process. Lett. 35(3): 121-128 (1990)
41 Alan Gibbons, Wojciech Rytter: Optimally Edge-Colouring Outerplanar Graphs is in NC. Theor. Comput. Sci. 71(3): 401-411 (1990)
1989
40EEBogdan 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
39EEKrzysztof Diks, Torben Hagerup, Wojciech Rytter: Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). MFCS 1989: 207-217
38EEKrzysztof Diks, Wojciech Rytter: Optimal Parallel Computations for Halin Graphs. Optimal Algorithms 1989: 266-273
37 Alan Gibbons, Wojciech Rytter: Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition Inf. Comput. 81(1): 32-45 (1989)
36 Wojciech Rytter, Tomasz Szymacha: Parallel Algorithms for a Class of Graphs Generated Recursively. Inf. Process. Lett. 30(5): 225-231 (1989)
35 Wojciech Rytter: A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata. Inf. Process. Lett. 31(2): 103-109 (1989)
1988
34 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)
33 Wojciech Rytter: On Efficient Computations of Costs of Paths on a Grid Graph. Inf. Process. Lett. 29(2): 71-74 (1988)
32 Wojciech Rytter: On Efficient Parallel Computations for some Dynamic Programming Problems. Theor. Comput. Sci. 59: 297-307 (1988)
1987
31 Alan Gibbons, Wojciech Rytter: Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs. FCT 1987: 155-162
30 Wojciech Rytter: A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata. Parallel Algorithms and Architectures 1987: 138-145
29 Wojciech Rytter, Raffaele Giancarlo: Optimal Parallel Parsing of Bracket Languages. Parallel Algorithms and Architectures 1987: 146-154
28 Wojciech Rytter: Parallel Time O(log n) Recognition of Unambiguous Context-free Languages Inf. Comput. 73(1): 75-86 (1987)
27 Marek Chrobak, Wojciech Rytter: Remarks on String-Matching and One-Way Multihead Automata. Inf. Process. Lett. 24(5): 325-329 (1987)
26 Wojciech Rytter, Raffaele Giancarlo: Optimal Parallel Parsing of Bracket Languages. Theor. Comput. Sci. 53: 295-306 (1987)
1986
25EEAlan Gibbons, Wojciech Rytter: An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications. FSTTCS 1986: 453-469
24EEMarek Chrobak, Wojciech Rytter: Unique Deciperability for Partially Commutative Alphabet (Extended Abstract). MFCS 1986: 256-263
23 Wojciech Rytter: The Space Complexity of the Unique Decipherability Problem. Inf. Process. Lett. 23(1): 1-3 (1986)
22 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)
21 Wojciech Rytter: On the Complexity of Parallel Parsing of General Context-Free Languages. Theor. Comput. Sci. 47(3): 315-321 (1986)
20 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)
1985
19 Wojciech Rytter: Parallel time O(log n) recognition of unambiguous CFLs. FCT 1985: 380-389
18 Wojciech Rytter: Fast Recognition of Pushdown Automaton and Context-free Languages Information and Control 67(1-3): 12-22 (1985)
17 Wojciech Rytter, Marek Chrobak: A Characterization of Reversal-Bounded Multipushdown Machine Languages. Theor. Comput. Sci. 36: 341-344 (1985)
1984
16EEWojciech Rytter: Fast Recognition of Pushdown Automaton and Context-Free Languages. MFCS 1984: 507-515
15 Wojciech Rytter: On Linear Context-Free Languages and One-Way Multihead Automata. Inf. Process. Lett. 19(4): 163-166 (1984)
1983
14EEWojciech Rytter: Remarks on the Pyramidal Structure. CAAP 1983: 367-376
13 Wojciech Rytter: Time Complexity of Loop-Free Two-Way Pushdown Automata. Inf. Process. Lett. 16(3): 127-129 (1983)
12 Wojciech Rytter: A Simulation Result for Two-Way Pushdown Automata. Inf. Process. Lett. 16(4): 199-202 (1983)
1982
11 Wojciech Rytter: A Note on Two-Way Nondeterministic Pushdown Automata. Inf. Process. Lett. 15(1): 5-9 (1982)
10 Wojciech Rytter: Time Complexity of Unambiguous Path Systems. Inf. Process. Lett. 15(3): 102-104 (1982)
1981
9 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)
8 Wojciech Rytter: The Dynamic Simulation of Recursive and Stack Manipulation Programs. Inf. Process. Lett. 13(2): 58-63 (1981)
7 Wojciech Rytter: Time Complexity of Languages Recognized by One-Way Multihead Pushdown Automata. Inf. Process. Lett. 13(4/5): 142-144 (1981)
6 Wojciech Rytter: A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata. Inf. Process. Lett. 13(4/5): 145-146 (1981)
1980
5 Wojciech Rytter: Functional Automata. Fundam. Inform. 3(1): 37-44 (1980)
4 Wojciech Rytter: A Correct Preprocessing Algorithm for Boyer-Moore String-Searching. SIAM J. Comput. 9(3): 509-512 (1980)
1974
3 Wojciech Rytter: The Dimension of Stability of Stochastic Automata Information and Control 24(3): 201-211 (1974)
1973
2 Wojciech Rytter: The Dimension of Strong Stability of Minimal State Stochastic Automata. Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 21(3): (1973)
1 Wojciech Rytter: The Strong Stability Problem for Stochastic Automata. Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 21(3): (1973)

Coauthor Index

1Vassil Alexandrow [91]
2Cédric Bastien [143] [146] [150] [151] [152] [153]
3Pawel Baturo [159] [160]
4Robert Benkoczi [136]
5Piotr Berman [93] [119]
6Binay K. Bhattacharya [136]
7Phillip G. Bradford [100] [121]
8Didier Caucal [156]
9Ken Chan [91]
10Ken J. Chan [98]
11Bogdan S. Chlebus [40] [111] [122]
12Marek Chrobak [17] [24] [27] [64] [112] [115] [117] [120] [136] [138]
13Michal Chytil [48]
14Frans Coenen [161]
15Richard Cole [63] [133]
16Maxime Crochemore [42] [43] [44] [46] [48] [50] [55] [59] [61] [63] [65] [68] [72] [77] [78] [79] [88] [96] [101] [103] [118] [126] [157] [162]
17Artur Czumaj [55] [68] [69] [90] [103] [104] [113] [129] [137] [147]
18Jurek Czyzowicz [127] [132] [143] [146] [150] [151] [152] [153] [156]
19Krzysztof Diks [38] [39] [40] [47] [128]
20Ian Finch [104] [113]
21Wojciech Fraczak [127] [132] [143] [146] [150] [151] [152] [153] [156] [158]
22Zvi Galil [63] [88]
23Oscar Garrido [58] [83]
24Leszek Gasieniec [55] [61] [63] [68] [69] [73] [78] [80] [84] [86] [88] [90] [96] [101] [103] [104] [106] [108] [111] [112] [113] [117] [120] [122] [129] [138]
25Daya Ram Gaur [129]
26Raffaele Giancarlo [26] [29]
27Alan Gibbons [20] [25] [31] [34] [37] [41] [91] [98] [104] [106] [111] [113] [122] [135]
28Mordecai J. Golin [100] [121]
29Torben Hagerup [39]
30Ramesh Hariharan [63] [96]
31Costas S. Iliopoulos [118] [126] [133] [139] [142] [162]
32Amos Israeli [34]
33Stefan Jarominek [51] [55] [58] [68] [83]
34Juhani Karhumäki [51] [60] [75] [92] [102] [109] [110] [116] [134] [141] [155]
35Marek Karpinski [70] [71] [76] [81] [84] [85] [86] [87] [89] [93] [94] [97] [119]
36Ramesh Krishnamurti [129]
37Marcin Kubica [162]
38Klaus-Jörn Lange [57]
39Lawrence L. Larmore [56] [62] [67] [85] [87] [93] [95] [100] [115] [119] [121] [136]
40Slawomir Lasota [149]
41Thierry Lecroq [55] [68] [103] [126] [133]
42Paul H. Leng [104] [113] [161]
43Christos Levcopoulos [45]
44Yury Lifshits [155]
45Andrzej Lingas [45] [58] [83]
46Christos Makris [118]
47James A. M. McHugh [139] [142]
48Burkhard Monien [48] [66]
49S. Muthukrishnan (S. Muthu Muthukrishnan) [63] [96]
50Aris Pagourtzis [114] [123] [135] [161]
51Kunsoo Park [63] [88]
52Andrzej Pelc [111] [122] [127] [132]
53Pierre Peterlongo [139] [142]
54Ola Petersson [45]
55Marcelo Pias [98]
56Marcin Piatkowski [159]
57Marek Piotrów [69] [90]
58Nadia Pisanti [139] [142]
59Wojciech Plandowski [52] [55] [60] [68] [73] [75] [78] [80] [82] [84] [86] [92] [93] [99] [102] [103] [107] [109] [110] [116] [119] [126] [133] [134] [141]
60Igor Potapov [114] [123] [135]
61Teresa M. Przytycka [62]
62Jakub Radoszewski [162]
63Peter Rossmanith [53] [57]
64Marie-France Sagot [139] [142]
65Ahmed Saoudi [49] [54]
66Helmut Schäpers [66]
67Ayumi Shinohara [76] [81] [89]
68Dora Souliou [161]
69Tomasz Szymacha [36] [40] [52] [82]
70Athanasios K. Tsakalidis [118]
71T. Tsichlas [118]
72Tomasz Walen [162]
73Mohammadreza Yazdani [158]
74Michele Zito [104] [113] [129]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)