The following pages link to Donald B. Johnson (Q1079375):
Displaying 10 items.
- A simple proof of a time-space trade-off for sorting with linear comparisons (Q1079376) (← links)
- The complexity of selection and ranking in X+Y and matrices with sorted columns (Q1161291) (← links)
- Sorting numbers in linear expected time and optimal extra space (Q1167543) (← links)
- Priority queues with update and finding minimum spanning trees (Q1222511) (← links)
- (Q1227236) (redirect page) (← links)
- On batch scheduling of jobs with stochastic service times and cost structures on a single server (Q1227237) (← links)
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881) (← links)
- Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree (Q1816995) (← links)
- Generalized Selection and Ranking: Sorted Matrices (Q3323282) (← links)
- A Parallel Algorithm for Computing Minimum Spanning Trees (Q4857538) (← links)
