关注
Ely Porat (אלי פורת)
Ely Porat (אלי פורת)
在 cs.biu.ac.il 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Worst-case optimal join algorithms
HQ Ngo, E Porat, C Ré, A Rudra
Journal of the ACM (JACM) 65 (3), 1-40, 2018
2842018
Faster algorithms for string matching with k mismatches
A Amir, M Lewenstein, E Porat
Journal of Algorithms 50 (2), 257-275, 2004
2672004
Explicit nonadaptive combinatorial group testing schemes
E Porat, A Rothschild
IEEE Transactions on Information Theory 57 (12), 7982-7989, 2011
2032011
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
1372016
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
1232010
Explicit non-adaptive combinatorial group testing schemes
E Porat, A Rothschild
Automata, Languages and Programming, 748-759, 2008
1222008
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
1002009
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
902011
Overlap matching
A Amir, R Cole, R Hariharan, M Lewenstein, E Porat
Information and Computation 181 (1), 57-74, 2003
792003
Efficiently decodable error-correcting list disjunct matrices and applications
HQ Ngo, E Porat, A Rudra
International Colloquium on Automata, Languages, and Programming, 557-568, 2011
732011
An optimal Bloom filter replacement based on matrix solving
E Porat
International Computer Science Symposium in Russia, 263-273, 2009
702009
Fast set intersection and two-patterns matching
H Cohen, E Porat
Theoretical Computer Science 411 (40-42), 3795-3800, 2010
682010
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
622012
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
562016
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
562009
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
522003
Approximate Matching in the L1 Metric
A Amir, O Lipsky, E Porat, J Umanski
Annual Symposium on Combinatorial Pattern Matching, 91-103, 2005
492005
Fast computation of a longest increasing subsequence and application
M Crochemore, E Porat
Information and computation 208 (9), 1054-1059, 2010
482010
Sublinear time, measurement-optimal, sparse recovery for all
E Porat, MJ Strauss
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
472012
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
472010
系统目前无法执行此操作,请稍后再试。
文章 1–20