| 2013 | CPM | Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings. | Elad Verbin, Wei Yu |
| 2012 | ICALP | Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance. | Elad Verbin, Qin Zhang |
| 2012 | SODA | Lower bounds for number-in-hand multiparty communication complexity, made easy. | Jeff M. Phillips, Elad Verbin, Qin Zhang |
| 2012 | SAGT | Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques. | Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin |
| 2011 | SODA | The Streaming Complexity of Cycle Counting, Sorting by Reversals, and Other Problems. | Elad Verbin, Wei Yu |
| 2010 | FOCS | The Coin Problem and Pseudorandomness for Branching Programs. | Joshua Brody, Elad Verbin |
| 2010 | STOC | The limits of buffering: a tight lower bound for dynamic membership in the external memory model. | Elad Verbin, Qin Zhang |
| 2009 | EDBT | Optimized union of non-disjoint distributed data sets. | Itay Dar, Tova Milo, Elad Verbin |
| 2009 | FOCS | Distance Oracles for Sparse Graphs. | Christian Sommer, Elad Verbin, Wei Yu |
| 2009 | SODA | Sorting and selection in posets. | Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin |
| 2008 | ISAAC | Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. | Leizhen Cai, Elad Verbin, Lin Yang |
| 2008 | STOC | On agnostic boosting and parity learning. | Adam Tauman Kalai, Yishay Mansour, Elad Verbin |
| 2007 | CPM | Most Burrows-Wheeler Based Compressors Are Not Optimal. | Haim Kaplan, Elad Verbin |
| 2007 | ICDT | Compact Samples for Data Dissemination. | Tova Milo, Assaf Sagi, Elad Verbin |
| 2007 | SIGMOD | Boosting topic-based publish-subscribe systems with dynamic clustering. | Tova Milo, Tal Zur, Elad Verbin |
| 2007 | SODA | Counting colors in boxes. | Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin |
| 2006 | CPM | A Simpler Analysis of Burrows-Wheeler Based Compression. | Haim Kaplan, Shir Landau, Elad Verbin |
| 2006 | SPIRE | Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions. | Tzvika Hartman, Elad Verbin |
| 2003 | CPM | Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. | Haim Kaplan, Elad Verbin |