Countries citing papers authored by Peter B. Ladkin
Since
Specialization
Citations
This map shows the geographic impact of Peter B. Ladkin'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 Peter B. Ladkin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter B. Ladkin more than expected).
This network shows the impact of papers produced by Peter B. Ladkin. 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 Peter B. Ladkin. The network helps show where Peter B. Ladkin may publish in the future.
Co-authorship network of co-authors of Peter B. Ladkin
This figure shows the co-authorship network connecting the top 25 collaborators of Peter B. Ladkin.
A scholar is included among the top collaborators of Peter B. Ladkin 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 Peter B. Ladkin. Peter B. Ladkin is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Ladkin, Peter B., et al.. (2016). A Lazy Caching Proof in TLA. Distributed Computing. 2(3). 151–174.
5.
Ladkin, Peter B., et al.. (2013). The Fukushima Dai-Ichi accident. Lit eBooks.1 indexed citations
6.
Ladkin, Peter B., et al.. (2010). Ontological Hazard Analysis of a Communications Bus.1 indexed citations
7.
Ladkin, Peter B.. (1997). Risks of technological remedy. Communications of the ACM. 40(11). 160.2 indexed citations
8.
Thimbleby, Harold & Peter B. Ladkin. (1995). A Proper Explanation When You Need One.. 107–118.7 indexed citations
9.
Ladkin, Peter B. & Stefan Leue. (1994). Four issues concerning the semantics of Message Flow Graphs.. KOPS (University of Konstanz). 355–369.5 indexed citations
10.
Ladkin, Peter B. & Stefan Leue. (1993). What Do Message Sequence Charts Mean. KOPS (University of Konstanz). 301–316.6 indexed citations
11.
Ladkin, Peter B. & Stefan Leue. (1993). On the semantics of message sequence charts. KOPS (University of Konstanz). 88–104.2 indexed citations
12.
Kautz, Henry & Peter B. Ladkin. (1991). Integrating metric and qualitative temporal reasoning. National Conference on Artificial Intelligence. 241–246.135 indexed citations
13.
Ladkin, Peter B.. (1988). Satisfying first-order constraints about time intervals. National Conference on Artificial Intelligence. 512–517.16 indexed citations
14.
Ladkin, Peter B. & Roger D. Maddux. (1988). The Algebra of Binary Constraint Networks.1 indexed citations
15.
Ladkin, Peter B.. (1987). Logical time pieces. 2(8). 58–68.5 indexed citations
16.
Ladkin, Peter B.. (1987). The completeness of a natural system for reasoning with time intervals. International Joint Conference on Artificial Intelligence. 462–467.33 indexed citations
Ladkin, Peter B.. (1987). Models of axioms for time intervals. National Conference on Artificial Intelligence. 234–239.31 indexed citations
19.
Ladkin, Peter B.. (1986). Primitives and units for time specification. National Conference on Artificial Intelligence. 354–359.49 indexed citations
20.
Ladkin, Peter B.. (1986). Time representation: a taxonomy of interval relations. National Conference on Artificial Intelligence. 360–366.82 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.