Author of the publication

Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.

, , , and . AAAI, AAAI Press, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Advice for Semifeasible Sets and the Complexity-Theoretic Cost(lessness) of Algebraic Properties.. DCFS, Report No. 619, page 52-66. Department of Computer Science, The University of Western Ontario, Canada, (2004)P-Selectivity, Immunity, and the Power of One Bit., and . SOFSEM, volume 3831 of Lecture Notes in Computer Science, page 323-331. Springer, (2006)Query-Monotonic Turing Reductions., and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 895-904. Springer, (2005)The Join Can Lower Complexity., , , and . COCOON, volume 1090 of Lecture Notes in Computer Science, page 260-267. Springer, (1996)Computing Solutions Uniquely collapses the Polynomial Hierarchy., , , and . ISAAC, volume 834 of Lecture Notes in Computer Science, page 56-64. Springer, (1994)On Bounded-Weight Error-Correcting Codes, , , and . CoRR, (1999)SIGACT News Complexity Theory Column 103.. SIGACT News, 50 (4): 56 (2019)Barbosa, Uniform Polynomial Time Bounds, and Promises, , and . CoRR, (2011)A Note on Nonuniform versus Uniform ACC^k Circuits for NE. CoRR, (2010)SIGACT news complexity theory column 80.. SIGACT News, 44 (4): 52 (2013)