Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Map graphs generalize planar graphs and were introduced by Chen, Grigni and Papadimitriou [STOC 1998, J.ACM 2002]. They showed… 
2016
2016
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational… 
2011
2011
We deterministically compute a Δ + 1 coloring in time O(Δ5c+2 ċ (Δ5)2/c/(Δ1)e + (Δ1)e + log* n) and O(Δ5c+2 ċ (Δ5)1/c/Δe + Δe… 
2010
2010
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be… 
2008
2008
Lossy trapdoor functions (Peikert and Waters, STOC ’08) are an intriguing and powerful cryptographic primitive. Their main… 
Review
2005
Review
2005
The papers in this volume were presented at the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2005), held in… 
Review
2004
Review
2004
According to financial theory, open markets efficiently and effectively aggregate all available information about future events… 
Highly Cited
2001
Highly Cited
2001
The paper introduces SpecC language, a system level description language based on C, and its consortium, SpecC Technology Open… 
1996
1996
New results relating the sparsity of nonhomogeneous polynomial systems and computation of their projection operator (a non… 
1994
1994
Implementing counting networks [2] on shared-memory multi-processor machines often incurs a performance penalty proportional to…