Search Results - "Hemaspaandra, Edith"

A downward collapse within the polynomial hierarchy.

Authors: Hemaspaandra, Edith Hemaspaandra, Lane A. Hempel, Harald

Source: SIAM Journal on Computing; 1998, Vol. 28 Issue 2, p383-393, 11p

The Minimization Problem for Boolean Formulas.

Authors: Hemaspaandra, Edith Wechsung, Gerd

Source: SIAM Journal on Computing; 2002, Vol. 31 Issue 6, p1948-1958, 11p

Finding Optimal Solutions with Neighborly Help.

Authors: Burjons, Elisabet Frei, Fabian Hemaspaandra, Edith et al.

Source: Algorithmica; Jun2024, Vol. 86 Issue 6, p1921-1947, 27p

The complexity of (Pk,Pℓ)-arrowing.

Authors: Hassan, Zohair Raza Hemaspaandra, Edith Radziszowski, Stanisław

Source: Journal of Computer & System Sciences; Mar2026, Vol. 156, pN.PAG-N.PAG, 1p

The complexity of online bribery in sequential elections.

Authors: Hemaspaandra, Edith Hemaspaandra, Lane A. Rothe, Jörg

Source: Journal of Computer & System Sciences; Aug2022, Vol. 127, p66-90, 25p

Complexity of stability.

Authors: Frei, Fabian Hemaspaandra, Edith Rothe, Jörg

Source: Journal of Computer & System Sciences; Feb2022, Vol. 123, p103-121, 19p

Extending downward collapse from 1-versus-2 queries to m-versus-m+1 queries.

Authors: Hemaspaandra, Edith Hemaspaandra, Lane A. Hempel, Harald

Source: SIAM Journal on Computing; 2005, Vol. 34 Issue 6, p1352-1369, 18p

The Robustness of LWPP and WPP, with an Application to Graph Reconstruction.

Authors: Hemaspaandra, Edith Hemaspaandra, Lane A. Spakowski, Holger et al.

Source: Computational Complexity; Jun2020, Vol. 29 Issue 2, p1-49, 49p

Correction to: Control in the presence of manipulators: cooperative and competitive cases.

Authors: Fitzsimmons, Zack Hemaspaandra, Edith Hemaspaandra, Lane A.

Source: Autonomous Agents & Multi-Agent Systems; 2020, Vol. 34 Issue 2, p1-32, 32p

Control in the presence of manipulators: cooperative and competitive cases.

Authors: Fitzsimmons, Zack Hemaspaandra, Edith Hemaspaandra, Lane A.

Source: Autonomous Agents & Multi-Agent Systems; 2020, Vol. 34 Issue 2, p1-32, 32p

Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP.

Authors: Hemaspaandra, Edith Hemaspaandra, Lane A. Rothe, Jörg

Source: Journal of the ACM; November 1997, Vol. 44, p806-825, 20p

Hybrid Elections Broaden Complexity-Theoretic Resistance to Control.

Authors: Hemaspaandra, Edith Hemaspaandra, Lane A. Rothe, Jörg

Source: Mathematical Logic Quarterly. Aug2009, Vol. 55 Issue 4, p397-424. 28p. 2 Charts.

Isomorphic Implication.

Authors: Bauland, Michael Hemaspaandra, Edith

Source: Theory of Computing Systems; Jan2009, Vol. 44 Issue 1, p117-139, 23p

Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries.

Authors: Hemaspaandra, Edith Hemaspaandra, Lane A. Hempel, Harald

Source: SIAM Journal on Computing. 2005, Vol. 34 Issue 6, p1352. 18p.

Using Complexity to Protect Elections.

Authors: FALISZEWSKI, PIOTR HEMASPAANDRA, EDITH HEMASPAANDRA, LANE A.

Source: Communications of the ACM. Nov2010, Vol. 53 Issue 11, p74-82. 9p. 1 Color Photograph, 1 Illustration, 2 Diagrams, 1 Chart, 1 Graph.

Subjects: Computational complexity, Corrupt practices in elections, Voter turnout, Algorithm research, Bribery, Voting research