We stand with Ukraine  

John D. Foley

Orcid: 0000-0002-0087-5339

According to our database1, John D. Foley authored at least 7 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Generalized partitioned local depth.
[BibTeX]
[DOI]
Kenneth S. Berenhaut
,
John D. Foley
,
Liangdongsheng Lyu
CoRR, 2023

2021
Operads for complex system design specification, analysis and synthesis.
[BibTeX]
[DOI]
John D. Foley
,
Spencer Breiner
,
Eswaran Subrahmanian
,
John M. Dusel
CoRR, 2021

2019
Network Models from Petri Nets with Catalysts.
[BibTeX]
[DOI]
John C. Baez
,
John D. Foley
,
Joe Moeller
Compositionality, 2019

2010
Boundedness character of positive solutions of a higher order difference equation.
[BibTeX]
[DOI]
Kenneth S. Berenhaut
,
John D. Foley
,
Stevo Stevic
Int. J. Comput. Math., 2010

2008
On the rational recursive sequence y<sub>n</sub> = A + y<sub>n-1</sub>/y<sub>n-m</sub> for small A.
[BibTeX]
[DOI]
Kenneth S. Berenhaut
,
Katherine M. Donadio
,
John D. Foley
Appl. Math. Lett., 2008

2007
The global attractivity of the rational difference equation <i>y<sub>n</sub></i> = (<i>y<sub>n-k</sub></i> + <i>y<sub>n-m</sub></i>) / (1 + <i>y<sub>n-k</sub> y<sub>n-m</sub></i>).
[BibTeX]
[DOI]
Kenneth S. Berenhaut
,
John D. Foley
,
Stevo Stevic
Appl. Math. Lett., 2007

2006
Quantitative bounds for the recursive sequence <i>y<sub>n</sub></i> = A + <i>y<sub>n</sub></i> / <i>(y<sub>n-k</sub>)</i>.
[BibTeX]
[DOI]
Kenneth S. Berenhaut
,
John D. Foley
,
Stevo Stevic
Appl. Math. Lett., 2006


  Loading...