Publication:5417722
From MaRDI portal
zbMath1288.68052MaRDI QIDQ5417722
Publication date: 22 May 2014
68W40: Analysis of algorithms
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68P05: Data structures
Related Items
Unnamed Item, Unnamed Item, An exact characterization of saturation for permutation matrices, Degrees of nonlinearity in forbidden 0-1 matrix problems, Tight bounds on the maximum size of a set of permutations with bounded VC-dimension, Incremental Voronoi diagrams, Data structures for halfplane proximity queries and incremental Voronoi diagrams, Better analysis of binary search tree on decomposable sequences, Greedy Is an Almost Optimal Deque