Prof. Ely Porat

Prof.
Prof. Ely Porat
Telephone: 
Fax: 
Office: 

Publications

 



  1. Yoram Bachrach, Jeffrey S. Rosenschein, Ely Porat: Autonomous Transfer for Reinforcement Learning. Appeared in International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2008


  2. Ely Porat, Klim Efremenko: Approximating General Metric Distances Between a Pattern anda Text. Appeared in Symposium on Discrete Algorithms (SODA), 2008


  3. Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat: Approximate String Matching with Address Bit Errors. Appeared in Symposium on Combinatorial Pattern Matching (CPM), 2008


  4. Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat: A black box for online approximate pattern matching. Appeared in Symposium on Combinatorial Pattern Matching (CPM), 2008


  5. Ely Porat, Amir Rothschild, Asaf Tsur: Randomized Moment Distance (2007)


  6. Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild: Improved Deterministic Length Reduction CoRR abs/0802.0017: (2008)


  7. Klim Efremenko, Ely Porat: Approximating General Metric Distances Between a Pattern and a Text CoRR abs/0802.1427: (2008)


  8. Ohad Lipsky, Ely Porat: Approximate matching in the Linfinity metric. Inf. Process. Lett. 105(4): 138-140 (2008)


  9. Ohad Lipsky, Ely Porat: L1 pattern matching lower bound. Inf. Process. Lett. 105(4): 141-143 (2008)


  10. Ely Porat, Ohad Lipsky: Improved Sketching of Hamming Distance with Error Correcting. CPM 2007: 173-182


  11. Amihood Amir, Oren Kapah, Ely Porat: Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. CPM 2007: 183-194


  12. Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: k -Mismatch with Don't Cares. ESA 2007: 151-162


  13. Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat: On the Cost of Interchange Rearrangement in Strings. ESA 2007: 99-110


  14. Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur: Approximate String Matching with Swap and Mismatch. ISAAC 2007: 869-880


  15. Ely Porat: Range Non-Overlapping (2007)  


  16. Raphaël Clifford, Ely Porat: A Filtering Algorithm for k -Mismatch with Don't Cares. SPIRE 2007: 130-136


  17. Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur: Approximate Swap and Mismatch Edit Distance. SPIRE 2007: 149-163


  18. Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49


  19. Ayelet Butman, Noa Lewenstein, Benny Porat, Ely Porat: Jump-Matching with Errors. SPIRE 2007: 98-106


  20. Ely Porat, Amir Rothschild: Explicit Non-Adaptive Combinatorial Group Testing Schemes CoRR abs/0712.3876: (2007)


  21. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007)


  22. Yossi Matias, Ely Porat: Efficient pebbling for list traversal synopses with application to program rollback. Theor. Comput. Sci. 379(3): 418-436 (2007)


  23. 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


  25. 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


  26. Haim Kaplan, Ely Porat, Nira Shafrir: Finding the Position of the k-Mismatch and Approximate Tandem Repeats. SWAT 2006: 90-101


  27. Amihood Amir, Estrella Eisenberg, Ely Porat: Swap and Mismatch Edit Distance. Algorithmica 45(1): 109-120 (2006)


  28. Benny Porat, Ely Porat, Asaf Tsur: Pattern Matching with Moment Distance (2006)


  29. Benny Porat, Ely Porat, Asaf Tsur  Pattern Matching with Pair Correlation Distance (2006)


  30. Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat: Function Matching. SIAM J. Comput. 35(5): 1007-1022 (2006)


  31. Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski: Approximate Matching in the L1 Metric. CPM 2005: 91-103


  32. Tsvi Kopelowitz, Ely Porat: Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. ICTCS 2005: 309-322


  33. Ohad Lipsky, Ely Porat: L1 Pattern Matching Lower Bound. SPIRE 2005: 327-330


  34. Ohad Lipsky, Ely Porat: Approximate Matching in the Linfinity Metric. SPIRE 2005: 331-334


  35. Amihood Amir, Estrella Eisenberg, Ely Porat: Swap and Mismatch Edit Distance. ESA 2004: 16-27


  36. Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat: Closest Pair Problems in Very High Dimensions. ICALP 2004: 782-792


  37. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9


  38. Amihood Amir, Moshe Lewenstein, Ely Porat: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2): 257-275 (2004)


  39. Yossi Matias, Ely Porat: Efficient Pebbling for List Traversal Synopses. ICALP 2003: 918-928


  40. Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat: Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003: 929-942


  41. Ohad Lipsky, Ely Porat: Improved Sketching of Hamming Distance with Error (2003)


  42. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat: Real Two Dimensional Scaled Matching. WADS 2003: 353-364


  43. Yossi Matias, Ely Porat: Efficient pebbling for list traversal synopses CoRR cs.DS/0306104: (2003)


  44. Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. Inf. Comput. 181(1): 57-74 (2003)


  45. Amihood Amir, Moshe Lewenstein, Ely Porat: Approximate swapped matching. Inf. Process. Lett. 83(1): 33-39 (2002)


  46. Ohad Lipsky, Ely Porat: Approximated Pattern Matching with the L1 L2 and Linfinity Metrics (2002).


  47. Ohad Lipsky, Ely Porat: L1 Pattern Matching (2002).


  48. Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: A faster implementation of the Goemans-Williamson clustering algorithm. SODA 2001: 17-25


  49. Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. SODA 2001: 279-288


  50. Amihood Amir, Ely Porat, Moshe Lewenstein: Approximate subset matching with Don't Cares. SODA 2001: 305-306


  51. Amihood Amir, Moshe Lewenstein, Ely Porat: Approximate Swapped Matching. FSTTCS 2000: 302-311


  52. Amihood Amir, Moshe Lewenstein, Ely Porat: Faster algorithms for string matching with k mismatches. SODA 2000: 794-803
     

 

Research

Analysis  of Algorithms, Complexity Theory