| Publication | Date of Publication | Type |
|---|
| Vectorized symbolic model checking of computation tree logic for sequential machine verification | 2024-04-29 | Paper |
| Formal verification of speed-dependent asynchronous circuits using symbolic model checking of Branching Time Regular Temporal Logic | 2024-04-29 | Paper |
| Redundant CORDIC methods with a constant scale factor for sine and cosine computation | 2018-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218139 | 2004-03-09 | Paper |
| Tree-shellability of Boolean functions | 2002-03-03 | Paper |
| Hardness of indentifying the minimum ordered binary decision diagram | 2001-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525752 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937842 | 2000-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937167 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937168 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937171 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937211 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4935135 | 2000-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705514 | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703652 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253345 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268445 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364580 | 1998-11-04 | Paper |
| Size of ordered binary decision diagrams representing threshold functions | 1998-07-22 | Paper |
| Square rooting by iterative multiply-additions | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037127 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037390 | 1993-05-18 | Paper |
| \(\infty\)-regular temporal logic and its model checking problem | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3812173 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785932 | 1987-01-01 | Paper |
| High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3677667 | 1984-01-01 | Paper |
| A longest common subsequence algorithm suitable for similar text strings | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4749244 | 1982-01-01 | Paper |
| Organization of quasi-consecutive retrieval files | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4041461 | 1974-01-01 | Paper |
| Power Minimization Problems of Logic Networks | 1974-01-01 | Paper |
| Finite memory machines satisfying the lower bound of memory | 1972-01-01 | Paper |
| The upper bound of K in K-lossless sequential machines | 1972-01-01 | Paper |
| Controllability of sequential machines | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5660395 | 1971-01-01 | Paper |
| On Finite-Memory Sequential Machines | 1970-01-01 | Paper |
| Two-state two-symbol probabilistic automata | 1970-01-01 | Paper |
| Some algebraic properties of sets of stochastic matrices | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5595900 | 1969-01-01 | Paper |
| Realization of Arbitrary Logic Functions by Completely Monotonic Functions and Its Applications to Threshold Logic | 1968-01-01 | Paper |
| On Autonomous Logic Nets of Threshold Elements | 1968-01-01 | Paper |
| A Theory of Completely Monotonic Functions and its Applications to Threshold Logic | 1968-01-01 | Paper |
| A Lower Bound of the Number of Threshold Functions | 1965-01-01 | Paper |
