The following pages link to Jingsen Chen (Q671417):
Displaying 16 items.
- Heaps with bits (Q671419) (← links)
- On partitions and presortedness of sequences (Q808689) (← links)
- Ranking \(k\) maximum sums (Q884477) (← links)
- An optimal parallel adaptive sorting algorithm (Q1182099) (← links)
- A note on the construction of the data structure ``deap'' (Q1825631) (← links)
- Efficient algorithms for \(k\) maximum sums (Q2509030) (← links)
- In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses (Q2912725) (← links)
- (Q3138940) (← links)
- Computing Maximum-Scoring Segments in Almost Linear Time (Q3591343) (← links)
- Computing and ranking measures of presortedness (Q4323402) (← links)
- (Q4525696) (← links)
- (Q4525712) (← links)
- (Q4763425) (← links)
- Algorithms and Computation (Q5712105) (← links)
- Searching rigid data structures (Q6085739) (← links)
- Heap construction: Optimal in both worst and average cases? (Q6487971) (← links)
