Pages that link to "Item:Q598809"
From MaRDI portal
The following pages link to A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809):
Displaying 6 items.
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ<sup>3</sup> (Q5108270) (← links)
- Lower bounds on the complexity of simplex range reporting on a pointer machine (Q5204338) (← links)
- Optimal finger search trees in the pointer machine (Q5917584) (← links)
- Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions (Q6159411) (← links)
- Efficient union-find for planar graphs and other sparse graph classes (extended abstract) (Q6550544) (← links)
- An output sensitive solution to the set union and intersection problem (Q6560190) (← links)