scientific article; zbMATH DE number 3095523

zbMATH Open0060.02701MaRDI QIDQ5834367FDOQ5834367

N. G. de Bruijn

Publication date: 1946

Title of this publication is not available (Why is that?)

zbMATH Keywords

combinatorics

Cited In (only showing first 100 items - show all)

• Characterizations of generators for modified de Bruijn sequences
• Some negative results related to Poissonian pair correlation problems
• On encodings of spanning trees
• Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
• Bisecting de Bruijn and Kautz graphs
• Maximal state complexity and generalized de Bruijn words
• Normal Numbers and Computer Science
• A method for constructing artificial DNA libraries based on generalized de Bruijn sequences
• Miscellaneous Digraph Classes
• Constructing de Bruijn Sequences Based on a New Necessary Condition
• Iterated line digraphs are asymptotically dense
• Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
• Cryptographically Strong de Bruijn Sequences with Large Periods
• Efficient absorbants in generalized de Bruijn digraphs
• Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers
• An efficiently generated family of binary de Bruijn sequences
• Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
• New classes of perfect maps. I
• An efficient generalized shift-rule for the prefer-max de Bruijn sequence
• Super line-connectivity of consecutive-\(d\) digraphs
• Normal numbers and nested perfect necklaces
• On finite presentations of inverse semigroups with zero having polynomial growth
• An alternative construction of normal numbers
• Designing preference functions for de Bruijn sequences with forbidden words
• On the Hardness and Inapproximability of Recognizing Wheeler Graphs
• A new linearization method for nonlinear feedback shift registers
• On a Construction of Easily Decodable Sub-de Bruijn Arrays
• Graph theoretical issues in computer networks
• Completely uniformly distributed sequences based on de Bruijn sequences
• Generalized de Bruijn graphs
• Clues to the hidden nature of de Bruijn sequences
• Decoding perfect maps
• Approximations of the Lagrange and Markov spectra
• On a Greedy Algorithm to Construct Universal Cycles for Permutations
• Generalized de Bruijn words for primitive words and powers
• Mapping prefer-opposite to prefer-one de Bruijn sequences
• Storage efficient decoding for a class of binary de Bruijn sequences
• Computing generalized de Bruijn sequences
• Large butterfly Cayley graphs and digraphs
• Classification of de Bruijn-based labeled digraphs
• Connectivity and fault-tolerance of hyperdigraphs
• Path-sequential labellings of cycles
• On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators
• rDAN: toward robust demand-aware network designs
• A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
• Graph-theoretical characterization of invertible cellular automata
• Random walks on semaphore codes and delay de Bruijn semigroups
• Quantifying local randomness in human DNA and RNA sequences using Erdös motifs
• Enumerations of universal cycles for \(k\)-permutations
• On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators
• An interleaved method for constructing de Bruijn sequences
• Cellular automata between sofic tree shifts
• Graphs on alphabets as models for large interconnection networks
• A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
• Generation of full cycles by a composition of NLFSRs
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• Finite state incompressible infinite sequences
• The complexity of interacting automata
• A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants
• Large alphabets and incompressibility
• The lexicographically smallest universal cycle for binary strings with minimum specified weight
• Progress, gaps and obstacles in the classification of cellular automata
• Further results on the nonlinearity of maximum-length NFSR feedbacks
• On the maximum order of graphs embedded in surfaces
• Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
• D2B: A de Bruijn based content-addressable network
• The strategic value of recall
• Finite state complexity
• Towards a theory of patches
• Minimal polynomials of the modified de Bruijn sequences
• Normality and finite-state dimension of Liouville numbers
• An index data structure for matrices, with applications to fast two-dimensional pattern matching
• A class of nonlinear de Bruijn cycles
• Spans of preference functions for de Bruijn sequences
• Radial Moore graphs of radius three
• Minimum Eulerian circuits and minimum de Bruijn sequences
• Universal cycles for permutations
• Sufficient conditions for maximally connected dense graphs
• Broadcasting in DMA-bound bounded degree graphs
• Spanners of de Bruijn and Kautz graphs
• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
• A graph theoretical approach to input design for identification of nonlinear dynamical models
• The diameter of cyclic Kautz digraphs
• On the Hopcroft's minimization technique for DFA and DFCA
• Product-shuffle networks: Toward reconciling shuffles and butterflies
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
• Line-digraphs, arborescences and theorems of Tutte and Knuth
• Counting closed walks in generalized de Bruijn graphs
• A linearly computable measure of string complexity
• The longest common extension problem revisited and applications to approximate string searching
• Recognizing DNA graphs is difficult.
• Three generators for minimal writing-space computations
• Repeated games with \(M\)-period bounded memory (pure strategies)
• Graph algorithms for DNA sequencing -- origins, current models and the future
• Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking
• Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences
• The underlying graph of a line digraph
• Large generalized cycles
• The origins of combinatorics on words
• Embedding on alphabet overlap digraphs

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)