Peter B. Ladkin
- Computer Networks and Communications top 2%
- Artificial Intelligence top 5%
- Signal Processing top 2%
- Computational Theory and Mathematics top 5%
- Information Systems top 10%
- Co-authors
- Henry KautzRoger D. MadduxAlexander ReinefeldStefan LeueRalph McKenzieHarold ThimblebyBryan OlivierLeslie Lamport
- Topics
- Constraint Satisfaction and Optimization (11 papers)Formal Methods in Verification (11 papers)Logic, Reasoning, and Knowledge (7 papers)
- Partner nations
- GermanyUnited KingdomUnited States
In The Last Decade
Peter B. Ladkin
43 papers receiving 643 citations
Peers
Comparison fields: 5 of 49
- Computer Networks and Communications 537
- Artificial Intelligence 468
- Signal Processing 292
- Computational Theory and Mathematics 158
- Information Systems 76
Countries citing papers authored by Peter B. Ladkin
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).
Fields of papers citing papers by Peter B. Ladkin
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.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 2 | |
| 3 | 1 | |
| 4 | A Lazy Caching Proof in TLA | 0 |
| 5 | The Fukushima Dai-Ichi accident | 1 |
| 6 | Ontological Hazard Analysis of a Communications Bus | 1 |
| 7 | Risks of technological remedy | 2 |
| 8 | A Proper Explanation When You Need One. | 7 |
| 9 | Four issues concerning the semantics of Message Flow Graphs. | 5 |
| 10 | What Do Message Sequence Charts Mean | 6 |
| 11 | On the semantics of message sequence charts | 2 |
| 12 | Integrating metric and qualitative temporal reasoning | 135 |
| 13 | Satisfying first-order constraints about time intervals | 16 |
| 14 | The Algebra of Binary Constraint Networks | 1 |
| 15 | Logical time pieces | 5 |
| 16 | The completeness of a natural system for reasoning with time intervals | 33 |
| 17 | 13 | |
| 18 | Models of axioms for time intervals | 31 |
| 19 | Primitives and units for time specification | 49 |
| 20 | Time representation: a taxonomy of interval relations | 82 |
About Peter B. Ladkin
Peter B. Ladkin is a scholar working on Software, Computational Theory and Mathematics and Hardware and Architecture, having authored 50 papers that have together received 760 indexed citations. Recurring topics across this work include Constraint Satisfaction and Optimization (11 papers), Formal Methods in Verification (11 papers) and Logic, Reasoning, and Knowledge (7 papers). The work is most often cited by research in Signal Processing (292 citations), Computer Networks and Communications (537 citations) and Software (61 citations). Peter B. Ladkin has collaborated with scholars based in Germany, United Kingdom and United States. Frequent co-authors include Henry Kautz, Roger D. Maddux, Alexander Reinefeld, Stefan Leue, Ralph McKenzie, Harold Thimbleby, Bryan Olivier, Leslie Lamport, Barbara Sımons and Martyn Thomas. Their work appears in journals such as Communications of the ACM, Artificial Intelligence and Journal of the ACM.
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.