Geoffrey Burn
- Artificial Intelligence top 10%
- Computational Theory and Mathematics top 5%
- Hardware and Architecture top 10%
- Computer Networks and Communications
- Information Systems
- Co-authors
- Chris HankinSamson AbramskySimon JonesJ.D. RobsonMark RyanSimon J. GaySigbjørn FinneSimon Peyton Jones
- Topics
- Logic, programming, and type systems (8 papers)Formal Methods in Verification (7 papers)Parallel Computing and Optimization Techniques (6 papers)
- Journals
- Theoretical Computer ScienceScience of Computer ProgrammingJournal of Functional Programming
- Partner nations
- United KingdomFranceUnited States
In The Last Decade
Geoffrey Burn
14 papers receiving 185 citations
Peers
Comparison fields: 5 of 30
- Artificial Intelligence 179
- Computational Theory and Mathematics 124
- Hardware and Architecture 68
- Computer Networks and Communications 41
- Information Systems 23
Countries citing papers authored by Geoffrey Burn
This map shows the geographic impact of Geoffrey Burn'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 Geoffrey Burn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Geoffrey Burn more than expected).
Fields of papers citing papers by Geoffrey Burn
This network shows the impact of papers produced by Geoffrey Burn. 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 Geoffrey Burn. The network helps show where Geoffrey Burn may publish in the future.
Co-authorship network of co-authors of Geoffrey Burn
This figure shows the co-authorship network connecting the top 25 collaborators of Geoffrey Burn. A scholar is included among the top collaborators of Geoffrey Burn based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Geoffrey Burn. Geoffrey Burn is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | 0 | |
| 5 | 4 | |
| 6 | Proceedings of the First Imperial College Department of Computing Workshop on Theory and formal methods 1993 | 5 |
| 7 | 6 | |
| 8 | 17 | |
| 9 | 4 | |
| 10 | Lazy Functional Languages: Abstract Interpretation and Compilation | 22 |
| 11 | 12 | |
| 12 | 5 | |
| 13 | Developing a distributed memory architecture for parallel graph reduction | 2 |
| 14 | 10 | |
| 15 | 38 | |
| 16 | 85 |
About Geoffrey Burn
Geoffrey Burn is a scholar working on Hardware and Architecture, Computational Theory and Mathematics and Artificial Intelligence, having authored 16 papers that have together received 214 indexed citations. Recurring topics across this work include Logic, programming, and type systems (8 papers), Formal Methods in Verification (7 papers) and Parallel Computing and Optimization Techniques (6 papers). The work is most often cited by research in Hardware and Architecture (68 citations), Computational Theory and Mathematics (124 citations) and Artificial Intelligence (179 citations). Geoffrey Burn has collaborated with scholars based in United Kingdom, France and United States. Frequent co-authors include Chris Hankin, Samson Abramsky, Simon Jones, J.D. Robson, Mark Ryan, Simon J. Gay, Sigbjørn Finne, Simon Peyton Jones, Daniel Le Métayer and Jon Derek Loftis. Their work appears in journals such as Theoretical Computer Science, Science of Computer Programming and Journal of Functional Programming.
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.