Raymond Greenlaw

Kauna Mufeti

Inroads, December, 2023

2022

ABET's cybersecurity accreditation: history, accreditation criteria, and status.

[BibT_eX]

[DOI]

Rajendra K. Raj

Inroads, 2022

2016

The structure and topology of rooted weighted trees modeling layered cyber-security systems.

[BibT_eX]

[DOI]

CoRR, 2016

The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems.

[BibT_eX]

[DOI]

Acta Cybern., 2016

On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem.

[BibT_eX]

[DOI]

Acta Cybern., 2016

2015

The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem.

[BibT_eX]

[DOI]

CoRR, 2015

Using a Message Board as a Teaching Tool in an Introductory Cyber-Security Course.

[BibT_eX]

[DOI]

Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

2014

Is it time for ABET cybersecurity criteria?

[BibT_eX]

[DOI]

Andrew Phillips

Allen S. Parrish

Inroads, 2014

2013

Network reconnaissance, attack, and defense laboratories for an introductory cyber-security course.

[BibT_eX]

[DOI]

Inroads, 2013

Survey of Clustering: Algorithms and Applications.

[BibT_eX]

[DOI]

Int. J. Inf. Retr. Res., 2013

2012

A mobility model for studying wireless communication and the complexity of problems in the model.

[BibT_eX]

[DOI]

Pattama Longani

Networks, 2012

Anatomy, dissection, and mechanics of an introductory cyber-security course's curriculum at the United States naval academy.

[BibT_eX]

[DOI]

Proceedings of the Annual Conference on Innovation and Technology in Computer Science Education, 2012

Developing and implementing an institution-wide introductory cyber-security course in record time.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual Southeast Regional Conference, 2012

2008

On the parallel complexity of hierarchical clustering and CC-complete problems.

[BibT_eX]

[DOI]

Complex., 2008

The Complexity of the Evolution of Graph Labelings.

[BibT_eX]

[DOI]

Proceedings of the Ninth ACIS International Conference on Software Engineering, 2008

2002

Object-Oriented Programming.

[BibT_eX]

[DOI]

Y. Daniel Liang

Proceedings of the Encyclopedia of Information Systems, 2002

Internet, Overview.

[BibT_eX]

[DOI]

Ellen M. Hepp

Proceedings of the Encyclopedia of Information Systems, 2002

Automata Theory.

[BibT_eX]

[DOI]

Sergio de Agostlno

Proceedings of the Encyclopedia of Information Systems, 2002

2000

Computing Prüfer codes efficiently in parallel.

[BibT_eX]

[DOI]

Rossella Petreschi

Discret. Appl. Math., 2000

A compendium of problems complete for symmetric logarithmic space.

[BibT_eX]

[DOI]

Carme Àlvarez

Comput. Complex., 2000

Fast Sequential and Parallel Algorithms for Label Selection to Obtain Space Efficient Implementations in a Software Configuration Management System.

[BibT_eX]

[DOI]

Charles Shipley

James Wogulis

Proceedings of the 2000 International Conference on Parallel Computing in Electrical Engineering (PARELEC 2000), 2000

1999

Parallel Computation.

[BibT_eX]

[DOI]

H. Hoover

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1996

Subtree Isomorphism is in DLOG for Nested Trees.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1996

1995

Cubic Graphs.

[BibT_eX]

[DOI]

Rossella Petreschi

ACM Comput. Surv., 1995

Optimal Edge Ranking of Trees in Polynomial Time.

[BibT_eX]

[DOI]

Pilar de la Torre

Alejandro A. Schäffer

Algorithmica, 1995

1994

The Parallel Complexity of Eden Growth, Solid-on-Solid Groth and Ballistic Deposition (Extended Abstract).

[BibT_eX]

[DOI]

Jonathan Machta

Proceedings of the Algorithms, 1994

NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Y. Daniel Liang

Glenn K. Manacher

Proceedings of the Parallel and Distributed Computing, 1994

The Parallel Complexity of Algorithms for Pattern Formation Models (Extended Abstract).

[BibT_eX]

[DOI]

Jonathan Machta

Proceedings of the Parallel and Distributed Computing, 1994

1993

Breadth-Depth Search is P-Complete.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1993

1992

A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching

[BibT_eX]

[DOI]

Inf. Comput., April, 1992

Optimal Tree Ranking is in NC.

[BibT_eX]

[DOI]

Pilar de la Torre

Teresa M. Przytycka

Parallel Process. Lett., 1992

The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1992

1991

Super critical tree numbering and optimal tree ranking are in NC.

[BibT_eX]

[DOI]

Pilar de la Torre

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

1990

Achieving speedups for APL on an SIMD distributed memory machine.

[BibT_eX]

[DOI]

Lawrence Snyder

Int. J. Parallel Program., 1990

The parallel complexity of queue versus stack breadth-first search.

[BibT_eX]

[DOI]

Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

1989

Ordered Vertex Removal and Subgraph Problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1989

1988

Achieving speedups for APL on an SSIMD parallel computer.

[BibT_eX]

[DOI]