Lane A. Hemaspaandra (premarriage name: Hemachandra)
Lane A. Hemaspaandra (premarriage name: Hemachandra)
Professor of Computer Science, University of Rochester
Verified email at cs.rochester.edu - Homepage
Title
Cited by
Cited by
Year
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
2511988
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
2431987
Anyone but him: The complexity of precluding an alternative
E Hemaspaandra, LA Hemaspaandra, J Rothe
Artificial Intelligence 171 (5-6), 255-285, 2007
2392007
The strong exponential hierarchy collapses
LA Hemachandra
Journal of Computer and System Sciences 39 (3), 299-322, 1989
2261989
The complexity theory companion
LA Hemaspaandra, M Ogihara
Springer Science & Business Media, 2013
2202013
How hard is bribery in elections?
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Journal of Artificial Intelligence Research 35, 485-532, 2009
2162009
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
2132009
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
2101997
Using complexity to protect elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Communications of the ACM 53 (11), 74-82, 2010
1872010
The boolean hierarchy II: Applications
JY Cai, T Gundermann, J Hartmanis, LA Hemachandra, V Sewelson, ...
SIAM Journal on Computing 18 (1), 95-111, 1989
1421989
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
1392011
Dichotomy for voting systems
E Hemaspaandra, LA Hemaspaandra
Journal of Computer and System Sciences 73 (1), 73-83, 2007
1392007
A complexity theory for feasible closure properties
M Ogiwara, LA Hemachandra
Journal of Computer and System Sciences 46 (3), 295-325, 1993
1341993
Multimode control attacks on elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Journal of Artificial Intelligence Research 40, 305-351, 2011
1332011
A richer understanding of the complexity of election systems
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
Fundamental problems in computing, 375-406, 2009
1252009
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
1131990
The complexity of bribery in elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
AAAI 6, 641-646, 2006
1002006
Threshold computation and cryptographic security
Y Han, LA Hemaspaandra, T Thierauf
SIAM Journal on Computing 26 (1), 59-78, 1997
1001997
The Boolean hierarchy: hardware over NP
J Cai, L Hemachandra
Structure in Complexity Theory, 105-124, 1986
981986
The system can't perform the operation now. Try again later.
Articles 1–20