39 citations · 255 across the 76 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012
(Really) Tight bounds for dispatching binary methods
Pawel Gawrychowski
We consider binary dispatching problem originating from object oriented programming. We want to preprocess a hierarchy of classes and collection of methods so that given a function…
cs.DS2012★ 7 cited
Linear-Space Substring Range Counting over Polylogarithmic Alphabets
Travis Gagie, Paweł Gawrychowski
Bille and Gørtz (2011) recently introduced the problem of substring range counting, for which we are asked to store compactly a string of characters with integer labels in…