806 search results - page 16 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
92
Voted
IPL
2007
14 years 11 months ago
2007
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
156
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
101
click to vote
FOCS
1992
IEEE
15 years 3 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
SODA
2010
ACM
14 years 10 months ago
2010
ACM
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
118
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...