| 2009 | ||
|---|---|---|
| 62 | Ely Porat: An Optimal Bloom Filter Replacement Based on Matrix Solving. CSR 2009: 263-273 | |
| 61 | Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein: Sketching Techniques for Collaborative Filtering. IJCAI 2009: 2016-2021 | |
| 60 | Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: From coding theory to efficient pattern matching. SODA 2009: 778-784 | |
| 59 | Guy Feigenblat, Ofra Itzhaki, Ely Porat: The Frequent Items Problem, under Polynomial Decay, in the Streaming Model. SPIRE 2009: 266-276 | |
| 58 | Ariel Shiftan, Ely Porat: Set Intersection and Sequence Matching. SPIRE 2009: 285-294 | |
| 57 | Yoram Bachrach, Ralf Herbrich, Ely Porat: Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems. SPIRE 2009: 344-352 | |
| 56 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat: Real Two Dimensional Scaled Matching. Algorithmica 53(3): 314-336 (2009) | |
| 55 | Hagai Cohen, Ely Porat: Range Non-Overlapping Indexing CoRR abs/0909.4893: (2009) | |
| 54 | Hagai Cohen, Ely Porat: Fast Set Intersection and Two Patterns Matching CoRR abs/0909.5146: (2009) | |
| 2008 | ||
| 53 | Yoram Bachrach, Jeffrey S. Rosenschein, Ely Porat: Power and stability in connectivity games. AAMAS (2) 2008: 999-1006 | |
| 52 | 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 | |
| 51 | Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat: Approximate String Matching with Address Bit Errors. CPM 2008: 118-129 | |
| 50 | Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat: A Black Box for Online Approximate Pattern Matching. CPM 2008: 143-151 | |
| 49 | Ely Porat, Amir Rothschild: Explicit Non-adaptive Combinatorial Group Testing Schemes. ICALP (1) 2008: 748-759 | |
| 48 | Ely Porat, Klim Efremenko: Approximating general metric distances between a pattern and a text. SODA 2008: 419-427 | |
| 47 | Ohad Lipsky, Ely Porat: Approximated Pattern Matching with the L1, L2 and Linfinit Metrics. SPIRE 2008: 212-223 | |
| 46 | Benny Porat, Ely Porat, Asaf Zur: Pattern Matching with Pair Correlation Distance. SPIRE 2008: 249-256 | |
| 45 | Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild: Mismatch Sampling. SPIRE 2008: 99-108 | |
| 44 | Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild: Improved Deterministic Length Reduction CoRR abs/0802.0017: (2008) | |
| 43 | Klim Efremenko, Ely Porat: Approximating General Metric Distances Between a Pattern and a Text CoRR abs/0802.1427: (2008) | |
| 42 | Ely Porat: An Optimal Bloom Filter Replacement Based on Matrix Solving CoRR abs/0804.1845: (2008) | |
| 41 | Ohad Lipsky, Ely Porat: Approximate matching in the Linfinity metric. Inf. Process. Lett. 105(4): 138-140 (2008) | |
| 40 | Ohad Lipsky, Ely Porat: L1 pattern matching lower bound. Inf. Process. Lett. 105(4): 141-143 (2008) | |
| 39 | Benny Porat, Ely Porat, Asaf Zur: Pattern matching with pair correlation distance. Theor. Comput. Sci. 407(1-3): 587-590 (2008) | |
| 38 | Tsvi Kopelowitz, Ely Porat: Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. Theory Comput. Syst. 42(3): 349-365 (2008) | |
| 2007 | ||
| 37 | Ely Porat, Ohad Lipsky: Improved Sketching of Hamming Distance with Error Correcting. CPM 2007: 173-182 | |
| 36 | Amihood Amir, Oren Kapah, Ely Porat: Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. CPM 2007: 183-194 | |
| 35 | Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: k -Mismatch with Don't Cares. ESA 2007: 151-162 | |
| 34 | Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat: On the Cost of Interchange Rearrangement in Strings. ESA 2007: 99-110 | |
| 33 | Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur: Approximate String Matching with Swap and Mismatch. ISAAC 2007: 869-880 | |
| 32 | Raphaël Clifford, Ely Porat: A Filtering Algorithm for k -Mismatch with Don't Cares. SPIRE 2007: 130-136 | |
| 31 | Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur: Approximate Swap and Mismatch Edit Distance. SPIRE 2007: 149-163 | |
| 30 | Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49 | |
| 29 | Ayelet Butman, Noa Lewenstein, Benny Porat, Ely Porat: Jump-Matching with Errors. SPIRE 2007: 98-106 | |
| 28 | Ely Porat, Amir Rothschild: Explicit Non-Adaptive Combinatorial Group Testing Schemes CoRR abs/0712.3876: (2007) | |
| 27 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007) | |
| 26 | Yossi Matias, Ely Porat: Efficient pebbling for list traversal synopses with application to program rollback. Theor. Comput. Sci. 379(3): 418-436 (2007) | |
| 2006 | ||
| 25 | Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat: Approximate Matching in Weighted Sequences. CPM 2006: 365-376 | |
| 24 | Michael Furman, Yossi Matias, Ely Porat: LTS: The List-Traversal Synopses System. NGITS 2006: 353-354 | |
| 23 | 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 | |
| 22 | Haim Kaplan, Ely Porat, Nira Shafrir: Finding the Position of the k-Mismatch and Approximate Tandem Repeats. SWAT 2006: 90-101 | |
| 21 | Amihood Amir, Estrella Eisenberg, Ely Porat: Swap and Mismatch Edit Distance. Algorithmica 45(1): 109-120 (2006) | |
| 20 | Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat: Function Matching. SIAM J. Comput. 35(5): 1007-1022 (2006) | |
| 2005 | ||
| 19 | Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski: Approximate Matching in the L1 Metric. CPM 2005: 91-103 | |
| 18 | Tsvi Kopelowitz, Ely Porat: Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. ICTCS 2005: 309-322 | |
| 17 | Ohad Lipsky, Ely Porat: L1 Pattern Matching Lower Bound. SPIRE 2005: 327-330 | |
| 16 | Ohad Lipsky, Ely Porat: Approximate Matching in the Linfinity Metric. SPIRE 2005: 331-334 | |
| 2004 | ||
| 15 | Amihood Amir, Estrella Eisenberg, Ely Porat: Swap and Mismatch Edit Distance. ESA 2004: 16-27 | |
| 14 | Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat: Closest Pair Problems in Very High Dimensions. ICALP 2004: 782-792 | |
| 13 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9 | |
| 12 | Amihood Amir, Moshe Lewenstein, Ely Porat: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2): 257-275 (2004) | |
| 2003 | ||
| 11 | Yossi Matias, Ely Porat: Efficient Pebbling for List Traversal Synopses. ICALP 2003: 918-928 | |
| 10 | Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat: Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003: 929-942 | |
| 9 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat: Real Two Dimensional Scaled Matching. WADS 2003: 353-364 | |
| 8 | Yossi Matias, Ely Porat: Efficient pebbling for list traversal synopses CoRR cs.DS/0306104: (2003) | |
| 7 | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. Inf. Comput. 181(1): 57-74 (2003) | |
| 2002 | ||
| 6 | Amihood Amir, Moshe Lewenstein, Ely Porat: Approximate swapped matching. Inf. Process. Lett. 83(1): 33-39 (2002) | |
| 2001 | ||
| 5 | Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: A faster implementation of the Goemans-Williamson clustering algorithm. SODA 2001: 17-25 | |
| 4 | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. SODA 2001: 279-288 | |
| 3 | Amihood Amir, Ely Porat, Moshe Lewenstein: Approximate subset matching with Don't Cares. SODA 2001: 305-306 | |
| 2000 | ||
| 2 | Amihood Amir, Moshe Lewenstein, Ely Porat: Approximate Swapped Matching. FSTTCS 2000: 302-311 | |
| 1 | Amihood Amir, Moshe Lewenstein, Ely Porat: Faster algorithms for string matching with k mismatches. SODA 2000: 794-803 | |