dblp.uni-trier.dewww.uni-trier.de

Ely Porat

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
54EERaphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: From coding theory to efficient pattern matching. SODA 2009: 778-784
53EEAmihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat: Real Two Dimensional Scaled Matching. Algorithmica 53(3): 314-336 (2009)
2008
52EEYoram Bachrach, Jeffrey S. Rosenschein, Ely Porat: Power and stability in connectivity games. AAMAS (2) 2008: 999-1006
51EEAmihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat: Approximate String Matching with Address Bit Errors. CPM 2008: 118-129
50EERaphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat: A Black Box for Online Approximate Pattern Matching. CPM 2008: 143-151
49EEEly Porat, Amir Rothschild: Explicit Non-adaptive Combinatorial Group Testing Schemes. ICALP (1) 2008: 748-759
48EEEly Porat, Klim Efremenko: Approximating general metric distances between a pattern and a text. SODA 2008: 419-427
47EEOhad Lipsky, Ely Porat: Approximated Pattern Matching with the L1, L2 and Linfinit Metrics. SPIRE 2008: 212-223
46EEBenny Porat, Ely Porat, Asaf Zur: Pattern Matching with Pair Correlation Distance. SPIRE 2008: 249-256
45EERaphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild: Mismatch Sampling. SPIRE 2008: 99-108
44EEAmihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild: Improved Deterministic Length Reduction CoRR abs/0802.0017: (2008)
43EEKlim Efremenko, Ely Porat: Approximating General Metric Distances Between a Pattern and a Text CoRR abs/0802.1427: (2008)
42EEEly Porat: An Optimal Bloom Filter Replacement Based on Matrix Solving CoRR abs/0804.1845: (2008)
41EEOhad Lipsky, Ely Porat: Approximate matching in the Linfinity metric. Inf. Process. Lett. 105(4): 138-140 (2008)
40EEOhad Lipsky, Ely Porat: L1 pattern matching lower bound. Inf. Process. Lett. 105(4): 141-143 (2008)
39EEBenny Porat, Ely Porat, Asaf Zur: Pattern matching with pair correlation distance. Theor. Comput. Sci. 407(1-3): 587-590 (2008)
38EETsvi Kopelowitz, Ely Porat: Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. Theory Comput. Syst. 42(3): 349-365 (2008)
2007
37EEEly Porat, Ohad Lipsky: Improved Sketching of Hamming Distance with Error Correcting. CPM 2007: 173-182
36EEAmihood Amir, Oren Kapah, Ely Porat: Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. CPM 2007: 183-194
35EERaphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: k -Mismatch with Don't Cares. ESA 2007: 151-162
34EEAmihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat: On the Cost of Interchange Rearrangement in Strings. ESA 2007: 99-110
33EEOhad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur: Approximate String Matching with Swap and Mismatch. ISAAC 2007: 869-880
32EERaphaël Clifford, Ely Porat: A Filtering Algorithm for k -Mismatch with Don't Cares. SPIRE 2007: 130-136
31EEYair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur: Approximate Swap and Mismatch Edit Distance. SPIRE 2007: 149-163
30EEAmihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49
29EEAyelet Butman, Noa Lewenstein, Benny Porat, Ely Porat: Jump-Matching with Errors. SPIRE 2007: 98-106
28EEEly Porat, Amir Rothschild: Explicit Non-Adaptive Combinatorial Group Testing Schemes CoRR abs/0712.3876: (2007)
27EEAmihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007)
26EEYossi Matias, Ely Porat: Efficient pebbling for list traversal synopses with application to program rollback. Theor. Comput. Sci. 379(3): 418-436 (2007)
2006
25EEAmihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat: Approximate Matching in Weighted Sequences. CPM 2006: 365-376
24EEMichael Furman, Yossi Matias, Ely Porat: LTS: The List-Traversal Synopses System. NGITS 2006: 353-354
23EEAmihood 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
22EEHaim Kaplan, Ely Porat, Nira Shafrir: Finding the Position of the k-Mismatch and Approximate Tandem Repeats. SWAT 2006: 90-101
21EEAmihood Amir, Estrella Eisenberg, Ely Porat: Swap and Mismatch Edit Distance. Algorithmica 45(1): 109-120 (2006)
20EEAmihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat: Function Matching. SIAM J. Comput. 35(5): 1007-1022 (2006)
2005
19EEAmihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski: Approximate Matching in the L1 Metric. CPM 2005: 91-103
18EETsvi Kopelowitz, Ely Porat: Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. ICTCS 2005: 309-322
17EEOhad Lipsky, Ely Porat: L1 Pattern Matching Lower Bound. SPIRE 2005: 327-330
16EEOhad Lipsky, Ely Porat: Approximate Matching in the Linfinity Metric. SPIRE 2005: 331-334
2004
15EEAmihood Amir, Estrella Eisenberg, Ely Porat: Swap and Mismatch Edit Distance. ESA 2004: 16-27
14EEPiotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat: Closest Pair Problems in Very High Dimensions. ICALP 2004: 782-792
13EEAmihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9
12EEAmihood Amir, Moshe Lewenstein, Ely Porat: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2): 257-275 (2004)
2003
11EEYossi Matias, Ely Porat: Efficient Pebbling for List Traversal Synopses. ICALP 2003: 918-928
10EEAmihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat: Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003: 929-942
9EEAmihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat: Real Two Dimensional Scaled Matching. WADS 2003: 353-364
8EEYossi Matias, Ely Porat: Efficient pebbling for list traversal synopses CoRR cs.DS/0306104: (2003)
7EEAmihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. Inf. Comput. 181(1): 57-74 (2003)
2002
6EEAmihood Amir, Moshe Lewenstein, Ely Porat: Approximate swapped matching. Inf. Process. Lett. 83(1): 33-39 (2002)
2001
5EERichard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: A faster implementation of the Goemans-Williamson clustering algorithm. SODA 2001: 17-25
4EEAmihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. SODA 2001: 279-288
3EEAmihood Amir, Ely Porat, Moshe Lewenstein: Approximate subset matching with Don't Cares. SODA 2001: 305-306
2000
2EEAmihood Amir, Moshe Lewenstein, Ely Porat: Approximate Swapped Matching. FSTTCS 2000: 302-311
1EEAmihood Amir, Moshe Lewenstein, Ely Porat: Faster algorithms for string matching with k mismatches. SODA 2000: 794-803

Coauthor Index

1Amihood Amir [1] [2] [3] [4] [6] [7] [9] [10] [12] [13] [15] [19] [20] [21] [23] [25] [27] [30] [34] [36] [44] [51] [53]
2Yonatan Aumann [10] [20] [23] [30] [51]
3Yoram Bachrach [52]
4Gary Benson [23]
5Ayelet Butman [9] [13] [27] [29] [53]
6Raphaël Clifford [32] [35] [45] [50] [54]
7Richard Cole [4] [5] [7] [10]
8Yair Dombb [31]
9Klim Efremenko [35] [43] [44] [45] [48] [50] [54]
10Estrella Eisenberg [15] [21]
11Michael Furman [24]
12Ramesh Hariharan [4] [5] [7]
13Tzvika Hartman [34]
14Costas S. Iliopoulos [25]
15Piotr Indyk [14] [30]
16Oren Kapah [25] [34] [36] [44] [51]
17Haim Kaplan [22]
18Tsvi Kopelowitz [18] [38]
19Avivit Levy (Avivit Kapah-Levy) [23] [30] [34] [51]
20Moshe Lewenstein [1] [2] [3] [4] [5] [6] [7] [9] [10] [12] [13] [14] [20] [27] [53]
21Noa Lewenstein [29]
22Ohad Lipsky [14] [16] [17] [19] [23] [31] [33] [37] [40] [41] [47]
23Yossi Matias [8] [11] [24] [26]
24Benny Porat [29] [31] [33] [39] [45] [46] [50]
25Jeffrey S. Rosenschein [52]
26Amir Rothschild [28] [35] [44] [45] [49] [54]
27Nira Shafrir [22]
28B. Riva Shalom [33]
29Steven Skiena [23]
30Asaf Tsur [31] [33]
31Dekel Tsur [13] [27]
32Julia Umanski [19]
33Uzi Vishne [23]
34Asaf Zur [39] [46]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)