Bar-Ilan University
Ramat Gan 52900, Israel
+972-3-531-8075 (voice)
+972-3-736-0498 (fax)
porately@cs.biu.ac.il
office: room 305
| Department
of Computer Science
Bar-Ilan University Ramat Gan 52900, Israel +972-3-531-8075 (voice)
|
|
Journal Papers:
Amihood Amir, Moshe Lewenstein and Ely
Porat.
Approximate Swapped Matching,
Information Processing Letters, 83(1):33-39 (2002).
Amihood Amir, Richard Cole, Ramesh
Hariharan Moshe Lewenstein and Ely
Porat.
Overlap Matching,
Information and Computation, 181(1):57-74, 2003.
Amihood Amir, Moshe Lewenstein and Ely Porat.
Faster Algorithms for String Matching with k Mismatches,
J. of Algorithms, 50(2):257-275, 2004. (Special issue of
SODA
2000.)
Amihood Amir, Yonatan Aumann,
Moshe
Lewenstein and Ely Porat.
Function Matching.
Yossi Matias and Ely Porat.
Efficient pebbling for list traversal synopses with application to program
roll
back,
Theoretical Computer Science 379(3):418-436, 2007. (Special Issue of ICALP 2003)
Amihood Amir, Esterella
Eisenberg
and Ely Porat.
Swap and Mismatch Edit Distance.
Algorithmica 45(1): 109-120 (2006)
Conference Presentations (refereed - with
Proceedings):
Amihood Amir, Moshe Lewenstein and Ely Porat.
Faster
Algorithms for string Matching with k Mismatches.
Invited to the special issue of Journal of Algorithms
Appeared in Proceedings of the Symposium of Discrete Algorithms (SODA) 2000,
794-803.
Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein and Porat Ely.
Swap Matching in
Time O(nlogmlog|E|).
Manuscript
Amihood Amir, Moshe Lewenstein and Ely Porat.
Approximate
Swapped Matching.
Appeared in Foundations of Software Technology and
Theoretical Computer Science (FSTTCS) 2000, 302-331.
Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein and Porat Ely.
Overlap
Matching.
Appeared in Proceedings of the Symposium of Discrete
Algorithms (SODA) 2001, 305-306.
Amihood Amir, Moshe Lewenstein and Ely Porat.
Approximate
Subset Matching with don't care.
Appeared in Proceedings of the Symposium of Discrete
Algorithms (SODA) 2001, 279-288.
Richard Cole, Ramesh Hariharan, Moshe Lewenstein and Porat Ely.
A Faster Implemention of Gomans-Williamson
Clustering Algorithm
Appeared in Proceedings of the Symposium of Discrete Algorithms (SODA) 2001,
17-25.
Amihood Amir, Yonatan Aumann,
Moshe Lewenstein and Ely Porat.
A New Search Model for Applications in Software Engineering,
Biology and Computer Vision.
Manuscript (2001).
Yossi Matias and Ely Porat.
List traversal synopsis - with applications.
Appeared in International Colloquium on Automata, Languages and Programming
(ICALP)
2003, 918-929.
Amihood Amir, Yonatan Aumann,
Richard Cole, Moshe Lewenstein and Ely Porat.
Function Matching: Algorithms, Applications and Lower Bound
Appeared in International Colloquium on Automata, Languages and Programming
(ICALP)
2003, 929-942.
Amihood Amir, Ayelet
Butman, Moshe Lewenstein and Ely Porat.
Real Two Dimensional Scaled Matching.
Appeared in Workshop on Algorithms and Data Structures
(WADS)
2003, 353-364.
Piotr Indyk, Ohad Lipsky, Moshe Lewenstein and Ely Porat.
Closest Pair in Very High Dimensions.
Appeared in Proc. of International Colloquium on Automata,
Languages
and Programming (ICALP), 2004, 782-792.
Amihood Amir, Esterella
Eisenberg
and Ely Porat.
Swap and Mismatch Edit Distance.
Appeared in Proc. of European
Symposium on Algorithms (ESA), 2004: 16-27
Amihood Amir, Ayelet Butman,
Moshe Lewenstein, Ely Porat and Dekel Tsur.
One Dimensional Real Scaled Matching,
Appeared in Proc. of String Processing and Information Retrieval (SPIRE),
2004:
1-9.
Amihood Amir, Ohad Lipsky, Ely Porat and Julia Umanski.
Approximate Matching in the L1 Metric.
Appeared in Combinatorial Pattern Matching (CPM), 2005 91-103.
Tsvi
Kopelowitz and Ely Porat.
Improved Algorithms for Polynomial Time-Decay and
Time-Decay
with Additive error.
Appeared in Italian Conference on Theoretical Computer
Science (ICTCS), 2005: 309-322.
Ohad
Lipsky and Ely Porat.
Approximate Matching in the $L_\infty$ Metric.
Appeared in Proc. of String Processing and Information Retrieval (SPIRE),
2005:
331-334.
Ohad
Lipsky and Ely Porat.
$L_1$ Pattern Matching Lower Bound.
Appeared in Proc. of String Processing and Information Retrieval (SPIRE),
2005:
327-330.
Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena
and Uzi Vishne.
Pattern Matching with Address Errors: Rearrangement Distances.
Appeared in Proceedings of the Symposium on Discrete
Algorithms (SODA), 2006: 1221-1229.
Amihood Amir, Costas S. Iliopoulos, Oren Kapah and Ely Porat.
Approximate Matching in Weighted
Sequences.
Appeared in Combinatorial Pattern Matching (CPM) 2006:
365-376.
Haim Kaplan, Ely Porat and N. Shafrir.
Finding the Position of the k-Mismatch and Approximate
Tandem
Repeats.
Appeared in ScandinavianWorkshop
on
Algorithm Theory (SWAT) 2006: 90-101.
Michael Furman, Yossi Matias and Ely Porat.
LTS: The List-Traversal Synopses System.
Appeared in Next Generation Information Technologies and
Systems (NGITS) 2006: 353-354.
Ely Porat and Ohad Lipsky.
Improved Sketching of Hamming Distance with Error.
Appeared in Combinatorial Pattern Matching (CPM), 2007 173-182
Video
lecture
Oren Kapah, Amihood Amir and Ely Porat.
Deterministic Length Reduction: Fast Convolution in Sparse Data.
Appeared in Combinatorial Pattern Matching (CPM), 2007 183-194.
Ely Porat
Range Non-overlapping Indexing.
Menuscript Febuary 2007.
Ely Porat
An Optimal Bloom Filter Replacement Based on Matrix Solving
Technical Report 2007.
Ayelet Butman, Noa Lewenstein, Benny Porat and Ely Porat.
Jump-Matching with Errors.
Proc. of String Processing and Information Retrieval (SPIRE), 2007 98-106.
Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy and Ely Porat.
Efficient Computations of L_1 and L_\infty Rearrangement Distances.
Appeared in Proc. of String Processing and Information Retrieval (SPIRE), 2007 39-49.
Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat and Asaf Tsur.
Approximate Swap and Mismatch Edit Distance.
Appeared in Proc. of String Processing and Information Retrieval (SPIRE), 2007 149-163.
Raphael Clifford and Ely Porat.
A Filtering Algorithm for k-Mismatch with Don't Cares.
Appeared in Proc. of String Processing and Information Retrieval (SPIRE), 2007 130-136.
Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy and Ely Porat.
On the Cost of Interchange Rearrangement in Strings.
Appeared in European Symposium on Algorithms (ESA), 2007 99-110.
Raphael Clifford, Klim Efremenko, Ely Porat and Amir Rothschild.
k-Mismatch with Don't Cares.
Appeared in European Symposium on Algorithms (ESA), 2007 151-162.
Ohad Lipsky, Benny Porat, Ely Porat, Riva Shalom and Asaf Tsur.
Approximate String Matching with Swaps and Mismatches.
Appeared in International Symposium on Algorithms and Computation (ISAAC), 2007
Ely Porat and Klim Efremenko.
Approximating General Metric Distances Between a Pattern anda Text.
Appeared in Symposium on Discrete Algorithms (SODA), 2008
Yoram Bachrach and Jeffrey S. Rosenschein and Ely Porat.
Power and stability in connectivity games.
Appeared in International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2008
Amihood Amir and Oren Kapah and Ely Porat and Amir Rothschild
Improved Deterministic Length Reduction
CoRR abs/0802.0017: (2008)
Ely Porat and Amir Rothschild
Explicit Non-adaptive Combinatorial Group Testing Schemes.
Appeared in International Colloquium on Automata, Languages and Programming
(ICALP) (1) 2008: 748-759
Raphael Clifford and Klim Efremenko and Benny Porat and Ely Porat
A Black Box for Online Approximate Pattern Matching.
Appeared in Combinatorial Pattern Matching (CPM) 2008: 143-151
Amihood Amir and Yonatan Aumann and Oren Kapah and Avivit Levy and Ely Porat
Approximate String Matching with Address Bit Errors.
Appeared in Combinatorial Pattern Matching (CPM) 2008: 118-129