| Publication | Date of Publication | Type |
|---|
| Logic and Language Models for Computer Science | 2023-03-10 | Paper |
| A rectilinear steiner minimal tree algorithm for convex point sets | 2022-12-09 | Paper |
| Analysis of consensus sorting via the cycle metric | 2022-10-04 | Paper |
| A Sorting Network on Trees | 2022-07-04 | Paper |
| Sorting networks on restricted topologies | 2020-10-22 | Paper |
| Analysis of consensus sorting via the cycle metric | 2019-10-11 | Paper |
| Logic and Language Models for Computer Science | 2017-11-23 | Paper |
| New results on routing via matchings on graphs | 2017-11-22 | Paper |
| Sorting under Forbidden Comparisons | 2017-10-17 | Paper |
| Minimum multiple originator broadcast graphs | 2017-03-15 | Paper |
| Computing Maximal Layers of Points in $$E^{f(n)}$$ E f ( n ) | 2016-05-03 | Paper |
| Distribution of maximal layers of random orders | 2016-04-13 | Paper |
| Martin Gardner (1914–2010) | 2011-11-30 | Paper |
| The structure of PEC networks | 2010-10-27 | Paper |
| Broadcasting from multiple originators | 2010-04-28 | Paper |
| MIXED SPANNING TREES IN THEORY AND PRACTICE | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260378 | 1999-09-19 | Paper |
| Reliable broadcasting | 1995-03-05 | Paper |
| Efficient parallel graph algorithms based on open ear decomposition | 1993-12-01 | Paper |
| Stacks, queues, and deques with order-statistic operations | 1993-02-16 | Paper |
| The Steiner tree problem | 1993-01-23 | Paper |
| Steiner tree problems | 1992-06-28 | Paper |
| A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets | 1992-06-28 | Paper |
| A simple proof of Hwang's theorem for rectilinear Steiner minimal trees | 1992-06-27 | Paper |
| Efficient algorithms for path partitions | 1992-06-25 | Paper |
| A Multistage Linear Array Assignment Problem | 1990-01-01 | Paper |
| On the inference of strategies | 1989-01-01 | Paper |
| Fast heuristic algorithms for rectilinear Steiner trees | 1989-01-01 | Paper |
| Generalizations of broadcasting and gossiping | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3495358 | 1988-01-01 | Paper |
| On the distribution of comparisons in sorting algorithms | 1988-01-01 | Paper |
| On the Worst-Possible Analysis of Weighted Comparison-Based Algorithms | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782802 | 1987-01-01 | Paper |
| Data compression and Gray-code sorting | 1986-01-01 | Paper |
| Finding short cycles in planar graphs using separators | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3710543 | 1985-01-01 | Paper |
| Toward optimal gossiping schemes with conference calls | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3221986 | 1984-01-01 | Paper |
| Sorting with expensive comparands | 1984-01-01 | Paper |
| Complexity of Single-Layer Routing | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687728 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3663335 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3665154 | 1982-01-01 | Paper |
| Generalized Magic Cubes | 1980-01-01 | Paper |
| On a theorem of Chorneyko and Mohanty | 1979-01-01 | Paper |
