Claim: The Luleå algorithm, a technique for storing and searching internet routing tables efficiently, enables the simplified lookup in the Luleå trie using only 4 or 5 bytes per entry for large routing tables.
Evidence: The Luleå algorithm of computer science, designed by , is a technique for storing and searching internet routing tables efficiently. This enables the simplified lookup in the Luleå trie (). The main advantage of the Luleå algorithm for the routing task is that it uses very little memory, averaging 4–5 bytes per entry for large routing tables.