Science Explorer Back to mapMap
Discussion
Researcher · Audi (Germany) · Germany

Vahid Hashemi

Vahid Hashemi publishes mostly in Artificial Intelligence, Computational Theory and Mathematics and Automotive Engineering, on topics such as Formal Methods in Verification, Adversarial Robustness in Machine Learning and Autonomous Vehicle Technology and Safety.

ORCID 0000-0002-9167-7417 OpenAlex
World rank
#5,202,155
of 7,710,434 ranked researchers
Rank in Germany
#269,039
of 364,343
Works
52
Citations
245
Citations per work
4.7
h-index
10
i10-index 10Top 42% in Artificial Intelligence
Vahid Hashemi

What does Vahid Hashemi research?

Vahid Hashemi's work is mostly in Computer Science (58%), Engineering (16%).

Physical Sciences: 38 works · 73.8% of their workComputer Science: 30 works · 58.0% of their workArtificial Intelligence: 15 works · 29.7% of their workComputational Theory and Mathematics: 11 works · 20.7% of their workComputer Vision and Pattern Recognition: 4 works · 7.6% of their workEngineering: 8 works · 15.8% of their workAutomotive Engineering: 4 works · 7.6% of their workControl and Systems Engineering: 2 works · 4.1% of their workElectrical and Electronic Engineering: 2 works · 4.1% of their workEverything else: 14 works · 26.2% of their workTHEIR WORKVahid Hashemi52works
Physical Sciences74%

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 Science3058.0%
    2. Engineering815.8%
  2. Everything else1426.2%
  1. 1Artificial Intelligence30% of their works
  2. 2Computational Theory and Mathematics21% of their works
  3. 3Automotive Engineering8% of their works
  4. 4Computer Vision and Pattern Recognition8% of their works
  5. 5Electrical and Electronic Engineering4% of their works
  6. 6Control and Systems Engineering4% of their works

Research topics

Which keywords describe Vahid Hashemi's research?

The keywords of their largest research topics: Deep Learning, Neural Networks, Machine Learning, Model Checking, Temporal Logic, Satisfiability Modulo Theories, Symbolic Model Checker and Adversarial Examples.

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 21 words, with their numbers
  1. Deep Learning405 topics
  2. Neural Networks273 topics
  3. Machine Learning232 topics
  4. Model Checking212 topics
  5. Temporal Logic212 topics
  6. Satisfiability Modulo Theories181 topic
  7. Symbolic Model Checker181 topic
  8. Adversarial Examples151 topic
  9. Robustness151 topic
  10. Autonomous Vehicles81 topic
  11. Trajectory Prediction81 topic
  12. Anomaly Detection71 topic
  13. Unsupervised71 topic
  14. Convolutional Neural Networks51 topic
  15. Deadlock Prevention51 topic
  16. Image Recognition51 topic
  17. Petri Nets51 topic
  18. Reinforcement Learning51 topic
  19. Robotics51 topic
  20. Answer Set Programming31 topic
  21. Modal Logic31 topic

Where does Vahid Hashemi work?

Vahid Hashemi's main affiliation in the publication record is Audi (Germany), Germany.

How many publications and citations does Vahid Hashemi have?

OpenAlex counts 52 works and 245 citations for Vahid Hashemi, an h-index of 10, ranking #5,202,155 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 Vahid Hashemi. 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.