PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Függer, Matthias"

Author of the publication

copydeleteadd this publication to your clipboard
Towards binary circuit models that faithfully capture physical solvability.

, , , and . DATE, page 1455-1460. ACM, (2015)

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.

Matthias Keinert

Concept of a Computerized Numerical Control Kernel for Execution on Multi-core Processors, , and . IEEE Advanced Motion Control, page 599-604. (April 2016)

Matthias Bachmann

Matthias Bachmann

Matthias Bachmann

Matthias Bachmann

 

Other publications of authors with the same name

Unfaithful Glitch Propagation in Existing Binary Circuit Models., , and . CoRR, (2013)A faithful binary circuit model with adversarial noise., , , , and . DATE, page 1327-1332. IEEE, (2018)Transience Bounds for Distributed Algorithms., , and . FORMATS, volume 8053 of Lecture Notes in Computer Science, page 77-90. Springer, (2013)A Proof of the Convergence of the Hegselmann-Krause Dynamics on the Circle., , and . CoRR, (2015)HEX: scaling honeycombs is easier than scaling clock trees., , , , and . SPAA, page 164-175. ACM, (2013)How to Speed-Up Fault-Tolerant Clock Generation in VLSI Systems-on-Chip via Pipelining., , and . EDCC, page 230-239. IEEE Computer Society, (2010)Reconciling fault-tolerant distributed computing and systems-on-chip., and . Distributed Computing, 24 (6): 323-355 (2012)The effect of forgetting on the performance of a synchronizer., , , , and . Perform. Eval., (2015)Brief announcement: how to speed-up fault-tolerant clock generation in VLSI systems-on-chip via pipelining., , and . PODC, page 276-277. ACM, (2009)HEX: Scaling honeycombs is easier than scaling clock trees., , , , and . J. Comput. Syst. Sci., 82 (5): 929-956 (2016)