Improved lower bounds for the cycle detection problem

Eric Allender, Maria M. Klawe

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Lower bounds for the 'cycle detection problem' were recently investigated by Fich (1981, 1983). She showed that Floyd's algorithm was optimal among those algorithms which have M = 2 memory locations and which make a finite number of 'jumps'. A lower bound for the case where M > 2 was also presented, but the question of whether having more than two memory locations could actually yield a better algorithm was left open. In this report, we show that it cannot. A lower bound was also presented by Fich (1981, 1983) for algorithms which have two memory locations and which make a finite number of 'back advances'. We show here that the same lower bound holds even if the restriction on back advances is dropped.

Original languageEnglish (US)
Pages (from-to)231-237
Number of pages7
JournalTheoretical Computer Science
Volume36
Issue numberC
DOIs
StatePublished - Jan 1 1985
Externally publishedYes

Fingerprint

Lower bound
Cycle
Data storage equipment
Jump
Restriction

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Allender, Eric ; Klawe, Maria M. / Improved lower bounds for the cycle detection problem. In: Theoretical Computer Science. 1985 ; Vol. 36, No. C. pp. 231-237.
@article{fa531661fcf4455e9336640d6b506a3c,
title = "Improved lower bounds for the cycle detection problem",
abstract = "Lower bounds for the 'cycle detection problem' were recently investigated by Fich (1981, 1983). She showed that Floyd's algorithm was optimal among those algorithms which have M = 2 memory locations and which make a finite number of 'jumps'. A lower bound for the case where M > 2 was also presented, but the question of whether having more than two memory locations could actually yield a better algorithm was left open. In this report, we show that it cannot. A lower bound was also presented by Fich (1981, 1983) for algorithms which have two memory locations and which make a finite number of 'back advances'. We show here that the same lower bound holds even if the restriction on back advances is dropped.",
author = "Eric Allender and Klawe, {Maria M.}",
year = "1985",
month = "1",
day = "1",
doi = "10.1016/0304-3975(85)90044-1",
language = "English (US)",
volume = "36",
pages = "231--237",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "C",

}

Improved lower bounds for the cycle detection problem. / Allender, Eric; Klawe, Maria M.

In: Theoretical Computer Science, Vol. 36, No. C, 01.01.1985, p. 231-237.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Improved lower bounds for the cycle detection problem

AU - Allender, Eric

AU - Klawe, Maria M.

PY - 1985/1/1

Y1 - 1985/1/1

N2 - Lower bounds for the 'cycle detection problem' were recently investigated by Fich (1981, 1983). She showed that Floyd's algorithm was optimal among those algorithms which have M = 2 memory locations and which make a finite number of 'jumps'. A lower bound for the case where M > 2 was also presented, but the question of whether having more than two memory locations could actually yield a better algorithm was left open. In this report, we show that it cannot. A lower bound was also presented by Fich (1981, 1983) for algorithms which have two memory locations and which make a finite number of 'back advances'. We show here that the same lower bound holds even if the restriction on back advances is dropped.

AB - Lower bounds for the 'cycle detection problem' were recently investigated by Fich (1981, 1983). She showed that Floyd's algorithm was optimal among those algorithms which have M = 2 memory locations and which make a finite number of 'jumps'. A lower bound for the case where M > 2 was also presented, but the question of whether having more than two memory locations could actually yield a better algorithm was left open. In this report, we show that it cannot. A lower bound was also presented by Fich (1981, 1983) for algorithms which have two memory locations and which make a finite number of 'back advances'. We show here that the same lower bound holds even if the restriction on back advances is dropped.

UR - http://www.scopus.com/inward/record.url?scp=0022050245&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022050245&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(85)90044-1

DO - 10.1016/0304-3975(85)90044-1

M3 - Article

AN - SCOPUS:0022050245

VL - 36

SP - 231

EP - 237

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - C

ER -