Volgen
Lane A. Hemaspaandra (premarriage name: Hemachandra)
Lane A. Hemaspaandra (premarriage name: Hemachandra)
Professor of Computer Science, University of Rochester
Geverifieerd e-mailadres voor cs.rochester.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
2881987
Anyone but him: The complexity of precluding an alternative
E Hemaspaandra, LA Hemaspaandra, J Rothe
Artificial Intelligence 171 (5-6), 255-285, 2007
2812007
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
2651988
How hard is bribery in elections?
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Journal of artificial intelligence research 35, 485-532, 2009
2642009
The complexity theory companion
LA Hemaspaandra, M Ogihara
Acm Sigact News 32 (4), 66-68, 2001
2562001
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
2552009
The strong exponential hierarchy collapses
LA Hemachandra
Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987
2551987
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
2461997
Using complexity to protect elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Communications of the ACM 53 (11), 74-82, 2010
2092010
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
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and …, 2009
1712009
Dichotomy for voting systems
E Hemaspaandra, LA Hemaspaandra
Journal of Computer and System Sciences 73 (1), 73-83, 2007
1562007
A complexity theory for feasible closure properties
M Ogiwara, LA Hemachandra
Journal of Computer and System Sciences 46 (3), 295-325, 1993
1561993
Multimode control attacks on elections
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Journal of Artificial Intelligence Research 40, 305-351, 2011
1472011
The boolean hierarchy II: Applications
JY Cai, T Gundermann, J Hartmanis, LA Hemachandra, V Sewelson, ...
SIAM Journal on Computing 18 (1), 95-111, 1989
1471989
A richer understanding of the complexity of election systems
P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe
Fundamental problems in computing: Essays in honor of Professor Daniel J …, 2009
1342009
Complexity classes without machines: On complete languages for UP
J Hartmanis, LA Hemachandra
Theoretical Computer Science 58 (1-3), 129-142, 1988
1331988
Threshold computation and cryptographic security
Y Han, LA Hemaspaandra, T Thierauf
SIAM Journal on Computing 26 (1), 59-78, 1997
1191997
The satanic notations: counting classes beyond# P and other definitional adventures
LA Hemaspaandra, H Vollmer
ACM SIGACT News 26 (1), 2-13, 1995
1181995
On the power of parity polynomial time
JY Cai, LA Hemachandra
Mathematical Systems Theory 23, 95-106, 1990
1171990
The complexity of manipulative attacks in nearly single-peaked electorates
P Faliszewski, E Hemaspaandra, LA Hemaspaandra
Proceedings of the 13th conference on theoretical aspects of rationality and …, 2011
1162011
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20