Pages that link to "Item:Q4088267"
From MaRDI portal
The following pages link to Sorting and Searching in Multisets (Q4088267):
Displaying 21 items.
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Tight bounds for online stable sorting (Q553955) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Large alphabets and incompressibility (Q845735) (← links)
- Dynamic Shannon coding (Q845979) (← links)
- Sorting streamed multisets (Q975507) (← links)
- Probabilistic counting algorithms for data base applications (Q1069325) (← links)
- Determining the mode (Q1143172) (← links)
- Stable minimum space partitioning in linear time (Q1195932) (← links)
- Sorting multisets stably in minimum space (Q1338888) (← links)
- Finding modes with equality comparisons (Q1680532) (← links)
- Linear-space data structures for range mode query in arrays (Q2254510) (← links)
- Finding Mode Using Equality Comparisons (Q2803838) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Array Range Queries (Q2848983) (← links)
- Range Majority in Constant Time and Linear Space (Q3012810) (← links)
- (Q5009630) (← links)
- Distribution-sensitive algorithms (Q5054869) (← links)
- Sorting multisets stably in minimum space (Q5056159) (← links)
- A general lower bound on the I/O-complexity of comparison-based algorithms (Q5060102) (← links)
- Smooth Heaps and a Dual View of Self-Adjusting Data Structures (Q5130842) (← links)