scientific article; zbMATH DE number 7051181
From MaRDI portal
Publication:4633820
zbMATH Open1421.68057MaRDI QIDQ4633820
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496787
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Randomized algorithms (68W20)
Related Items (3)
Upper bounds for time-space trade-offs in sorting and selection ⋮ Artificial Intelligence and Soft Computing - ICAISC 2004 ⋮ Linear-time in-place selection in less than 3n comparisons
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633820)
