Keyword

randomized communication complexity

Description: Randomized communication complexity measures the communication required for parties to compute a function when they may use random choices and bounded error.
OpenAlex ID: keywords/randomized-communication-complexity
1999 · I. Kremer, N. Nisan, et al. · Computational Complexity · 224
1993 · Noam Nisan, Avi Wigderson · SIAM Journal on Computing · 193
2011 · Mark Braverman, Anup Rao · Annual Symposium on Foundations of Computer Science · 168
2004 · Ziv Bar-Yossef, T. S. Jayram, et al. · ACM Symposium on Theory of Computing (STOC) · 152
1995 · Tomás Feder, Eyal Kushilevitz, et al. · SIAM Journal on Computing · 145
2013 · Boaz Barak, Mark Braverman, et al. · SIAM Journal on Computing · 126
2012 · Amit Chakrabarti, Oded Regev · SIAM Journal on Computing · 123
2008 · Troy Lee, Adi Shraibman, et al. · IEEE Conference on Computational Complexity (CCC) · 121
2011 · Oded Regev, Bo'az Klartag · ACM Symposium on Theory of Computing (STOC) · 110
2017 · Mika Goos, Toniann Pitassi, et al. · SIAM Journal on Computing · 109
2010 · Rahul Jain, Hartmut Klauck · IEEE Conference on Computational Complexity (CCC) · 104
2014 · Mark Braverman, Anup Rao · IEEE Transactions on Information Theory · 102
2004 · H. Klauck · IEEE Conference on Computational Complexity (CCC) · 101
2003 · László Babai, Anna Gál, et al. · SIAM Journal on Computing · 99
2002 · L. Babai, P.G. Kimmel · IEEE Conference on Computational Complexity (CCC) · 98
2013 · Mark Braverman, Ankit Garg, et al. · ACM Symposium on Theory of Computing (STOC) · 96
2016 · Mika Göös, Shachar Lovett, et al. · SIAM Journal on Computing · 95
2008 · Nati Linial, Adi Shraibman · Random Structures and Algorithms · 92
2008 · Chattopadhyay, Arkadev, Ada, Anil · arXiv (Cornell University) · 90
2011 · Amit Chakrabarti, Oded Regev · ACM Symposium on Theory of Computing (STOC) · 88
2012 · Alexander A. Sherstov · Theory of Computing · 81
2015 · Mark Braverman · SIAM Journal on Computing · 80
2010 · Hartmut Klauck · ACM Symposium on Theory of Computing (STOC) · 80
2007 · T. Lee, A. Shraibman · now publishers, Inc. eBooks · 78
Works count: 236
Citation count: 5,815
Year
Topic
Type