SODA
2010
ACM
13 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 ...