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

Citeret af

	Alle	Siden 2020
Henvisninger	8680	1206
h-index	46	18
i10-indeks	147	35

380

190

285

19871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202547 75 85 153 118 172 206 164 202 208 198 228 222 167 126 98 150 192 378 212 266 286 279 296 249 352 286 315 315 335 327 222 230 264 234 234 224 231 18

Offentlig adgang

Se alle

44 artikler

0 artikler

tilgængelige

ikke tilgængelige

Baseret på krav i forbindelse med finansiering

Medforfattere

Jörg RotheProfessor of Computer Science, Heinrich-Heine-Universität DüsseldorfVerificeret mail på cs.uni-duesseldorf.de
Mitsunori OgiharaUniversity of MiamiVerificeret mail på cs.miami.edu
Piotr FaliszewskiAGH University of Science and TechnologyVerificeret mail på agh.edu.pl
Jin-Yi CaiUniversity of Wisconsin - MadisonVerificeret mail på cs.wisc.edu
Osamu WatanabeTokyo Institute of TechnologyVerificeret mail på c.titech.ac.jp
Marius ZimandProfessor of Computer Science, Towson UniversityVerificeret mail på towson.edu
Leen TorenvlietILLC University of Amsterdam (retired)Verificeret mail på uva.nl
Eric AllenderRutgers UniversityVerificeret mail på cs.rutgers.edu
Christopher HomanRochester Institute of TechnologyVerificeret mail på cs.rit.edu
Ashish NaikGoogleVerificeret mail på google.com
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverVerificeret mail på thi.uni-hannover.de
Richard BeigelTemple UniversityVerificeret mail på temple.edu
Felix BrandtProfessor of Computer Science, Technische Universität MünchenVerificeret mail på in.tum.de
Sanjay JainProfessor of Computer Science, National University of SingaporeVerificeret mail på comp.nus.edu.sg
Venkatesan ChakaravarthyIBM Research, BangaloreVerificeret mail på in.ibm.com
Markus BrillUniversity of WarwickVerificeret mail på warwick.ac.uk
Abbas El GamalElectrical Engineering, Stanford UniversityVerificeret mail på ee.stanford.edu
David E. NarváezPostdoctoral Associate, Bradley Department of Electrical and Computer Engineering, Virginia TechVerificeret mail på computer.org
Judy GoldsmithUniversity of KentuckyVerificeret mail på cs.uky.edu
Sven KosubDepartment of Computer & Information Science, University of KonstanzVerificeret mail på uni-konstanz.de

Følg

Lane A. Hemaspaandra (premarriage name: Hemachandra)

Professor of Computer Science, University of Rochester

Verificeret mail på cs.rochester.edu - Startside

Computational Social Choice Computational Complexity Theory Algorithms


Titel Sortér efter henvisninger Sortér efter årstal Sortér efter titel	Citeret af Citeret af	År
Anyone but him: The complexity of precluding an alternative E Hemaspaandra, LA Hemaspaandra, J Rothe Artificial Intelligence 171 (5-6), 255-285, 2007	295	2007
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	294	1987
How hard is bribery in elections? P Faliszewski, E Hemaspaandra, LA Hemaspaandra Journal of artificial intelligence research 35, 485-532, 2009	288	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 strong exponential hierarchy collapses LA Hemachandra Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987	267	1987
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	265	2009
The complexity theory companion LA Hemaspaandra, M Ogihara Springer Science & Business Media, 2013	261	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	250	1997
Using complexity to protect elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Communications of the ACM 53 (11), 74-82, 2010	219	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	180	2009
A complexity theory for feasible closure properties M Ogiwara, LA Hemachandra Journal of Computer and System Sciences 46 (3), 295-325, 1993	161	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	153	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	148	1989
Complexity classes without machines: On complete languages for UP J Hartmanis, LA Hemachandra Theoretical Computer Science 58 (1-3), 129-142, 1988	141	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	138	2009
The satanic notations: counting classes beyond# P and other definitional adventures LA Hemaspaandra, H Vollmer ACM SIGACT News 26 (1), 2-13, 1995	136	1995
Threshold computation and cryptographic security Y Han, LA Hemaspaandra, T Thierauf SIAM Journal on Computing 26 (1), 59-78, 1997	129	1997
On the power of parity polynomial time JY Cai, LA Hemachandra Mathematical Systems Theory 23, 95-106, 1990	124	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	121	2011

Systemet kan ikke foretage handlingen nu. Prøv igen senere.

Artikler 1–20

Henvisninger pr. år

Dublerede henvisninger

Flettede henvisninger

Tilføj medforfattereMedforfattere

Følg

Citeret af

Medforfattere