Lane A. Hemaspaandra (premarriage name: Hemachandra)
Lane A. Hemaspaandra (premarriage name: Hemachandra)
Professor of Computer Science, University of Rochester
Bestätigte E-Mail-Adresse bei cs.rochester.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Using simulated annealing to design good codes
AE Gamal, L Hemachandra, I Shperling, V Wei
IEEE Transactions on Information Theory 33 (1), 116-123, 1987
2561987
The boolean hierarchy I: Structural properties
JY Cai, T Gundermann, J Hartmanis, LA Hemachandra, V Sewelson, ...
SIAM Journal on Computing 17 (6), 1232-1252, 1988
2501988
Anyone but him: The complexity of precluding an alternative
E Hemaspaandra, LA Hemaspaandra, J Rothe
Artificial Intelligence 171 (5-6), 255-285, 2007
2482007
The strong exponential hierarchy collapses
LA Hemachandra
Journal of Computer and System Sciences 39 (3), 299-322, 1989
2371989
How hard is bribery in elections?
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Journal of artificial intelligence research 35, 485-532, 2009
2302009
The complexity theory companion
LA Hemaspaandra, M Ogihara
Springer Science & Business Media, 2013
2222013
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
E Hemaspaandra, LA Hemaspaandra, J Rothe
Journal of the ACM (JACM) 44 (6), 806-825, 1997
2211997
Llull and Copeland voting computationally resist bribery and constructive control
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
Journal of Artificial Intelligence Research 35, 275-341, 2009
2182009
Using complexity to protect elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Communications of the ACM 53 (11), 74-82, 2010
1902010
Dichotomy for voting systems
E Hemaspaandra, LA Hemaspaandra
Journal of Computer and System Sciences 73 (1), 73-83, 2007
1492007
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
Information and Computation 209 (2), 89-107, 2011
1452011
The boolean hierarchy II: Applications
JY Cai, T Gundermann, J Hartmanis, LA Hemachandra, V Sewelson, ...
SIAM Journal on Computing 18 (1), 95-111, 1989
1391989
Multimode control attacks on elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Journal of Artificial Intelligence Research 40, 305-351, 2011
1362011
A complexity theory for feasible closure properties
M Ogiwara, LA Hemachandra
Journal of Computer and System Sciences 46 (3), 295-325, 1993
1351993
A richer understanding of the complexity of election systems
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
Fundamental problems in computing, 375-406, 2009
1282009
Complexity classes without machines: On complete languages for UP
J Hartmanis, LA Hemachandra
Theoretical Computer Science 58 (1-3), 129-142, 1988
1231988
On the power of parity polynomial time
JY Cai, LA Hemachandra
Mathematical Systems Theory 23 (1), 95-106, 1990
1151990
The complexity of manipulative attacks in nearly single-peaked electorates
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Artificial Intelligence 207, 69-99, 2014
1012014
The complexity of bribery in elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
AAAI 6, 641-646, 2006
1012006
Threshold computation and cryptographic security
Y Han, LA Hemaspaandra, T Thierauf
SIAM Journal on Computing 26 (1), 59-78, 1997
1011997
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20