scientific article; zbMATH DE number 3095523

Cited in

(only showing first 100 items - show all)

Some negative results related to Poissonian pair correlation problems
Generalized de Bruijn words for primitive words and powers
On a construction of easily decodable sub-de Bruijn arrays
Decoding perfect maps
Miscellaneous digraph classes
Constructing de Bruijn sequences based on a new necessary condition
A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
Classification of de Bruijn-based labeled digraphs
Graph-theoretical characterization of invertible cellular automata
Super line-connectivity of consecutive-\(d\) digraphs
Approximations of the Lagrange and Markov spectra
Generalized de Bruijn graphs
Graph theoretical issues in computer networks
Enumerations of universal cycles for \(k\)-permutations
Storage efficient decoding for a class of binary de Bruijn sequences
Efficient design of compact unstructured RNA libraries covering all \(k\)-mers
Path-sequential labellings of cycles
Maximal state complexity and generalized de Bruijn words
An efficiently generated family of binary de Bruijn sequences
On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators
Scattered Factor-Universality of Words
Large butterfly Cayley graphs and digraphs
Iterated line digraphs are asymptotically dense
Computing generalized de Bruijn sequences
An alternative construction of normal numbers
Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
On a greedy algorithm to construct universal cycles for permutations
An interleaved method for constructing de Bruijn sequences
Normal numbers and computer science
Random walks on semaphore codes and delay de Bruijn semigroups
Mapping prefer-opposite to prefer-one de Bruijn sequences
New classes of perfect maps. I
Completely uniformly distributed sequences based on de Bruijn sequences
Designing preference functions for de Bruijn sequences with forbidden words
Connectivity and fault-tolerance of hyperdigraphs
Clues to the hidden nature of de Bruijn sequences
Quantifying local randomness in human DNA and RNA sequences using Erdös motifs
An efficient generalized shift-rule for the prefer-max de Bruijn sequence
On the Hardness and Inapproximability of Recognizing Wheeler Graphs
Characterizations of generators for modified de Bruijn sequences
A method for constructing artificial DNA libraries based on generalized de Bruijn sequences
On finite presentations of inverse semigroups with zero having polynomial growth
Cryptographically Strong de Bruijn Sequences with Large Periods
Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
Efficient absorbants in generalized de Bruijn digraphs
Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
Bisecting de Bruijn and Kautz graphs
On encodings of spanning trees
On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators
rDAN: toward robust demand-aware network designs
A new linearization method for nonlinear feedback shift registers
Sufficient conditions for maximally connected dense graphs
Large generalized cycles
Further results on the nonlinearity of maximum-length NFSR feedbacks
On the maximum order of graphs embedded in surfaces
Repeated games with \(M\)-period bounded memory (pure strategies)
On universal partial words
Generic Algorithms for Factoring Strings
Cellular automata between sofic tree shifts
Universal cycles for combinatorial structures
The longest common extension problem revisited and applications to approximate string searching
Computation theory of cellular automata
The diameter of cyclic Kautz digraphs
Spanners of de Bruijn and Kautz graphs
Broadcasting in DMA-bound bounded degree graphs
Spans of preference functions for de Bruijn sequences
Algorithms for the fixed linear crossing number problem
Probabilistic quorums for dynamic systems
Radial Moore graphs of radius three
Finite state complexity
Normality and finite-state dimension of Liouville numbers
Towards a theory of patches
Large alphabets and incompressibility
De Bruijn sequences for the binary strings with maximum density
A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
Circulant Boolean relation matrices
Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
Words and forbidden factors
The lexicographically smallest universal cycle for binary strings with minimum specified weight
Counting closed walks in generalized de Bruijn graphs
Large fault-tolerant interconnection networks
Graph algorithms for DNA sequencing -- origins, current models and the future
On the Hopcroft's minimization technique for DFA and DFCA
Generation of full cycles by a composition of NLFSRs
Progress, gaps and obstacles in the classification of cellular automata
Multicover Ucycles
Product-shuffle networks: Toward reconciling shuffles and butterflies
Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
A linearly computable measure of string complexity
Survey of DHT topology construction techniques in virtual computing environments
Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
Recognizing DNA graphs is difficult.
De Bruijn digraphs and affine transformations
Graphs on alphabets as models for large interconnection networks
Selected combinatorial problems of computational biology
The coolest way to generate binary strings
Minimal polynomials of the modified de Bruijn sequences
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5834367)