Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method

What this record says

We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information for

CATALOG · The abstract is indexed.