scientific article; zbMATH DE number 7378733

DOI10.4230/LIPIcs.ESA.2018.63MaRDI QIDQ5009630

Sebastian Wild, J. Ian Munro

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1805.04154

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

adaptive sortingtimsortnearly-optimal binary search trees

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Unnamed Item

Uses Software

• Python
• Quicksort
• TimSort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On compressing permutations and adaptive sorting
• Nearly optimal binary search trees
• Queue-mergesort
• Verifying OpenJDK's sort method for generic collections
• LRM-trees: compressed indices, adaptive sorting, and compressed permutations
• Partial Solution and Entropy
• Quicksort for Equal Keys
• Sorting and Searching in Multisets
• Quicksort with Equal Keys
• An improved bound for weight-balanced tree
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• Synergistic Solutions on MultiSets
• Quicksort Is Optimal For Many Equal Keys
• Strategies for Stable Merge Sorting
• COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS
• Inversion-sensitive sorting algorithms in practice
• Optimal binary search trees

This page was built for publication: