| Publication | Date of Publication | Type |
|---|
Divergent permutations
Journal of Combinatorial Theory. Series A | 2020-03-20 | Paper |
Interlocked Permutations
SIAM Journal on Discrete Mathematics | 2019-09-16 | Paper |
Hamilton Paths With Lasting Separation
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Skewincidence
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Path separation by short cycles
Journal of Graph Theory | 2017-06-30 | Paper |
Zero-Error Capacity of Binary Channels With Memory
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Connector families of graphs
Graphs and Combinatorics | 2015-01-20 | Paper |
Permutation capacities and oriented infinite paths
| 2013-11-01 | Paper |
Forbiddance and capacity
Graphs and Combinatorics | 2012-01-24 | Paper |
Permutation capacities of families of oriented infinite paths
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Codes for a long silence
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Cross‐intersecting couples of graphs
Journal of Graph Theory | 2008-01-04 | Paper |
scientific article; zbMATH DE number 1988977 (Why is no real title available?)
| 2003-10-20 | Paper |
A note on counting very different sequences
Combinatorics, Probability and Computing | 2002-09-11 | Paper |
Self-similarity bounds for locally thin set families
Combinatorics, Probability and Computing | 2002-06-03 | Paper |
A better bound for locally thin set families
Journal of Combinatorial Theory. Series A | 2002-03-29 | Paper |
Locally thin set families
Combinatorics, Probability and Computing | 2001-11-09 | Paper |
Recursive bounds for perfect hashing
Discrete Applied Mathematics | 2001-07-29 | Paper |
Colour number, capacity, and perfectness of directed graphs
Graphs and Combinatorics | 2001-06-26 | Paper |
scientific article; zbMATH DE number 1346516 (Why is no real title available?)
| 1999-10-03 | Paper |
scientific article; zbMATH DE number 1047929 (Why is no real title available?)
| 1997-11-09 | Paper |
scientific article; zbMATH DE number 1023021 (Why is no real title available?)
| 1997-06-16 | Paper |
Tight packings of Hamming spheres
Journal of Combinatorial Theory. Series A | 1996-12-16 | Paper |
Power of interconnections and of nondeterminism in regularY-tree systolic automata
Mathematical Systems Theory | 1995-12-13 | Paper |
A Kleene-like characterization of languages accepted by systolic tree automata
Journal of Computer and System Sciences | 1995-09-10 | Paper |
Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
Acta Informatica | 1994-07-04 | Paper |
Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
Acta Informatica | 1994-05-10 | Paper |
Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
Theoretical Computer Science | 1991-01-01 | Paper |
SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA
International Journal of Foundations of Computer Science | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4215381 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4180822 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4126708 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4108159 (Why is no real title available?)
| 1989-01-01 | Paper |
C-tree systolic automata
Theoretical Computer Science | 1988-01-01 | Paper |
A hierarchy of loop programs over binary trees
International Journal of Computer Mathematics | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3988742 (Why is no real title available?)
| 1985-01-01 | Paper |
Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
Theoretical Computer Science | 1984-01-01 | Paper |
Comparing Hierarchies of Primitive Recursive Sequence Functions
Mathematical Logic Quarterly | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3623543 (Why is no real title available?)
| 1979-01-01 | Paper |
