Science Explorer Back to mapMap
Discussion
Researcher · Trinity College · Canada

Dmitrii Vasilev

Dmitrii Vasilev publishes mostly in Artificial Intelligence, Computational Theory and Mathematics and Hardware and Architecture, on topics such as Natural Language Processing Techniques, Adversarial Robustness in Machine Learning and Mathematics, Computing, and Information Processing.

OpenAlex
World rank
#6,170,892
of 7,710,434 ranked researchers
Rank in Canada
#168,540
of 183,316
Works
18
Citations
0
h-index
0
i10-index 0Top 100% in Artificial Intelligence
Dmitrii Vasilev

What does Dmitrii Vasilev research?

Dmitrii Vasilev's work is mostly in Computer Science (92%), Engineering (4%).

Physical Sciences: 17 works · 95.8% of their workComputer Science: 16 works · 91.6% of their workArtificial Intelligence: 8 works · 45.8% of their workComputational Theory and Mathematics: 4 works · 20.8% of their workHardware and Architecture: 2 works · 12.5% of their workInformation Systems: 1 works · 8.3% of their workComputer Vision and Pattern Recognition: 1 works · 4.2% of their workEngineering: 1 works · 4.2% of their workMechanical Engineering: 1 works · 4.2% of their workEverything else: 1 works · 4.2% of their workTHEIR WORKDmitrii Vasilev18works
Physical Sciences96%

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 Science1691.6%
    2. Engineering14.2%
  2. Everything else14.2%
  1. 1Artificial Intelligence46% of their works
  2. 2Computational Theory and Mathematics21% of their works
  3. 3Hardware and Architecture12% of their works
  4. 4Information Systems8% of their works
  5. 5Computer Vision and Pattern Recognition4% of their works
  6. 6Mechanical Engineering4% of their works

Research topics

Which keywords describe Dmitrii Vasilev's research?

The keywords of their largest research topics: Deep Learning, Machine Learning, Neural Networks, Adversarial Examples, Floating-Point Arithmetic, Interval Analysis, Math Search and Mathematical Information Retrieval.

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 19 words, with their numbers
  1. Deep Learning83 topics
  2. Machine Learning83 topics
  3. Neural Networks62 topics
  4. Adversarial Examples41 topic
  5. Floating-Point Arithmetic41 topic
  6. Interval Analysis41 topic
  7. Math Search41 topic
  8. Mathematical Information Retrieval41 topic
  9. Neural Machine Translation41 topic
  10. Parallel Computing41 topic
  11. Performance Optimization41 topic
  12. Robustness41 topic
  13. Statistical Machine Translation41 topic
  14. Active Learning21 topic
  15. Classification21 topic
  16. Genetic Programming21 topic
  17. Reinforcement Learning21 topic
  18. Robotics21 topic
  19. Semi-Supervised Learning21 topic

Where does Dmitrii Vasilev work?

Dmitrii Vasilev's main affiliation in the publication record is Trinity College, Canada.

How many publications and citations does Dmitrii Vasilev have?

OpenAlex counts 18 works and 0 citations for Dmitrii Vasilev, an h-index of 0, ranking #6,170,892 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 Dmitrii Vasilev. 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.