- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j9 |      | 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): 212-229 (2013) |
| j8 | | Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff: Pseudorandomness for Width-2 Branching Programs. Theory of Computing 9: 283-293 (2013) |
| c21 | | |
| 2012 | ||
| c20 | | Elad Verbin, Qin Zhang: Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance. ICALP (1) 2012: 834-845 |
| c19 | | 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: 96-107 |
| c18 | | Jeff M. Phillips, Elad Verbin, Qin Zhang: Lower bounds for number-in-hand multiparty communication complexity, made easy. SODA 2012: 486-501 |
| i5 | | Shiteng Chen, Elad Verbin, Wei Yu: Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings. CoRR abs/1203.1080 (2012) |
| i4 | | 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. Electronic Colloquium on Computational Complexity (ECCC) 19: 25 (2012) |
| 2011 | ||
| j7 | | Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin: Sorting and Selection in Posets. SIAM J. Comput. 40(3): 597-622 (2011) |
| c17 | | |
| i3 | | Jeff M. Phillips, Elad Verbin, Qin Zhang: Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy. CoRR abs/1107.2559 (2011) |
| 2010 | ||
| j6 | | Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou: Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem. SIAM J. Discrete Math. 24(4): 1322-1335 (2010) |
| c16 | | Joshua Brody, Elad Verbin: The Coin Problem and Pseudorandomness for Branching Programs. FOCS 2010: 30-39 |
| c15 | | |
| 2009 | ||
| c14 | | |
| c13 | | |
| c12 | | Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin: Sorting and selection in posets. SODA 2009: 392-401 |
| c11 | | Maya Ben-Ari, Tova Milo, Elad Verbin: Querying DAG-shaped Execution Traces Through Views. WebDB 2009 |
| i2 | | Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff: Pseudorandomness for Width 2 Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 16: 70 (2009) |
| 2008 | ||
| j5 | | Tova Milo, Assaf Sagi, Elad Verbin: Compact samples for data dissemination. J. Comput. Syst. Sci. 74(5): 697-720 (2008) |
| j4 | | Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin: Efficient Colored Orthogonal Range Counting. SIAM J. Comput. 38(3): 982-1011 (2008) |
| c10 | | Leizhen Cai, Elad Verbin, Lin Yang: Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. ISAAC 2008: 258-269 |
| c9 | | Adam Tauman Kalai, Yishay Mansour, Elad Verbin: On agnostic boosting and parity learning. STOC 2008: 629-638 |
| 2007 | ||
| j3 | | Haim Kaplan, Shir Landau, Elad Verbin: A simpler analysis of Burrows-Wheeler-based compression. Theor. Comput. Sci. 387(3): 220-235 (2007) |
| c8 | | |
| c7 | | |
| c6 | | Tova Milo, Tal Zur, Elad Verbin: Boosting topic-based publish-subscribe systems with dynamic clustering. SIGMOD Conference 2007: 749-760 |
| c5 | | |
| i1 | | Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin: Sorting and Selection in Posets. CoRR abs/0707.1532 (2007) |
| 2006 | ||
| c4 | | Haim Kaplan, Micha Sharir, Elad Verbin: Colored intersection searching via sparse rectangular matrix multiplication. Symposium on Computational Geometry 2006: 52-60 |
| c3 | | Haim Kaplan, Shir Landau, Elad Verbin: A Simpler Analysis of Burrows-Wheeler Based Compression. CPM 2006: 282-293 |
| c2 | | Tzvika Hartman, Elad Verbin: Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions. SPIRE 2006: 279-290 |
| 2005 | ||
| j2 | | Martin Charles Golumbic, Haim Kaplan, Elad Verbin: On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems. Discrete Mathematics 296(1): 25-41 (2005) |
| j1 | | Haim Kaplan, Elad Verbin: Sorting signed permutations by reversals, revisited. J. Comput. Syst. Sci. 70(3): 321-341 (2005) |
| 2003 | ||
| c1 | | Haim Kaplan, Elad Verbin: Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. CPM 2003: 170-185 |
Colors in the list of coauthors
Last update Fri May 24 17:20:16 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page