Yao's principle (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Yao's principle" in English language version.

refsWebsite

Global rank English rank

11doi.org

2^nd place

7ams.org

451^st place

277^th place

4books.google.com

3^rd place

3semanticscholar.org

11^th place

8^th place

2arxiv.org

69^th place

59^th place

1fortnow.com

low place

ams.org

mathscinet.ams.org

Bohnenblust, H. F.; Karlin, S.; Shapley, L. S. (1950), "Solutions of discrete, two-person games", in Kuhn, Harold W.; Tucker, Albert William (eds.), Contributions to the Theory of Games, Annals of Mathematics Studies, vol. 24, Princeton University Press, pp. 51–72, doi:10.1515/9781400881727-006, ISBN 978-1-4008-8172-7, MR 0039218{{citation}}: CS1 maint: ignored ISBN errors (link)
Cunto, Walter; Munro, J. Ian (1989), "Average case selection", Journal of the ACM, 36 (2): 270–279, doi:10.1145/62044.62047, MR 1072421, S2CID 10947879
Chan, Timothy M. (2010), "Comparison-based time-space lower bounds for selection", ACM Transactions on Algorithms, 6 (2): A26:1–A26:16, doi:10.1145/1721837.1721842, MR 2675693, S2CID 11742607
Chakrabarti, Amit; Khot, Subhash (2007), "Improved lower bounds on the randomized complexity of graph properties", Random Structures & Algorithms, 30 (3): 427–440, doi:10.1002/rsa.20164, MR 2309625, S2CID 8384071
Wegener, Ingo (2005), "9.2 Yao's minimax principle", Complexity Theory: Exploring the Limits of Efficient Algorithms, Springer-Verlag, pp. 118–120, doi:10.1007/3-540-27477-4, ISBN 978-3-540-21045-0, MR 2146155
Viola, Emanuele (2015), "The communication complexity of addition", Combinatorica, 35 (6): 703–747, doi:10.1007/s00493-014-3078-3, MR 3439794
Ben-David, Shalev; Blais, Eric (2023), "A new minimax theorem for randomized algorithms", Journal of the ACM, 70 (6) 38, arXiv:2002.10802, doi:10.1145/3626514, MR 4679504

arxiv.org

Ben-David, Shalev; Blais, Eric (2023), "A new minimax theorem for randomized algorithms", Journal of the ACM, 70 (6) 38, arXiv:2002.10802, doi:10.1145/3626514, MR 4679504
de Graaf, Mart; de Wolf, Ronald (2002), "On quantum versions of the Yao principle", in Alt, Helmut; Ferreira, Afonso (eds.), STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes – Juan les Pins, France, March 14–16, 2002, Proceedings, Lecture Notes in Computer Science, vol. 2285, Springer, pp. 347–358, arXiv:quant-ph/0109070, doi:10.1007/3-540-45841-7_28, ISBN 978-3-540-43283-8

books.google.com

Arora, Sanjeev; Barak, Boaz (2009), "Note 12.8: Yao's Min-Max Lemma", Computational Complexity: A Modern Approach, Cambridge University Press, p. 265, ISBN 9780511530753
Borodin, Allan; El-Yaniv, Ran (2005), "8.3 Yao's principle: A technique for obtaining lower bounds", Online Computation and Competitive Analysis, Cambridge University Press, pp. 115–120, ISBN 9780521619462
Wigderson, Avi (2019), Mathematics and Computation: A Theory Revolutionizing Technology and Science, Princeton University Press, p. 210, ISBN 9780691189130
Moore, Cristopher; Mertens, Stephan (2011), "Theorem 10.1 (Yao's principle)", The Nature of Computation, Oxford University Press, p. 471, ISBN 9780199233212

doi.org

Yao, Andrew (1977), "Probabilistic computations: Toward a unified measure of complexity", Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 222–227, doi:10.1109/SFCS.1977.24
Laraki, Rida; Renault, Jérôme; Sorin, Sylvain (2019), "2.3 The Minmax Theorem", Mathematical Foundations of Game Theory, Universitext, Springer, pp. 16–18, doi:10.1007/978-3-030-26646-2, ISBN 978-3-030-26646-2
Bohnenblust, H. F.; Karlin, S.; Shapley, L. S. (1950), "Solutions of discrete, two-person games", in Kuhn, Harold W.; Tucker, Albert William (eds.), Contributions to the Theory of Games, Annals of Mathematics Studies, vol. 24, Princeton University Press, pp. 51–72, doi:10.1515/9781400881727-006, ISBN 978-1-4008-8172-7, MR 0039218{{citation}}: CS1 maint: ignored ISBN errors (link)
Cunto, Walter; Munro, J. Ian (1989), "Average case selection", Journal of the ACM, 36 (2): 270–279, doi:10.1145/62044.62047, MR 1072421, S2CID 10947879
Chan, Timothy M. (2010), "Comparison-based time-space lower bounds for selection", ACM Transactions on Algorithms, 6 (2): A26:1–A26:16, doi:10.1145/1721837.1721842, MR 2675693, S2CID 11742607
Chakrabarti, Amit; Khot, Subhash (2007), "Improved lower bounds on the randomized complexity of graph properties", Random Structures & Algorithms, 30 (3): 427–440, doi:10.1002/rsa.20164, MR 2309625, S2CID 8384071
Wegener, Ingo (2005), "9.2 Yao's minimax principle", Complexity Theory: Exploring the Limits of Efficient Algorithms, Springer-Verlag, pp. 118–120, doi:10.1007/3-540-27477-4, ISBN 978-3-540-21045-0, MR 2146155
Viola, Emanuele (2015), "The communication complexity of addition", Combinatorica, 35 (6): 703–747, doi:10.1007/s00493-014-3078-3, MR 3439794
Seiden, Steven S. (2000), "A guessing game and randomized online algorithms", in Yao, F. Frances; Luks, Eugene M. (eds.), Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21–23, 2000, Portland, OR, USA, pp. 592–601, doi:10.1145/335305.335385, ISBN 1-58113-184-4
Ben-David, Shalev; Blais, Eric (2023), "A new minimax theorem for randomized algorithms", Journal of the ACM, 70 (6) 38, arXiv:2002.10802, doi:10.1145/3626514, MR 4679504
de Graaf, Mart; de Wolf, Ronald (2002), "On quantum versions of the Yao principle", in Alt, Helmut; Ferreira, Afonso (eds.), STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes – Juan les Pins, France, March 14–16, 2002, Proceedings, Lecture Notes in Computer Science, vol. 2285, Springer, pp. 347–358, arXiv:quant-ph/0109070, doi:10.1007/3-540-45841-7_28, ISBN 978-3-540-43283-8

fortnow.com

weblog.fortnow.com

Fortnow, Lance (October 16, 2006), "Favorite theorems: Yao principle", Computational Complexity

semanticscholar.org

api.semanticscholar.org

Cunto, Walter; Munro, J. Ian (1989), "Average case selection", Journal of the ACM, 36 (2): 270–279, doi:10.1145/62044.62047, MR 1072421, S2CID 10947879
Chan, Timothy M. (2010), "Comparison-based time-space lower bounds for selection", ACM Transactions on Algorithms, 6 (2): A26:1–A26:16, doi:10.1145/1721837.1721842, MR 2675693, S2CID 11742607
Chakrabarti, Amit; Khot, Subhash (2007), "Improved lower bounds on the randomized complexity of graph properties", Random Structures & Algorithms, 30 (3): 427–440, doi:10.1002/rsa.20164, MR 2309625, S2CID 8384071