Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We describe a working implementation of a variant of Gentry's fully homomorphic encryption scheme (STOC 2009), similar to the… Expand
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We construct public-key cryptosystems that are secure assuming theworst-case hardness of approximating the minimum distance on n… Expand
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space… Expand
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The Cooperative File System (CFS) is a new peer-to-peer read-only storage system that provides provable guarantees for the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
OceanStore is a utility infrastructure designed to span the globe and provide continuous access to persistent information. Since… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Molecular self-assembly gives rise to a great diversity of complex forms, from crystals and DNA helices to microtubules and… Expand
  • figure 1
  • figure 8
Is this relevant?
Highly Cited
1987
Highly Cited
1987
  • P. Feldman
  • 28th Annual Symposium on Foundations of Computer…
  • 1987
  • Corpus ID: 16283693
This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing. Verifiable secret sharing… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
We argue that the right way to understand distributed protocols is by considering how messages change the state of knowledge of a… Expand
Is this relevant?
Highly Cited
1975
Highly Cited
1975
A new definition of program-size complexity is made. H(A,B/C,D) is defined to be the size in bits of the shortest self-delimiting… Expand
  • figure 1
  • figure 2
Is this relevant?