Experiences with Poker. - David Notkin; Lawrence Snyder 001; David Socha; Mary L. Bailey; Bruce Forstall; Kevin Gates; Raymond Greenlaw; William G. Griswold; Thomas J. Holman; Richard Korry; Gemini Lasswell; Robert Mitchell; et al. (PPOPP/PPEALS, 1988)

Achieving speedups for APL on an SSIMD parallel computer. - Raymond Greenlaw; Larry Snyder (ACM SIGAPL APL Quote Quad, 1988)

Ordered Vertex Removal and Subgraph Problems. - Raymond Greenlaw (J. Comput. Syst. Sci., 1989)

The parallel complexity of queue versus stack breadth-first search. - Raymond Greenlaw (SPDP, 1990)

Achieving speedups for APL on an SIMD distributed memory machine. - Raymond Greenlaw; Lawrence Snyder 001 (Int. J. Parallel Program., 1990)

Super critical tree numbering and optimal tree ranking are in NC. - Pilar de la Torre; Raymond Greenlaw (SPDP, 1991)

The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem. - Raymond Greenlaw (Math. Syst. Theory, 1992)

Optimal Tree Ranking is in NC. - Pilar de la Torre; Raymond Greenlaw; Teresa M. Przytycka (Parallel Process. Lett., 1992)

A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching - Raymond Greenlaw (Inf. Comput., 1992)

Breadth-Depth Search is P-Complete. - Raymond Greenlaw (Parallel Process. Lett., 1993)

The Parallel Complexity of Algorithms for Pattern Formation Models (Extended Abstract). - Raymond Greenlaw; Jonathan Machta (Canada-France Conference on Parallel and Distributed Computing, 1994)

NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract). - Y. Daniel Liang; Raymond Greenlaw; Glenn K. Manacher (Canada-France Conference on Parallel and Distributed Computing, 1994)

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

Optimal Edge Ranking of Trees in Polynomial Time. - Pilar de la Torre; Raymond Greenlaw; Alejandro A. Schäffer (Algorithmica, 1995)

Cubic Graphs. - Raymond Greenlaw; Rossella Petreschi (ACM Comput. Surv., 1995)

Subtree Isomorphism is in DLOG for Nested Trees. - Raymond Greenlaw (Int. J. Found. Comput. Sci., 1996)

Parallel Computation. - Raymond Greenlaw; H. Hoover (Algorithms and Theory of Computation Handbook, 1999)

Fast Sequential and Parallel Algorithms for Label Selection to Obtain Space Efficient Implementations in a Software Configuration Management System. - Raymond Greenlaw; Charles Shipley; James Wogulis (PARELEC, 2000)

A compendium of problems complete for symmetric logarithmic space. - Carme Àlvarez; Raymond Greenlaw (Comput. Complex., 2000)

Computing Prüfer codes efficiently in parallel. - Raymond Greenlaw; Rossella Petreschi (Discret. Appl. Math., 2000)

Automata Theory. - Sergio de Agostlno; Raymond Greenlaw (Encyclopedia of Information Systems, 2002)

Internet, Overview. - Raymond Greenlaw; Ellen M. Hepp (Encyclopedia of Information Systems, 2002)

Object-Oriented Programming. - Raymond Greenlaw; Y. Daniel Liang (Encyclopedia of Information Systems, 2002)

The Complexity of the Evolution of Graph Labelings. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (SNPD, 2008)

On the parallel complexity of hierarchical clustering and CC-complete problems. - Raymond Greenlaw; Sanpawat Kantabutra (Complex., 2008)

Developing and implementing an institution-wide introductory cyber-security course in record time. - Christopher W. Brown 001; Frederick Crabbe; Rita Doerr; Raymond Greenlaw; Chris Hoffmeister; Justin C. Monroe; Donald Needham; Andrew Phillips; Stephen Schall; John Schultz; Steven Simon; David Stahl; et al. (ACM Southeast Regional Conference, 2012)

Anatomy, dissection, and mechanics of an introductory cyber-security course's curriculum at the United States naval academy. - Christopher W. Brown 001; Frederick Crabbe; Rita Doerr; Raymond Greenlaw; Chris Hoffmeister; Justin C. Monroe; Donald Needham; Andrew Phillips; Anthony G. Pollman; Stephen Schall; John Schultz; Steven Simon; et al. (ITiCSE, 2012)

A mobility model for studying wireless communication and the complexity of problems in the model. - Raymond Greenlaw; Sanpawat Kantabutra; Pattama Longani (Networks, 2012)

Survey of Clustering: Algorithms and Applications. - Raymond Greenlaw; Sanpawat Kantabutra (Int. J. Inf. Retr. Res., 2013)

Network reconnaissance, attack, and defense laboratories for an introductory cyber-security course. - Sarah Standard; Raymond Greenlaw; Andrew Phillips; David Stahl; John Schultz (Inroads, 2013)

Is it time for ABET cybersecurity criteria? - Raymond Greenlaw; Andrew Phillips; Allen S. Parrish (Inroads, 2014)

Using a Message Board as a Teaching Tool in an Introductory Cyber-Security Course. - Raymond Greenlaw; Christopher W. Brown 001; Zachary Dannelly; Andrew Phillips; Sarah Standard (SIGCSE, 2015)

The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (CoRR, 2015)

On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (Acta Cybern., 2016)

The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (Acta Cybern., 2016)

The structure and topology of rooted weighted trees modeling layered cyber-security systems. - Geir Agnarsson; Raymond Greenlaw; Sanpawat Kantabutra (CoRR, 2016)

ABET's cybersecurity accreditation: history, accreditation criteria, and status. - Raymond Greenlaw; Rajendra K. Raj (Inroads, 2022)

Combating Cybercrime by Spawning Two-Year, ABET-Accreditable Programs in Cybersecurity in African Context. - Raymond Greenlaw; Kauna Mufeti (Inroads, 2023)