Science Explorer Back to mapMap
Discussion
Researcher · Bishop's University · Canada

Stefan D. Bruda

Stefan D. Bruda publishes mostly in Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics, on topics such as Formal Methods in Verification, Parallel Computing and Optimization Techniques and Algorithms and Data Compression.

OpenAlex
World rank
#6,065,955
of 7,710,434 ranked researchers
Rank in Canada
#166,864
of 183,316
Works
69
Citations
280
Citations per work
4.1
h-index
10
i10-index 10Top 42% in Artificial Intelligence
Stefan D. Bruda

What does Stefan D. Bruda research?

Stefan D. Bruda's work is mostly in Computer Science (77%), Social Sciences (4%).

Physical Sciences: 53 works · 76.6% of their workComputer Science: 53 works · 76.6% of their workArtificial Intelligence: 15 works · 21.9% of their workComputer Networks and Communications: 13 works · 18.9% of their workComputational Theory and Mathematics: 12 works · 17.4% of their workHardware and Architecture: 8 works · 10.9% of their workSoftware: 5 works · 7.5% of their workEverything else: 13 works · 19.4% of their workSocial Sciences: 3 works · 4.0% of their workSocial Sciences: 3 works · 4.0% of their workSociology and Political Science: 3 works · 4.0% of their workTHEIR WORKStefan D. Bruda69works
Physical Sciences77%Social Sciences4%

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 Science5376.6%
  2. Everything else1319.4%
    1. Social Sciences34.0%
  1. 1Artificial Intelligence22% of their works
  2. 2Computer Networks and Communications19% of their works
  3. 3Computational Theory and Mathematics17% of their works
  4. 4Hardware and Architecture11% of their works
  5. 5Software8% of their works
  6. 6Sociology and Political Science4% of their works

Research topics

Which keywords describe Stefan D. Bruda's research?

The keywords of their largest research topics: Automata, Model Checking, Symbolic Model Checker, Parallel Computing, Performance Optimization, Compression, Suffix Arrays and Formal Languages.

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 17 words, with their numbers
  1. Automata232 topics
  2. Model Checking151 topic
  3. Symbolic Model Checker151 topic
  4. Parallel Computing131 topic
  5. Performance Optimization131 topic
  6. Compression91 topic
  7. Suffix Arrays91 topic
  8. Formal Languages81 topic
  9. Regular Expressions81 topic
  10. Automated Testing71 topic
  11. DNA Computing71 topic
  12. Distributed Systems71 topic
  13. Fault Tolerance71 topic
  14. Molecular Computation71 topic
  15. Security Policies71 topic
  16. Side-Channel Attacks71 topic
  17. Software Fault Localization71 topic

Where does Stefan D. Bruda work?

Stefan D. Bruda's main affiliation in the publication record is Bishop's University, Canada.

How many publications and citations does Stefan D. Bruda have?

OpenAlex counts 69 works and 280 citations for Stefan D. Bruda, an h-index of 10, ranking #6,065,955 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 Stefan D. Bruda. 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.