Unary Pushdown Automata and Auxiliary Space Lower Bounds
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Nondeterministic one-tape off-line turing machines and their time complexity
Journal of Automata, Languages and Combinatorics
One Pebble Versus ε · log n Bits
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Passively mobile communicating machines that use restricted space
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Two-way automata versus logarithmic space
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Passively mobile communicating machines that use restricted space
Theoretical Computer Science
Hi-index | 0.00 |