Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • Attiya H, Bender M, Farach-Colton M, Oshman R and Schiller N. History-Independent Concurrent Objects. Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing. (14-24).

    https://doi.org/10.1145/3662158.3662814

  • Bender M, Farach-Colton M, Goodrich M and Komlós H. (2024). History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures. Proceedings of the ACM on Management of Data. 2:2. (1-27). Online publication date: 10-May-2024.

    https://doi.org/10.1145/3651609

  • Gao B, Jia S, Yin P and Zhang X. Protection of Access Pattern. Proceedings of the 2023 7th International Conference on Computer Science and Artificial Intelligence. (99-105).

    https://doi.org/10.1145/3638584.3638585

  • Cohen A, Smith A, Swanberg M and Vasudevan P. Control, Confidentiality, and the Right to be Forgotten. Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security. (3358-3372).

    https://doi.org/10.1145/3576915.3616585

  • Gao B, Chen B, Jia S and Xia L. eHIFS. Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security. (573-585).

    https://doi.org/10.1145/3321705.3329839

  • Shun J and Blelloch G. Phase-concurrent hash tables for determinism. Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures. (96-107).

    https://doi.org/10.1145/2612669.2612687

  • Bajaj S and Sion R. HIFS. Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security. (1285-1296).

    https://doi.org/10.1145/2508859.2516724

  • Stewart G, Banerjee A and Nanevski A. Dependent types for enforcement of information flow and erasure policies in heterogeneous data structures. Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming. (145-156).

    https://doi.org/10.1145/2505879.2505895

  • Blelloch G, Fineman J, Gibbons P and Shun J. (2012). Internally deterministic parallel algorithms can be fast. ACM SIGPLAN Notices. 47:8. (181-192). Online publication date: 11-Sep-2012.

    https://doi.org/10.1145/2370036.2145840

  • Tzouramanis T. History-independence. Proceedings of the 27th Annual ACM Symposium on Applied Computing. (7-12).

    https://doi.org/10.1145/2245276.2245279

  • Blelloch G, Fineman J, Gibbons P and Shun J. Internally deterministic parallel algorithms can be fast. Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming. (181-192).

    https://doi.org/10.1145/2145816.2145840

  • Naor M, Segev G and Wieder U. History-Independent Cuckoo Hashing. Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II. (631-642).

    https://doi.org/10.1007/978-3-540-70583-3_51

  • Blelloch G, Golovin D and Vassilevska V. Uniquely Represented Data Structures for Computational Geometry. Proceedings of the 11th Scandinavian workshop on Algorithm Theory. (17-28).

    https://doi.org/10.1007/978-3-540-69903-3_4