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

引用次数

	总计	2019 年至今
引用	4653	2055
h 指数	36	22
i10 指数	111	62

460

230

115

345

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202415 26 40 40 64 75 129 146 132 142 217 206 310 293 307 380 378 450 303 356 351 214

开放获取的出版物数量

查看全部

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


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
(Near) optimal resource-competitive broadcast with jamming S Gilbert, V King, S Pettie, E Porat, J Saia, M Young Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and …, 2014	21*	2014
-APSP and (min,max)-Product Problems H Barr, T Kopelowitz, E Porat, L Roditty arXiv preprint arXiv:1911.06132, 2019	5	2019
103 Constraint satisfaction with bounded treewidth revisited M Samer, S Szeider, R Clifford, K Efremenko, E Porat, A Rothschild, ...
24th Annual European Symposium on Algorithms (ESA 2016) L Georgiadis, GF Italiano, N Parotsidis, O Svensson, M Abolhassani, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2016		2016
27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016) Y Tanimura, A Ganguly, WK Hon, K Sadakane, R Shah, SV Thankachan, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2016		2016
27th International Symposium on Algorithms and Computation (ISAAC 2016) X Lin, K Park, A Abdullah, S Daruki, CD Roy, S Venkatasubramanian, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2016		2016
31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020) T Husfeldt, M Alzamel, A Conte, S Denzumi, R Grossi, CS Iliopoulos, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020		2020
3sum hardness in (dynamic) data structures T Kopelowitz, S Pettie, E Porat CoRR, abs/1407.6756, 2014	14	2014
A black box for online approximate pattern matching R Clifford, K Efremenko, B Porat, E Porat Information and Computation 209 (4), 731-736, 2011	31	2011
A cuckoo hashing variant with improved memory utilization and insertion time E Porat, B Shalem 2012 Data Compression Conference, 347-356, 2012	14	2012
A faster implementation of the Goemans-Williamson clustering algorithm R Cole, R Hariharan, M Lewenstein, E Porat Symposium on Discrete Algorithms: Proceedings of the twelfth annual ACM-SIAM …, 2001	45	2001
A filtering algorithm for k-mismatch with don't cares R Clifford, E Porat Information Processing Letters 110 (22), 1021-1025, 2010	11	2010
A Filtering Algorithm for k-Mismatch with Don’t Cares R Clifford, E Porat String Processing and Information Retrieval: 14th International Symposium …, 2007	12	2007
A grouping approach for succinct dynamic dictionary matching G Feigenblat, E Porat, A Shiftan Algorithmica 77, 134-150, 2017	6	2017
A lower bound for dynamic approximate membership data structures S Lovett, E Porat 2010 IEEE 51st Annual symposium on foundations of computer science, 797-804, 2010	27	2010
A PTAS for the Square Tiling Problem A Amir, A Apostolico, GM Landau, E Porat, OS Shalom Theoretical Computer Science 562, 33-45, 2015		2015
A simple algorithm for approximating the text-to-pattern hamming distance T Kopelowitz, E Porat 1st Symposium on Simplicity in Algorithms (SOSA 2018), 2018	24	2018
A space lower bound for dynamic approximate membership data structures S Lovett, E Porat SIAM Journal on Computing 42 (6), 2182-2196, 2013	5	2013
Addendum to'Exponential time improvement for min-wise based algorithms' Information and Computation 209 (2011) 737-747 G Feigenblat, E Porat, A Shiftan Information and Computation 251 (C), 361, 2016		2016
Alexander Below, Jesús A. De Loera, and Jürgen Richter-Gebert. The complexity of S Vishwanathan, W Evans, D Kirkpatrick, M Andrews, A Amir, ... Journal of Algorithms 50, 132, 2004		2004

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

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用