On the Complexity of Free Monoid Morphisms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
Reachability Problems: An Update
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Unambiguous Functions in Logarithmic Space
Fundamenta Informaticae
Computational Complexity
Hi-index | 0.00 |