The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ely Porat: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski
    Approximate Matching in the L1 Metric. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:91-103 [Conf]
  3. Amihood Amir, Estrella Eisenberg, Ely Porat
    Swap and Mismatch Edit Distance. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:16-27 [Conf]
  4. Amihood Amir, Moshe Lewenstein, Ely Porat
    Approximate Swapped Matching. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:302-311 [Conf]
  5. 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]
  6. 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]
  7. Yossi Matias, Ely Porat
    Efficient Pebbling for List Traversal Synopses. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:918-928 [Conf]
  8. 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]
  9. Michael Furman, Yossi Matias, Ely Porat
    LTS: The List-Traversal Synopses System. [Citation Graph (0, 0)][DBLP]
    NGITS, 2006, pp:353-354 [Conf]
  10. 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]
  11. Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
    Overlap matching. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:279-288 [Conf]
  12. Amihood Amir, Moshe Lewenstein, Ely Porat
    Faster algorithms for string matching with k mismatches. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:794-803 [Conf]
  13. Amihood Amir, Ely Porat, Moshe Lewenstein
    Approximate subset matching with Don't Cares. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:305-306 [Conf]
  14. 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]
  15. 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]
  16. Ohad Lipsky, Ely Porat
    L1 Pattern Matching Lower Bound. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:327-330 [Conf]
  17. Ohad Lipsky, Ely Porat
    Approximate Matching in the Linfinity Metric. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:331-334 [Conf]
  18. Haim Kaplan, Ely Porat, Nira Shafrir
    Finding the Position of the k-Mismatch and Approximate Tandem Repeats. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:90-101 [Conf]
  19. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat
    Real Two Dimensional Scaled Matching. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:353-364 [Conf]
  20. 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]
  21. Yossi Matias, Ely Porat
    Efficient pebbling for list traversal synopses [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. Ely Porat, Ohad Lipsky
    Improved Sketching of Hamming Distance with Error Correcting. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:173-182 [Conf]
  28. 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]
  29. 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]
  30. Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
    k -Mismatch with Don't Cares. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:151-162 [Conf]
  31. Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
    Efficient Computations of l1 and linfinity Rearrangement Distances. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2007, pp:39-49 [Conf]
  32. Ayelet Butman, Noa Lewenstein, Benny Porat, Ely Porat
    Jump-Matching with Errors. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2007, pp:98-106 [Conf]
  33. Raphaël Clifford, Ely Porat
    A Filtering Algorithm for k -Mismatch with Don't Cares. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2007, pp:130-136 [Conf]
  34. 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]
  35. 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]

  36. Power and stability in connectivity games. [Citation Graph (, )][DBLP]


  37. Path disruption games. [Citation Graph (, )][DBLP]


  38. A Black Box for Online Approximate Pattern Matching. [Citation Graph (, )][DBLP]


  39. Approximate String Matching with Address Bit Errors. [Citation Graph (, )][DBLP]


  40. An Optimal Bloom Filter Replacement Based on Matrix Solving. [Citation Graph (, )][DBLP]


  41. Exact and Approximate Pattern Matching in the Streaming Model. [Citation Graph (, )][DBLP]


  42. Explicit Non-adaptive Combinatorial Group Testing Schemes. [Citation Graph (, )][DBLP]


  43. Cycle Detection and Correction. [Citation Graph (, )][DBLP]


  44. Sketching Techniques for Collaborative Filtering. [Citation Graph (, )][DBLP]


  45. Approximate String Matching with Swap and Mismatch. [Citation Graph (, )][DBLP]


  46. Range Non-overlapping Indexing. [Citation Graph (, )][DBLP]


  47. Fast Set Intersection and Two-Patterns Matching. [Citation Graph (, )][DBLP]


  48. Approximating general metric distances between a pattern and a text. [Citation Graph (, )][DBLP]


  49. From coding theory to efficient pattern matching. [Citation Graph (, )][DBLP]


  50. Pattern Matching with Pair Correlation Distance. [Citation Graph (, )][DBLP]


  51. Mismatch Sampling. [Citation Graph (, )][DBLP]


  52. Approximated Pattern Matching with the L1, L2 and Linfinit Metrics. [Citation Graph (, )][DBLP]


  53. Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems. [Citation Graph (, )][DBLP]


  54. Set Intersection and Sequence Matching. [Citation Graph (, )][DBLP]


  55. The Frequent Items Problem, under Polynomial Decay, in the Streaming Model. [Citation Graph (, )][DBLP]


  56. Approximate sparse recovery: optimizing time and measurements. [Citation Graph (, )][DBLP]


  57. Computing a Longest Increasing Subsequence of Length k in Time O(n log log k). [Citation Graph (, )][DBLP]


  58. Weight Distribution and List-Decoding Size of Reed-Muller Codes. [Citation Graph (, )][DBLP]


  59. Real Two Dimensional Scaled Matching. [Citation Graph (, )][DBLP]


  60. Explicit Non-Adaptive Combinatorial Group Testing Schemes [Citation Graph (, )][DBLP]


  61. Improved Deterministic Length Reduction [Citation Graph (, )][DBLP]


  62. Approximating General Metric Distances Between a Pattern and a Text [Citation Graph (, )][DBLP]


  63. An Optimal Bloom Filter Replacement Based on Matrix Solving [Citation Graph (, )][DBLP]


  64. Range Non-Overlapping Indexing [Citation Graph (, )][DBLP]


  65. Fast Set Intersection and Two Patterns Matching [Citation Graph (, )][DBLP]


  66. Approximate Sparse Recovery: Optimizing Time and Measurements [Citation Graph (, )][DBLP]


  67. On the hardness of distance oracle for sparse graph [Citation Graph (, )][DBLP]


  68. Fast Moment Estimation in Data Streams in Optimal Space [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.456secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002