Elad Verbin

发表

Sorting signed permutations by reversals, revisited

Haim Kaplan, Elad Verbin, Haim Kaplan, 2005, J. Comput. Syst. Sci..

Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance

Qin Zhang, Elad Verbin, Qin Zhang, 2012, ICALP.

A simpler analysis of Burrows-Wheeler-based compression

Haim Kaplan, Elad Verbin, Shir Landau Feibish, 2007, Theor. Comput. Sci..

Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals

Haim Kaplan, Elad Verbin, 2003, CPM.

The streaming complexity of cycle counting, sorting by reversals, and other problems

Wei Yu, Elad Verbin, Elad Verbin, 2011, SODA '11.

Querying DAG-shaped Execution Traces Through Views

Tova Milo, Elad Verbin, Maya Ben-Ari, 2009, WebDB.

On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems

Haim Kaplan, Martin Charles Golumbic, Elad Verbin, 2005, Discret. Math..

Efficient Colored Orthogonal Range Counting

Haim Kaplan, Micha Sharir, Natan Rubin, 2008, SIAM J. Comput..

The Coin Problem and Pseudorandomness for Branching Programs

Joshua Brody, Elad Verbin, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

Compact Samples for Data Dissemination

Tova Milo, Elad Verbin, Assaf Sagi, 2007, ICDT.

Optimized union of non-disjoint distributed data sets

Tova Milo, Elad Verbin, Itay Dar, 2009, EDBT '09.

The limits of buffering: a tight lower bound for dynamic membership in the external memory model

Qin Zhang, Elad Verbin, 2010, STOC '10.

Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques

Kristoffer Arnsfelt Hansen, Kord Eickmeyer, Elad Verbin, 2012, SAGT.

Colored intersection searching via sparse rectangular matrix multiplication

Haim Kaplan, Micha Sharir, Elad Verbin, 2006, SCG '06.

The Limits of Buffering: A Tight Lower Bound for Dynamic Membership in the External Memory Model

Qin Zhang, Elad Verbin, 2013, SIAM J. Comput..

Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm

Lin Yang, Leizhen Cai, Elad Verbin, 2008, ISAAC.

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

Tzvika Hartman, Elad Verbin, Tzvika Hartman, 2006, SPIRE.

Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem

Yuan Zhou, Leizhen Cai, Elad Verbin, 2010, SIAM J. Discret. Math..

On agnostic boosting and parity learning

Adam Tauman Kalai, Yishay Mansour, Elad Verbin, 2008, STOC.

Most Burrows-Wheeler Based Compressors Are Not Optimal

Haim Kaplan, Elad Verbin, Haim Kaplan, 2007, CPM.

Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings pdf

Elad Verbin, Wei Yu, 2013, CPM.

Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy pdf

Qin Zhang, Jeff M. Phillips, Elad Verbin, 2011, SIAM J. Comput..

Distance Oracles for Sparse Graphs

Wei Yu, Christian Sommer, Elad Verbin, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

Pseudorandomness for Width-2 Branching Programs

Zeev Dvir, Amir Yehudayoff, Andrej Bogdanov, 2013, Theory Comput..

Sorting and Selection in Posets

Elchanan Mossel, Richard M. Karp, Constantinos Daskalakis, 2007, SIAM J. Comput..

Compact samples for data dissemination

Tova Milo, Elad Verbin, Assaf Sagi, 2007, J. Comput. Syst. Sci..

Boosting topic-based publish-subscribe systems with dynamic clustering

Tova Milo, Elad Verbin, Tal Zur, 2007, SIGMOD '07.

Counting colors in boxes

Haim Kaplan, Micha Sharir, Natan Rubin, 2007, SODA '07.

A Simpler Analysis of Burrows-Wheeler Based Compression

Haim Kaplan, Elad Verbin, Shir Landau Feibish, 2006, CPM.

Network coding is highly non-approximable

Elad Verbin, Hongyi Yao, 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

Surviving rates of trees and outerplanar graphs for the firefighter problem

Leizhen Cai, Elad Verbin, Yongxi Cheng, 2009 .