# Journal of Computer and System Sciences

## Papers overview

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

2012

2012

- SODA
- 2012

We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- ACM Multimedia
- 2009

An efficient indexing method is essential for content-based image retrieval with the exponential growth in large-scale videos and… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- ESORICS
- 2009

We put forward a novel paradigm for preserving privacy in data outsourcing which departs from encryption. The basic idea behind… (More)

Is this relevant?

2009

2009

- 24th Annual IEEE Conference on Computational…
- 2009

This paper presents three results on the power of two-prover one-round interactive proof systems based on oracularization under… (More)

Is this relevant?

2008

2008

- Loughborough Antennas and Propagation Conference
- 2008

This work studies dual-band EBG structures used as an artificial magnetic conductor (AMC) ground plane for WLAN co-planar antenna… (More)

Is this relevant?

2007

2007

- Workshop on Membrane Computing
- 2007

Starting from an extended nondeterministic spiking neural P system that solves the Subset Sum problem in a constant number of… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- EMNLP
- 1999

This paper discusses the use of unlabeled examples for the problem of named entity classification. A large number of rules is… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- CRYPTO
- 1996

Consider a situation in which the transmission of an encrypted message can be intercepted by an authority, and subsequently (say… (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- 28th Annual Symposium on Foundations of Computer…
- 1987

This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing. Verifiable secret sharing… (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- Acta Informatica
- 1982

In the course of a concurrent computation, processes P1,..., Pn must reach a common choice of one out of k alternatives A 1… (More)

Is this relevant?