Nils Anders Danielsson
Impact in
-
- Formal Methods in Verification
- semigroups and automata theory
- Software top 10%
- Software Testing and Debugging Techniques
Papers in
-
- Logic, programming, and type systems 19
- Logic, Reasoning, and Knowledge 12
- Algorithms and Data Compression 4
-
- Formal Methods in Verification 15
- Advanced Algebra and Logic 2
- semigroups and automata theory 2
- Topological and Geometric Data Analysis 1
- Co-authors
- John Hughes (2 shared papers)Jeremy Gibbons (2 shared papers)Patrik Jansson (2 shared papers)Thorsten Altenkirch (3 shared papers)Thierry Coquand (1 shared paper)Andreas Abel (1 shared paper)
- Journals
- ACM SIGPLAN Notices (4 papers)Proceedings of the ACM on Programming Languages (2 papers)Indagationes Mathematicae (1 paper)SHILAP Revista de lepidopterología (1 paper)Chalmers Research (Chalmers University of Technology) (1 paper)
- Partner nations
- SwedenUnited Kingdom
In The Last Decade
Nils Anders Danielsson
19 papers receiving 236 citations
Peers
Comparison fields: 5 of 24
- Computational Theory and Mathematics 182
- Software 32
- Artificial Intelligence 233
- Hardware and Architecture 32
- Information Systems 31
Countries citing papers authored by Nils Anders Danielsson
This map shows the geographic impact of Nils Anders Danielsson'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 Nils Anders Danielsson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nils Anders Danielsson more than expected).
Fields of papers citing papers by Nils Anders Danielsson
This network shows the impact of papers produced by Nils Anders Danielsson. 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 Nils Anders Danielsson. The network helps show where Nils Anders Danielsson may publish in the future.
Co-authors
The 6 scholars most cited alongside Nils Anders Danielsson, 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 21 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 50 | |
| 2 | 2006 | 41 | |
| 3 | 2010 | 37 | |
| 4 | 2012 | 26 | |
| 5 | 2010 | 17 | |
| 6 | 2010 | 12 | |
| 7 | 2013 | 9 | |
| 8 | 2006 | 8 | |
| 9 | 2017 | 8 | |
| 10 | 2010 | 7 | |
| 11 | 2023 | 7 | |
| 12 | 2008 | 7 | |
| 13 | Mixing Induction and Coinduction | 2009 | 6 |
| 14 | 2012 | 5 | |
| 15 | Up-to Techniques Using Sized Types | 2018 | 4 |
| 16 | 2013 | 4 | |
| 17 | 2018 | 2 | |
| 18 | 2020 | 1 | |
| 19 | A Formalisation of the Correctness Result From "Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures" | 2007 | 1 |
| 20 | 2018 | 0 |
About Nils Anders Danielsson
Nils Anders Danielsson is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Hardware and Architecture, Computer Vision and Pattern Recognition and Infectious Diseases, having authored 21 papers that have together received 252 indexed citations. Recurring topics across this work include Logic, programming, and type systems (19 papers), Formal Methods in Verification (15 papers), Logic, Reasoning, and Knowledge (12 papers), Algorithms and Data Compression (4 papers), Parallel Computing and Optimization Techniques (2 papers), Advanced Algebra and Logic (2 papers), semigroups and automata theory (2 papers) and Topological and Geometric Data Analysis (1 paper). The work is most often cited by research in Computational Theory and Mathematics (182 citations), Software (32 citations), Artificial Intelligence (233 citations), Hardware and Architecture (32 citations) and Information Systems (31 citations). Nils Anders Danielsson has collaborated with scholars based in Sweden and United Kingdom. Frequent co-authors include John Hughes, Jeremy Gibbons, Patrik Jansson, Thorsten Altenkirch, Thierry Coquand and Andreas Abel. Their work appears in journals such as ACM SIGPLAN Notices, Proceedings of the ACM on Programming Languages, Indagationes Mathematicae, SHILAP Revista de lepidopterología and Chalmers Research (Chalmers University of Technology).
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.