Kenneth S. Berenhaut

According to our database1, Kenneth S. Berenhaut authored at least 14 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Generalized partitioned local depth.
CoRR, 2023

2020
Hotspot detection in pancreatic neuroendocrine images using local depth.
Proceedings of the Medical Imaging 2020: Digital Pathology, 2020

2018
A new look at clustering coefficients with generalization to weighted and multi-faction networks.
Soc. Networks, 2018

The degree-wise effect of a second step for a random walk on a graph.
J. Appl. Probab., 2018

2017
Symmetry in Domination for Hypergraphs with Choice.
Symmetry, 2017

2014
Deterministic walks with choice.
Discret. Appl. Math., 2014

Analysis of network address shuffling as a moving target defense.
Proceedings of the IEEE International Conference on Communications, 2014

2012
Directional Bias and Pheromone for Discovery and Coverage on Networks.
Proceedings of the Sixth IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2012

2010
Boundedness character of positive solutions of a higher order difference equation.
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.
Appl. Math. Lett., 2008

2007
Bounds for fourth-order [0, 1] difference equations.
Comput. Math. Appl., 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>).
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>.
Appl. Math. Lett., 2006

2005
Bounds for Inverses of Triangular Toeplitz Matrices.
SIAM J. Matrix Anal. Appl., 2005


  Loading...