Raymond Greenlaw - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2023

Combating Cybercrime by Spawning Two-Year, ABET-Accreditable Programs in Cybersecurity in African ContextRaymond Greenlaw, Kauna Mufeti. inroads, 14(4):57-65, December 2023. [doi]

2022

ABET's cybersecurity accreditation: history, accreditation criteria, and statusRaymond Greenlaw, Rajendra K. Raj. inroads, 13(4):14-21, 2022. [doi]

2016

The Structure of Rooted Weighted Trees Modeling Layered Cyber-security SystemsGeir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra. actaC, 22(4):735-769, 2016. [doi]

On Cyber Attacks and the Maximum-Weight Rooted-Subtree ProblemGeir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra. actaC, 22(3):591-612, 2016. [doi]

2015

Using a Message Board as a Teaching Tool in an Introductory Cyber-Security CourseRaymond Greenlaw, Christopher Brown, Zachary Dannelly, Andrew Phillips, Sarah Standard. sigcse 2015: 308-313 [doi]

2014

Is it time for ABET cybersecurity criteria?Raymond Greenlaw, Andrew Phillips, Allen Parrish. inroads, 5(3):44-48, 2014. [doi]

2013

2012

Anatomy, dissection, and mechanics of an introductory cyber-security course's curriculum at the United States naval academyChristopher Brown, Frederick Crabbe, Rita Doerr, Raymond Greenlaw, Chris Hoffmeister, Justin Monroe, Donald Needham, Andrew Phillips, Anthony Pollman, Stephen Schall, John Schultz, Steven Simon, David Stahl, Sarah Standard. iticse 2012: 303-308 [doi]

Developing and implementing an institution-wide introductory cyber-security course in record timeChristopher Brown, Frederick Crabbe, Rita Doerr, Raymond Greenlaw, Chris Hoffmeister, Justin Monroe, Donald Needham, Andrew Phillips, Stephen Schall, John Schultz, Steven Simon, David Stahl, Sarah Standard. ACMse 2012: 95-100 [doi]

A mobility model for studying wireless communication and the complexity of problems in the modelRaymond Greenlaw, Sanpawat Kantabutra, Pattama Longani. networks, 59(3):320-330, 2012. [doi]

2008

The Complexity of the Evolution of Graph LabelingsGeir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra. snpd 2008: 79-84 [doi]

On the parallel complexity of hierarchical clustering and CC-complete problemsRaymond Greenlaw, Sanpawat Kantabutra. complexity, 14(2):18-28, 2008. [doi]

2000

Computing Prüfer codes efficiently in parallelRaymond Greenlaw, Rossella Petreschi. DAM, 102(3):205-222, 2000.

Fast Sequential and Parallel Algorithms for Label Selection to Obtain Space Efficient Implementations in a Software Configuration Management SystemRaymond Greenlaw, Charles Shipley, James Wogulis. parelec 2000: 43-49 [doi]

A compendium of problems complete for symmetric logarithmic spaceCarme Àlvarez, Raymond Greenlaw. cc, 9(2):123-145, 2000. [doi]

1999

Parallel ComputationRaymond Greenlaw, H. Hoover. In Mikhail J. Atallah, editor, Algorithms and Theory of Computation Handbook. Chapman & Hall/CRC Applied Algorithms and Data Structures series, CRC Press, 1999. [doi]

1996

Subtree Isomorphism is in DLOG for Nested TreesRaymond Greenlaw. ijfcs, 7(2):161-168, 1996.

1995

Optimal Edge Ranking of Trees in Polynomial TimePilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer. algorithmica, 13(6):592-618, 1995.

Cubic GraphsRaymond Greenlaw, Rossella Petreschi. ACM Comput. Surv., 27(4):471-495, 1995.

1994

The Parallel Complexity of Algorithms for Pattern Formation Models (Extended Abstract)Raymond Greenlaw, Jonathan Machta. cfcp 1994: 23-34

The Parallel Complexity of Eden Growth, Solid-on-Solid Groth and Ballistic Deposition (Extended Abstract)Raymond Greenlaw, Jonathan Machta. esa 1994: 436-447

NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract)Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher. cfcp 1994: 45-57

1993

Optimal Edge Ranking of Trees in Polynomial TimePilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer. soda 1993: 138-144

Breadth-Depth Search is P-CompleteRaymond Greenlaw. ppl, 3:209-222, 1993.

1992

Optimal Tree Ranking is in NCPilar de la Torre, Raymond Greenlaw, Teresa M. Przytycka. ppl, 2:31-41, 1992.

A Model Classifying Algorithms as Inherently Sequential with Applications to Graph SearchingRaymond Greenlaw. iandc, 97(2):133-149, April 1992.

The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph ProblemRaymond Greenlaw. mst, 25(3):161-175, 1992.

1991

Super critical tree numbering and optimal tree ranking are in NCPilar de la Torre, Raymond Greenlaw. spdp 1991: 767-773 [doi]

1990

The parallel complexity of queue versus stack breadth-first searchRaymond Greenlaw. spdp 1990: 834-837 [doi]

Achieving speedups for APL on an SIMD distributed memory machineRaymond Greenlaw, Lawrence Snyder. ijpp, 19(2):111-127, 1990. [doi]

1989

Ordered Vertex Removal and Subgraph ProblemsRaymond Greenlaw. jcss, 39(3):323-342, 1989.

1988

Sign in or sign up to see more results.

runs on WebDSL