default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEly 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 Shiftan:
Exponential Space Improvement for minwise Based Algorithms. FSTTCS 2012: 70-85 - [c64]Ely Porat, Erez Waisbard:
Efficient signature scheme for network coding. ISIT 2012: 1987-1991 - [c63]Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
Worst-case optimal join algorithms: [extended abstract]. PODS 2012: 37-48 - [c62]Ely Porat, Martin J. Strauss:
Sublinear time, measurement-optimal, sparse recovery for all. SODA 2012: 1215-1227 - [c61]Hung Q. Ngo, Ely Porat, Atri Rudra:
Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. STACS 2012: 230-241 - [i22]Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Pattern Matching in Multiple Streams. CoRR abs/1202.3470 (2012) - [i21]Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
Worst-case Optimal Join Algorithms. CoRR abs/1203.1952 (2012) - [i20]Neta Barkay, Ely Porat, Bar Shalem:
Feasible Sampling of Non-strict Turnstile Data Streams. CoRR abs/1209.5566 (2012) - 2011
- [j28]Ohad Lipsky, Ely Porat:
Approximate Pattern Matching with the L1, L2 and L∞ Metrics. Algorithmica 60(2): 335-348 (2011) - [j27]Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat:
A black box for online approximate pattern matching. Inf. Comput. 209(4): 731-736 (2011) - [j26]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Exponential time improvement for min-wise based algorithms. Inf. Comput. 209(4): 737-747 (2011) - [j25]Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat:
Approximate string matching with stuck address bits. Theor. Comput. Sci. 412(29): 3537-3544 (2011) - [j24]Ely Porat, Amir Rothschild:
Explicit Nonadaptive Combinatorial Group Testing Schemes. IEEE Trans. Inf. Theory 57(12): 7982-7989 (2011) - [c60]Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Space Lower Bounds for Online Pattern Matching. CPM 2011: 184-196 - [c59]Ely Porat, Liam Roditty:
Preprocess, Set, Query! ESA 2011: 603-614 - [c58]Hung Q. Ngo, Ely Porat, Atri Rudra:
Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract). ICALP (1) 2011: 557-568 - [c57]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. ISAAC 2011: 683-692 - [c56]Amir Herzberg, Ely Porat, Nir Soffer, Erez Waisbard:
Camouflaged Private Communication. SocialCom/PASSAT 2011: 1159-1162 - [c55]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Exponential Time Improvement for min-wise Based Algorithms. SODA 2011: 57-66 - [c54]Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
Persistency in Suffix Trees with Applications to String Interval Problems. SPIRE 2011: 67-80 - [c53]Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff:
Fast moment estimation in data streams in optimal space. STOC 2011: 745-754 - [i19]Guy Feigenblat, Ely Porat, Ariel Shiftan:
Even Better Framework for min-wise Based Algorithms. CoRR abs/1102.3537 (2011) - [i18]Ely Porat, Bar Shalem:
Another one flew over the cuckoo's nest. CoRR abs/1104.5400 (2011) - [i17]Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Space Lower Bounds for Online Pattern Matching. CoRR abs/1106.4412 (2011) - [i16]Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach:
Pattern Matching under Polynomial Transformation. CoRR abs/1109.1494 (2011) - 2010
- [j23]Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur:
String matching with up to k swaps and mismatches. Inf. Comput. 208(9): 1020-1030 (2010) - [j22]Maxime Crochemore, Ely Porat:
Fast computation of a longest increasing subsequence and application. Inf. Comput. 208(9): 1054-1059 (2010) - [j21]Raphaël Clifford, Ely Porat:
A filtering algorithm for k-mismatch with don't cares. Inf. Process. Lett. 110(22): 1021-1025 (2010) - [j20]Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild:
Pattern matching with don't cares and few errors. J. Comput. Syst. Sci. 76(2): 115-124 (2010) - [j19]Guy Feigenblat, Ofra Itzhaki, Ely Porat:
The frequent items problem, under polynomial decay, in the streaming model. Theor. Comput. Sci. 411(34-36): 3048-3054 (2010) - [j18]Hagai Cohen, Ely Porat:
Fast set intersection and two-patterns matching. Theor. Comput. Sci. 411(40-42): 3795-3800 (2010) - [j17]Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur:
The approximate swap and mismatch edit distance. Theor. Comput. Sci. 411(43): 3814-3822 (2010) - [c52]Yoram Bachrach, Ely Porat:
Path disruption games. AAMAS 2010: 1123-1130 - [c51]Shachar Lovett, Ely Porat:
A Lower Bound for Dynamic Approximate Membership Data Structures. FOCS 2010: 797-804 - [c50]Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira:
Cycle Detection and Correction. ICALP (1) 2010: 43-54 - [c49]Tali Kaufman, Shachar Lovett, Ely Porat:
Weight Distribution and List-Decoding Size of Reed-Muller Codes. ICS 2010: 422-433 - [c48]Hagai Cohen, Ely Porat:
Fast Set Intersection and Two-Patterns Matching. LATIN 2010: 234-242 - [c47]Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat:
Approximate String Matching with Stuck Address Bits. SPIRE 2010: 395-405 - [c46]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
Approximate sparse recovery: optimizing time and measurements. STOC 2010: 475-484 - [p1]Benny Porat, Ely Porat:
Toward Real Time Internet Traffic Monitoring. Web Intelligence and Security - Advances in Data and Text Mining Techniques for Detecting and Preventing Terrorist Activities on the Web 2010: 83-92 - [i15]Hagai Cohen, Ely Porat:
On the hardness of distance oracle for sparse graph. CoRR abs/1006.1117 (2010) - [i14]Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff:
Fast Moment Estimation in Data Streams in Optimal Space. CoRR abs/1007.4191 (2010) - [i13]Yoram Bachrach, Ely Porat:
Fast Pseudo-Random Fingerprints. CoRR abs/1009.5791 (2010) - [i12]Ely Porat, Martin J. Strauss:
Sublinear Time, Measurement-Optimal, Sparse Recovery For All. CoRR abs/1012.1886 (2010) - [i11]Shachar Lovett, Ely Porat:
A lower bound for dynamic approximate membership data structures. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j16]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat:
Real Two Dimensional Scaled Matching. Algorithmica 53(3): 314-336 (2009) - [j15]Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne:
Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. 75(6): 359-370 (2009) - [j14]Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat:
On the Cost of Interchange Rearrangement in Strings. SIAM J. Comput. 39(4): 1444-1461 (2009) - [j13]Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat:
Efficient computations of l1 and l∞ rearrangement distances. Theor. Comput. Sci. 410(43): 4382-4390 (2009) - [j12]Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate string matching with address bit errors. Theor. Comput. Sci. 410(51): 5334-5346 (2009) - [c45]Ely Porat:
An Optimal Bloom Filter Replacement Based on Matrix Solving. CSR 2009: 263-273 - [c44]Benny Porat, Ely Porat:
Exact and Approximate Pattern Matching in the Streaming Model. FOCS 2009: 315-323 - [c43]Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein:
Sketching Techniques for Collaborative Filtering. IJCAI 2009: 2016-2021 - [c42]Hagai Cohen, Ely Porat:
Range Non-overlapping Indexing. ISAAC 2009: 1044-1053 - [c41]Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild:
From coding theory to efficient pattern matching. SODA 2009: 778-784 - [c40]Guy Feigenblat, Ofra Itzhaki, Ely Porat:
The Frequent Items Problem, under Polynomial Decay, in the Streaming Model. SPIRE 2009: 266-276 - [c39]Ariel Shiftan, Ely Porat:
Set Intersection and Sequence Matching. SPIRE 2009: 285-294 - [c38]Yoram Bachrach, Ralf Herbrich, Ely Porat:
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems. SPIRE 2009: 344-352 - [i10]Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild:
Pattern matching with don't cares and few errors. Search Methodologies 2009 - [i9]Ely Porat, Amir Rothschild:
Explicit Non-Adaptive Combinatorial Group Testing Schemes. Search Methodologies 2009 - [i8]Hagai Cohen, Ely Porat:
Range Non-Overlapping Indexing. CoRR abs/0909.4893 (2009) - [i7]Hagai Cohen, Ely Porat:
Fast Set Intersection and Two Patterns Matching. CoRR abs/0909.5146 (2009) - [i6]Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
Approximate Sparse Recovery: Optimizing Time and Measurements. CoRR abs/0912.0229 (2009) - 2008
- [j11]Ohad Lipsky, Ely Porat:
Approximate matching in the Linfinity metric. Inf. Process. Lett. 105(4): 138-140 (2008) - [j10]Ohad Lipsky, Ely Porat:
L1 pattern matching lower bound. Inf. Process. Lett. 105(4): 141-143 (2008) - [j9]Tsvi Kopelowitz, Ely Porat:
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. Theory Comput. Syst. 42(3): 349-365 (2008) - [j8]Benny Porat, Ely Porat, Asaf Zur:
Pattern matching with pair correlation distance. Theor. Comput. Sci. 407(1-3): 587-590 (2008) - [c37]Yoram Bachrach, Jeffrey S. Rosenschein, Ely Porat:
Power and stability in connectivity games. AAMAS (2) 2008: 999-1006 - [c36]Maxime Crochemore, Ely Porat:
Computing a Longest Increasing Subsequence of Length k in Time O(n log log k). BCS Int. Acad. Conf. 2008: 69-74 - [c35]Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate String Matching with Address Bit Errors. CPM 2008: 118-129 - [c34]Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat:
A Black Box for Online Approximate Pattern Matching. CPM 2008: 143-151 - [c33]Ely Porat, Amir Rothschild:
Explicit Non-adaptive Combinatorial Group Testing Schemes. ICALP (1) 2008: 748-759 - [c32]Ely Porat, Klim Efremenko:
Approximating general metric distances between a pattern and a text. SODA 2008: 419-427 - [c31]Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild:
Mismatch Sampling. SPIRE 2008: 99-108 - [c30]Ohad Lipsky, Ely Porat:
Approximated Pattern Matching with the L1, L2 and Linfinit Metrics. SPIRE 2008: 212-223 - [c29]Benny Porat, Ely Porat, Asaf Zur:
Pattern Matching with Pair Correlation Distance. SPIRE 2008: 249-256 - [i5]Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild:
Improved Deterministic Length Reduction. CoRR abs/0802.0017 (2008) - [i4]Klim Efremenko, Ely Porat:
Approximating General Metric Distances Between a Pattern and a Text. CoRR abs/0802.1427 (2008) - [i3]Ely Porat:
An Optimal Bloom Filter Replacement Based on Matrix Solving. CoRR abs/0804.1845 (2008) - 2007
- [j7]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur:
Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007) - [j6]Yossi Matias, Ely Porat:
Efficient pebbling for list traversal synopses with application to program rollback. Theor. Comput. Sci. 379(3): 418-436 (2007) - [c28]Ely Porat, Ohad Lipsky:
Improved Sketching of Hamming Distance with Error Correcting. CPM 2007: 173-182 - [c27]Amihood Amir, Oren Kapah, Ely Porat:
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. CPM 2007: 183-194 - [c26]Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat:
On the Cost of Interchange Rearrangement in Strings. ESA 2007: 99-110 - [c25]Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild:
k -Mismatch with Don't Cares. ESA 2007: 151-162 - [c24]Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur:
Approximate String Matching with Swap and Mismatch. ISAAC 2007: 869-880 - [c23]Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat:
Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49 - [c22]Ayelet Butman, Noa Lewenstein, Benny Porat, Ely Porat:
Jump-Matching with Errors. SPIRE 2007: 98-106 - [c21]Raphaël Clifford, Ely Porat:
A Filtering Algorithm for k -Mismatch with Don't Cares. SPIRE 2007: 130-136 - [c20]Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur:
Approximate Swap and Mismatch Edit Distance. SPIRE 2007: 149-163 - [i2]Ely Porat, Amir Rothschild:
Explicit Non-Adaptive Combinatorial Group Testing Schemes. CoRR abs/0712.3876 (2007) - 2006
- [j5]Amihood Amir, Estrella Eisenberg, Ely Porat:
Swap and Mismatch Edit Distance. Algorithmica 45(1): 109-120 (2006) - [j4]Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat:
Function Matching. SIAM J. Comput. 35(5): 1007-1022 (2006) - [c19]Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat:
Approximate Matching in Weighted Sequences. CPM 2006: 365-376 - [c18]Michael Furman, Yossi Matias, Ely Porat:
LTS: The List-Traversal Synopses System. NGITS 2006: 353-354 - [c17]Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne:
Pattern matching with address errors: rearrangement distances. SODA 2006: 1221-1229 - [c16]Haim Kaplan, Ely Porat, Nira Shafrir:
Finding the Position of the k-Mismatch and Approximate Tandem Repeats. SWAT 2006: 90-101 - 2005
- [c15]Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski:
Approximate Matching in the L1 Metric. CPM 2005: 91-103 - [c14]Tsvi Kopelowitz, Ely Porat:
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. ICTCS 2005: 309-322 - [c13]Ohad Lipsky, Ely Porat:
L1 Pattern Matching Lower Bound. SPIRE 2005: 327-330 - [c12]Ohad Lipsky, Ely Porat:
Approximate Matching in the Linfinity Metric. SPIRE 2005: 331-334 - 2004
- [j3]Amihood Amir, Moshe Lewenstein, Ely Porat:
Faster algorithms for string matching with k mismatches. J. Algorithms 50(2): 257-275 (2004) - [c11]Amihood Amir, Estrella Eisenberg, Ely Porat:
Swap and Mismatch Edit Distance. ESA 2004: 16-27 - [c10]Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat:
Closest Pair Problems in Very High Dimensions. ICALP 2004: 782-792 - [c9]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur:
Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9 - 2003
- [j2]Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
Overlap matching. Inf. Comput. 181(1): 57-74 (2003) - [c8]Yossi Matias, Ely Porat:
Efficient Pebbling for List Traversal Synopses. ICALP 2003: 918-928 - [c7]Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat:
Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003: 929-942 - [c6]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat:
Real Two Dimensional Scaled Matching. WADS 2003: 353-364 - [i1]Yossi Matias, Ely Porat:
Efficient pebbling for list traversal synopses. CoRR cs.DS/0306104 (2003) - 2002
- [j1]Amihood Amir, Moshe Lewenstein, Ely Porat:
Approximate swapped matching. Inf. Process. Lett. 83(1): 33-39 (2002) - 2001
- [c5]Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
A faster implementation of the Goemans-Williamson clustering algorithm. SODA 2001: 17-25 - [c4]Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
Overlap matching. SODA 2001: 279-288 - [c3]Amihood Amir, Ely Porat, Moshe Lewenstein:
Approximate subset matching with Don't Cares. SODA 2001: 305-306 - 2000
- [c2]Amihood Amir, Moshe Lewenstein, Ely Porat:
Approximate Swapped Matching. FSTTCS 2000: 302-311 - [c1]Amihood Amir, Moshe Lewenstein, Ely Porat:
Faster algorithms for string matching with k mismatches. SODA 2000: 794-803
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
