Lane A. Hemaspaandra (premarriage name: Hemachandra) 个人学术档案

引用次数

	总计	2019 年至今
引用	8558	1324
h 指数	46	18
i10 指数	146	38

380

190

285

1987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202446 74 86 152 118 162 201 160 203 210 202 224 215 163 132 97 145 184 380 206 259 281 276 294 255 367 283 312 342 341 327 222 229 266 241 244 242 102

开放获取的出版物数量

查看全部

45 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Jörg RotheProfessor of Computer Science, Heinrich-Heine-Universität Düsseldorf在 cs.uni-duesseldorf.de 的电子邮件经过验证
Mitsunori OgiharaUniversity of Miami在 cs.miami.edu 的电子邮件经过验证
Piotr FaliszewskiAGH University of Science and Technology在 agh.edu.pl 的电子邮件经过验证
Jin-Yi CaiUniversity of Wisconsin - Madison在 cs.wisc.edu 的电子邮件经过验证
Osamu WatanabeTokyo Institute of Technology在 c.titech.ac.jp 的电子邮件经过验证
Leen TorenvlietILLC University of Amsterdam (retired)在 uva.nl 的电子邮件经过验证
Marius ZimandProfessor of Computer Science, Towson University在 towson.edu 的电子邮件经过验证
Christopher HomanRochester Institute of Technology在 cs.rit.edu 的电子邮件经过验证
Eric AllenderRutgers University在 cs.rutgers.edu 的电子邮件经过验证
Ashish NaikGoogle在 google.com 的电子邮件经过验证
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität Hannover在 thi.uni-hannover.de 的电子邮件经过验证
Felix BrandtProfessor of Computer Science, Technische Universität München在 in.tum.de 的电子邮件经过验证
Richard BeigelTemple University在 temple.edu 的电子邮件经过验证
Sanjay JainProfessor of Computer Science, National University of Singapore在 comp.nus.edu.sg 的电子邮件经过验证
Venkatesan ChakaravarthyIBM Research, Bangalore在 in.ibm.com 的电子邮件经过验证
Markus BrillUniversity of Warwick在 warwick.ac.uk 的电子邮件经过验证
Abbas El GamalElectrical Engineering, Stanford University在 ee.stanford.edu 的电子邮件经过验证
Judy GoldsmithUniversity of Kentucky在 cs.uky.edu 的电子邮件经过验证
David E. NarváezPostdoctoral Associate, Bradley Department of Electrical and Computer Engineering, Virginia Tech在 computer.org 的电子邮件经过验证
Sven KosubDepartment of Computer & Information Science, University of Konstanz在 uni-konstanz.de 的电子邮件经过验证

关注

Lane A. Hemaspaandra (premarriage name: Hemachandra)

Professor of Computer Science, University of Rochester

在 cs.rochester.edu 的电子邮件经过验证 - 首页

Computational Social Choice Computational Complexity Theory Algorithms


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	292	1987
Anyone but him: The complexity of precluding an alternative E Hemaspaandra, LA Hemaspaandra, J Rothe Artificial Intelligence 171 (5-6), 255-285, 2007	288	2007
How hard is bribery in elections? P Faliszewski, E Hemaspaandra, LA Hemaspaandra Journal of artificial intelligence research 35, 485-532, 2009	284	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	267	1988
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	259	2009
The complexity theory companion LA Hemaspaandra, M Ogihara Springer Science & Business Media, 2013	258	2013
The strong exponential hierarchy collapses LA Hemachandra Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987	257	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	249	1997
Using complexity to protect elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Communications of the ACM 53 (11), 74-82, 2010	216	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	160	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	146	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	135	2009
The satanic notations: counting classes beyond# P and other definitional adventures LA Hemaspaandra, H Vollmer ACM SIGACT News 26 (1), 2-13, 1995	126	1995
Threshold computation and cryptographic security Y Han, LA Hemaspaandra, T Thierauf SIAM Journal on Computing 26 (1), 59-78, 1997	121	1997
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
On the power of parity polynomial time JY Cai, LA Hemachandra Mathematical Systems Theory 23, 95-106, 1990	120	1990

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用