Pages that link to "Item:Q1108025"
From MaRDI portal
The following pages link to A log log n data structure for three-sided range queries (Q1108025):
Displaying 8 items.
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- Towards using computational methods for real-time negotiations in electronic commerce (Q1869452) (← links)
- Dynamic planar range skyline queries in log logarithmic expected time (Q2203584) (← links)
- Computing rectangle enclosures (Q2365809) (← links)
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time (Q2437762) (← links)
- Algorithms for three-dimensional dominance searching in linear space. (Q2583568) (← links)
- Some Results for Elementary Operations (Q3644718) (← links)
- (Q5743422) (← links)
