| Publication | Date of Publication | Type |
|---|
| Bounds on maximum concurrent flow in random bipartite graphs | 2021-02-17 | Paper |
| Employing (1 − ∊) Dominating Set Partitions as Backbones in Wireless Sensor Networks | 2019-09-11 | Paper |
| A Discrete Logarithm Number System for Integer Arithmetic Modulo 2^{k}: Algorithms and Lookup Structures | 2017-08-08 | Paper |
| Multiplicative Division Employing Independent Factors | 2017-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3164475 | 2010-10-28 | Paper |
| Further reducing the redundancy of a notation over a minimally redundant digit set | 2003-08-25 | Paper |
| A \(p\times p\) bit fraction model of binary floating point division and extremal rounding cases. | 2003-01-21 | Paper |
| A graph theoretic approach for channel assignment in cellular networks | 2002-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499168 | 2001-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520290 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4885346 | 1996-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4851660 | 1996-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4326917 | 1995-03-27 | Paper |
| Measuring the accuracy of ROM reciprocal tables | 1994-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140458 | 1993-12-15 | Paper |
| The maximum concurrent flow problem | 1990-01-01 | Paper |
| Sparsest cuts and bottlenecks in graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359787 | 1990-01-01 | Paper |
| Expose-and-merge exploration and the chromatic number of a random graph | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3691767 | 1985-01-01 | Paper |
| Finite Precision Rational Arithmetic: Slash Number Systems | 1985-01-01 | Paper |
| Smallest-last ordering and clustering and graph coloring algorithms | 1983-01-01 | Paper |
| Finite Precision Rational Arithmetic: An Arithmetic Unit | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3222117 | 1983-01-01 | Paper |
| Ramsey theory for graph connectivity | 1983-01-01 | Paper |
| Basic digit sets for radix representation | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325638 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3890010 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4191601 | 1979-01-01 | Paper |
| k-Blocks and Ultrablocks in Graphs | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4159404 | 1978-01-01 | Paper |
| Subtree Isomorphism in O(n5/2) | 1978-01-01 | Paper |
| Base conversion in residue number systems | 1977-01-01 | Paper |
| A Uniform Set Covering Lemma | 1975-01-01 | Paper |
| A Simulative Study of Correlated Error Propagation in Various Finite-Precision Arithmetics | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5670645 | 1972-01-01 | Paper |
| k-Components, Clusters and Slicings in Graphs | 1972-01-01 | Paper |
| Bounded color functions on graphs | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5671578 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5679622 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5610923 | 1970-01-01 | Paper |
| On the Number of Subtrees of a Symmetricn-Ary Tree | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5626710 | 1970-01-01 | Paper |
| A Formalization of Floating-Point Numeric Base Conversion | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5657653 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5592932 | 1969-01-01 | Paper |
| In-and-out conversions | 1968-01-01 | Paper |
| The Base Conversion Theorem | 1968-01-01 | Paper |
| A Periodic Optimal Search | 1964-01-01 | Paper |
