Elad Verbin

2009
18	EE	Itay Dar, Tova Milo, Elad Verbin: Optimized union of non-disjoint distributed data sets. EDBT 2009: 12-23
17	EE	Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin: Sorting and selection in posets. SODA 2009: 392-401
2008
16	EE	Leizhen Cai, Elad Verbin, Lin Yang: Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. ISAAC 2008: 258-269
15	EE	Adam Tauman Kalai, Yishay Mansour, Elad Verbin: On agnostic boosting and parity learning. STOC 2008: 629-638
14	EE	Tova Milo, Assaf Sagi, Elad Verbin: Compact samples for data dissemination. J. Comput. Syst. Sci. 74(5): 697-720 (2008)
13	EE	Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin: Efficient Colored Orthogonal Range Counting. SIAM J. Comput. 38(3): 982-1011 (2008)
2007
12	EE	Haim Kaplan, Elad Verbin: Most Burrows-Wheeler Based Compressors Are Not Optimal. CPM 2007: 107-118
11	EE	Tova Milo, Assaf Sagi, Elad Verbin: Compact Samples for Data Dissemination. ICDT 2007: 74-88
10	EE	Tova Milo, Tal Zur, Elad Verbin: Boosting topic-based publish-subscribe systems with dynamic clustering. SIGMOD Conference 2007: 749-760
9	EE	Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin: Counting colors in boxes. SODA 2007: 785-794
8	EE	Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin: Sorting and Selection in Posets CoRR abs/0707.1532: (2007)
7	EE	Haim Kaplan, Shir Landau, Elad Verbin: A simpler analysis of Burrows-Wheeler-based compression. Theor. Comput. Sci. 387(3): 220-235 (2007)
2006
6	EE	Haim Kaplan, Shir Landau, Elad Verbin: A Simpler Analysis of Burrows-Wheeler Based Compression. CPM 2006: 282-293
5	EE	Tzvika Hartman, Elad Verbin: Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions. SPIRE 2006: 279-290
4	EE	Haim Kaplan, Micha Sharir, Elad Verbin: Colored intersection searching via sparse rectangular matrix multiplication. Symposium on Computational Geometry 2006: 52-60
2005
3	EE	Martin Charles Golumbic, Haim Kaplan, Elad Verbin: On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. Discrete Mathematics 296(1): 25-41 (2005)
2	EE	Haim Kaplan, Elad Verbin: Sorting signed permutations by reversals, revisited. J. Comput. Syst. Sci. 70(3): 321-341 (2005)
2003
1	EE	Haim Kaplan, Elad Verbin: Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. CPM 2003: 170-185

Coauthor Index

1	Leizhen Cai	[16]
2	Itay Dar	[18]
3	Constantinos Daskalakis (Konstantinos Daskalakis)	[8] [17]
4	Martin Charles Golumbic	[3]
5	Tzvika Hartman	[5]
6	Adam Tauman Kalai (Adam Kalai)	[15]
7	Haim Kaplan	[1] [2] [3] [4] [6] [7] [9] [12] [13]
8	Richard M. Karp	[8] [17]
9	Shir Landau	[6] [7]
10	Yishay Mansour	[15]
11	Tova Milo	[10] [11] [14] [18]
12	Elchanan Mossel	[8] [17]
13	Samantha Riesenfeld	[8] [17]
14	Natan Rubin	[9] [13]
15	Assaf Sagi	[11] [14]
16	Micha Sharir	[4] [9] [13]
17	Lin Yang	[16]
18	Tal Zur	[10]

Colors in the list of coauthors