English Geometry of binary search trees Cited by user 104.153.72.218 on 18 Sep 2017 In computer science, one approach to the dynamic optimality conjecture on online algorithms for binary search trees involves reformulating the problem geometrically, in…
Serbian Низ суфикса Cited by user Autobot on 23 Apr 2016 {| class="infobox" style="width: 22em" ! colspan="3" style="font-size: 125%; text-align: center;" | Suffix array |- ! Тип | colspan="2" | Array |- ! Смислили | colspan="2…
English Polygon covering Cited by user Erel Segal on 26 Jun 2014 A covering of a polygon is a set of primitive units (e.g. squares) whose union equals the polygon.