default search action
Ely Porat
Person information
- affiliation: Bar-Ilan University, Ramat Gan, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j61]Ohad Amosy, Tamuz Danzig, Ohad Lev, Ely Porat, Gal Chechik, Adi Makmal:
Iteration-Free quantum approximate optimization algorithm using neural networks. Quantum Mach. Intell. 6(2): 38 (2024) - [j60]Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
An Improved Algorithm for The k-Dyck Edit Distance Problem. ACM Trans. Algorithms 20(3): 26 (2024) - [c120]Dvir Fried, Tsvi Kopelowitz, Ely Porat:
Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices. ESA 2024: 57:1-57:6 - [c119]Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom:
Burst Edit Distance. SPIRE 2024: 41-56 - 2023
- [c118]Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia:
String Factorization via Prefix Free Families. CPM 2023: 19:1-19:10 - 2022
- [c117]Avivit Levy, Ely Porat, B. Riva Shalom:
Partial Permutations Comparison, Maintenance and Applications. CPM 2022: 10:1-10:17 - [c116]Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
An Improved Algorithm for The k-Dyck Edit Distance Problem. SODA 2022: 3650-3669 - 2021
- [j59]Ori Rottenstreich, Pedro Reviriego, Ely Porat, S. Muthukrishnan:
Avoiding Flow Size Overestimation in Count-Min Sketch With Bloom Filter Constructions. IEEE Trans. Netw. Serv. Manag. 18(3): 3662-3676 (2021) - [c115]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Incremental Edge Orientation in Forests. ESA 2021: 12:1-12:18 - [c114]Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya:
Small-space and streaming pattern matching with $k$ edits. FOCS 2021: 885-896 - [c113]Tsvi Kopelowitz, Samuel McCauley, Ely Porat:
Support Optimality and Adaptive Cuckoo Filters. WADS 2021: 556-570 - [i57]Tsvi Kopelowitz, Samuel McCauley, Ely Porat:
Support Optimality and Adaptive Cuckoo Filters. CoRR abs/2105.10622 (2021) - [i56]Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya:
Small space and streaming pattern matching with k edits. CoRR abs/2106.06037 (2021) - [i55]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Incremental Edge Orientation in Forests. CoRR abs/2107.02318 (2021) - [i54]Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
An Improved Algorithm for The k-Dyck Edit Distance Problem. CoRR abs/2111.02336 (2021) - 2020
- [j58]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Online recognition of dictionary with one gap. Inf. Comput. 275: 104633 (2020) - [c112]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski:
Improved Circular k-Mismatch Sketches. APPROX-RANDOM 2020: 46:1-46:24 - [c111]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. CPM 2020: 15:1-15:15 - [c110]Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat:
An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States. PODC 2020: 191-199 - [c109]Or Birenzwige, Shay Golan, Ely Porat:
Locally Consistent Parsing for Text Indexing in Small Space. SODA 2020: 607-626 - [c108]Ori Rottenstreich, Pedro Reviriego, Ely Porat, S. Muthukrishnan:
Constructions and Applications for Accurate Counting of the Bloom Filter False Positive Free Zone. SOSR 2020: 135-145 - [c107]Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
Approximating text-to-pattern Hamming distances. STOC 2020: 643-656 - [i53]Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
Approximating Text-to-Pattern Hamming Distances. CoRR abs/2001.00211 (2020) - [i52]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
The Streaming k-Mismatch Problem: Tradeoffs between Space and Total Time. CoRR abs/2004.12881 (2020) - [i51]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski:
Improved Circular k-Mismatch Sketches. CoRR abs/2006.13673 (2020) - [i50]Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat:
An O(log3/2n) Parallel Time Population Protocol for Majority with O(log n) States. CoRR abs/2011.12633 (2020)
2010 – 2019
- 2019
- [j57]Shay Golan, Tsvi Kopelowitz, Ely Porat:
Streaming Pattern Matching with d Wildcards. Algorithmica 81(5): 1988-2015 (2019) - [j56]Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom:
Mind the Gap! - Online Dictionary Matching with One Gap. Algorithmica 81(6): 2123-2157 (2019) - [j55]Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat:
Approximate cover of strings. Theor. Comput. Sci. 793: 59-69 (2019) - [c106]Isaac Goldstein, Moshe Lewenstein, Ely Porat:
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. ISAAC 2019: 7:1-7:22 - [c105]Raphaël Clifford, Tomasz Kociumaka, Ely Porat:
The streaming k-mismatch problem. SODA 2019: 1106-1125 - [c104]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
Dynamic Dictionary Matching in the Online Model. WADS 2019: 409-422 - [i49]Tsvi Kopelowitz, Ely Porat:
The Strong 3SUM-INDEXING Conjecture is False. CoRR abs/1907.11206 (2019) - [i48]Isaac Goldstein, Moshe Lewenstein, Ely Porat:
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. CoRR abs/1910.00831 (2019) - [i47]Hodaya Barr, Tsvi Kopelowitz, Ely Porat, Liam Roditty:
{-1, 0, 1}-APSP and (min, max)-Product Problems. CoRR abs/1911.06132 (2019) - 2018
- [j54]Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
Worst-case Optimal Join Algorithms. J. ACM 65(3): 16:1-16:40 (2018) - [j53]Avi Shmidman, Moshe Koppel, Ely Porat:
Identification of Parallel Passages Across a Large Hebrew/Aramaic Corpus. J. Data Min. Digit. Humanit. 2018 (2018) - [c103]Amihood Amir, Avivit Levy, Ely Porat:
Quasi-Periodicity Under Mismatch Errors. CPM 2018: 4:1-4:15 - [c102]Isaac Goldstein, Moshe Lewenstein, Ely Porat:
Improved Space-Time Tradeoffs for kSUM. ESA 2018: 37:1-37:14 - [c101]Shay Golan, Tsvi Kopelowitz, Ely Porat:
Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams. ICALP 2018: 65:1-65:16 - [c100]Tsvi Kopelowitz, Ely Porat:
A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance. SOSA 2018: 10:1-10:5 - [c99]Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter:
Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest. SPAA 2018: 333-341 - [i46]Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter:
Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest. CoRR abs/1805.06151 (2018) - [i45]Isaac Goldstein, Moshe Lewenstein, Ely Porat:
Improved Space-Time Tradeoffs for kSUM. CoRR abs/1807.03718 (2018) - [i44]Or Birenzwige, Shay Golan, Ely Porat:
Locally Consistent Parsing for Text Indexing in Small Space. CoRR abs/1812.00359 (2018) - 2017
- [j52]Guy Feigenblat, Ely Porat, Ariel Shiftan:
A Grouping Approach for Succinct Dynamic Dictionary Matching. Algorithmica 77(1): 134-150 (2017) - [j51]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Erratum to: A Grouping Approach for Succinct Dynamic Dictionary Matching. Algorithmica 77(1): 151 (2017) - [j50]Guy Feigenblat, Ely Porat, Ariel Shiftan:
d-k-min-wise independent family of hash functions. J. Comput. Syst. Sci. 84: 171-184 (2017) - [j49]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
For-All Sparse Recovery in Near-Optimal Time. ACM Trans. Algorithms 13(3): 32:1-32:26 (2017) - [c98]Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat:
Approximate Cover of Strings. CPM 2017: 26:1-26:14 - [c97]Shay Golan, Ely Porat:
Real-Time Streaming Multi-Pattern Search for Constant Alphabet. ESA 2017: 41:1-41:15 - [c96]Aaron Bernstein, Tsvi Kopelowitz, Seth Pettie, Ely Porat, Clifford Stein:
Simultaneously Load Balancing for Every p-norm, With Reassignments. ITCS 2017: 51:1-51:14 - [c95]Isaac Goldstein, Moshe Lewenstein, Ely Porat:
Orthogonal Vectors Indexing. ISAAC 2017: 40:1-40:12 - [c94]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Online Recognition of Dictionary with One Gap. Stringology 2017: 3-17 - [c93]Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
Conditional Lower Bounds for Space/Time Tradeoffs. WADS 2017: 421-436 - [i43]Shay Golan, Tsvi Kopelowitz, Ely Porat:
Streaming Pattern Matching with d Wildcards. CoRR abs/1704.01646 (2017) - [i42]Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
How Hard is it to Find (Honest) Witnesses? CoRR abs/1706.05815 (2017) - [i41]Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
Conditional Lower Bounds for Space/Time Tradeoffs. CoRR abs/1706.05847 (2017) - [i40]Raphaël Clifford, Tomasz Kociumaka, Ely Porat:
The streaming k-mismatch problem. CoRR abs/1708.05223 (2017) - [i39]Isaac Goldstein, Moshe Lewenstein, Ely Porat:
Orthogonal Vectors Indexing. CoRR abs/1710.00586 (2017) - 2016
- [j48]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Addendum to 'Exponential time improvement for min-wise based algorithms' [Information and Computation 209 (2011) 737-747]. Inf. Comput. 251: 361 (2016) - [j47]Gary Benson, Martin Farach-Colton, Moshe Lewenstein, Ely Porat:
Special issue in honor of the 60th birthday of Amihood Amir. Theor. Comput. Sci. 638: 1-2 (2016) - [j46]Ariel Shiftan, Ely Porat:
Set Intersection and Sequence Matching with mismatch counting. Theor. Comput. Sci. 638: 3-10 (2016) - [j45]Guy Feigenblat, Ofra Itzhaki, Ely Porat:
Corrigendum to "The frequent items problem, under polynomial decay, in the streaming model" [Theoret. Comput. Sci. 411(34-36) (2010) 3048-3054]. Theor. Comput. Sci. 648: 116 (2016) - [j44]Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat:
Optimal In/Out TCAM Encodings of Ranges. IEEE/ACM Trans. Netw. 24(1): 555-568 (2016) - [c92]Tsvi Kopelowitz, Ely Porat, Yaron Rozen:
Succinct Online Dictionary Matching with Improved Worst-Case Guarantees. CPM 2016: 6:1-6:13 - [c91]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Linear Time Succinct Indexable Dictionary Construction with Applications. DCC 2016: 13-22 - [c90]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat:
Sublinear Distance Labeling. ESA 2016: 5:1-5:15 - [c89]Shay Golan, Tsvi Kopelowitz, Ely Porat:
Streaming Pattern Matching with d Wildcards. ESA 2016: 44:1-44:16 - [c88]Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
How Hard is it to Find (Honest) Witnesses?. ESA 2016: 45:1-45:16 - [c87]Ely Porat, Eduard Shahbazian, Roei Tov:
New Parameterized Algorithms for APSP in Directed Graphs. ESA 2016: 72:1-72:13 - [c86]Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat:
Distance Labeling Schemes for Trees. ICALP 2016: 132:1-132:16 - [c85]Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom:
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap. ISAAC 2016: 12:1-12:12 - [c84]Tsvi Kopelowitz, Seth Pettie, Ely Porat:
Higher Lower Bounds from the 3SUM Conjecture. SODA 2016: 1272-1287 - [c83]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
The k-mismatch problem revisited. SODA 2016: 2039-2052 - [c82]Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat:
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. SPAA 2016: 367-375 - [i38]Avi Shmidman, Moshe Koppel, Ely Porat:
Identification of Parallel Passages Across a Large Hebrew/Aramaic Corpus. CoRR abs/1602.08715 (2016) - 2015
- [j43]Yoram Bachrach, Ely Porat:
Fingerprints for highly similar streams. Inf. Comput. 244: 113-121 (2015) - [j42]Amihood Amir, Alberto Apostolico, Gad M. Landau, Ely Porat, Oren Sar Shalom:
A PTAS for the Square Tiling Problem. Theor. Comput. Sci. 562: 33-45 (2015) - [j41]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary matching with a few gaps. Theor. Comput. Sci. 589: 34-46 (2015) - [j40]Neta Barkay, Ely Porat, Bar Shalem:
Efficient sampling of non-strict turnstile data streams. Theor. Comput. Sci. 590: 106-117 (2015) - [c81]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
Dictionary Matching in a Stream. ESA 2015: 361-372 - [c80]Tsvi Kopelowitz, Ely Porat:
Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per Alignment. FOCS 2015: 601-613 - [c79]Tsvi Kopelowitz, Seth Pettie, Ely Porat:
Dynamic Set Intersection. WADS 2015: 470-481 - [e2]Ferdinando Cicalese, Ely Porat, Ugo Vaccaro:
Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings. Lecture Notes in Computer Science 9133, Springer 2015, ISBN 978-3-319-19928-3 [contents] - [i37]Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom:
Online Dictionary Matching with One Gap. CoRR abs/1503.07563 (2015) - [i36]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
Dictionary matching in a stream. CoRR abs/1504.06242 (2015) - [i35]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat:
Sublinear distance labeling for sparse graphs. CoRR abs/1507.02618 (2015) - [i34]Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat:
Distance labeling schemes for trees. CoRR abs/1507.04046 (2015) - [i33]Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya:
The k-mismatch problem revisited. CoRR abs/1508.00731 (2015) - [i32]Tsvi Kopelowitz, Ely Porat:
Breaking the Variance: Approximating the Hamming Distance in $\tilde O(1/ε)$ Time Per Alignment. CoRR abs/1512.04515 (2015) - 2014
- [j39]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. J. Comput. Syst. Sci. 80(7): 1245-1253 (2014) - [c78]Yoram Bachrach, Sofia Ceppi, Ian A. Kash, Peter B. Key, Filip Radlinski, Ely Porat, Michael Armstrong, Vijay Sharma:
Building a personalized tourist attraction recommender system using crowdsourcing. AAMAS 2014: 1631-1632 - [c77]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary Matching with One Gap. CPM 2014: 11-20 - [c76]Guy Feigenblat, Ely Porat, Ariel Shiftan:
An Improved Query Time for Succinct Dynamic Dictionary Matching. CPM 2014: 120-129 - [c75]Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon:
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. ICALP (2) 2014: 532-543 - [c74]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
For-All Sparse Recovery in Near-Optimal Time. ICALP (1) 2014: 538-550 - [c73]Seth Gilbert, Valerie King, Seth Pettie, Ely Porat, Jared Saia, Maxwell Young:
(Near) optimal resource-competitive broadcast with jamming. SPAA 2014: 257-266 - [i31]Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein:
Sharing Rewards in Cooperative Connectivity Games. CoRR abs/1402.0572 (2014) - [i30]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
For-all Sparse Recovery in Near-Optimal Time. CoRR abs/1402.1726 (2014) - [i29]Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Ely Porat:
Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets. CoRR abs/1407.6755 (2014) - [i28]Tsvi Kopelowitz, Seth Pettie, Ely Porat:
3SUM Hardness in (Dynamic) Data Structures. CoRR abs/1407.6756 (2014) - [i27]Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat:
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. CoRR abs/1408.2279 (2014) - [i26]Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Dictionary Matching with One Gap. CoRR abs/1408.2350 (2014) - [i25]Amihood Amir, Oren Kapah, Ely Porat, Amir Rothschild:
Polynomials: a new tool for length reduction in binary discrete convolutions. CoRR abs/1410.5607 (2014) - 2013
- [j38]Ferdinando Cicalese, Ely Porat:
Guest Editorial for "Group Testing: models and applications". Algorithmica 67(3): 293-294 (2013) - [j37]Ely Porat, Liam Roditty:
Preprocess, Set, Query! Algorithmica 67(4): 516-528 (2013) - [j36]Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein:
Sharing Rewards in Cooperative Connectivity Games. J. Artif. Intell. Res. 47: 281-311 (2013) - [j35]Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach:
Pattern Matching under Polynomial Transformation. SIAM J. Comput. 42(2): 611-633 (2013) - [j34]Shachar Lovett, Ely Porat:
A Space Lower Bound for Dynamic Approximate Membership Data Structures. SIAM J. Comput. 42(6): 2182-2196 (2013) - [j33]Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Space lower bounds for online pattern matching. Theor. Comput. Sci. 483: 68-74 (2013) - [c72]Neta Barkay, Ely Porat, Bar Shalem:
Efficient Sampling of Non-strict Turnstile Data Streams. FCT 2013: 48-59 - [c71]Yoram Bachrach, Ely Porat:
Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints. ICALP (2) 2013: 459-471 - [c70]Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss:
ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk. ICALP (1) 2013: 461-472 - [c69]Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat:
On finding an optimal TCAM encoding scheme for packet classification. INFOCOM 2013: 2049-2057 - [c68]Alexandr Andoni, Assaf Goldberger, Andrew McGregor, Ely Porat:
Homomorphic fingerprints under misalignments: sketching edit and shift distances. STOC 2013: 931-940 - [e1]Oren Kurland, Moshe Lewenstein, Ely Porat:
String Processing and Information Retrieval - 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings. Lecture Notes in Computer Science 8214, Springer 2013, ISBN 978-3-319-02431-8 [contents] - [i24]Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss:
L2/L2-foreach sparse recovery with low risk. CoRR abs/1304.6232 (2013) - [i23]Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon:
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. CoRR abs/1312.1382 (2013) - 2012
- [j32]Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild:
Mismatch sampling. Inf. Comput. 214: 112-118 (2012) - [j31]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
Approximate Sparse Recovery: Optimizing Time and Measurements. SIAM J. Comput. 41(2): 436-453 (2012) - [j30]Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira:
Cycle detection and correction. ACM Trans. Algorithms 9(1): 13:1-13:20 (2012) - [j29]Tali Kaufman, Shachar Lovett, Ely Porat:
Weight Distribution and List-Decoding Size of Reed-Muller Codes. IEEE Trans. Inf. Theory 58(5): 2689-2696 (2012) - [c67]Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Pattern Matching in Multiple Streams. CPM 2012: 97-109 - [c66]Ely Porat, Bar Shalem:
A Cuckoo Hashing Variant with Improved Memory Utilization and Insertion Time. DCC 2012: 347-356 - [c65]Guy Feigenblat, Ely Porat, Ariel Shi