The following pages link to Sorting in linear time? (Q1273863):
Displaying 24 items.
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (Q450558) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- Upper bounds for sorting integers on random access machines (Q789897) (← links)
- Improved nonconservative sequential and parallel integer sorting (Q917274) (← links)
- Well-separated pair decomposition in linear time? (Q963421) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- Notes on the complexity of sorting in abstract machines (Q1068551) (← links)
- Hybridsort revisited and parallelized (Q1123628) (← links)
- Sorting numbers in linear expected time and optimal extra space (Q1167543) (← links)
- When can we sort in \(o(n\log n)\) time? (Q1356890) (← links)
- Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space (Q2300729) (← links)
- Construct a perfect word hash function in time independent of the size of integers (Q2404612) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- A Linear Time Algorithm for Ordered Partition (Q3452555) (← links)
- Faster Fully-Dynamic Minimum Spanning Forest (Q3452837) (← links)
- Sorting in Average Time $o(\log \,n)$ (Q3827548) (← links)
- Group testing: Revisiting the ideas (Q4993846) (← links)
- Sorting Short Keys in Circuits of Size ${o(n \log n)}$ (Q5080485) (← links)
- (Q5091256) (← links)
- Generic top-down discrimination for sorting and partitioning in linear time (Q5398338) (← links)
- Algorithms – ESA 2004 (Q5464614) (← links)
- Computational Science – ICCS 2005 (Q5709609) (← links)
- Predecessor on the Ultra-Wide Word RAM (Q6492089) (← links)
