scientific article; zbMATH DE number 7051218
From MaRDI portal
Publication:4633860
zbMath1409.68305MaRDI QIDQ4633860
Daniel M. Kane, Mihai Pǎtraşcu, John Iacono, Erik D. Demaine, Dion Harmon
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496825
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
On minimum generalized Manhattan connections ⋮ Greedy Is an Almost Optimal Deque ⋮ Arboral satisfaction: recognition and LP approximation ⋮ A study on splay trees ⋮ Better analysis of binary search tree on decomposable sequences ⋮ Demand-aware network designs of bounded degree ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ On the diameter of tree associahedra ⋮ Belga B-trees ⋮ Multi-Finger Binary Search Trees ⋮ Diameter estimates for graph associahedra ⋮ Competitive Online Search Trees on Trees
This page was built for publication:
