Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Acar, U.A., Blelloch, G.E., Harper, R., Vittes, J.L., Woo, S.L.M.: Dynamizing static algorithms, with applications to dynamic trees and history independence. In: 15th annual ACM-SIAM Symposium on Discrete Algorithms, pp. 531–540 (2004)
2. Andersson, A., Ottmann, T.: New tight bounds on uniquely represented dictionaries. SIAM Journal of Computing 24(5), 1091–1103 (1995)
3. Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indices. Acta Informatica 1, 173–189 (1972)
4. Blelloch, G.E., Golovin, D.: Strongly history-independent hashing with applications. In: 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 272–282 (2007)
5. Lecture Notes in Computer Science;G.E. Blelloch,2008
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures;Proceedings of the ACM on Management of Data;2024-05-10
2. Online List Labeling: Breaking the log2n Barrier;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
3. eHIFS;Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security;2019-07-02
4. Auditable Data Structures;2017 IEEE European Symposium on Security and Privacy (EuroS&P);2017-04
5. Anti-Persistence on Persistent Storage;Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2016-06-15