Jonathan Stokes

Orcid: 0000-0002-3266-1474

According to our database1, Jonathan Stokes authored at least 9 papers between 2007 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Predictive model-based interventions to reduce outpatient no-shows: a rapid systematic review.
J. Am. Medical Informatics Assoc., February, 2023

2019
Star sampling with and without replacement.
CoRR, 2019

2018
Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree.
Inf. Process. Lett., 2018

Online estimation for finding a near-maximum value in a large list of numerical data.
Proceedings of the 52nd Annual Conference on Information Sciences and Systems, 2018

2017
On the number of star samples to find a vertex or edge with given degree in a graph.
Proceedings of the 51st Annual Conference on Information Sciences and Systems, 2017

2016
On Random Walks and Random Sampling to Find Max Degree Nodes in Assortative Erdos Renyi Graphs.
Proceedings of the 2016 IEEE Global Communications Conference, 2016

A Markov chain model for the search time for max degree nodes in a graph using a biased random walk.
Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

The self-avoiding walk-jump (SAWJ) algorithm for finding maximum degree nodes in large graphs.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

2007
Fuzzy Individual Model (FIM) for Realistic Crowd Simulation: Preliminary Results.
Proceedings of the FUZZ-IEEE 2007, 2007


  Loading...