Paper by Martin L. Demaine
- Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammadtaghi Hajiaghayi, and Tomáš Vinař, “Palindrome Recognition Using a Multidimensional Tape”, Theoretical Computer Science, volume 302, number 1–3, June 2003, pages 475–480.
The problem of palindrome recognition using a Turing machine with one
multidimensional tape is proved to require
Θ(n2/log n) time.
- This paper is also available from ScienceDirect.
- The paper is 7 pages.
- The paper is available in PostScript (80k) and gzipped PostScript (32k).
- See information on file formats.
- [Google Scholar search]
See also other papers by Martin Demaine.
These pages are generated automagically from a
Last updated November 20, 2013 by