Daniel Neider
Impact in
- Computational Theory and Mathematics top 0.5%
- Formal Methods in Verification
- semigroups and automata theory
- Software top 2%
- Software Testing and Debugging Techniques
Papers in
-
- Formal Methods in Verification 59
- semigroups and automata theory 16
-
- Logic, programming, and type systems 12
- Logic, Reasoning, and Knowledge 10
- Reinforcement Learning in Robotics 7
- Privacy-Preserving Technologies in Data 2
- Adversarial Robustness in Machine Learning 2
- Co-authors
- P. Madhusudan (12 shared papers)Pranav Garg (9 shared papers)Christof Löding (4 shared papers)Dan Roth (2 shared papers)Ufuk Topcu (9 shared papers)Martin Leucker (8 shared papers)Zhe Xu (8 shared papers)Martín Zimmermann (13 shared papers)
- Journals
- Lecture notes in computer science (35 papers)ACM Transactions on Computational Logic (2 papers)Formal Methods in System Design (2 papers)Information and Computation (1 paper)Theoretical Computer Science (1 paper)
- Partner nations
- GermanyUnited StatesFrance
In The Last Decade
Daniel Neider
77 papers receiving 1.2k citations
Peers
Comparison fields: 5 of 43
- Computational Theory and Mathematics 746
- Software 192
- Artificial Intelligence 553
- Hardware and Architecture 12
- Information Systems 37
Countries citing papers authored by Daniel Neider
This map shows the geographic impact of Daniel Neider's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Daniel Neider with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Neider more than expected).
Fields of papers citing papers by Daniel Neider
This network shows the impact of papers produced by Daniel Neider. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Daniel Neider. The network helps show where Daniel Neider may publish in the future.
Co-authors
The 25 scholars most cited alongside Daniel Neider, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 83 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2014 | 156 | |
| 2 | 2016 | 125 | |
| 3 | 2018 | 80 | |
| 4 | 2010 | 73 | |
| 5 | 2020 | 49 | |
| 6 | 2016 | 47 | |
| 7 | 2018 | 44 | |
| 8 | 2019 | 38 | |
| 9 | 2022 | 33 | |
| 10 | 2016 | 28 | |
| 11 | 2013 | 26 | |
| 12 | 2013 | 22 | |
| 13 | 2012 | 20 | |
| 14 | 2022 | 20 | |
| 15 | 2012 | 18 | |
| 16 | 2021 | 18 | |
| 17 | 2021 | 18 | |
| 18 | 2016 | 17 | |
| 19 | 2020 | 17 | |
| 20 | 2022 | 17 |
About Daniel Neider
Daniel Neider is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Software, Safety Research and Computer Vision and Pattern Recognition, having authored 83 papers that have together received 1.2k indexed citations. Recurring topics across this work include Formal Methods in Verification (59 papers), semigroups and automata theory (16 papers), Logic, programming, and type systems (12 papers), Logic, Reasoning, and Knowledge (10 papers), Reinforcement Learning in Robotics (7 papers), Software Testing and Debugging Techniques (3 papers), Privacy-Preserving Technologies in Data (2 papers) and Adversarial Robustness in Machine Learning (2 papers). The work is most often cited by research in Computational Theory and Mathematics (746 citations), Software (192 citations), Artificial Intelligence (553 citations), Hardware and Architecture (12 citations) and Information Systems (37 citations). Daniel Neider has collaborated with scholars based in Germany, United States and France. Frequent co-authors include P. Madhusudan, Pranav Garg, Christof Löding, Dan Roth, Ufuk Topcu, Martin Leucker, Zhe Xu, Martín Zimmermann, Benedikt Bollig and Paulo Tabuada. Their work appears in journals such as Lecture notes in computer science, ACM Transactions on Computational Logic, Formal Methods in System Design, Information and Computation and Theoretical Computer Science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.