‪Lane A. Hemaspaandra (premarriage name: Hemachandra)‬

Cited by

	All	Since 2019
Citations	8668	1379
h-index	46	19
i10-index	146	38

380

190

285

1987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202446 74 85 152 118 164 201 160 203 216 202 224 215 163 132 142 145 184 380 206 259 282 276 294 252 368 284 313 342 342 327 222 230 267 235 236 237 173

Public access

View all

46 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Jörg RotheProfessor of Computer Science, Heinrich-Heine-Universität DüsseldorfVerified email at cs.uni-duesseldorf.de
Mitsunori OgiharaUniversity of MiamiVerified email at cs.miami.edu
Piotr FaliszewskiAGH University of Science and TechnologyVerified email at agh.edu.pl
Jin-Yi CaiUniversity of Wisconsin - MadisonVerified email at cs.wisc.edu
Osamu WatanabeTokyo Institute of TechnologyVerified email at c.titech.ac.jp
Leen TorenvlietILLC University of Amsterdam (retired)Verified email at uva.nl
Marius ZimandProfessor of Computer Science, Towson UniversityVerified email at towson.edu
Christopher HomanRochester Institute of TechnologyVerified email at cs.rit.edu
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Ashish NaikGoogleVerified email at google.com
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverVerified email at thi.uni-hannover.de
Felix BrandtProfessor of Computer Science, Technische Universität MünchenVerified email at in.tum.de
Richard BeigelTemple UniversityVerified email at temple.edu
Sanjay JainProfessor of Computer Science, National University of SingaporeVerified email at comp.nus.edu.sg
Venkatesan ChakaravarthyIBM Research, BangaloreVerified email at in.ibm.com
Markus BrillUniversity of WarwickVerified email at warwick.ac.uk
Abbas El GamalElectrical Engineering, Stanford UniversityVerified email at ee.stanford.edu
Judy GoldsmithUniversity of KentuckyVerified email at cs.uky.edu
David E. NarváezPostdoctoral Associate, Bradley Department of Electrical and Computer Engineering, Virginia TechVerified email at computer.org
Sven KosubDepartment of Computer & Information Science, University of KonstanzVerified email at uni-konstanz.de

Lane A. Hemaspaandra (premarriage name: Hemachandra)

Professor of Computer Science, University of Rochester

Verified email at cs.rochester.edu - Homepage

Computational Social Choice Computational Complexity Theory Algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	293	1987
Anyone but him: The complexity of precluding an alternative E Hemaspaandra, LA Hemaspaandra, J Rothe Artificial Intelligence 171 (5-6), 255-285, 2007	291	2007
How hard is bribery in elections? P Faliszewski, E Hemaspaandra, LA Hemaspaandra Journal of artificial intelligence research 35, 485-532, 2009	287	2009
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	270	1988
The complexity theory companion LA Hemaspaandra, M Ogihara Springer Science & Business Media, 2013	263	2013
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	261	2009
The strong exponential hierarchy collapses LA Hemachandra Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987	259	1987
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	252	1997
Using complexity to protect elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Communications of the ACM 53 (11), 74-82, 2010	218	2010
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	178	2009
A complexity theory for feasible closure properties M Ogiwara, LA Hemachandra Journal of Computer and System Sciences 46 (3), 295-325, 1993	162	1993
Dichotomy for voting systems E Hemaspaandra, LA Hemaspaandra Journal of Computer and System Sciences 73 (1), 73-83, 2007	157	2007
Multimode control attacks on elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Journal of Artificial Intelligence Research 40, 305-351, 2011	151	2011
The boolean hierarchy II: Applications JY Cai, T Gundermann, J Hartmanis, LA Hemachandra, V Sewelson, ... SIAM Journal on Computing 18 (1), 95-111, 1989	147	1989
Complexity classes without machines: On complete languages for UP J Hartmanis, LA Hemachandra Theoretical Computer Science 58 (1-3), 129-142, 1988	143	1988
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	136	2009
The satanic notations: counting classes beyond# P and other definitional adventures LA Hemaspaandra, H Vollmer ACM SIGACT News 26 (1), 2-13, 1995	132	1995
Threshold computation and cryptographic security Y Han, LA Hemaspaandra, T Thierauf SIAM Journal on Computing 26 (1), 59-78, 1997	126	1997
On the power of parity polynomial time JY Cai, LA Hemachandra Mathematical Systems Theory 23, 95-106, 1990	122	1990
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	120	2011

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors