Elad Verbin

From MaRDI portal
Person:931715

Available identifiers

zbMath Open verbin.eladMaRDI QIDQ931715

List of research outcomes





PublicationDate of PublicationType
Lower bounds for number-in-hand multiparty communication complexity, made easy2019-05-10Paper
Sorting and selection in posets2019-05-06Paper
The streaming complexity of cycle counting, sorting by reversals, and other problems2017-09-29Paper
Lower bounds for number-in-hand multiparty communication complexity, made easy2016-03-23Paper
https://portal.mardi4nfdi.de/entity/Q29346652014-12-18Paper
The limits of buffering: a tight lower bound for dynamic membership in the external memory model2014-08-13Paper
Distance Oracles for Sparse Graphs2014-07-25Paper
Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance2013-08-12Paper
The limits of buffering: a tight lower bound for dynamic membership in the external memory model2013-07-04Paper
Data structure lower bounds on random access to grammar-compressed strings2013-06-14Paper
Approximating the minmax value of three-player games within a constant is as hard as detecting planted cliques2013-03-13Paper
Sorting and selection in posets2011-10-18Paper
Surviving rates of graphs with bounded treewidth for the firefighter problem2011-07-18Paper
Efficient data structures and a new randomized approach for sorting signed permutations by reversals2010-04-06Paper
Efficient Colored Orthogonal Range Counting2009-06-22Paper
https://portal.mardi4nfdi.de/entity/Q36015222009-02-10Paper
Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm2009-01-29Paper
https://portal.mardi4nfdi.de/entity/Q53020872009-01-05Paper
Compact samples for data dissemination2008-06-26Paper
Most Burrows-Wheeler Based Compressors Are Not Optimal2008-06-17Paper
A simpler analysis of Burrows-Wheeler-based compression2007-12-19Paper
A Simpler Analysis of Burrows-Wheeler Based Compression2007-09-14Paper
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems2005-08-01Paper
Sorting signed permutations by reversals, revisited2005-05-04Paper

Research outcomes over time

This page was built for person: Elad Verbin