A note on alternating one-pebble Turing machines with sublogarithmic space
Information Processing Letters
Some properties of one-pebble turing machines with sublogarithmic space
Theoretical Computer Science
Factoring and Testing Primes in Small Space
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A note on alternating one-pebble Turing machines with sublogarithmic space
Information Processing Letters
One Pebble Versus ε · log n Bits
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Automata with modulo counters and nondeterministic counter bounds
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 5.23 |