Heintz (1983). "Definability and fast quantifier elimination in algebraically closed fields". Theoretical Computer Science. 24 (3): 239-277. doi:10.1016/0304-3975(83)90002-6.
Giusti (2001). "A Gröbner free alternative for polynomial system solving". Journal of Complexity. 17: 154-211. doi:10.1006/jcom.2000.0571.
Bank (2016). "Quiz games as a model for information hiding". Journal of Complexity. 34: 1-29. doi:10.1016/j.jco.2015.11.005.
Bank (1993). "Une borne optimale pour la programmation entière quasi-convexe". Bulletin de la Société Mathématique de France. 121 (2): 299-314. doi:10.24033/bsmf.2210.
Heintz (2013). "Software Engineering and complexity in effective Algebraic Geometry". Journal of Complexity. 29: 92-138. doi:10.1016/j.jco.2012.04.005.
Berenstein (1991). "Recent improvements in the complexity of the effective Nullstellensatz". Linear Algebra and Its Applications. 157: 203-215. doi:10.1016/0024-3795(91)90115-D.