#worst-case analysis

try —

2 papers match

cs.DS2026

Upper Bounds for In-Place Sorting with Minimal Moves

Alex Zihan Xu, Stephen Jing Chick

The paper introduces an in-place comparison‑based sorting algorithm that uses only O(n) element moves while achieving n·log n + O(n) comparisons with high probability, and provides…

#in-place sorting#comparison-based sorting#minimal moves#randomized algorithms

quant-ph2026

Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry

Shuji Horinaga, Takashi Yamakawa

The paper presents a quantum algorithm that solves the Optimal Polynomial Intersection problem in the worst case for parameter regimes beyond those achievable by decoded quantum in…

#optimal polynomial intersection#quantum algorithms#worst-case analysis#finite fields