How to Solve the Cake-Cutting Problem in Sublinear Time

Hiro Ito, Takahiro Ueda. How to Solve the Cake-Cutting Problem in Sublinear Time. In Erik D. Demaine, Fabrizio Grandoni, editors, 8th International Conference on Fun with Algorithms, FUN 2016, June 8-10, 2016, La Maddalena, Italy. Volume 49 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

@inproceedings{ItoU16,
  title = {How to Solve the Cake-Cutting Problem in Sublinear Time},
  author = {Hiro Ito and Takahiro Ueda},
  year = {2016},
  doi = {10.4230/LIPIcs.FUN.2016.21},
  url = {http://dx.doi.org/10.4230/LIPIcs.FUN.2016.21},
  researchr = {https://researchr.org/publication/ItoU16},
  cites = {0},
  citedby = {0},
  booktitle = {8th International Conference on Fun with Algorithms, FUN 2016, June 8-10, 2016, La Maddalena, Italy},
  editor = {Erik D. Demaine and Fabrizio Grandoni},
  volume = {49},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-005-7},
}