On the public citation graph
The discrepancy of the lex-least de Bruijn sequence
0 signed · 28 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.3240010209openalex-snapshot
Poisson approximation for large deviations
inferredcites →https://doi.org/10.1016/0196-6774(90)90028-dopenalex-snapshot
A new algorithm for the generation of binary de Bruijn sequences
inferredcites →https://doi.org/10.1016/b978-044488002-4/50024-5openalex-snapshot
10.1016/b978-044488002-4/50024-5
inferredcites →https://doi.org/10.1016/j.disc.2006.02.012openalex-snapshot
Character sums and nonlinear recurrence sequences
inferredcites →https://doi.org/10.1089/106652700750050916openalex-snapshot
Universal DNA Tag Systems: A Combinatorial Design Scheme
inferredcites →https://doi.org/10.1089/cmb.2007.0114openalex-snapshot
Design of Compact, Universal DNA Microarrays for Protein Binding Microarray Experiments
inferredcites →https://doi.org/10.1090/s0002-9904-1934-05988-3openalex-snapshot
A problem in arrangements
inferredcites →https://doi.org/10.1137/1024041openalex-snapshot
A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4612592openalex-extracted
On Extremal Factors of De Bruijn-Like Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_9openalex-snapshot
A BWT-Based Algorithm for Random de Bruijn Sequence Construction
inferred← citeshttps://doi.org/10.1007/978-3-319-66396-8_6openalex-snapshot
A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_26openalex-snapshot
The Grandmama de Bruijn Sequence for Binary Strings
inferred← citeshttps://doi.org/10.1016/b978-0-44-313517-0.00010-xopenalex-snapshot
Constructions of full cycles
inferred← citeshttps://doi.org/10.1016/j.aam.2012.12.002openalex-snapshot
Generalized Fibonacci recurrences and the lex-least de Bruijn sequence
inferred← citeshttps://doi.org/10.1016/j.dam.2024.06.010openalex-snapshot
On extremal factors of de Bruijn-like graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112780openalex-snapshot
Investigating the discrepancy property of de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.03.006openalex-snapshot
Constructing de Bruijn sequences with co-lexicographic order: The k -ary Grandmama sequence
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.06.013openalex-snapshot
On extending de Bruijn sequences
inferred← citeshttps://doi.org/10.1016/j.neuroimage.2011.02.005openalex-snapshot
de Bruijn cycles for neural decoding
inferred← citeshttps://doi.org/10.1090/mcom/4200openalex-snapshot
De Bruijn Sequences with Minimum Discrepancy
inferred← citeshttps://doi.org/10.1109/isit.2012.6283023openalex-snapshot
Bounds on estimated Markov orders of individual sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1003.5939openalex-snapshot
Generalized Fibonacci recurrences and the lex-least De Bruijn sequence
inferred← citeshttps://doi.org/10.48550/arxiv.1012.0032openalex-snapshot
Testing of sequences by simulation
inferred← citeshttps://doi.org/10.48550/arxiv.2308.16257openalex-snapshot
On extremal factors of de Bruijn-like graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.