J. Iacono. Alternatives to splay trees with o(log n) worst-case access times. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), pages 516--522, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Tree Layout in a Multilevel Memory Hierarchy - Alstrup, Bender, Demaine, .. (2002) (Correct)
....Consequently, there is a large body of work on optimizing search trees for nonuniform distributions in a variety of contexts: 1. Known distribution on a RAM optimal binary search trees [1, 18] and variations [15] and Hu man codes [16] 2. Unknown distribution on a RAM splay trees [17, 21]. 3. Known distribution in external memory optimal binary search trees in the HMM model [22] 4. Unknown distribution in external memory alternatives to splay trees [17] Fixed Tree Topology. Search trees frequently encode decision trees that cannot be rebalanced because the operations lack ....
....binary search trees [1, 18] and variations [15] and Hu man codes [16] 2. Unknown distribution on a RAM splay trees [17, 21] 3. Known distribution in external memory optimal binary search trees in the HMM model [22] 4. Unknown distribution in external memory alternatives to splay trees [17]. Fixed Tree Topology. Search trees frequently encode decision trees that cannot be rebalanced because the operations lack associativity. Such trees naturally arise in the context of string or geometric data, where each node represents a character in the string or a geometric predicate on the ....
[Article contains additional citation context not shown here]
John Iacono. Alternatives to splay trees with O(lg n) worst-case access times. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 516-522, Washington, D.C., January 2001.
Dynamic Length-Restricted Coding - Gagie (2003) (Correct)
.... time required to O ( H(P ) 1)m) ST85] However, the worst case bound on the time required to encode or decode a single character and update the tree becomes #(n) As noted in Chapter 1, there are data structures, such as biased search trees, deepsplay trees, and Iacono s unified structure [Iac01], that have both good worst case and good amortized bounds for access and update times. We conjecture that, when augmented, these can be used to obtain both good worst case bounds on the time required to encode or decode a single character and update the data structure and good bounds on the total ....
J. Iacono. Alternatives to splay trees with O(log n) worst-case access times. In Proceedings of the 12th Symposium on Discrete Algorithms, pages 516--522, 2001.
Queaps - Iacono, Langerman (2002) Self-citation (Iacono) (Correct)
No context found.
J. Iacono. Alternatives to splay trees with O(log n) worst-case access times. In Symposium on Discrete Algorithms, pages 516-522, 2001.
Proximate Point Searching - Erik Demaine John (2002) Self-citation (Iacono) (Correct)
No context found.
J. Iacono. Alternatives to splay trees with O(log n) worst-case access times. In Symposium on Discrete Algorithms, pp. 516-522, 2001.
A Locality-Preserving Cache-Oblivious Dynamic Dictionary - Bender, Duan, Iacono, Wu (2002) (15 citations) Self-citation (Iacono) (Correct)
No context found.
J. Iacono. Alternatives to splay trees with o(log n) worst-case access times. In 11th Symposium on Discrete Algorithms (SODA), pages 516-522, 2001.
A Locality-Preserving Cache-Oblivious Dynamic Dictionary - Bender, Duan, Iacono, Wu (2002) (15 citations) Self-citation (Iacono) (Correct)
....[20] Our structure can be easily modi ed using the method of Brown and Tarjan [15] to achieve O(log B k) query times, where k is the di erence in rank between the current and previous queries. This property of our structure, known as the dynamic nger property, implies other nger type results [23]. For example, given a constant size subset F of the keys in the structure, let d(x; y) be the di erence in rank between x and y. The number of page faults to access x is then O(log B min f2F d(f; x) Our data structure consists of two arrays. One of the arrays contains the data and a linear ....
J. Iacono. Alternatives to splay trees with O(log n) worst-case access times. In Proc. Symp. on Discrete Algorithms, pages 516-522, 2001.
Efficient Adaptive Data Compression Using Fano Binary Search.. - Rueda, Oommen (Correct)
No context found.
J. Iacono. Alternatives to splay trees with o(log n) worst-case access times. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), pages 516--522, 2001.
Putting Your Dictionary on a Diet - Morin (Correct)
No context found.
J. Iacono. Alternatives to splay trees with O(log n) worst-case access times. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001.
Efficient Tree Layout in a Multilevel Memory Hierarchy - Bender, Demaine.. (2002) (Correct)
No context found.
J. Iacono. Alternatives to splay trees with O(log n) worst-case access times. In Proc. 11th Symposium on Discrete Algorithms, pages 516-522, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC