MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Optimal Alphabetic Trees." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

11 documents found, showing 1 through 10. Next 10 →

ATOM

Parallel Construction Of Optimal Alphabetic Trees
by Lawrence L. Larmore, Department Of Computer Science, Teresa M. Przytycka, Wojciech Rytter — 1993 — Proceedings of the 5 th ACM Symposium on Parallel Algorithms and Architectures
… PARALLEL CONSTRUCTION OF OPTIMAL ALPHABETIC TREES Lawrence L. Larmore 3 Department of Computer…
Cited by 6 (3 self) – Add To MetaCart

Towards a Dynamic Optimal Alphabetic Tree
by A.A. Belal, M.S. Selim, S.M. Arafat — 1999
…Towards a Dynamic Optimal Alphabetic Tree A.A. Belal M.S. Selim S.M.Arafat Department of Computer…
Cited by 1 (0 self) – Add To MetaCart

Correctness of Constructing Optimal Alphabetic Trees Revisited
by Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter — 1996 — Theoretical Computer Science
…Correctness of Constructing Optimal Alphabetic Trees Revisited Marek Karpinski Lawrence L…
Cited by 1 (0 self) – Add To MetaCart

Optimum Alphabetic Binary Trees
by T. C. Hu, J. D. Morgenthaler — 1996 — in Combinatorics and Computer Science, ser. Lecture Notes in Computer Science
… describe a modification of the Hu--Tucker algorithm for constructing an optimal alphabetic tree that runs…
Cited by 1 (0 self) – Add To MetaCart

Upper and Lower Bounds on Constructing Alphabetic Binary Trees
by Maria Klawe, Brendan Mumey — 1993 — Proceedings of the 4 th ACM-SIAM Symposium on Discrete Algorithms
… Abstract This paper studies the long-standing open question of whether optimal alphabetic binary trees can…
Cited by 5 (0 self) – Add To MetaCart

Near-optimal routing lookups with bounded worst case performance
by Pankaj Gupta, Balaji Prabhakar, Stephen Boyd — 2000 — In IEEE INFOCOM’00
…/8, 1/16, 1/32 and 1/32 respectively, then the optimal alphabetic tree corresponding…
Cited by 22 (0 self) – Add To MetaCart

Near-Optimal Routing Lookups with Bounded Worst Case Performance
by Pankaj Gupta Balaji, Pankaj Gupta, Balaji Prabhakar, Stephen Boyd — 2000 — In IEEE INFOCOM’00
…/32 respectively, then the optimal alphabetic tree corresponding to these probabilities (or weights) is shown…
Add To MetaCart

Fast String Sorting Using Order-Preserving Compression
by Alejandro López-ortiz, Mohammad Ali Safari
… of finding optimal alphabetic binary trees can be stated as follows: Given a sequence of n positive weights w…
Add To MetaCart

Splay Trees for Data Compression
by Dennis Grinberg, Sivaramakrishnan Rajagopalan, Victor K. Wei, Dennis Grinberg (cmu, Sivaramakrishnan Rajagopalan (boston U, Ramarathnam Venkatesan (bellcore — 1995
… to construct the optimal tree which preserves alphabetic order in 2 Grinberg, Rajagopalan, Venkatesan…
Cited by 6 (0 self) – Add To MetaCart

Practical Constructions of L-restricted Alphabetic Prefix Codes
by Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa — 1999 — In String Processing and Information Retrieval
… f g Figure 1. An optimal alphabetic tree for an alphabet fa; b; c; d; e; f; g; h; i; jg with weights…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB