The SIAM Journal on Computing (SICOMP) is a scientific journal focusing on the mathematical and formal aspects of computer science. It is publishedâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

- 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

- 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

- 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

- 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

- 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

- 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

- 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

We study the computational complexity of languages which have interactive proofs of logarithmic knowledge-complexity. We showâ€¦Â (More)

Is this relevant?

Highly Cited

1984

1974

1974

- 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?