@inproceedings{7a961a768f28490284c010f0e8ad574c,
title = "Snake in Optimal Space and Time.",
abstract = "We revisit the classic game of Snake and ask the basic data structural question: how many bits does it take to represent the state of a snake game so that it can be updated in constant time? Our main result is a data structure that uses optimal space (within constant factors). To achieve our results, we introduce several interesting data structural techniques, including a decomposition technique for the problem, a tabulation scheme for encoding small subproblems, and a dynamic memory allocation scheme.",
keywords = "Data structure, Nokia, Snake, String algorithms",
author = "Philip Bille and Mart{\'i}n Farach-Colton and G{\o}rtz, \{Inge Li\} and Hoog, \{Ivor van der\}",
note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",
year = "2024",
doi = "10.4230/LIPIcs.FUN.2024.3",
language = "Udefineret/Ukendt",
volume = "291",
pages = "3:1--3:15",
booktitle = "FUN",
}