Partial sorting problem on evolving data

DOI10.1007/S00453-017-0295-3zbMath1380.68166OpenAlexW2594428774MaRDI QIDQ1679242

Qin Huang, Xingwu Liu, Xiaoming Sun, Jia-Lin Zhang

Publication date: 9 November 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-017-0295-3

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Time bounds for selection
• Online algorithms: a survey
• On temporal graph exploration
• Algorithms on evolving graphs
• On Approximating the Stationary Distribution of Time-reversible Markov Chains
• Sorting and searching in the presence of memory faults (without redundancy)
• Optimal Resilient Sorting and Searching in the Presence of Memory Faults
• Sorting and Selection with Imprecise Comparisons
• Sort Me If You Can: How to Sort Dynamic Data
• Computing with Noisy Information
• Stable Matching with Evolving Preferences
• Concentration of Measure for the Analysis of Randomized Algorithms

This page was built for publication: Partial sorting problem on evolving data