Abstract
—The problem of resolving multiple responses to a search in an associative or content-addressable memory is considered. A resolver is presented whose maximum delay is proportional to the logarithm of the size of the memory.

This publication has 0 references indexed in Scilit: