Elad Verbin

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Lower bounds for number-in-hand multiparty communication complexity, made easy	2019-05-10	Paper
Sorting and selection in posets	2019-05-06	Paper
The streaming complexity of cycle counting, sorting by reversals, and other problems	2017-09-29	Paper
Lower bounds for number-in-hand multiparty communication complexity, made easy	2016-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q2934665	2014-12-18	Paper
The limits of buffering: a tight lower bound for dynamic membership in the external memory model	2014-08-13	Paper
Distance Oracles for Sparse Graphs	2014-07-25	Paper
Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance	2013-08-12	Paper
The limits of buffering: a tight lower bound for dynamic membership in the external memory model	2013-07-04	Paper
Data structure lower bounds on random access to grammar-compressed strings	2013-06-14	Paper
Approximating the minmax value of three-player games within a constant is as hard as detecting planted cliques	2013-03-13	Paper
Sorting and selection in posets	2011-10-18	Paper
Surviving rates of graphs with bounded treewidth for the firefighter problem	2011-07-18	Paper
Efficient data structures and a new randomized approach for sorting signed permutations by reversals	2010-04-06	Paper
Efficient Colored Orthogonal Range Counting	2009-06-22	Paper
https://portal.mardi4nfdi.de/entity/Q3601522	2009-02-10	Paper
Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm	2009-01-29	Paper
https://portal.mardi4nfdi.de/entity/Q5302087	2009-01-05	Paper
Compact samples for data dissemination	2008-06-26	Paper
Most Burrows-Wheeler Based Compressors Are Not Optimal	2008-06-17	Paper
A simpler analysis of Burrows-Wheeler-based compression	2007-12-19	Paper
A Simpler Analysis of Burrows-Wheeler Based Compression	2007-09-14	Paper
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems	2005-08-01	Paper
Sorting signed permutations by reversals, revisited	2005-05-04	Paper

Research outcomes over time

This page was built for person: Elad Verbin