Keyword

PPAD

Description: A complexity class of total search problems whose solutions are guaranteed by parity arguments in directed graphs.
Wikidata ID: wiki/Q7120085
OpenAlex ID: keywords/ppad
2006 · Xi Chen, Xiaotie Deng · Annual Symposium on Foundations of Computer Science · 614
2006 · Constantinos Daskalakis, Paul W. Goldberg, et al. · ACM Symposium on Theory of Computing (STOC) · 584
2009 · Constantinos Daskalakis, Paul W. Goldberg, et al. · Communications of the ACM · 430
2010 · Kousha Etessami, Mihalis Yannakakis · SIAM Journal on Computing · 360
2006 · Xi Chen, Xiaotie Deng, et al. · Annual Symposium on Foundations of Computer Science · 213
2016 · Aviad Rubinstein · ACM SIGecom Exchanges · 194
2011 · Vijay V. Vazirani, Mihalis Yannakakis · Journal of the ACM · 171
2005 · Constantinos Daskalakis, Christos H. Papadimitriou · Electronic colloquium on computational complexity · 171
2011 · Constantinos Daskalakis, Christos Papadimitriou · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 164
2007 · Christos H. Papadimitriou · Algorithmic Game Theory · 137
2004 · R. Savani, B. von Stengel · Annual Symposium on Foundations of Computer Science · 131
2015 · Nir Bitansky, Omer Paneth, et al. · Annual Symposium on Foundations of Computer Science · 128
2014 · Maximilian F Konig, Alizay S Paracha, et al. · Annals of the Rheumatic Diseases · 120
2015 · Aviad Rubinstein · ACM Symposium on Theory of Computing (STOC) · 107
2022 · John Fearnley, Paul Goldberg, et al. · Journal of the ACM · 99
2009 · Constantinos Daskalakis, Christos H. Papadimitriou · ACM Symposium on Theory of Computing (STOC) · 98
2007 · Kousha Etessami, Mihalis Yannakakis · Annual Symposium on Foundations of Computer Science · 96
2016 · Sanjam Garg, Omkant Pandey, et al. · Lecture notes in computer science · 94
2008 · Christian Borgs, Jennifer Chayes, et al. · Games and Economic Behavior · 93
2016 · Tim Stobernack, Corinna Glasner, et al. · Journal of Proteome Research · 78
2016 · Yakov Babichenko, Christos Papadimitriou, et al. · Conference on Innovations in Theoretical Computer Science · 61
2021 · John Fearnley, Paul W. Goldberg, et al. · ACM Symposium on Theory of Computing (STOC) · 58
2017 · Pavel Hubáček, Eylon Yogev · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 55
Works count: 204
Citation count: 4,905
Year
Topic
Type