פרופ' אלי פורת

פרופ'
פרופ' אלי פורת
טלפון: 
פקס: 
דוא"ל: 
משרד: 
שעות קבלה: 

פירסומים

159. 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)


158. Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom: Dictionary matching with a few gaps. Theor. Comput. Sci. 589: 34-46 (2015)


157. Neta Barkay, Ely Porat, Bar Shalem: Efficient sampling of non-strict turnstile data streams. Theor. Comput. Sci. 590: 106-117 (2015)


156. Tsvi Kopelowitz, Seth Pettie, Ely Porat: Dynamic Set Intersection. WADS 2015: 470-481


155. 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]


154. Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom: Online Dictionary Matching with One Gap. CoRR abs/1503.07563 (2015)


153. Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana A. Starikovskaya: Dictionary matching in a stream. CoRR abs/1504.06242 (2015)


152. Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat: Sublinear distance labeling for sparse graphs. CoRR abs/1507.02618 (2015)


151. Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat: Distance labeling schemes for trees. CoRR abs/1507.04046 (2015)


150. Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat: Range LCP. J. Comput. Syst. Sci. 80(7): 1245-1253 (2014)


149. Yoram Bachrach, Sofia Ceppi, Ian A. Kash, Peter Key, Filip Radlinski, Ely Porat, Michael Armstrong, Vijay Sharma: Building a personalized tourist attraction recommender system using crowdsourcing. AAMAS 2014: 1631-1632


148. Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom: Dictionary Matching with One Gap. CPM 2014: 11-20


147. Guy Feigenblat, Ely Porat, Ariel Shiftan: An Improved Query Time for Succinct Dynamic Dictionary Matching. CPM 2014: 120-129


146. Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon: Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. ICALP (2) 2014: 532-543


145. Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss: For-All Sparse Recovery in Near-Optimal Time. ICALP (1) 2014: 538-550


144. Seth Gilbert, Valerie King, Seth Pettie, Ely Porat, Jared Saia, Maxwell Young: (Near) optimal resource-competitive broadcast with jamming. SPAA 2014: 257-266


143. Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein: Sharing Rewards in Cooperative Connectivity Games. CoRR abs/1402.0572 (2014)


142. Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss: For-all Sparse Recovery in Near-Optimal Time. CoRR abs/1402.1726 (2014)


141. Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Ely Porat: Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets. CoRR abs/1407.6755 (2014)


140. Tsvi Kopelowitz, Seth Pettie, Ely Porat: 3SUM Hardness in (Dynamic) Data Structures. CoRR abs/1407.6756 (2014)


139. 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)


138. Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom: Dictionary Matching with One Gap. CoRR abs/1408.2350 (2014)


137. Amihood Amir, Oren Kapah, Ely Porat, Amir Rothschild: Polynomials: a new tool for length reduction in binary discrete convolutions. CoRR abs/1410.5607 (2014)


136. Ferdinando Cicalese, Ely Porat: Guest Editorial for "Group Testing: models and applications". Algorithmica 67(3): 293-294 (2013)


135. Ely Porat, Liam Roditty: Preprocess, Set, Query! Algorithmica 67(4): 516-528 (2013)


134. Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein: Sharing Rewards in Cooperative Connectivity Games. J. Artif. Intell. Res. (JAIR) 47: 281-311 (2013)


133. 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)


132. Shachar Lovett, Ely Porat: A Space Lower Bound for Dynamic Approximate Membership Data Structures. SIAM J. Comput. 42(6): 2182-2196 (2013)


131. Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Space lower bounds for online pattern matching. Theor. Comput. Sci. 483: 68-74 (2013)


130. Neta Barkay, Ely Porat, Bar Shalem: Efficient Sampling of Non-strict Turnstile Data Streams. FCT 2013: 48-59


129. Yoram Bachrach, Ely Porat: Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints. ICALP (2) 2013: 459-471


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


127. Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat: On finding an optimal TCAM encoding scheme for packet classification. INFOCOM 2013: 2049-2057


126. Alexandr Andoni, Assaf Goldberger, Andrew McGregor, Ely Porat: Homomorphic fingerprints under misalignments: sketching edit and shift distances. STOC 2013: 931-940


125. 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]


124. 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)


123. Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon: Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. CoRR abs/1312.1382 (2013)


122. Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild: Mismatch sampling. Inf. Comput. 214: 112-118 (2012)


121. 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)


120. Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira: Cycle detection and correction. ACM Transactions on Algorithms 9(1): 13 (2012)


119. Tali Kaufman, Shachar Lovett, Ely Porat: Weight Distribution and List-Decoding Size of Reed-Muller Codes. IEEE Transactions on Information Theory 58(5): 2689-2696 (2012)


118. Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Pattern Matching in Multiple Streams. CPM 2012: 97-109


117. Ely Porat, Bar Shalem: A Cuckoo Hashing Variant with Improved Memory Utilization and Insertion Time. DCC 2012: 347-356


116. Guy Feigenblat, Ely Porat, Ariel Shiftan: Exponential Space Improvement for minwise Based Algorithms. FSTTCS 2012: 70-85


115. Ely Porat, Erez Waisbard: Efficient signature scheme for network coding. ISIT 2012: 1987-1991


114. Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra: Worst-case optimal join algorithms: [extended abstract]. PODS 2012: 37-48


113. Ely Porat, Martin J. Strauss: Sublinear time, measurement-optimal, sparse recovery for all. SODA 2012: 1215-1227


112. Hung Q. Ngo, Ely Porat, Atri Rudra: Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. STACS 2012: 230-241


111. Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Pattern Matching in Multiple Streams. CoRR abs/1202.3470 (2012)


110. Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra: Worst-case Optimal Join Algorithms. CoRR abs/1203.1952 (2012)


109. Neta Barkay, Ely Porat, Bar Shalem: Feasible Sampling of Non-strict Turnstile Data Streams. CoRR abs/1209.5566 (2012)


108. Ohad Lipsky, Ely Porat: Approximate Pattern Matching with the L1, L2 and L∞ Metrics. Algorithmica 60(2): 335-348 (2011)


107. Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat: A black box for online approximate pattern matching. Inf. Comput. 209(4): 731-736 (2011)


106. Guy Feigenblat, Ely Porat, Ariel Shiftan: Exponential time improvement for min-wise based algorithms. Inf. Comput. 209(4): 737-747 (2011)


105. 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)


104. Ely Porat, Amir Rothschild: Explicit Nonadaptive Combinatorial Group Testing Schemes. IEEE Transactions on Information Theory 57(12): 7982-7989 (2011)


103. Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Space Lower Bounds for Online Pattern Matching. CPM 2011: 184-196


102. Ely Porat, Liam Roditty: Preprocess, Set, Query! ESA 2011: 603-614


101. Hung Q. Ngo, Ely Porat, Atri Rudra: Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract). ICALP (1) 2011: 557-568


100. Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat: Range LCP. ISAAC 2011: 683-692


99. Amir Herzberg, Ely Porat, Nir Soffer, Erez Waisbard: Camouflaged Private Communication. SocialCom/PASSAT 2011: 1159-1162

98. Guy Feigenblat, Ely Porat, Ariel Shiftan: Exponential Time Improvement for min-wise Based Algorithms. SODA 2011: 57-66


97. Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat: Persistency in Suffix Trees with Applications to String Interval Problems. SPIRE 2011: 67-80


96. Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff: Fast moment estimation in data streams in optimal space. STOC 2011: 745-754


95. Guy Feigenblat, Ely Porat, Ariel Shiftan: Even Better Framework for min-wise Based Algorithms. CoRR abs/1102.3537 (2011)


94. Ely Porat, Bar Shalem: Another one flew over the cuckoo's nest. CoRR abs/1104.5400 (2011)


93. Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach: Space Lower Bounds for Online Pattern Matching. CoRR abs/1106.4412 (2011)


92. 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)


91. 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)


90. Maxime Crochemore, Ely Porat: Fast computation of a longest increasing subsequence and application. Inf. Comput. 208(9): 1054-1059 (2010)


89. Raphaël Clifford, Ely Porat: A filtering algorithm for k-mismatch with don't cares. Inf. Process. Lett. 110(22): 1021-1025 (2010)


88. 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)


87. 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)


86. Hagai Cohen, Ely Porat: Fast set intersection and two-patterns matching. Theor. Comput. Sci. 411(40-42): 3795-3800 (2010)


85. 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)


84. Yoram Bachrach, Ely Porat: Path disruption games. AAMAS 2010: 1123-1130


83. Shachar Lovett, Ely Porat: A Lower Bound for Dynamic Approximate Membership Data Structures. FOCS 2010: 797-804


82. Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira: Cycle Detection and Correction. ICALP (1) 2010: 43-54


81. Tali Kaufman, Shachar Lovett, Ely Porat: Weight Distribution and List-Decoding Size of Reed-Muller Codes. ICS 2010: 422-433


80. Hagai Cohen, Ely Porat: Fast Set Intersection and Two-Patterns Matching. LATIN 2010: 234-242


79. Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat: Approximate String Matching with Stuck Address Bits. SPIRE 2010: 395-405


78. Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss: Approximate sparse recovery: optimizing time and measurements. STOC 2010: 475-484


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


76. Hagai Cohen, Ely Porat: On the hardness of distance oracle for sparse graph. CoRR abs/1006.1117 (2010)


75. Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff: Fast Moment Estimation in Data Streams in Optimal Space. CoRR abs/1007.4191 (2010)


74. Yoram Bachrach, Ely Porat: Fast Pseudo-Random Fingerprints. CoRR abs/1009.5791 (2010)


73. Ely Porat, Martin J. Strauss: Sublinear Time, Measurement-Optimal, Sparse Recovery For All. CoRR abs/1012.1886 (2010)


72. Shachar Lovett, Ely Porat: A lower bound for dynamic approximate membership data structures. Electronic Colloquium on Computational Complexity (ECCC) 17: 87 (2010)


71. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat: Real Two Dimensional Scaled Matching. Algorithmica 53(3): 314-336 (2009)


70. 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)


69. 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)


68. Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient computations of l1 and l INFINITY  rearrangement distances. Theor. Comput. Sci. 410(43): 4382-4390 (2009)


67. 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)


66. Ely Porat: An Optimal Bloom Filter Replacement Based on Matrix Solving. CSR 2009: 263-273


65. Benny Porat, Ely Porat: Exact and Approximate Pattern Matching in the Streaming Model. FOCS 2009: 315-323


64. Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein: Sketching Techniques for Collaborative Filtering. IJCAI 2009: 2016-2021


63. Hagai Cohen, Ely Porat: Range Non-overlapping Indexing. ISAAC 2009: 1044-1053


62. Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: From coding theory to efficient pattern matching. SODA 2009: 778-784


61. Guy Feigenblat, Ofra Itzhaki, Ely Porat: The Frequent Items Problem, under Polynomial Decay, in the Streaming Model. SPIRE 2009: 266-276


60. Ariel Shiftan, Ely Porat: Set Intersection and Sequence Matching. SPIRE 2009: 285-294


59. Yoram Bachrach, Ralf Herbrich, Ely Porat: Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems. SPIRE 2009: 344-352


58. Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: Pattern matching with don't cares and few errors. Search Methodologies 2009


57. Ely Porat, Amir Rothschild: Explicit Non-Adaptive Combinatorial Group Testing Schemes. Search Methodologies 2009


56. Hagai Cohen, Ely Porat: Range Non-Overlapping Indexing. CoRR abs/0909.4893 (2009)


55. Hagai Cohen, Ely Porat: Fast Set Intersection and Two Patterns Matching. CoRR abs/0909.5146 (2009)


54. Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss: Approximate Sparse Recovery: Optimizing Time and Measurements. CoRR abs/0912.0229 (2009)


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


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


51. Tsvi Kopelowitz, Ely Porat: Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. Theory Comput. Syst. 42(3): 349-365 (2008)


50. Benny Porat, Ely Porat, Asaf Zur: Pattern matching with pair correlation distance. Theor. Comput. Sci. 407(1-3): 587-590 (2008)


49. Yoram Bachrach, Jeffrey S. Rosenschein, Ely Porat: Power and stability in connectivity games. AAMAS (2) 2008: 999-1006


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


47. Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat: Approximate String Matching with Address Bit Errors. CPM 2008: 118-129

46. Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat: A Black Box for Online Approximate Pattern Matching. CPM 2008: 143-151


45. Ely Porat, Amir Rothschild: Explicit Non-adaptive Combinatorial Group Testing Schemes. ICALP (1) 2008: 748-759


44. Ely Porat, Klim Efremenko: Approximating general metric distances between a pattern and a text. SODA 2008: 419-427


43. Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild: Mismatch Sampling. SPIRE 2008: 99-108


42. Ohad Lipsky, Ely Porat: Approximated Pattern Matching with the L1, L2 and Linfinit Metrics. SPIRE 2008: 212-223


41. Benny Porat, Ely Porat, Asaf Zur: Pattern Matching with Pair Correlation Distance. SPIRE 2008: 249-256


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


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


38. Ely Porat: An Optimal Bloom Filter Replacement Based on Matrix Solving. CoRR abs/0804.1845 (2008)


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


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


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


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


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


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


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


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. Raphaël Clifford, Ely Porat: A Filtering Algorithm for k -Mismatch with Don't Cares. SPIRE 2007: 130-136


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


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


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


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


23. Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat: Approximate Matching in Weighted Sequences. CPM 2006: 365-376


22. Michael Furman, Yossi Matias, Ely Porat: LTS: The List-Traversal Synopses System. NGITS 2006: 353-354


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

תחומי מחקר

ניתוח אלגוריתמים, מורכבות חישובית