Non-closure property of space-bounded two-dimensional alternating turing machines
Information Sciences—Applications: An International Journal
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
A leaf-size hierarchy of alternating rebound Turing machines
Journal of Automata, Languages and Combinatorics
Unary Pushdown Automata and Auxiliary Space Lower Bounds
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Space Hierarchy Theorem Revised
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Space hierarchy theorem revised
Theoretical Computer Science - Mathematical foundations of computer science
A note on one-pebble two-dimensional Turing machines
Information Sciences: an International Journal
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
Journal of Computer Science and Technology
A note on alternating one-pebble Turing machines with sublogarithmic space
Information Processing Letters
Information Sciences: an International Journal
Size matters: logarithmic space is real time
International Journal of Computers and Applications
A space lower bound of two-dimensional probabilistic turing machines
DLT'02 Proceedings of the 6th international conference on Developments in language theory
One Pebble Versus ε · log n Bits
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Two-way unary automata versus logarithmic space
Information and Computation
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
Models of pushdown automata with reset
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Passively mobile communicating machines that use restricted space
Theoretical Computer Science
Quantum computation with write-only memory
Natural Computing: an international journal
Functional programming in sublinear space
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Two-Way automata making choices only at the endmarkers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Unary coded NP-complete languages in ASPACE (log log n)
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 0.00 |