The SCEAS System
| |||||||

## Search the dblp DataBase
Ely Porat:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat
**Approximate Matching in Weighted Sequences.**[Citation Graph (0, 0)][DBLP] CPM, 2006, pp:365-376 [Conf] - Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski
**Approximate Matching in the L**[Citation Graph (0, 0)][DBLP]_{1}Metric. CPM, 2005, pp:91-103 [Conf] - Amihood Amir, Estrella Eisenberg, Ely Porat
**Swap and Mismatch Edit Distance.**[Citation Graph (0, 0)][DBLP] ESA, 2004, pp:16-27 [Conf] - Amihood Amir, Moshe Lewenstein, Ely Porat
**Approximate Swapped Matching.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2000, pp:302-311 [Conf] - Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
**Function Matching: Algorithms, Applications, and a Lower Bound.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:929-942 [Conf] - Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat
**Closest Pair Problems in Very High Dimensions.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:782-792 [Conf] - Yossi Matias, Ely Porat
**Efficient Pebbling for List Traversal Synopses.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:918-928 [Conf] - Tsvi Kopelowitz, Ely Porat
**Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error.**[Citation Graph (0, 0)][DBLP] ICTCS, 2005, pp:309-322 [Conf] - Michael Furman, Yossi Matias, Ely Porat
**LTS: The List-Traversal Synopses System.**[Citation Graph (0, 0)][DBLP] NGITS, 2006, pp:353-354 [Conf] - Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne
**Pattern matching with address errors: rearrangement distances.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:1221-1229 [Conf] - Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
**Overlap matching.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:279-288 [Conf] - Amihood Amir, Moshe Lewenstein, Ely Porat
**Faster algorithms for string matching with**[Citation Graph (0, 0)][DBLP]*k*mismatches. SODA, 2000, pp:794-803 [Conf] - Amihood Amir, Ely Porat, Moshe Lewenstein
**Approximate subset matching with Don't Cares.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:305-306 [Conf] - Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
**A faster implementation of the Goemans-Williamson clustering algorithm.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:17-25 [Conf] - Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
**Efficient One Dimensional Real Scaled Matching.**[Citation Graph (0, 0)][DBLP] SPIRE, 2004, pp:1-9 [Conf] - Ohad Lipsky, Ely Porat
**L**[Citation Graph (0, 0)][DBLP]_{1}Pattern Matching Lower Bound. SPIRE, 2005, pp:327-330 [Conf] - Ohad Lipsky, Ely Porat
**Approximate Matching in the L**[Citation Graph (0, 0)][DBLP]_{infinity}Metric. SPIRE, 2005, pp:331-334 [Conf] - Haim Kaplan, Ely Porat, Nira Shafrir
**Finding the Position of the**[Citation Graph (0, 0)][DBLP]*k*-Mismatch and Approximate Tandem Repeats. SWAT, 2006, pp:90-101 [Conf] - Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat
**Real Two Dimensional Scaled Matching.**[Citation Graph (0, 0)][DBLP] WADS, 2003, pp:353-364 [Conf] - Amihood Amir, Estrella Eisenberg, Ely Porat
**Swap and Mismatch Edit Distance.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:45, n:1, pp:109-120 [Journal] - Yossi Matias, Ely Porat
**Efficient pebbling for list traversal synopses**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
**Overlap matching.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2003, v:181, n:1, pp:57-74 [Journal] - Amihood Amir, Moshe Lewenstein, Ely Porat
**Approximate swapped matching.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:1, pp:33-39 [Journal] - Amihood Amir, Moshe Lewenstein, Ely Porat
**Faster algorithms for string matching with k mismatches.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:50, n:2, pp:257-275 [Journal] - Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
**Efficient one-dimensional real scaled matching.**[Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2007, v:5, n:2, pp:205-211 [Journal] - Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat
**Function Matching.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:35, n:5, pp:1007-1022 [Journal] - Ely Porat, Ohad Lipsky
**Improved Sketching of Hamming Distance with Error Correcting.**[Citation Graph (0, 0)][DBLP] CPM, 2007, pp:173-182 [Conf] - Amihood Amir, Oren Kapah, Ely Porat
**Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications.**[Citation Graph (0, 0)][DBLP] CPM, 2007, pp:183-194 [Conf] - Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat
**On the Cost of Interchange Rearrangement in Strings.**[Citation Graph (0, 0)][DBLP] ESA, 2007, pp:99-110 [Conf] - Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
[Citation Graph (0, 0)][DBLP]*k*-Mismatch with Don't Cares. ESA, 2007, pp:151-162 [Conf] - Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
**Efficient Computations of**[Citation Graph (0, 0)][DBLP]*l*_{1}and*l*_{infinity}Rearrangement Distances. SPIRE, 2007, pp:39-49 [Conf] - Ayelet Butman, Noa Lewenstein, Benny Porat, Ely Porat
**Jump-Matching with Errors.**[Citation Graph (0, 0)][DBLP] SPIRE, 2007, pp:98-106 [Conf] - Raphaël Clifford, Ely Porat
**A Filtering Algorithm for**[Citation Graph (0, 0)][DBLP]*k*-Mismatch with Don't Cares. SPIRE, 2007, pp:130-136 [Conf] - Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur
**Approximate Swap and Mismatch Edit Distance.**[Citation Graph (0, 0)][DBLP] SPIRE, 2007, pp:149-163 [Conf] - Yossi Matias, Ely Porat
**Efficient pebbling for list traversal synopses with application to program rollback.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:379, n:3, pp:418-436 [Journal] **Power and stability in connectivity games.**[Citation Graph (, )][DBLP]**Path disruption games.**[Citation Graph (, )][DBLP]**A Black Box for Online Approximate Pattern Matching.**[Citation Graph (, )][DBLP]**Approximate String Matching with Address Bit Errors.**[Citation Graph (, )][DBLP]**An Optimal Bloom Filter Replacement Based on Matrix Solving.**[Citation Graph (, )][DBLP]**Exact and Approximate Pattern Matching in the Streaming Model.**[Citation Graph (, )][DBLP]**Explicit Non-adaptive Combinatorial Group Testing Schemes.**[Citation Graph (, )][DBLP]**Cycle Detection and Correction.**[Citation Graph (, )][DBLP]**Sketching Techniques for Collaborative Filtering.**[Citation Graph (, )][DBLP]**Approximate String Matching with Swap and Mismatch.**[Citation Graph (, )][DBLP]**Range Non-overlapping Indexing.**[Citation Graph (, )][DBLP]**Fast Set Intersection and Two-Patterns Matching.**[Citation Graph (, )][DBLP]**Approximating general metric distances between a pattern and a text.**[Citation Graph (, )][DBLP]**From coding theory to efficient pattern matching.**[Citation Graph (, )][DBLP]**Pattern Matching with Pair Correlation Distance.**[Citation Graph (, )][DBLP]**Mismatch Sampling.**[Citation Graph (, )][DBLP]**Approximated Pattern Matching with the L1, L2 and L**[Citation Graph (, )][DBLP]_{infinit}Metrics.**Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems.**[Citation Graph (, )][DBLP]**Set Intersection and Sequence Matching.**[Citation Graph (, )][DBLP]**The Frequent Items Problem, under Polynomial Decay, in the Streaming Model.**[Citation Graph (, )][DBLP]**Approximate sparse recovery: optimizing time and measurements.**[Citation Graph (, )][DBLP]**Computing a Longest Increasing Subsequence of Length k in Time O(n log log k).**[Citation Graph (, )][DBLP]**Weight Distribution and List-Decoding Size of Reed-Muller Codes.**[Citation Graph (, )][DBLP]**Real Two Dimensional Scaled Matching.**[Citation Graph (, )][DBLP]**Explicit Non-Adaptive Combinatorial Group Testing Schemes**[Citation Graph (, )][DBLP]**Improved Deterministic Length Reduction**[Citation Graph (, )][DBLP]**Approximating General Metric Distances Between a Pattern and a Text**[Citation Graph (, )][DBLP]**An Optimal Bloom Filter Replacement Based on Matrix Solving**[Citation Graph (, )][DBLP]**Range Non-Overlapping Indexing**[Citation Graph (, )][DBLP]**Fast Set Intersection and Two Patterns Matching**[Citation Graph (, )][DBLP]**Approximate Sparse Recovery: Optimizing Time and Measurements**[Citation Graph (, )][DBLP]**On the hardness of distance oracle for sparse graph**[Citation Graph (, )][DBLP]**Fast Moment Estimation in Data Streams in Optimal Space**[Citation Graph (, )][DBLP]
Search in 1.272secs, Finished in 1.275secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |