Search the dblp DataBase

Publications of Author

1. Raymond Greenlaw, Jonathan Machta
   The Parallel Complexity of Algorithms for Pattern Formation Models (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   Canada-France Conference on Parallel and Distributed Computing, 1994, pp:23-34 [Conf]
   
2. Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher
   NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   Canada-France Conference on Parallel and Distributed Computing, 1994, pp:45-57 [Conf]
   
3. Raymond Greenlaw, Jonathan Machta
   The Parallel Complexity of Eden Growth, Solid-on-Solid Groth and Ballistic Deposition (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   ESA, 1994, pp:436-447 [Conf]
   
4. 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. [Citation Graph (0, 0)][DBLP]
   PARELEC, 2000, pp:43-49 [Conf]
   
5. 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. [Citation Graph (0, 0)][DBLP]
   PPOPP/PPEALS, 1988, pp:10-20 [Conf]
   
6. Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer
   Optimal Edge Ranking of Trees in Polynomial Time. [Citation Graph (0, 0)][DBLP]
   SODA, 1993, pp:138-144 [Conf]
   
7. Raymond Greenlaw
   The parallel complexity of queue versus stack breadth-first search. [Citation Graph (0, 0)][DBLP]
   SPDP, 1990, pp:834-837 [Conf]
   
8. Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer
   Optimal Edge Ranking of Trees in Polynomial Time. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1995, v:13, n:6, pp:592-618 [Journal]
   
9. Carme Àlvarez, Raymond Greenlaw
   A compendium of problems complete for symmetric logarithmic space. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2000, v:9, n:2, pp:123-145 [Journal]
   
10. Raymond Greenlaw, Rossella Petreschi
    Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1995, v:27, n:4, pp:471-495 [Journal]
    
11. Raymond Greenlaw, Rossella Petreschi
    Computing Prüfer codes efficiently in parallel. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:205-222 [Journal]
    
12. Raymond Greenlaw
    A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:97, n:2, pp:133-149 [Journal]
    
13. Raymond Greenlaw
    Subtree Isomorphism is in DLOG for Nested Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:161-168 [Journal]
    
14. Raymond Greenlaw
    Ordered Vertex Removal and Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:3, pp:323-342 [Journal]
    
15. Raymond Greenlaw
    The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1992, v:25, n:3, pp:161-175 [Journal]
    
16. Raymond Greenlaw
    Breadth-Depth Search is P-Complete. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:209-222 [Journal]
    
17. Pilar de la Torre, Raymond Greenlaw, Teresa M. Przytycka
    Optimal Tree Ranking is in NC. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:31-41 [Journal]
    
18. 
    The Complexity of the Evolution of Graph Labelings. [Citation Graph (, )][DBLP]
    
    
19. 
    Super critical tree numbering and optimal tree ranking are in NC. [Citation Graph (, )][DBLP]