History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures
Abstract
References
Index Terms
- History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures
Recommendations
Characterizing History Independent Data Structures
We consider history independent data structures as proposed for study by Naor and Teague. In a history independent data structure, nothing can be learned from the memory representation of the data structure except for what is available from the ...
A data structure for multi-dimensional range reporting
SCG '07: Proceedings of the twenty-third annual symposium on Computational geometryWe present a static data structure for orthogonal range reporting on a U x U x U integer grid. Our data structure supports orthogonal range reporting queries in O((log log n)2 + log log U + k) time and uses O(n log4 n) space, where k is the size of the ...
Towards optimal range medians
We consider the following problem: Given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the intervals. We describe a simple algorithm which needs O(nlogk+klogn) time to ...
Comments
Information & Contributors
Information
Published In

Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Author Tags
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 167Total Downloads
- Downloads (Last 12 months)167
- Downloads (Last 6 weeks)17
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in