| Publication | Date of Publication | Type |
|---|
| Improved Bounds for Permutation Arrays Under Chebyshev Distance | 2023-02-24 | Paper |
| Bounds for Permutation Arrays under Kendall Tau Metric | 2023-01-26 | Paper |
| Using permutation rational functions to obtain permutation arrays with large Hamming distance | 2022-07-13 | Paper |
| Improved lower bounds for permutation arrays using permutation rational functions | 2021-10-04 | Paper |
| Equivalence Relations for Computing Permutation Polynomials | 2019-11-28 | Paper |
| New lower bounds for permutation arrays using contraction | 2019-09-12 | Paper |
| Near embeddings of hypercubes into Cayley graphs on the symmetric group | 2018-09-14 | Paper |
| Constructing permutation arrays from groups | 2018-04-16 | Paper |
| Extending permutation arrays: improving MOLS bounds | 2017-04-12 | Paper |
| Embedding multidimensional grids into optimal hypercubes | 2014-09-10 | Paper |
| Bounding prefix transposition distance for strings and permutations | 2012-03-13 | Paper |
| A quadratic time 2-approximation algorithm for block sorting | 2009-03-17 | Paper |
| Calibrating an Embedded Protocol on an Asynchronous System | 2009-03-12 | Paper |
| Short proofs for cut-and-paste sorting of permutations | 2007-11-27 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Block Sorting is Hard | 2005-10-19 | Paper |
| The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem | 2005-06-01 | Paper |
| Hamilton Decompositions and (n/2)-Factorizations of Hypercubes | 2003-11-30 | Paper |
| Embedding star networks into hypercubes | 2003-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430325 | 2003-10-20 | Paper |
| Pancake problems with restricted prefix reversals and some corresponding Cayley networks. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414723 | 2003-07-27 | Paper |
| One-to-many embeddings of hypercubes into Cayley graphs generated by reversals | 2002-02-28 | Paper |
| Single row routing on multilayers | 2000-07-04 | Paper |
| Leftmove-bounded picture languages | 2000-06-04 | Paper |
| On the Diameter of the Pancake Network | 1998-06-01 | Paper |
| Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group | 1996-12-01 | Paper |
| Compressing grids into small hypercubes | 1995-05-01 | Paper |
| Simulation of binary trees and \(X\)-trees on pyramid networks | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694739 | 1993-06-29 | Paper |
| On the complexity of tree embedding problems | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028113 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028915 | 1993-03-28 | Paper |
| Embedding grids into hypercubes | 1993-01-17 | Paper |
| On reversal-bounded picture languages | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3979258 | 1992-06-26 | Paper |
| A polynomial algorithm for recognizing bounded cutwidth in hypergraphs | 1991-01-01 | Paper |
| On minimizing width in linear layouts | 1989-01-01 | Paper |
| Min Cut is NP-complete for edge weighted trees | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798266 | 1988-01-01 | Paper |
| The membership and equivalence problems for picture languages | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725545 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727401 | 1986-01-01 | Paper |
| Topological Bandwidth | 1985-01-01 | Paper |
| Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees | 1985-01-01 | Paper |
| Complexity and decidability for chain code picture languages | 1985-01-01 | Paper |
| Complete problems for space bounded subclasses of NP | 1985-01-01 | Paper |
| Bandwidth contrained NP-complete problems | 1985-01-01 | Paper |
| Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3661483 | 1983-01-01 | Paper |
| Bandwidth constraints on problems complete for polynomial time | 1983-01-01 | Paper |
| Bandwidth and pebbling | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3326858 | 1983-01-01 | Paper |
| On eliminating nondeterminism from Turing machines which use less than logarithm worktape space | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3902514 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3902515 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912041 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4741701 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3871927 | 1979-01-01 | Paper |
| On the Tape Complexity of Deterministic Context-Free Languages | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4172917 | 1978-01-01 | Paper |
| A note on weak operator precedence grammars | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4142695 | 1977-01-01 | Paper |
| The complexity of the membership problem for some extensions of context-free languagest† | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4146255 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133131 | 1977-01-01 | Paper |
| A note on weak operator precedence grammars | 1977-01-01 | Paper |
| One-way multihead writing finite automata | 1976-01-01 | Paper |
| On Families of Languages Defined by Time-Bounded Random Access Machines | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140411 | 1976-01-01 | Paper |
| A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages | 1975-01-01 | Paper |
| On tape-bounded complexity classes and multihead finite automata | 1975-01-01 | Paper |
| Bounded-reversal multihead finite automata languages | 1974-01-01 | Paper |
