Communication complexity (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Communication complexity" in English language version.

refsWebsite

Global rank English rank

27doi.org

2^nd place

7arxiv.org

69^th place

59^th place

3weizmann.ac.il

4,983^rd place

8,002^nd place

3semanticscholar.org

11^th place

8^th place

2worldcat.org

5^th place

2harvard.edu

18^th place

17^th place

1unt.edu

1,336^th place

769^th place

1nih.gov

4^th place

1ieee.org

652^nd place

515^th place

1boazbarak.org

low place

1ucsd.edu

1,933^rd place

1,342^nd place

1dagstuhl.de

low place

1psu.edu

207^th place

136^th place

1toronto.edu

low place

8,821^st place

1theoryofcomputing.org

low place

1utoronto.ca

1,601^st place

1,117^th place

1ias.edu

7,948^th place

5,350^th place

1figshare.com

5,893^rd place

3,320^th place

arxiv.org

Navascués, Miguel; Guryanova, Yelena; Hoban, Matty J.; Acín, Antonio (2015). "Almost quantum correlations". Nature Communications. 6: 6288. arXiv:1403.4621. Bibcode:2015NatCo...6.6288N. doi:10.1038/ncomms7288. PMID 25697645.
P. Botteron, A. Broadbent and M.-O. Proulx, arXiv:2302.00488.
Braverman, Mark; Rao, Anup (2014). "Information equals amortized communication". IEEE Transactions on Information Theory. 60 (10): 6058–6069. arXiv:1106.3595. doi:10.1109/TIT.2014.2347282.
Chattopadhyay, Arkadev; Koucký, Michal; Loff, Bruno; Mukhopadhyay, Sagnik (2019). "Simulation theorems via pseudo-random properties". Computational Complexity. 28 (4): 617–659. arXiv:1704.06807. doi:10.1007/s00037-019-00190-7.
Göös, Mika; Pitassi, Toniann; Watson, Thomas (2017). "Query-to-Communication Lifting for BPP". 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). Berkeley, CA: IEEE. arXiv:1703.07666. doi:10.1109/FOCS.2017.21.
de Rezende, Susanna; Meir, Or; Nordström, Jakob; Pitassi, Toniann; Robere, Robere; Vinyals, Marc (2020). "Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity". 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). Virtual conference: IEEE. pp. 24–30. arXiv:2001.02144. doi:10.1109/FOCS46700.2020.00011.
Sherstov, Alexander (2011). "The pattern matrix method". SIAM Journal on Computing. 40 (6): 1969–2000. arXiv:0906.4291. doi:10.1137/080733644.

boazbarak.org

Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup (2013). "How to Compress Interactive Communication" (PDF). SIAM Journal on Computing. 42 (3): 1327–1363. doi:10.1137/100811969.

dagstuhl.de

drops.dagstuhl.de

Göös, Mika; Pitassi, Toniann; Watson, Thomas (2018-06-01). "The Landscape of Communication Complexity Classes". Computational Complexity. 27 (2): 245–304. doi:10.1007/s00037-018-0166-6. ISSN 1420-8954. S2CID 4333231.

doi.org

Cleve, Richard; Van Dam, Wim; Nielsen, Michael; Tapp, Alain (1999). "Quantum Entanglement and the Communication Complexity of the Inner Product Function". Quantum Computing and Quantum Communications. Lecture Notes in Computer Science. Vol. 1509. pp. 61–74. doi:10.1007/3-540-49208-9_4. ISBN 978-3-540-65514-5.
Navascués, Miguel; Guryanova, Yelena; Hoban, Matty J.; Acín, Antonio (2015). "Almost quantum correlations". Nature Communications. 6: 6288. arXiv:1403.4621. Bibcode:2015NatCo...6.6288N. doi:10.1038/ncomms7288. PMID 25697645.
Yao, Andrew Chi-Chih (1977). "Probabilistic computations: Toward a unified measure of complexity". 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). IEEE. doi:10.1109/SFCS.1977.24. ISSN 0272-5428.
Razborov, Alexander (1992). "On the distributional complexity of disjointness". Theoretical Computer Science. 106 (2): 385–390. doi:10.1016/0304-3975(92)90260-M.
Bar-Yossef, Ziv; Jayram, T. S.; Kumar, Ravi; Sivakumar, D. (2004). "An information statistics approach to data stream and communication complexity" (PDF). Journal of Computer and System Sciences. 68 (4): 702–732. doi:10.1016/j.jcss.2003.11.006. Retrieved 1 December 2023.
Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup (2013). "How to Compress Interactive Communication" (PDF). SIAM Journal on Computing. 42 (3): 1327–1363. doi:10.1137/100811969.
Braverman, Mark; Rao, Anup (2014). "Information equals amortized communication". IEEE Transactions on Information Theory. 60 (10): 6058–6069. arXiv:1106.3595. doi:10.1109/TIT.2014.2347282.
Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri (June 2013). STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. Palo Alto, CA: ACM. pp. 151–160. doi:10.1145/2488608.2488628. ISBN 978-1-4503-2029-0.
Braverman, Mark; Moitra, Ankur (1 June 2013). "An information complexity approach to extended formulations". STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. Palo Alto, CA: ACM. pp. 161–170. doi:10.1145/2488608.2488629.
Weinstein, Omri (June 2015). "Information Complexity and the Quest for Interactive Compression". ACM SIGACT News. 46 (2): 41–64. doi:10.1145/2789149.2789161. Retrieved 1 December 2023.
Yannakakis, M. (1991). "Expressing combinatorial optimization problems by linear programs". J. Comput. Syst. Sci. 43 (3): 441–466. doi:10.1016/0022-0000(91)90024-y.
Göös, Mika; Pitassi, Toniann; Watson, Thomas (2018-06-01). "The Landscape of Communication Complexity Classes". Computational Complexity. 27 (2): 245–304. doi:10.1007/s00037-018-0166-6. ISSN 1420-8954. S2CID 4333231.
Sherstov, Alexander A. (October 2008). "The Unbounded-Error Communication Complexity of Symmetric Functions". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. pp. 384–393. doi:10.1109/focs.2008.20. ISBN 978-0-7695-3436-7. S2CID 9072527.
Forster, Jürgen (2002). "A linear lower bound on the unbounded error probabilistic communication complexity". Journal of Computer and System Sciences. 65 (4): 612–625. doi:10.1016/S0022-0000(02)00019-3.
Alon, N.; Frankl, P.; Rodl, V. (October 1985). "Geometrical realization of set systems and probabilistic communication complexity". 26th Annual Symposium on Foundations of Computer Science (SFCS 1985). Portland, OR, USA: IEEE. pp. 277–280. CiteSeerX 10.1.1.300.9711. doi:10.1109/SFCS.1985.30. ISBN 9780818606441. S2CID 8416636.
Raz, Ran; McKenzie, Pierre (1999). "Separation of the Monotone NC Hierarchy". Combinatorica. 19 (3): 403–435. doi:10.1007/s004930050062.
Göös, Mika; Pitassi, Toniann; Watson, Thomas (2018). "Deterministic communication vs. partition number". SIAM Journal on Computing. 74 (6): 2435–2450. doi:10.1137/16M1059369.
Chattopadhyay, Arkadev; Koucký, Michal; Loff, Bruno; Mukhopadhyay, Sagnik (2019). "Simulation theorems via pseudo-random properties". Computational Complexity. 28 (4): 617–659. arXiv:1704.06807. doi:10.1007/s00037-019-00190-7.
Lovett, Shachar; Meka, Raghu; Mertz, Ian; Pitassi, Toniann; Zhang, Jiapeng (200). "Lifting with Sunflowers" (PDF). 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Vol. 215. Leibniz International Proceedings in Informatics (LIPIcs). pp. 104:1–104:24. doi:10.4230/LIPIcs.ITCS.2022.104.
Göös, Mika; Pitassi, Toniann; Watson, Thomas (2017). "Query-to-Communication Lifting for BPP". 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). Berkeley, CA: IEEE. arXiv:1703.07666. doi:10.1109/FOCS.2017.21.
Garg, Ankit; Göös, Mika; Kamath, Pritish; Sokolov, Dmitry (2020). "Monotone Circuit Lower Bounds from Resolution". Theory of Computing. 16: 13:1–13:30. doi:10.4086/toc.2020.v016a013.
de Rezende, Susanna; Meir, Or; Nordström, Jakob; Pitassi, Toniann; Robere, Robere; Vinyals, Marc (2020). "Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity". 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). Virtual conference: IEEE. pp. 24–30. arXiv:2001.02144. doi:10.1109/FOCS46700.2020.00011.
Sherstov, Alexander (2011). "The pattern matrix method". SIAM Journal on Computing. 40 (6): 1969–2000. arXiv:0906.4291. doi:10.1137/080733644.
Pitassi, Toniann; Robere, Robert (2017). "Strongly Exponential Lower Bounds for Monotone Computation" (PDF). STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Montreal: ACM. pp. 1246–1255. doi:10.1145/3055399.3055478.
Karchmer, Mauricio; Wigderson, Avi (1990). "Monotone circuits for connectivity require super-logarithmic depth" (PDF). SIAM Journal on Discrete Mathematics. 3 (2): 255–265. doi:10.1137/0403021.
Chattopadhyay, Arkadev; Mande, Nikhil S.; Sherif, Suhail (2019). "The Log-Approximate-Rank Conjecture is False". 2019, Proceeding of the 51st Annual ACM Symposium on Theory of Computing: 42-53.https://doi.org/10.1145/3313276.3316353
Conitzer, Vincent; Sandholm, Tuomas (2005-06-05). "Communication complexity of common voting rules". Proceedings of the 6th ACM conference on Electronic commerce. EC '05. New York, NY, USA: Association for Computing Machinery. pp. 78–87. doi:10.1145/1064009.1064018. ISBN 978-1-59593-049-1.

figshare.com

Conitzer, Vincent; Sandholm, Tuomas (2005-06-05). "Communication complexity of common voting rules". Proceedings of the 6th ACM conference on Electronic commerce. EC '05. New York, NY, USA: Association for Computing Machinery. pp. 78–87. doi:10.1145/1064009.1064018. ISBN 978-1-59593-049-1.

harvard.edu

ui.adsabs.harvard.edu

Navascués, Miguel; Guryanova, Yelena; Hoban, Matty J.; Acín, Antonio (2015). "Almost quantum correlations". Nature Communications. 6: 6288. arXiv:1403.4621. Bibcode:2015NatCo...6.6288N. doi:10.1038/ncomms7288. PMID 25697645.

people.seas.harvard.edu

Bar-Yossef, Ziv; Jayram, T. S.; Kumar, Ravi; Sivakumar, D. (2004). "An information statistics approach to data stream and communication complexity" (PDF). Journal of Computer and System Sciences. 68 (4): 702–732. doi:10.1016/j.jcss.2003.11.006. Retrieved 1 December 2023.

ias.edu

math.ias.edu

Karchmer, Mauricio; Wigderson, Avi (1990). "Monotone circuits for connectivity require super-logarithmic depth" (PDF). SIAM Journal on Discrete Mathematics. 3 (2): 255–265. doi:10.1137/0403021.

ieee.org

ieeexplore.ieee.org

Yao, Andrew Chi-Chih (1977). "Probabilistic computations: Toward a unified measure of complexity". 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). IEEE. doi:10.1109/SFCS.1977.24. ISSN 0272-5428.

nih.gov

pubmed.ncbi.nlm.nih.gov

Navascués, Miguel; Guryanova, Yelena; Hoban, Matty J.; Acín, Antonio (2015). "Almost quantum correlations". Nature Communications. 6: 6288. arXiv:1403.4621. Bibcode:2015NatCo...6.6288N. doi:10.1038/ncomms7288. PMID 25697645.

psu.edu

citeseerx.ist.psu.edu

Alon, N.; Frankl, P.; Rodl, V. (October 1985). "Geometrical realization of set systems and probabilistic communication complexity". 26th Annual Symposium on Foundations of Computer Science (SFCS 1985). Portland, OR, USA: IEEE. pp. 277–280. CiteSeerX 10.1.1.300.9711. doi:10.1109/SFCS.1985.30. ISBN 9780818606441. S2CID 8416636.

semanticscholar.org

api.semanticscholar.org

Göös, Mika; Pitassi, Toniann; Watson, Thomas (2018-06-01). "The Landscape of Communication Complexity Classes". Computational Complexity. 27 (2): 245–304. doi:10.1007/s00037-018-0166-6. ISSN 1420-8954. S2CID 4333231.
Sherstov, Alexander A. (October 2008). "The Unbounded-Error Communication Complexity of Symmetric Functions". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. pp. 384–393. doi:10.1109/focs.2008.20. ISBN 978-0-7695-3436-7. S2CID 9072527.
Alon, N.; Frankl, P.; Rodl, V. (October 1985). "Geometrical realization of set systems and probabilistic communication complexity". 26th Annual Symposium on Foundations of Computer Science (SFCS 1985). Portland, OR, USA: IEEE. pp. 277–280. CiteSeerX 10.1.1.300.9711. doi:10.1109/SFCS.1985.30. ISBN 9780818606441. S2CID 8416636.

theoryofcomputing.org

Garg, Ankit; Göös, Mika; Kamath, Pritish; Sokolov, Dmitry (2020). "Monotone Circuit Lower Bounds from Resolution". Theory of Computing. 16: 13:1–13:30. doi:10.4086/toc.2020.v016a013.

toronto.edu

cs.toronto.edu

Lovett, Shachar; Meka, Raghu; Mertz, Ian; Pitassi, Toniann; Zhang, Jiapeng (200). "Lifting with Sunflowers" (PDF). 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Vol. 215. Leibniz International Proceedings in Informatics (LIPIcs). pp. 104:1–104:24. doi:10.4230/LIPIcs.ITCS.2022.104.

ucsd.edu

cseweb.ucsd.edu

Lovett, Shachar, CSE 291: Communication Complexity, Winter 2019 Unbounded-error protocols (PDF), retrieved June 9, 2019

unt.edu

digital.library.unt.edu

Cleve, Richard; Van Dam, Wim; Nielsen, Michael; Tapp, Alain (1999). "Quantum Entanglement and the Communication Complexity of the Inner Product Function". Quantum Computing and Quantum Communications. Lecture Notes in Computer Science. Vol. 1509. pp. 61–74. doi:10.1007/3-540-49208-9_4. ISBN 978-3-540-65514-5.

utoronto.ca

cs.utoronto.ca

Pitassi, Toniann; Robere, Robert (2017). "Strongly Exponential Lower Bounds for Monotone Computation" (PDF). STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Montreal: ACM. pp. 1246–1255. doi:10.1145/3055399.3055478.

weizmann.ac.il

eccc.weizmann.ac.il

Braverman, Mark; Moitra, Ankur (1 June 2013). "An information complexity approach to extended formulations". STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. Palo Alto, CA: ACM. pp. 161–170. doi:10.1145/2488608.2488629.
Weinstein, Omri (June 2015). "Information Complexity and the Quest for Interactive Compression". ACM SIGACT News. 46 (2): 41–64. doi:10.1145/2789149.2789161. Retrieved 1 December 2023.
Göös, Mika; Pitassi, Toniann; Watson, Thomas (2018). "Deterministic communication vs. partition number". SIAM Journal on Computing. 74 (6): 2435–2450. doi:10.1137/16M1059369.

worldcat.org

search.worldcat.org

Yao, Andrew Chi-Chih (1977). "Probabilistic computations: Toward a unified measure of complexity". 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). IEEE. doi:10.1109/SFCS.1977.24. ISSN 0272-5428.
Göös, Mika; Pitassi, Toniann; Watson, Thomas (2018-06-01). "The Landscape of Communication Complexity Classes". Computational Complexity. 27 (2): 245–304. doi:10.1007/s00037-018-0166-6. ISSN 1420-8954. S2CID 4333231.