| 2012 | ||
|---|---|---|
| j13 | 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 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 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: Anatomy, dissection, and mechanics of an introductory cyber-security course's curriculum at the United States naval academy. ITiCSE 2012: 303-308 | |
| 2008 | ||
| j12 | Raymond Greenlaw, Sanpawat Kantabutra: On the parallel complexity of hierarchical clustering and CC-complete problems. Complexity 14(2): 18-28 (2008) | |
| c9 | Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra: The Complexity of the Evolution of Graph Labelings. SNPD 2008: 79-84 | |
| 2000 | ||
| j11 | Carme Àlvarez, Raymond Greenlaw: A compendium of problems complete for symmetric logarithmic space. Computational Complexity 9(2): 123-145 (2000) | |
| j10 | Raymond Greenlaw, Rossella Petreschi: Computing Prüfer codes efficiently in parallel. Discrete Applied Mathematics 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 | |
| 1996 | ||
| j9 | 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. Electronic Colloquium on Computational Complexity (ECCC) 3(39) (1996) | |
| 1995 | ||
| j8 | Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer: Optimal Edge Ranking of Trees in Polynomial Time. Algorithmica 13(6): 592-618 (1995) | |
| j7 | ||
| 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 | ||
| j6 | ||
| c4 | Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer: Optimal Edge Ranking of Trees in Polynomial Time. SODA 1993: 138-144 | |
| 1992 | ||
| j5 | Raymond Greenlaw: A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching. Inf. Comput. 97(2): 133-149 (1992) | |
| j4 | Raymond Greenlaw: The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem. Mathematical Systems Theory 25(3): 161-175 (1992) | |
| j3 | Pilar de la Torre, Raymond Greenlaw, Teresa M. Przytycka: Optimal Tree Ranking is in NC. Parallel Processing Letters 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 | ||
| j2 | Raymond Greenlaw, Lawrence Snyder: Achieving speedups for APL on an SIMD distributed memory machine. International Journal of Parallel Programming 19(2): 111-127 (1990) | |
| c2 | Raymond Greenlaw: The parallel complexity of queue versus stack breadth-first search. SPDP 1990: 834-837 | |
| 1989 | ||
| j1 | Raymond Greenlaw: Ordered Vertex Removal and Subgraph Problems. J. Comput. Syst. Sci. 39(3): 323-342 (1989) | |
| 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 | |
Colors in the list of coauthors
Last update Sun May 19 04:31:19 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page