Author:
Beame Paul,Machmouchi Widad
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3;Fundamenta Informaticae;2022-03-07
2. Is There an Oblivious RAM Lower Bound?;Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science;2016-01-14
3. Circuit ORAM;Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security;2015-10-12
4. Data-Oblivious Data Structures;LEIBNIZ INT PR INFOR;2014
5. A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3;SOFSEM 2012: Theory and Practice of Computer Science;2012