( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computer Systems: A Programmer's Perspective

, и . Pearson, 2nd издание, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Randal Sivertson

Jennifer Bryant

Doreen Bryant

Melchior Bryant

Thomas Bryant

 

Другие публикации лиц с тем же именем

An efficient graph representation for arithmetic circuitverification., и . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 20 (12): 1443-1454 (2001)On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication.. IEEE Trans. Computers, 40 (2): 205-213 (1991)A Performance Study of BDD-Based Model Checking., , , , , , , и . FMCAD, том 1522 из Lecture Notes in Computer Science, стр. 255-289. Springer, (1998)TLSim and EVC: a term-level symbolic simulator and an efficient decision procedure for the logic of equality with uninterpreted functions and memories., и . Int. J. Embed. Syst., 1 (1/2): 134-149 (2005)Silicon Compilers: How Well Have They Done, and Where Are They Headed?. IFIP Congress, стр. 379. North-Holland/IFIP, (1989)Modeling and Verification of Out-of-Order Microprocessors in UCLID., , и . FMCAD, том 2517 из Lecture Notes in Computer Science, стр. 142-159. Springer, (2002)Bit-Level Analysis of an SRT Divider Circuit.. DAC, стр. 661-665. ACM Press, (1996)Automatic Clock Abstraction from Sequential Circuits., , и . DAC, стр. 707-711. ACM Press, (1995)Revisiting Positive Equality., , , и . TACAS, том 2988 из Lecture Notes in Computer Science, стр. 1-15. Springer, (2004)Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods., и . CAV, том 2725 из Lecture Notes in Computer Science, стр. 154-166. Springer, (2003)