Skip to search formSkip to main contentSkip to account menu

ACM Turing Award

Known as: A.M. Turing Award, Turing Award laureates, Turing Prize 
The ACM A.M. Turing Award is an annual prize given by the Association for Computing Machinery (ACM) to "an individual selected for contributions of a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ALGOLALGOL 60APLAlan Turing Centenary Conference

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
The Evolution of Turing Award Collaboration Network: Bibliometric-Level and Network-Level Metrics
The year of 2017 for the 50th anniversary of the Turing Award, which represents the top-level award in the computer science field… 
Review
2014
Review
2014
Cloud Computing Overview
Cloud Computing is deemed the main trend of IT development for the coming decades, and it is to have a profound impact on the… 
Highly Cited
2010
Highly Cited
2010
Textbook of Computable General Equilibrium Modeling: Programming and Simulations
promoting novelty rigor and style in energy social admittedly a prosaic concept research impact can be roughly divided into… 
Highly Cited
2006
Highly Cited
2006
Neural Fields with Distributed Transmission Speeds and Long-Range Feedback Delays
We introduce distributed axonal transmission speeds and a long‐range constant feedback loop into the standard neural field model… 
Highly Cited
2001
Highly Cited
2001
A Cladistic Analysis and Taxonomic Revision of the Plesiosauria (Reptilia: Sauropterygia)
The Plesiosauria (Reptilia: Sauropterygia) is a group of Mesozoic marine reptiles known from abundant material, with specimens… 
1995
1995
On the computational complexity of bisimulation
In his Turing Award lecture, Juris Hartmanis eloquently discusses, among other things, the fundamental role of computational… 
Highly Cited
1987
Highly Cited
1987
PNP [log n] and Sparse Turing-Complete Sets for NP
  • Jim Kadin
  • Proceeding Structure in Complexity Theory
  • 1987
  • Corpus ID: 23446943
pNP[log n] is the class of languages recognizable by deterministic polynomial time machines that make O(log n) queries to an… 
Highly Cited
1985
Highly Cited
1985
Turing award lecture
  • R. Karp
  • ACM '85
  • 1985
  • Corpus ID: 37766537
For his continuing contributions to the theory of algorithms, including the development of efficient algorithms for network flow… 
Review
1978
Review
1978
The Northern Isles: Orkney and Shetland
This volume is designed as a contribution to European ethnology. The Northern Isles, Orkney and Shetland, were and are a… 
Highly Cited
1970
Highly Cited
1970
Form and Content in Computer Science (1970 ACM turing lecture)
The trouble with computer science today is an obsessive concern with form instead of content. No, that is the wrong way to begin… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)