ELAD VERBIN






 
 
Institute for Theoretical Computer Science, Tsinghua University 
Postdoctoral Researcher

Address: Institute for Theoretical Computer Science,  Tsinghua University, Beijing, 100084, P. R. China

Office: Room 608-6 FIT Building

Telephone:86-10-62795843 ext.1686

Email: eladv@tsinghua.edu.cn / elad.verbin@gmail.com

Additional Homepage: here

 

   

 



Education

 

Tel Aviv University, Israel, Ph.D.., Computer Science, 2007 (expected).

 

Tel Aviv University, Israel, B.Sc., MathematITCS, 2000.



Awards

 

2006

Deutsch Award

 



Employment

 

2007-present

Postdoctoral Researcher at the Institute for Theoretical Computer Science, Tsinghua University

 

 

2003-2007

Teaching Assistant at the School of Computer Science, Tel Aviv University

 



Research Interests

 

Combinatorial Algorithms (in Compression, Computational Biology, Computational Geometry, Learning, …)

 

Probabilistic Algorithms

 

Computational Complexity

 

Publications

 

1

Most Burrows-Wheeler Based Compressors are Not Optimal

Haim Kaplan and Elad Verbin

Proceedings of CPM '07

 

2

Counting Colors in Boxes

Haim Kaplan, Natan Rubin, Micha Sharir and Elad Verbin

Proceedings of SODA '07

 

3

Compact Samples for Data Dissemination

Tova Milo, Assaf Sagi and Elad Verbin

Proceedings of ICDT '07

 

4

Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions

Tzvika Hartman and Elad Verbin

Proceedings of String Processing and Information Retrieval (SPIRE) 2006

 

5

A Simpler Analysis of Burrows-Wheeler Based Compression

Haim Kaplan, Shir Landau and Elad Verbin

received best paper award in Combinatorial Pattern Matching (CPM) 2006.

To be published in Theoretical Computer Science, special issue on The Burrows-Wheeler Transform and its Applications (expected publication February 2007)

(preliminary version published in CPM '06)

 

6

Colored Intersection Searching via Sparse Rectangular Matrix Multiplication

Haim Kaplan, Micha Sharir and Elad Verbin

Proceedings of Symposium on Computational Geometry (SoCG) 2006

 

7

Sorting Signed Permutations by Reversals, Revisited

Haim Kaplan and Elad Verbin

Journal of Computer and System Sciences, Volume 70, Issue 3, May 2005, Pages 321-341

(Preliminary version published in CPM '03)

 

8

On the Complexity of Cell Flipping in Permutation Diagrams, and Multiprocessor Scheduling Problems

Martin Charles Golumbic, Haim Kaplan and Elad Verbin

Discrete MathematITCS, Volume 296, Issue 1, 28 June 2005, Pages 25-41

 

 

Back