Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,321 papers from all fields of science
Search
Sign In
Create Free Account
SIAM Journal on Computing
Known as:
SIAM J. on Computing
, SIAM J. Comput.
, SIAM J. Computing
Expand
The SIAM Journal on Computing (SICOMP) is a scientific journal focusing on the mathematical and formal aspects of computer science. It is published…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ACC0
Aanderaa–Karp–Rosenberg conjecture
Angular resolution (graph drawing)
Anna Karlin
Expand
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
Krzysztof Onak
,
Xiaorui Sun
Symposium on the Theory of Computing
2018
Corpus ID: 49337434
We study the query complexity of graph isomorphism in the property testing model for dense graphs. We give an algorithm that…
Expand
2016
2016
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
George Giakkoupis
ACM SIGACT-SIGOPS Symposium on Principles of…
2016
Corpus ID: 23864338
2014
2014
Processing and properties of new polyimide composites with high temperature ability
P. Fernberg
,
G. Gong
,
Peter Mannberg
2014
Corpus ID: 136541928
The communication present results from work on development and evaluation of new polymeric carbon fiber composites with extreme…
Expand
2012
2012
Optimal Hitting Sets for Combinatorial Shapes
Aditya Bhaskara
,
Devendra Desai
,
S. Srinivasan
Theory of Computing
2012
Corpus ID: 5860959
We consider the problem of constructing explicit Hitting sets for Combinatorial Shapes, a class of statistical tests first…
Expand
2010
2010
Data Structures for Storing Small Sets in the Bitprobe Model
J. Radhakrishnan
,
Smit Shah
,
Saswata Shannigrahi
Embedded Systems and Applications
2010
Corpus ID: 39009118
We study the following set membership problem in the bit probe model: given a set S from a finite universe U, represent it in…
Expand
2008
2008
An Analysis of the Vector Decomposition Problem
S. Galbraith
,
E. Verheul
International Conference on Theory and Practice…
2008
Corpus ID: 714288
The vector decomposition problem (VDP) has been proposed as a computational problem on which to base the security of public key…
Expand
Highly Cited
2004
Highly Cited
2004
Better Privacy for Trusted Computing Platforms: (Extended Abstract)
J. Camenisch
European Symposium on Research in Computer…
2004
Corpus ID: 15701256
The trusted computing group (TCG) specified two protocols that allow a trusted hardware device to remotely convince a…
Expand
2003
2003
On the Definition of Functional Dependencies in XML
M. Vincent
2003
Corpus ID: 15518647
Recently, two different approaches have been proposed for defining functional dependencies in XML (XFDs). The first is based on…
Expand
1999
1999
Infeasibility and negative curvature in optimization
W. Murray
,
E. Boman
1999
Corpus ID: 119564105
We consider the constrained nonlinear optimization problem where the feasible set is possibly empty, in which case no solution…
Expand
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Robert H. B. Netzer
International Workshop on Languages and Compilers…
1993
Corpus ID: 10717466
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly…
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