2 papers
cs.DC2026
Navigating Small-World Networks with Distance Predictions
Ladan Kian, Ming Ming Tan, Dariusz Kowalski
The small-world phenomenon was given an algorithmic foundation by Kleinberg, who showed that in an augmented -dimensional lattice a decentralized greedy algorithm delivers a mes…
cs.DS2026
Towards Efficient Data Structures for Approximate Search with Range Queries
Ladan Kian, Dariusz R. Kowalski
Range queries are simple and popular types of queries used in data retrieval. However, extracting exact and complete information using range queries is costly. As a remedy, some pr…