@article(DBLP:journals/apal/Allen91,
 author       = {Bill Allen},
 year         = {1991},
 title        = {Arithmetizing Uniform {NC}},
 journal      = {Ann. Pure Appl. Logic},
 volume       = {53},
 number       = {1},
 pages        = {1--50},
 doi          = {10.1016/0168-0072(91)90057-S},
)
@article(DBLP:journals/cc/BellantoniC92,
 author       = {Stephen Bellantoni and Stephen A. Cook},
 year         = {1992},
 title        = {A New Recursion-Theoretic Characterization of the Polytime Functions},
 journal      = {Computational Complexity},
 volume       = {2},
 pages        = {97--110},
 doi          = {10.1007/BF01201998},
)
@article(DBLP:journals/cc/Bloch94,
 author       = {Stephen A. Bloch},
 year         = {1994},
 title        = {Function-Algebraic Characterizations of Log and Polylog Parallel Time},
 journal      = {Computational Complexity},
 volume       = {4},
 pages        = {175--205},
 doi          = {10.1007/BF01202288},
)
@article(DBLP:journals/iandc/BonfanteKMO16,
 author       = {Guillaume Bonfante and Reinhard Kahle and Jean{-}Yves Marion and Isabel Oitavem},
 year         = {2016},
 title        = {Two function algebras defining functions in \unhbox\voidb@x \hbox{NC}${}^{\unhbox\voidb@x \hbox{k}}$ boolean circuits},
 journal      = {Inf. Comput.},
 volume       = {248},
 pages        = {82--103},
 doi          = {10.1016/j.ic.2015.12.009},
)
@article(DBLP:journals/jacm/ChandraKS81,
 author       = {Ashok K. Chandra and Dexter Kozen and Larry J. Stockmeyer},
 year         = {1981},
 title        = {Alternation},
 journal      = {J. {ACM}},
 volume       = {28},
 number       = {1},
 pages        = {114--133},
 doi          = {10.1145/322234.322243},
)
@article(Clote:89,
 author       = {P. Clote},
 year         = {1989},
 title        = {Sequential, machine-independent characterizations of the parallel complexity classes \unhbox\voidb@x \hbox{ALOGTIME}, \unhbox\voidb@x \hbox{AC}$^k$, \unhbox\voidb@x \hbox{NC}$^k$ and \unhbox\voidb@x \hbox{NC}},
 journal      = {Feasible Mathematics, \unhbox\voidb@x \hbox{Birkha{\"u}ser, 49-69}},
 doi          = {10.1007/978-1-4612-3466-1$\_$4},
)
@incollection(Cob:65,
 author       = {A. Cobham},
 year         = {1962},
 title        = {The intrinsic computational difficulty of functions},
 editor       = {Bar-Hillel, Y.},
 booktitle    = {Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science},
 publisher    = {North-Holland},
 address      = {Amsterdam},
 pages        = {24--30},
 doi          = {10.2307/2270886},
)
@article(DBLP:journals/iandc/Hofmann03,
 author       = {Martin Hofmann},
 year         = {2003},
 title        = {Linear types and non-size-increasing polynomial time computation},
 journal      = {Inf. Comput.},
 volume       = {183},
 number       = {1},
 pages        = {57--85},
 doi          = {10.1016/S0890-5401(03)00009-9},
)
@article(DBLP:journals/tocl/HofmannS10,
 author       = {Martin Hofmann and Ulrich Sch{\"{o}}pp},
 year         = {2010},
 title        = {Pure pointer programs with iteration},
 journal      = {{ACM} Trans. Comput. Log.},
 volume       = {11},
 number       = {4},
 pages        = {26:1--26:23},
 doi          = {10.1145/1805950.1805956},
)
@article(DBLP:journals/cc/Kuroda04,
 author       = {Satoru Kuroda},
 year         = {2004},
 title        = {Recursion Schemata for Slowly Growing Depth Circuit Classes},
 journal      = {Computational Complexity},
 volume       = {13},
 number       = {1-2},
 pages        = {69--89},
 doi          = {10.1007/s00037-004-0184-4},
)
@inproceedings(DBLP:conf/lics/Leivant91,
 author       = {Daniel Leivant},
 year         = {1991},
 title        = {A Foundational Delineation of Computational Feasiblity},
 booktitle    = {Proceedings of the Sixth Annual Symposium on Logic in Computer Science {(LICS} '91), Amsterdam, The Netherlands, July 15-18, 1991},
 publisher    = {{IEEE} Computer Society},
 pages        = {2--11},
 doi          = {10.1109/LICS.1991.151625},
)
@inproceedings(DBLP:conf/csl/Marion94,
 author       = {Daniel Leivant and Jean-Yves Marion},
 year         = {1994},
 title        = {Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space},
 editor       = {Leszek Pacholski and Jerzy Tiuryn},
 booktitle    = {CSL},
 series       = {Lecture Notes in Computer Science},
 volume       = {933},
 publisher    = {Springer},
 pages        = {486--500},
 doi          = {10.1016/0022-0000(83)90008-9},
)
@article(DBLP:journals/tcs/LeivantM00,
 author       = {Daniel Leivant and Jean-Yves Marion},
 year         = {2000},
 title        = {A characterization of alternating log time by ramified recurrence},
 journal      = {Theor. Comput. Sci.},
 volume       = {236},
 number       = {1-2},
 pages        = {193--208},
 doi          = {10.1016/S0304-3975(99)00209-1},
)
@article(leivant:inria-00099077,
 author       = {Daniel Leivant and Jean-Yves Marion},
 year         = {2000},
 title        = {{Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-Space}},
 journal      = {{Information and Computation}},
 pages        = {12 p},
 url          = {https://hal.inria.fr/inria-00099077},
 note         = {To appear. Article dans revue scientifique avec comit{\'e} de lecture.},
)
@techreport(TR:Lind,
 author       = {J. C. Lind},
 year         = {1974},
 title        = {Computing in logarithmic space},
 type         = {Technical Report},
 institution  = {Massachusetts Institute of Technology},
)
@article(DBLP:journals/jcss/Ruzzo81,
 author       = {Walter L. Ruzzo},
 year         = {1981},
 title        = {On Uniform Circuit Complexity},
 journal      = {J. Comput. Syst. Sci.},
 volume       = {22},
 number       = {3},
 pages        = {365--383},
 doi          = {10.1016/0022-0000(81)90038-6},
)