The following pages link to (Q4952695):
Displaying 15 items.
- An efficient method to evaluate intersections on big data sets (Q306702) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Untangled monotonic chains and adaptive range search (Q553358) (← links)
- Fast set intersection and two-patterns matching (Q708235) (← links)
- Optimal aggregation algorithms for middleware. (Q1401963) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- Adaptive succinctness (Q2118203) (← links)
- Adaptive searching in succinctly encoded binary relations and tree-structured documents (Q2465061) (← links)
- Optimally adaptive integration of univariate Lipschitz functions (Q2480911) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Dynamic Set Intersection (Q3449844) (← links)
- (Q5140763) (← links)
- Fast Evaluation of Union-Intersection Expressions (Q5387808) (← links)
- Linear space adaptive data structures for planar range reporting (Q5964824) (← links)
