Science Explorer Back to mapMap
Discussion
Researcher · IMDEA Software Institute · Spain

Aleksandar Nanevski

Aleksandar Nanevski publishes mostly in Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications, on topics such as Logic, programming, and type systems, Formal Methods in Verification and Logic, Reasoning, and Knowledge.

ORCID 0000-0002-4851-1075 OpenAlex
World rank
#365,148
of 7,710,434 ranked researchers
Rank in Spain
#6,353
of 204,306
Works
72
Citations
2k
Citations per work
28.4
h-index
24
i10-index 38Top 8.5% in Artificial Intelligence
Aleksandar Nanevski

What does Aleksandar Nanevski research?

Aleksandar Nanevski's work is mostly in Computer Science (96%).

Physical Sciences: 69 works · 96.5% of their workComputer Science: 69 works · 96.5% of their workArtificial Intelligence: 37 works · 50.7% of their workComputational Theory and Mathematics: 17 works · 24.2% of their workComputer Networks and Communications: 10 works · 14.5% of their workHardware and Architecture: 3 works · 4.3% of their workComputer Graphics and Computer-Aided Design: 1 works · 1.4% of their workSignal Processing: 1 works · 1.4% of their workEverything else: 3 works · 3.5% of their workTHEIR WORKAleksandarNanevski72works
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 Science6996.5%
  2. Everything else33.5%
  1. 1Artificial Intelligence51% of their works
  2. 2Computational Theory and Mathematics24% of their works
  3. 3Computer Networks and Communications14% of their works
  4. 4Hardware and Architecture4% of their works
  5. 5Computer Graphics and Computer-Aided Design1% of their works
  6. 6Signal Processing1% of their works

Research topics

Which keywords describe Aleksandar Nanevski's research?

The keywords of their largest research topics: Model Checking, Temporal Logic, Formal Verification, Static Analysis, Satisfiability Modulo Theories, Symbolic Model Checker, Answer Set Programming and Modal Logic.

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. Model Checking1313 topics
  2. Temporal Logic732 topics
  3. Formal Verification581 topic
  4. Static Analysis581 topic
  5. Satisfiability Modulo Theories401 topic
  6. Symbolic Model Checker401 topic
  7. Answer Set Programming331 topic
  8. Modal Logic331 topic
  9. Distributed Systems251 topic
  10. Fault Tolerance251 topic
  11. Security Policies111 topic
  12. Side-Channel Attacks111 topic
  13. Parallel Computing81 topic
  14. Performance Optimization81 topic
  15. Continuous Queries31 topic
  16. Data Stream Management31 topic
  17. Delaunay Triangulations31 topic
  18. Mesh Generation31 topic

Where does Aleksandar Nanevski work?

Aleksandar Nanevski's main affiliation in the publication record is IMDEA Software Institute, Spain.

How many publications and citations does Aleksandar Nanevski have?

OpenAlex counts 72 works and 2,045 citations for Aleksandar Nanevski, an h-index of 24, ranking #365,148 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 Aleksandar Nanevski. 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.