Cited By
View all- Rubinstein ADiakonikolas IKempe DHenzinger M(2018)Hardness of approximate nearest neighbor searchProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188916(1260-1268)Online publication date: 20-Jun-2018
- Duan RPettie SKlein P(2017)Connectivity oracles for graphs subject to vertex failuresProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039717(490-509)Online publication date: 16-Jan-2017
- Demaine ELangerman SPrice E(2010)Confluently Persistent Tries for Efficient Version ControlAlgorithmica10.5555/3118227.311848057:3(462-483)Online publication date: 1-Jul-2010
- Show More Cited By