Porat Ely

Research output

Research output per year 2011 2011 2012 2013 2016 2017 2024

• 67 Conference contribution
• 36 Article
• 5 Editorial
• 2 Comment/debate
• 4 More
  • 1 Anthology
  • 1 Paper
  • 1 Other contribution
  • 1 Preprint

Research output per year

Research output per year

Search results

• 2024

  An Improved Algorithm for The k-Dyck Edit Distance Problem

  Fried, D., Golan, S., Kociumaka, T., Kopelowitz, T., Porat, E. & Starikovskaya, T., 21 Jun 2024, In: ACM Transactions on Algorithms. 20, 3

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

• Iteration-Free quantum approximate optimization algorithm using neural networks

  Amosy, O., Danzig, T., Lev, O., Porat, E., Chechik, G. & Makmal, A., Dec 2024, In: Quantum Machine Intelligence. 6, 2, 38.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Approximate Algorithm 100%
  • Optimization Algorithm 83%
  • Neural Networks 73%
  • Iteration 51%
  • Initialization 48%
• 2020

  Online recognition of dictionary with one gap

  Amir, A., Levy, A., Porat, E. & Riva Shalom, B., Dec 2020, In: Information and Computation. 275, 104633.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  • Dictionary 100%
  • Glossaries 79%
  • Text 38%
  • Character 31%
  • String Matching 29%
• 2019

  Approximate cover of strings

  Amir, A., Levy, A., Lubin, R. & Porat, E., 12 Nov 2019, In: Theoretical Computer Science. 793, p. 59-69 11 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Strings 100%
  • Relaxation 92%
  • Cover 87%
  • Tiling 66%
  • NP-hard 38%

• Mind the Gap! Online Dictionary Matching with One Gap

  Amir, A., Kopelowitz, T., Levy, A., Pettie, S., Porat, E. & Shalom, B. R., 1 Jun 2019, In: Algorithmica. 81, 6, p. 2123-2157 35 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  • Dictionary 100%
  • Glossaries 79%
  • Text 38%
  • Character 31%
  • Degeneracy 28%

• Streaming Pattern Matching with d Wildcards

  Golan, S., Kopelowitz, T. & Porat, E., 15 May 2019, In: Algorithmica. 81, 5, p. 1988-2015 28 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  • Streaming 100%
  • Pattern Matching 94%
  • Pattern matching 84%
  • Character 57%
  • Monte Carlo Algorithm 22%
• 2018

  Worst-case Optimal Join Algorithms

  Ngo, H. Q., Porat, E., Ré, C. & Rudra, A., 13 Mar 2018, In: Journal of the ACM. 65, 3, 16.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Entropy 100%
  • Reaction Yield 49%
  • management systems 28%
  • entropy 14%
  • Geometry 12%
• 2017

  A Grouping Approach for Succinct Dynamic Dictionary Matching

  Feigenblat, G., Porat, E. & Shiftan, A., 1 Jan 2017, In: Algorithmica. 77, 1, p. 134-150 17 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  • Dictionary 100%
  • Grouping 93%
  • Byproducts 85%
  • Query 80%
  • Glossaries 79%

• d-k-min-wise independent family of hash functions

  Feigenblat, G., Porat, E. & Shiftan, A., 1 Mar 2017, In: Journal of Computer and System Sciences. 84, p. 171-184 14 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  • Hash Function 100%
  • Hash functions 95%
  • Independence 53%
  • Exponential time 43%
  • Family 38%

• For-all sparse recovery in near-optimal time

  Gilbert, A. C., Li, Y., Porat, E. & Strauss, M. J., Mar 2017, In: ACM Transactions on Algorithms. 13, 3, 32.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Recovery 100%
  • Hashing 58%
  • Decoding 25%
  • Encoding 22%
  • Network Coding 16%
• 2016

  Addendum to 'Exponential time improvement for min-wise based algorithms' [Information and Computation 209 (2011) 737-747]

  Feigenblat, G., Porat, E. & Shiftan, A., 1 Dec 2016, (Accepted/In press) In: Information and Computation. 251, p. 361

  Research output: Contribution to journal › Article › peer-review

  Open Access

• Exponential time improvement for min-wise based algorithms (vol 209, pg 737, 2011)

  Feigenblat, G., Porat, E. & Shiftan, A., Dec 2016, In: Information and Computation. 251, p. 361-361 1 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

• Identification of Parallel Passages Across a Large Hebrew/Aramaic Corpus

  Shmidman, A., Koppel, M. & Porat, E., 2016, (In preparation) In: arXiv preprint arXiv:1602.08715. 11 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

• Optimal In/Out TCAM Encodings of Ranges

  Rottenstreich, O., Keslassy, I., Hassidim, A., Kaplan, H. & Porat, E., Feb 2016, In: IEEE/ACM Transactions on Networking. 24, 1, p. 555-568 14 p., 7005545.

  Technion - Israel Institute of Technology, Tel Aviv University, Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  • Associative storage 100%
  • Computer hardware 7%

• Set Intersection and Sequence Matching with mismatch counting

  Shiftan, A. & Porat, E., 25 Jul 2016, In: Theoretical Computer Science. 638, p. 3-10 8 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Counting 100%
  • Text 90%
  • Intersection 86%
  • Matching Problem 86%
  • Failure Probability 52%

• The frequent items problem, under polynomial decay, in the streaming model (vol 411, pg 3048, 2010)

  Feigenblat, G., Itzhaki, O. & Porat, E., 4 Oct 2016, In: Theoretical Computer Science. 648, p. 116-116 1 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review
• 2015

  A PTAS for the Square Tiling Problem

  Amir, A., Apostolico, A., Landau, G. M., Porat, E. & Sar Shalom, O., 2015, In: Theoretical Computer Science. 562, C, p. 33-45 13 p.

  Bar-Ilan University, University of Haifa

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Polynomial Time Approximation Scheme 100%
  • Tiling 85%
  • NP-hard 78%
  • Polynomials 62%
  • Tile 44%

• Dictionary matching with a few gaps

  Amir, A., Levy, A., Porat, E. & Shalom, B. R., 19 Jul 2015, In: Theoretical Computer Science. 589, p. 34-46 13 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  • Dictionary 100%
  • Glossaries 79%
  • Query 46%
  • Preprocessing 40%
  • D-space 30%

• Efficient sampling of non-strict turnstile data streams

  Barkay, N., Porat, E. & Shalem, B., 26 Jul 2015, In: Theoretical Computer Science. 590, p. 106-117 12 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  • Data Streams 100%
  • Data streams 72%
  • Sampling 50%
  • Statistics 35%
  • Hash functions 27%

• Fingerprints for highly similar streams

  Bachrach, Y. & Porat, E., 12 Oct 2015, In: Information and Computation. 244, p. 113-121 9 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Fingerprint 100%
  • Similarity 58%
  • Sampling 48%
  • Confidence 12%
  • Multiplicative 9%
• 2014

  On the relationship between histogram indexing and block-mass indexing

  Amir, A., Butman, A. & Porat, E., 28 May 2014, In: Philosophical transactions. Series A, Mathematical, physical, and engineering sciences. 372, 2016, 20130132.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Indexing 100%
  • Histogram 92%
  • Pattern matching 90%
  • histograms 87%
  • Relationships 48%

• Range LCP

  Amir, A., Apostolico, A., Landau, G. M., Levy, A., Lewenstein, M. & Porat, E., Nov 2014, In: Journal of Computer and System Sciences. 80, 7, p. 1245-1253 9 p.

  Bar-Ilan University, University of Haifa

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Query 100%
  • Range of data 74%
  • Preprocessing 70%
  • Suffix 25%
  • Prefix 22%
• 2013

  A space lower bound for dynamic approximate membership data structures

  Lovett, S. & Porat, E., 2013, In: SIAM Journal on Computing. 42, 6, p. 2182-2196 15 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Data Structures 100%
  • Bloom Filter 93%
  • Data structures 80%
  • Lower bound 64%
  • False Positive 63%

• Pattern matching under polynomial transformation

  Butman, A., Clifford, P., Clifford, R., Jalsenius, M., Lewenstein, N., Porat, B., Porat, E. & Sach, B., 2013, In: SIAM Journal on Computing. 42, 2, p. 611-633 23 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Polynomial Transformation 100%
  • Pattern Matching 84%
  • Pattern matching 75%
  • Linear transformations 56%
  • Hamming distance 56%

• Preprocess, set, query!

  Porat, E. & Roditty, L., Dec 2013, In: Algorithmica. 67, 4, p. 516-528 13 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  • Query 100%
  • Stretch 91%
  • Data structures 83%
  • Oracle 53%
  • Data Structures 51%

• Sharing rewards in cooperative Connectivity games

  Bachrach, Y., Porat, E. & Rosenschein, J. S., 2013, In: Journal Of Artificial Intelligence Research. 47, p. 281-311 31 p.

  Bar-Ilan University, The Hebrew University of Jerusalem

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Polynomials 100%
  • Trees (mathematics) 49%
  • Communication 43%
  • Servers 31%
  • Testing 22%

• Space lower bounds for online pattern matching

  Clifford, R., Jalsenius, M., Porat, E. & Sach, B., 29 Apr 2013, In: Theoretical Computer Science. 483, p. 68-74 7 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Pattern Matching 100%
  • Pattern matching 89%
  • Lower bound 52%
  • Character 36%
  • Distance Function 33%
• 2012

  Approximate sparse recovery: Optimizing time and measurements

  Gilbert, A. C., Li, Y., Porat, E. & Strauss, M. J., 2012, In: SIAM Journal on Computing. 41, 2, p. 436-453 18 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Recovery 100%
  • Decoding 64%
  • Update 28%
  • Multiplication 24%
  • Polynomial approximation 22%

• Cycle detection and correction

  Amir, A., Eisenberg, E., Levy, A., Porat, E. & Shapira, N., Dec 2012, In: ACM Transactions on Algorithms. 9, 1, 13.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  • Cycle 100%
  • Metric 94%
  • Recovery 46%
  • Reed-Solomon Codes 21%
  • Swap 20%

• Mismatch Sampling

  Clifford, R., Efremenko, K., Porat, B., Porat, E. & Rothschild, A., 1 May 2012, In: Information and Computation. 214, p. 112-118 7 p.

  Weizmann Institute of Science, Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Hamming distance 100%
  • Hamming Distance 93%
  • Text 73%
  • Sampling 55%
  • Pattern Matching 50%

• Weight distribution and list-decoding size of reed-muller codes

  Kaufman, T., Lovett, S. & Porat, E., May 2012, In: IEEE Transactions on Information Theory. 58, 5, p. 2689-2696 8 p., 6142078.

  Bar-Ilan University, Weizmann Institute of Science

  Research output: Contribution to journal › Article › peer-review

  • Decoding 100%
  • coding 52%
  • Computer science 39%
  • Polynomials 30%
  • computer science 25%
• 2011

  A Black Box for Online Approximate Pattern Matching

  Clifford, R., Efremenko, K., Porat, B. & Porat, E., 1 Apr 2011, In: Information and Computation. 209, 4, p. 731-736 6 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Pattern Matching 100%
  • Black Box 90%
  • Pattern matching 89%
  • Character 60%
  • Text 36%

• Approximate pattern matching with the L ₁, L ₂ and L _∞ metrics

  Lipsky, O. & Porat, E., Jun 2011, In: Algorithmica. 60, 2, p. 335-348 14 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  • Pattern Matching 100%
  • Pattern matching 89%
  • Approximate Algorithm 60%
  • Metric 52%
  • String Matching 46%

• Approximate string matching with stuck address bits

  Amir, A., Eisenberg, E., Keller, O., Levy, A. & Porat, E., 1 Jul 2011, In: Theoretical Computer Science. 412, 29, p. 3537-3544 8 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  • Approximate String Matching 100%
  • Pattern Matching 56%
  • Pattern matching 50%
  • Matching Problem 33%
  • String Matching 21%

• Explicit nonadaptive combinatorial group testing schemes

  Porat, E. & Rothschild, A., Dec 2011, In: IEEE Transactions on Information Theory. 57, 12, p. 7982-7989 8 p., 5967914.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Error correction 100%
  • Testing 97%
  • ill people 88%
  • Group 57%
  • time 22%

• Exponential time improvement for min-wise based algorithms

  Feigenblat, G., Porat, E. & Shiftan, A., Apr 2011, In: Information and Computation. 209, 4, p. 737-747 11 p.

  Bar-Ilan University

  Research output: Contribution to journal › Article › peer-review

  Open Access

  • Hash functions 100%
  • Exponential time 91%
  • Hash Function 83%
  • Family 39%
  • Data Streams 23%