For every fixed d∈N, we design a data structure that
represents a binary n×n matrix that is d-twin-ordered. The data
structure occupies Od(n) bits, which is the least one could hope for, and
can be queried for entries of the matrix in time Od(loglogn) per query.Comment: 24 pages, 2 figure