Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,307 papers from all fields of science
Search
Sign In
Create Free Account
Symposium on Theory of Computing
Known as:
STOC
, Danny Lewin Best Student Paper Award
, Symposium on the Theory of Computing
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ACC0
ACM Computing Surveys
Aanderaa–Karp–Rosenberg conjecture
Average-case complexity
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Linear-Time Recognition of Map Graphs with Outerplanar Witness
Matthias Mnich
,
Ignaz Rutter
,
Jens M. Schmidt
Scandinavian Workshop on Algorithm Theory
2016
Corpus ID: 18355705
Map graphs generalize planar graphs and were introduced by Chen, Grigni and Papadimitriou [STOC 1998, J.ACM 2002]. They showed…
Expand
2016
2016
Structural sparseness and complex networks
F. Reidl
2016
Corpus ID: 39368113
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational…
Expand
2011
2011
Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth
Johannes Schneider
,
Roger Wattenhofer
Colloquium on Structural Information…
2011
Corpus ID: 7457161
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…
Expand
2010
2010
Compact ancestry labeling schemes for XML trees
P. Fraigniaud
,
Amos Korman
ACM-SIAM Symposium on Discrete Algorithms
2010
Corpus ID: 2927194
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be…
Expand
2008
2008
Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption
Alon Rosen
,
Gil Segev
IACR Cryptology ePrint Archive
2008
Corpus ID: 6780286
Lossy trapdoor functions (Peikert and Waters, STOC ’08) are an intriguing and powerful cryptographic primitive. Their main…
Expand
Review
2005
Review
2005
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hal Gabow
,
Ronald Fagin
Symposium on the Theory of Computing
2005
Corpus ID: 264785564
The papers in this volume were presented at the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2005), held in…
Expand
Review
2004
Review
2004
The application of prediction markets to business
J. Schrieber
2004
Corpus ID: 46352156
According to financial theory, open markets efficiently and effectively aggregate all available information about future events…
Expand
Highly Cited
2001
Highly Cited
2001
The standard SpecC language
M. Fujita
,
Hiroshi Nakamura
International Symposium on System Synthesis (IEEE…
2001
Corpus ID: 12997961
The paper introduces SpecC language, a system level description language based on C, and its consortium, SpecC Technology Open…
Expand
1996
1996
Acm Symposium on Theory of Computing (stoc 96) Sparsity Considerations in Dixon Resultants
D. Kapur
,
T. Saxena
1996
Corpus ID: 5264757
New results relating the sparsity of nonhomogeneous polynomial systems and computation of their projection operator (a non…
Expand
1994
1994
Contention in counting networks
C. Busch
,
Nikolaos Hardavellas
,
M. Mavronicolas
ACM SIGACT-SIGOPS Symposium on Principles of…
1994
Corpus ID: 2261758
Implementing counting networks [2] on shared-memory multi-processor machines often incurs a performance penalty proportional to…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required