( en | de | ru )

 

Disambiguation of "Hemaspaandra, Lane A."

Author of the publication

copydeleteadd this publication to your clipboard
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.

, , , and . J. Artif. Intell. Res., (2015)

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.

Lane Brooks

Alexander Lane

Jay Donald Lane

Herbert Lane

Peter Lane

 

Other publications of authors with the same name

Barbosa, Uniform Polynomial Time Bounds, and Promises, , and . CoRR, (2011)Dichotomy for voting systems., and . J. Comput. Syst. Sci., 73 (1): 73-83 (2007)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)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)Query-Monotonic Turing Reductions., and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 895-904. Springer, (2005)P-Selectivity, Immunity, and the Power of One Bit., and . SOFSEM, volume 3831 of Lecture Notes in Computer Science, page 323-331. Springer, (2006)On Bounded-Weight Error-Correcting Codes, , , and . CoRR, (1999)The Opacity of Backbones., and . AAAI, page 3900-3906. AAAI Press, (2017)Computational Social Choice and Computational Complexity: BFFs?. AAAI, page 7971-7977. AAAI Press, (2018)