Science Explorer Back to mapMap
Discussion
Researcher · École Polytechnique Fédérale de Lausanne · Switzerland

Martin Odersky

Martin Odersky publishes mostly in Artificial Intelligence, Computer Networks and Communications and Hardware and Architecture, on topics such as Logic, programming, and type systems, Parallel Computing and Optimization Techniques and Formal Methods in Verification.

ORCID 0009-0005-3923-8993 OpenAlex
World rank
#70,137
of 7,710,434 ranked researchers
Rank in Switzerland
#1,504
of 80,918
Works
215
Citations
8.3k
Citations per work
38.4
h-index
48
i10-index 120Top 1.2% in Artificial Intelligence
Martin Odersky

What does Martin Odersky research?

Martin Odersky's work is mostly in Computer Science (92%).

Physical Sciences: 197 works · 91.6% of their workComputer Science: 197 works · 91.6% of their workArtificial Intelligence: 89 works · 41.3% of their workComputer Networks and Communications: 33 works · 15.4% of their workHardware and Architecture: 33 works · 15.4% of their workComputational Theory and Mathematics: 21 works · 9.6% of their workInformation Systems: 16 works · 7.6% of their workSoftware: 5 works · 2.3% of their workEverything else: 18 works · 8.4% of their workTHEIR WORKMartin Odersky215works
Physical Sciences92%

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 Science19791.6%
  2. Everything else188.4%
  1. 1Artificial Intelligence41% of their works
  2. 2Computer Networks and Communications15% of their works
  3. 3Hardware and Architecture15% of their works
  4. 4Computational Theory and Mathematics10% of their works
  5. 5Information Systems8% of their works
  6. 6Software2% of their works

Research topics

Which keywords describe Martin Odersky's research?

The keywords of their largest research topics: Model Checking, Formal Verification, Static Analysis, Parallel Computing, Performance Optimization, Temporal Logic, Satisfiability Modulo Theories and Symbolic Model Checker.

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 Checking2063 topics
  2. Formal Verification1411 topic
  3. Static Analysis1411 topic
  4. Parallel Computing801 topic
  5. Performance Optimization801 topic
  6. Temporal Logic652 topics
  7. Satisfiability Modulo Theories411 topic
  8. Symbolic Model Checker411 topic
  9. Distributed Systems341 topic
  10. Fault Tolerance341 topic
  11. Autonomic Computing331 topic
  12. Self-Adaptive Systems331 topic
  13. Code Clone Detection311 topic
  14. Refactoring311 topic
  15. Answer Set Programming241 topic
  16. Modal Logic241 topic
  17. Continuous Queries231 topic
  18. Data Stream Management231 topic

Where does Martin Odersky work?

Martin Odersky's main affiliation in the publication record is École Polytechnique Fédérale de Lausanne, Switzerland.

How many publications and citations does Martin Odersky have?

OpenAlex counts 215 works and 8,263 citations for Martin Odersky, an h-index of 48, ranking #70,137 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.

Other researchers named Martin Odersky

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 Martin Odersky. 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.