Content Search through Comparisons
From MaRDI portal
Publication:3012951
DOI10.1007/978-3-642-22012-8_48zbMath1333.68125MaRDI QIDQ3012951
Stratis Ioannidis, Amin Karbasi, Laurent Massoulié
Publication date: 7 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_48
68P15: Database theory
68M10: Network design and communication in computer systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68M11: Internet topics
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the searchability of small-world networks with arbitrary underlying structure
- Content Search through Comparisons
- The small-world phenomenon
- Finding nearest neighbors in growth-restricted metrics
- A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability