1. On the Sparsity of XORs in Approximate Model Counting
2. Uniform Generation of NP-Witnesses Using an NP-Oracle
3. Making zero-knowledge provers efficient
4. [ 4 ] J Lawrence Carter and Mark N Wegman . Universal classes of hash functions . In Proceedings of the ninth annual ACM symposium on Theory of computing , pages 106– 112 . ACM, 1977. [4] J Lawrence Carter and Mark N Wegman. Universal classes of hash functions. In Proceedings of the ninth annual ACM symposium on Theory of computing, pages 106–112. ACM, 1977.
5. [ 5 ] S. Chakraborty, D. J. Fremont , K. S. Meel , S. A. Seshia , and M. Y. Vardi . Distribution-aware sampling and weighted model counting for SAT . In Proc. of AAAI , pages 1722– 1730 , 2014 . [5] S. Chakraborty, D. J. Fremont, K. S. Meel, S. A. Seshia, and M. Y. Vardi. Distribution-aware sampling and weighted model counting for SAT. In Proc. of AAAI, pages 1722–1730, 2014.