| Publication | Date of Publication | Type |
|---|
| Broadcasting algorithms in radio networks with unknown topology | 2026-05-29 | Paper |
Quasi-linear-time algorithm for a longest common circular factor
Theoretical Computer Science | 2026-05-11 | Paper |
| Fast broadcasting and gossiping in radio networks | 2026-05-08 | Paper |
Faster algorithms for ranking/unranking bordered and unbordered words
Theory of Computing Systems | 2026-04-27 | Paper |
Internal quasiperiod queries
Theoretical Computer Science | 2026-02-12 | Paper |
| Approximate circular pattern matching under edit distance | 2025-11-10 | Paper |
| Approximate circular pattern matching | 2025-06-19 | Paper |
Subsequence covers of words
Theoretical Computer Science | 2025-05-04 | Paper |
Internal pattern matching queries in a text and applications
SIAM Journal on Computing | 2024-10-21 | Paper |
| Linear-time computation of cyclic roots and cyclic covers of a string | 2024-10-21 | Paper |
| Linear-time computation of shortest covers of all rotations of a string | 2024-05-06 | Paper |
| Rectangular tile covers of 2D-strings | 2024-05-06 | Paper |
| Weighted shortest common supersequence problem revisited | 2024-04-19 | Paper |
scientific article; zbMATH DE number 7740932 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Subsequence covers of words
String Processing and Information Retrieval | 2023-08-04 | Paper |
Faster recovery of approximate periods over edit distance
String Processing and Information Retrieval | 2023-07-28 | Paper |
| scientific article; zbMATH DE number 7695998 (Why is no real title available?) | 2023-06-14 | Paper |
Tight bound for the number of distinct palindromes in a tree
The Electronic Journal of Combinatorics | 2023-05-16 | Paper |
Counting distinct patterns in internal dictionary matching
(available as arXiv preprint) | 2023-02-07 | Paper |
The number of repetitions in 2D-strings
(available as arXiv preprint) | 2023-02-07 | Paper |
| Internal dictionary matching | 2023-02-03 | Paper |
| 200 Problems on Languages, Automata, and Computation | 2023-01-30 | Paper |
Internal Quasiperiod Queries
1511.681 | 2022-12-22 | Paper |
Efficient Enumeration of Distinct Factors Using Package Representations
1511.68098 | 2022-12-22 | Paper |
Efficient algorithms for Lempel-Ziv encoding
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Parallel and sequential approximation of shortest superstrings
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Energy-Optimal Broadcast in a Tree with Mobile Agents
Algorithms for Sensor Systems | 2022-12-09 | Paper |
Pattern-matching problems for 2-dimensional images described by finite automata
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Parallel recognition and ranking of context-free languages
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
On a sublinear time parallel construction of optimal binary search trees
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
STACS 92 | 2022-08-18 | Paper |
Speeding up two string-matching algorithms
STACS 92 | 2022-08-18 | Paper |
On linear-time alphabet-independent 2-dimensional pattern matching
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
(available as arXiv preprint) | 2022-07-18 | Paper |
| String covers of a tree | 2022-06-15 | Paper |
Efficient representation and counting of antipower factors in words
Information and Computation | 2022-06-13 | Paper |
A periodicity lemma for partial words
Information and Computation | 2022-03-14 | Paper |
Syntactic view of sigma-tau generation of permutations
Theoretical Computer Science | 2021-08-11 | Paper |
Internal dictionary matching
Algorithmica | 2021-06-30 | Paper |
Internal dictionary matching
Algorithmica | 2021-06-30 | Paper |
A linear-time algorithm for seeds computation
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Shortest covers of all cyclic shifts of a string
Theoretical Computer Science | 2021-04-14 | Paper |
| 125 problems in text algorithms. With solutions | 2021-04-06 | Paper |
Gossiping by energy-constrained mobile agents in tree networks
Theoretical Computer Science | 2021-03-09 | Paper |
Linear-time algorithm for long LCF with k mismatches
(available as arXiv preprint) | 2020-12-16 | Paper |
Deterministic broadcasting in ad hoc radio networks
Distributed Computing | 2020-12-03 | Paper |
Circular pattern matching with \(k\) mismatches
Journal of Computer and System Sciences | 2020-10-23 | Paper |
String Periods in the Order-Preserving Model
(available as arXiv preprint) | 2020-08-05 | Paper |
Shortest covers of all cyclic shifts of a string
WALCOM: Algorithms and Computation | 2020-07-22 | Paper |
Universal reconstruction of a string
Theoretical Computer Science | 2020-02-20 | Paper |
Circular pattern matching with k mismatches
Fundamentals of Computation Theory | 2020-01-30 | Paper |
String periods in the order-preserving model
Information and Computation | 2020-01-17 | Paper |
Polynomial size test sets for context-free languages
Automata, Languages and Programming | 2019-12-04 | Paper |
Syntactic view of sigma-tau generation of permutations
Language and Automata Theory and Applications | 2019-12-04 | Paper |
Efficient representation and counting of antipower factors in words
Lecture Notes in Computer Science | 2019-12-04 | Paper |
Energy-optimal broadcast and exploration in a tree using mobile agents
Theoretical Computer Science | 2019-10-18 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
| A linear time algorithm for seeds computation | 2019-05-10 | Paper |
| Broadcast with energy-exchanging mobile agents distributed on a tree | 2019-01-30 | Paper |
Near-optimal computation of runs over general alphabet via non-crossing LCE queries
(available as arXiv preprint) | 2018-10-17 | Paper |
On periodicity lemma for partial words
(available as arXiv preprint) | 2018-06-26 | Paper |
| scientific article; zbMATH DE number 6876071 (Why is no real title available?) | 2018-05-29 | Paper |
| Evacuation from a disc in the presence of a faulty robot | 2018-04-12 | Paper |
On semi-perfect de Bruijn words
Theoretical Computer Science | 2018-03-12 | Paper |
Efficient algorithms for shortest partial seeds in words
Theoretical Computer Science | 2018-02-16 | Paper |
On the string consensus problem and the Manhattan sequence consensus problem
Theoretical Computer Science | 2018-02-16 | Paper |
Two-dimensional pattern matching in linear time and small space
STACS 95 | 2017-12-04 | Paper |
String powers in trees
Algorithmica | 2017-11-09 | Paper |
Covering problems for partial words and for indeterminate strings
Theoretical Computer Science | 2017-11-06 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Faster longest common extension queries in strings over general alphabets
(available as arXiv preprint) | 2017-10-17 | Paper |
Internal pattern matching queries in a text and applications
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Efficient indexes for jumbled pattern matching with constant-sized alphabet
Algorithmica | 2017-05-02 | Paper |
Two fast constructions of compact representations of binary words with given set of periods
Theoretical Computer Science | 2017-02-06 | Paper |
| Fast algorithms for abelian periods in words and greatest common divisor queries | 2017-01-30 | Paper |
Communication problems for mobile agents exchanging energy
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Fast algorithms for abelian periods in words and greatest common divisor queries
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
SIAM Journal on Discrete Mathematics | 2016-10-28 | Paper |
Maximum number of distinct and nonequivalent nonstandard squares in a word
Theoretical Computer Science | 2016-09-12 | Paper |
Order-preserving indexing
Theoretical Computer Science | 2016-06-16 | Paper |
Square-free words over partially commutative alphabets
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Polynomial-time approximation algorithms for weighted LCS problem
Discrete Applied Mathematics | 2016-04-07 | Paper |
On the greedy algorithm for the shortest common superstring problem with reversals
Information Processing Letters | 2016-01-05 | Paper |
Universal reconstruction of a string
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Linear-time version of Holub's algorithm for morphic imprimitivity testing
Theoretical Computer Science | 2015-09-25 | Paper |
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics | 2015-09-22 | Paper |
Computing the number of cubic runs in standard Sturmian words
Discrete Applied Mathematics | 2015-09-22 | Paper |
Covering problems for partial words and for indeterminate strings
Lecture Notes in Computer Science | 2015-09-11 | Paper |
Fast algorithm for partial covers in words
Algorithmica | 2015-09-03 | Paper |
A note on the longest common compatible prefix problem for partial words
Journal of Discrete Algorithms | 2015-08-24 | Paper |
String Powers in Trees
Combinatorial Pattern Matching | 2015-08-20 | Paper |
On the string consensus problem and the Manhattan sequence consensus problem
String Processing and Information Retrieval | 2015-02-10 | Paper |
Searching for Zimin patterns
Theoretical Computer Science | 2015-01-30 | Paper |
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
Developments in Language Theory | 2014-10-14 | Paper |
A linear time algorithm for consecutive permutation pattern matching
Information Processing Letters | 2014-08-13 | Paper |
A note on a simple computation of the maximal suffix of a string
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Efficient counting of square substrings in a tree
Theoretical Computer Science | 2014-07-07 | Paper |
Computing k-th Lyndon word and decoding lexicographically minimal de Bruijn sequence
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Efficient Algorithms for Shortest Partial Seeds in Words
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Extracting powers and periods in a word from its runs structure
Theoretical Computer Science | 2014-01-22 | Paper |
Efficient seed computation revisited
Theoretical Computer Science | 2014-01-09 | Paper |
Efficient indexes for jumbled pattern matching with constant-sized alphabet
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Fast Algorithm for Partial Covers in Words
Combinatorial Pattern Matching | 2013-06-14 | Paper |
The maximal number of runs in standard Sturmian words
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Efficient counting of square substrings in a tree
Algorithms and Computation | 2013-03-21 | Paper |
A note on efficient computation of all abelian periods in a string
Information Processing Letters | 2013-03-20 | Paper |
Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Computing the longest previous factor
European Journal of Combinatorics | 2012-11-15 | Paper |
On the maximum number of cubic subwords in a word
European Journal of Combinatorics | 2012-11-15 | Paper |
The maximal number of cubic runs in a word
Journal of Computer and System Sciences | 2012-11-06 | Paper |
On the maximal sum of exponents of runs in a string
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Asymptotic behaviour of the maximal number of squares in standard Sturmian words
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
The maximum number of squares in a tree
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms | 2012-05-11 | Paper |
On the structure of compacted subword graphs of Thue-Morse words and their applications
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Hamiltonian paths in the square of a tree
Algorithms and Computation | 2011-12-16 | Paper |
Polynomial-time approximation algorithms for weighted LCS problem
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Efficient seeds computation revisited
Combinatorial Pattern Matching | 2011-06-29 | Paper |
On the Maximal Sum of Exponents of Runsin a String
Lecture Notes in Computer Science | 2011-05-19 | Paper |
| Tiling periodicity | 2010-07-27 | Paper |
Algorithms for Three Versions of the Shortest Common Superstring Problem
Combinatorial Pattern Matching | 2010-07-26 | Paper |
| Algorithms for two versions of LCS problem for indeterminate strings | 2010-06-07 | Paper |
| TCAM representations of intervals of integers encoded by binary trees | 2010-06-07 | Paper |
On the maximal number of cubic runs in a string
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Post correspondence problem with partially commutative alphabets
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Efficient testing of equivalence of words in a free idempotent semigroup
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words
International Journal of Foundations of Computer Science | 2010-01-08 | Paper |
On the maximal number of cubic subwords in a string
Lecture Notes in Computer Science | 2009-12-11 | Paper |
LPF computation revisited
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Repetitions in strings: algorithms and combinatorics
Theoretical Computer Science | 2009-11-06 | Paper |
Compressed string-matching in standard Sturmian words
Theoretical Computer Science | 2009-08-07 | Paper |
Equivalence of Functions Represented by Simple Context-Free Grammars with Output
Developments in Language Theory | 2009-03-26 | Paper |
On special families of morphisms related to \(\delta \)-matching and don't care symbols
Information Processing Letters | 2009-03-23 | Paper |
The Number of Runs in Sturmian Words
Implementation and Applications of Automata | 2009-02-12 | Paper |
Tiling Periodicity
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Efficient Computation of Throughput Values of Context-Free Languages
Implementation and Application of Automata | 2008-06-10 | Paper |
REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE
International Journal of Foundations of Computer Science | 2008-05-20 | Paper |
The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
STACS 2006 | 2008-03-19 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
The number of runs in a string
Information and Computation | 2007-09-18 | Paper |
Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice
Implementation and Application of Automata | 2007-09-06 | Paper |
Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Equivalence of simple functions
Theoretical Computer Science | 2007-05-11 | Paper |
Prime normal form and equivalence of simple grammars
Theoretical Computer Science | 2007-01-09 | Paper |
The structure of subword graphs and suffix trees of Fibonacci words
Theoretical Computer Science | 2007-01-09 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Broadcasting algorithms in radio networks with unknown topology
Journal of Algorithms | 2006-10-05 | Paper |
A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
International Journal of Foundations of Computer Science | 2005-12-15 | Paper |
LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2185641 (Why is no real title available?) | 2005-07-04 | Paper |
On the complexity of decidable cases of the commutation problem of languages
Theoretical Computer Science | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 2087040 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086229 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087053 (Why is no real title available?) | 2004-08-11 | Paper |
A randomized algorithm for gossiping in radio networks
Networks | 2004-03-15 | Paper |
| Jewels of Stringology | 2004-02-23 | Paper |
| scientific article; zbMATH DE number 1998335 (Why is no real title available?) | 2003-12-15 | Paper |
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique
The Computer Journal | 2003-10-29 | Paper |
Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
Theoretical Computer Science | 2003-08-17 | Paper |
On polynomial-time approximation algorithms for the variable length scheduling problem.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1962770 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1948455 (Why is no real title available?) | 2003-07-13 | Paper |
| On the complexity of computing the order of repetition of a string | 2003-06-26 | Paper |
On maximal suffixes and constant-space linear-time versions of KMP algorithm.
Theoretical Computer Science | 2003-05-25 | Paper |
On the complexity of pattern matching for highly compressed two-dimensional texts.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
The complexity of compressing subsegments of images described by finite automata
Discrete Applied Mathematics | 2003-03-09 | Paper |
| scientific article; zbMATH DE number 1849117 (Why is no real title available?) | 2003-01-06 | Paper |
| scientific article; zbMATH DE number 1839444 (Why is no real title available?) | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1834653 (Why is no real title available?) | 2002-11-25 | Paper |
Fast broadcasting and gossiping in radio networks
Journal of Algorithms | 2002-09-30 | Paper |
| scientific article; zbMATH DE number 1796990 (Why is no real title available?) | 2002-09-05 | Paper |
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
Journal of Algorithms | 2002-07-11 | Paper |
| scientific article; zbMATH DE number 1418326 (Why is no real title available?) | 2002-03-04 | Paper |
Efficient web searching using temporal factors
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1809602 (Why is no real title available?) | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1496854 (Why is no real title available?) | 2001-04-19 | Paper |
| scientific article; zbMATH DE number 1490000 (Why is no real title available?) | 2000-08-13 | Paper |
| scientific article; zbMATH DE number 1445388 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1305081 (Why is no real title available?) | 2000-04-06 | Paper |
| scientific article; zbMATH DE number 1408351 (Why is no real title available?) | 2000-02-29 | Paper |
Generalized factorizations of words and their algorithmic properties
Theoretical Computer Science | 1999-06-21 | Paper |
Constant-space string-matching in sublinear average time
Theoretical Computer Science | 1999-06-21 | Paper |
Alphabet-independent optimal parallel search for three-dimensional patterns
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1223734 (Why is no real title available?) | 1998-11-15 | Paper |
Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages
Theoretical Computer Science | 1998-08-13 | Paper |
Correctness of constructing optimal alphabetic trees revisited
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 1151367 (Why is no real title available?) | 1998-05-13 | Paper |
Constant-Time Randomized Parallel String Matching
SIAM Journal on Computing | 1998-02-10 | Paper |
The zooming method: A recursive approach to time-space efficient string-matching
Theoretical Computer Science | 1997-09-29 | Paper |
Two results on linear embeddings of complete binary trees
Theoretical Computer Science | 1997-09-22 | Paper |
| scientific article; zbMATH DE number 1045405 (Why is no real title available?) | 1997-09-18 | Paper |
Sequential and Parallel Approximation of Shortest Superstrings
Journal of Algorithms | 1997-07-06 | Paper |
Context-free recognition via shortest paths computation: a version of Valiant's algorithm
Theoretical Computer Science | 1997-02-28 | Paper |
A simple randomized parallel algorithm for maximal f-matchings
Information Processing Letters | 1997-02-28 | Paper |
Parallel tree-contraction and Fibonacci numbers
Information Processing Letters | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 871897 (Why is no real title available?) | 1996-06-16 | Paper |
| scientific article; zbMATH DE number 826052 (Why is no real title available?) | 1996-04-09 | Paper |
Polynomial size test sets for context-free languages
Journal of Computer and System Sciences | 1996-03-18 | Paper |
Speeding up two string-matching algorithms
Algorithmica | 1996-02-26 | Paper |
| scientific article; zbMATH DE number 801745 (Why is no real title available?) | 1995-10-03 | Paper |
Squares, cubes, and time-space efficient string searching
Algorithmica | 1995-08-09 | Paper |
An optimal sublinear time parallel algorithm for some dynamic programming problems
Information Processing Letters | 1995-07-24 | Paper |
On two-dimensional pattern matching by optimal parallel algorithms
Theoretical Computer Science | 1994-09-25 | Paper |
Two-dimensional pattern matching by sampling
Information Processing Letters | 1993-12-01 | Paper |
Efficient constructions of test sets for regular and context-free languages
Theoretical Computer Science | 1993-10-25 | Paper |
Fast recognition of deterministic cfl's with a smaller number of processors
Theoretical Computer Science | 1993-10-17 | Paper |
| scientific article; zbMATH DE number 176145 (Why is no real title available?) | 1993-05-18 | Paper |
Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's
Information Processing Letters | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 43583 (Why is no real title available?) | 1993-01-23 | Paper |
| scientific article; zbMATH DE number 52889 (Why is no real title available?) | 1992-09-18 | Paper |
Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
Theoretical Computer Science | 1992-06-26 | Paper |
Efficient parallel algorithms to test square-freeness and factorize strings
Information Processing Letters | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 17801 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 17799 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 18629 (Why is no real title available?) | 1992-06-26 | Paper |
On the parallel recognition of unambiguous context-free languages
Theoretical Computer Science | 1991-01-01 | Paper |
On the complexity of the recognition of parallel 2D-image languages
Information Processing Letters | 1991-01-01 | Paper |
On optimal parallel computations for sequences of brackets
Theoretical Computer Science | 1991-01-01 | Paper |
Optimally edge-colouring outerplanar graphs is in NC
Theoretical Computer Science | 1990-01-01 | Paper |
Parallel construction of minimal suffix and factor automata
Information Processing Letters | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4172382 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4205980 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4213471 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4126700 (Why is no real title available?) | 1990-01-01 | Paper |
Parallel algorithms for a class of graphs generated recursively
Information Processing Letters | 1989-01-01 | Paper |
A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4155883 (Why is no real title available?) | 1989-01-01 | Paper |
Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
Information and Computation | 1989-01-01 | Paper |
Parallel O(log n) time edge-colouring of trees and Halin graphs
Information Processing Letters | 1988-01-01 | Paper |
On efficient parallel computations for some dynamic programming problems
Theoretical Computer Science | 1988-01-01 | Paper |
On efficient parallel computations of costs of paths on a grid graph
Information Processing Letters | 1988-01-01 | Paper |
Optimal parallel parsing of bracket languages
Theoretical Computer Science | 1987-01-01 | Paper |
Remarks on string-matching and one-way multihead automata
Information Processing Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4189511 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4033664 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4041248 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4047152 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4022660 (Why is no real title available?) | 1987-01-01 | Paper |
Parallel time O(log n) recognition of unambiguous context-free languages
Information and Computation | 1987-01-01 | Paper |
An application of Mehlhorn's algorithm for bracket languages to log(n) space recognition of input-driven languages
Information Processing Letters | 1986-01-01 | Paper |
On the complexity of parallel parsing of general context-free languages
Theoretical Computer Science | 1986-01-01 | Paper |
On the decidability of some problems about rational subsets of free partially commutative monoids
Theoretical Computer Science | 1986-01-01 | Paper |
The space complexity of the unique decipherability problem
Information Processing Letters | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4003548 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4011928 (Why is no real title available?) | 1986-01-01 | Paper |
A characterization of reversal-bounded multipushdown machine languages
Theoretical Computer Science | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3978426 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3926247 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3917742 (Why is no real title available?) | 1985-01-01 | Paper |
Fast recognition of pushdown automaton and context-free languages
Information and Control | 1985-01-01 | Paper |
On linear context-free languages and one-way multihead automata
Information Processing Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3958761 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3870628 (Why is no real title available?) | 1984-01-01 | Paper |
Time complexity of loop-free two-way pushdown automata
Information Processing Letters | 1983-01-01 | Paper |
A simulation result for two-way pushdown automata
Information Processing Letters | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3848633 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3833300 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3835373 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3835374 (Why is no real title available?) | 1983-01-01 | Paper |
Time complexity of unambiguous path systems
Information Processing Letters | 1982-01-01 | Paper |
A note on two-way nondeterministic pushdown automata
Information Processing Letters | 1982-01-01 | Paper |
A hardest language recognized by two-way nondeterministic pushdown automata
Information Processing Letters | 1981-01-01 | Paper |
Time complexity of languages recognized by one-way multihead pushdown automata
Information Processing Letters | 1981-01-01 | Paper |
An effective simulation of deterministic pushdown automata with many two- way and one-way heads
Information Processing Letters | 1981-01-01 | Paper |
A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
SIAM Journal on Computing | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3738917 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3765142 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3601071 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3526593 (Why is no real title available?) | 1976-01-01 | Paper |
The dimension of stability of stochastic automata
Information and Control | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3409253 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3409254 (Why is no real title available?) | 1973-01-01 | Paper |
