Ely Porat

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

Coauthor Index

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

Colors in the list of coauthors