Cycle detection using a stack

Gabriel Nivasch

doi:10.1016/j.ipl.2004.01.016

Cycle detection using a stack

Gabriel Nivasch

Research output: Contribution to journal › Article › peer-review

52 Scopus citations

Abstract

We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix.

Original language	English
Pages (from-to)	135-140
Number of pages	6
Journal	Information Processing Letters
Volume	90
Issue number	3
DOIs	https://doi.org/10.1016/j.ipl.2004.01.016
State	Published - 16 May 2004
Externally published	Yes

Keywords

Algorithms
Analysis of algorithms
Cycle detection
Random function
Stack
Time/memory tradeoff

Access to Document

10.1016/j.ipl.2004.01.016

Cite this

@article{aa0cf69ad53844e3ad0539fdec115fd9,

title = "Cycle detection using a stack",

abstract = "We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix.",

keywords = "Algorithms, Analysis of algorithms, Cycle detection, Random function, Stack, Time/memory tradeoff",

author = "Gabriel Nivasch",

year = "2004",

month = may,

day = "16",

doi = "10.1016/j.ipl.2004.01.016",

language = "אנגלית",

volume = "90",

pages = "135--140",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Cycle detection using a stack

AU - Nivasch, Gabriel

PY - 2004/5/16

Y1 - 2004/5/16

N2 - We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix.

AB - We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix.

KW - Algorithms

KW - Analysis of algorithms

KW - Cycle detection

KW - Random function

KW - Stack

KW - Time/memory tradeoff

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

U2 - 10.1016/j.ipl.2004.01.016

DO - 10.1016/j.ipl.2004.01.016

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:1842610602

SN - 0020-0190

VL - 90

SP - 135

EP - 140

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

Cycle detection using a stack

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this