메뉴 건너뛰기




Volumn 28, Issue 2, 1999, Pages 133-144

Querying Network Directories

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0013248979     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/304181.304194     Document Type: Article
Times cited : (35)

References (28)
  • 1
    • 85034547262 scopus 로고    scopus 로고
    • Directory enabled networks ad hoc working group
    • Directory enabled networks ad hoc working group. http://www.murchiso.com/den/.
  • 10
    • 0022333721 scopus 로고
    • On understanding types, data abstraction, and polymorphism
    • L. Cardelli and P. Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17(4):471-521, 1986.
    • (1986) Computing Surveys , vol.17 , Issue.4 , pp. 471-521
    • Cardelli, L.1    Wegner, P.2
  • 11
    • 85034558757 scopus 로고    scopus 로고
    • Cisco. Directory enabled networks
    • Cisco. Directory enabled networks. Available from http://www.cisco.com/warp/public/734/den/.
  • 14
    • 0001944095 scopus 로고    scopus 로고
    • A query language for a web-site management system
    • Sept.
    • M. Fernandez, D. Florescu, A. Levy, and D. Suciu. A query language for a web-site management system. SIGMOD Record, 26(3):4-11, Sept. 1997.
    • (1997) SIGMOD Record , vol.26 , Issue.3 , pp. 4-11
    • Fernandez, M.1    Florescu, D.2    Levy, A.3    Suciu, D.4
  • 21
    • 0016942292 scopus 로고
    • A space-economical suffix tree construction algorithm
    • E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23:262-272, 1976.
    • (1976) J. ACM , vol.23 , pp. 262-272
    • McCreight, E.M.1


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