Time and tape complexity of pushdown automaton languages, Information and Control, vol.13, issue.3, pp.186-206, 1968. ,
DOI : 10.1016/S0019-9958(68)91087-5
Logic Programming and Logarithmic Space, APLAS. Ed. by Jacques Garrigue, pp.39-57, 2014. ,
DOI : 10.1007/978-3-319-12736-1_3
URL : https://hal.archives-ouvertes.fr/hal-01309159
Memoization for Unary Logic Programming: Characterizing Ptime, Research Report, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01107377
Characterizing co-NL by a group action, Mathematical Structures in Computer Science FirstView, pp.1-33, 2014. ,
DOI : 10.1147/rd.105.0388
URL : https://hal.archives-ouvertes.fr/hal-01005705
Logarithmic space and permutations, Information and Computation, vol.248, 2015. ,
DOI : 10.1016/j.ic.2014.01.018
URL : https://hal.archives-ouvertes.fr/hal-01005701
A new recursion-theoretic characterization of the polytime functions (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , STOC '92, pp.283-93, 1992. ,
DOI : 10.1145/129712.129740
Bounded Arithmetic, Ed. by Bibliopolis, vol.3, 1986. ,
Hierarchies of One-Way Multihead Automata Languages, Theoret. Comput. Sci, vol.483, pp.153-181, 1986. ,
The intrinsic computational difficulty of functions In: Logic, methodology and philosophy of science: Proceedings of the 1964 international congress held at the Hebrew university of Jerusalem, Israel, Studies in Logic and the foundations of mathematics, pp.24-30, 1964. ,
Linear Time Simulation of Deterministic Two-Way Pushdown Automata, In: IFIP Congress, issue.1, pp.75-80, 1971. ,
A Short Introduction to Implicit Computational Complexity, LNCS, vol.7388, pp.89-109, 2011. ,
Contributions to the Model Theory of Finite Structures, 1973. ,
Bounded linear logic: a modular approach to polynomial-time computability, Theoretical Computer Science, vol.97, issue.1, pp.1-66, 1992. ,
DOI : 10.1016/0304-3975(92)90386-T
Pure Pointer Programs with Iteration, In: ACM Transactions on Computational Logic, vol.11, issue.4, 2010. ,
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems, Electronic Proceedings in Theoretical Computer Science, vol.1, pp.93-107, 2008. ,
DOI : 10.4204/EPTCS.1.9
Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata, Journal of Computer and System Sciences, vol.5, issue.2, pp.88-117, 1971. ,
DOI : 10.1016/S0022-0000(71)80029-6
Stratified functional programs and computational complexity, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, pp.325-333, 1993. ,
DOI : 10.1145/158511.158659
On tape-bounded complexity classes and multi-head finite automata, 14th Annual Symposium on Switching and Automata Theory (swat 1973), pp.138-144, 1973. ,
DOI : 10.1109/SWAT.1973.20
k + 1 Heads Are Better than k, Journal of the ACM, vol.25, issue.2, pp.337-340, 1978. ,
DOI : 10.1145/322063.322076