Raymond Greenlaw

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

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

Colors in the list of coauthors