Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
A survey of hard real-time scheduling for multiprocessor systems
2011577 citationsRobert I. Davis, Alan Burnsprofile →
Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised
2007555 citationsRobert I. Davis, Alan Burns et al.Real-Time Systemsprofile →
Real Time Scheduling Theory: A Historical Perspective
2004383 citationsTarek Abdelzaher, Alan Burns et al.Real-Time Systemsprofile →
This map shows the geographic impact of Alan Burns'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 Alan Burns with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alan Burns more than expected).
This network shows the impact of papers produced by Alan Burns. 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 Alan Burns. The network helps show where Alan Burns may publish in the future.
Co-authorship network of co-authors of Alan Burns
This figure shows the co-authorship network connecting the top 25 collaborators of Alan Burns.
A scholar is included among the top collaborators of Alan Burns 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 Alan Burns. Alan Burns is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Hayes, Ian J., Alan Burns, Brijesh Dongol, & Cliff B. Jones. (2011). Comparing Models of Nondeterministic Expression Evaluation. School of Computing Science Technical Report Series.6 indexed citations
7.
Burns, Alan, et al.. (2009). Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX. Addison-Wesley Longman Publishing Co., Inc. eBooks.129 indexed citations
8.
Burns, Alan & Sanjoy Baruah. (2008). Sustainability in Real-time Scheduling. Journal of Computing Science and Engineering. 2(1). 74–97.59 indexed citations
Bril, Reinder J., Johan J. Lukkien, Robert I. Davis, & Alan Burns. (2006). Message response time analysis for ideal controller area network (CAN) refuted. Data Archiving and Networked Services (DANS). 619. 290–3.21 indexed citations
Lima, George & Alan Burns. (2001). A Timely Distributed Consensus Solution in a Crash/Omission-Fault Environment.
13.
Burns, Alan, Andy Wellings, Frank Burns, et al.. (2001). Modelling and verification of an atomic action protocol implemented in Ada. Computer Systems: Science & Engineering. 16. 173–182.1 indexed citations
14.
Burns, Alan & Andy Wellings. (1998). Concurrency in Ada (2nd ed.). Cambridge University Press eBooks.9 indexed citations
15.
Bernat, Guillem & Alan Burns. (1997). Combining ( m n )-hard deadlines and dual priority scheduling.. 46–57.2 indexed citations
16.
Audsley, Neil, Alan Burns, Mike Richardson, & Andy Wellings. (1995). Data Consistency in Hard Real-Time Systems.. Informatica (slovenia). 19.19 indexed citations
Burns, Alan, et al.. (1993). Allocating And Scheduling Hard Real-Time Tasks On A Point-To-Point Distributed System.18 indexed citations
19.
Burns, Alan, et al.. (1991). TARDIS: An Architectural Framework for Timely and Reliable Distributed Information Systems. 1.1 indexed citations
20.
Burns, Alan. (1985). Concurrent programming in Ada. Cambridge University Press eBooks.37 indexed citations
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.