Fast Computation of Output-Sensitive Maxima in a Word RAM

DOI10.1137/1.9781611973402.104zbMath1422.68098OpenAlexW4234820425MaRDI QIDQ5384066

Peyman Afshani

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/60ad5c3cdf77459db9ccd2aaa1bfccc7b2ec0b9e

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Data structures (68P05) Randomized algorithms (68W20)

Related Items (2)

Skyline Computation with Noisy Comparisons ⋮ Computing the depth distribution of a set of boxes

This page was built for publication: Fast Computation of Output-Sensitive Maxima in a Word RAM