The SCEAS System
| |||||||

## Search the dblp DataBase
Elad Verbin:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Haim Kaplan, Micha Sharir, Elad Verbin
**Colored intersection searching via sparse rectangular matrix multiplication.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2006, pp:52-60 [Conf] - Haim Kaplan, Shir Landau, Elad Verbin
**A Simpler Analysis of Burrows-Wheeler Based Compression.**[Citation Graph (0, 0)][DBLP] CPM, 2006, pp:282-293 [Conf] - Haim Kaplan, Elad Verbin
**Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals.**[Citation Graph (0, 0)][DBLP] CPM, 2003, pp:170-185 [Conf] - Tova Milo, Assaf Sagi, Elad Verbin
**Compact Samples for Data Dissemination.**[Citation Graph (0, 0)][DBLP] ICDT, 2007, pp:74-88 [Conf] - Tzvika Hartman, Elad Verbin
**Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions.**[Citation Graph (0, 0)][DBLP] SPIRE, 2006, pp:279-290 [Conf] - Martin Charles Golumbic, Haim Kaplan, Elad Verbin
**On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:296, n:1, pp:25-41 [Journal] - Haim Kaplan, Elad Verbin
**Sorting signed permutations by reversals, revisited.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:70, n:3, pp:321-341 [Journal] - Haim Kaplan, Elad Verbin
**Most Burrows-Wheeler Based Compressors Are Not Optimal.**[Citation Graph (0, 0)][DBLP] CPM, 2007, pp:107-118 [Conf] - Tova Milo, Tal Zur, Elad Verbin
**Boosting topic-based publish-subscribe systems with dynamic clustering.**[Citation Graph (0, 0)][DBLP] SIGMOD Conference, 2007, pp:749-760 [Conf] - Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
**Counting colors in boxes.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:785-794 [Conf] - Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin
**Sorting and Selection in Posets**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Optimized union of non-disjoint distributed data sets.**[Citation Graph (, )][DBLP]**Distance Oracles for Sparse Graphs.**[Citation Graph (, )][DBLP]**Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm.**[Citation Graph (, )][DBLP]**Sorting and selection in posets.**[Citation Graph (, )][DBLP]**On agnostic boosting and parity learning.**[Citation Graph (, )][DBLP]**The limits of buffering: a tight lower bound for dynamic membership in the external memory model.**[Citation Graph (, )][DBLP]**Querying DAG-shaped Execution Traces Through Views.**[Citation Graph (, )][DBLP]
Search in 0.007secs, Finished in 0.008secs | |||||||

| |||||||

| |||||||

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