Thomas F. Sturm
Thomas F. Sturm publishes mostly in Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering, on topics such as Energy Efficient Wireless Sensor Networks, Context-Aware Activity Recognition Systems and Quantum Computing Algorithms and Architecture.
- World rank
- #3,193,329 of 7,710,434 ranked researchers
- Rank in Germany
- #158,980 of 364,343
- Works
- 24
- Citations
- 468
- Citations per work
- 19.5
What does Thomas F. Sturm research?
Thomas F. Sturm's work is mostly in Computer Science (37%), Engineering (10%), Materials Science (8%).
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
- Physical Sciences1561.7%
- Computer Science936.7%
- Engineering210.0%
- Materials Science28.3%
- Mathematics26.7%
- Everything else938.3%
- 1Computer Networks and Communications18% of their works
- 2Computational Theory and Mathematics12% of their works
- 3Electrical and Electronic Engineering10% of their works
- 4Materials Chemistry8% of their works
- 5Numerical Analysis7% of their works
- 6Artificial Intelligence7% of their works
Research topics
- Energy Efficient Wireless Sensor Networks
- Context-Aware Activity Recognition Systems
- Quantum Computing Algorithms and Architecture
- Computability, Logic, AI Algorithms
- Numerical Methods and Algorithms
- IoT and Edge/Fog Computing
- Thermal Radiation and Cooling Technologies
- Energy Harvesting in Wireless Networks
Which keywords describe Thomas F. Sturm's research?
The keywords of their largest research topics: Deep Learning, Energy-Efficient Protocols, Wireless Sensor Networks, Activity Recognition, Pervasive Computing, Quantum Computation, Quantum Information and Algorithmic Information Theory.
- Radiative Cooling
- Internet of Things
- Floating-Point Arithmetic
- Daytime Radiative Cooling
- Algorithmic Information Theory
- Quantum Computation
- Activity Recognition
- Energy-Efficient Protocols
- Deep Learning
- Wireless Sensor Networks
- Pervasive Computing
- Quantum Information
- Computability
- Edge Computing
- Information Transfer
- Interval Analysis
- Wireless Energy Harvesting
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
- Deep Learning62 topics
- Energy-Efficient Protocols61 topic
- Wireless Sensor Networks61 topic
- Activity Recognition41 topic
- Pervasive Computing41 topic
- Quantum Computation31 topic
- Quantum Information31 topic
- Algorithmic Information Theory21 topic
- Computability21 topic
- Daytime Radiative Cooling21 topic
- Edge Computing21 topic
- Floating-Point Arithmetic21 topic
- Information Transfer21 topic
- Internet of Things21 topic
- Interval Analysis21 topic
- Radiative Cooling21 topic
- Wireless Energy Harvesting21 topic
Where does Thomas F. Sturm work?
Thomas F. Sturm's main affiliation in the publication record is Infineon Technologies (Germany), Germany.
How many publications and citations does Thomas F. Sturm have?
OpenAlex counts 24 works and 468 citations for Thomas F. Sturm, an h-index of 6, ranking #3,193,329 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 Thomas F. Sturm. 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.