@InProceedings{ito_et_al:LIPIcs.FUN.2016.21,
author = {Ito, Hiro and Ueda, Takahiro},
title = {{How to Solve the Cake-Cutting Problem in Sublinear Time}},
booktitle = {8th International Conference on Fun with Algorithms (FUN 2016)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-005-7},
ISSN = {1868-8969},
year = {2016},
volume = {49},
editor = {Demaine, Erik D. and Grandoni, Fabrizio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.21},
URN = {urn:nbn:de:0030-drops-58639},
doi = {10.4230/LIPIcs.FUN.2016.21},
annote = {Keywords: sublinear-time algorithms, cake-cutting problem, simple fair, preassign, approximation}
}