Ely Porat - RankMe

245 papers A* 31A 17B 37C 18Misc 2Journal 118Unranked 21

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Locally Consistent Parsing for Text Indexing in Small Space. SIAM J. Comput. Or Birenzwige, Shay Golan, Ely Porat
2025	C	`conf`	Longest Common Subsequence in K-Length Substrings for Run-Length Encoded Strings. SPIRE B. Riva Shalom, Eitan Kondratovsky, Ely Porat
2025	B	`conf`	Monitoring Distributed Systems Based on Partial Order Executions with Global States. RV Moran Omer, Doron Peled, Ely Porat, Vijay K. Garg
2025	J	`jnl`	Partial permutations comparison, maintenance and applications. Theor. Comput. Sci. Avivit Levy, Ely Porat, B. Riva Shalom
2024	J	`jnl`	An Improved Algorithm for The ACM Trans. Algorithms Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
2024	C	`conf`	Burst Edit Distance. SPIRE Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom
2024	—	`conf`	FiSSC: Finding smallest sequence covers to sets of degenerate reads with applications to RNA editing. BCB Ido Tziony, Jonathan Mandl, Kobi Shapira, Eli Eisenberg, Ely Porat, Yaron Orenstein
2024	J	`jnl`	Iteration-Free quantum approximate optimization algorithm using neural networks. Quantum Mach. Intell. Ohad Amosy, Tamuz Danzig, Ohad Lev, Ely Porat, Gal Chechik, Adi Makmal
2024	A	`conf`	Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices. ESA Dvir Fried, Tsvi Kopelowitz, Ely Porat
2023	B	`conf`	String Factorization via Prefix Free Families. CPM Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia
2022	A*	`conf`	An Improved Algorithm for The k-Dyck Edit Distance Problem. SODA Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
2022	B	`conf`	Partial Permutations Comparison, Maintenance and Applications. CPM Avivit Levy, Ely Porat, B. Riva Shalom
2021	J	`jnl`	An Improved Algorithm for The k-Dyck Edit Distance Problem. CoRR Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
2021	J	`jnl`	Avoiding Flow Size Overestimation in Count-Min Sketch With Bloom Filter Constructions. IEEE Trans. Netw. Serv. Manag. Ori Rottenstreich, Pedro Reviriego, Ely Porat, S. Muthukrishnan
2021	A	`conf`	Incremental Edge Orientation in Forests. ESA Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein
2021	J	`jnl`	Incremental Edge Orientation in Forests. CoRR Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein
2021	J	`jnl`	Small space and streaming pattern matching with k edits. CoRR Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya
2021	A*	`conf`	Small-space and streaming pattern matching with $k$ edits. FOCS Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya
2021	B	`conf`	Support Optimality and Adaptive Cuckoo Filters. WADS Tsvi Kopelowitz, Samuel McCauley, Ely Porat
2021	J	`jnl`	Support Optimality and Adaptive Cuckoo Filters. CoRR Tsvi Kopelowitz, Samuel McCauley, Ely Porat
2020	A*	`conf`	An PODC Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat
2020	J	`jnl`	An O(log CoRR Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat
2020	J	`jnl`	Approximating Text-to-Pattern Hamming Distances. CoRR Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2020	A*	`conf`	Approximating text-to-pattern Hamming distances. STOC Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2020	—	`conf`	Constructions and Applications for Accurate Counting of the Bloom Filter False Positive Free Zone. SOSR Ori Rottenstreich, Pedro Reviriego, Ely Porat, S. Muthukrishnan
2020	—	`conf`	Improved Circular k-Mismatch Sketches. APPROX-RANDOM Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski
2020	J	`jnl`	Improved Circular k-Mismatch Sketches. CoRR Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski
2020	A*	`conf`	Locally Consistent Parsing for Text Indexing in Small Space. SODA Or Birenzwige, Shay Golan, Ely Porat
2020	J	`jnl`	Online recognition of dictionary with one gap. Inf. Comput. Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
2020	B	`conf`	The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. CPM Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2020	J	`jnl`	The Streaming k-Mismatch Problem: Tradeoffs between Space and Total Time. CoRR Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2019	J	`jnl`	Approximate cover of strings. Theor. Comput. Sci. Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat
2019	B	`conf`	Dynamic Dictionary Matching in the Online Model. WADS Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
2019	J	`jnl`	Mind the Gap! - Online Dictionary Matching with One Gap. Algorithmica Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
2019	B	`conf`	On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. ISAAC Isaac Goldstein, Moshe Lewenstein, Ely Porat
2019	J	`jnl`	On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. CoRR Isaac Goldstein, Moshe Lewenstein, Ely Porat
2019	J	`jnl`	Streaming Pattern Matching with d Wildcards. Algorithmica Shay Golan, Tsvi Kopelowitz, Ely Porat
2019	J	`jnl`	The Strong 3SUM-INDEXING Conjecture is False. CoRR Tsvi Kopelowitz, Ely Porat
2019	A*	`conf`	The streaming k-mismatch problem. SODA Raphaël Clifford, Tomasz Kociumaka, Ely Porat
2019	J	`jnl`	{-1, 0, 1}-APSP and (min, max)-Product Problems. CoRR Hodaya Barr, Tsvi Kopelowitz, Ely Porat, Liam Roditty
2018	—	`conf`	A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance. SOSA Tsvi Kopelowitz, Ely Porat
2018	J	`jnl`	Identification of Parallel Passages Across a Large Hebrew/Aramaic Corpus. J. Data Min. Digit. Humanit. Avi Shmidman, Moshe Koppel, Ely Porat
2018	A	`conf`	Improved Space-Time Tradeoffs for kSUM. ESA Isaac Goldstein, Moshe Lewenstein, Ely Porat
2018	J	`jnl`	Improved Space-Time Tradeoffs for kSUM. CoRR Isaac Goldstein, Moshe Lewenstein, Ely Porat
2018	B	`conf`	Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest. SPAA Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter
2018	J	`jnl`	Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest. CoRR Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter
2018	J	`jnl`	Locally Consistent Parsing for Text Indexing in Small Space. CoRR Or Birenzwige, Shay Golan, Ely Porat
2018	B	`conf`	Quasi-Periodicity Under Mismatch Errors. CPM Amihood Amir, Avivit Levy, Ely Porat
2018	A*	`conf`	Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams. ICALP Shay Golan, Tsvi Kopelowitz, Ely Porat
2018	J	`jnl`	Worst-case Optimal Join Algorithms. J. ACM Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra
2017	J	`jnl`	A Grouping Approach for Succinct Dynamic Dictionary Matching. Algorithmica Guy Feigenblat, Ely Porat, Ariel Shiftan
2017	B	`conf`	Approximate Cover of Strings. CPM Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat
2017	B	`conf`	Conditional Lower Bounds for Space/Time Tradeoffs. WADS Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
2017	J	`jnl`	Conditional Lower Bounds for Space/Time Tradeoffs. CoRR Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
2017	J	`jnl`	Erratum to: A Grouping Approach for Succinct Dynamic Dictionary Matching. Algorithmica Guy Feigenblat, Ely Porat, Ariel Shiftan
2017	J	`jnl`	For-All Sparse Recovery in Near-Optimal Time. ACM Trans. Algorithms Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2017	J	`jnl`	How Hard is it to Find (Honest) Witnesses? CoRR Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
2017	Misc	`conf`	Online Recognition of Dictionary with One Gap. PSC Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
2017	B	`conf`	Orthogonal Vectors Indexing. ISAAC Isaac Goldstein, Moshe Lewenstein, Ely Porat
2017	J	`jnl`	Orthogonal Vectors Indexing. CoRR Isaac Goldstein, Moshe Lewenstein, Ely Porat
2017	A	`conf`	Real-Time Streaming Multi-Pattern Search for Constant Alphabet. ESA Shay Golan, Ely Porat
2017	A	`conf`	Simultaneously Load Balancing for Every p-norm, With Reassignments. ITCS Aaron Bernstein, Tsvi Kopelowitz, Seth Pettie, Ely Porat, Clifford Stein
2017	J	`jnl`	Streaming Pattern Matching with d Wildcards. CoRR Shay Golan, Tsvi Kopelowitz, Ely Porat
2017	J	`jnl`	The streaming k-mismatch problem. CoRR Raphaël Clifford, Tomasz Kociumaka, Ely Porat
2017	J	`jnl`	d-k-min-wise independent family of hash functions. J. Comput. Syst. Sci. Guy Feigenblat, Ely Porat, Ariel Shiftan
2016	J	`jnl`	Addendum to 'Exponential time improvement for min-wise based algorithms' [Information and Computation 209 (2011) 737-747]. Inf. Comput. Guy Feigenblat, Ely Porat, Ariel Shiftan
2016	J	`jnl`	Corrigendum to "The frequent items problem, under polynomial decay, in the streaming model" [Theoret. Comput. Sci. 411(34-36) (2010) 3048-3054]. Theor. Comput. Sci. Guy Feigenblat, Ofra Itzhaki, Ely Porat
2016	A*	`conf`	Distance Labeling Schemes for Trees. ICALP Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat
2016	A*	`conf`	Higher Lower Bounds from the 3SUM Conjecture. SODA Tsvi Kopelowitz, Seth Pettie, Ely Porat
2016	A	`conf`	How Hard is it to Find (Honest) Witnesses?. ESA Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
2016	J	`jnl`	Identification of Parallel Passages Across a Large Hebrew/Aramaic Corpus. CoRR Avi Shmidman, Moshe Koppel, Ely Porat
2016	B	`conf`	Linear Time Succinct Indexable Dictionary Construction with Applications. DCC Guy Feigenblat, Ely Porat, Ariel Shiftan
2016	B	`conf`	Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap. ISAAC Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
2016	A	`conf`	New Parameterized Algorithms for APSP in Directed Graphs. ESA Ely Porat, Eduard Shahbazian, Roei Tov
2016	J	`jnl`	Optimal In/Out TCAM Encodings of Ranges. IEEE/ACM Trans. Netw. Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat
2016	J	`jnl`	Set Intersection and Sequence Matching with mismatch counting. Theor. Comput. Sci. Ariel Shiftan, Ely Porat
2016	J	`jnl`	Special issue in honor of the 60th birthday of Amihood Amir. Theor. Comput. Sci. Gary Benson, Martin Farach-Colton, Moshe Lewenstein, Ely Porat
2016	A	`conf`	Streaming Pattern Matching with d Wildcards. ESA Shay Golan, Tsvi Kopelowitz, Ely Porat
2016	A	`conf`	Sublinear Distance Labeling. ESA Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat
2016	B	`conf`	Succinct Online Dictionary Matching with Improved Worst-Case Guarantees. CPM Tsvi Kopelowitz, Ely Porat, Yaron Rozen
2016	A*	`conf`	The SODA Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
2016	B	`conf`	The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. SPAA Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat
2015	J	`jnl`	A PTAS for the Square Tiling Problem. Theor. Comput. Sci. Amihood Amir, Alberto Apostolico, Gad M. Landau, Ely Porat, Oren Sar Shalom
2015	J	`jnl`	Breaking the Variance: Approximating the Hamming Distance in $\tilde O(1/ε)$ Time Per Alignment. CoRR Tsvi Kopelowitz, Ely Porat
2015	A*	`conf`	Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per Alignment. FOCS Tsvi Kopelowitz, Ely Porat
2015	B	`ed.`	Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings CPM Ferdinando Cicalese, Ely Porat, Ugo Vaccaro
2015	A	`conf`	Dictionary Matching in a Stream. ESA Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
2015	J	`jnl`	Dictionary matching in a stream. CoRR Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
2015	J	`jnl`	Dictionary matching with a few gaps. Theor. Comput. Sci. Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
2015	J	`jnl`	Distance labeling schemes for trees. CoRR Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat
2015	B	`conf`	Dynamic Set Intersection. WADS Tsvi Kopelowitz, Seth Pettie, Ely Porat
2015	J	`jnl`	Efficient sampling of non-strict turnstile data streams. Theor. Comput. Sci. Neta Barkay, Ely Porat, Bar Shalem
2015	J	`jnl`	Fingerprints for highly similar streams. Inf. Comput. Yoram Bachrach, Ely Porat
2015	J	`jnl`	Online Dictionary Matching with One Gap. CoRR Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
2015	J	`jnl`	Sublinear distance labeling for sparse graphs. CoRR Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat
2015	J	`jnl`	The k-mismatch problem revisited. CoRR Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
2014	B	`conf`	(Near) optimal resource-competitive broadcast with jamming. SPAA Seth Gilbert, Valerie King, Seth Pettie, Ely Porat, Jared Saia, Maxwell Young
2014	J	`jnl`	3SUM Hardness in (Dynamic) Data Structures. CoRR Tsvi Kopelowitz, Seth Pettie, Ely Porat
2014	B	`conf`	An Improved Query Time for Succinct Dynamic Dictionary Matching. CPM Guy Feigenblat, Ely Porat, Ariel Shiftan
2014	A	`conf`	Building a personalized tourist attraction recommender system using crowdsourcing. AAMAS Yoram Bachrach, Sofia Ceppi, Ian A. Kash, Peter B. Key, Filip Radlinski, Ely Porat, Michael Armstrong, Vijay Sharma
2014	B	`conf`	Dictionary Matching with One Gap. CPM Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
2014	J	`jnl`	Dictionary Matching with One Gap. CoRR Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
2014	—	`conf`	For-All Sparse Recovery in Near-Optimal Time. ICALP (1) Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2014	J	`jnl`	For-all Sparse Recovery in Near-Optimal Time. CoRR Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2014	—	`conf`	Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. ICALP (2) Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon
2014	J	`jnl`	Polynomials: a new tool for length reduction in binary discrete convolutions. CoRR Amihood Amir, Oren Kapah, Ely Porat, Amir Rothschild
2014	J	`jnl`	Range LCP. J. Comput. Syst. Sci. Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
2014	J	`jnl`	Sharing Rewards in Cooperative Connectivity Games. CoRR Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein
2014	J	`jnl`	The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. CoRR Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat
2014	J	`jnl`	Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets. CoRR Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Ely Porat
2013	J	`jnl`	A Space Lower Bound for Dynamic Approximate Membership Data Structures. SIAM J. Comput. Shachar Lovett, Ely Porat
2013	B	`conf`	Efficient Sampling of Non-strict Turnstile Data Streams. FCT Neta Barkay, Ely Porat, Bar Shalem
2013	J	`jnl`	Guest Editorial for "Group Testing: models and applications". Algorithmica Ferdinando Cicalese, Ely Porat
2013	A*	`conf`	Homomorphic fingerprints under misalignments: sketching edit and shift distances. STOC Alexandr Andoni, Assaf Goldberger, Andrew McGregor, Ely Porat
2013	J	`jnl`	L2/L2-foreach sparse recovery with low risk CoRR Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss
2013	A*	`conf`	On finding an optimal TCAM encoding scheme for packet classification. INFOCOM Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat
2013	J	`jnl`	Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. CoRR Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon
2013	J	`jnl`	Pattern Matching under Polynomial Transformation. SIAM J. Comput. Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach
2013	J	`jnl`	Preprocess, Set, Query! Algorithmica Ely Porat, Liam Roditty
2013	J	`jnl`	Sharing Rewards in Cooperative Connectivity Games. J. Artif. Intell. Res. Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein
2013	—	`conf`	Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints. ICALP (2) Yoram Bachrach, Ely Porat
2013	J	`jnl`	Space lower bounds for online pattern matching. Theor. Comput. Sci. Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2013	C	`ed.`	String Processing and Information Retrieval - 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings SPIRE Oren Kurland, Moshe Lewenstein, Ely Porat
2013	—	`conf`	ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk. ICALP (1) Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss
2012	B	`conf`	A Cuckoo Hashing Variant with Improved Memory Utilization and Insertion Time. DCC Ely Porat, Bar Shalem
2012	J	`jnl`	Approximate Sparse Recovery: Optimizing Time and Measurements. SIAM J. Comput. Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2012	J	`jnl`	Cycle detection and correction. ACM Trans. Algorithms Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira
2012	B	`conf`	Efficient signature scheme for network coding. ISIT Ely Porat, Erez Waisbard
2012	A	`conf`	Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. STACS Hung Q. Ngo, Ely Porat, Atri Rudra
2012	—	`conf`	Exponential Space Improvement for minwise Based Algorithms. FSTTCS Guy Feigenblat, Ely Porat, Ariel Shiftan
2012	J	`jnl`	Feasible Sampling of Non-strict Turnstile Data Streams CoRR Neta Barkay, Ely Porat, Bar Shalem
2012	J	`jnl`	Mismatch sampling. Inf. Comput. Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild
2012	J	`jnl`	Pattern Matching in Multiple Streams CoRR Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2012	B	`conf`	Pattern Matching in Multiple Streams. CPM Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2012	A*	`conf`	Sublinear time, measurement-optimal, sparse recovery for all. SODA Ely Porat, Martin J. Strauss
2012	J	`jnl`	Weight Distribution and List-Decoding Size of Reed-Muller Codes. IEEE Trans. Inf. Theory Tali Kaufman, Shachar Lovett, Ely Porat
2012	J	`jnl`	Worst-case Optimal Join Algorithms CoRR Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra
2012	A*	`conf`	Worst-case optimal join algorithms: [extended abstract]. PODS Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra
2011	J	`jnl`	A black box for online approximate pattern matching. Inf. Comput. Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat
2011	J	`jnl`	Another one flew over the cuckoo's nest CoRR Ely Porat, Bar Shalem
2011	J	`jnl`	Approximate Pattern Matching with the Algorithmica Ohad Lipsky, Ely Porat
2011	J	`jnl`	Approximate string matching with stuck address bits. Theor. Comput. Sci. Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat
2011	—	`conf`	Camouflaged Private Communication. SocialCom/PASSAT Amir Herzberg, Ely Porat, Nir Soffer, Erez Waisbard
2011	—	`conf`	Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract). ICALP (1) Hung Q. Ngo, Ely Porat, Atri Rudra
2011	J	`jnl`	Even Better Framework for min-wise Based Algorithms CoRR Guy Feigenblat, Ely Porat, Ariel Shiftan
2011	J	`jnl`	Explicit Nonadaptive Combinatorial Group Testing Schemes. IEEE Trans. Inf. Theory Ely Porat, Amir Rothschild
2011	A*	`conf`	Exponential Time Improvement for min-wise Based Algorithms. SODA Guy Feigenblat, Ely Porat, Ariel Shiftan
2011	J	`jnl`	Exponential time improvement for min-wise based algorithms. Inf. Comput. Guy Feigenblat, Ely Porat, Ariel Shiftan
2011	A*	`conf`	Fast moment estimation in data streams in optimal space. STOC Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff
2011	J	`jnl`	Pattern Matching under Polynomial Transformation CoRR Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach
2011	C	`conf`	Persistency in Suffix Trees with Applications to String Interval Problems. SPIRE Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
2011	A	`conf`	Preprocess, Set, Query! ESA Ely Porat, Liam Roditty
2011	B	`conf`	Range LCP. ISAAC Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
2011	J	`jnl`	Space Lower Bounds for Online Pattern Matching CoRR Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2011	B	`conf`	Space Lower Bounds for Online Pattern Matching. CPM Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2010	A*	`conf`	A Lower Bound for Dynamic Approximate Membership Data Structures. FOCS Shachar Lovett, Ely Porat
2010	J	`jnl`	A filtering algorithm for k-mismatch with don't cares. Inf. Process. Lett. Raphaël Clifford, Ely Porat
2010	J	`jnl`	A lower bound for dynamic approximate membership data structures. Electron. Colloquium Comput. Complex. Shachar Lovett, Ely Porat
2010	C	`conf`	Approximate String Matching with Stuck Address Bits. SPIRE Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat
2010	A*	`conf`	Approximate sparse recovery: optimizing time and measurements. STOC Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2010	—	`conf`	Cycle Detection and Correction. ICALP (1) Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira
2010	J	`jnl`	Fast Moment Estimation in Data Streams in Optimal Space CoRR Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff
2010	J	`jnl`	Fast Pseudo-Random Fingerprints CoRR Yoram Bachrach, Ely Porat
2010	B	`conf`	Fast Set Intersection and Two-Patterns Matching. LATIN Hagai Cohen, Ely Porat
2010	J	`jnl`	Fast computation of a longest increasing subsequence and application. Inf. Comput. Maxime Crochemore, Ely Porat
2010	J	`jnl`	Fast set intersection and two-patterns matching. Theor. Comput. Sci. Hagai Cohen, Ely Porat
2010	J	`jnl`	On the hardness of distance oracle for sparse graph CoRR Hagai Cohen, Ely Porat
2010	A	`conf`	Path disruption games. AAMAS Yoram Bachrach, Ely Porat
2010	J	`jnl`	Pattern matching with don't cares and few errors. J. Comput. Syst. Sci. Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
2010	J	`jnl`	String matching with up to k swaps and mismatches. Inf. Comput. Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur
2010	J	`jnl`	Sublinear Time, Measurement-Optimal, Sparse Recovery For All CoRR Ely Porat, Martin J. Strauss
2010	J	`jnl`	The approximate swap and mismatch edit distance. Theor. Comput. Sci. Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur
2010	J	`jnl`	The frequent items problem, under polynomial decay, in the streaming model. Theor. Comput. Sci. Guy Feigenblat, Ofra Itzhaki, Ely Porat
2010	—	`ch.`	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 Benny Porat, Ely Porat
2010	A	`conf`	Weight Distribution and List-Decoding Size of Reed-Muller Codes. ICS Tali Kaufman, Shachar Lovett, Ely Porat
2009	Misc	`conf`	An Optimal Bloom Filter Replacement Based on Matrix Solving. CSR Ely Porat
2009	J	`jnl`	Approximate Sparse Recovery: Optimizing Time and Measurements CoRR Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2009	J	`jnl`	Approximate string matching with address bit errors. Theor. Comput. Sci. Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat
2009	J	`jnl`	Efficient computations of Theor. Comput. Sci. Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
2009	A*	`conf`	Exact and Approximate Pattern Matching in the Streaming Model. FOCS Benny Porat, Ely Porat
2009	—	`conf`	Explicit Non-Adaptive Combinatorial Group Testing Schemes. Search Methodologies Ely Porat, Amir Rothschild
2009	J	`jnl`	Fast Set Intersection and Two Patterns Matching CoRR Hagai Cohen, Ely Porat
2009	A*	`conf`	From coding theory to efficient pattern matching. SODA Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
2009	J	`jnl`	On the Cost of Interchange Rearrangement in Strings. SIAM J. Comput. Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat
2009	J	`jnl`	Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne
2009	—	`conf`	Pattern matching with don't cares and few errors. Search Methodologies Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
2009	J	`jnl`	Range Non-Overlapping Indexing CoRR Hagai Cohen, Ely Porat
2009	B	`conf`	Range Non-overlapping Indexing. ISAAC Hagai Cohen, Ely Porat
2009	J	`jnl`	Real Two Dimensional Scaled Matching. Algorithmica Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat
2009	C	`conf`	Set Intersection and Sequence Matching. SPIRE Ariel Shiftan, Ely Porat
2009	C	`conf`	Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems. SPIRE Yoram Bachrach, Ralf Herbrich, Ely Porat
2009	A*	`conf`	Sketching Techniques for Collaborative Filtering. IJCAI Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein
2009	C	`conf`	The Frequent Items Problem, under Polynomial Decay, in the Streaming Model. SPIRE Guy Feigenblat, Ofra Itzhaki, Ely Porat
2008	B	`conf`	A Black Box for Online Approximate Pattern Matching. CPM Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat
2008	J	`jnl`	An Optimal Bloom Filter Replacement Based on Matrix Solving CoRR Ely Porat
2008	B	`conf`	Approximate String Matching with Address Bit Errors. CPM Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat
2008	J	`jnl`	Approximate matching in the L Inf. Process. Lett. Ohad Lipsky, Ely Porat
2008	C	`conf`	Approximated Pattern Matching with the L1, L2 and L SPIRE Ohad Lipsky, Ely Porat
2008	J	`jnl`	Approximating General Metric Distances Between a Pattern and a Text CoRR Klim Efremenko, Ely Porat
2008	A*	`conf`	Approximating general metric distances between a pattern and a text. SODA Ely Porat, Klim Efremenko
2008	—	`conf`	Computing a Longest Increasing Subsequence of Length k in Time O(n log log k). BCS Int. Acad. Conf. Maxime Crochemore, Ely Porat
2008	—	`conf`	Explicit Non-adaptive Combinatorial Group Testing Schemes. ICALP (1) Ely Porat, Amir Rothschild
2008	J	`jnl`	Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. Theory Comput. Syst. Tsvi Kopelowitz, Ely Porat
2008	J	`jnl`	Improved Deterministic Length Reduction CoRR Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild
2008	J	`jnl`	L Inf. Process. Lett. Ohad Lipsky, Ely Porat
2008	C	`conf`	Mismatch Sampling. SPIRE Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild
2008	C	`conf`	Pattern Matching with Pair Correlation Distance. SPIRE Benny Porat, Ely Porat, Asaf Zur
2008	J	`jnl`	Pattern matching with pair correlation distance. Theor. Comput. Sci. Benny Porat, Ely Porat, Asaf Zur
2008	—	`conf`	Power and stability in connectivity games. AAMAS (2) Yoram Bachrach, Jeffrey S. Rosenschein, Ely Porat
2007	C	`conf`	A Filtering Algorithm for SPIRE Raphaël Clifford, Ely Porat
2007	B	`conf`	Approximate String Matching with Swap and Mismatch. ISAAC Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur
2007	C	`conf`	Approximate Swap and Mismatch Edit Distance. SPIRE Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur
2007	B	`conf`	Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. CPM Amihood Amir, Oren Kapah, Ely Porat
2007	C	`conf`	Efficient Computations of SPIRE Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
2007	J	`jnl`	Efficient one-dimensional real scaled matching. J. Discrete Algorithms Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
2007	J	`jnl`	Efficient pebbling for list traversal synopses with application to program rollback. Theor. Comput. Sci. Yossi Matias, Ely Porat
2007	J	`jnl`	Explicit Non-Adaptive Combinatorial Group Testing Schemes CoRR Ely Porat, Amir Rothschild
2007	B	`conf`	Improved Sketching of Hamming Distance with Error Correcting. CPM Ely Porat, Ohad Lipsky
2007	C	`conf`	Jump-Matching with Errors. SPIRE Ayelet Butman, Noa Lewenstein, Benny Porat, Ely Porat
2007	A	`conf`	On the Cost of Interchange Rearrangement in Strings. ESA Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat
2006	B	`conf`	Approximate Matching in Weighted Sequences. CPM Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat
2006	—	`conf`	Finding the Position of the SWAT Haim Kaplan, Ely Porat, Nira Shafrir
2006	J	`jnl`	Function Matching. SIAM J. Comput. Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat
2006	—	`conf`	LTS: The List-Traversal Synopses System. NGITS Michael Furman, Yossi Matias, Ely Porat
2006	A*	`conf`	Pattern matching with address errors: rearrangement distances. SODA Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne
2006	J	`jnl`	Swap and Mismatch Edit Distance. Algorithmica Amihood Amir, Estrella Eisenberg, Ely Porat
2005	B	`conf`	Approximate Matching in the L CPM Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski
2005	C	`conf`	Approximate Matching in the L SPIRE Ohad Lipsky, Ely Porat
2005	—	`conf`	Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. ICTCS Tsvi Kopelowitz, Ely Porat
2005	C	`conf`	L SPIRE Ohad Lipsky, Ely Porat
2004	A*	`conf`	Closest Pair Problems in Very High Dimensions. ICALP Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat
2004	C	`conf`	Efficient One Dimensional Real Scaled Matching. SPIRE Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
2004	J	`jnl`	Faster algorithms for string matching with k mismatches. J. Algorithms Amihood Amir, Moshe Lewenstein, Ely Porat
2004	A	`conf`	Swap and Mismatch Edit Distance. ESA Amihood Amir, Estrella Eisenberg, Ely Porat
2003	A*	`conf`	Efficient Pebbling for List Traversal Synopses. ICALP Yossi Matias, Ely Porat
2003	J	`jnl`	Efficient pebbling for list traversal synopses CoRR Yossi Matias, Ely Porat
2003	A*	`conf`	Function Matching: Algorithms, Applications, and a Lower Bound. ICALP Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
2003	J	`jnl`	Overlap matching. Inf. Comput. Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
2003	B	`conf`	Real Two Dimensional Scaled Matching. WADS Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat
2002	J	`jnl`	Approximate swapped matching. Inf. Process. Lett. Amihood Amir, Moshe Lewenstein, Ely Porat
2001	A*	`conf`	A faster implementation of the Goemans-Williamson clustering algorithm. SODA Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
2001	A*	`conf`	Approximate subset matching with Don't Cares. SODA Amihood Amir, Ely Porat, Moshe Lewenstein
2001	A*	`conf`	Overlap matching. SODA Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
2000	—	`conf`	Approximate Swapped Matching. FSTTCS Amihood Amir, Moshe Lewenstein, Ely Porat
2000	A*	`conf`	Faster algorithms for string matching with SODA Amihood Amir, Moshe Lewenstein, Ely Porat