Palindrome recognition using a multidimensional tape

  • Authors:

  • Therese Biedl;Jonathan F. Buss;Erik D. Demaine;Martin L. Demaine;Mohammadtaghi Hajiaghayi;Tomáš Vinař

  • Affiliations:

  • School of Computer Science, University of Waterloo, 200 Unieversity Avenue West, Waterloo, Ontario, Canada N2L 3G1;School of Computer Science, University of Waterloo, 200 Unieversity Avenue West, Waterloo, Ontario, Canada N2L 3G1;School of Computer Science, University of Waterloo, 200 Unieversity Avenue West, Waterloo, Ontario, Canada N2L 3G1;School of Computer Science, University of Waterloo, 200 Unieversity Avenue West, Waterloo, Ontario, Canada N2L 3G1;School of Computer Science, University of Waterloo, 200 Unieversity Avenue West, Waterloo, Ontario, Canada N2L 3G1;School of Computer Science, University of Waterloo, 200 Unieversity Avenue West, Waterloo, Ontario, Canada N2L 3G1

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 5.23

Visualization

Abstract

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