This work presents a 1-pass algorithm for estimating the most frequent items in a data stream using limited storage space, which achieves better space bounds than the previously known best algorithms for this problem for several natural distributions on the item frequencies.Expand

We present a very simple algorithm for the Least Common Ancestors problem. We thus dispel the frequently held notion that optimal LCA computation is unwieldy and unimplementable. Interestingly, this… Expand

A program called NOTUNG is described that facilitates large scale analysis, using both rooted and unrooted trees, and provides a basic building block for inferring duplication dates from gene trees automatically and can be used as an exploratory analysis tool for evaluating alternative hypotheses.Expand

We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the number of memory… Expand

This paper considers pattern matching without decompression in the UNIX Z-compression, a variant of the Lempel Ziv adaptive compression scheme, and shows how to modify the algorithms to achieve a trade-off between the amount of extra space used and the algorithm's time complexity.Expand

This paper presents the first algorithm for this problem with a performance guarantee, and shows that it is ${cal NP}-hard to find a tree metric T such that $\parallel T-D\parallel{\infty}<\frac{9}{8}\varepsilon$.Expand

A cache-aware version of the COLA, the <b><i>lookahead array</i></b>, which achieves the same bounds as Brodal and Fagerberg's (cache-aware) B<sup>ε</sup>-tree.Expand

A recursive technique for building suffix trees that yields optimal algorithms in different computational models that match the sorting lower bound and for an alphabet consisting of integers in a polynomial range the authors get the first known linear-time algorithm.Expand