Laszlo Babai 个人学术档案 - 学术资源搜索

引用次数

	总计	2019 年至今
引用	20106	5037
h 指数	63	33
i10 指数	168	80

980

490

245

735

198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202455 57 66 98 93 209 276 258 289 373 353 324 373 394 422 325 362 340 387 399 436 507 482 549 596 557 655 610 688 707 670 837 776 869 888 830 797 903 967 651

开放获取的出版物数量

查看全部

4 篇文章

0 篇文章

可查看的文章

无法查看的文章

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

合著作者

Peter FranklHungarian Academy of Sciences在 renyi.mta.hu 的电子邮件经过验证
Lance FortnowIllinois Institute of Technology在 iit.edu 的电子邮件经过验证
Mario SzegedyProfessor of Computer Science, Rutgers University在 cs.rutgers.edu 的电子邮件经过验证
Noga AlonPrinceton University and Tel Aviv University在 tau.ac.il 的电子邮件经过验证
shlomo moranCS Department, Technion, Israel在 cs.technion.ac.il 的电子邮件经过验证
László PyberSenior Research Fellow , Rényi Institute of Mathematics在 renyi.hu 的电子邮件经过验证
Sanjeev AroraProfessor of Computer Science, Princeton University在 cs.princeton.edu 的电子邮件经过验证
Noam NisanProfessor of Computer Science, Hebrew University of Jerusalem在 cs.huji.ac.il 的电子邮件经过验证
Paul ErdősMathematics
Peter CameronProfessor of Mathematics, University of St Andrews在 st-andrews.ac.uk 的电子邮件经过验证
Leonid A. Levin在 bu.edu 的电子邮件经过验证
Thomas P. HayesAssociate Professor, Dept of Computer Science and Engineering, University at Buffalo在 buffalo.edu 的电子邮件经过验证
Lajos RónyaiBME, SZTAKI在 ilab.sztaki.hu 的电子邮件经过验证
Gabor IvanyosSZTAKI - Institute for Computer Science and Control在 sztaki.hu 的电子邮件经过验证
Paolo CodenottiGoogle Inc.在 google.com 的电子邮件经过验证
Youming QiaoUniversity of Technology Sydney在 uts.edu.au 的电子邮件经过验证
Janos SimonProfessor of Computer Science, The University of Chicago在 cs.uchicago.edu 的电子邮件经过验证
John WilmesBrandeis University在 brandeis.edu 的电子邮件经过验证
Ronald GrahamProfessor of Mathematics and Computer Science, UC San Diego在 ucsd.edu 的电子邮件经过验证
Jin-Yi CaiUniversity of Wisconsin - Madison在 cs.wisc.edu 的电子邮件经过验证

关注

Laszlo Babai

University of Chicago

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

discrete mathematics algorithms complexity theory finite groups


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
On Lovász’lattice reduction and the nearest lattice point problem L Babai Combinatorica 6, 1-13, 1986	1436	1986
Trading group theory for randomness L Babai Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985	1178	1985
Non-deterministic exponential time has two-prover interactive protocols L Babai, L Fortnow, C Lund Computational complexity 1, 3-40, 1991	1040	1991
A fast and simple randomized parallel algorithm for the maximal independent set problem N Alon, L Babai, A Itai Journal of algorithms 7 (4), 567-583, 1986	980	1986
Graph isomorphism in quasipolynomial time L Babai Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	977	2016
Checking computations in polylogarithmic time L Babai, L Fortnow, LA Levin, M Szegedy Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991	843	1991
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes L Babai, S Moran Journal of Computer and System Sciences 36 (2), 254-276, 1988	778	1988
The hardness of approximate optima in lattices, codes, and systems of linear equations S Arora, L Babai, J Stern, Z Sweedyk Journal of Computer and System Sciences 54 (2), 317-331, 1997	619	1997
Canonical labeling of graphs L Babai, EM Luks Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983	601	1983
Complexity classes in communication complexity theory L Babai, P Frankl, J Simon 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), 337-347, 1986	480	1986
Random graph isomorphism L Babai, P Erdos, SM Selkow SIaM Journal on computing 9 (3), 628-635, 1980	460	1980
BPP has subexponential time simulations unless EXPTIME has publishable proofs L aszl o Babai, L Fortnow, N Nisan, A Wigderson Computational Complexity 3 (4), 307-318, 1993	429	1993
Automorphism groups, isomorphism, reconstruction L Babai Handbook of Combinatorics (vol. 2), 1447-1540, 1996	398	1996
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs L Babai, N Nisant, M Szegedy Journal of Computer and System Sciences 45 (2), 204-232, 1992	326	1992
Linear algebra methods in combinatorics: with applications to geometry and computer science L Babai, P Frankl Department of Computer Science, univ. of Chicag, 1992	316	1992
On the complexity of matrix group problems I L Babai, E Szemerédi 25th Annual Symposium onFoundations of Computer Science, 1984., 229-240, 1984	297	1984
Canonical labelling of graphs in linear average time L Babai, L Kucera 20th annual symposium on foundations of computer science (sfcs 1979), 39-46, 1979	295	1979
Spectra of Cayley graphs L Babai Journal of Combinatorial Theory, Series B 27 (2), 180-189, 1979	280	1979
Isomorphism of graphs with bounded eigenvalue multiplicity L Babai, DY Grigoryev, DM Mount Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982	276	1982
Monte-Carlo algorithms in graph isomorphism testing L Babai Université tde Montréal Technical Report, DMS, 1979	255	1979

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

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用