| Publication | Date of Publication | Type |
|---|
Bounds for permutation arrays under Kendall tau metric
Discrete Mathematics, Algorithms and Applications | 2026-02-09 | Paper |
| 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
Designs, Codes and Cryptography | 2022-07-13 | Paper |
Improved lower bounds for permutation arrays using permutation rational functions
(available as arXiv preprint) | 2021-10-04 | Paper |
| Equivalence Relations for Computing Permutation Polynomials | 2019-11-28 | Paper |
New lower bounds for permutation arrays using contraction
Designs, Codes and Cryptography | 2019-09-12 | Paper |
Near embeddings of hypercubes into Cayley graphs on the symmetric group
IEEE Transactions on Computers | 2018-09-14 | Paper |
Constructing permutation arrays from groups
Designs, Codes and Cryptography | 2018-04-16 | Paper |
Extending permutation arrays: improving MOLS bounds
Designs, Codes and Cryptography | 2017-04-12 | Paper |
Embedding multidimensional grids into optimal hypercubes
Theoretical Computer Science | 2014-09-10 | Paper |
Bounding prefix transposition distance for strings and permutations
Theoretical Computer Science | 2012-03-13 | Paper |
A quadratic time 2-approximation algorithm for block sorting
Theoretical Computer Science | 2009-03-17 | Paper |
Calibrating an Embedded Protocol on an Asynchronous System
Studies in Computational Intelligence | 2009-03-12 | Paper |
Short proofs for cut-and-paste sorting of permutations
Discrete Mathematics | 2007-11-27 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Block Sorting is Hard
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem
Networks | 2005-06-01 | Paper |
Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
Journal of Graph Algorithms and Applications | 2003-11-30 | Paper |
Embedding star networks into hypercubes
IEEE Transactions on Computers | 2003-11-10 | Paper |
| scientific article; zbMATH DE number 1988996 (Why is no real title available?) | 2003-10-20 | Paper |
Pancake problems with restricted prefix reversals and some corresponding Cayley networks.
Journal of Parallel and Distributed Computing | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1953271 (Why is no real title available?) | 2003-07-27 | Paper |
One-to-many embeddings of hypercubes into Cayley graphs generated by reversals
Theory of Computing Systems | 2002-02-28 | Paper |
Single row routing on multilayers
Journal of Computer and System Sciences | 2000-07-04 | Paper |
Leftmove-bounded picture languages
Theoretical Computer Science | 2000-06-04 | Paper |
On the Diameter of the Pancake Network
Journal of Algorithms | 1998-06-01 | Paper |
Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group
Mathematical Systems Theory | 1996-12-01 | Paper |
Compressing grids into small hypercubes
Networks | 1995-05-01 | Paper |
Simulation of binary trees and \(X\)-trees on pyramid networks
Journal of Parallel and Distributed Computing | 1993-12-20 | Paper |
| scientific article; zbMATH DE number 219253 (Why is no real title available?) | 1993-06-29 | Paper |
On the complexity of tree embedding problems
Information Processing Letters | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 139788 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 140495 (Why is no real title available?) | 1993-03-28 | Paper |
Embedding grids into hypercubes
Journal of Computer and System Sciences | 1993-01-17 | Paper |
On reversal-bounded picture languages
Theoretical Computer Science | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 19759 (Why is no real title available?) | 1992-06-26 | Paper |
A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
Mathematical Systems Theory | 1991-01-01 | Paper |
On minimizing width in linear layouts
Discrete Applied Mathematics | 1989-01-01 | Paper |
Min Cut is NP-complete for edge weighted trees
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4064517 (Why is no real title available?) | 1988-01-01 | Paper |
The membership and equivalence problems for picture languages
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3956440 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3958752 (Why is no real title available?) | 1986-01-01 | Paper |
Topological Bandwidth
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
SIAM Journal on Computing | 1985-01-01 | Paper |
Complexity and decidability for chain code picture languages
Theoretical Computer Science | 1985-01-01 | Paper |
Complete problems for space bounded subclasses of NP
Acta Informatica | 1985-01-01 | Paper |
Bandwidth contrained NP-complete problems
Theoretical Computer Science | 1985-01-01 | Paper |
Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
Journal of Algorithms | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3813518 (Why is no real title available?) | 1983-01-01 | Paper |
Bandwidth constraints on problems complete for polynomial time
Theoretical Computer Science | 1983-01-01 | Paper |
Bandwidth and pebbling
Computing | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3858434 (Why is no real title available?) | 1983-01-01 | Paper |
On eliminating nondeterminism from Turing machines which use less than logarithm worktape space
Theoretical Computer Science | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3711409 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3711410 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3723882 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3795356 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3675313 (Why is no real title available?) | 1979-01-01 | Paper |
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3607494 (Why is no real title available?) | 1978-01-01 | Paper |
A note on weak operator precedence grammars
Information Processing Letters | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3571498 (Why is no real title available?) | 1977-01-01 | Paper |
The complexity of the membership problem for some extensions of context-free languagest†
International Journal of Computer Mathematics | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3576701 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3557232 (Why is no real title available?) | 1977-01-01 | Paper |
A note on weak operator precedence grammars
Information Processing Letters | 1977-01-01 | Paper |
One-way multihead writing finite automata
Information and Control | 1976-01-01 | Paper |
On Families of Languages Defined by Time-Bounded Random Access Machines
SIAM Journal on Computing | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3569860 (Why is no real title available?) | 1976-01-01 | Paper |
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
Journal of the ACM | 1975-01-01 | Paper |
On tape-bounded complexity classes and multihead finite automata
Journal of Computer and System Sciences | 1975-01-01 | Paper |
Bounded-reversal multihead finite automata languages
Information and Control | 1974-01-01 | Paper |
