Patrick W. Dymond

46 papers A* 4A 2B 3C 1Journal 17Unranked 18
YearRankTypeTitle / Venue / Authors
2015 — conf
An infection algorithm for leader election: Experimental results for a chain.
ICIA
Michael Jenkin, Patrick W. Dymond
2014 — conf
Deterministic topological visual SLAM.
SoICT
Hui Wang, Michael R. M. Jenkin, Patrick W. Dymond
2014 A conf
Integrating multiple soft constraints for planning practical paths.
IROS
Jing Yang, Patrick W. Dymond, Michael R. M. Jenkin
2013 — conf
Enhancing Exploration in Topological Worlds with a Directional Immovable Marker.
CRV
Hui Wang, Michael Jenkin, Patrick W. Dymond
2013 — conf
Path Planning for Tentacle Robots Using Soft Constraints.
ICAART (Revised Selected Papers)
Jing Yang, Patrick W. Dymond, Michael R. M. Jenkin
2013 — conf
Planning Practical Paths for Tentacle Robots.
ICAART (1)
Jing Yang, Robert Codd-Downey, Patrick W. Dymond, Junquan Xu, Michael Jenkin
2012 — conf
Enhancing Exploration in Topological Worlds with Multiple Immovable Markers.
CRV
Hui Wang, Michael Jenkin, Patrick W. Dymond
2012 C conf
Reaching Analysis of Wheelchair Users Using Motion Planning Methods.
ICOST
Jing Yang, Patrick W. Dymond, Michael Jenkin
2011 — conf
Practicality-Based Probabilistic Roadmaps Method.
CRV
Jing Yang, Patrick W. Dymond, Michael Jenkin
2011 A* conf
The relative power of immovable markers in topological mapping.
ICRA
Hui Wang, Michael Jenkin, Patrick W. Dymond
2010 J jnl
TCP is Competitive with Resource Augmentation.
Theory Comput. Syst.
Jeff Edmonds, Suprakash Datta, Patrick W. Dymond
2010 A conf
Using a string to map the world.
IROS
Hui Wang, Michael Jenkin, Patrick W. Dymond
2009 J jnl
Graph exploration with robot swarms.
Int. J. Intell. Comput. Cybern.
Hui Wang, Michael Jenkin, Patrick W. Dymond
2009 — conf
Hierarchical Probabilistic Estimation of Robot Reachable Workspace.
ICINCO-RA
Jing Yang, Patrick W. Dymond, Michael R. M. Jenkin
2008 — conf
Enhancing Exploration in Graph-like Worlds.
CRV
Hui Wang, Michael R. M. Jenkin, Patrick W. Dymond
2003 B conf
TCP is competitive against a limited adversary.
SPAA
Jeff Edmonds, Suprakash Datta, Patrick W. Dymond
2002 — conf
Secure Communication between Lightweight Communication Devices over the Internet.
HICSS
Michael Jenkin, Patrick W. Dymond
2001 J jnl
A 2-D parallel convex hull algorithm with optimal communication phases.
Parallel Comput.
Patrick W. Dymond, Jieliang Zhou, Xiaotie Deng
2000 J jnl
Graph Algorithms with Small Communication Costs.
J. Comb. Optim.
Jieliang Zhou, Patrick W. Dymond, Xiaotie Deng
2000 J jnl
Parallel RAMs with owned global memory and deterministic context-free language recognition.
J. ACM
Patrick W. Dymond, Walter L. Ruzzo
2000 J jnl
Randomized Optimal List Ranking on Coarse-grained Parallel Computers with
Parallel Algorithms Appl.
Xiaotie Deng, Patrick W. Dymond
1999 — conf
WWW Distribution of Private Information with Watermarking.
HICSS
Patrick W. Dymond, Michael Jenkin
1998 — conf
A Plugin-based Privacy Scheme for World-wide Web File Distribution.
HICSS (7)
Michael Jenkin, Patrick W. Dymond
1998 J jnl
On Multiprocessor System Scheduling.
J. Comb. Optim.
Xiaotie Deng, Patrick W. Dymond
1997 — conf
A 2-D Parallel Convex Hull Algorithm with Optimal Communication Phases.
IPPS
Jieliang Zhou, Xiaotie Deng, Patrick W. Dymond
1997 J jnl
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers.
Theory Comput. Syst.
Frank K. H. A. Dehne, Xiaotie Deng, Patrick W. Dymond, Andreas Fabri, Ashfaq A. Khokhar
1997 — conf
Graph Algorithms with Small Communication Costs.
HICSS (1)
Jieliang Zhou, Patrick W. Dymond, Xiaotie Deng
1997 — conf
Parallel Merge Sort on Concurrent-Read Owner-Write PRAM.
Euro-Par
David C. Lin, Patrick W. Dymond, Xiaotie Deng
1996 B conf
On Multiprocessor System Scheduling.
SPAA
Xiaotie Deng, Patrick W. Dymond
1996 J jnl
Pointers versus Arithmetic in PRAMs.
J. Comput. Syst. Sci.
Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
1995 B conf
A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers.
SPAA
Frank K. H. A. Dehne, Xiaotie Deng, Patrick W. Dymond, Andreas Fabri, Ashfaq A. Khokhar
1995 — conf
Efficient routing and message bounds for optimal parallel algorithms.
IPPS
Xiaotie Deng, Patrick W. Dymond
1993 J jnl
Parallel Pointer Machines.
Comput. Complex.
Stephen A. Cook, Patrick W. Dymond
1993 — conf
Pointers versus Arithmetic in PRAMs.
SCT
Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
1989 J jnl
Complexity Theory of Parallel Time and Hardware
Inf. Comput.
Patrick W. Dymond, Stephen A. Cook
1989 J jnl
Erratum: Two Applications of Inductive Counting for Complementation Problems.
SIAM J. Comput.
Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
1989 J jnl
Two Applications of Inductive Counting for Complementation Problems.
SIAM J. Comput.
Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
1988 J jnl
Input-Driven Languages are in log n Depth.
Inf. Process. Lett.
Patrick W. Dymond
1988 — conf
Two applications of complementation via inductive counting.
SCT
Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa
1986 J jnl
On Nondeterminism in Parallel Computation.
Theor. Comput. Sci.
Patrick W. Dymond
1986 A* conf
Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract).
ICALP
Patrick W. Dymond, Walter L. Ruzzo
1985 J jnl
Speedups of Deterministic Machines by Synchronous Parallel Machines.
J. Comput. Syst. Sci.
Patrick W. Dymond, Martin Tompa
1984 J jnl
Consistency in Nondeterministic Storage.
J. Comput. Syst. Sci.
Walter J. Savitch, Patrick W. Dymond
1983 A* conf
Speedups of Deterministic Machines by Synchronous Parallel Machines
STOC
Patrick W. Dymond, Martin Tompa
1980 A* conf
Hardware Complexity and Parallel Computation (Preliminary Version)
FOCS
Patrick W. Dymond, Stephen A. Cook
1980 — —
Simultaneous resource bounds and parallel computation.
Patrick W. Dymond