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)
The space complexity of k-tree isomorphism
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Longest paths in planar DAGs in unambiguous logspace
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
Fundamenta Informaticae
Unambiguous Functions in Logarithmic Space
Fundamenta Informaticae
Computational Complexity
| Hi-index | 0.01 |