메뉴 건너뛰기




Volumn 36, Issue , 2001, Pages 96-107

Efficient subtyping tests with PQ-encoding

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; ENCODING (SYMBOLS); JAVA PROGRAMMING LANGUAGE; OPTIMIZATION; PROGRAM DIAGNOSTICS; QUERY LANGUAGES; RESPONSE TIME (COMPUTER SYSTEMS);

EID: 0035552062     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/504311.504290     Document Type: Conference Paper
Times cited : (40)

References (33)
  • 3
    • 0000428115 scopus 로고
    • On-line planarity testing
    • Technical Report CS-89-31, Brown University - Department of Computer Science, May
    • (1989)
    • Battista, G.D.1    Tamassia, R.2
  • 10
    • 0003850286 scopus 로고
    • The Cecil language, specification and rationale
    • Technical report, University of Washington, Seattle
    • (1993)
    • Chambers, C.1
  • 19
    • 0005315406 scopus 로고    scopus 로고
    • CACAO: Ein 64bit JavaVM just-in-time compiler
    • Master's thesis, University of Vienna
    • (1996)
    • Grafl, R.1
  • 22
  • 27
    • 0005319416 scopus 로고    scopus 로고
    • PQ-trees, an implementation as template class in C++
    • Technical report, Informatik, Universität zu Köln
    • (1997)
    • Leipert, S.1
  • 31
    • 0020829559 scopus 로고
    • Determining type, part, colour, and time relationships
    • (special issue on Knowledge Representation); Oct.
    • (1983) Computer , vol.16 , pp. 53-60
    • Schubert, M.A.1    Taugher, J.2


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