Browse by Person
 | Up a level |
Group by: Item Type | No Grouping
Çaylak Kayaturan, Gökçe (2018) Representing shortest paths in graphs using Bloom filters without false positives and applications to routing in computer networks. PhD thesis, University of Essex.