Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Leibniz International Proceedings in Informatics;G Beniamini,2022
2. IMACS Series in Discrete Mathematics and Theoretical Computer Science;L J Billera,1996
3. M. Dietzfelbinger, J. Hromkovič and G. Schnitger, A comparison of two lower-bound methods for communication complexity, Theoretical Computer Science 168 (1996), 39–51.
4. S. Dobzinski, N. Nisan and S. Oren, Economic efficiency requires interaction, Games and Economic Behavior 118 (2019), 589–608.
5. P. Erdős and A. Rényi, On random matrices, A Magyar Tudományos Akadémia. Matematikai Kutató Intézetének Közleményei 8 (1964), 455–461.