A Variant of the Arrow Distributed Directory with Low Average Complexity.
David PelegEilon ReshefPublished in: ICALP (1999)
Keyphrases
- distributed systems
- cooperative
- computer networks
- space complexity
- computational complexity
- mobile agents
- information retrieval
- high levels
- lightweight
- peer to peer
- worst case
- agent technology
- fault tolerant
- communication cost
- directory service
- complexity analysis
- database
- distributed environment
- decision problems
- upper bound
- computational cost
- np hard
- data structure
- search engine
- genetic algorithm
- data sets