Raymond Greenlaw

Available identifiers

zbMath Open greenlaw.raymondMaRDI QIDQ172544

List of research outcomes

Publication	Date of Publication	Type
The Structure of Rooted Weighted Trees Modeling Layered Cyber-security Systems	2017-03-31	Paper
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem	2015-08-12	Paper
The computational complexity of generating random fractals	2013-04-10	Paper
A mobility model for studying wireless communication and the complexity of problems in the model	2012-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q3089730	2011-08-25	Paper
https://portal.mardi4nfdi.de/entity/Q2996615	2011-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q3644854	2009-11-13	Paper
The Complexity of the Evolution of Graph Labelings	2008-09-12	Paper
https://portal.mardi4nfdi.de/entity/Q2718334	2002-01-08	Paper
A compendium of problems complete for symmetric logarithmic space	2001-04-17	Paper
https://portal.mardi4nfdi.de/entity/Q4503958	2000-09-14	Paper
Computing Prüfer codes efficiently in parallel	2000-05-25	Paper
SUBTREE ISOMORPHISM IS IN DLOG FOR NESTED TREES	1996-11-26	Paper
The parallel complexity of growth models	1996-07-17	Paper
https://portal.mardi4nfdi.de/entity/Q4843270	1995-08-13	Paper
Optimal edge ranking of trees in polynomial time	1995-06-19	Paper
https://portal.mardi4nfdi.de/entity/Q3140414	1994-11-29	Paper
The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem	1992-09-27	Paper
A model classifying algorithms as inherently sequential with applications to graph searching	1992-06-28	Paper
Ordered vertex removal and subgraph problems	1989-01-01	Paper

Research outcomes over time

This page was built for person: Raymond Greenlaw