Daniel Neider
Impact in
- Software top 1%
- Software Testing and Debugging Techniques
- Model-Driven Software Engineering Techniques
-
- Formal Methods in Verification
- semigroups and automata theory
Papers in
-
- Machine Learning and Algorithms 32
- Logic, programming, and type systems 17
- Logic, Reasoning, and Knowledge 9
- Adversarial Robustness in Machine Learning 7
-
- Formal Methods in Verification 40
- semigroups and automata theory 10
- Co-authors
- P. Madhusudan (11 shared papers)Pranav Garg (8 shared papers)Christof Löding (6 shared papers)Dan Roth (2 shared papers)Ufuk Topcu (10 shared papers)Martin Leucker (8 shared papers)Zhe Xu (9 shared papers)Benedikt Bollig (6 shared papers)
- Journals
- Lecture notes in computer science (33 papers)ACM Transactions on Computational Logic (2 papers)Formal Methods in System Design (2 papers)ACM SIGPLAN Notices (1 paper)Logical Methods in Computer Science (1 paper)
- Partner nations
- GermanyUnited StatesFrance
In The Last Decade
Daniel Neider
67 papers receiving 905 citations
Peers
Comparison fields: 5 of 54
- Software 415
- Computational Theory and Mathematics 514
- Artificial Intelligence 717
- Information Systems 167
- Hardware and Architecture 48
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 76 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2014 | 137 | |
| 2 | 2016 | 106 | |
| 3 | 2010 | 72 | |
| 4 | 2018 | 70 | |
| 5 | 2020 | 41 | |
| 6 | 2016 | 40 | |
| 7 | 2019 | 33 | |
| 8 | 2013 | 24 | |
| 9 | 2022 | 23 | |
| 10 | 2013 | 21 | |
| 11 | 2016 | 18 | |
| 12 | 2012 | 18 | |
| 13 | 2021 | 17 | |
| 14 | 2021 | 17 | |
| 15 | 2012 | 17 | |
| 16 | 2022 | 16 | |
| 17 | 2021 | 15 | |
| 18 | 2022 | 14 | |
| 19 | 2016 | 14 | |
| 20 | 2021 | 14 |
About Daniel Neider
Daniel Neider is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Software, Computer Networks and Communications and Information Systems, having authored 76 papers that have together received 930 indexed citations. Recurring topics across this work include Formal Methods in Verification (40 papers), Machine Learning and Algorithms (32 papers), Logic, programming, and type systems (17 papers), Software Testing and Debugging Techniques (17 papers), Model-Driven Software Engineering Techniques (10 papers), semigroups and automata theory (10 papers), Logic, Reasoning, and Knowledge (9 papers) and Adversarial Robustness in Machine Learning (7 papers). The work is most often cited by research in Software (415 citations), Computational Theory and Mathematics (514 citations), Artificial Intelligence (717 citations), Information Systems (167 citations) and Hardware and Architecture (48 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, Benedikt Bollig, Paulo Tabuada and Carsten Kern. Their work appears in journals such as Lecture notes in computer science, ACM Transactions on Computational Logic, Formal Methods in System Design, ACM SIGPLAN Notices and Logical Methods in 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.