Garsia–Wachs algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Garsia–Wachs algorithm" in English language version.

refsWebsite

Global rank English rank

451^st place

277^th place

2^nd place

ams.org

Kingston, Jeffrey H. (1988), "A new proof of the Garsia–Wachs algorithm", Journal of Algorithms, 9 (1): 129–136, doi:10.1016/0196-6774(88)90009-0, MR 0925602
Garsia, Adriano M.; Wachs, Michelle L. (1977), "A new algorithm for minimum cost binary trees", SIAM Journal on Computing, 6 (4): 622–642, doi:10.1137/0206045, MR 0520738
Hu, T. C.; Tucker, A. C. (1971), "Optimal computer search trees and variable-length alphabetical codes", SIAM Journal on Applied Mathematics, 21 (4): 514–532, doi:10.1137/0121057, MR 0304063
Mehlhorn, Kurt; Tsagarakis, Marcos (1979), "On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs", Les arbres en algèbre et en programmation (4ème Colloq., Lille, 1979), Univ. Lille I, Lille, pp. 159–172, MR 0554347
Karpinski, Marek; Larmore, Lawrence L.; Rytter, Wojciech (1997), "Correctness of constructing optimal alphabetic trees revisited", Theoretical Computer Science, 180 (1–2): 309–324, doi:10.1016/S0304-3975(96)00296-4, MR 1453872

Kingston, Jeffrey H. (1988), "A new proof of the Garsia–Wachs algorithm", Journal of Algorithms, 9 (1): 129–136, doi:10.1016/0196-6774(88)90009-0, MR 0925602
Garsia, Adriano M.; Wachs, Michelle L. (1977), "A new algorithm for minimum cost binary trees", SIAM Journal on Computing, 6 (4): 622–642, doi:10.1137/0206045, MR 0520738
Hu, T. C.; Tucker, A. C. (1971), "Optimal computer search trees and variable-length alphabetical codes", SIAM Journal on Applied Mathematics, 21 (4): 514–532, doi:10.1137/0121057, MR 0304063
Karpinski, Marek; Larmore, Lawrence L.; Rytter, Wojciech (1997), "Correctness of constructing optimal alphabetic trees revisited", Theoretical Computer Science, 180 (1–2): 309–324, doi:10.1016/S0304-3975(96)00296-4, MR 1453872