Lane A. Hemaspaandra (premarriage name: Hemachandra)

引用先

	すべて	2017 年以来
引用	8044	1454
h 指標	45	21
i10 指標	146	38

400

200

100

300

19871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202222 80 100 130 111 165 195 162 211 188 206 226 204 152 180 91 128 165 386 194 256 303 281 288 249 362 242 322 345 334 333 224 218 267 244 167

オープンアクセス

すべて表示

37 件の論文

1 件の論文

利用可能

利用不可

助成機関の要件に基づく

共著者

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
Marius ZimandProfessor of Computer Science, Towson University確認したメールアドレス: towson.edu
Leen TorenvlietILLC University of Amsterdam確認したメールアドレス: uva.nl
Eric AllenderRutgers University確認したメールアドレス: cs.rutgers.edu
Christopher HomanRochester Institute of Technology確認したメールアドレス: cs.rit.edu
Ashish NaikGoogle確認したメールアドレス: google.com
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität Hannover確認したメールアドレス: thi.uni-hannover.de
Richard BeigelTemple University確認したメールアドレス: temple.edu
Felix BrandtProfessor of Computer Science, Technische Universität München確認したメールアドレス: in.tum.de
Venkatesan ChakaravarthyIBM Research, Bangalore確認したメールアドレス: in.ibm.com
Sanjay JainProfessor of Computer Science, National University of Singapore確認したメールアドレス: comp.nus.edu.sg
Markus BrillTU Berlin確認したメールアドレス: tu-berlin.de
Abbas El GamalElectrical Engineering, Stanford University確認したメールアドレス: ee.stanford.edu
Judy GoldsmithUniversity of Kentucky確認したメールアドレス: cs.uky.edu
Sven KosubDepartment of Computer & Information Science, University of Konstanz確認したメールアドレス: uni-konstanz.de
David E. NarváezUniversity of Rochester確認したメールアドレス: computer.org

フォロー

Lane A. Hemaspaandra (premarriage name: Hemachandra)

Professor of Computer Science, University of Rochester

確認したメールアドレス: cs.rochester.edu - ホームページ

Computational Social Choice Computational Complexity Theory Algorithms


タイトル引用回数順公開年順タイトル順	引用先引用先	年
Anyone but him: The complexity of precluding an alternative E Hemaspaandra, LA Hemaspaandra, J Rothe Artificial Intelligence 171 (5-6), 255-285, 2007	264	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	263	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	255	1988
The strong exponential hierarchy collapses LA Hemachandra Journal of Computer and System Sciences 39 (3), 299-322, 1989	247	1989
The complexity theory companion LA Hemaspaandra, M Ogihara Acm Sigact News 32 (4), 66-68, 2001	243	2001
How hard is bribery in elections? P Faliszewski, E Hemaspaandra, LA Hemaspaandra Journal of artificial intelligence research 35, 485-532, 2009	241	2009
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	239	2009
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	233	1997
Using complexity to protect elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Communications of the ACM 53 (11), 74-82, 2010	202	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 Information and Computation 209 (2), 89-107, 2011	160	2011
Dichotomy for voting systems E Hemaspaandra, LA Hemaspaandra Journal of Computer and System Sciences 73 (1), 73-83, 2007	152	2007
A complexity theory for feasible closure properties M Ogiwara, LA Hemachandra Journal of Computer and System Sciences 46 (3), 295-325, 1993	144	1993
The boolean hierarchy II: Applications JY Cai, T Gundermann, J Hartmanis, LA Hemachandra, V Sewelson, ... SIAM Journal on Computing 18 (1), 95-111, 1989	143	1989
Multimode control attacks on elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Journal of Artificial Intelligence Research 40, 305-351, 2011	142	2011
A richer understanding of the complexity of election systems P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe Fundamental problems in computing, 375-406, 2009	131	2009
Complexity classes without machines: On complete languages for UP J Hartmanis, LA Hemachandra Theoretical Computer Science 58 (1-3), 129-142, 1988	131	1988
Threshold computation and cryptographic security Y Han, LA Hemaspaandra, T Thierauf SIAM Journal on Computing 26 (1), 59-78, 1997	112	1997
On the power of parity polynomial time JY Cai, LA Hemachandra Mathematical Systems Theory 23 (1), 95-106, 1990	112	1990
The complexity of manipulative attacks in nearly single-peaked electorates P Faliszewski, E Hemaspaandra, LA Hemaspaandra Artificial Intelligence 207, 69-99, 2014	108	2014
The satanic notations: counting classes beyond# P and other definitional adventures LA Hemaspaandra, H Vollmer ACM SIGACT News 26 (1), 2-13, 1995	107	1995

現在システムで処理を実行できません。しばらくしてからもう一度お試しください。

論文 1–20

年間引用数

重複した引用

結合された引用

共著者を追加共著者

フォロー

引用先

共著者