Communication Complexity of Key Agreement on Limited Ranges
暂无分享,去创建一个
[1] Andrew V. Goldberg,et al. Compression and Ranking , 1991, SIAM J. Comput..
[2] Lane A. Hemaspaandra,et al. Computing Solutions Uniquely Collapses the Polynomial Hierarchy , 1994, SIAM J. Comput..
[3] Rafail Ostrovsky,et al. Computational Complexity and Knowledge Complexity , 1994, Electron. Colloquium Comput. Complex..
[4] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..
[5] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.
[6] Eli Gafni,et al. Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.
[7] Maurice Herlihy,et al. The asynchronous computability theorem for t-resilient tasks , 1993, STOC.
[8] Laura A. Sanchis,et al. On the Efficient Generation of Language Instances , 1990, SIAM J. Comput..
[9] Aravind Srinivasan,et al. Randomness-optimal unique element isolation, with applications to perfect matching and related problems , 1993, STOC '93.
[10] Alan L. Selman,et al. Complexity Measures for Public-Key Cryptosystems , 1988, SIAM J. Comput..
[11] Alan L. Selman,et al. A Taxonomy of Complexity Classes of Functions , 1994, J. Comput. Syst. Sci..
[12] Ueli Maurer,et al. Perfect cryptographic security from partially independent channels , 1991, STOC '91.
[13] Richard M. Karp,et al. Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[14] Leslie G. Valiant,et al. Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..
[15] Moni Naor,et al. Three results on interactive communication , 1993, IEEE Trans. Inf. Theory.
[16] Joachim von zur Gathen,et al. Constructing Normal Bases in Nite Elds , 1990 .
[17] Richard J. Lipton,et al. A New Approach To Information Theory , 1994, STACS.
[18] Alon Orlitsky,et al. Interactive communication: balanced distributions, correlated files, and average-case complexity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[19] Alon Orlitsky,et al. Average-case interactive communication , 1992, IEEE Trans. Inf. Theory.
[20] Alon Orlitsky,et al. Worst-case interactive communication - II: Two messages are not optimal , 1991, IEEE Trans. Inf. Theory.
[21] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.