dblp.uni-trier.dewww.uni-trier.de

Raymond Greenlaw

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
20EEGeir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra: The Complexity of the Evolution of Graph Labelings. SNPD 2008: 79-84
19EERaymond Greenlaw, Sanpawat Kantabutra: On the parallel complexity of hierarchical clustering and CC-complete problems. Complexity 14(2): 18-28 (2008)
2000
18EERaymond 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
17EECarme Àlvarez, Raymond Greenlaw: A compendium of problems complete for symmetric logarithmic space. Computational Complexity 9(2): 123-145 (2000)
16 Raymond Greenlaw, Rossella Petreschi: Computing Prüfer codes efficiently in parallel. Discrete Applied Mathematics 102(3): 205-222 (2000)
1996
15EECarme Àlvarez, Raymond Greenlaw: A Compendium of Problems Complete for Symmetric Logarithmic Space Electronic Colloquium on Computational Complexity (ECCC) 3(39): (1996)
14 Raymond Greenlaw: Subtree Isomorphism is in DLOG for Nested Trees. Int. J. Found. Comput. Sci. 7(2): 161-168 (1996)
1995
13 Raymond Greenlaw, Rossella Petreschi: Cubic Graphs. ACM Comput. Surv. 27(4): 471-495 (1995)
12 Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer: Optimal Edge Ranking of Trees in Polynomial Time. Algorithmica 13(6): 592-618 (1995)
1994
11 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
10 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
9 Raymond Greenlaw, Jonathan Machta: The Parallel Complexity of Eden Growth, Solid-on-Solid Groth and Ballistic Deposition (Extended Abstract). ESA 1994: 436-447
1993
8 Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer: Optimal Edge Ranking of Trees in Polynomial Time. SODA 1993: 138-144
7 Raymond Greenlaw: Breadth-Depth Search is P-Complete. Parallel Processing Letters 3: 209-222 (1993)
1992
6 Raymond Greenlaw: A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching Inf. Comput. 97(2): 133-149 (1992)
5 Raymond Greenlaw: The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem. Mathematical Systems Theory 25(3): 161-175 (1992)
4 Pilar de la Torre, Raymond Greenlaw, Teresa M. Przytycka: Optimal Tree Ranking is in NC. Parallel Processing Letters 2: 31-41 (1992)
1990
3EERaymond Greenlaw: The parallel complexity of queue versus stack breadth-first search. SPDP 1990: 834-837
1989
2 Raymond Greenlaw: Ordered Vertex Removal and Subgraph Problems. J. Comput. Syst. Sci. 39(3): 323-342 (1989)
1988
1 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

1Geir Agnarsson [20]
2Carme Àlvarez [15] [17]
3Mary L. Bailey [1]
4Bruce Forstall [1]
5Kevin Gates [1]
6William G. Griswold [1]
7Thomas J. Holman [1]
8Sanpawat Kantabutra [19] [20]
9Richard Korry [1]
10Gemini Lasswell [1]
11Y. Daniel Liang [10]
12Jonathan Machta [9] [11]
13Glenn K. Manacher [10]
14Robert Mitchell [1]
15Philip A. Nelson [1]
16David Notkin [1]
17Rossella Petreschi [13] [16]
18Teresa M. Przytycka [4]
19Alejandro A. Schäffer [8] [12]
20Charles Shipley [18]
21Lawrence Snyder (Larry Snyder) [1]
22David Socha [1]
23Pilar de la Torre [4] [8] [12]
24James Wogulis [18]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)