Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 211,143,774 papers from all fields of science

Search

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

2018

2018

We consider the problem of encoding a string of length n from an integer alphabet of size σ so access, substring equality, and…

Review

2013

Review

2013

This survey summarizes several results about quantum computing related to (mostly static) data structures. First, we describe…

Review

2013

Review

2013

This survey summarizes several results about quantum computing related to (mostly static) data structures. First, we describe…

2012

2012

In this paper we investigate the problem of building a static data structure that represents a string s using space close to its…

2010

2010

We study the nondeterministic cell-probe complexity of static data structures. We introduce <i>cell-probe proofs</i> (CPP), a…

2008

2008

We study the nondeterministic cell-probe complexity of static data structures. We introduce cell-probe proofs (CPP), a proof…

Highly Cited

2005

Highly Cited

2005

We develop a new technique for proving cell-probe lower bounds on dynamic data structures. This technique enables us to prove an…

2003

2003

Given a database of n points in (0,1)d, the partial match problem is: In response to a query x in (0, 1, *)d, find a database…