Paris Kanellakis Theory and Practice Award
E113231
The Paris Kanellakis Theory and Practice Award is an ACM honor recognizing theoretical computer science achievements that have had a significant and demonstrable impact on practical computing.
All labels observed (2)
| Label | Occurrences |
|---|---|
| ACM Paris Kanellakis Theory and Practice Award | 12 |
| Paris Kanellakis Theory and Practice Award canonical | 5 |
How this entity was disambiguated
This entity first appeared as the object of triple T964016 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: Paris Kanellakis Theory and Practice Award Context triple: [Ronald L. Rivest, awardReceived, Paris Kanellakis Theory and Practice Award]
-
A.
Leroy P. Steele Prize
The Leroy P. Steele Prize is a prestigious American Mathematical Society award recognizing outstanding research and expository writing in mathematics.
-
B.
ACM Prize in Computing
The ACM Prize in Computing is a prestigious annual award recognizing early to mid-career computer scientists for influential and innovative contributions to the field of computing.
-
C.
IEEE John von Neumann Medal
The IEEE John von Neumann Medal is a prestigious technical award presented by the IEEE for outstanding achievements in computer-related science and technology.
-
D.
Ackermann–Teubner Memorial Award
The Ackermann–Teubner Memorial Award is a prestigious mathematics prize historically awarded for outstanding contributions to mathematical research, notably received by Emmy Noether.
-
E.
ACM Distinguished Service Award
The ACM Distinguished Service Award is a prestigious honor presented by the Association for Computing Machinery to individuals who have made outstanding service contributions to the computing community.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Paris Kanellakis Theory and Practice Award Target entity description: The Paris Kanellakis Theory and Practice Award is an ACM honor recognizing theoretical computer science achievements that have had a significant and demonstrable impact on practical computing.
-
A.
Leroy P. Steele Prize
The Leroy P. Steele Prize is a prestigious American Mathematical Society award recognizing outstanding research and expository writing in mathematics.
-
B.
ACM Prize in Computing
The ACM Prize in Computing is a prestigious annual award recognizing early to mid-career computer scientists for influential and innovative contributions to the field of computing.
-
C.
IEEE John von Neumann Medal
The IEEE John von Neumann Medal is a prestigious technical award presented by the IEEE for outstanding achievements in computer-related science and technology.
-
D.
Ackermann–Teubner Memorial Award
The Ackermann–Teubner Memorial Award is a prestigious mathematics prize historically awarded for outstanding contributions to mathematical research, notably received by Emmy Noether.
-
E.
ACM Distinguished Service Award
The ACM Distinguished Service Award is a prestigious honor presented by the Association for Computing Machinery to individuals who have made outstanding service contributions to the computing community.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
ACM award
ⓘ
computer science award ⓘ theoretical computer science award ⓘ |
| administeredBy | Association for Computing Machinery ⓘ |
| alsoKnownAs |
ACM Paris Kanellakis Theory and Practice Award
ⓘ
linked to:
Paris Kanellakis Theory and Practice Award
|
| awardedFor | theoretical computer science achievements with significant and demonstrable impact on the practice of computing ⓘ |
| category |
research award
ⓘ
science and technology award ⓘ |
| countryOfOrigin |
United States
ⓘ
linked to:
United States of America
|
| currencyOfMonetaryComponent | US dollar ⓘ |
| eligibility | researchers in theoretical computer science whose work has practical impact ⓘ |
| field |
computer science
ⓘ
theoretical computer science ⓘ |
| frequency | annual ⓘ |
| hasComponent |
certificate
ⓘ
monetary prize ⓘ |
| hasDomain |
algorithms
ⓘ
computer systems ⓘ data structures ⓘ databases ⓘ distributed computing ⓘ programming languages ⓘ theory of computation ⓘ |
| honors | Paris C. Kanellakis ⓘ |
| inception | 1996 ⓘ |
| isPartOf |
ACM Awards Program
ⓘ
linked to:
ACM Awards Committee
|
| namedAfter | Paris C. Kanellakis ⓘ |
| namedInMemoryOf | Paris C. Kanellakis ⓘ |
| organizationTypeOfPresenter | professional computing society ⓘ |
| presentedBy |
ACM
ⓘ
Association for Computing Machinery ⓘ |
| purpose | to recognize theoretical accomplishments that significantly affect the practice of computing ⓘ |
| relatedTo |
ACM A. M. Turing Award
ⓘ
linked to:
Turing Award
ACM Fellows Program ⓘ |
| selectionMethod | committee review ⓘ |
| sponsor |
ACM SIGACT
ⓘ
linked to:
SIGACT
ACM SIGBED ⓘ ACM SIGDA ⓘ ACM SIGKDD ⓘ
linked to:
SIGKDD
ACM SIGMETRICS ⓘ ACM SIGMOD ⓘ
linked to:
SIGMOD
ACM SIGOPS ⓘ
linked to:
SIGOPS
ACM SIGPLAN ⓘ
linked to:
SIGPLAN
ACM SIGSAC ⓘ ACM SIGecom ⓘ ACM Special Interest Groups ⓘ
linked to:
ACM Special Interest Group
|
| website | https://awards.acm.org/kanellakis ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: Paris Kanellakis Theory and Practice Award Description of subject: The Paris Kanellakis Theory and Practice Award is an ACM honor recognizing theoretical computer science achievements that have had a significant and demonstrable impact on practical computing.
Referenced by (17)
Full triples — surface form annotated when it differs from this entity's canonical label.