David A. Plaisted
- Artificial Intelligence top 1%
- Computational Theory and Mathematics top 0.5%
- Computer Networks and Communications top 5%
- Software top 5%
- Electrical and Electronic Engineering
- Co-authors
- Steve GreenbaumNachum DershowitzYunshan ZhuKenneth J. SupowitEdward M. ReingoldLeo BachmairStéphane KaplanShie-Jue Lee
- Topics
- Logic, programming, and type systems (43 papers)Logic, Reasoning, and Knowledge (33 papers)Formal Methods in Verification (24 papers)
- Partner nations
- United StatesGermanyItaly
In The Last Decade
David A. Plaisted
75 papers receiving 1.0k citations
Peers
Comparison fields: 5 of 61
- Artificial Intelligence 881
- Computational Theory and Mathematics 728
- Computer Networks and Communications 218
- Software 131
- Electrical and Electronic Engineering 94
Countries citing papers authored by David A. Plaisted
This map shows the geographic impact of David A. Plaisted'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 David A. Plaisted with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David A. Plaisted more than expected).
Fields of papers citing papers by David A. Plaisted
This network shows the impact of papers produced by David A. Plaisted. 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 David A. Plaisted. The network helps show where David A. Plaisted may publish in the future.
Co-authorship network of co-authors of David A. Plaisted
This figure shows the co-authorship network connecting the top 25 collaborators of David A. Plaisted. A scholar is included among the top collaborators of David A. Plaisted based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with David A. Plaisted. David A. Plaisted is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 9 | |
| 2 | 18 | |
| 3 | 2 | |
| 4 | Equational reasoning using AC constraints | 1 |
| 5 | 17 | |
| 6 | 4 | |
| 7 | Rough resolution: a refinement of resolution to remove large literals | 3 |
| 8 | 9 | |
| 9 | 3 | |
| 10 | 16 | |
| 11 | A Multiprocessor Architecture for Medium-Grain Parallelism. | 4 |
| 12 | 257 | |
| 13 | 37 | |
| 14 | 38 | |
| 15 | An Efficient Bug Location Algorithm. | 6 |
| 16 | 18 | |
| 17 | 34 | |
| 18 | Associative-commutative rewriting | 26 |
| 19 | 3 | |
| 20 | 33 |
About David A. Plaisted
David A. Plaisted is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Theoretical Computer Science, having authored 82 papers that have together received 1.2k indexed citations. Recurring topics across this work include Logic, programming, and type systems (43 papers), Logic, Reasoning, and Knowledge (33 papers) and Formal Methods in Verification (24 papers). The work is most often cited by research in Computational Theory and Mathematics (728 citations), Software (131 citations) and Artificial Intelligence (881 citations). David A. Plaisted has collaborated with scholars based in United States, Germany and Italy. Frequent co-authors include Steve Greenbaum, Nachum Dershowitz, Yunshan Zhu, Kenneth J. Supowit, Edward M. Reingold, Leo Bachmair, Stéphane Kaplan, Shie-Jue Lee, Bharat Jayaraman and Wayne Snyder. Their work appears in journals such as Artificial Intelligence, Journal of the ACM and IEEE Transactions on Computers.
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.