2 citations · 4 across the 11 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011
Worst-Case Optimal Priority Queues via Extended Regular Counters
Amr Elmasry, Jyrki Katajainen
We consider the classical problem of representing a collection of priority queues under the operations \Findmin{}, \Insert{}, \Decrease{}, \Meld{}, \Delete{}, and \Deletemin{}. In…
cs.DS2011
Dynamic Range Majority Data Structures
Amr Elmasry, Meng He, J. Ian Munro +1
Given a set of coloured points on the real line, we study the problem of answering range -majority (or "heavy hitter") queries on . More specifically, for a query range $…