206 citations · 303 across the 29 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013★ 2 cited
Improved Submatrix Maximum Queries in Monge Matrices
Pawel Gawrychowski, Shay Mozes, Oren Weimann
We present efficient data structures for submatrix maximum queries in Monge matrices and Monge partial matrices. For Monge matrices, we give a data structure that requi…
cs.DS2013★ 6 cited
Tree Compression with Top Trees
Philip Bille, Inge Li Goertz, Gad M. Landau +1
We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as…
cs.DS2013
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
Travis Gagie, Danny Hermelin, Gad M. Landau +1
Binary jumbled pattern matching asks to preprocess a binary string in order to answer queries which ask for a substring of that is of length and has exactly …