Ely Porat

Department of Computer Science
Bar-Ilan University
Ramat Gan 52900, Israel 

+972-3-738-4572 (voice) 
+972-3-738-4056 (fax) 
porately@cs.biu.ac.il 
office: room 221 
 

 

Brief Biography:

Ely joined Bar-Ilan university in 2000, and was promoted to Associate Professor in 2007.
Ely was highly involved in the teaching committee back from year 2000, and he was part of the team who redefine the BS.c degree in computer science at Bar-Ilan university.
Ely hold as well a visiting professor position in Michigan university and Tel Aviv University.
Ely also spent one semester in Google Mountain View in 2007, and in 2011 he was a consultor in Google Tel Aviv.

Main Research Interests:

Students:

Algorithm 2 presentation

Ely is recruiting Postdocs and Ph.d students, who published at least 2 papers during their MS.c.
An excellent MS.c student might be considered as well.
Ely is hosting as well Ph.d students/Postdocs/Researchers from abroad for short term up to 3 months.

Current students:
Ariel Shiftan, Guy Feigenblat, Bar Shalem, Erez Waisbard, Neta Barkay, Amiad Rosenberg, Or Landesman.
Former students:
Ohad Lipsky, Estella Eisenberg (Co-advise with Amir Amihood), Michael Furman (Co-adise with Yossi Matias), Amir Rothschild, Klim Efremenko (Didn't finish, moved to Weizmann), Asaf Zur, Haggai Cohen, Benny Porat.
Short term visitors:
Martin J. Strauss, David P. Woodruff, Anna C. Gilbert, Jelani Nelson, Eric Price, Yoram Bachrach, Shachar Lovett, Andrew McGregor.


Activities:

Organize:
Stringology 2009, Stringology 2010, Stringology 2011, ICALP2011GT, UM Coding, IMA Group testing.
Committees:
CPM 2004, SPIRE 2008, ESA 2009, CPM 2010, SPIRE 2011.

This web page does not update very often, therefore for a full list of publication go to DBLP

Publications
2011
Guy Feigenblat, Ely Porat, Ariel Shiftan
Even Better Framework for min-wise Based Algorithms,
CoRR abs/1102.3537: (2011)
2010
Yoram Bachrach, Ely Porat
Path disruption games,
AAMAS 2010: 1123-1130
Shachar Lovett, Ely Porat
A Lower Bound for Dynamic Approximate Membership Data Structures,
FOCS 2010: 797-804
Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira
Cycle Detection and Correction,
ICALP (1) 2010: 43-54
Tali Kaufman, Shachar Lovett, Ely Porat
Weight Distribution and List-Decoding Size of Reed-Muller Codes,
ICS 2010: 422-433
Hagai Cohen, Ely Porat
Fast Set Intersection and Two-Patterns Matching,
LATIN 2010: 234-242
Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat
Approximate String Matching with Stuck Address Bits,
SPIRE 2010: 395-405
Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
Approximate sparse recovery: optimizing time and measurements,
STOC 2010: 475-484
Hagai Cohen, Ely Porat
On the hardness of distance oracle for sparse graph,
CoRR abs/1006.1117: (2010)
Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff
Fast Moment Estimation in Data Streams in Optimal Space,
CoRR abs/1007.4191: (2010)
Yoram Bachrach, Ely Porat
Fast Pseudo-Random Fingerprints,
CoRR abs/1009.5791: (2010)
Ely Porat, Martin J. Strauss
Sublinear Time, Measurement-Optimal, Sparse Recovery For All,
CoRR abs/1012.1886: (2010)
Shachar Lovett, Ely Porat
A lower bound for dynamic approximate membership data structures,
Electronic Colloquium on Computational Complexity (ECCC) 17: 87 (2010)
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)
Maxime Crochemore, Ely Porat
Fast computation of a longest increasing subsequence and application,
Inf. Comput. 208(9): 1054-1059 (2010)
Raphaël Clifford, Ely Porat
A filtering algorithm for k-mismatch with don't cares,
Inf. Process. Lett. 110(22): 1021-1025 (2010)
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)
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)
Hagai Cohen, Ely Porat
Fast set intersection and two-patterns matching,
Theor. Comput. Sci. 411(40-42): 3795-3800 (2010)
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)
2009
Ely Porat
An Optimal Bloom Filter Replacement Based on Matrix Solving,
CSR 2009: 263-273
Benny Porat, Ely Porat
Exact and Approximate Pattern Matching in the Streaming Model,
FOCS 2009: 315-323
Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein
Sketching Techniques for Collaborative Filtering,
IJCAI 2009: 2016-2021
Hagai Cohen, Ely Porat
Range Non-overlapping Indexing,
ISAAC 2009: 1044-1053
Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
From coding theory to efficient pattern matching,
SODA 2009: 778-784
Guy Feigenblat, Ofra Itzhaki, Ely Porat
The Frequent Items Problem, under Polynomial Decay, in the Streaming Model,
SPIRE 2009: 266-276
Ariel Shiftan, Ely Porat
Set Intersection and Sequence Matching,
SPIRE 2009: 285-294
Yoram Bachrach, Ralf Herbrich, Ely Porat
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems,
SPIRE 2009: 344-352
Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat
Real Two Dimensional Scaled Matching,
Algorithmica 53(3): 314-336 (2009)
Hagai Cohen, Ely Porat
Range Non-Overlapping Indexing,
CoRR abs/0909.4893: (2009)
Hagai Cohen, Ely Porat
Fast Set Intersection and Two Patterns Matching,
CoRR abs/0909.5146: (2009)
Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
Approximate Sparse Recovery: Optimizing Time and Measurements,
CoRR abs/0912.0229: (2009)
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)
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)
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)
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)
2008
Yoram Bachrach, Jeffrey S. Rosenschein, Ely Porat
Power and stability in connectivity games,
AAMAS (2) 2008: 999-1006
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
Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat
Approximate String Matching with Address Bit Errors,
CPM 2008: 118-129
Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat
A Black Box for Online Approximate Pattern Matching,
CPM 2008: 143-151
Ely Porat, Amir Rothschild
Explicit Non-adaptive Combinatorial Group Testing Schemes,
ICALP (1) 2008: 748-759
Ely Porat, Klim Efremenko
Approximating general metric distances between a pattern and a text,
SODA 2008: 419-427
Ohad Lipsky, Ely Porat
Approximated Pattern Matching with the L1, L2 and Linfinit Metrics,
SPIRE 2008: 212-223
Benny Porat, Ely Porat, Asaf Zur
Pattern Matching with Pair Correlation Distance,
SPIRE 2008: 249-256
Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild
Mismatch Sampling,
SPIRE 2008: 99-108
Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild
Improved Deterministic Length Reduction,
CoRR abs/0802.0017: (2008)
Klim Efremenko, Ely Porat
Approximating General Metric Distances Between a Pattern and a Text,
CoRR abs/0802.1427: (2008)
Ely Porat
An Optimal Bloom Filter Replacement Based on Matrix Solving,
CoRR abs/0804.1845: (2008)
Ohad Lipsky, Ely Porat
Approximate matching in the Linfinity metric,
Inf. Process. Lett. 105(4): 138-140 (2008)
Ohad Lipsky, Ely Porat
L1 pattern matching lower bound,
Inf. Process. Lett. 105(4): 141-143 (2008)
Benny Porat, Ely Porat, Asaf Zur
Pattern matching with pair correlation distance,
Theor. Comput. Sci. 407(1-3): 587-590 (2008)
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
Ely Porat, Ohad Lipsky
Improved Sketching of Hamming Distance with Error Correcting,
CPM 2007: 173-182
Amihood Amir, Oren Kapah, Ely Porat
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications,
CPM 2007: 183-194
Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
k -Mismatch with Don't Cares,
ESA 2007: 151-162
Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat
On the Cost of Interchange Rearrangement in Strings,
ESA 2007: 99-110
Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur
Approximate String Matching with Swap and Mismatch,
ISAAC 2007: 869-880
Raphaël Clifford, Ely Porat
A Filtering Algorithm for k -Mismatch with Don't Cares,
SPIRE 2007: 130-136
Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur
Approximate Swap and Mismatch Edit Distance,
SPIRE 2007: 149-163
Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
Efficient Computations of l1 and linfinity Rearrangement Distances,
SPIRE 2007: 39-49
Ayelet Butman, Noa Lewenstein, Benny Porat, Ely Porat
Jump-Matching with Errors,
SPIRE 2007: 98-106
Ely Porat, Amir Rothschild
Explicit Non-Adaptive Combinatorial Group Testing Schemes,
CoRR abs/0712.3876: (2007)
Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
Efficient one-dimensional real scaled matching,
J. Discrete Algorithms 5(2): 205-211 (2007)
Yossi Matias, Ely Porat
Efficient pebbling for list traversal synopses with application to program rollback,
Theor. Comput. Sci. 379(3): 418-436 (2007)
2006
Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat
Approximate Matching in Weighted Sequences,
CPM 2006: 365-376
Michael Furman, Yossi Matias, Ely Porat
LTS: The List-Traversal Synopses System,
NGITS 2006: 353-354
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
Haim Kaplan, Ely Porat, Nira Shafrir
Finding the Position of the k-Mismatch and Approximate Tandem Repeats,
SWAT 2006: 90-101
Amihood Amir, Estrella Eisenberg, Ely Porat
Swap and Mismatch Edit Distance,
Algorithmica 45(1): 109-120 (2006)
Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat
Function Matching,
SIAM J. Comput. 35(5): 1007-1022 (2006)
2005
Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski
Approximate Matching in the L1 Metric,
CPM 2005: 91-103
Tsvi Kopelowitz, Ely Porat
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error,
ICTCS 2005: 309-322
Ohad Lipsky, Ely Porat
L1 Pattern Matching Lower Bound,
SPIRE 2005: 327-330
Ohad Lipsky, Ely Porat
Approximate Matching in the Linfinity Metric,
SPIRE 2005: 331-334
2004
Amihood Amir, Estrella Eisenberg, Ely Porat
Swap and Mismatch Edit Distance,
ESA 2004: 16-27
Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat
Closest Pair Problems in Very High Dimensions,
ICALP 2004: 782-792
Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
Efficient One Dimensional Real Scaled Matching,
SPIRE 2004: 1-9
Amihood Amir, Moshe Lewenstein, Ely Porat
Faster algorithms for string matching with k mismatches,
J. Algorithms 50(2): 257-275 (2004)
2003
Yossi Matias, Ely Porat
Efficient Pebbling for List Traversal Synopses,
ICALP 2003: 918-928
Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
Function Matching: Algorithms, Applications, and a Lower Bound,
ICALP 2003: 929-942
Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat
Real Two Dimensional Scaled Matching,
WADS 2003: 353-364
Yossi Matias, Ely Porat
Efficient pebbling for list traversal synopses,
CoRR cs.DS/0306104: (2003)
Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
Overlap matching,
Inf. Comput. 181(1): 57-74 (2003)
2002
Amihood Amir, Moshe Lewenstein, Ely Porat
Approximate swapped matching,
Inf. Process. Lett. 83(1): 33-39 (2002)
2001
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
A faster implementation of the Goemans-Williamson clustering algorithm,
SODA 2001: 17-25
Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
Overlap matching,
SODA 2001: 279-288
Amihood Amir, Ely Porat, Moshe Lewenstein
Approximate subset matching with Don't Cares,
SODA 2001: 305-306
2000
Amihood Amir, Moshe Lewenstein, Ely Porat
Approximate Swapped Matching,
FSTTCS 2000: 302-311
Amihood Amir, Moshe Lewenstein, Ely Porat
Faster algorithms for string matching with k mismatches,
SODA 2000: 794-803