Access large archives as a filesystem efficiently, e.g., TAR, RAR, ZIP, GZ, BZ2, XZ, ZSTD archives

Karmem is a fast binary serialization format, faster than Google Flatbuffers and optimized for TinyGo and WASM.

Gzip Decompression and Random Access for Modern Multi-Core Machines

1D/2D indexing and querying on bgzipped text file with a pair of genomic coordinates

Fast parallel random access to bzip2 and gzip files in Python

Library of procedural generation code for use in Unity

Continuous reading from a http(s) url using random offsets and lengths for peers in a distributed system

ZStandard Random Access (ZRA) allows random access inside an archive compressed using ZStandard

Code library that uses S3's API to provide an efficient random-access (seekable) Stream implementation for use in code where efficient network I/O is paramount.

Low memory usage random access reader for csv and general files

R binder for pairix - 2D/1D genomic indexing and querying on bgzipped text file

A BGZF random access reader library

archive-proxy offers an random acccess to a large archive file on the network eg. zip, tar, 7z and rar.

Codes for reproducing the numerical results reported in: "Random Access Protocol with Channel Oracle Enabled by a Reconfigurable Intelligent Surface" by V. Croisfelt, F. Saggese, I. Leyva-Mayorga, R. Kotaba, G. Gradoni and P. Popovski.

Codes for reproducing the numerical results reported in: "A Random Access Protocol for RIS-Aided Wireless Communications" by V. Croisfelt, F. Saggese, I. Leyva-Mayorga, R. Kotaba, G. Gradoni and P. Popovski.

Codes for reproducing the numerical results reported in: "User-Centric Perspective in Random Access Cell-Free Aided by Spatial Separability" by Victor Croisfelt, Taufik Abrão, and José Carlos Marinello.

Code for the paper "Achieving Maximum Urgency-Dependent Throughput in Random Access"

Can Dumb Beat Smart? Can the best and smartest multiuser channel access and Collision-avoidance algorithms beat the dumbest multiuser channel access scheme?

Code for the paper "Dynamic Optimization of Random Access in Deadline-Constrained Broadcasting"