메뉴 건너뛰기




Volumn , Issue , 1990, Pages 32-42

Incremental evaluation of computational circuits

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPH THEORY; SEMANTICS; TIMING CIRCUITS; TOPOLOGY;

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

References (14)
  • 4
    • 84976731288 scopus 로고
    • Automatic generation of fixedpoint-finding evaluators for circular, but welldefined, attribute grammars
    • June, Published as SIGPLAN Notices
    • R. W. Farrow. Automatic generation of fixedpoint-finding evaluators for circular, but welldefined, attribute grammars. Proc. SIGPLAN'86 Symp. on Compiler Construction, pages 85-98, June 1986. Published as SIGPLAN Notices Vol. 21, Num. 7.
    • (1986) Proc. SIGPLAN'86 Symp. on Compiler Construction , vol.21 , Issue.7 , pp. 85-98
    • Farrow, R.W.1
  • 8
    • 0001538613 scopus 로고
    • Semantics of context-free languages
    • D. E. Knuth. Semantics of context-free languages. Mathematical Systems Theory, 2:127-145, 1968.
    • (1968) Mathematical Systems Theory , vol.2 , pp. 127-145
    • Knuth, D.E.1
  • 10
    • 0023962481 scopus 로고
    • Incremental evaluation for attribute grammars with unrestricted movement between tree modifications
    • T. Reps. Incremental evaluation for attribute grammars with unrestricted movement between tree modifications. Acta Informatica, 25:155-178, 1987.
    • (1987) Acta Informatica , vol.25 , pp. 155-178
    • Reps, T.1
  • 14
    • 0021415472 scopus 로고
    • Worst-case analysis of set union algorithms
    • April
    • R. E. Tarjan and J. van Leeuwen. Worst-case analysis of set union algorithms. J. ACM, 31(2):245-281, April 1984.
    • (1984) J. ACM , vol.31 , Issue.2 , pp. 245-281
    • Tarjan, R.E.1    Van Leeuwen, J.2


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