Patrick W. Dymond

According to our database1, Patrick W. Dymond authored at least 41 papers between 1980 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
An infection algorithm for leader election: Experimental results for a chain.
Proceedings of the IEEE International Conference on Information and Automation, 2015

2014
Deterministic topological visual SLAM.
Proceedings of the Fifth Symposium on Information and Communication Technology, 2014

Integrating multiple soft constraints for planning practical paths.
Proceedings of the 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2014

2013
Path Planning for Tentacle Robots Using Soft Constraints.
Proceedings of the Agents and Artificial Intelligence - 5th International Conference, 2013

Planning Practical Paths for Tentacle Robots.
Proceedings of the ICAART 2013, 2013

Enhancing Exploration in Topological Worlds with a Directional Immovable Marker.
Proceedings of the Tenth Conference on Computer and Robot Vision, 2013

2012
Reaching Analysis of Wheelchair Users Using Motion Planning Methods.
Proceedings of the Impact Analysis of Solutions for Chronic Disease Prevention and Management, 2012

Enhancing Exploration in Topological Worlds with Multiple Immovable Markers.
Proceedings of the Ninth Conference on Computer and Robot Vision, 2012

2011
The relative power of immovable markers in topological mapping.
Proceedings of the IEEE International Conference on Robotics and Automation, 2011

Practicality-Based Probabilistic Roadmaps Method.
Proceedings of the Canadian Conference on Computer and Robot Vision, 2011

2010
TCP is Competitive with Resource Augmentation.
Theory Comput. Syst., 2010

Using a string to map the world.
Proceedings of the 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2010

2009
Graph exploration with robot swarms.
Int. J. Intell. Comput. Cybern., 2009

Hierarchical Probabilistic Estimation of Robot Reachable Workspace.
Proceedings of the ICINCO 2009, 2009

2008
Enhancing Exploration in Graph-like Worlds.
Proceedings of the Fifth Canadian Conference on Computer and Robot Vision, 2008

2003
TCP is competitive against a limited adversary.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002
Secure Communication between Lightweight Communication Devices over the Internet.
Proceedings of the 35th Hawaii International Conference on System Sciences (HICSS-35 2002), 2002

2000
Randomized Optimal List Ranking on Coarse-grained Parallel Computers with <i>o(log P)</i> Communication Phases.
Parallel Algorithms Appl., 2000

Parallel RAMs with owned global memory and deterministic context-free language recognition.
J. ACM, 2000

1999
WWW Distribution of Private Information with Watermarking.
Proceedings of the 32nd Annual Hawaii International Conference on System Sciences (HICSS-32), 1999

1998
A Plugin-based Privacy Scheme for World-wide Web File Distribution.
Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

1997
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers.
Theory Comput. Syst., 1997

A 2-D Parallel Convex Hull Algorithm with Optimal Communication Phases.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Graph Algorithms with Small Communication Costs.
Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

Parallel Merge Sort on Concurrent-Read Owner-Write PRAM.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996
On Multiprocessor System Scheduling.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

1995
A Randomized Parallel 3D Convex Hull Algorithm for Coarse Grained Multicomputers.
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

Efficient routing and message bounds for optimal parallel algorithms.
Proceedings of IPPS '95, 1995

1993
Parallel Pointer Machines.
Comput. Complex., 1993

Pointers versus Arithmetic in PRAMs.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1989
Complexity Theory of Parallel Time and Hardware
Inf. Comput., March, 1989

Erratum: Two Applications of Inductive Counting for Complementation Problems.
SIAM J. Comput., 1989

Two Applications of Inductive Counting for Complementation Problems.
SIAM J. Comput., 1989

1988
Input-Driven Languages are in log n Depth.
Inf. Process. Lett., 1988

Two applications of complementation via inductive counting.
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1986
On Nondeterminism in Parallel Computation.
Theor. Comput. Sci., 1986

Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1984
Consistency in Nondeterministic Storage.
J. Comput. Syst. Sci., 1984

1983
Speedups of Deterministic Machines by Synchronous Parallel Machines
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1980
Simultaneous resource bounds and parallel computation.
PhD thesis, 1980

Hardware Complexity and Parallel Computation (Preliminary Version)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980


  Loading...