default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaymond Greenlaw
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j21]Raymond Greenlaw, Kauna Mufeti:
Combating Cybercrime by Spawning Two-Year, ABET-Accreditable Programs in Cybersecurity in African Context. Inroads 14(4): 57-65 (2023)- 2022
- [j20]Raymond Greenlaw, Rajendra K. Raj
:
ABET's cybersecurity accreditation: history, accreditation criteria, and status. Inroads 13(4): 14-21 (2022)
2010 – 2019
- 2016
- [j19]Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra:
On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem. Acta Cybern. 22(3): 591-612 (2016) - [j18]Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra:
The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems. Acta Cybern. 22(4): 735-769 (2016) - [i3]Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra:
The structure and topology of rooted weighted trees modeling layered cyber-security systems. CoRR abs/1605.03569 (2016) - 2015
- [c13]Raymond Greenlaw, Christopher W. Brown, Zachary Dannelly, Andrew Phillips, Sarah Standard:
Using a Message Board as a Teaching Tool in an Introductory Cyber-Security Course. SIGCSE 2015: 308-313 - [i2]Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra:
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem. CoRR abs/1508.03657 (2015) - 2014
- [j17]Raymond Greenlaw, Andrew Phillips, Allen S. Parrish:
Is it time for ABET cybersecurity criteria? Inroads 5(3): 44-48 (2014) - 2013
- [j16]Raymond Greenlaw, Sanpawat Kantabutra:
Survey of Clustering: Algorithms and Applications. Int. J. Inf. Retr. Res. 3(2): 1-29 (2013) - [j15]Sarah Standard, Raymond Greenlaw, Andrew Phillips, David Stahl, John Schultz:
Network reconnaissance, attack, and defense laboratories for an introductory cyber-security course. Inroads 4(3): 52-64 (2013) - [c12]Raymond Greenlaw, Andrew Phillips, John Schultz, David Stahl, Sarah Standard:
Network reconnaissance, attack, and defense laboratories for an introductory cyber-security course. ACM Southeast Regional Conference 2013: 29:1-29:6 - 2012
- [j14]Raymond Greenlaw, Sanpawat Kantabutra, Pattama Longani:
A mobility model for studying wireless communication and the complexity of problems in the model. Networks 59(3): 320-330 (2012) - [c11]Christopher W. 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:
Developing and implementing an institution-wide introductory cyber-security course in record time. ACM Southeast Regional Conference 2012: 95-100 - [c10]Christopher W. Brown, Frederick Crabbe, Rita Doerr, Raymond Greenlaw, Chris Hoffmeister, Justin Monroe, Donald Needham, Andrew Phillips, Anthony G. Pollman, Stephen Schall, John Schultz, Steven Simon, David Stahl, Sarah Standard:
Anatomy, dissection, and mechanics of an introductory cyber-security course's curriculum at the United States naval academy. ITiCSE 2012: 303-308
2000 – 2009
- 2008
- [j13]Raymond Greenlaw, Sanpawat Kantabutra:
On the parallel complexity of hierarchical clustering and CC-complete problems. Complex. 14(2): 18-28 (2008) - [c9]Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra:
The Complexity of the Evolution of Graph Labelings. SNPD 2008: 79-84 - 2002
- [p4]Sergio de Agostlno, Raymond Greenlaw:
Automata Theory. Encyclopedia of Information Systems 2002: 47-63 - [p3]Raymond Greenlaw, Y. Daniel Liang:
Object-Oriented Programming. Encyclopedia of Information Systems 2002: 347-361 - [p2]Raymond Greenlaw, Ellen M. Hepp:
Internet, Overview. Encyclopedia of Information Systems 2002: 667-681 - 2000
- [j12]Carme Àlvarez, Raymond Greenlaw:
A compendium of problems complete for symmetric logarithmic space. Comput. Complex. 9(2): 123-145 (2000) - [j11]Raymond Greenlaw, Rossella Petreschi:
Computing Prüfer codes efficiently in parallel. Discret. Appl. Math. 102(3): 205-222 (2000) - [c8]Raymond Greenlaw, Charles Shipley, James Wogulis:
Fast Sequential and Parallel Algorithms for Label Selection to Obtain Space Efficient Implementations in a Software Configuration Management System. PARELEC 2000: 43-49
1990 – 1999
- 1999
- [p1]Raymond Greenlaw, H. Hoover:
Parallel Computation. Algorithms and Theory of Computation Handbook 1999 - 1996
- [j10]Raymond Greenlaw:
Subtree Isomorphism is in DLOG for Nested Trees. Int. J. Found. Comput. Sci. 7(2): 161-168 (1996) - [i1]Carme Àlvarez, Raymond Greenlaw:
A Compendium of Problems Complete for Symmetric Logarithmic Space. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j9]Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer:
Optimal Edge Ranking of Trees in Polynomial Time. Algorithmica 13(6): 592-618 (1995) - [j8]Raymond Greenlaw, Rossella Petreschi:
Cubic Graphs. ACM Comput. Surv. 27(4): 471-495 (1995) - 1994
- [c7]Raymond Greenlaw, Jonathan Machta:
The Parallel Complexity of Algorithms for Pattern Formation Models (Extended Abstract). Canada-France Conference on Parallel and Distributed Computing 1994: 23-34 - [c6]Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher:
NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract). Canada-France Conference on Parallel and Distributed Computing 1994: 45-57 - [c5]Raymond Greenlaw, Jonathan Machta:
The Parallel Complexity of Eden Growth, Solid-on-Solid Groth and Ballistic Deposition (Extended Abstract). ESA 1994: 436-447 - 1993
- [j7]Raymond Greenlaw:
Breadth-Depth Search is P-Complete. Parallel Process. Lett. 3: 209-222 (1993) - [c4]Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer:
Optimal Edge Ranking of Trees in Polynomial Time. SODA 1993: 138-144 - 1992
- [j6]Raymond Greenlaw:
A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching. Inf. Comput. 97(2): 133-149 (1992) - [j5]Raymond Greenlaw:
The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem. Math. Syst. Theory 25(3): 161-175 (1992) - [j4]Pilar de la Torre, Raymond Greenlaw, Teresa M. Przytycka:
Optimal Tree Ranking is in NC. Parallel Process. Lett. 2: 31-41 (1992) - 1991
- [c3]Pilar de la Torre, Raymond Greenlaw:
Super critical tree numbering and optimal tree ranking are in NC. SPDP 1991: 767-773 - 1990
- [j3]Raymond Greenlaw, Lawrence Snyder:
Achieving speedups for APL on an SIMD distributed memory machine. Int. J. Parallel Program. 19(2): 111-127 (1990) - [c2]Raymond Greenlaw:
The parallel complexity of queue versus stack breadth-first search. SPDP 1990: 834-837
1980 – 1989
- 1989
- [j2]Raymond Greenlaw:
Ordered Vertex Removal and Subgraph Problems. J. Comput. Syst. Sci. 39(3): 323-342 (1989) - 1988
- [j1]Raymond Greenlaw, Larry Snyder:
Achieving speedups for APL on an SSIMD parallel computer. ACM SIGAPL APL Quote Quad 18(4): 3-8 (1988) - [c1]David Notkin, Lawrence Snyder, David Socha, Mary L. Bailey, Bruce Forstall, Kevin Gates, Raymond Greenlaw, William G. Griswold, Thomas J. Holman, Richard Korry, Gemini Lasswell, Robert Mitchell, Philip A. Nelson:
Experiences with Poker. PPOPP/PPEALS 1988: 10-20
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-30 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
