Quantitative bounds for the recursive sequence yn = A + yn / (yn-k). - Kenneth S. Berenhaut; John D. Foley; Stevo Stevic (Appl. Math. Lett., 2006)

The global attractivity of the rational difference equation yn = (yn-k + yn-m) / (1 + yn-k yn-m). - Kenneth S. Berenhaut; John D. Foley; Stevo Stevic (Appl. Math. Lett., 2007)

On the rational recursive sequence yn = A + yn-1/yn-m for small A. - Kenneth S. Berenhaut; Katherine M. Donadio; John D. Foley (Appl. Math. Lett., 2008)

Boundedness character of positive solutions of a higher order difference equation. - Kenneth S. Berenhaut; John D. Foley; Stevo Stevic (Int. J. Comput. Math., 2010)

Network Models from Petri Nets with Catalysts. - John C. Baez; John D. Foley; Joe Moeller (Compositionality, 2019)

Operads for complex system design specification, analysis and synthesis. - John D. Foley; Spencer Breiner; Eswaran Subrahmanian; John M. Dusel (CoRR, 2021)

Generalized partitioned local depth. - Kenneth S. Berenhaut; John D. Foley; Liangdongsheng Lyu (CoRR, 2023)