The Journal of the ACM is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects. It is an officialâ€¦Â (More)

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

Highly Cited

2013

Highly Cited

2013

- Elette Boyle, Kai-Min Chung, Rafael Pass
- TCC
- 2013

We initiate the study of extractability obfuscation, a notion first suggested by Barak et al. (JACM 2012): An extractabilityâ€¦Â (More)

Is this relevant?

2012

2012

- Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
- SODA
- 2012

Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hardâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Daniel M. Kane, Jelani Nelson, David P. Woodruff
- SODA
- 2010

We settle the 1-pass space complexity of (1 Â± Îµ)-approximating the <i>L</i><sub><i>p</i></sub> norm, for real <i>p</i> with 1â€¦Â (More)

Is this relevant?

2009

2009

- Saurav Pandit, Sriram V. Pemmaraju
- PODC
- 2009

In this paper we present fast, distributed approximation algorithms for the <i>metric facility location</i> problem in the <iâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Omer Reingold
- J. ACM
- 2008

We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the spaceâ€¦Â (More)

Is this relevant?

2007

2007

- Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
- Public Key Cryptography
- 2007

We propose multi-bit versions of several single-bit cryptosystems based on lattice problems, the error-free version of the Ajtaiâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
- Twenty-Second Annual IEEE Conference onâ€¦
- 2007

Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing techniqueâ€¦Â (More)

Is this relevant?

2003

2003

- Franz L. Alt
- J. ACM
- 2003

The year was 1953. The Association for Computing Machinery was six years old. It had fewer than 1200 members; the annualâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Maurice Herlihy, Nir Shavit
- J. ACM
- 1999

We give necessary and sufficient combinatorial conditions characterizing the class of decision tasks that can be solved in a waitâ€¦Â (More)

Is this relevant?

1972

1972

- Richard I. Shrager
- Commun. ACM
- 1972

A quadratic programming algorithm is described for use with the magnified diagonal method of nonlinear regression with linearâ€¦Â (More)

Is this relevant?