Ely Porat (אלי פורת)
Ely Porat (אלי פורת)
Verified email at - Homepage
Cited by
Cited by
Worst-case optimal join algorithms
HQ Ngo, E Porat, C Ré, A Rudra
Journal of the ACM (JACM) 65 (3), 1-40, 2018
Faster algorithms for string matching with k mismatches
A Amir, M Lewenstein, E Porat
Journal of Algorithms 50 (2), 257-275, 2004
Explicit non-adaptive combinatorial group testing schemes
E Porat, A Rothschild
Automata, Languages and Programming, 748-759, 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
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
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
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
Efficiently decodable error-correcting list disjunct matrices and applications
HQ Ngo, E Porat, A Rudra
Automata, Languages and Programming: 38th International Colloquium, ICALP …, 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
Overlap matching
A Amir, R Cole, R Hariharan, M Lewenstein, E Porat
Information and Computation 181 (1), 57-74, 2003
An optimal Bloom filter replacement based on matrix solving
E Porat
Computer Science-Theory and Applications: Fourth International Computer …, 2009
Fast set intersection and two-patterns matching
H Cohen, E Porat
Theoretical Computer Science 411 (40-42), 3795-3800, 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
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
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
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
Fast computation of a longest increasing subsequence and application
M Crochemore, E Porat
Information and computation 208 (9), 1054-1059, 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
Approximate Matching in the L 1 Metric
A Amir, O Lipsky, E Porat, J Umanski
Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island …, 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
The system can't perform the operation now. Try again later.
Articles 1–20