All Fields
Computer Science
Medicine
FAQ
Contact
Sign in
SIAM Journal on Computing
Known as:
SIAM J. on Computing
, SIAM J. Comput.
, SIAM J. Computing
Â
(More)
The SIAM Journal on Computing (SICOMP) is a scientific journal focusing on the mathematical and formal aspects of computer science. It is published…Â
(More)
Wikipedia
Topic mentions per year
Topic mentions per year
1974-2017
0
10
20
30
1974
2017
Related topics
Related topics
50 relations
Aanderaa–Karp–Rosenberg conjecture
Anna Lubiw
Cartesian tree
Claw-free graph
(More)
Related mentions per year
Related mentions per year
1936-2018
1960
1980
2000
2020
SIAM Journal on Computing
Computer science
NP-completeness
Graph isomorphism problem
Graph coloring
Consensus
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Distributed approximation algorithms for weighted shortest paths
Danupon Nanongkai
STOC
2014
A distributed network is modeled by a graph having <i>n</i> nodes (processors) and diameter <i>D</i>. We study the time…Â
(More)
Is this relevant?
2013
2013
Local Reductions
Hamidreza Jahanjou
,
Eric Miles
,
Emanuele Viola
ICALP
2013
We reduce non-deterministic time T ≥ 2n to a 3SAT instance φ of size |φ| = T · log T such that there is an explicit circuit C…Â
(More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Pseudorandom Bits for Polynomials
Andrej Bogdanov
,
Emanuele Viola
48th Annual IEEE Symposium on Foundations of…
2007
We present a new approach to constructing pseudorandom generators that fool low-degree polynomials over finite fields, based on…Â
(More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time
Timothy M. Chan
Algorithmica
2005
We describe an O(n 3/log n)-time algorithm for the all-pairs-shortest-paths problem for a real-weighted directed graph with n…Â
(More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
On Worst-Case to Average-Case Reductions for NP Problems
Andrej Bogdanov
,
Luca Trevisan
FOCS
2003
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is…Â
(More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Lower Bounds for Non-Black-Box Zero Knowledge
Boaz Barak
,
Yehuda Lindell
,
Salil P. Vadhan
FOCS
2003
We show new lower bounds and impossibility results for general (possibly non-black-box ) zero-knowledge proofs and arguments. Our…Â
(More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Universal Arguments and their Applications
Boaz Barak
,
Oded Goldreich
IEEE Conference on Computational Complexity
2001
We put forward a new type of computationally-sound proof systems, called universal-arguments. Universal-arguments are related but…Â
(More)
Is this relevant?
1998
1998
Appeared I N Siam Journal on Computing Computational Complexity and Knowledge Complexity Appeared I N Siam Journal on Computing
Oded Goldreich
,
Rafail Ostrovsky
,
Erez Petrank
1998
We study the computational complexity of languages which have interactive proofs of logarithmic knowledge-complexity. We show…Â
(More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Robert E. Tarjan
,
Mihalis Yannakakis
SIAM J. Comput.
1984
Â
Is this relevant?
1974
1974
Special issue on semantics and program schemas SIAM journal on computing
Robert Constable
,
David Park
SIGA
1974
The SIAM Journal on Computing is planning a Spring 1976 special issue on the topics of programming language modeling…Â
(More)
Is this relevant?