Counting inversions adaptively

DOI10.1016/j.ipl.2015.05.003zbMath1329.68086arXiv1503.01192OpenAlexW1679386415MaRDI QIDQ2348707

Amr Elmasry

Publication date: 15 June 2015

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsanalysis of algorithmsdata structuresdesign of algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Cites Work

• Exploiting few inversions when sorting: Sequential and parallel algorithms
• Adaptive sorting: an information theoretic perspective
• A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
• Design and Analysis of a Data Structure for Representing Sorted Lists
• Deterministic sorting in O(nloglogn) time and linear space
• Algorithms – ESA 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting inversions adaptively