Patrick Dymond
Impact in
-
- semigroups and automata theory
- Complexity and Algorithms in Graphs
- Computability, Logic, AI Algorithms
- Advanced Graph Theory Research
Papers in
-
- Optimization and Search Problems 14
-
- Complexity and Algorithms in Graphs 12
- semigroups and automata theory 7
- Computability, Logic, AI Algorithms 6
- Co-authors
- Stephen Cook (6 shared papers)Walter L. Ruzzo (6 shared papers)Martin Tompa (4 shared papers)Xiaotie Deng (11 shared papers)Allan Borodin (2 shared papers)Michael Jenkin (16 shared papers)Andreas Fabri (2 shared papers)Ashfaq Khokhar (2 shared papers)
- Journals
- Journal of Computer and System Sciences (3 papers)Journal of Combinatorial Optimization (2 papers)Journal of the ACM (1 paper)Theory of Computing Systems (1 paper)Information and Computation (1 paper)
- Partner nations
- CanadaUnited StatesUnited Kingdom
In The Last Decade
Patrick Dymond
43 papers receiving 543 citations
Peers
Comparison fields: 5 of 49
- Computational Theory and Mathematics 373
- Computer Graphics and Computer-Aided Design 49
- Hardware and Architecture 71
- Artificial Intelligence 251
- Computer Networks and Communications 164
Countries citing papers authored by Patrick Dymond
This map shows the geographic impact of Patrick Dymond's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Patrick Dymond with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Patrick Dymond more than expected).
Fields of papers citing papers by Patrick Dymond
This network shows the impact of papers produced by Patrick Dymond. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Patrick Dymond. The network helps show where Patrick Dymond may publish in the future.
Co-authors
The 24 scholars most cited alongside Patrick Dymond, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 45 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1989 | 104 | |
| 2 | 1980 | 74 | |
| 3 | 1995 | 57 | |
| 4 | 1986 | 46 | |
| 5 | 1985 | 40 | |
| 6 | 1988 | 37 | |
| 7 | 1988 | 23 | |
| 8 | 1989 | 21 | |
| 9 | 1996 | 21 | |
| 10 | Simultaneous resource bounds and parallel computation | 1980 | 17 |
| 11 | 2008 | 15 | |
| 12 | 1993 | 13 | |
| 13 | 1983 | 10 | |
| 14 | 1979 | 7 | |
| 15 | 2003 | 7 | |
| 16 | 2000 | 6 | |
| 17 | 2002 | 6 | |
| 18 | Accessibility Assessment Via Workspace Estimation | 2008 | 6 |
| 19 | 2011 | 6 | |
| 20 | 1997 | 5 |
About Patrick Dymond
Patrick Dymond is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Artificial Intelligence, Computer Vision and Pattern Recognition and Aerospace Engineering, having authored 45 papers that have together received 583 indexed citations. Recurring topics across this work include Optimization and Search Problems (14 papers), Complexity and Algorithms in Graphs (12 papers), Algorithms and Data Compression (9 papers), Robotics and Sensor-Based Localization (9 papers), Robotic Path Planning Algorithms (8 papers), semigroups and automata theory (7 papers), Computability, Logic, AI Algorithms (6 papers) and Machine Learning and Algorithms (6 papers). The work is most often cited by research in Computational Theory and Mathematics (373 citations), Computer Graphics and Computer-Aided Design (49 citations), Hardware and Architecture (71 citations), Artificial Intelligence (251 citations) and Computer Networks and Communications (164 citations). Patrick Dymond has collaborated with scholars based in Canada, United States and United Kingdom. Frequent co-authors include Stephen Cook, Walter L. Ruzzo, Martin Tompa, Xiaotie Deng, Allan Borodin, Michael Jenkin, Andreas Fabri, Ashfaq Khokhar, Frank Dehne and Hui Wang. Their work appears in journals such as Journal of Computer and System Sciences, Journal of Combinatorial Optimization, Journal of the ACM, Theory of Computing Systems and Information and Computation.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.