Search for Author All Reviews
	Greenlaw, Raymond     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 5 reviews       Network reconnaissance, attack, and defense laboratories for an introductory cyber-security course Greenlaw R., Phillips A., Schultz J., Stahl D., Standard S.  ACMSE 2013 (Proceedings of the 51st ACM Southeast Conference, Savannah, GA, Apr 4-6, 2013) 1-6, 2013.  Type: Proceedings Anyone setting up a hands-on cybersecurity training course should read this paper. Greenlaw and associates describe a clear set of learning objectives, and the steps they took. While there are several components missing from their desc...... Nov 3 2014     Graph theory: modeling, applications, and algorithms Agnarsson G., Greenlaw R., Prentice-Hall, Inc., Upper Saddle River, NJ, 2007. 464 pp.  Type: Book (9780131423848) Graph theory is the study of mathematical structures used to model pairwise relations between objects from a certain collection. It has a broad range of applications in computer science (CS) and information engineering (IE), engineerin...... May 20 2008     Fundamentals of the theory of computation Greenlaw R., Hoover H., Morgan Kaufmann Publishers Inc., San Francisco, CA, 1998.  Type: Book (9781558604742) According to the authors, this book provides an elementary one-semester course in the theory of computation. More precisely, it is an introduction to the theory of computation from the language point of view. In presenting mathematical...... Mar 1 1999     Cubic graphs Greenlaw R., Petreschi R. ACM Computing Surveys 27(4): 471-495, 1995.  Type: Article A cubic graph is an undirected, loop-free graph, every vertex of which is of degree 3. Cubic graphs arise in various graph theory problems, including Hamiltonian graphs, 4-coloring, matching, planar graphs, and network flows. This pape...... Feb 1 1997     Limits to parallel computation Greenlaw R., Hoover H., Ruzzo W., Oxford University Press, Inc., New York, NY, 1995.  Type: Book (9780195085914) Anyone who has used Garey and Johnson’s famous reference [1] will agree that it is indispensable to any computer science library because the theory of NP-completeness is a useful tool, and the book has become this area&#...... Jul 1 1996
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy