Ely Porat (אלי פורת) 个人学术档案

引用次数

	总计	2019 年至今
引用	4626	2030
h 指数	36	22
i10 指数	111	61

460

230

115

345

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202415 26 40 40 64 75 129 146 132 142 217 206 309 292 307 380 378 450 304 357 351 187

开放获取的出版物数量

查看全部

29 篇文章

1 篇文章

可查看的文章

无法查看的文章

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

合著作者

Amihood AmirProfessor of Computer Science, Bar Ilan University在 cs.biu.ac.il 的电子邮件经过验证
Moshe LewensteinProfessor of Computer Science, Bar-Ilan University在 cs.biu.ac.il 的电子邮件经过验证
Tsvi KopelowitzBar Ilan University在 biu.ac.il 的电子邮件经过验证
Avivit LevyAssociate professor of Computer Science, Shenkar College在 shenkar.ac.il 的电子邮件经过验证
Raphael CliffordUniversity of Bristol在 cs.bris.ac.uk 的电子邮件经过验证
Seth PettieProfessor of Computer Science and Engineering, University of Michigan在 umich.edu 的电子邮件经过验证
Klim EfremenkoComputer Science Ben- Gurion University在 cs.bgu.ac.il 的电子邮件经过验证
Atri RudraKatherine Johnson Chair in AI, Professor, CSE, University at Buffalo在 buffalo.edu 的电子邮件经过验证
Hung Q. NgoRelationalAI在 relational.ai 的电子邮件经过验证
Yoram BachrachDeepMind在 google.com 的电子邮件经过验证
Shay GolanPostdoc, EECS, University of California, Berkeley在 berkeley.edu 的电子邮件经过验证
Yonatan AumannProfessor of Computer Science, Bar Ilan University在 cs.biu.ac.il 的电子邮件经过验证
Tomasz KociumakaMax Planck Institute for Informatics, Saarland Informatics Campus在 mpi-inf.mpg.de 的电子邮件经过验证
Richard ColeProfessor of Computer Science, Courant Institute, New York University在 cs.nyu.edu 的电子邮件经过验证
Christopher RéComputer Science, Stanford University在 cs.stanford.edu 的电子邮件经过验证
Tatiana StarikovskayaEcole Normale Supérieure在 ens.fr 的电子邮件经过验证
Shachar LovettAssociate Professor of Computer Science, University of California San Diego在 eng.ucsd.edu 的电子邮件经过验证
Haim KaplanSchool of Computer Science, Tel Aviv University在 post.tau.ac.il 的电子邮件经过验证
Piotr IndykProfessor of Electrical Engineering and Computer Science, MIT在 mit.edu 的电子邮件经过验证
Stephen AlstrupUniversity of Copenhagen (in start-ups on/off since 2003 )在 di.ku.dk 的电子邮件经过验证

关注

Ely Porat (אלי פורת)

Bar-Ilan University

在 cs.biu.ac.il 的电子邮件经过验证 - 首页

Algorithm Data Structure


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Worst-case optimal join algorithms HQ Ngo, E Porat, C Ré, A Rudra Journal of the ACM (JACM) 65 (3), 1-40, 2018	401	2018
Faster algorithms for string matching with k mismatches A Amir, M Lewenstein, E Porat Journal of Algorithms 50 (2), 257-275, 2004	274	2004
Explicit non-adaptive combinatorial group testing schemes E Porat, A Rothschild Automata, Languages and Programming, 748-759, 2008	239	2008
Higher lower bounds from the 3SUM conjecture T Kopelowitz, S Pettie, E Porat Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016	183	2016
Approximate sparse recovery: optimizing time and measurements AC Gilbert, Y Li, E Porat, MJ Strauss Proceedings of the forty-second ACM symposium on Theory of computing, 475-484, 2010	131	2010
Exact and approximate pattern matching in the streaming model B Porat, E Porat 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 315-323, 2009	103	2009
Fast moment estimation in data streams in optimal space DM Kane, J Nelson, E Porat, DP Woodruff Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	102	2011
Efficiently decodable error-correcting list disjunct matrices and applications HQ Ngo, E Porat, A Rudra Automata, Languages and Programming: 38th International Colloquium, ICALP …, 2011	88	2011
Weight distribution and list-decoding size of reed–muller codes T Kaufman, S Lovett, E Porat IEEE transactions on information theory 58 (5), 2689-2696, 2012	86	2012
Overlap matching A Amir, R Cole, R Hariharan, M Lewenstein, E Porat Information and Computation 181 (1), 57-74, 2003	86	2003
An optimal Bloom filter replacement based on matrix solving E Porat Computer Science-Theory and Applications: Fourth International Computer …, 2009	83	2009
Fast set intersection and two-patterns matching H Cohen, E Porat Theoretical Computer Science 411 (40-42), 3795-3800, 2010	81	2010
The k-mismatch problem revisited R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016	62	2016
Pattern matching with address errors: rearrangement distances A Amir, Y Aumann, G Benson, A Levy, O Lipsky, E Porat, S Skiena, ... Journal of Computer and System Sciences 75 (6), 359-370, 2009	58	2009
Function matching: Algorithms, applications, and a lower bound A Amir, Y Aumann, R Cole, M Lewenstein, E Porat International Colloquium on Automata, Languages, and Programming, 929-942, 2003	54	2003
Orienting fully dynamic graphs with worst-case time bounds T Kopelowitz, R Krauthgamer, E Porat, S Solomon Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014	53	2014
Fast computation of a longest increasing subsequence and application M Crochemore, E Porat Information and computation 208 (9), 1054-1059, 2010	52	2010
Pattern matching with don't cares and few errors R Clifford, K Efremenko, E Porat, A Rothschild Journal of Computer and System Sciences 76 (2), 115-124, 2010	51	2010
Approximate Matching in the L ₁ Metric A Amir, O Lipsky, E Porat, J Umanski Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island …, 2005	50	2005
Conditional lower bounds for space/time tradeoffs I Goldstein, T Kopelowitz, M Lewenstein, E Porat Algorithms and Data Structures: 15th International Symposium, WADS 2017, St …, 2017	48	2017

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

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用