Elad Verbin

Publication Activity (10 Years)

Years Active: 2003-2016
Publications (10 Years): 1

Top Topics

Top Venues

SIAM J. Comput.

Publications

Jeff M. Phillips, Elad Verbin, Qin Zhang
Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy. SIAM J. Comput. 45 (1) (2016)
Elad Verbin, Wei Yu
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings. CPM (2013)
Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff
Pseudorandomness for Width-2 Branching Programs. Theory Comput. 9 (2013)
Elad Verbin, Qin Zhang
The Limits of Buffering: A Tight Lower Bound for Dynamic Membership in the External Memory Model. SIAM J. Comput. 42 (1) (2013)
Jeff M. Phillips, Elad Verbin, Qin Zhang
Lower bounds for number-in-hand multiparty communication complexity, made easy. SODA (2012)
Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin
Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques. Electron. Colloquium Comput. Complex. 19 (2012)
Elad Verbin, Qin Zhang
Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance. ICALP (1) (2012)
Shiteng Chen, Elad Verbin, Wei Yu
Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings CoRR (2012)
Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin
Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques. SAGT (2012)
Elad Verbin, Wei Yu
The Streaming Complexity of Cycle Counting, Sorting by Reversals, and Other Problems. SODA (2011)
Jeff M. Phillips, Elad Verbin, Qin Zhang
Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy CoRR (2011)
Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin
Sorting and Selection in Posets. SIAM J. Comput. 40 (3) (2011)
Joshua Brody, Elad Verbin
The Coin Problem and Pseudorandomness for Branching Programs. FOCS (2010)
Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem. SIAM J. Discret. Math. 24 (4) (2010)
Elad Verbin, Qin Zhang
The limits of buffering: a tight lower bound for dynamic membership in the external memory model. STOC (2010)
Itay Dar, Tova Milo, Elad Verbin
Optimized union of non-disjoint distributed data sets. EDBT (2009)
Christian Sommer, Elad Verbin, Wei Yu
Distance Oracles for Sparse Graphs. FOCS (2009)
Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin
Sorting and selection in posets. SODA (2009)
Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff
Pseudorandomness for Width 2 Branching Programs. Electron. Colloquium Comput. Complex. 16 (2009)
Hongyi Yao, Elad Verbin
Network coding is highly non-approximable. Allerton (2009)
Maya Ben-Ari, Tova Milo, Elad Verbin
Querying DAG-shaped Execution Traces Through Views. WebDB (2009)
Adam Tauman Kalai, Yishay Mansour, Elad Verbin
On agnostic boosting and parity learning. STOC (2008)
Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
Efficient Colored Orthogonal Range Counting. SIAM J. Comput. 38 (3) (2008)
Tova Milo, Assaf Sagi, Elad Verbin
Compact samples for data dissemination. J. Comput. Syst. Sci. 74 (5) (2008)
Leizhen Cai, Elad Verbin, Lin Yang
Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. ISAAC (2008)
Tova Milo, Assaf Sagi, Elad Verbin
Compact Samples for Data Dissemination. ICDT (2007)
Haim Kaplan, Shir Landau, Elad Verbin
A simpler analysis of Burrows-Wheeler-based compression. Theor. Comput. Sci. 387 (3) (2007)
Haim Kaplan, Elad Verbin
Most Burrows-Wheeler Based Compressors Are Not Optimal. CPM (2007)
Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin
Sorting and Selection in Posets CoRR (2007)
Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
Counting colors in boxes. SODA (2007)
Tova Milo, Tal Zur, Elad Verbin
Boosting topic-based publish-subscribe systems with dynamic clustering. SIGMOD Conference (2007)
Haim Kaplan, Micha Sharir, Elad Verbin
Colored intersection searching via sparse rectangular matrix multiplication. SCG (2006)
Haim Kaplan, Shir Landau, Elad Verbin
A Simpler Analysis of Burrows-Wheeler Based Compression. CPM (2006)
Tzvika Hartman, Elad Verbin
Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions. SPIRE (2006)
Haim Kaplan, Elad Verbin
Sorting signed permutations by reversals, revisited. J. Comput. Syst. Sci. 70 (3) (2005)
Martin Charles Golumbic, Haim Kaplan, Elad Verbin
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. Discret. Math. 296 (1) (2005)
Haim Kaplan, Elad Verbin
Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. CPM (2003)