Skip to search formSkip to main contentSkip to account menu

SIAM Journal on Computing

Known as: SIAM J. on Computing, SIAM J. Comput., SIAM J. Computing 
The SIAM Journal on Computing (SICOMP) is a scientific journal focusing on the mathematical and formal aspects of computer science. It is published… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ACC0Aanderaa–Karp–Rosenberg conjectureAngular resolution (graph drawing)Anna Karlin

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The query complexity of graph isomorphism: bypassing distribution testing lower bounds
We study the query complexity of graph isomorphism in the property testing model for dense graphs. We give an algorithm that… 
2016
2016
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
2014
2014
Processing and properties of new polyimide composites with high temperature ability
The communication present results from work on development and evaluation of new polymeric carbon fiber composites with extreme… 
2012
2012
Optimal Hitting Sets for Combinatorial Shapes
We consider the problem of constructing explicit Hitting sets for Combinatorial Shapes, a class of statistical tests first… 
2010
2010
Data Structures for Storing Small Sets in the Bitprobe Model
We study the following set membership problem in the bit probe model: given a set S from a finite universe U, represent it in… 
2008
2008
An Analysis of the Vector Decomposition Problem
The vector decomposition problem (VDP) has been proposed as a computational problem on which to base the security of public key… 
Highly Cited
2004
Highly Cited
2004
Better Privacy for Trusted Computing Platforms: (Extended Abstract)
The trusted computing group (TCG) specified two protocols that allow a trusted hardware device to remotely convince a… 
2003
2003
On the Definition of Functional Dependencies in XML
Recently, two different approaches have been proposed for defining functional dependencies in XML (XFDs). The first is based on… 
1999
1999
Infeasibility and negative curvature in optimization
We consider the constrained nonlinear optimization problem where the feasible set is possibly empty, in which case no solution… 
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly… 
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)