Paper by Martin L. Demaine

Reference:

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.

Abstract:

The problem of palindrome recognition using a Turing machine with one multidimensional tape is proved to require Θ(n²/log n) time.

Comments:

This paper is also available from ScienceDirect.

Length:

The paper is 7 pages.

Availability:

The paper is available in PostScript (80k), gzipped PostScript (32k), and PDF (123k).

See information on file formats.

[Google Scholar search]