메뉴 건너뛰기





Volumn 1, Issue , 1994, Pages 154-159

On the use of a directed acyclic graph to represent a population of computer programs

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; DATA STRUCTURES; FUNCTION EVALUATION; MATHEMATICAL PROGRAMMING; RANDOM PROCESSES; SOFTWARE ENGINEERING; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

EID: 0028573419     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (50)

References (2)
  • Reference 정보가 존재하지 않습니다.

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