Constructions of asymptotically shortest \(k\)-radius sequences (Q662039): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Difference Between Consecutive Primes, II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on sequences with the shift and add property / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructing 𝑘-radius sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2778506 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Consecutive storage of relevant records with redundancy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations / rank | |||
Normal rank |
Latest revision as of 21:32, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constructions of asymptotically shortest \(k\)-radius sequences |
scientific article |
Statements
Constructions of asymptotically shortest \(k\)-radius sequences (English)
0 references
11 February 2012
0 references
\(k\)-radius sequences
0 references
universal cycles
0 references
cycle decompositions of graphs
0 references
0 references