- Theory of computation;
- Complexity theory, parallel algorithms and architectures.
Patrick Dymond received his doctoral degree in Computer Science in 1980. Before joining the Department of Computer Science at York in 1991, he was a faculty member at University of California San Diego, where he also served as Associate Dean of Engineering. His research activities include parallel computing and complexity theory. He has also published research papers in cryptography and web-based security, and is currently director of the Marvil Lab in Computer Science. He served as chair of the department from 1991 to 1996, has also served as chair of the ACM Doctoral Dissertation Awards Committee and as a member of the Computer Science Accreditation Council.
- (with W.L. Ruzzo) “Parallel RAMs with owned global memory and deterministic context-free language recognition”, Journal of the ACM, 2000.
- (with X. Deng) “Randomized optimal list ranking on coarse-grained parallel computers with O(log p) communication phases”, Parallel Algorithms and Applications, 2000.
- (with M. Jenkin) “WWW distribution of private information with watermarking”, Proceedings of Thirty-second Hawaii International Conference on System Sciences, IEEE Computer Society Press, 1999.