{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:43:54Z","timestamp":1787017434956,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF-2008241, 1601879, 2128519"],"award-info":[{"award-number":["CCF-2008241, 1601879, 2128519"]}]},{"name":"Packard Fellowship"},{"name":"ONR","award":["YIP"],"award-info":[{"award-number":["YIP"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461783","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T19:07:02Z","timestamp":1625080022000},"page":"373-384","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Data Oblivious Algorithms for Multicores"],"prefix":"10.1145","author":[{"given":"Vijaya","family":"Ramachandran","sequence":"first","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)","author":"Acar Umut A.","unstructured":"Umut A. Acar , Guy E. Blelloch , and Robert D. Blumofe . 2000. The Data Locality of Work Stealing . In Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA) ( Bar Harbor, Maine, USA). Association for Computing Machinery, 1--12. Umut A. Acar, Guy E. Blelloch, and Robert D. Blumofe. 2000. The Data Locality of Work Stealing. In Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA) (Bar Harbor, Maine, USA). Association for Computing Machinery, 1--12."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"M. Ajtai J. Koml\u00f3s and E. Szemer\u00e9di. 1983. An O(N Log N) Sorting Network. In STOC .  M. Ajtai J. Koml\u00f3s and E. Szemer\u00e9di. 1983. An O(N Log N) Sorting Network. In STOC .","DOI":"10.1145\/800061.808726"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)","author":"Arora Nimar S.","unstructured":"Nimar S. Arora , Robert D. Blumofe , and C. Greg Plaxton . 1998. Thread Scheduling for Multiprogrammed Multiprocessors . In Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA) ( Puerto Vallarta, Mexico). Association for Computing Machinery, New York, NY, USA, 119--129. Nimar S. Arora, Robert D. Blumofe, and C. Greg Plaxton. 1998. Thread Scheduling for Multiprogrammed Multiprocessors. In Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA) (Puerto Vallarta, Mexico). Association for Computing Machinery, New York, NY, USA, 119--129."},{"key":"e_1_3_2_1_4_1","volume-title":"Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. In 3rd Symposium on Simplicity in Algorithms, SOSA@SODA, Martin Farach-Colton and Inge Li G\u00f8rtz (Eds.). SIAM, 8--14","author":"Asharov Gilad","year":"2020","unstructured":"Gilad Asharov , T.-H. Hubert Chan , Kartik Nayak , Rafael Pass , Ling Ren , and Elaine Shi . 2020 a . Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. In 3rd Symposium on Simplicity in Algorithms, SOSA@SODA, Martin Farach-Colton and Inge Li G\u00f8rtz (Eds.). SIAM, 8--14 . Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2020 a. Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. In 3rd Symposium on Simplicity in Algorithms, SOSA@SODA, Martin Farach-Colton and Inge Li G\u00f8rtz (Eds.). SIAM, 8--14."},{"key":"e_1_3_2_1_5_1","unstructured":"Gilad Asharov Ilan Komargodski Wei-Kai Lin Enoch Peserico and Elaine Shi. 2020 b. Oblivious Parallel Tight Compaction. In Information-Theoretic Cryptography (ITC) .  Gilad Asharov Ilan Komargodski Wei-Kai Lin Enoch Peserico and Elaine Shi. 2020 b. Oblivious Parallel Tight Compaction. In Information-Theoretic Cryptography (ITC) ."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Ilan Komargodski Wei-Kai Lin Enoch Peserico and Elaine Shi. 2020 c. Optimal Oblivious Parallel RAM . Manuscript in preparation. Personal communication with Asharov et al.  Gilad Asharov Ilan Komargodski Wei-Kai Lin Enoch Peserico and Elaine Shi. 2020 c. Optimal Oblivious Parallel RAM . Manuscript in preparation. Personal communication with Asharov et al.","DOI":"10.1007\/978-3-030-45724-2_14"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Marina Blanton Aaron Steele and Mehrdad Alisagari. 2013. Data-oblivious Graph Algorithms for Secure Computation and Outsourcing. In ASIA CCS .  Marina Blanton Aaron Steele and Mehrdad Alisagari. 2013. Data-oblivious Graph Algorithms for Secure Computation and Outsourcing. In ASIA CCS .","DOI":"10.1145\/2484313.2484341"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347137"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989553"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":"Guy","unstructured":"Guy E. Blelloch and Phillip B. Gibbons. 2004. Effectively Sharing a Cache among Threads . In Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) ( Barcelona, Spain). Association for Computing Machinery, New York, NY, USA, 235--244. https:\/\/doi.org\/10.1145\/1007912.1007948 10.1145\/1007912.1007948 Guy E. Blelloch and Phillip B. Gibbons. 2004. Effectively Sharing a Cache among Threads. In Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (Barcelona, Spain). Association for Computing Machinery, New York, NY, USA, 235--244. https:\/\/doi.org\/10.1145\/1007912.1007948"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/301970.301974"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810519"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC)","author":"Robert","unstructured":"Robert D. Blumofe and Charles E. Leiserson. 1993. Space-Efficient Scheduling of Multithreaded Computations . In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC) ( San Diego, California, USA). Association for Computing Machinery, New York, NY, USA, 362--371. Robert D. Blumofe and Charles E. Leiserson. 1993. Space-Efficient Scheduling of Multithreaded Computations. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC) (San Diego, California, USA). Association for Computing Machinery, New York, NY, USA, 362--371."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_15_1","volume-title":"Oblivious Parallel RAM. In Theory of Cryptography Conference (TCC) .","author":"Boyle Elette","year":"2015","unstructured":"Elette Boyle , Kai-Min Chung , and Rafael Pass . 2015 . Oblivious Parallel RAM. In Theory of Cryptography Conference (TCC) . Elette Boyle, Kai-Min Chung, and Rafael Pass. 2015. Oblivious Parallel RAM. In Theory of Cryptography Conference (TCC) ."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2048147.2048198"},{"key":"e_1_3_2_1_17_1","volume-title":"Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. In Theory of Cryptography Conference, (TCC) .","author":"Hubert Chan T.-H.","year":"2017","unstructured":"T.-H. Hubert Chan and Elaine Shi . 2017 . Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. In Theory of Cryptography Conference, (TCC) . T.-H. Hubert Chan and Elaine Shi. 2017. Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. In Theory of Cryptography Conference, (TCC) ."},{"key":"e_1_3_2_1_18_1","volume-title":"Advances in Cryptology -- ASIACRYPT 2017","author":"Hubert Chan T.-H.","unstructured":"T.-H. Hubert Chan , Kai-Min Chung , and Elaine Shi . 2017. On the Depth of Oblivious Parallel RAM . In Advances in Cryptology -- ASIACRYPT 2017 . Springer International Publishing , 567--597. T.-H. Hubert Chan, Kai-Min Chung, and Elaine Shi. 2017. On the Depth of Oblivious Parallel RAM. In Advances in Cryptology -- ASIACRYPT 2017 . Springer International Publishing, 567--597."},{"key":"e_1_3_2_1_19_1","unstructured":"T-H. Hubert Chan Yue Guo Wei-Kai Lin and Elaine Shi. 2018. Cache-Oblivious and Data-Oblivious Sorting and Applications. In SODA .  T-H. Hubert Chan Yue Guo Wei-Kai Lin and Elaine Shi. 2018. Cache-Oblivious and Data-Oblivious Sorting and Applications. In SODA ."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094852"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/313651.313681"},{"key":"e_1_3_2_1_22_1","volume-title":"Chowdhury and Vijaya Ramachandran","author":"Rezaul","year":"2008","unstructured":"Rezaul A. Chowdhury and Vijaya Ramachandran . 2008 . Cache-efficient dynamic programming algorithms for multicores. In Proc. ACM SPAA. Rezaul A. Chowdhury and Vijaya Ramachandran. 2008. Cache-efficient dynamic programming algorithms for multicores. In Proc. ACM SPAA."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9273-8"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.04.008"},{"key":"e_1_3_2_1_25_1","volume-title":"37th International Colloquium, ICALP 2010, Bordeaux, France, July 6--10, 2010, Proceedings, Part I (Lecture Notes in Computer Science","volume":"237","author":"Cole Richard","year":"2010","unstructured":"Richard Cole and Vijaya Ramachandran . 2010 . Resource Oblivious Sorting on Multicores. In Automata, Languages and Programming , 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6--10, 2010, Proceedings, Part I (Lecture Notes in Computer Science , Vol. 6198), , Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis (Eds.). Springer, 226-- 237 . Richard Cole and Vijaya Ramachandran. 2010. Resource Oblivious Sorting on Multicores. In Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6--10, 2010, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 6198), , Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis (Eds.). Springer, 226--237."},{"key":"e_1_3_2_1_26_1","volume-title":"Efficient Resource Oblivious Algorithms for Multicores with False Sharing. In 26th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2012","author":"Cole Richard","year":"2012","unstructured":"Richard Cole and Vijaya Ramachandran . 2012 a. Efficient Resource Oblivious Algorithms for Multicores with False Sharing. In 26th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2012 , Shanghai, China, May 21--25 , 2012. IEEE Computer Society, 201--214. Richard Cole and Vijaya Ramachandran. 2012a. Efficient Resource Oblivious Algorithms for Multicores with False Sharing. In 26th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2012, Shanghai, China, May 21--25, 2012. IEEE Computer Society, 201--214."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29344-3_15"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.86"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087572"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3040221"},{"key":"e_1_3_2_1_31_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms , Third Edition 3 rd ed.). The MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, Third Edition 3rd ed.). The MIT Press.","edition":"3"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation (PLDI) (Montreal","author":"Frigo Matteo","unstructured":"Matteo Frigo , Charles E. Leiserson , and Keith H. Randall . 1998. The Implementation of the Cilk-5 Multithreaded Language . In Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation (PLDI) (Montreal , Quebec, Canada). Association for Computing Machinery, New York, NY, USA, 212--223. https:\/\/doi.org\/10.1145\/277650.277725 10.1145\/277650.277725 Matteo Frigo, Charles E. Leiserson, and Keith H. Randall. 1998. The Implementation of the Cilk-5 Multithreaded Language. In Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation (PLDI) (Montreal, Quebec, Canada). Association for Computing Machinery, New York, NY, USA, 212--223. https:\/\/doi.org\/10.1145\/277650.277725"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9098-2"},{"key":"e_1_3_2_1_35_1","unstructured":"Github. [n.d.]. https:\/\/github.com\/oneapi-src\/oneTBB .  Github. [n.d.]. https:\/\/github.com\/oneapi-src\/oneTBB ."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"O. Goldreich. 1987. Towards a theory of software protection and simulation by oblivious RAMs. In STOC .  O. Goldreich. 1987. Towards a theory of software protection and simulation by oblivious RAMs. In STOC .","DOI":"10.1145\/28395.28416"},{"key":"e_1_3_2_1_37_1","volume-title":"Software protection and simulation on oblivious RAMs. J. ACM","author":"Goldreich Oded","year":"1996","unstructured":"Oded Goldreich and Rafail Ostrovsky . 1996. Software protection and simulation on oblivious RAMs. J. ACM ( 1996 ). Oded Goldreich and Rafail Ostrovsky. 1996. Software protection and simulation on oblivious RAMs. J. ACM (1996)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591830"},{"key":"e_1_3_2_1_39_1","volume-title":"Graph Drawing ,","author":"Goodrich Michael T.","unstructured":"Michael T. Goodrich , Olga Ohrimenko , and Roberto Tamassia . 2013. Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage . In Graph Drawing , , Walter Didimo and Maurizio Patrignani (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 43--54. Michael T. Goodrich, Olga Ohrimenko, and Roberto Tamassia. 2013. Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage. In Graph Drawing , , Walter Didimo and Maurizio Patrignani (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 43--54."},{"key":"e_1_3_2_1_40_1","volume-title":"COCOA 2014, Wailea, Maui, HI, USA, December 19--21, 2014, Proceedings (Lecture Notes in Computer Science","volume":"257","author":"Michael","unstructured":"Michael T. Goodrich and Joseph A. Simons. 2014. Data-Oblivious Graph Algorithms in Outsourced External Memory. In Combinatorial Optimization and Applications - 8th International Conference , COCOA 2014, Wailea, Maui, HI, USA, December 19--21, 2014, Proceedings (Lecture Notes in Computer Science , Vol. 8881). Springer, 241-- 257 . Michael T. Goodrich and Joseph A. Simons. 2014. Data-Oblivious Graph Algorithms in Outsourced External Memory. In Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19--21, 2014, Proceedings (Lecture Notes in Computer Science, Vol. 8881). Springer, 241--257."},{"key":"e_1_3_2_1_41_1","volume-title":"Attack and Mitigation. In Network and Distributed System Security Symposium (NDSS) .","author":"Islam Mohammad","year":"2012","unstructured":"Mohammad Islam , Mehmet Kuzu , and Murat Kantarcioglu . 2012 . Access Pattern disclosure on Searchable Encryption: Ramification , Attack and Mitigation. In Network and Distributed System Security Symposium (NDSS) . Mohammad Islam, Mehmet Kuzu, and Murat Kantarcioglu. 2012. Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation. In Network and Distributed System Security Symposium (NDSS) ."},{"key":"e_1_3_2_1_42_1","volume-title":"Kasper Green Larsen, and Mark Simkin","author":"Jafargholi Zahra","year":"2020","unstructured":"Zahra Jafargholi , Kasper Green Larsen, and Mark Simkin . 2020 . Optimal Oblivious Priority Queues and Offline Oblivious RAM. In ACM-SIAM SODA . Zahra Jafargholi, Kasper Green Larsen, and Mark Simkin. 2020. Optimal Oblivious Priority Queues and Offline Oblivious RAM. In ACM-SIAM SODA ."},{"key":"e_1_3_2_1_43_1","volume-title":"Karp and Vijaya Ramachandran","author":"Richard","year":"1990","unstructured":"Richard M. Karp and Vijaya Ramachandran . 1990 . Parallel Algorithms for Shared-Memory Machines. In Handbook of Theoretical Computer Science , Volume A: Algorithms and Complexity . Elsevier and MIT Press, 869-- 942 . Richard M. Karp and Vijaya Ramachandran. 1990. Parallel Algorithms for Shared-Memory Machines. In Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity . Elsevier and MIT Press, 869--942."},{"key":"e_1_3_2_1_44_1","volume-title":"3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, June 28 - July 1, 1988, Proceedings (Lecture Notes in Computer Science","volume":"110","author":"Rao Kosaraju S.","unstructured":"S. Rao Kosaraju and Arthur L. Delcher . 1988. Optimal Parallel Evaluation of Tree-Structured Computations by Raking. In VLSI Algorithms and Architectures , 3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, June 28 - July 1, 1988, Proceedings (Lecture Notes in Computer Science , Vol. 319), , John H. Reif (Ed.). Springer, 101-- 110 . S. Rao Kosaraju and Arthur L. Delcher. 1988. Optimal Parallel Evaluation of Tree-Structured Computations by Raking. In VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, AWOC 88, Corfu, Greece, June 28 - July 1, 1988, Proceedings (Lecture Notes in Computer Science, Vol. 319), , John H. Reif (Ed.). Springer, 101--110."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.29"},{"key":"e_1_3_2_1_46_1","unstructured":"Microsoft. [n.d.]. https:\/\/docs.microsoft.com\/en-us\/dotnet\/standard\/parallel-programming\/task-parallel-library-tplredirectedfrom=MSDN .  Microsoft. [n.d.]. https:\/\/docs.microsoft.com\/en-us\/dotnet\/standard\/parallel-programming\/task-parallel-library-tplredirectedfrom=MSDN ."},{"key":"e_1_3_2_1_47_1","volume-title":"GraphSC: Parallel Secure Computation Made Easy. In 2015 IEEE Symposium on Security and Privacy, SP 2015","author":"Nayak Kartik","year":"2015","unstructured":"Kartik Nayak , Xiao Shaun Wang , Stratis Ioannidis , Udi Weinsberg , Nina Taft , and Elaine Shi . 2015 . GraphSC: Parallel Secure Computation Made Easy. In 2015 IEEE Symposium on Security and Privacy, SP 2015 , San Jose, CA, USA, May 17--21 , 2015. IEEE Computer Society, 377--394. Kartik Nayak, Xiao Shaun Wang, Stratis Ioannidis, Udi Weinsberg, Nina Taft, and Elaine Shi. 2015. GraphSC: Parallel Secure Computation Made Easy. In 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, USA, May 17--21, 2015. IEEE Computer Society, 377--394."},{"key":"e_1_3_2_1_48_1","unstructured":"Oracle. [n.d.]. https:\/\/docs.oracle.com\/javase\/tutorial\/essential\/concurrency\/forkjoin.html .  Oracle. [n.d.]. https:\/\/docs.oracle.com\/javase\/tutorial\/essential\/concurrency\/forkjoin.html ."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700371065"},{"key":"e_1_3_2_1_50_1","volume-title":"Data Oblivious Algorithms for Multicores. arxiv","author":"Ramachandran Vijaya","year":"2008","unstructured":"Vijaya Ramachandran and Elaine Shi . 2020. Data Oblivious Algorithms for Multicores. arxiv : 2008 .00332 [cs.DC] Vijaya Ramachandran and Elaine Shi. 2020. Data Oblivious Algorithms for Multicores. arxiv: 2008.00332 [cs.DC]"},{"key":"e_1_3_2_1_51_1","volume-title":"Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue. In 2020 IEEE Symposium on Security and Privacy, SP 2020","author":"Shi Elaine","year":"2020","unstructured":"Elaine Shi . 2020 . Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue. In 2020 IEEE Symposium on Security and Privacy, SP 2020 , San Francisco, CA, USA, May 18--21 , 2020. IEEE, 842--858. Elaine Shi. 2020. Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue. In 2020 IEEE Symposium on Security and Privacy, SP 2020, San Francisco, CA, USA, May 18--21, 2020. IEEE, 842--858."},{"key":"e_1_3_2_1_52_1","unstructured":"Elaine Shi T.-H. Hubert Chan Emil Stefanov and Mingfei Li. 2011. Oblivious RAM with O((\u0142og N)^3) Worst-Case Cost. In ASIACRYPT .  Elaine Shi T.-H. Hubert Chan Emil Stefanov and Mingfei Li. 2011. Oblivious RAM with O((\u0142og N)^3) Worst-Case Cost. In ASIACRYPT ."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90008-6"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.45"}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","location":"Virtual Event USA","acronym":"SPAA '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461783","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3409964.3461783","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461783","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461783","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:17:08Z","timestamp":1750177028000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":54,"alternative-id":["10.1145\/3409964.3461783","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461783","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}