Science Explorer Back to mapMap
Discussion
Researcher · University of Nebraska–Lincoln · United States

Matthew B. Dwyer

Matthew B. Dwyer publishes mostly in Software, Artificial Intelligence and Computational Theory and Mathematics, on topics such as Software Testing and Debugging Techniques, Formal Methods in Verification and Software Reliability and Analysis Research.

ORCID 0000-0002-1937-1544 OpenAlex
World rank
#203,858
of 7,710,434 ranked researchers
Rank in United States
#75,646
of 1,627,098
Works
313
Citations
10k
Citations per work
32.4
h-index
50
i10-index 126Top 1.1% in Software
Matthew B. Dwyer

What does Matthew B. Dwyer research?

Matthew B. Dwyer's work is mostly in Computer Science (84%).

Physical Sciences: 262 works · 83.7% of their workComputer Science: 262 works · 83.7% of their workSoftware: 91 works · 29.1% of their workArtificial Intelligence: 50 works · 15.9% of their workComputational Theory and Mathematics: 39 works · 12.6% of their workComputer Networks and Communications: 33 works · 10.7% of their workInformation Systems: 31 works · 9.8% of their workHardware and Architecture: 18 works · 5.6% of their workEverything else: 51 works · 16.3% of their workTHEIR WORKMatthew B. Dwyer313works
Physical Sciences84%

Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.

The fields and subfields, with their numbers
    1. Computer Science26283.7%
  2. Everything else5116.3%
  1. 1Software29% of their works
  2. 2Artificial Intelligence16% of their works
  3. 3Computational Theory and Mathematics13% of their works
  4. 4Computer Networks and Communications11% of their works
  5. 5Information Systems10% of their works
  6. 6Hardware and Architecture6% of their works

Research topics

Which keywords describe Matthew B. Dwyer's research?

The keywords of their largest research topics: Automated Testing, Software Fault Localization, Model Checking, Satisfiability Modulo Theories, Symbolic Model Checker, Machine Learning, Architecture-Based Approach and Software Reliability Modeling.

Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.

All 18 words, with their numbers
  1. Automated Testing1531 topic
  2. Software Fault Localization1531 topic
  3. Model Checking1262 topics
  4. Satisfiability Modulo Theories1021 topic
  5. Symbolic Model Checker1021 topic
  6. Machine Learning892 topics
  7. Architecture-Based Approach831 topic
  8. Software Reliability Modeling831 topic
  9. Code Clone Detection631 topic
  10. Refactoring631 topic
  11. Autonomic Computing391 topic
  12. Self-Adaptive Systems391 topic
  13. Log Analysis361 topic
  14. Performance Prediction361 topic
  15. Adversarial Examples261 topic
  16. Deep Learning261 topic
  17. Formal Verification241 topic
  18. Static Analysis241 topic

Where does Matthew B. Dwyer work?

Matthew B. Dwyer's main affiliation in the publication record is University of Nebraska–Lincoln, United States.

How many publications and citations does Matthew B. Dwyer have?

OpenAlex counts 313 works and 10,142 citations for Matthew B. Dwyer, an h-index of 50, ranking #203,858 of 7,710,434 researchers worldwide on the quality score.

Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.

Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.

Discussion

Ask a question or share a note about Matthew B. Dwyer. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.