( en | de | ru )

 

Disambiguation of "Khomenko, Victor"

Author of the publication

copydeleteadd this publication to your clipboard
Design and Verification of Speed-Independent Circuits with Arbitration in Workcraft.

, , , and . ASYNC, page 30-31. IEEE Computer Society, (2018)

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. You can also use the button next to the name to display some publications already assigned to the person.

Viacheslav Khomenko

Andrei Khomenko

Victor Anspach

Status quo, Perspektiven und wirtschaftliche Potenziale der Biogaserzeugung auf landwirtschaftlichen Betrieben im ökologischen Landbau. Uni Kassel, (2009)

Victor Grigoriev

Victor Levchenko

 

Other publications of authors with the same name

Behaviour-Preserving Transition Insertions in Unfolding Prefixes.. ICATPN, volume 4546 of Lecture Notes in Computer Science, page 204-222. Springer, (2007)Unfolding Models of Asynchronous Systems: Applications to Analysis and Synthesis.. PNSE, volume 723 of CEUR Workshop Proceedings, page 9. CEUR-WS.org, (2011)Synthesis of SI Circuits from Burst-Mode Specifications., , , , and . DATE, page 366-369. IEEE, (2021)Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings., , and . ACSD, page 57-68. IEEE Computer Society, (2006)Logic Decomposition of Asynchronous Circuits Using STG Unfoldings.. ASYNC, page 3-12. IEEE Computer Society, (2011)Canonical Prefixes of Petri Net Unfoldings., , and . CAV, volume 2404 of Lecture Notes in Computer Science, page 582-595. Springer, (2002)Handshake Verification in WORKCRAFT., , , and . ASYNC, page 63-64. IEEE, (2020)Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT., , and . Fundam. Informaticae, 70 (1-2): 49-73 (2006)Detecting State Coding Conflicts in STG Unfoldings Using SAT., , and . ACSD, page 51-60. IEEE Computer Society, (2003)On the well-foundedness of adequate orders used for construction of complete unfolding prefixes., and . Inf. Process. Lett., 104 (4): 129-136 (2007)