Elad Verbin - RankMe

38 papers A* 8A 1B 7C 1Journal 15Unranked 5

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