149 search results - page 4 / 30 » Uniform hashing in constant time and linear space |
SODA
1998
ACM
14 years 11 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
TCAD
1998
14 years 9 months ago
1998
— Conventional methods for optimal sizing of wires and transistors use linear resistor-capacitor (RC) circuit models and the Elmore delay as a measure of signal delay. If the RC ...
169
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
TSP
2012
13 years 5 months ago
2012
This article presents a randomized linear-dispersion space-time block code for decode-andforward synchronous relays. The coding matrices are obtained as a set of columns (or rows)...
99
Voted
CCS
2008
ACM
14 years 11 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...