Lane A. Hemaspaandra (premarriage name: Hemachandra)

Cited by

	All	Since 2015
Citations	7845	1841
h-index	45	24
i10-index	147	44

380

190

285

198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202025 85 104 127 113 176 198 160 205 173 222 227 212 169 111 104 121 157 376 209 273 315 303 284 259 364 291 334 354 368 367 225 253 271

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
Alan SelmanProfessor emeritus of computer science and engineering, University at BuffaloVerified email at buffalo.edu
Marius ZimandProfessor of Computer Science, Towson UniversityVerified email at towson.edu
Leen TorenvlietILLC University of AmsterdamVerified email at uva.nl
Christopher HomanRochester Institute of TechnologyVerified email at cs.rit.edu
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Ashish NaikGoogleVerified email at google.com
Richard BeigelTemple UniversityVerified email at temple.edu
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
Venkatesan ChakaravarthyIBM Research, BangaloreVerified email at in.ibm.com
Sanjay JainProfessor of Computer Science, National University of SingaporeVerified email at comp.nus.edu.sg
Zack FitzsimmonsAssistant Professor, College of the Holy CrossVerified email at holycross.edu
Markus BrillTU BerlinVerified email at tu-berlin.de
Judy GoldsmithUniversity of KentuckyVerified email at cs.uky.edu
Abbas El GamalElectrical Engineering, Stanford UniversityVerified email at ee.stanford.edu

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	256	1987
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	250	1988
Anyone but him: The complexity of precluding an alternative E Hemaspaandra, LA Hemaspaandra, J Rothe Artificial Intelligence 171 (5-6), 255-285, 2007	248	2007
The strong exponential hierarchy collapses LA Hemachandra Journal of Computer and System Sciences 39 (3), 299-322, 1989	237	1989
How hard is bribery in elections? P Faliszewski, E Hemaspaandra, LA Hemaspaandra Journal of artificial intelligence research 35, 485-532, 2009	230	2009
The complexity theory companion LA Hemaspaandra, M Ogihara Springer Science & Business Media, 2013	222	2013
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	221	1997
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	218	2009
Using complexity to protect elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Communications of the ACM 53 (11), 74-82, 2010	190	2010
Dichotomy for voting systems E Hemaspaandra, LA Hemaspaandra Journal of Computer and System Sciences 73 (1), 73-83, 2007	149	2007
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	145	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	139	1989
Multimode control attacks on elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Journal of Artificial Intelligence Research 40, 305-351, 2011	136	2011
A complexity theory for feasible closure properties M Ogiwara, LA Hemachandra Journal of Computer and System Sciences 46 (3), 295-325, 1993	135	1993
A richer understanding of the complexity of election systems P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe Fundamental problems in computing, 375-406, 2009	128	2009
Complexity classes without machines: On complete languages for UP J Hartmanis, LA Hemachandra Theoretical Computer Science 58 (1-3), 129-142, 1988	123	1988
On the power of parity polynomial time JY Cai, LA Hemachandra Mathematical Systems Theory 23 (1), 95-106, 1990	115	1990
The complexity of manipulative attacks in nearly single-peaked electorates P Faliszewski, E Hemaspaandra, LA Hemaspaandra Artificial Intelligence 207, 69-99, 2014	101	2014
The complexity of bribery in elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra AAAI 6, 641-646, 2006	101	2006
Threshold computation and cryptographic security Y Han, LA Hemaspaandra, T Thierauf SIAM Journal on Computing 26 (1), 59-78, 1997	101	1997

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

Upload PDF

Follow this author

Cited by

Co-authors