scientific article
From MaRDI portal
Publication:2934612
zbMath1302.68142MaRDI QIDQ2934612
David P. Woodruff, Xiaoming Sun
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (7)
On the monotonicity of a data stream ⋮ Space-Efficient Algorithms for Longest Increasing Subsequence ⋮ Space-efficient algorithms for longest increasing subsequence ⋮ Estimating the Longest Increasing Sequence in Polylogarithmic Time ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fast and longest rollercoasters
This page was built for publication:
