The following pages link to Thomas Strothotte (Q797279):
Displayed 13 items.
- An algorithm for merging heaps (Q797280) (← links)
- A characterization of heaps and its applications (Q918196) (← links)
- A note on constructing min-max heaps (Q1123594) (← links)
- A note on the construction of the data structure ``deap'' (Q1825631) (← links)
- Guided Exploration with Dynamic Potential Fields: the Cubical Path System (Q2758613) (← links)
- (Q3026346) (← links)
- The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets (Q3612833) (← links)
- Min-max heaps and generalized priority queues (Q3783545) (← links)
- (Q3783549) (← links)
- (Q3827554) (← links)
- (Q4231544) (← links)
- Structured program lookahead (Q4727400) (← links)
- (Q4860762) (← links)