The following pages link to Svante Carlsson (Q671416):
Displayed 28 items.
- Heaps with bits (Q671419) (← links)
- An optimal algorithm for deleting the root of a heap (Q750135) (← links)
- Improving worst-case behavior of heaps (Q786534) (← links)
- On partitions and presortedness of sequences (Q808689) (← links)
- Average-case results on heapsort (Q1094882) (← links)
- A variant of heapsort with almost optimal number of comparisons (Q1108015) (← links)
- An optimal parallel adaptive sorting algorithm (Q1182099) (← links)
- (Q1293869) (redirect page) (← links)
- Computing vision points in polygons (Q1293871) (← links)
- Finding the shortest watchman route in a simple polygon (Q1807612) (← links)
- A note on the construction of the data structure ``deap'' (Q1825631) (← links)
- Sublinear merging and natural mergesort (Q2366243) (← links)
- (Q2768343) (← links)
- (Q3024760) (← links)
- (Q3138940) (← links)
- (Q3796732) (← links)
- (Q3796766) (← links)
- A general approach to dominance in the plane (Q3990609) (← links)
- (Q4035679) (← links)
- (Q4037433) (← links)
- (Q4472479) (← links)
- (Q4525712) (← links)
- (Q4763425) (← links)
- ONLINE ROUTING IN CONVEX SUBDIVISIONS (Q4818562) (← links)
- Computing a shortest watchman path in a simple polygon in polynomial-time (Q5057427) (← links)
- In-place linear probing sort (Q5096812) (← links)
- OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS (Q5289296) (← links)
- Searching rigid data structures (Q6085739) (← links)