scientific article; zbMATH DE number 6297801
From MaRDI portal
Publication:5417722
zbMath1288.68052MaRDI QIDQ5417722
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (9)
An exact characterization of saturation for permutation matrices ⋮ Greedy Is an Almost Optimal Deque ⋮ Better analysis of binary search tree on decomposable sequences ⋮ Incremental Voronoi diagrams ⋮ Degrees of nonlinearity in forbidden 0-1 matrix problems ⋮ Unnamed Item ⋮ Tight bounds on the maximum size of a set of permutations with bounded VC-dimension ⋮ Data structures for halfplane proximity queries and incremental Voronoi diagrams ⋮ Unnamed Item
This page was built for publication:
