4 citations · 11 across the 8 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 1 cited
How to solve the cake-cutting problem in sublinear time
Hiro Ito, Takahiro Ueda
In this paper, we show algorithms for solving the cake-cutting problem in sublinear-time. More specifically, we preassign (simple) fair portions to o(n) players in o(n)-time, and m…
cs.DS2015
Every property is testable on a natural class of scale-free multigraphs
Hiro Ito
In this paper, we introduce a natural class of multigraphs called hierarchical-scale-free (HSF) multigraphs, and consider constant-time testability on the class. We show that a ver…