English Boyer–Moore majority vote algorithm Cited by user David Eppstein on 01 Jan 2024 The Boyer–Moore majority vote algorithm is an algorithm for finding the majority of a sequence of elements using linear time and a constant number of words of memory.
English Mutilated chessboard problem Cited by user David Eppstein on 18 Jul 2022 The mutilated chessboard problem is a tiling puzzle that asks:.
English Range query (data structures) Cited by user Madaniamirali on 20 Dec 2021 In data structures, a range query consists of preprocessing some input data into a data structure to efficiently answer any number of queries on any subset of the input.
English Owen Astrachan Cited by user StarryGrandma on 01 Aug 2017 Owen Astrachan is Professor of the Practice of Computer Science at Duke University, where he is also the department's director of undergraduate studies.