1. Optimal Explicit Small-Depth Formulas for the Coin Problem;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. D-KODE: Distributed Mechanism to Manage a Billion Discrete-log Keys;Proceedings of the 4th ACM Conference on Advances in Financial Technologies;2022-09-19
3. Tight Space Complexity of the Coin Problem;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
4. The relation between tree size complexity and probability for Boolean functions generated by uniform random trees;Applicable Analysis and Discrete Mathematics;2016
5. Associative and commutative tree representations for Boolean functions;Theoretical Computer Science;2015-03