Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Unique binary search tree representations and equality-testing of sets and sequences
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Fractional cascading revisited
Journal of Algorithms
New Tight Bounds on Uniquely Represented Dictionaries
SIAM Journal on Computing
Oblivious data structures: applications to cryptography
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Anti-presistence: history independent data structures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Skip Lists: A Probabilistic Alternative to Balanced Trees
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Fully Persistent Arrays (Extended Array)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Dynamizing static algorithms, with applications to dynamic trees and history independence
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Fully Dynamic Orthogonal Range Reporting on RAM
SIAM Journal on Computing
Linear probing with constant independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Strongly History-Independent Hashing with Applications
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On uniquely represented data strauctures
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
B-Treaps: A Uniquely Represented Alternative to B-Trees
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
History-independence: a fresh look at the case of R-trees
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
We present new techniques for the construction of uniquely represented data structures in a RAM, and use them to construct efficient uniquely represented data structures for orthogonal range queries, line intersection tests, point location, and 2-D dynamic convex hull. Uniquely represented data structures represent each logical state with a unique machine state. Such data structures are strongly history-independent. This eliminates the possibility of privacy violations caused by the leakage of information about the historical use of the data structure. Uniquely represented data structures may also simplify the debugging of complex parallel computations, by ensuring that two runs of a program that reach the same logical state reach the same physical state, even if various parallel processes executed in different orders during the two runs.