ACM Symposium on Theory of Computing
E100034
The ACM Symposium on Theory of Computing (STOC) is a premier annual research conference in theoretical computer science, featuring groundbreaking work in algorithms, complexity theory, cryptography, and related areas.
All labels observed (5)
| Label | Occurrences |
|---|---|
| STOC | 6 |
| ACM Symposium on Theory of Computing canonical | 4 |
| STOC conference proceedings | 2 |
| ACM STOC | 1 |
| ACM STOC conference | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T831538 — 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: ACM Symposium on Theory of Computing Context triple: [Gödel Prize, typicalVenue, ACM Symposium on Theory of Computing]
-
A.
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing is a 1985 ACM conference volume collecting influential research papers in theoretical computer science, including foundational work on topics such as interactive proof systems and computational complexity.
-
B.
Journal of the ACM
Journal of the ACM is a leading peer-reviewed scientific journal in computer science that publishes foundational research across the breadth of computing theory and practice.
-
C.
PODS Conference (jointly with ACM SIGACT)
The PODS Conference (jointly with ACM SIGACT) is a premier international research conference focused on the theoretical foundations of data management and database systems.
-
D.
European Association for Theoretical Computer Science
The European Association for Theoretical Computer Science is a professional organization that promotes research, education, and collaboration in theoretical computer science across Europe and beyond.
-
E.
International Colloquium on Automata, Languages and Programming
The International Colloquium on Automata, Languages and Programming (ICALP) is a leading annual conference in theoretical computer science, focusing on automata theory, formal languages, algorithms, and computational complexity.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: ACM Symposium on Theory of Computing Target entity description: The ACM Symposium on Theory of Computing (STOC) is a premier annual research conference in theoretical computer science, featuring groundbreaking work in algorithms, complexity theory, cryptography, and related areas.
-
A.
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing is a 1985 ACM conference volume collecting influential research papers in theoretical computer science, including foundational work on topics such as interactive proof systems and computational complexity.
-
B.
Journal of the ACM
Journal of the ACM is a leading peer-reviewed scientific journal in computer science that publishes foundational research across the breadth of computing theory and practice.
-
C.
PODS Conference (jointly with ACM SIGACT)
The PODS Conference (jointly with ACM SIGACT) is a premier international research conference focused on the theoretical foundations of data management and database systems.
-
D.
European Association for Theoretical Computer Science
The European Association for Theoretical Computer Science is a professional organization that promotes research, education, and collaboration in theoretical computer science across Europe and beyond.
-
E.
International Colloquium on Automata, Languages and Programming
The International Colloquium on Automata, Languages and Programming (ICALP) is a leading annual conference in theoretical computer science, focusing on automata theory, formal languages, algorithms, and computational complexity.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
academic conference
ⓘ
computer science conference ⓘ theoretical computer science conference ⓘ |
| abbreviation |
ACM Symposium on Theory of Computing
self-linksurface differs
ⓘ
surface form:
STOC
|
| acceptsSubmissionType | research papers ⓘ |
| countryOfOrigin |
United States of America
ⓘ
surface form:
United States
|
| field |
algorithms
ⓘ
combinatorics ⓘ computational complexity theory ⓘ computational geometry ⓘ computer science ⓘ cryptography ⓘ distributed computing ⓘ game theory ⓘ quantum computing ⓘ theoretical computer science ⓘ |
| frequency | annual ⓘ |
| hasFormat |
conference presentations
ⓘ
invited talks ⓘ plenary talks ⓘ proceedings publication ⓘ tutorials ⓘ workshops ⓘ |
| hasProceedingsPublisher | Association for Computing Machinery ⓘ |
| hasProceedingsSeries |
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
ⓘ
surface form:
Proceedings of the ACM Symposium on Theory of Computing
|
| hasSisterConference |
FOCS
ⓘ
surface form:
IEEE Symposium on Foundations of Computer Science
|
| inception | 1969 ⓘ |
| isConsidered |
flagship conference in theoretical computer science
ⓘ
top-tier theory of computing conference ⓘ |
| language | English ⓘ |
| organizer |
SIGACT
ⓘ
surface form:
ACM Special Interest Group on Algorithms and Computation Theory
Association for Computing Machinery ⓘ |
| organizerAbbreviation |
SIGACT
ⓘ
surface form:
ACM SIGACT
|
| peerReviewed | true ⓘ |
| reviewProcess | single-blind ⓘ |
| sisterConferenceAbbreviation | FOCS ⓘ |
| topic |
algorithmic game theory
ⓘ
approximation algorithms ⓘ coding theory ⓘ communication complexity ⓘ complexity classes ⓘ computational learning theory ⓘ computational models ⓘ data structures ⓘ derandomization ⓘ hardness of approximation ⓘ online algorithms ⓘ pseudorandomness ⓘ quantum complexity theory ⓘ |
| typicalMonthHeld | June ⓘ |
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: ACM Symposium on Theory of Computing Description of subject: The ACM Symposium on Theory of Computing (STOC) is a premier annual research conference in theoretical computer science, featuring groundbreaking work in algorithms, complexity theory, cryptography, and related areas.
Referenced by (14)
Full triples — surface form annotated when it differs from this entity's canonical label.