关注
Ely Porat (אלי פורת)
Ely Porat (אלי פורת)
Bar-Ilan University
在 cs.biu.ac.il 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Iteration-Free quantum approximate optimization algorithm using neural networks
O Amosy, T Danzig, O Lev, E Porat, G Chechik, A Makmal
Quantum Machine Intelligence 6 (2), 38, 2024
102024
An Improved Algorithm for The k-Dyck Edit Distance Problem
D Fried, S Golan, T Kociumaka, T Kopelowitz, E Porat, T Starikovskaya
ACM Transactions on Algorithms 20 (3), 1-25, 2024
102024
String Factorization via Prefix Free Families
M Kraus, M Lewenstein, A Popa, E Porat, Y Sadia
34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023), 2023
2023
Small-space and streaming pattern matching with edits
T Kociumaka, E Porat, T Starikovskaya
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
172022
Partial Permutations Comparison, Maintenance and Applications
A Levy, E Porat, BR Shalom
33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), 2022
2022
Support optimality and adaptive cuckoo filters
T Kopelowitz, S McCauley, E Porat
Workshop on Algorithms and Data Structures, 556-570, 2021
92021
Incremental edge orientation in forests
MA Bender, T Kopelowitz, W Kuszmaul, E Porat, C Stein
arXiv preprint arXiv:2107.02318, 2021
22021
Avoiding flow size overestimation in Count-Min sketch with Bloom filter constructions
O Rottenstreich, P Reviriego, E Porat, S Muthukrishnan
IEEE Transactions on Network and Service Management 18 (3), 3662-3676, 2021
122021
Online recognition of dictionary with one gap
A Amir, A Levy, E Porat, BR Shalom
Information and Computation 275, 104633, 2020
62020
An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States
S Ben-Nun, T Kopelowitz, M Kraus, E Porat
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
262020
Improved Circular -Mismatch Sketches
S Golan, T Kociumaka, T Kopelowitz, E Porat, P Uznański
arXiv preprint arXiv:2006.13673, 2020
12020
Approximating text-to-pattern Hamming distances
TM Chan, S Golan, T Kociumaka, T Kopelowitz, E Porat
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
222020
The streaming k-mismatch problem: Tradeoffs between space and total time
S Golan, T Kociumaka, T Kopelowitz, E Porat
arXiv preprint arXiv:2004.12881, 2020
92020
Constructions and applications for accurate counting of the bloom filter false positive free zone
O Rottenstreich, P Reviriego, E Porat, S Muthukrishnan
Proceedings of the Symposium on SDN Research, 135-145, 2020
142020
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
Locally consistent parsing for text indexing in small space
O Birenzwige, S Golan, E Porat
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
332020
-APSP and (min,max)-Product Problems
H Barr, T Kopelowitz, E Porat, L Roditty
arXiv preprint arXiv:1911.06132, 2019
52019
Approximate cover of strings
A Amir, A Levy, R Lubin, E Porat
Theoretical Computer Science 793, 59-69, 2019
212019
On the hardness of set disjointness and set intersection with bounded universe
I Goldstein, M Lewenstein, E Porat
arXiv preprint arXiv:1910.00831, 2019
102019
The strong 3SUM-INDEXING conjecture is false
T Kopelowitz, E Porat
arXiv preprint arXiv:1907.11206, 2019
152019
系统目前无法执行此操作，请稍后再试。
文章 1–20