Patrick W. Dymond - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 45 from 45

2015

An infection algorithm for leader election: Experimental results for a chainMichael Jenkin, Patrick W. Dymond. icinfa 2015: 222-226 [doi]

2014

Deterministic topological visual SLAMHui Wang, Michael R. M. Jenkin, Patrick W. Dymond. soict 2014: 126-135 [doi]

Integrating multiple soft constraints for planning practical pathsJing Yang, Patrick W. Dymond, Michael R. M. Jenkin. iros 2014: 3005-3011 [doi]

2013

Enhancing Exploration in Topological Worlds with a Directional Immovable MarkerHui Wang, Michael Jenkin, Patrick W. Dymond. crv 2013: 348-355 [doi]

Path Planning for Tentacle Robots Using Soft ConstraintsJing Yang, Patrick W. Dymond, Michael R. M. Jenkin. icaart 2014: 95-111 [doi]

Planning Practical Paths for Tentacle RobotsJing Yang, Robert Codd-Downey, Patrick W. Dymond, Junquan Xu, Michael Jenkin. icaart 2013: 128-137

2012

Enhancing Exploration in Topological Worlds with Multiple Immovable MarkersHui Wang, Michael Jenkin, Patrick W. Dymond. crv 2012: 322-329 [doi]

Reaching Analysis of Wheelchair Users Using Motion Planning MethodsJing Yang, Patrick W. Dymond, Michael Jenkin. icost 2012: 234-237 [doi]

2011

The relative power of immovable markers in topological mappingHui Wang, Michael Jenkin, Patrick W. Dymond. icra 2011: 1050-1057 [doi]

Practicality-Based Probabilistic Roadmaps MethodJing Yang, Patrick W. Dymond, Michael Jenkin. crv 2011: 102-108 [doi]

2010

TCP is Competitive with Resource AugmentationJeff Edmonds, Suprakash Datta, Patrick W. Dymond. mst, 47(1):137-161, 2010. [doi]

Using a string to map the worldHui Wang, Michael Jenkin, Patrick W. Dymond. iros 2010: 561-566 [doi]

2009

Graph exploration with robot swarmsHui Wang, Michael Jenkin, Patrick W. Dymond. ijicc, 2(4):818-845, 2009. [doi]

Hierarchical Probabilistic Estimation of Robot Reachable WorkspaceJing Yang, Patrick W. Dymond, Michael R. M. Jenkin. icinco 2009: 60-66

2008

Enhancing Exploration in Graph-like WorldsHui Wang, Michael R. M. Jenkin, Patrick W. Dymond. crv 2008: 53-60 [doi]

2003

TCP is competitive against a limited adversaryJeff Edmonds, Suprakash Datta, Patrick W. Dymond. spaa 2003: 174-183 [doi]

2002

Secure Communication between Lightweight Communication Devices over the InternetMichael Jenkin, Patrick W. Dymond. hicss 2002: 195 [doi]

2001

A 2-D parallel convex hull algorithm with optimal communication phasesPatrick W. Dymond, Jieliang Zhou, Xiaotie Deng. pc, 27(3):243-255, 2001.

2000

Randomized Optimal List Ranking on Coarse-grained Parallel Computers with ::::o(log P):::: Communication PhasesXiaotie Deng, Patrick W. Dymond. paapp, 14(3):165-173, 2000. [doi]

Parallel RAMs with owned global memory and deterministic context-free language recognitionPatrick W. Dymond, Walter L. Ruzzo. JACM, 47(1):16-45, 2000. [doi]

Graph Algorithms with Small Communication CostsJieliang Zhou, Patrick W. Dymond, Xiaotie Deng. jco, 4(3):291-305, 2000.

1998

On Multiprocessor System SchedulingXiaotie Deng, Patrick W. Dymond. jco, 1(4):377-392, 1998.

A Plugin-based Privacy Scheme for World-wide Web File DistributionMichael Jenkin, Patrick W. Dymond. hicss 1998: 621-627 [doi]

1997

1996

On Multiprocessor System SchedulingXiaotie Deng, Patrick W. Dymond. spaa 1996: 82-88

Pointers versus Arithmetic in PRAMsPatrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo. jcss, 53(2):218-232, 1996.

1995

A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained MulticomputersFrank K. H. A. Dehne, Xiaotie Deng, Patrick W. Dymond, Andreas Fabri, Ashfaq A. Khokhar. spaa 1995: 27-33 [doi]

Efficient routing and message bounds for optimal parallel algorithmsXiaotie Deng, Patrick W. Dymond. ipps 1995: 556 [doi]

1993

Parallel Pointer MachinesStephen A. Cook, Patrick W. Dymond. cc, 3:19-30, 1993.

Pointers versus Arithmetic in PRAMsPatrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo. cocoon 1993: 239-252

1989

Two Applications of Inductive Counting for Complementation ProblemsAllan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa. SICOMP, 18(3):559-578, 1989.

Erratum: Two Applications of Inductive Counting for Complementation ProblemsAllan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa. SICOMP, 18(6):1283, 1989.

Complexity Theory of Parallel Time and HardwarePatrick W. Dymond, Stephen A. Cook. iandc, 80(3):205-226, March 1989.

1988

Two applications of complementation via inductive countingAllan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa. coco 1988: 116-125 [doi]

Input-Driven Languages are in log n DepthPatrick W. Dymond. ipl, 26(5):247-250, 1988.

1986

Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract)Patrick W. Dymond, Walter L. Ruzzo. icalp 1986: 95-104

On Nondeterminism in Parallel ComputationPatrick W. Dymond. TCS, 47(3):111-120, 1986.

1985

Speedups of Deterministic Machines by Synchronous Parallel MachinesPatrick W. Dymond, Martin Tompa. jcss, 30(2):149-161, 1985.

1984

Consistency in Nondeterministic StorageWalter J. Savitch, Patrick W. Dymond. jcss, 29(1):118-132, 1984.

1983

Speedups of Deterministic Machines by Synchronous Parallel MachinesPatrick W. Dymond, Martin Tompa. stoc 1983: 336-343

1980

Simultaneous resource bounds and parallel computationPatrick W. Dymond. PhD thesis, University of Toronto, Canada, 1980. [doi]

Hardware Complexity and Parallel Computation (Preliminary Version)Patrick W. Dymond, Stephen A. Cook. focs 1980: 360-372

Sign in or sign up to see more results.

runs on WebDSL