| 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
SIAM Journal on Computing | 2016-03-23 | Paper |
scientific article; zbMATH DE number 6381708 (Why is no real title available?)
| 2014-12-18 | Paper |
The limits of buffering: a tight lower bound for dynamic membership in the external memory model
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Distance Oracles for Sparse Graphs
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance
Automata, Languages, and Programming | 2013-08-12 | Paper |
The limits of buffering: a tight lower bound for dynamic membership in the external memory model
SIAM Journal on Computing | 2013-07-04 | Paper |
Data structure lower bounds on random access to grammar-compressed strings
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Approximating the minmax value of three-player games within a constant is as hard as detecting planted cliques
Algorithmic Game Theory | 2013-03-13 | Paper |
Sorting and selection in posets
SIAM Journal on Computing | 2011-10-18 | Paper |
Surviving rates of graphs with bounded treewidth for the firefighter problem
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Efficient data structures and a new randomized approach for sorting signed permutations by reversals
Combinatorial Pattern Matching | 2010-04-06 | Paper |
Efficient Colored Orthogonal Range Counting
SIAM Journal on Computing | 2009-06-22 | Paper |
scientific article; zbMATH DE number 5506192 (Why is no real title available?)
| 2009-02-10 | Paper |
Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
Algorithms and Computation | 2009-01-29 | Paper |
scientific article; zbMATH DE number 5485576 (Why is no real title available?)
| 2009-01-05 | Paper |
Compact samples for data dissemination
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Most Burrows-Wheeler Based Compressors Are Not Optimal
Combinatorial Pattern Matching | 2008-06-17 | Paper |
A simpler analysis of Burrows-Wheeler-based compression
Theoretical Computer Science | 2007-12-19 | Paper |
A Simpler Analysis of Burrows-Wheeler Based Compression
Combinatorial Pattern Matching | 2007-09-14 | Paper |
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems
Discrete Mathematics | 2005-08-01 | Paper |
Sorting signed permutations by reversals, revisited
Journal of Computer and System Sciences | 2005-05-04 | Paper |
