Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations

DOI10.1007/978-3-540-30551-4_52zbMath1116.68544OpenAlexW1507527194MaRDI QIDQ5712149

Jerzy W. Jaromczyk, Zbigniew Lonc

Publication date: 22 December 2005

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-30551-4_52

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Mathematical problems of computer architecture (68M07) Information storage and retrieval of data (68P20) Extremal combinatorics (05D99)

Related Items (11)

Packing analogue of \(k\)-radius sequences ⋮ Sequences of Radius k for Complete Bipartite Graphs ⋮ Short k‐radius sequences, k‐difference sequences and universal cycles ⋮ The existence of \(k\)-radius sequences ⋮ Constructions of asymptotically shortest \(k\)-radius sequences ⋮ Sequences of radius \(k\) for complete bipartite graphs ⋮ Constructing Optimal $k$-Radius Sequences ⋮ Note on a construction of short \(k\)-radius sequences ⋮ Sequences of large radius ⋮ Constructing 𝑘-radius sequences ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences

This page was built for publication: Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations