ACM SIGACT News
How to simulate free will in a computational device
ACM Computing Surveys (CSUR)
Probabilistic rebound Turing machines
Theoretical Computer Science
Models of Computation, Riemann Hypothesis, and Classical Mathematics
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Languages Recognized with Unbounded Error by Quantum Finite Automata
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory 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
Quantum computation with devices whose contents are never read
UC'10 Proceedings of the 9th international conference on Unconventional computation
Unbounded-error quantum computation with small space bounds
Information and Computation
Models of pushdown automata with reset
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Quantum computation with write-only memory
Natural Computing: an international journal
Frequency prediction of functions
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Proving the Power of Postselection
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Hi-index | 0.00 |