Samson Abramsky

Citata da

	Tutte	Dal 2020
Citazioni	17902	3555
Indice H	63	28
i10-index	138	77

860

430

215

645

19871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202548 43 79 115 141 236 291 323 355 380 405 306 426 315 345 363 438 499 503 545 626 568 585 509 494 592 614 635 565 617 713 612 695 546 676 685 852 705 90

Accesso pubblico

Visualizza tutto

21 articoli

1 articolo

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Guy McCuskerProfessor of Computer Science, University of BathEmail verificata su bath.ac.uk
Rui Soares BarbosaInternational Iberian Nanotechnology LaboratoryEmail verificata su inl.int
Luke OngDistinguished University Professor, Nanyang Technological UniversityEmail verificata su ntu.edu.sg
Chris HankinProfessor of Computing Science, Imperial College LondonEmail verificata su imperial.ac.uk
Dov GabbayBar Ilan Univ. Kings College London, Univ of LuxembourgEmail verificata su ext.uni.lu
Shane MansfieldQuandelaEmail verificata su quandela.com
Adam BrandenburgerNew York UniversityEmail verificata su stern.nyu.edu
Pasquale MalacariaProfessor, Queen Mary University of LondonEmail verificata su qmul.ac.uk
Achim JungProfessor of Computer Science, University of Birmingham, UKEmail verificata su cs.bham.ac.uk
Andrzej MurawskiUniversity of OxfordEmail verificata su cs.ox.ac.uk
Rajagopal NagarajanProfessor of Foundations of Computing, Middlesex UniversityEmail verificata su mdx.ac.uk
Kohei KishidaDepartment of Philosophy, University of Illinois at Urbana-ChampaignEmail verificata su illinois.edu
Simon J GaySchool of Computing Science, University of GlasgowEmail verificata su dcs.gla.ac.uk
Nihil ShahDPhil Candidate, University of OxfordEmail verificata su cs.ox.ac.uk
Mehrnoosh SadrzadehProfessor of Computer Science, Royal Academy of Engineering Research Chair,University College LondonEmail verificata su ucl.ac.uk
Luca ReggioDepartment of Computer Science, University College LondonEmail verificata su ucl.ac.uk
Anuj DawarUniversity of CambridgeEmail verificata su cl.cam.ac.uk
Giovanni CarùUniversity of OxfordEmail verificata su cs.ox.ac.uk
Prakash PanangadenProfessor of Computer Science, McGill UniversityEmail verificata su cs.mcgill.ca
Paul-André MellièsCNRS, Université Paris CitéEmail verificata su irif.fr

Segui

Samson Abramsky

Professor of Computer Science, UCL

Email verificata su ucl.ac.uk - Home page

Theoretical computer science quantum information and foundations game theory


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Domain theory S Abramsky, A Jung Oxford University Press, 1994	1742	1994
A categorical semantics of quantum protocols S Abramsky, B Coecke Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004	1009	2004
Full Abstraction in the Lazy Lambda Calculus S Abramsky, L Ong Information and Computation 105 (2), 159--268, 1993	966	1993
Computational Interpretations of Linear logic S Abramsky Theoretical Computer Science 111, 3--57, 1993	768	1993
Domain Theory in Logical Form S Abramsky Annals of Pure and Applied Logic 51, 1–77, 1991	723	1991
Full Abstraction for PCF S Abramsky, R Jagadeesan, P Malacaria Information and Computation 163 (2), 409--470, 2000	678	2000
The sheaf-theoretic structure of non-locality and contextuality S Abramsky, A Brandenburger New J. Phys. 13 (113036), 1--40, 2011	622	2011
Games and full completeness for multiplicative linear logic S Abramsky, R Jagadeesan The Journal of Symbolic Logic 59 (2), 543-574, 1994	507	1994
Abstract interpretation of declarative languages S Abramsky, C Hankin Halsted Press, 1987	451	1987
Handbook of Logic in Computer Science: Volume 5. Algebraic and Logical Structures S Abramsky, DM Gabbay, TSE Maibaum OUP Oxford, 2001	396	2001
Categorical quantum mechanics S Abramsky, B Coecke Handbook of quantum logic and quantum structures: quantum logic, 261-324, 2008	325	2008
Quantales, Observational Logic and Process Semantics S Abramsky	325	1993
Observation equivalence as a testing equivalence S Abramsky Theoretical Computer Science 53 (2-3), 225-241, 1987	321	1987
A fully abstract game semantics for general references S Abramsky, K Honda, G McCusker Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science …, 1998	284	1998
Semantics of interaction: an introduction to game semantics S Abramsky Semantics and Logics of Computation, Publications of the Newton Institute, 1-31, 1997	271	1997
Strictness Analysis for Higher Order Functions S Abramsky, G Burn, C Hankin Science of Computer Programming 7, 249– 278, 1986	267*	1986
Concurrent games and full completeness S Abramsky, PA Mellies Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999	266	1999
A Domain Equation for Bisimulation S Abramsky Information and Computation 92 (2), 161-218, 1991	251	1991
Full abstraction for PCF S Abramsky, R Jagadeesan, P Malacaria Theoretical Aspects of Computer Software, 1--15, 1994	249	1994
Strictness analysis for higher-order functions GL Burn, C Hankin, S Abramsky Science of Computer Programming 7, 249-278, 1986	227	1986

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori