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.
Countries citing papers authored by Samson Abramsky
Since
Specialization
Citations
This map shows the geographic impact of Samson Abramsky'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 Samson Abramsky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Samson Abramsky more than expected).
This network shows the impact of papers produced by Samson Abramsky. 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 Samson Abramsky. The network helps show where Samson Abramsky may publish in the future.
Co-authorship network of co-authors of Samson Abramsky
This figure shows the co-authorship network connecting the top 25 collaborators of Samson Abramsky.
A scholar is included among the top collaborators of Samson Abramsky 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 Samson Abramsky. Samson Abramsky is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Abramsky, Samson, Adán Cabello, Ehtibar N. Dzhafarov, & Paweł Kurzyński. (2024). Quantum contextuality, causality and freedom of choice. Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences. 382(2268). 20230009–20230009.1 indexed citations
2.
Abramsky, Samson, Georg Gottlob, & Phokion G. Kolaitis. (2013). Robust constraint satisfaction and local hidden variables in quantum mechanics. Oxford University Research Archive (ORA) (University of Oxford). 440–446.11 indexed citations
Abramsky, Samson & Adam Brandenburger. (2011). A Unified Sheaf-Theoretic Account Of Non-Locality and Contextuality. arXiv (Cornell University).3 indexed citations
5.
Abramsky, Samson & Bob Coecke. (2006). Physics from Computer Science — a position statement —. International journal of unconventional computing. 3. 179–197.2 indexed citations
6.
Abramsky, Samson. (1997). Game Semantics for Programming Languages (Abstract). 3–4.2 indexed citations
7.
Abramsky, Samson. (1996). Semantics of Interaction (Abstract). 1.7 indexed citations
Abramsky, Samson, Dov M. Gabbay, & T. S. E. Maibaum. (1995). Handbook of logic in computer science (vol. 4): semantic modelling. Oxford University Press eBooks.19 indexed citations
10.
Abramsky, Samson, Dov M. Gabbay, & T. S. E. Maibaum. (1995). Handbook of logic in computer science (vol. 3): semantic structures. Oxford University Press eBooks.24 indexed citations
11.
Abramsky, Samson. (1994). Interaction categories and communicating sequential processes. Oxford University Research Archive (ORA) (University of Oxford). 1–15.16 indexed citations
12.
Abramsky, Samson. (1994). Interaction categories (extended abstract). Oxford University Research Archive (ORA) (University of Oxford). 57–69.11 indexed citations
13.
Abramsky, Samson & Guy McCusker. (1994). Games for Recursive Types.. Oxford University Research Archive (ORA) (University of Oxford). 1–20.18 indexed citations
14.
Abramsky, Samson, et al.. (1993). Handbook of logic in computer science (vol. 2): background: computational structures. 571–571.19 indexed citations
15.
Abramsky, Samson & T. S. E. Maibaum. (1993). Handbook of logic in computer science (vol. 1): background: mathematical structures. Oxford University Press eBooks.10 indexed citations
16.
Abramsky, Samson, Dov M. Gabbay, & T. S. E. Maibaum. (1992). Background : computational structures. Clarendon Press eBooks.14 indexed citations
17.
Abramsky, Samson & T. S. E. Maibaum. (1991). Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1.1 indexed citations
18.
Abramsky, Samson, et al.. (1991). Colloquium on Trees in Algebra and Programming (CAAP '91). Springer eBooks.2 indexed citations
19.
Abramsky, Samson. (1990). The lazy lambda calculus. Addison-Wesley Longman Publishing Co., Inc. eBooks. 65–116.169 indexed citations
20.
Abramsky, Samson, et al.. (1986). Category Theory and Computer Programming, Tutorial and Workshop, Guildford, UK, September 16-20, 1985 Proceedings. Springer eBooks.4 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.