메뉴 건너뛰기




Volumn 37, Issue 4, 1990, Pages 691-711

Patricia Tries Again Revisited

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

EID: 0025497209     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/96559.214080     Document Type: Article
Times cited : (60)

References (25)
  • 6
    • 0020893165 scopus 로고
    • On the performance evaluation of extendible hashing and trie searching
    • FLAJOLET, PH. On the performance evaluation of extendible hashing and trie searching. Acta Inf. 20 (1983), 345-369.
    • (1983) Acta Inf. , vol.20 , pp. 345-369
    • FLAJOLET, P.H.1
  • 7
    • 38249041127 scopus 로고
    • AND SAHEB, N. The complexity of generating an exponentially distributed variate. J. Algorithms 7 (
    • FLAJOLET, PH., AND SAHEB, N. The complexity of generating an exponentially distributed variate. J. Algorithms 7 (1986), 463-488.
    • (1986) , pp. 463-488
    • FLAJOLET, P.H.1
  • 8
    • 0022766264 scopus 로고
    • AND SEDGEWICK, R. Digital search trees revisited. SIAM J. Comput. 15 (
    • FLAJOLET, PH., AND SEDGEWICK, R. Digital search trees revisited. SIAM J. Comput. 15 (1986), 748-767.
    • (1986) , pp. 748-767
    • FLAJOLET, P.H.1
  • 12
    • 84941436061 scopus 로고
    • AND REGNIER, M. Limiting distributions for trie parameters. In Lecture Notes in Computer Science, vol. 214. Springer-Verlag, New York
    • JACQUET, PH., AND REGNIER, M. Limiting distributions for trie parameters. In Lecture Notes in Computer Science, vol. 214. Springer-Verlag, New York, 1986, pp. 196-210.
    • (1986) , pp. 196-210
    • JACQUET, P.H.1
  • 13
    • 84990675294 scopus 로고
    • Some further results on digital trees
    • Springer-Verlag, New York
    • KIRSCHENHOFER, P., AND PRODINGER, H. Some further results on digital trees. In Lecture Notes in Computer Science, vol. 226. Springer-Verlag, New York, 1986, pp. 177-185.
    • (1986) Lecture Notes in Computer Science , vol.226 , pp. 177-185
    • KIRSCHENHOFER, P.1    PRODINGER, H.2
  • 15
    • 84976835684 scopus 로고
    • NÖRLUND, N. E. Memoire sur les polynomes de Bernoulli. Acta Math. 43 (
    • NÖRLUND, N. E. Memoire sur les polynomes de Bernoulli. Acta Math. 43 (1923), 124-196.
    • (1923) , pp. 124-196
  • 16
    • 84976776144 scopus 로고    scopus 로고
    • Three efficient algorithms based on partition refinements, preprint
    • PAIGE, R., AND TARJAN, R. Three efficient algorithms based on partition refinements, preprint.
    • PAIGE, R.1    TARJAN, R.2
  • 17
    • 0000437595 scopus 로고
    • Asymptotical growth of a class of random trees
    • PITTEL, B. Asymptotical growth of a class of random trees. Ann. Prob. 13 (1985), 414-427.
    • (1985) Ann. Prob. , vol.13 , pp. 414-427
    • PITTEL, B.1
  • 19
    • 84974597320 scopus 로고
    • Addison-Wesley, Reading, Mass
    • SEDGEWICK, R. Algorithms. Addison-Wesley, Reading, Mass., 1983.
    • (1983) Algorithms.
    • SEDGEWICK, R.1
  • 20
    • 84976846450 scopus 로고
    • Patricia tries again revisited. Tech. Rep. CSD-TR 625. Dept. Comput. Sci., Purdue Univ., West Lafayette, Ind
    • SZPANKOWSKI, W. Patricia tries again revisited. Tech. Rep. CSD-TR 625. Dept. Comput. Sci., Purdue Univ., West Lafayette, Ind., 1986.
    • (1986)
    • SZPANKOWSKI, W.1
  • 21
    • 0347760788 scopus 로고
    • On the recurrence equation arising in the analysis of conflict resolution algorithms
    • SZPANKOWSKI, W. On the recurrence equation arising in the analysis of conflict resolution algorithms. Stochastic Models 3 (1987), 89-114.
    • (1987) Stochastic Models , vol.3 , pp. 89-114
    • SZPANKOWSKI, W.1
  • 22
    • 0040062615 scopus 로고
    • Solution of a linear recurrence equation arising in the analysis of some algorithms
    • SZPANKOWSKI, W. Solution of a linear recurrence equation arising in the analysis of some algorithms. SIAM J. Alg. and Discr. Meth. 8 (1987), 233-250.
    • (1987) SIAM J. Alg. and Discr. Meth. , vol.8 , pp. 233-250
    • SZPANKOWSKI, W.1
  • 23
    • 0024014645 scopus 로고
    • The evaluation of an alternative sum with applications to the analysis of some data structures
    • SZPANKOWSKI, W. The evaluation of an alternative sum with applications to the analysis of some data structures. Inf Proc. Lett. 28 (1988), 13-19.
    • (1988) Inf Proc. Lett. , vol.28 , pp. 13-19
    • SZPANKOWSKI, W.1
  • 24
    • 38249030157 scopus 로고
    • Some results in V-ary asymmetric tries. J. Alg. 9 (
    • SZPANKOWSKI, W. Some results in V-ary asymmetric tries. J. Alg. 9 (1988), 224-244.
    • (1988) , pp. 224-244
    • SZPANKOWSKI, W.1
  • 25
    • 84976776864 scopus 로고
    • A Course of Modern Analysis. Cambridge Press, London
    • WHITTAKER, E., AND WATSON, G. A Course of Modern Analysis. Cambridge Press, London, 1935.
    • (1935)
    • WHITTAKER, E.1    WATSON, G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.