Content Search through Comparisons

DOI10.1007/978-3-642-22012-8_48zbMath1333.68125OpenAlexW1663279226MaRDI 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

Mathematics Subject Classification ID

Database theory (68P15) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Internet topics (68M11)

Related Items (1)

Content Search through Comparisons

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Content Search through Comparisons