P. Dymond

Available identifiers

Publication	Date of Publication	Type
TCP is competitive with resource augmentation	2010-08-13	Paper
Graph exploration with robot swarms	2009-12-22	Paper
Parallel RAMs with owned global memory and deterministic context-free language recognition	2003-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q4536961	2002-11-06	Paper
A 2-D parallel convex hull algorithm with optimal communication phases	2001-08-20	Paper
Graph algorithms with small communication costs	2000-12-03	Paper
https://portal.mardi4nfdi.de/entity/Q4953331	2000-06-22	Paper
On multiprocessor system scheduling	1998-01-01	Paper
Pointers versus arithmetic in PRAMs	1997-03-31	Paper
A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers	1997-01-01	Paper
Parallel pointer machines	1994-02-09	Paper
Complexity theory of parallel time and hardware	1989-01-01	Paper
Two Applications of Inductive Counting for Complementation Problems	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3730022	1986-01-01	Paper
On nondeterminism in parallel computation	1986-01-01	Paper
Speedups of deterministic machines by synchronous parallel machines	1985-01-01	Paper
Consistency in nondeterministic storage	1984-01-01	Paper
Indirect addressing and the time relationships of some models of sequential computation	1979-01-01	Paper

This page was built for person: P. Dymond