메뉴 건너뛰기




Volumn 2, Issue 4, 2005, Pages 407-429

Codes for the world wide web

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84924216371     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2005.10129113     Document Type: Article
Times cited : (45)

References (13)
  • 1
    • 0035019833 scopus 로고    scopus 로고
    • Towards Compressing Web Graphs
    • March 27–29, 2001 in Snowbird, Utah: Proceedings, edited by James A. Storer and Martin Cohn, Los Alamitos, CA: IEEE Press
    • Micah Adler and Michael Mitzenmacher. “Towards Compressing Web Graphs.” In 2001 Data Compression Conference: March 27–29, 2001 in Snowbird, Utah: Proceedings, edited by James A. Storer and Martin Cohn, pp. 203–212. Los Alamitos, CA: IEEE Press, 2001.
    • (2001) 2001 Data Compression Conference , pp. 203-212
    • Adler, M.1    Mitzenmacher, M.2
  • 5
    • 0016486577 scopus 로고
    • Universal Codeword Sets and Representations of the Integers
    • Peter Elias. “Universal Codeword Sets and Representations of the Integers.” IEEE Transactions on Information Theory 21 (1975), 194–203.
    • (1975) IEEE Transactions on Information Theory , vol.21 , pp. 194-203
    • Elias, P.1
  • 7
    • 0033714666 scopus 로고    scopus 로고
    • Hector Garcia-Molina, and Andreas Paepcke
    • WebBase: A Repository of Web Pages
    • Jun Hirai, Sriram Raghavan, Hector Garcia-Molina, and Andreas Paepcke. “WebBase: A Repository of Web Pages.” Computer Networks 33:1–6 (2000), 277–293.
    • (2000) Computer Networks , vol.33 , Issue.1-6 , pp. 277-293
    • Hirai, J.1    Raghavan, S.2
  • 8
    • 0001629586 scopus 로고
    • On the Redundancy and Delay of Separable Codes for the Natural Numbers
    • V. E. Levenstein. “On the Redundancy and Delay of Separable Codes for the Natural Numbers.” Problems of Cybernetics 20 (1968), 173–179.
    • (1968) Problems of Cybernetics , vol.20 , pp. 173-179
    • Levenstein, V.E.1
  • 9
    • 84881077182 scopus 로고
    • In-Place Calculation of Minimum-Redundancy Codes
    • Kingston, Canada August 16–18, 1995: Proceedings, edited by S. G. Akl, F. Dehne, and J.-R. Sack, Lecture Notes in Computer Science 955. New York: Springer
    • Alistair Moffat and Jyrki Katajainen. “In-Place Calculation of Minimum-Redundancy Codes.” In Alogrithms and Data Structures: 4th International Workshop, WADS’95, Kingston, Canada August 16–18, 1995: Proceedings, edited by S. G. Akl, F. Dehne, and J.-R. Sack, pp. 393–402. Lecture Notes in Computer Science 955. New York: Springer, 1995.
    • (1995) Alogrithms and Data Structures: 4Th International Workshop, WADS’95 , pp. 393-402
    • Moffat, A.1    Katajainen, J.2
  • 12
    • 0004116414 scopus 로고
    • Third edition. New York: McGraw–Hill
    • Walter Rudin. Real and Complex Analysis, Third edition. New York: McGraw–Hill, 1986.
    • (1986) Real and Complex Analysis
    • Rudin, W.1


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