| On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem. | 0 | 0.34 | 2016 |
| The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems. | 0 | 0.34 | 2016 |
| The structure and topology of rooted weighted trees modeling layered cyber-security systems. | 0 | 0.34 | 2016 |
| Using a Message Board as a Teaching Tool in an Introductory Cyber-Security Course | 0 | 0.34 | 2015 |
| The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem | 1 | 0.39 | 2015 |
| Is it time for ABET cybersecurity criteria? | 0 | 0.34 | 2014 |
| Survey of Clustering: Algorithms and Applications | 3 | 0.38 | 2013 |
| Network reconnaissance, attack, and defense laboratories for an introductory cyber-security course | 2 | 0.41 | 2013 |
| Network reconnaissance, attack, and defense laboratories for an introductory cyber-security course | 0 | 0.34 | 2013 |
| Anatomy, dissection, and mechanics of an introductory cyber-security course's curriculum at the United States naval academy | 3 | 0.85 | 2012 |
| A mobility model for studying wireless communication and the complexity of problems in the model | 2 | 0.50 | 2012 |
| Developing and implementing an institution-wide introductory cyber-security course in record time | 0 | 0.34 | 2012 |
| The Complexity of the Evolution of Graph Labelings | 1 | 0.39 | 2008 |
| On the parallel complexity of hierarchical clustering and CC-complete problems | 4 | 0.49 | 2008 |
| Fast Sequential and Parallel Algorithms for Label Selection to Obtain Space Efficient Implementations in a Software Configuration Management System | 0 | 0.34 | 2000 |
| Computing Prufer Codes Efficiently In Parallel | 5 | 0.53 | 2000 |
| Subtree Isomorphism is in DLOG for Nested Trees | 2 | 0.51 | 1996 |
| A compendium of problems complete for symmetric logarithmic space | 19 | 1.23 | 1996 |
| Cubic graphs | 23 | 2.08 | 1995 |
| The parallel complexity of algorithms for pattern formation models (extended abstract) | 0 | 0.34 | 1994 |
| The Parallel Complexity of Eden Growth, Solid-on-Solid Groth and Ballistic Deposition (Extended Abstract) | 0 | 0.34 | 1994 |
| NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract) | 0 | 0.34 | 1994 |
| Breadth-Depth Search is P-complete | 5 | 0.53 | 1993 |
| Optimal Edge Ranking of Trees in Polynomial Time. | 37 | 1.89 | 1993 |
| The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem | 2 | 0.70 | 1992 |
| Optimal Tree Ranking is in NC | 8 | 0.75 | 1992 |
| A model classifying algorithms as inherently sequential with applications to graph searching | 13 | 0.96 | 1992 |
| Super critical tree numbering and optimal tree ranking are in NC | 2 | 0.49 | 1991 |
| The parallel complexity of queue versus stack breadth-first search | 0 | 0.34 | 1990 |
| Achieving speedups for APL on an SIMD distributed memory machine | 6 | 0.83 | 1990 |
| Ordered vertex removal and subgraph problems | 4 | 0.61 | 1989 |
