1. A.V. AHO, J.E. HOPCROFT and J.D. ULLMAN, The design and analysis of computer algorithms, Addison-Wesley, Reading 1974.
2. A.V. AHO, J.E. HOPCROFT and J.D. ULLMAN, Data structures and algorithms, Addison-Wesley, Reading 1983.
3. D. ANGLUIN and L. VALIANT, Fast probabilistic algorithms for hamiltonian circuits and matchings, J. Comput. System Sci. 18 (1979), pp. 155–193.
4. A. BERTONI, G. MAURI and N. SABADINI, Simulations among classes of random access machines and equivalence among numbers succinctly represented, Annals Discrete Math. 25 (1985) pp. 65–90.
5. J.F. BUSS and J. GOLDSMITH, Nondeterminism within P, STACS '91, Lect. Notes Comput. Sci. 480 (1991), pp. 348–359.