Pages that link to "Item:Q1591152"
From MaRDI portal
The following pages link to Efficient searching with linear constraints (Q1591152):
Displaying 16 items.
- Sequential search with a budget constraint (Q374737) (← links)
- Optimal partition trees (Q420575) (← links)
- Cache-oblivious range reporting with optimal queries requires superlinear space (Q540448) (← links)
- Approximate range searching in external memory (Q627532) (← links)
- Linear-space best-first search (Q685539) (← links)
- A general approach for cache-oblivious range reporting and approximate range counting (Q991183) (← links)
- Indexing moving points (Q1394801) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems (Q2875643) (← links)
- On Dominance Reporting in 3D (Q3541072) (← links)
- Approximate Range Searching in External Memory (Q5387785) (← links)
- Performance of linear-space search algorithms (Q5917443) (← links)
- Robust shape fitting via peeling and grating coresets (Q5920504) (← links)
- Linearizing partial search orders (Q6039439) (← links)