Symposium on Theory of Computing

Known as: STOC, Danny Lewin Best Student Paper Award, Symposium on the Theory of Computing 
STOC, the Annual ACM Symposium on Theory of Computing is an academic conference in the field of theoretical computer science. STOC has been organized… (More)
Wikipedia

Related topics

Related topics

50 relations
ACC0ACM Computing SurveysAanderaa–Karp–Rosenberg conjectureAverage-case complexity
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)
The edit distance (a.k.a. the Levenshtein distance) between two strings is defined as the minimum number of insertions, deletions… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Implementing Gentry's Fully-Homomorphic Encryption Scheme
We describe a working implementation of a variant of Gentry’s fully homomorphic encryption scheme (STOC 2009), similar to the… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification
  • Hoeteck Wee
  • IEEE 51st Annual Symposium on Foundations of…
  • 2010
We present round-efficient protocols for secure multi-party computation with a dishonest majority that rely on black-box access… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Linking Data to Ontologies
Many organizations nowadays face the problem of accessing existing data sources by means of flexible mechanisms that are both… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Asynchronous secure computation
We initiate a study of security in asynchronous networks. We consider a com­ pletely asynchronous network where every two parties… (More)
  • figure 1
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Relational Queries Computable in Polynomial Time
We characterize the polynomial time computable queries as those ex pressible in relational calculus plus a least xed point… (More)
Is this relevant?
Highly Cited
1975
Highly Cited
1975
A Theory of Program Size Formally Identical to Information Theory
Hopefully members enjoyed the "dividend" mailing of the Proceedings of the Symposium on Theory of Computing. Since it went to all… (More)
Is this relevant?
1973
1973
Special SIGACT issueFourth Annual ACM Symposium on Theory of Computing
The papers in this issue are based on working papers presented at the Sixth Annual ACM Symposium on Theory of Computing, which… (More)
Is this relevant?