 | 2012 |
| 35 |  | Jing Yang,
Patrick W. Dymond,
Michael Jenkin:
Reaching Analysis of Wheelchair Users Using Motion Planning Methods.
ICOST 2012: 234-237 |
| 2011 |
| 34 |  | Jing Yang,
Patrick W. Dymond,
Michael Jenkin:
Practicality-Based Probabilistic Roadmaps Method.
CRV 2011: 102-108 |
| 33 |  | Hui Wang,
Michael Jenkin,
Patrick W. Dymond:
The relative power of immovable markers in topological mapping.
ICRA 2011: 1050-1057 |
| 2010 |
| 32 |  | Hui Wang,
Michael Jenkin,
Patrick W. Dymond:
Using a string to map the world.
IROS 2010: 561-566 |
| 31 |  | Jeff Edmonds,
Suprakash Datta,
Patrick W. Dymond:
TCP is Competitive with Resource Augmentation.
Theory Comput. Syst. 47(1): 137-161 (2010) |
| 2009 |
| 30 |  | Jing Yang,
Patrick W. Dymond,
Michael R. M. Jenkin:
Hierarchical Probabilistic Estimation of Robot Reachable Workspace.
ICINCO-RA 2009: 60-66 |
| 2008 |
| 29 |  | Hui Wang,
Michael R. M. Jenkin,
Patrick W. Dymond:
Enhancing Exploration in Graph-like Worlds.
CRV 2008: 53-60 |
| 2003 |
| 28 |  | Jeff Edmonds,
Suprakash Datta,
Patrick W. Dymond:
TCP is competitive against a limited adversary.
SPAA 2003: 174-183 |
| 2002 |
| 27 |  | Michael Jenkin,
Patrick W. Dymond:
Secure Communication between Lightweight Communication Devices over the Internet.
HICSS 2002: 195 |
| 2001 |
| 26 |  | Patrick W. Dymond,
Jieliang Zhou,
Xiaotie Deng:
A 2-D parallel convex hull algorithm with optimal communication phases.
Parallel Computing 27(3): 243-255 (2001) |
| 2000 |
| 25 |  | Patrick W. Dymond,
Walter L. Ruzzo:
Parallel RAMs with owned global memory and deterministic context-free language recognition.
J. ACM 47(1): 16-45 (2000) |
| 24 |  | Jieliang Zhou,
Patrick W. Dymond,
Xiaotie Deng:
Graph Algorithms with Small Communication Costs.
J. Comb. Optim. 4(3): 291-305 (2000) |
| 23 |  | Xiaotie Deng,
Patrick W. Dymond:
Randomized Optimal List Ranking on Coarse-grained Parallel Computers with o(log P) Communication Phases.
Parallel Algorithms Appl. 14(3): 165-173 (2000) |
| 1999 |
| 22 |  | Patrick W. Dymond,
Michael Jenkin:
WWW Distribution of Private Information with Watermarking.
HICSS 1999 |
| 1998 |
| 21 |  | Xiaotie Deng,
Patrick W. Dymond:
On Multiprocessor System Scheduling.
J. Comb. Optim. 1(4): 377-392 (1998) |
| 1997 |
| 20 |  | David C. Lin,
Patrick W. Dymond,
Xiaotie Deng:
Parallel Merge Sort on Concurrent-Read Owner-Write PRAM.
Euro-Par 1997: 379-383 |
| 19 |  | Jieliang Zhou,
Patrick W. Dymond,
Xiaotie Deng:
Graph Algorithms with Small Communication Costs.
HICSS (1) 1997: 182-190 |
| 18 |  | Jieliang Zhou,
Xiaotie Deng,
Patrick W. Dymond:
A 2-D Parallel Convex Hull Algorithm with Optimal Communication Phases.
IPPS 1997: 596-602 |
| 17 |  | Frank K. H. A. Dehne,
Xiaotie Deng,
Patrick W. Dymond,
Andreas Fabri,
Ashfaq A. Khokhar:
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers.
Theory Comput. Syst. 30(6): 547-558 (1997) |
| 1996 |
| 16 |  | Xiaotie Deng,
Patrick W. Dymond:
On Multiprocessor System Scheduling.
SPAA 1996: 82-88 |
| 15 |  | Patrick W. Dymond,
Faith E. Fich,
Naomi Nishimura,
Prabhakar Ragde,
Walter L. Ruzzo:
Pointers versus Arithmetic in PRAMs.
J. Comput. Syst. Sci. 53(2): 218-232 (1996) |
| 1995 |
| 14 |  | Xiaotie Deng,
Patrick W. Dymond:
Efficient routing and message bounds for optimal parallel algorithms.
IPPS 1995: 556- |
| 13 |  | Frank K. H. A. Dehne,
Xiaotie Deng,
Patrick W. Dymond,
Andreas Fabri,
Ashfaq A. Khokhar:
A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers.
SPAA 1995: 27-33 |
| 1993 |
| 12 |  | Patrick W. Dymond,
Faith E. Fich,
Naomi Nishimura,
Prabhakar Ragde,
Walter L. Ruzzo:
Pointers versus Arithmetic in PRAMs.
Structure in Complexity Theory Conference 1993: 239-252 |
| 11 |  | Stephen A. Cook,
Patrick W. Dymond:
Parallel Pointer Machines.
Computational Complexity 3: 19-30 (1993) |
| 1989 |
| 10 |  | Patrick W. Dymond,
Stephen A. Cook:
Complexity Theory of Parallel Time and Hardware
Inf. Comput. 80(3): 205-226 (1989) |
| 9 |  | Allan Borodin,
Stephen A. Cook,
Patrick W. Dymond,
Walter L. Ruzzo,
Martin Tompa:
Two Applications of Inductive Counting for Complementation Problems.
SIAM J. Comput. 18(3): 559-578 (1989) |
| 8 |  | Allan Borodin,
Stephen A. Cook,
Patrick W. Dymond,
Walter L. Ruzzo,
Martin Tompa:
Erratum: Two Applications of Inductive Counting for Complementation Problems.
SIAM J. Comput. 18(6): 1283 (1989) |
| 1988 |
| 7 |  | Patrick W. Dymond:
Input-Driven Languages are in log n Depth.
Inf. Process. Lett. 26(5): 247-250 (1988) |
| 1986 |
| 6 |  | Patrick W. Dymond,
Walter L. Ruzzo:
Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract).
ICALP 1986: 95-104 |
| 5 |  | Patrick W. Dymond:
On Nondeterminism in Parallel Computation.
Theor. Comput. Sci. 47(3): 111-120 (1986) |
| 1985 |
| 4 |  | Patrick W. Dymond,
Martin Tompa:
Speedups of Deterministic Machines by Synchronous Parallel Machines.
J. Comput. Syst. Sci. 30(2): 149-161 (1985) |
| 1984 |
| 3 |  | Walter J. Savitch,
Patrick W. Dymond:
Consistency in Nondeterministic Storage.
J. Comput. Syst. Sci. 29(1): 118-132 (1984) |
| 1983 |
| 2 |  | Patrick W. Dymond,
Martin Tompa:
Speedups of Deterministic Machines by Synchronous Parallel Machines
STOC 1983: 336-343 |
| 1980 |
| 1 |  | Patrick W. Dymond,
Stephen A. Cook:
Hardware Complexity and Parallel Computation (Preliminary Version)
FOCS 1980: 360-372 |