Publisher
Springer International Publishing
Reference23 articles.
1. Alman, J., Chan, T.M., Williams, R.: Polynomial representations of threshold functions and algorithmic applications. In: 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 467–476. IEEE (2016)
2. Alman, J., Chen, L.: Efficient construction of rigid matrices using an NP oracle. In: 60th Annual Symposium on Foundations of Computer Science (FOCS). IEEE (2019)
3. Alman, J., Williams, R.: Probabilistic rank and matrix rigidity. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 641–652. ACM (2017)
4. Applebaum, B., Raykov, P.: From private simultaneous messages to zero-information arthur-merlin protocols and back. J. Cryptology 30(4), 961–988 (2017)
5. Applebaum, B., Vasudevan, P.N.: Placing conditional disclosure of secrets in the communication complexity universe. In: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)